src/solver.h

   1 /*
   2  * Copyright (c) 2007, Novell Inc.
   3  *
   4  * This program is licensed under the BSD license, read LICENSE.BSD
   5  * for further information
   6  */
   7
   8 /*
   9  * solver.h
  10  *
  11  */
  12
  13 #ifndef SATSOLVER_SOLVER_H
  14 #define SATSOLVER_SOLVER_H
  15
  16 #ifdef __cplusplus
  17 extern "C" {
  18 #endif
  19
  20 #include "pooltypes.h"
  21 #include "pool.h"
  22 #include "repo.h"
  23 #include "queue.h"
  24 #include "bitmap.h"
  25 /*
  26  * Callback definitions in order to "overwrite" the policies by an external application.
  27  */
  28
  29 typedef void  (*BestSolvableCb) (Pool *pool, Queue *canditates);
  30 typedef int  (*ArchCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  31 typedef int  (*VendorCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  32 typedef void (*UpdateCandidateCb) (Pool *pool, Solvable *solvable, Queue *canditates);
  33
  34
  35 /* ----------------------------------------------
  36  * Rule
  37  *
  38  *   providerN(B) == Package Id of package providing tag B
  39  *   N = 1, 2, 3, in case of multiple providers
  40  *
  41  * A requires B : !A | provider1(B) | provider2(B)
  42  *
  43  * A conflicts B : (!A | !provider1(B)) & (!A | !provider2(B)) ...
  44  *
  45  * 'not' is encoded as a negative Id
  46  *
  47  * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
  48  */
  49
  50 typedef struct rule {
  51   Id p;                 /* first literal in rule */
  52   Id d;                 /* Id offset into 'list of providers terminated by 0' as used by whatprovides; pool->whatprovides + d */
  53                         /* in case of binary rules, d == 0, w1 == p, w2 == other literal */
  54                         /* in case of disabled rules: ~d, aka -d - 1 */
  55   Id w1, w2;            /* watches, literals not-yet-decided */
  56                                        /* if !w2, assertion, not rule */
  57   Id n1, n2;            /* next rules in linked list, corresponding to w1,w2 */
  58 } Rule;
  59
  60 struct solver;
  61
  62 typedef struct solver {
  63   Pool *pool;
  64   Repo *installed;
  65
  66   /* list of rules, ordered
  67    * rpm rules first, then features, updates, jobs, learnt
  68    * see start/end offsets below
  69    */
  70   Rule *rules;                          /* all rules */
  71   Id nrules;                            /* [Offset] index of the last rule */
  72
  73   Queue ruleassertions;                 /* Queue of all assertion rules */
  74
  75   /* start/end offset for rule 'areas' */
  76
  77   Id rpmrules_end;                      /* [Offset] rpm rules end */
  78
  79   Id featurerules;                      /* feature rules start/end */
  80   Id featurerules_end;
  81
  82   Id updaterules;                       /* policy rules, e.g. keep packages installed or update. All literals > 0 */
  83   Id updaterules_end;
  84
  85   Id jobrules;                          /* user rules */
  86   Id jobrules_end;
  87
  88   Id learntrules;                       /* learnt rules, (end == nrules) */
  89
  90   Map noupdate;                         /* don't try to update these
  91                                            installed solvables */
  92   Map noobsoletes;                      /* ignore obsoletes for these
  93                                            (multiinstall) */
  94
  95   Queue weakruleq;                      /* index into 'rules' for weak ones */
  96   Map weakrulemap;                      /* map rule# to '1' for weak rules, 1..learntrules */
  97
  98   Id *watches;                          /* Array of rule offsets
  99                                          * watches has nsolvables*2 entries and is addressed from the middle
 100                                          * middle-solvable : decision to conflict, offset point to linked-list of rules
 101                                          * middle+solvable : decision to install: offset point to linked-list of rules
 102                                          */
 103
 104   Queue ruletojob;                      /* index into job queue: jobs for which a rule exits */
 105
 106   /* our decisions: */
 107   Queue decisionq;                      /* >0:install, <0:remove/conflict */
 108   Queue decisionq_why;                  /* index of rule, Offset into rules */
 109   int directdecisions;                  /* number of decisions with no rule */
 110
 111   Id *decisionmap;                      /* map for all available solvables,
 112                                          * = 0: undecided
 113                                          * > 0: level of decision when installed,
 114                                          * < 0: level of decision when conflict */
 115
 116   /* learnt rule history */
 117   Queue learnt_why;
 118   Queue learnt_pool;
 119
 120   Queue branches;
 121   int (*solution_callback)(struct solver *solv, void *data);
 122   void *solution_callback_data;
 123
 124   int propagate_index;                  /* index into decisionq for non-propagated decisions */
 125
 126   Queue problems;                       /* index of conflicting rules, < 0 for job rules */
 127   Queue recommendations;                /* recommended packages */
 128   Queue suggestions;                    /* suggested packages */
 129   Queue orphaned;                       /* orphaned packages */
 130
 131   int stats_learned;                    /* statistic */
 132   int stats_unsolvable;                 /* statistic */
 133
 134   Map recommendsmap;                    /* recommended packages from decisionmap */
 135   Map suggestsmap;                      /* suggested packages from decisionmap */
 136   int recommends_index;                 /* recommendsmap/suggestsmap is created up to this level */
 137
 138   Id *obsoletes;                        /* obsoletes for each installed solvable */
 139   Id *obsoletes_data;                   /* data area for obsoletes */
 140
 141   /*-------------------------------------------------------------------------------------------------------------
 142    * Solver configuration
 143    *-------------------------------------------------------------------------------------------------------------*/
 144
 145   int fixsystem;                        /* repair errors in rpm dependency graph */
 146   int allowdowngrade;                   /* allow to downgrade installed solvable */
 147   int allowarchchange;                  /* allow to change architecture of installed solvables */
 148   int allowvendorchange;                /* allow to change vendor of installed solvables */
 149   int allowuninstall;                   /* allow removal of installed solvables */
 150   int updatesystem;                     /* distupgrade */
 151   int allowvirtualconflicts;            /* false: conflicts on package name, true: conflicts on package provides */
 152   int allowselfconflicts;               /* true: packages wich conflict with itself are installable */
 153   int obsoleteusesprovides;             /* true: obsoletes are matched against provides, not names */
 154   int implicitobsoleteusesprovides;     /* true: implicit obsoletes due to same name are matched against provides, not names */
 155   int noupdateprovide;                  /* true: update packages needs not to provide old package */
 156   int dosplitprovides;                  /* true: consider legacy split provides */
 157   int dontinstallrecommended;           /* true: do not install recommended packages */
 158   int ignorealreadyrecommended;         /* true: ignore recommended packages that were already recommended by the installed packages */
 159   int dontshowinstalledrecommended;     /* true: do not show recommended packages that are already installed */
 160
 161   /* distupgrade also needs updatesystem and dosplitprovides */
 162   int distupgrade;
 163   int distupgrade_removeunsupported;
 164
 165   /* Callbacks for defining the bahaviour of the SAT solver */
 166
 167   /* Finding best candidate
 168    *
 169    * Callback definition:
 170    * void  bestSolvable (Pool *pool, Queue *canditates)
 171    *     candidates       : List of canditates which has to be sorted by the function call
 172    *     return candidates: Sorted list of the candidates(first is the best).
 173    */
 174    BestSolvableCb bestSolvableCb;
 175
 176   /* Checking if two solvables has compatible architectures
 177    *
 178    * Callback definition:
 179    *     int  archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
 180    *
 181    *     return 0 it the two solvables has compatible architectures
 182    */
 183    ArchCheckCb archCheckCb;
 184
 185   /* Checking if two solvables has compatible vendors
 186    *
 187    * Callback definition:
 188    *     int  vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
 189    *
 190    *     return 0 it the two solvables has compatible architectures
 191    */
 192    VendorCheckCb vendorCheckCb;
 193
 194   /* Evaluate update candidate
 195    *
 196    * Callback definition:
 197    * void pdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
 198    *     solvable   : for which updates should be search
 199    *     candidates : List of candidates (This list depends on other
 200    *                  restrictions like architecture and vendor policies too)
 201    */
 202    UpdateCandidateCb   updateCandidateCb;
 203
 204
 205   /* some strange queue that doesn't belong here */
 206
 207   Queue covenantq;                      /* Covenants honored by this solver (generic locks) */
 208
 209
 210 } Solver;
 211
 212 /*
 213  * queue commands
 214  */
 215
 216 #define SOLVER_SOLVABLE                 0x01
 217 #define SOLVER_SOLVABLE_NAME            0x02
 218 #define SOLVER_SOLVABLE_PROVIDES        0x03
 219 #define SOLVER_SOLVABLE_ONE_OF          0x04
 220
 221 #define SOLVER_SELECTMASK               0xff
 222
 223 #define SOLVER_INSTALL                  0x0100
 224 #define SOLVER_ERASE                    0x0200
 225 #define SOLVER_UPDATE                   0x0300
 226 #define SOLVER_WEAKENDEPS               0x0400
 227 #define SOLVER_NOOBSOLETES              0x0500
 228 #define SOLVER_LOCK                     0x0600
 229
 230 #define SOLVER_JOBMASK                  0xff00
 231
 232 #define SOLVER_WEAK                     0x010000
 233
 234 /* old API compatibility, do not use in new code */
 235 #if 1
 236 #define SOLVER_INSTALL_SOLVABLE (SOLVER_INSTALL|SOLVER_SOLVABLE)
 237 #define SOLVER_ERASE_SOLVABLE (SOLVER_ERASE|SOLVER_SOLVABLE)
 238 #define SOLVER_INSTALL_SOLVABLE_NAME (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME)
 239 #define SOLVER_ERASE_SOLVABLE_NAME (SOLVER_ERASE|SOLVER_SOLVABLE_NAME)
 240 #define SOLVER_INSTALL_SOLVABLE_PROVIDES (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES)
 241 #define SOLVER_ERASE_SOLVABLE_PROVIDES (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES)
 242 #define SOLVER_INSTALL_SOLVABLE_UPDATE (SOLVER_UPDATE|SOLVER_SOLVABLE)
 243 #define SOLVER_INSTALL_SOLVABLE_ONE_OF (SOLVER_INSTALL|SOLVER_SOLVABLE_ONE_OF)
 244 #define SOLVER_WEAKEN_SOLVABLE_DEPS (SOLVER_WEAKENDEPS|SOLVER_SOLVABLE)
 245 #define SOLVER_NOOBSOLETES_SOLVABLE (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE)
 246 #define SOLVER_NOOBSOLETES_SOLVABLE_NAME (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE_NAME)
 247 #define SOLVER_NOOBSOLETES_SOLVABLE_PROVIDES (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE_PROVIDES)
 248 #endif
 249
 250 typedef enum {
 251   SOLVER_PROBLEM_UPDATE_RULE,
 252   SOLVER_PROBLEM_JOB_RULE,
 253   SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP,
 254   SOLVER_PROBLEM_NOT_INSTALLABLE,
 255   SOLVER_PROBLEM_NOTHING_PROVIDES_DEP,
 256   SOLVER_PROBLEM_SAME_NAME,
 257   SOLVER_PROBLEM_PACKAGE_CONFLICT,
 258   SOLVER_PROBLEM_PACKAGE_OBSOLETES,
 259   SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE,
 260   SOLVER_PROBLEM_SELF_CONFLICT,
 261   SOLVER_PROBLEM_RPM_RULE
 262 } SolverProbleminfo;
 263
 264
 265 extern Solver *solver_create(Pool *pool, Repo *installed);
 266 extern void solver_free(Solver *solv);
 267 extern void solver_solve(Solver *solv, Queue *job);
 268 extern int solver_dep_installed(Solver *solv, Id dep);
 269 extern int solver_splitprovides(Solver *solv, Id dep);
 270
 271 extern Id solver_next_problem(Solver *solv, Id problem);
 272 extern Id solver_next_solution(Solver *solv, Id problem, Id solution);
 273 extern Id solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp);
 274 extern Id solver_findproblemrule(Solver *solv, Id problem);
 275 extern SolverProbleminfo solver_problemruleinfo(Solver *solv, Queue *job, Id rid, Id *depp, Id *sourcep, Id *targetp);
 276
 277 /* XXX: why is this not static? */
 278 Id *solver_create_decisions_obsoletesmap(Solver *solv);
 279
 280 static inline int
 281 solver_dep_fulfilled(Solver *solv, Id dep)
 282 {
 283   Pool *pool = solv->pool;
 284   Id p, *pp;
 285
 286   if (ISRELDEP(dep))
 287     {
 288       Reldep *rd = GETRELDEP(pool, dep);
 289       if (rd->flags == REL_AND)
 290         {
 291           if (!solver_dep_fulfilled(solv, rd->name))
 292             return 0;
 293           return solver_dep_fulfilled(solv, rd->evr);
 294         }
 295       if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
 296         return solver_splitprovides(solv, rd->evr);
 297       if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
 298         return solver_dep_installed(solv, rd->evr);
 299     }
 300   FOR_PROVIDES(p, pp, dep)
 301     {
 302       if (solv->decisionmap[p] > 0)
 303         return 1;
 304     }
 305   return 0;
 306 }
 307
 308 static inline int
 309 solver_is_supplementing(Solver *solv, Solvable *s)
 310 {
 311   Id sup, *supp;
 312   if (!s->supplements)
 313     return 0;
 314   supp = s->repo->idarraydata + s->supplements;
 315   while ((sup = *supp++) != 0)
 316     if (solver_dep_fulfilled(solv, sup))
 317       return 1;
 318   return 0;
 319 }
 320
 321 static inline int
 322 solver_is_enhancing(Solver *solv, Solvable *s)
 323 {
 324   Id enh, *enhp;
 325   if (!s->enhances)
 326     return 0;
 327   enhp = s->repo->idarraydata + s->enhances;
 328   while ((enh = *enhp++) != 0)
 329     if (solver_dep_fulfilled(solv, enh))
 330       return 1;
 331   return 0;
 332 }
 333
 334 void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps);
 335 int solver_calc_installsizechange(Solver *solv);
 336
 337 static inline void
 338 solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap)
 339 {
 340   pool_create_state_maps(solv->pool, &solv->decisionq, installedmap, conflictsmap);
 341 }
 342
 343 #define FOR_RULELITERALS(l, dp, r)                              \
 344     for (l = r->d < 0 ? -r->d - 1 : r->d,                       \
 345          dp = !l ? &r->w2 : pool->whatprovidesdata + l,         \
 346          l = r->p; l; l = (dp != &r->w2 + 1 ? *dp++ : 0))
 347
 348 #define FOR_JOB_SELECT(p, pp, select, what) \
 349     for (pp = (select == SOLVER_SOLVABLE ? pool->whatprovidesdata :     \
 350                select == SOLVER_SOLVABLE_ONE_OF ? pool->whatprovidesdata + what : \
 351                pool_whatprovides(pool, what)),                          \
 352          p = (select == SOLVER_SOLVABLE ? what : *pp++) ; p ; p = *pp++) \
 353       if (select != SOLVER_SOLVABLE_NAME || pool_match_nevr(pool, pool->solvables + p, what))
 354
 355 #ifdef __cplusplus
 356 }
 357 #endif
 358
 359 #endif /* SATSOLVER_SOLVER_H */