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)
 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 and not in oobs map.
1331  * Entries may get added multiple times.
1332  */
1333 static void
1334 add_obsoletes(Solver *solv, Id p, Queue *q)
1335 {
1336   Pool *pool = solv->pool;
1337   Repo *installed = solv->installed;
1338   Id p2, pp2;
1339   Solvable *s = pool->solvables + p;
1340   Id obs, *obsp;
1341   Id lastp2 = 0;
1342
1343   /* we already know: p is not installed, p is not noobs */
1344   FOR_PROVIDES(p2, pp2, s->name)
1345     {
1346       Solvable *ps = pool->solvables + p2;
1347       if (ps->repo != installed)
1348         continue;
1349       if (!pool->implicitobsoleteusesprovides && ps->name != s->name)
1350         continue;
1351       if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1352         continue;
1353       queue_push(q, p2);
1354       lastp2 = p2;
1355     }
1356   if (!s->obsoletes)
1357     return;
1358   obsp = s->repo->idarraydata + s->obsoletes;
1359   while ((obs = *obsp++) != 0)
1360     FOR_PROVIDES(p2, pp2, obs)
1361       {
1362         Solvable *ps = pool->solvables + p2;
1363         if (ps->repo != installed)
1364           continue;
1365         if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, ps, obs))
1366           continue;
1367         if (pool->obsoleteusescolors && !pool_colormatch(pool, s, ps))
1368           continue;
1369         if (p2 == lastp2)
1370           continue;
1371         queue_push(q, p2);
1372         lastp2 = p2;
1373       }
1374 }
1375
1376 /*
1377  * Call add_obsoletes and intersect the result with the
1378  * elements in Queue q starting at qstart.
1379  * Assumes that it's the first call if qstart == q->count.
1380  * May use auxillary map m for the intersection process, all
1381  * elements of q starting at qstart must have their bit cleared.
1382  * (This is also true after the function returns.)
1383  */
1384 static void
1385 intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
1386 {
1387   int i, j;
1388   int qcount = q->count;
1389
1390   add_obsoletes(solv, p, q);
1391   if (qcount == qstart)
1392     return;     /* first call */
1393   if (qcount == q->count)
1394     j = qstart;
1395   else if (qcount == qstart + 1)
1396     {
1397       /* easy if there's just one element */
1398       j = qstart;
1399       for (i = qcount; i < q->count; i++)
1400         if (q->elements[i] == q->elements[qstart])
1401           {
1402             j++;        /* keep the element */
1403             break;
1404           }
1405     }
1406   else if (!m->size && q->count - qstart <= 8)
1407     {
1408       /* faster than a map most of the time */
1409       int k;
1410       for (i = j = qstart; i < qcount; i++)
1411         {
1412           Id ip = q->elements[i];
1413           for (k = qcount; k < q->count; k++)
1414             if (q->elements[k] == ip)
1415               {
1416                 q->elements[j++] = ip;
1417                 break;
1418               }
1419         }
1420     }
1421   else
1422     {
1423       /* for the really pathologic cases we use the map */
1424       Repo *installed = solv->installed;
1425       if (!m->size)
1426         map_init(m, installed->end - installed->start);
1427       for (i = qcount; i < q->count; i++)
1428         MAPSET(m, q->elements[i] - installed->start);
1429       for (i = j = qstart; i < qcount; i++)
1430         if (MAPTST(m, q->elements[i] - installed->start))
1431           {
1432             MAPCLR(m, q->elements[i] - installed->start);
1433             q->elements[j++] = q->elements[i];
1434           }
1435     }
1436   queue_truncate(q, j);
1437 }
1438
1439 static void
1440 jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
1441 {
1442   Pool *pool = solv->pool;
1443   Id select, p, pp;
1444   Repo *installed;
1445   Solvable *s;
1446   int i, j, set, qstart;
1447   Map omap;
1448
1449   installed = solv->installed;
1450   select = how & SOLVER_SELECTMASK;
1451   switch (how & SOLVER_JOBMASK)
1452     {
1453     case SOLVER_INSTALL:
1454       set = how & SOLVER_SETMASK;
1455       if (!(set & SOLVER_NOAUTOSET))
1456         {
1457           /* automatically add set bits by analysing the job */
1458           if (select == SOLVER_SOLVABLE_NAME)
1459             set |= SOLVER_SETNAME;
1460           if (select == SOLVER_SOLVABLE)
1461             set |= SOLVER_SETNAME | SOLVER_SETARCH | SOLVER_SETVENDOR | SOLVER_SETREPO | SOLVER_SETEVR;
1462           else if ((select == SOLVER_SOLVABLE_NAME || select == SOLVER_SOLVABLE_PROVIDES) && ISRELDEP(what))
1463             {
1464               Reldep *rd = GETRELDEP(pool, what);
1465               if (rd->flags == REL_EQ && select == SOLVER_SOLVABLE_NAME)
1466                 {
1467 #if !defined(DEBIAN_SEMANTICS)
1468                   const char *evr = pool_id2str(pool, rd->evr);
1469                   if (strchr(evr, '-'))
1470                     set |= SOLVER_SETEVR;
1471                   else
1472                     set |= SOLVER_SETEV;
1473 #else
1474                   set |= SOLVER_SETEVR;
1475 #endif
1476                 }
1477               if (rd->flags <= 7 && ISRELDEP(rd->name))
1478                 rd = GETRELDEP(pool, rd->name);
1479               if (rd->flags == REL_ARCH)
1480                 set |= SOLVER_SETARCH;
1481             }
1482         }
1483       else
1484         set &= ~SOLVER_NOAUTOSET;
1485       if (!set)
1486         return;
1487       if ((set & SOLVER_SETARCH) != 0 && solv->infarchrules != solv->infarchrules_end)
1488         {
1489           if (select == SOLVER_SOLVABLE)
1490             queue_push2(q, DISABLE_INFARCH, pool->solvables[what].name);
1491           else
1492             {
1493               int qcnt = q->count;
1494               FOR_JOB_SELECT(p, pp, select, what)
1495                 {
1496                   s = pool->solvables + p;
1497                   /* unify names */
1498                   for (i = qcnt; i < q->count; i += 2)
1499                     if (q->elements[i + 1] == s->name)
1500                       break;
1501                   if (i < q->count)
1502                     continue;
1503                   queue_push2(q, DISABLE_INFARCH, s->name);
1504                 }
1505             }
1506         }
1507       if ((set & SOLVER_SETREPO) != 0 && solv->duprules != solv->duprules_end)
1508         {
1509           if (select == SOLVER_SOLVABLE)
1510             queue_push2(q, DISABLE_DUP, pool->solvables[what].name);
1511           else
1512             {
1513               int qcnt = q->count;
1514               FOR_JOB_SELECT(p, pp, select, what)
1515                 {
1516                   s = pool->solvables + p;
1517                   /* unify names */
1518                   for (i = qcnt; i < q->count; i += 2)
1519                     if (q->elements[i + 1] == s->name)
1520                       break;
1521                   if (i < q->count)
1522                     continue;
1523                   queue_push2(q, DISABLE_DUP, s->name);
1524                 }
1525             }
1526         }
1527       if (!installed || installed->end == installed->start)
1528         return;
1529       /* now the hard part: disable some update rules */
1530
1531       /* first check if we have noobs or installed packages in the job */
1532       i = j = 0;
1533       FOR_JOB_SELECT(p, pp, select, what)
1534         {
1535           if (pool->solvables[p].repo == installed)
1536             j = p;
1537           else if (solv->noobsoletes.size && MAPTST(&solv->noobsoletes, p))
1538             return;
1539           i++;
1540         }
1541       if (j)    /* have installed packages */
1542         {
1543           /* this is for dupmap_all jobs, it can go away if we create
1544            * duprules for them */
1545           if (i == 1 && (set & SOLVER_SETREPO) != 0)
1546             queue_push2(q, DISABLE_UPDATE, j);
1547           return;
1548         }
1549
1550       omap.size = 0;
1551       qstart = q->count;
1552       FOR_JOB_SELECT(p, pp, select, what)
1553         {
1554           intersect_obsoletes(solv, p, q, qstart, &omap);
1555           if (q->count == qstart)
1556             break;
1557         }
1558       if (omap.size)
1559         map_free(&omap);
1560
1561       if (qstart == q->count)
1562         return;         /* nothing to prune */
1563
1564       /* convert result to (DISABLE_UPDATE, p) pairs */
1565       i = q->count;
1566       for (j = qstart; j < i; j++)
1567         queue_push(q, q->elements[j]);
1568       for (j = qstart; j < q->count; j += 2)
1569         {
1570           q->elements[j] = DISABLE_UPDATE;
1571           q->elements[j + 1] = q->elements[i++];
1572         }
1573
1574       /* now that we know which installed packages are obsoleted check each of them */
1575       if ((set & (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR)) == (SOLVER_SETEVR | SOLVER_SETARCH | SOLVER_SETVENDOR))
1576         return;         /* all is set, nothing to do */
1577
1578       for (i = j = qstart; i < q->count; i += 2)
1579         {
1580           Solvable *is = pool->solvables + q->elements[i + 1];
1581           FOR_JOB_SELECT(p, pp, select, what)
1582             {
1583               int illegal = 0;
1584               s = pool->solvables + p;
1585               if ((set & SOLVER_SETEVR) != 0)
1586                 illegal |= POLICY_ILLEGAL_DOWNGRADE;    /* ignore */
1587               if ((set & SOLVER_SETNAME) != 0)
1588                 illegal |= POLICY_ILLEGAL_NAMECHANGE;   /* ignore */
1589               if ((set & SOLVER_SETARCH) != 0)
1590                 illegal |= POLICY_ILLEGAL_ARCHCHANGE;   /* ignore */
1591               if ((set & SOLVER_SETVENDOR) != 0)
1592                 illegal |= POLICY_ILLEGAL_VENDORCHANGE; /* ignore */
1593               illegal = policy_is_illegal(solv, is, s, illegal);
1594               if (illegal && illegal == POLICY_ILLEGAL_DOWNGRADE && (set & SOLVER_SETEV) != 0)
1595                 {
1596                   /* it's ok if the EV is different */
1597                   if (pool_evrcmp(pool, is->evr, s->evr, EVRCMP_COMPARE_EVONLY) != 0)
1598                     illegal = 0;
1599                 }
1600               if (illegal)
1601                 break;
1602             }
1603           if (!p)
1604             {
1605               /* no package conflicts with the update rule */
1606               /* thus keep the DISABLE_UPDATE */
1607               q->elements[j + 1] = q->elements[i + 1];
1608               j += 2;
1609             }
1610         }
1611       queue_truncate(q, j);
1612       return;
1613
1614     case SOLVER_ERASE:
1615       if (!installed)
1616         break;
1617       FOR_JOB_SELECT(p, pp, select, what)
1618         if (pool->solvables[p].repo == installed)
1619           queue_push2(q, DISABLE_UPDATE, p);
1620       return;
1621     default:
1622       return;
1623     }
1624 }
1625
1626 /* disable all policy rules that are in conflict with our job list */
1627 void
1628 solver_disablepolicyrules(Solver *solv)
1629 {
1630   Queue *job = &solv->job;
1631   int i, j;
1632   Queue allq;
1633   Rule *r;
1634   Id lastjob = -1;
1635   Id allqbuf[128];
1636
1637   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1638
1639   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1640     {
1641       r = solv->rules + i;
1642       if (r->d < 0)     /* disabled? */
1643         continue;
1644       j = solv->ruletojob.elements[i - solv->jobrules];
1645       if (j == lastjob)
1646         continue;
1647       lastjob = j;
1648       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1649     }
1650   if (solv->cleandepsmap.size)
1651     {
1652       solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1653       for (i = solv->installed->start; i < solv->installed->end; i++)
1654         if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1655           queue_push2(&allq, DISABLE_UPDATE, i);
1656     }
1657   MAPZERO(&solv->noupdate);
1658   for (i = 0; i < allq.count; i += 2)
1659     {
1660       Id type = allq.elements[i], arg = allq.elements[i + 1];
1661       switch(type)
1662         {
1663         case DISABLE_UPDATE:
1664           disableupdaterule(solv, arg);
1665           break;
1666         case DISABLE_INFARCH:
1667           disableinfarchrule(solv, arg);
1668           break;
1669         case DISABLE_DUP:
1670           disableduprule(solv, arg);
1671           break;
1672         default:
1673           break;
1674         }
1675     }
1676   queue_free(&allq);
1677 }
1678
1679 /* we just disabled job #jobidx, now reenable all policy rules that were
1680  * disabled because of this job */
1681 void
1682 solver_reenablepolicyrules(Solver *solv, int jobidx)
1683 {
1684   Queue *job = &solv->job;
1685   int i, j;
1686   Queue q, allq;
1687   Rule *r;
1688   Id lastjob = -1;
1689   Id qbuf[32], allqbuf[128];
1690
1691   queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
1692   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1693   jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q);
1694   if (!q.count)
1695     return;
1696   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1697     {
1698       r = solv->rules + i;
1699       if (r->d < 0)     /* disabled? */
1700         continue;
1701       j = solv->ruletojob.elements[i - solv->jobrules];
1702       if (j == lastjob)
1703         continue;
1704       lastjob = j;
1705       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1706     }
1707   if (solv->cleandepsmap.size)
1708     {
1709       solver_createcleandepsmap(solv, &solv->cleandepsmap, 0);
1710       for (i = solv->installed->start; i < solv->installed->end; i++)
1711         if (MAPTST(&solv->cleandepsmap, i - solv->installed->start))
1712           queue_push2(&allq, DISABLE_UPDATE, i);
1713     }
1714   for (j = 0; j < q.count; j += 2)
1715     {
1716       Id type = q.elements[j], arg = q.elements[j + 1];
1717       for (i = 0; i < allq.count; i += 2)
1718         if (allq.elements[i] == type && allq.elements[i + 1] == arg)
1719           break;
1720       if (i < allq.count)
1721         continue;       /* still disabled */
1722       switch(type)
1723         {
1724         case DISABLE_UPDATE:
1725           reenableupdaterule(solv, arg);
1726           break;
1727         case DISABLE_INFARCH:
1728           reenableinfarchrule(solv, arg);
1729           break;
1730         case DISABLE_DUP:
1731           reenableduprule(solv, arg);
1732           break;
1733         }
1734     }
1735   queue_free(&allq);
1736   queue_free(&q);
1737 }
1738
1739 /* we just removed a package from the cleandeps map, now reenable all policy rules that were
1740  * disabled because of this */
1741 void
1742 solver_reenablepolicyrules_cleandeps(Solver *solv, Id pkg)
1743 {
1744   Queue *job = &solv->job;
1745   int i, j;
1746   Queue allq;
1747   Rule *r;
1748   Id lastjob = -1;
1749   Id allqbuf[128];
1750
1751   queue_init_buffer(&allq, allqbuf, sizeof(allqbuf)/sizeof(*allqbuf));
1752   for (i = solv->jobrules; i < solv->jobrules_end; i++)
1753     {
1754       r = solv->rules + i;
1755       if (r->d < 0)     /* disabled? */
1756         continue;
1757       j = solv->ruletojob.elements[i - solv->jobrules];
1758       if (j == lastjob)
1759         continue;
1760       lastjob = j;
1761       jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq);
1762     }
1763   for (i = 0; i < allq.count; i += 2)
1764     if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg)
1765       break;
1766   if (i == allq.count)
1767     reenableupdaterule(solv, pkg);
1768   queue_free(&allq);
1769 }
1770
1771
1772 /***********************************************************************
1773  ***
1774  ***  Rule info part, tell the user what the rule is about.
1775  ***
1776  ***/
1777
1778 static void
1779 addrpmruleinfo(Solver *solv, Id p, Id d, int type, Id dep)
1780 {
1781   Pool *pool = solv->pool;
1782   Rule *r;
1783   Id w2, op, od, ow2;
1784
1785   /* check if this creates the rule we're searching for */
1786   r = solv->rules + solv->ruleinfoq->elements[0];
1787   op = r->p;
1788   od = r->d < 0 ? -r->d - 1 : r->d;
1789   ow2 = 0;
1790
1791   /* normalize */
1792   w2 = d > 0 ? 0 : d;
1793   if (p < 0 && d > 0 && (!pool->whatprovidesdata[d] || !pool->whatprovidesdata[d + 1]))
1794     {
1795       w2 = pool->whatprovidesdata[d];
1796       d = 0;
1797
1798     }
1799   if (p > 0 && d < 0)           /* this hack is used for buddy deps */
1800     {
1801       w2 = p;
1802       p = d;
1803     }
1804
1805   if (d > 0)
1806     {
1807       if (p != op && !od)
1808         return;
1809       if (d != od)
1810         {
1811           Id *dp = pool->whatprovidesdata + d;
1812           Id *odp = pool->whatprovidesdata + od;
1813           while (*dp)
1814             if (*dp++ != *odp++)
1815               return;
1816           if (*odp)
1817             return;
1818         }
1819       w2 = 0;
1820       /* handle multiversion conflict rules */
1821       if (p < 0 && pool->whatprovidesdata[d] < 0)
1822         {
1823           w2 = pool->whatprovidesdata[d];
1824           /* XXX: free memory */
1825         }
1826     }
1827   else
1828     {
1829       if (od)
1830         return;
1831       ow2 = r->w2;
1832       if (p > w2)
1833         {
1834           if (w2 != op || p != ow2)
1835             return;
1836         }
1837       else
1838         {
1839           if (p != op || w2 != ow2)
1840             return;
1841         }
1842     }
1843   /* yep, rule matches. record info */
1844   queue_push(solv->ruleinfoq, type);
1845   if (type == SOLVER_RULE_RPM_SAME_NAME)
1846     {
1847       /* we normalize same name order */
1848       queue_push(solv->ruleinfoq, op < 0 ? -op : 0);
1849       queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);
1850     }
1851   else
1852     {
1853       queue_push(solv->ruleinfoq, p < 0 ? -p : 0);
1854       queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);
1855     }
1856   queue_push(solv->ruleinfoq, dep);
1857 }
1858
1859 static int
1860 solver_allruleinfos_cmp(const void *ap, const void *bp, void *dp)
1861 {
1862   const Id *a = ap, *b = bp;
1863   int r;
1864
1865   r = a[0] - b[0];
1866   if (r)
1867     return r;
1868   r = a[1] - b[1];
1869   if (r)
1870     return r;
1871   r = a[2] - b[2];
1872   if (r)
1873     return r;
1874   r = a[3] - b[3];
1875   if (r)
1876     return r;
1877   return 0;
1878 }
1879
1880 int
1881 solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
1882 {
1883   Pool *pool = solv->pool;
1884   Rule *r = solv->rules + rid;
1885   int i, j;
1886
1887   queue_empty(rq);
1888   if (rid <= 0 || rid >= solv->rpmrules_end)
1889     {
1890       Id type, from, to, dep;
1891       type = solver_ruleinfo(solv, rid, &from, &to, &dep);
1892       queue_push(rq, type);
1893       queue_push(rq, from);
1894       queue_push(rq, to);
1895       queue_push(rq, dep);
1896       return 1;
1897     }
1898   if (r->p >= 0)
1899     return 0;
1900   queue_push(rq, rid);
1901   solv->ruleinfoq = rq;
1902   solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1903   /* also try reverse direction for conflicts */
1904   if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1905     solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1906   solv->ruleinfoq = 0;
1907   queue_shift(rq);
1908   /* now sort & unify em */
1909   if (!rq->count)
1910     return 0;
1911   solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0);
1912   /* throw out identical entries */
1913   for (i = j = 0; i < rq->count; i += 4)
1914     {
1915       if (j)
1916         {
1917           if (rq->elements[i] == rq->elements[j - 4] &&
1918               rq->elements[i + 1] == rq->elements[j - 3] &&
1919               rq->elements[i + 2] == rq->elements[j - 2] &&
1920               rq->elements[i + 3] == rq->elements[j - 1])
1921             continue;
1922         }
1923       rq->elements[j++] = rq->elements[i];
1924       rq->elements[j++] = rq->elements[i + 1];
1925       rq->elements[j++] = rq->elements[i + 2];
1926       rq->elements[j++] = rq->elements[i + 3];
1927     }
1928   rq->count = j;
1929   return j / 4;
1930 }
1931
1932 SolverRuleinfo
1933 solver_ruleinfo(Solver *solv, Id rid, Id *fromp, Id *top, Id *depp)
1934 {
1935   Pool *pool = solv->pool;
1936   Rule *r = solv->rules + rid;
1937   SolverRuleinfo type = SOLVER_RULE_UNKNOWN;
1938
1939   if (fromp)
1940     *fromp = 0;
1941   if (top)
1942     *top = 0;
1943   if (depp)
1944     *depp = 0;
1945   if (rid > 0 && rid < solv->rpmrules_end)
1946     {
1947       Queue rq;
1948       int i;
1949
1950       if (r->p >= 0)
1951         return SOLVER_RULE_RPM;
1952       if (fromp)
1953         *fromp = -r->p;
1954       queue_init(&rq);
1955       queue_push(&rq, rid);
1956       solv->ruleinfoq = &rq;
1957       solver_addrpmrulesforsolvable(solv, pool->solvables - r->p, 0);
1958       /* also try reverse direction for conflicts */
1959       if ((r->d == 0 || r->d == -1) && r->w2 < 0)
1960         solver_addrpmrulesforsolvable(solv, pool->solvables - r->w2, 0);
1961       solv->ruleinfoq = 0;
1962       type = SOLVER_RULE_RPM;
1963       for (i = 1; i < rq.count; i += 4)
1964         {
1965           Id qt, qo, qp, qd;
1966           qt = rq.elements[i];
1967           qp = rq.elements[i + 1];
1968           qo = rq.elements[i + 2];
1969           qd = rq.elements[i + 3];
1970           if (type == SOLVER_RULE_RPM || type > qt)
1971             {
1972               type = qt;
1973               if (fromp)
1974                 *fromp = qp;
1975               if (top)
1976                 *top = qo;
1977               if (depp)
1978                 *depp = qd;
1979             }
1980         }
1981       queue_free(&rq);
1982       return type;
1983     }
1984   if (rid >= solv->jobrules && rid < solv->jobrules_end)
1985     {
1986       Id jidx = solv->ruletojob.elements[rid - solv->jobrules];
1987       if (fromp)
1988         *fromp = jidx;
1989       if (top)
1990         *top = solv->job.elements[jidx];
1991       if (depp)
1992         *depp = solv->job.elements[jidx + 1];
1993       if ((r->d == 0 || r->d == -1) && r->w2 == 0 && r->p == -SYSTEMSOLVABLE && (solv->job.elements[jidx] & SOLVER_SELECTMASK) != SOLVER_SOLVABLE_ONE_OF)
1994         return SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1995       return SOLVER_RULE_JOB;
1996     }
1997   if (rid >= solv->updaterules && rid < solv->updaterules_end)
1998     {
1999       if (fromp)
2000         *fromp = solv->installed->start + (rid - solv->updaterules);
2001       return SOLVER_RULE_UPDATE;
2002     }
2003   if (rid >= solv->featurerules && rid < solv->featurerules_end)
2004     {
2005       if (fromp)
2006         *fromp = solv->installed->start + (rid - solv->featurerules);
2007       return SOLVER_RULE_FEATURE;
2008     }
2009   if (rid >= solv->duprules && rid < solv->duprules_end)
2010     {
2011       if (fromp)
2012         *fromp = -r->p;
2013       if (depp)
2014         *depp = pool->solvables[-r->p].name;
2015       return SOLVER_RULE_DISTUPGRADE;
2016     }
2017   if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2018     {
2019       if (fromp)
2020         *fromp = -r->p;
2021       if (depp)
2022         *depp = pool->solvables[-r->p].name;
2023       return SOLVER_RULE_INFARCH;
2024     }
2025   if (rid >= solv->choicerules && rid < solv->choicerules_end)
2026     {
2027       return SOLVER_RULE_CHOICE;
2028     }
2029   if (rid >= solv->learntrules)
2030     {
2031       return SOLVER_RULE_LEARNT;
2032     }
2033   return SOLVER_RULE_UNKNOWN;
2034 }
2035
2036 SolverRuleinfo
2037 solver_ruleclass(Solver *solv, Id rid)
2038 {
2039   if (rid <= 0)
2040     return SOLVER_RULE_UNKNOWN;
2041   if (rid > 0 && rid < solv->rpmrules_end)
2042     return SOLVER_RULE_RPM;
2043   if (rid >= solv->jobrules && rid < solv->jobrules_end)
2044     return SOLVER_RULE_JOB;
2045   if (rid >= solv->updaterules && rid < solv->updaterules_end)
2046     return SOLVER_RULE_UPDATE;
2047   if (rid >= solv->featurerules && rid < solv->featurerules_end)
2048     return SOLVER_RULE_FEATURE;
2049   if (rid >= solv->duprules && rid < solv->duprules_end)
2050     return SOLVER_RULE_DISTUPGRADE;
2051   if (rid >= solv->infarchrules && rid < solv->infarchrules_end)
2052     return SOLVER_RULE_INFARCH;
2053   if (rid >= solv->choicerules && rid < solv->choicerules_end)
2054     return SOLVER_RULE_CHOICE;
2055   if (rid >= solv->learntrules)
2056     return SOLVER_RULE_LEARNT;
2057   return SOLVER_RULE_UNKNOWN;
2058 }
2059
2060 void
2061 solver_ruleliterals(Solver *solv, Id rid, Queue *q)
2062 {
2063   Pool *pool = solv->pool;
2064   Id p, *pp;
2065   Rule *r;
2066
2067   queue_empty(q);
2068   r = solv->rules + rid;
2069   FOR_RULELITERALS(p, pp, r)
2070     if (p != -SYSTEMSOLVABLE)
2071       queue_push(q, p);
2072   if (!q->count)
2073     queue_push(q, -SYSTEMSOLVABLE);     /* hmm, better to return an empty result? */
2074 }
2075
2076 int
2077 solver_rule2jobidx(Solver *solv, Id rid)
2078 {
2079   if (rid < solv->jobrules || rid >= solv->jobrules_end)
2080     return 0;
2081   return solv->ruletojob.elements[rid - solv->jobrules] + 1;
2082 }
2083
2084 Id
2085 solver_rule2job(Solver *solv, Id rid, Id *whatp)
2086 {
2087   int idx;
2088   if (rid < solv->jobrules || rid >= solv->jobrules_end)
2089     {
2090       if (whatp)
2091         *whatp = 0;
2092       return 0;
2093     }
2094   idx = solv->ruletojob.elements[rid - solv->jobrules];
2095   if (whatp)
2096     *whatp = solv->job.elements[idx + 1];
2097   return solv->job.elements[idx];
2098 }
2099
2100 void
2101 solver_addchoicerules(Solver *solv)
2102 {
2103   Pool *pool = solv->pool;
2104   Map m, mneg;
2105   Rule *r;
2106   Queue q, qi;
2107   int i, j, rid, havechoice;
2108   Id p, d, *pp;
2109   Id p2, pp2;
2110   Solvable *s, *s2;
2111
2112   solv->choicerules = solv->nrules;
2113   if (!pool->installed)
2114     {
2115       solv->choicerules_end = solv->nrules;
2116       return;
2117     }
2118   solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id));
2119   queue_init(&q);
2120   queue_init(&qi);
2121   map_init(&m, pool->nsolvables);
2122   map_init(&mneg, pool->nsolvables);
2123   /* set up negative assertion map from infarch and dup rules */
2124   for (rid = solv->infarchrules, r = solv->rules + rid; rid < solv->infarchrules_end; rid++, r++)
2125     if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2126       MAPSET(&mneg, -r->p);
2127   for (rid = solv->duprules, r = solv->rules + rid; rid < solv->duprules_end; rid++, r++)
2128     if (r->p < 0 && !r->w2 && (r->d == 0 || r->d == -1))
2129       MAPSET(&mneg, -r->p);
2130   for (rid = 1; rid < solv->rpmrules_end ; rid++)
2131     {
2132       r = solv->rules + rid;
2133       if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 < 0))
2134         continue;       /* only look at requires rules */
2135       /* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
2136       queue_empty(&q);
2137       queue_empty(&qi);
2138       havechoice = 0;
2139       FOR_RULELITERALS(p, pp, r)
2140         {
2141           if (p < 0)
2142             continue;
2143           s = pool->solvables + p;
2144           if (!s->repo)
2145             continue;
2146           if (s->repo == pool->installed)
2147             {
2148               queue_push(&q, p);
2149               continue;
2150             }
2151           /* check if this package is "blocked" by a installed package */
2152           s2 = 0;
2153           FOR_PROVIDES(p2, pp2, s->name)
2154             {
2155               s2 = pool->solvables + p2;
2156               if (s2->repo != pool->installed)
2157                 continue;
2158               if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2159                 continue;
2160               if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2161                 continue;
2162               break;
2163             }
2164           if (p2)
2165             {
2166               /* found installed package p2 that we can update to p */
2167               if (MAPTST(&mneg, p))
2168                 continue;
2169               if (policy_is_illegal(solv, s2, s, 0))
2170                 continue;
2171               queue_push(&qi, p2);
2172               queue_push(&q, p);
2173               continue;
2174             }
2175           if (s->obsoletes)
2176             {
2177               Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2178               s2 = 0;
2179               while ((obs = *obsp++) != 0)
2180                 {
2181                   FOR_PROVIDES(p2, pp2, obs)
2182                     {
2183                       s2 = pool->solvables + p2;
2184                       if (s2->repo != pool->installed)
2185                         continue;
2186                       if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, pool->solvables + p2, obs))
2187                         continue;
2188                       if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2189                         continue;
2190                       break;
2191                     }
2192                   if (p2)
2193                     break;
2194                 }
2195               if (obs)
2196                 {
2197                   /* found installed package p2 that we can update to p */
2198                   if (MAPTST(&mneg, p))
2199                     continue;
2200                   if (policy_is_illegal(solv, s2, s, 0))
2201                     continue;
2202                   queue_push(&qi, p2);
2203                   queue_push(&q, p);
2204                   continue;
2205                 }
2206             }
2207           /* package p is independent of the installed ones */
2208           havechoice = 1;
2209         }
2210       if (!havechoice || !q.count)
2211         continue;       /* no choice */
2212
2213       /* now check the update rules of the installed package.
2214        * if all packages of the update rules are contained in
2215        * the dependency rules, there's no need to set up the choice rule */
2216       map_empty(&m);
2217       FOR_RULELITERALS(p, pp, r)
2218         if (p > 0)
2219           MAPSET(&m, p);
2220       for (i = 0; i < qi.count; i++)
2221         {
2222           Rule *ur;
2223           if (!qi.elements[i])
2224             continue;
2225           ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start);
2226           if (!ur->p)
2227             ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start);
2228           if (!ur->p)
2229             continue;
2230           FOR_RULELITERALS(p, pp, ur)
2231             if (!MAPTST(&m, p))
2232               break;
2233           if (p)
2234             break;
2235           for (j = i + 1; j < qi.count; j++)
2236             if (qi.elements[i] == qi.elements[j])
2237               qi.elements[j] = 0;
2238         }
2239       if (i == qi.count)
2240         {
2241 #if 0
2242           printf("skipping choice ");
2243           solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2244 #endif
2245           continue;
2246         }
2247       d = q.count ? pool_queuetowhatprovides(pool, &q) : 0;
2248       solver_addrule(solv, r->p, d);
2249       queue_push(&solv->weakruleq, solv->nrules - 1);
2250       solv->choicerules_ref[solv->nrules - 1 - solv->choicerules] = rid;
2251 #if 0
2252       printf("OLD ");
2253       solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + rid);
2254       printf("WEAK CHOICE ");
2255       solver_printrule(solv, SOLV_DEBUG_RESULT, solv->rules + solv->nrules - 1);
2256 #endif
2257     }
2258   queue_free(&q);
2259   queue_free(&qi);
2260   map_free(&m);
2261   map_free(&mneg);
2262   solv->choicerules_end = solv->nrules;
2263 }
2264
2265 /* called when a choice rule is disabled by analyze_unsolvable. We also
2266  * have to disable all other choice rules so that the best packages get
2267  * picked */
2268 void
2269 solver_disablechoicerules(Solver *solv, Rule *r)
2270 {
2271   Id rid, p, *pp;
2272   Pool *pool = solv->pool;
2273   Map m;
2274   Rule *or;
2275
2276   or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2277   map_init(&m, pool->nsolvables);
2278   FOR_RULELITERALS(p, pp, or)
2279     if (p > 0)
2280       MAPSET(&m, p);
2281   FOR_RULELITERALS(p, pp, r)
2282     if (p > 0)
2283       MAPCLR(&m, p);
2284   for (rid = solv->choicerules; rid < solv->choicerules_end; rid++)
2285     {
2286       r = solv->rules + rid;
2287       if (r->d < 0)
2288         continue;
2289       or = solv->rules + solv->choicerules_ref[(r - solv->rules) - solv->choicerules];
2290       FOR_RULELITERALS(p, pp, or)
2291         if (p > 0 && MAPTST(&m, p))
2292           break;
2293       if (p)
2294         solver_disablerule(solv, r);
2295     }
2296 }
2297
2298 #undef CLEANDEPSDEBUG
2299
2300 /*
2301  * This functions collects all packages that are looked at
2302  * when a dependency is checked. We need it to "pin" installed
2303  * packages when removing a supplemented package in createcleandepsmap.
2304  * Here's an not uncommon example:
2305  *   A contains "Supplements: packageand(B, C)"
2306  *   B contains "Requires: A"
2307  * Now if we remove C, the supplements is no longer true,
2308  * thus we also remove A. Without the dep_pkgcheck function, we
2309  * would now also remove B, but this is wrong, as adding back
2310  * C doesn't make the supplements true again. Thus we "pin" B
2311  * when we remove A.
2312  * There's probably a better way to do this, but I haven't come
2313  * up with it yet ;)
2314  */
2315 static inline void
2316 dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
2317 {
2318   Pool *pool = solv->pool;
2319   Id p, pp;
2320
2321   if (ISRELDEP(dep))
2322     {
2323       Reldep *rd = GETRELDEP(pool, dep);
2324       if (rd->flags >= 8)
2325         {
2326           if (rd->flags == REL_AND)
2327             {
2328               dep_pkgcheck(solv, rd->name, m, q);
2329               dep_pkgcheck(solv, rd->evr, m, q);
2330               return;
2331             }
2332           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
2333             return;
2334           if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
2335             return;
2336         }
2337     }
2338   FOR_PROVIDES(p, pp, dep)
2339     if (!m || MAPTST(m, p))
2340       queue_push(q, p);
2341 }
2342
2343 /*
2344  * Find all installed packages that are no longer
2345  * needed regarding the current solver job.
2346  *
2347  * The algorithm is:
2348  * - remove pass: remove all packages that could have
2349  *   been dragged in by the obsoleted packages.
2350  *   i.e. if package A is obsolete and contains "Requires: B",
2351  *   also remove B, as installing A will have pulled in B.
2352  *   after this pass, we have a set of still installed packages
2353  *   with broken dependencies.
2354  * - add back pass:
2355  *   now add back all packages that the still installed packages
2356  *   require.
2357  *
2358  * The cleandeps packages are the packages removed in the first
2359  * pass and not added back in the second pass.
2360  *
2361  * If we search for unneeded packages (unneeded is true), we
2362  * simply remove all packages except the userinstalled ones in
2363  * the first pass.
2364  */
2365 static void
2366 solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded)
2367 {
2368   Pool *pool = solv->pool;
2369   Repo *installed = solv->installed;
2370   Queue *job = &solv->job;
2371   Map userinstalled;
2372   Map im;
2373   Map installedm;
2374   Rule *r;
2375   Id rid, how, what, select;
2376   Id p, pp, ip, *jp;
2377   Id req, *reqp, sup, *supp;
2378   Solvable *s;
2379   Queue iq;
2380   int i;
2381
2382   map_empty(cleandepsmap);
2383   if (!installed || installed->end == installed->start)
2384     return;
2385   map_init(&userinstalled, installed->end - installed->start);
2386   map_init(&im, pool->nsolvables);
2387   map_init(&installedm, pool->nsolvables);
2388   queue_init(&iq);
2389
2390   for (i = 0; i < job->count; i += 2)
2391     {
2392       how = job->elements[i];
2393       if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2394         {
2395           what = job->elements[i + 1];
2396           select = how & SOLVER_SELECTMASK;
2397           FOR_JOB_SELECT(p, pp, select, what)
2398             if (pool->solvables[p].repo == installed)
2399               MAPSET(&userinstalled, p - installed->start);
2400         }
2401     }
2402
2403   /* also add visible patterns to userinstalled for openSUSE */
2404   if (1)
2405     {
2406       Dataiterator di;
2407       dataiterator_init(&di, pool, 0, 0, SOLVABLE_ISVISIBLE, 0, 0);
2408       while (dataiterator_step(&di))
2409         {
2410           Id *dp;
2411           if (di.solvid <= 0)
2412             continue;
2413           s = pool->solvables + di.solvid;
2414           if (!s->requires)
2415             continue;
2416           if (!pool_installable(pool, s))
2417             continue;
2418           if (strncmp(pool_id2str(pool, s->name), "pattern:", 8) != 0)
2419             continue;
2420           dp = s->repo->idarraydata + s->requires;
2421           for (dp = s->repo->idarraydata + s->requires; *dp; dp++)
2422             FOR_PROVIDES(p, pp, *dp)
2423               if (pool->solvables[p].repo == installed)
2424                 {
2425                   if (strncmp(pool_id2str(pool, pool->solvables[p].name), "pattern", 7) != 0)
2426                     continue;
2427                   MAPSET(&userinstalled, p - installed->start);
2428                 }
2429         }
2430       dataiterator_free(&di);
2431     }
2432   if (1)
2433     {
2434       /* all products and their buddies are userinstalled */
2435       for (p = installed->start; p < installed->end; p++)
2436         {
2437           Solvable *s = pool->solvables + p;
2438           if (s->repo != installed)
2439             continue;
2440           if (!strncmp("product:", pool_id2str(pool, s->name), 8))
2441             {
2442               MAPSET(&userinstalled, p - installed->start);
2443               if (pool->nscallback)
2444                 {
2445                   Id buddy = pool->nscallback(pool, pool->nscallbackdata, NAMESPACE_PRODUCTBUDDY, p);
2446                   if (buddy >= installed->start && buddy < installed->end && pool->solvables[buddy].repo == installed)
2447                     MAPSET(&userinstalled, buddy);
2448                 }
2449             }
2450         }
2451     }
2452
2453   /* add all positive elements (e.g. locks) to "userinstalled" */
2454   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2455     {
2456       r = solv->rules + rid;
2457       if (r->d < 0)
2458         continue;
2459       i = solv->ruletojob.elements[rid - solv->jobrules];
2460       if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2461         continue;
2462       FOR_RULELITERALS(p, jp, r)
2463         if (p > 0 && pool->solvables[p].repo == installed)
2464           MAPSET(&userinstalled, p - installed->start);
2465     }
2466
2467   /* add all cleandeps candidates to iq */
2468   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2469     {
2470       r = solv->rules + rid;
2471       if (r->d < 0)
2472         continue;
2473       if (r->d == 0 && r->p < 0 && r->w2 == 0)
2474         {
2475           p = -r->p;
2476           if (pool->solvables[p].repo != installed)
2477             continue;
2478           MAPCLR(&userinstalled, p - installed->start);
2479           if (unneeded)
2480             continue;
2481           i = solv->ruletojob.elements[rid - solv->jobrules];
2482           how = job->elements[i];
2483           if ((how & (SOLVER_JOBMASK|SOLVER_CLEANDEPS)) == (SOLVER_ERASE|SOLVER_CLEANDEPS))
2484             queue_push(&iq, p);
2485         }
2486       else if (r->p > 0)
2487         {
2488           if (unneeded)
2489             continue;
2490           i = solv->ruletojob.elements[rid - solv->jobrules];
2491           if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS)
2492             {
2493               /* check if the literals all obsolete some installed package */
2494               Map om;
2495               int iqstart;
2496
2497               /* just one installed literal */
2498               if (r->d == 0 && r->w2 == 0 && pool->solvables[r->p].repo == installed)
2499                 continue;
2500               /* noobs is bad */
2501               if (solv->noobsoletes.size)
2502                 {
2503                   FOR_RULELITERALS(p, jp, r)
2504                     if (MAPTST(&solv->noobsoletes, p))
2505                       break;
2506                   if (p)
2507                     continue;
2508                 }
2509
2510               om.size = 0;
2511               iqstart = iq.count;
2512               FOR_RULELITERALS(p, jp, r)
2513                 {
2514                   if (p < 0)
2515                     {
2516                       queue_truncate(&iq, iqstart);     /* abort */
2517                       break;
2518                     }
2519                   if (pool->solvables[p].repo == installed)
2520                     {
2521                       if (iq.count == iqstart)
2522                         queue_push(&iq, p);
2523                       else
2524                         {
2525                           for (i = iqstart; i < iq.count; i++)
2526                             if (iq.elements[i] == p)
2527                               break;
2528                           queue_truncate(&iq, iqstart);
2529                           if (i < iq.count)
2530                             queue_push(&iq, p);
2531                         }
2532                     }
2533                   else
2534                     intersect_obsoletes(solv, p, &iq, iqstart, &om);
2535                   if (iq.count == iqstart)
2536                     break;
2537                 }
2538               if (om.size)
2539                 map_free(&om);
2540             }
2541         }
2542     }
2543
2544   if (!unneeded)
2545     {
2546       if (solv->cleandeps_updatepkgs)
2547         for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2548           queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);
2549     }
2550
2551   if (unneeded)
2552     queue_empty(&iq);   /* just in case... */
2553
2554   /* clear userinstalled bit for the packages we really want to delete/update */
2555   for (i = 0; i < iq.count; i++)
2556     {
2557       p = iq.elements[i];
2558       if (pool->solvables[p].repo != installed)
2559         continue;
2560       MAPCLR(&userinstalled, p - installed->start);
2561     }
2562
2563   for (p = installed->start; p < installed->end; p++)
2564     {
2565       if (pool->solvables[p].repo != installed)
2566         continue;
2567       MAPSET(&installedm, p);
2568       if (unneeded && !MAPTST(&userinstalled, p - installed->start))
2569         continue;
2570       MAPSET(&im, p);
2571     }
2572
2573 #ifdef CLEANDEPSDEBUG
2574   printf("REMOVE PASS\n");
2575 #endif
2576
2577   for (;;)
2578     {
2579       if (!iq.count)
2580         {
2581           if (unneeded)
2582             break;
2583           /* supplements pass */
2584           for (ip = solv->installed->start; ip < solv->installed->end; ip++)
2585             {
2586               if (!MAPTST(&installedm, ip))
2587                 continue;
2588               s = pool->solvables + ip;
2589               if (!s->supplements)
2590                 continue;
2591               if (!MAPTST(&im, ip))
2592                 continue;
2593               if (MAPTST(&userinstalled, ip - installed->start))
2594                 continue;
2595               supp = s->repo->idarraydata + s->supplements;
2596               while ((sup = *supp++) != 0)
2597                 if (dep_possible(solv, sup, &im))
2598                   break;
2599               if (!sup)
2600                 {
2601                   supp = s->repo->idarraydata + s->supplements;
2602                   while ((sup = *supp++) != 0)
2603                     if (dep_possible(solv, sup, &installedm))
2604                       {
2605                         /* no longer supplemented, also erase */
2606                         int iqcount = iq.count;
2607                         /* pin packages, see comment above dep_pkgcheck */
2608                         dep_pkgcheck(solv, sup, &im, &iq);
2609                         for (i = iqcount; i < iq.count; i++)
2610                           {
2611                             Id pqp = iq.elements[i];
2612                             if (pool->solvables[pqp].repo == installed)
2613                               MAPSET(&userinstalled, pqp - installed->start);
2614                           }
2615                         queue_truncate(&iq, iqcount);
2616 #ifdef CLEANDEPSDEBUG
2617                         printf("%s supplemented\n", pool_solvid2str(pool, ip));
2618 #endif
2619                         queue_push(&iq, ip);
2620                       }
2621                 }
2622             }
2623           if (!iq.count)
2624             break;
2625         }
2626       ip = queue_shift(&iq);
2627       s = pool->solvables + ip;
2628       if (!MAPTST(&im, ip))
2629         continue;
2630       if (!MAPTST(&installedm, ip))
2631         continue;
2632       if (s->repo == installed && MAPTST(&userinstalled, ip - installed->start))
2633         continue;
2634       MAPCLR(&im, ip);
2635 #ifdef CLEANDEPSDEBUG
2636       printf("removing %s\n", pool_solvable2str(pool, s));
2637 #endif
2638       if (s->requires)
2639         {
2640           reqp = s->repo->idarraydata + s->requires;
2641           while ((req = *reqp++) != 0)
2642             {
2643               if (req == SOLVABLE_PREREQMARKER)
2644                 continue;
2645 #if 0
2646               /* count number of installed packages that match */
2647               count = 0;
2648               FOR_PROVIDES(p, pp, req)
2649                 if (MAPTST(&installedm, p))
2650                   count++;
2651               if (count > 1)
2652                 continue;
2653 #endif
2654               FOR_PROVIDES(p, pp, req)
2655                 {
2656                   if (MAPTST(&im, p))
2657                     {
2658 #ifdef CLEANDEPSDEBUG
2659                       printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2660 #endif
2661                       queue_push(&iq, p);
2662                     }
2663                 }
2664             }
2665         }
2666       if (s->recommends)
2667         {
2668           reqp = s->repo->idarraydata + s->recommends;
2669           while ((req = *reqp++) != 0)
2670             {
2671 #if 0
2672               count = 0;
2673               FOR_PROVIDES(p, pp, req)
2674                 if (MAPTST(&installedm, p))
2675                   count++;
2676               if (count > 1)
2677                 continue;
2678 #endif
2679               FOR_PROVIDES(p, pp, req)
2680                 {
2681                   if (MAPTST(&im, p))
2682                     {
2683 #ifdef CLEANDEPSDEBUG
2684                       printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2685 #endif
2686                       queue_push(&iq, p);
2687                     }
2688                 }
2689             }
2690         }
2691     }
2692
2693   /* turn userinstalled into remove set for pruning */
2694   map_empty(&userinstalled);
2695   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2696     {
2697       r = solv->rules + rid;
2698       if (r->p >= 0 || r->d != 0 || r->w2 != 0)
2699         continue;       /* disabled or not erase */
2700       p = -r->p;
2701       MAPCLR(&im, p);
2702       if (pool->solvables[p].repo == installed)
2703         MAPSET(&userinstalled, p - installed->start);
2704     }
2705   for (p = installed->start; p < installed->end; p++)
2706     if (MAPTST(&im, p))
2707       queue_push(&iq, p);
2708   for (rid = solv->jobrules; rid < solv->jobrules_end; rid++)
2709     {
2710       r = solv->rules + rid;
2711       if (r->d < 0)
2712         continue;
2713       FOR_RULELITERALS(p, jp, r)
2714         if (p > 0)
2715           queue_push(&iq, p);
2716     }
2717   /* also put directly addressed packages on the install queue
2718    * so we can mark patterns as installed */
2719   for (i = 0; i < job->count; i += 2)
2720     {
2721       how = job->elements[i];
2722       if ((how & SOLVER_JOBMASK) == SOLVER_USERINSTALLED)
2723         {
2724           what = job->elements[i + 1];
2725           select = how & SOLVER_SELECTMASK;
2726           if (select == SOLVER_SOLVABLE && pool->solvables[what].repo != installed)
2727             queue_push(&iq, what);
2728         }
2729     }
2730
2731 #ifdef CLEANDEPSDEBUG
2732   printf("ADDBACK PASS\n");
2733 #endif
2734   for (;;)
2735     {
2736       if (!iq.count)
2737         {
2738           /* supplements pass */
2739           for (ip = installed->start; ip < installed->end; ip++)
2740             {
2741               if (!MAPTST(&installedm, ip))
2742                 continue;
2743               if (MAPTST(&userinstalled, ip - installed->start))
2744                 continue;
2745               s = pool->solvables + ip;
2746               if (!s->supplements)
2747                 continue;
2748               if (MAPTST(&im, ip))
2749                 continue;
2750               supp = s->repo->idarraydata + s->supplements;
2751               while ((sup = *supp++) != 0)
2752                 if (dep_possible(solv, sup, &im))
2753                   break;
2754               if (sup)
2755                 {
2756 #ifdef CLEANDEPSDEBUG
2757                   printf("%s supplemented\n", pool_solvid2str(pool, ip));
2758 #endif
2759                   MAPSET(&im, ip);
2760                   queue_push(&iq, ip);
2761                 }
2762             }
2763           if (!iq.count)
2764             break;
2765         }
2766       ip = queue_shift(&iq);
2767       s = pool->solvables + ip;
2768 #ifdef CLEANDEPSDEBUG
2769       printf("adding back %s\n", pool_solvable2str(pool, s));
2770 #endif
2771       if (s->requires)
2772         {
2773           reqp = s->repo->idarraydata + s->requires;
2774           while ((req = *reqp++) != 0)
2775             {
2776               FOR_PROVIDES(p, pp, req)
2777                 {
2778                   if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2779                     {
2780                       if (p == ip)
2781                         continue;
2782                       if (MAPTST(&userinstalled, p - installed->start))
2783                         continue;
2784 #ifdef CLEANDEPSDEBUG
2785                       printf("%s requires %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2786 #endif
2787                       MAPSET(&im, p);
2788                       queue_push(&iq, p);
2789                     }
2790                 }
2791             }
2792         }
2793       if (s->recommends)
2794         {
2795           reqp = s->repo->idarraydata + s->recommends;
2796           while ((req = *reqp++) != 0)
2797             {
2798               FOR_PROVIDES(p, pp, req)
2799                 {
2800                   if (!MAPTST(&im, p) && MAPTST(&installedm, p))
2801                     {
2802                       if (p == ip)
2803                         continue;
2804                       if (MAPTST(&userinstalled, p - installed->start))
2805                         continue;
2806 #ifdef CLEANDEPSDEBUG
2807                       printf("%s recommends %s\n", pool_solvid2str(pool, ip), pool_solvid2str(pool, p));
2808 #endif
2809                       MAPSET(&im, p);
2810                       queue_push(&iq, p);
2811                     }
2812                 }
2813             }
2814         }
2815     }
2816
2817   queue_free(&iq);
2818   if (solv->cleandeps_updatepkgs)
2819     for (i = 0; i < solv->cleandeps_updatepkgs->count; i++)
2820       MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]);
2821   if (solv->cleandeps_mistakes)
2822     for (i = 0; i < solv->cleandeps_mistakes->count; i++)
2823       MAPSET(&im, solv->cleandeps_mistakes->elements[i]);
2824   for (p = installed->start; p < installed->end; p++)
2825     {
2826       if (pool->solvables[p].repo != installed)
2827         continue;
2828       if (!MAPTST(&im, p))
2829         MAPSET(cleandepsmap, p - installed->start);
2830     }
2831   map_free(&im);
2832   map_free(&installedm);
2833   map_free(&userinstalled);
2834 }
2835
2836
2837 struct trj_data {
2838   Queue *edges;
2839   Id *low;
2840   Id idx;
2841   Id nstack;
2842   Id firstidx;
2843 };
2844
2845 /* Tarjan's SCC algorithm, slightly modifed */
2846 static void
2847 trj_visit(struct trj_data *trj, Id node)
2848 {
2849   Id *low = trj->low;
2850   Queue *edges = trj->edges;
2851   Id nnode, myidx, stackstart;
2852   int i;
2853
2854   low[node] = myidx = trj->idx++;
2855   low[(stackstart = trj->nstack++)] = node;
2856   for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++)
2857     {
2858       Id l = low[nnode];
2859       if (!l)
2860         {
2861           if (!edges->elements[edges->elements[nnode]])
2862             {
2863               trj->idx++;
2864               low[nnode] = -1;
2865               continue;
2866             }
2867           trj_visit(trj, nnode);
2868           l = low[nnode];
2869         }
2870       if (l < 0)
2871         continue;
2872       if (l < trj->firstidx)
2873         {
2874           int k;
2875           for (k = l; low[low[k]] == l; k++)
2876             low[low[k]] = -1;
2877         }
2878       else if (l < low[node])
2879         low[node] = l;
2880     }
2881   if (low[node] == myidx)
2882     {
2883       if (myidx != trj->firstidx)
2884         myidx = -1;
2885       for (i = stackstart; i < trj->nstack; i++)
2886         low[low[i]] = myidx;
2887       trj->nstack = stackstart;
2888     }
2889 }
2890
2891
2892 void
2893 solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
2894 {
2895   Repo *installed = solv->installed;
2896   int i;
2897   Map cleandepsmap;
2898
2899   queue_empty(unneededq);
2900   if (!installed || installed->end == installed->start)
2901     return;
2902
2903   map_init(&cleandepsmap, installed->end - installed->start);
2904   solver_createcleandepsmap(solv, &cleandepsmap, 1);
2905   for (i = installed->start; i < installed->end; i++)
2906     if (MAPTST(&cleandepsmap, i - installed->start))
2907       queue_push(unneededq, i);
2908
2909   if (filtered && unneededq->count > 1)
2910     {
2911       Pool *pool = solv->pool;
2912       Queue edges;
2913       Id *nrequires;
2914       Map installedm;
2915       int j, pass, count = unneededq->count;
2916       Id *low;
2917
2918       map_init(&installedm, pool->nsolvables);
2919       for (i = installed->start; i < installed->end; i++)
2920         if (pool->solvables[i].repo == installed)
2921           MAPSET(&installedm, i);
2922
2923       nrequires = solv_calloc(count, sizeof(Id));
2924       queue_init(&edges);
2925       /* pre-size */
2926       queue_insertn(&edges, 0, count * 4 + 10);
2927       queue_empty(&edges);
2928
2929       /*
2930        * Go through the solvables in the nodes queue and create edges for
2931        * all requires/recommends/supplements between the nodes.
2932        * The edges are stored in the edges queue, we add 1 to the node
2933        * index so that nodes in the edges queue are != 0 and we can
2934        * terminate the edge list with 0.
2935        * Thus for node element 5, the edges are stored starting at
2936        * edges.elements[6] and are 0-terminated.
2937        */
2938       /* leave first element zero to make things easier */
2939       /* also add trailing zero */
2940       queue_insertn(&edges, 0, 1 + count + 1);
2941
2942       /* first requires and recommends */
2943       for (i = 0; i < count; i++)
2944         {
2945           Solvable *s = pool->solvables + unneededq->elements[i];
2946           edges.elements[i + 1] = edges.count;
2947           for (pass = 0; pass < 2; pass++)
2948             {
2949               int num = 0;
2950               unsigned int off = pass == 0 ? s->requires : s->recommends;
2951               Id p, pp, *dp;
2952               if (off)
2953                 for (dp = s->repo->idarraydata + off; *dp; dp++)
2954                   FOR_PROVIDES(p, pp, *dp)
2955                     {
2956                       Solvable *sp = pool->solvables + p;
2957                       if (s == sp || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
2958                         continue;
2959                       for (j = 0; j < count; j++)
2960                         if (p == unneededq->elements[j])
2961                           break;
2962                       if (j == count)
2963                         continue;
2964                       if (num && edges.elements[edges.count - 1] == j + 1)
2965                         continue;
2966                       queue_push(&edges, j + 1);
2967                       num++;
2968                     }
2969                 if (pass == 0)
2970                   nrequires[i] = num;
2971             }
2972           queue_push(&edges, 0);
2973         }
2974 #if 0
2975       printf("requires + recommends\n");
2976       for (i = 0; i < count; i++)
2977         {
2978           int j;
2979           printf("  %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
2980           for (j = edges.elements[i + 1]; edges.elements[j]; j++)
2981             printf("    - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
2982         }
2983 #endif
2984
2985       /* then add supplements */
2986       for (i = 0; i < count; i++)
2987         {
2988           Solvable *s = pool->solvables + unneededq->elements[i];
2989           if (s->supplements)
2990             {
2991               Id *dp;
2992               int k;
2993               for (dp = s->repo->idarraydata + s->supplements; *dp; dp++)
2994                 if (dep_possible(solv, *dp, &installedm))
2995                   {
2996                     Queue iq;
2997                     Id iqbuf[16];
2998                     queue_init_buffer(&iq, iqbuf, sizeof(iqbuf)/sizeof(*iqbuf));
2999                     dep_pkgcheck(solv, *dp, 0, &iq);
3000                     for (k = 0; k < iq.count; k++)
3001                       {
3002                         Id p = iq.elements[k];
3003                         Solvable *sp = pool->solvables + p;
3004                         if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->start))
3005                           continue;
3006                         for (j = 0; j < count; j++)
3007                           if (p == unneededq->elements[j])
3008                             break;
3009                         /* now add edge from j + 1 to i + 1 */
3010                         queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1);
3011                         /* addapt following edge pointers */
3012                         for (k = j + 2; k < count + 2; k++)
3013                           edges.elements[k]++;
3014                       }
3015                     queue_free(&iq);
3016                   }
3017             }
3018         }
3019 #if 0
3020       /* print result */
3021       printf("+ supplements\n");
3022       for (i = 0; i < count; i++)
3023         {
3024           int j;
3025           printf("  %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]);
3026           for (j = edges.elements[i + 1]; edges.elements[j]; j++)
3027             printf("    - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1]));
3028     }
3029 #endif
3030       map_free(&installedm);
3031
3032       /* now run SCC algo two times, first with requires+recommends+supplements,
3033        * then again without the requires. We run it the second time to get rid
3034        * of packages that got dragged in via recommends/supplements */
3035       /*
3036        * low will contain the result of the SCC search.
3037        * it must be of at least size 2 * (count + 1) and
3038        * must be zero initialized.
3039        * The layout is:
3040        *    0  low low ... low stack stack ...stack 0
3041        *            count              count
3042        */
3043       low = solv_calloc(count + 1, 2 * sizeof(Id));
3044       for (pass = 0; pass < 2; pass++)
3045         {
3046           struct trj_data trj;
3047           if (pass)
3048             {
3049               memset(low, 0, (count + 1) * (2 * sizeof(Id)));
3050               for (i = 0; i < count; i++)
3051                 {
3052                   edges.elements[i + 1] += nrequires[i];
3053                   if (!unneededq->elements[i])
3054                     low[i + 1] = -1;    /* ignore this node */
3055                 }
3056             }
3057           trj.edges = &edges;
3058           trj.low = low;
3059           trj.idx = count + 1;  /* stack starts here */
3060           for (i = 1; i <= count; i++)
3061             {
3062               if (low[i])
3063                 continue;
3064               if (edges.elements[edges.elements[i]])
3065                 {
3066                   trj.firstidx = trj.nstack = trj.idx;
3067                   trj_visit(&trj, i);
3068                 }
3069               else
3070                 {
3071                   Id myidx = trj.idx++;
3072                   low[i] = myidx;
3073                   low[myidx] = i;
3074                 }
3075             }
3076           /* prune packages */
3077           for (i = 0; i < count; i++)
3078             if (low[i + 1] <= 0)
3079               unneededq->elements[i] = 0;
3080         }
3081       solv_free(low);
3082       solv_free(nrequires);
3083       queue_free(&edges);
3084
3085       /* finally remove all pruned entries from unneededq */
3086       for (i = j = 0; i < count; i++)
3087         if (unneededq->elements[i])
3088           unneededq->elements[j++] = unneededq->elements[i];
3089       queue_truncate(unneededq, j);
3090     }
3091   map_free(&cleandepsmap);
3092 }
3093
3094 /* EOF */