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 LIBSOLV_SOLVER_H
  14 #define LIBSOLV_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 #include "transaction.h"
  26 #include "rules.h"
  27 #include "problems.h"
  28
  29 /*
  30  * Callback definitions in order to "overwrite" the policies by an external application.
  31  */
  32
  33 typedef void  (*BestSolvableCb) (Pool *pool, Queue *canditates);
  34 typedef int  (*ArchCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  35 typedef int  (*VendorCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  36 typedef void (*UpdateCandidateCb) (Pool *pool, Solvable *solvable, Queue *canditates);
  37
  38
  39 #if 1
  40 struct _Solver {
  41   Pool *pool;                           /* back pointer to pool */
  42   Queue job;                            /* copy of the job we're solving */
  43
  44   Transaction trans;                    /* calculated transaction */
  45
  46   Repo *installed;                      /* copy of pool->installed */
  47
  48   /* list of rules, ordered
  49    * rpm rules first, then features, updates, jobs, learnt
  50    * see start/end offsets below
  51    */
  52   Rule *rules;                          /* all rules */
  53   Id nrules;                            /* [Offset] index of the last rule */
  54
  55   Queue ruleassertions;                 /* Queue of all assertion rules */
  56
  57   /* start/end offset for rule 'areas' */
  58
  59   Id rpmrules_end;                      /* [Offset] rpm rules end */
  60
  61   Id featurerules;                      /* feature rules start/end */
  62   Id featurerules_end;
  63
  64   Id updaterules;                       /* policy rules, e.g. keep packages installed or update. All literals > 0 */
  65   Id updaterules_end;
  66
  67   Id jobrules;                          /* user rules */
  68   Id jobrules_end;
  69
  70   Id infarchrules;                      /* inferior arch rules */
  71   Id infarchrules_end;
  72
  73   Id duprules;                          /* dist upgrade rules */
  74   Id duprules_end;
  75
  76   Id choicerules;                       /* choice rules (always weak) */
  77   Id choicerules_end;
  78   Id *choicerules_ref;
  79
  80   Id learntrules;                       /* learnt rules, (end == nrules) */
  81
  82   Map noupdate;                         /* don't try to update these
  83                                            installed solvables */
  84   Map noobsoletes;                      /* ignore obsoletes for these (multiinstall) */
  85
  86   Map updatemap;                        /* bring these installed packages to the newest version */
  87   int updatemap_all;                    /* bring all packages to the newest version */
  88
  89   Map fixmap;                           /* fix these packages */
  90   int fixmap_all;                       /* fix all packages */
  91
  92   Queue weakruleq;                      /* index into 'rules' for weak ones */
  93   Map weakrulemap;                      /* map rule# to '1' for weak rules, 1..learntrules */
  94
  95   Id *watches;                          /* Array of rule offsets
  96                                          * watches has nsolvables*2 entries and is addressed from the middle
  97                                          * middle-solvable : decision to conflict, offset point to linked-list of rules
  98                                          * middle+solvable : decision to install: offset point to linked-list of rules
  99                                          */
 100
 101   Queue ruletojob;                      /* index into job queue: jobs for which a rule exits */
 102
 103   /* our decisions: */
 104   Queue decisionq;                      /* >0:install, <0:remove/conflict */
 105   Queue decisionq_why;                  /* index of rule, Offset into rules */
 106
 107   Id *decisionmap;                      /* map for all available solvables,
 108                                          * = 0: undecided
 109                                          * > 0: level of decision when installed,
 110                                          * < 0: level of decision when conflict */
 111
 112   /* learnt rule history */
 113   Queue learnt_why;
 114   Queue learnt_pool;
 115
 116   Queue branches;
 117   int (*solution_callback)(struct _Solver *solv, void *data);
 118   void *solution_callback_data;
 119
 120   int propagate_index;                  /* index into decisionq for non-propagated decisions */
 121
 122   Queue problems;                       /* list of lists of conflicting rules, < 0 for job rules */
 123   Queue solutions;                      /* refined problem storage space */
 124
 125   Queue recommendations;                /* recommended packages */
 126   Queue suggestions;                    /* suggested packages */
 127   Queue orphaned;                       /* orphaned packages */
 128
 129   int stats_learned;                    /* statistic */
 130   int stats_unsolvable;                 /* statistic */
 131
 132   Map recommendsmap;                    /* recommended packages from decisionmap */
 133   Map suggestsmap;                      /* suggested packages from decisionmap */
 134   int recommends_index;                 /* recommendsmap/suggestsmap is created up to this level */
 135
 136   Id *obsoletes;                        /* obsoletes for each installed solvable */
 137   Id *obsoletes_data;                   /* data area for obsoletes */
 138   Id *multiversionupdaters;             /* updaters for multiversion packages in updatesystem mode */
 139
 140   /*-------------------------------------------------------------------------------------------------------------
 141    * Solver configuration
 142    *-------------------------------------------------------------------------------------------------------------*/
 143
 144   int fixsystem;                        /* repair errors in rpm dependency graph */
 145   int allowdowngrade;                   /* allow to downgrade installed solvable */
 146   int allowarchchange;                  /* allow to change architecture of installed solvables */
 147   int allowvendorchange;                /* allow to change vendor of installed solvables */
 148   int allowuninstall;                   /* allow removal of installed solvables */
 149   int updatesystem;                     /* update all packages to the newest version */
 150   int noupdateprovide;                  /* true: update packages needs not to provide old package */
 151   int dosplitprovides;                  /* true: consider legacy split provides */
 152   int dontinstallrecommended;           /* true: do not install recommended packages */
 153   int ignorealreadyrecommended;         /* true: ignore recommended packages that were already recommended by the installed packages */
 154   int dontshowinstalledrecommended;     /* true: do not show recommended packages that are already installed */
 155
 156   /* distupgrade also needs updatesystem and dosplitprovides */
 157   int distupgrade;
 158   int distupgrade_removeunsupported;
 159
 160   int noinfarchcheck;                   /* true: do not forbid inferior architectures */
 161
 162   /* Callbacks for defining the bahaviour of the SAT solver */
 163
 164   /* Finding best candidate
 165    *
 166    * Callback definition:
 167    * void  bestSolvable (Pool *pool, Queue *canditates)
 168    *     candidates       : List of canditates which has to be sorted by the function call
 169    *     return candidates: Sorted list of the candidates(first is the best).
 170    */
 171   BestSolvableCb bestSolvableCb;
 172
 173   /* Checking if two solvables has compatible architectures
 174    *
 175    * Callback definition:
 176    *     int  archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
 177    *
 178    *     return 0 it the two solvables has compatible architectures
 179    */
 180   ArchCheckCb archCheckCb;
 181
 182   /* Checking if two solvables has compatible vendors
 183    *
 184    * Callback definition:
 185    *     int  vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
 186    *
 187    *     return 0 it the two solvables has compatible architectures
 188    */
 189   VendorCheckCb vendorCheckCb;
 190
 191   /* Evaluate update candidate
 192    *
 193    * Callback definition:
 194    * void pdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
 195    *     solvable   : for which updates should be search
 196    *     candidates : List of candidates (This list depends on other
 197    *                  restrictions like architecture and vendor policies too)
 198    */
 199   UpdateCandidateCb   updateCandidateCb;
 200
 201   Map dupmap;                           /* dup these packages*/
 202   int dupmap_all;                       /* dup all packages */
 203   Map dupinvolvedmap;                   /* packages involved in dup process */
 204
 205   Map droporphanedmap;                  /* packages to drop in dup mode */
 206   int droporphanedmap_all;
 207
 208   Map cleandepsmap;                     /* try to drop these packages as of cleandeps erases */
 209
 210   Queue *ruleinfoq;                     /* tmp space for solver_ruleinfo() */
 211 };
 212
 213 #endif
 214
 215 typedef struct _Solver Solver;
 216
 217 /*
 218  * queue commands
 219  */
 220
 221 #define SOLVER_SOLVABLE                 0x01
 222 #define SOLVER_SOLVABLE_NAME            0x02
 223 #define SOLVER_SOLVABLE_PROVIDES        0x03
 224 #define SOLVER_SOLVABLE_ONE_OF          0x04
 225 #define SOLVER_SOLVABLE_REPO            0x05
 226 #define SOLVER_SOLVABLE_ALL             0x06
 227
 228 #define SOLVER_SELECTMASK               0xff
 229
 230 #define SOLVER_NOOP                     0x0000
 231 #define SOLVER_INSTALL                  0x0100
 232 #define SOLVER_ERASE                    0x0200
 233 #define SOLVER_UPDATE                   0x0300
 234 #define SOLVER_WEAKENDEPS               0x0400
 235 #define SOLVER_NOOBSOLETES              0x0500
 236 #define SOLVER_LOCK                     0x0600
 237 #define SOLVER_DISTUPGRADE              0x0700
 238 #define SOLVER_VERIFY                   0x0800
 239 #define SOLVER_DROP_ORPHANED            0x0900
 240 #define SOLVER_USERINSTALLED            0x0a00
 241
 242 #define SOLVER_JOBMASK                  0xff00
 243
 244 #define SOLVER_WEAK                     0x010000
 245 #define SOLVER_ESSENTIAL                0x020000
 246 #define SOLVER_CLEANDEPS                0x040000
 247
 248 #define SOLVER_SETEV                    0x01000000
 249 #define SOLVER_SETEVR                   0x02000000
 250 #define SOLVER_SETARCH                  0x04000000
 251 #define SOLVER_SETVENDOR                0x08000000
 252 #define SOLVER_SETREPO                  0x10000000
 253 #define SOLVER_NOAUTOSET                0x20000000
 254
 255 #define SOLVER_SETMASK                  0x2f000000
 256
 257 /* old API compatibility, do not use in new code */
 258 #ifdef OBSOLETE_INTERFACE
 259
 260 #define SOLVER_INSTALL_SOLVABLE (SOLVER_INSTALL|SOLVER_SOLVABLE)
 261 #define SOLVER_ERASE_SOLVABLE (SOLVER_ERASE|SOLVER_SOLVABLE)
 262 #define SOLVER_INSTALL_SOLVABLE_NAME (SOLVER_INSTALL|SOLVER_SOLVABLE_NAME)
 263 #define SOLVER_ERASE_SOLVABLE_NAME (SOLVER_ERASE|SOLVER_SOLVABLE_NAME)
 264 #define SOLVER_INSTALL_SOLVABLE_PROVIDES (SOLVER_INSTALL|SOLVER_SOLVABLE_PROVIDES)
 265 #define SOLVER_ERASE_SOLVABLE_PROVIDES (SOLVER_ERASE|SOLVER_SOLVABLE_PROVIDES)
 266 #define SOLVER_INSTALL_SOLVABLE_UPDATE (SOLVER_UPDATE|SOLVER_SOLVABLE)
 267 #define SOLVER_INSTALL_SOLVABLE_ONE_OF (SOLVER_INSTALL|SOLVER_SOLVABLE_ONE_OF)
 268 #define SOLVER_WEAKEN_SOLVABLE_DEPS (SOLVER_WEAKENDEPS|SOLVER_SOLVABLE)
 269 #define SOLVER_NOOBSOLETES_SOLVABLE (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE)
 270 #define SOLVER_NOOBSOLETES_SOLVABLE_NAME (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE_NAME)
 271 #define SOLVER_NOOBSOLETES_SOLVABLE_PROVIDES (SOLVER_NOOBSOLETES|SOLVER_SOLVABLE_PROVIDES)
 272
 273 /* backward compatibility */
 274 #define SOLVER_PROBLEM_UPDATE_RULE              SOLVER_RULE_UPDATE
 275 #define SOLVER_PROBLEM_JOB_RULE                 SOLVER_RULE_JOB
 276 #define SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP
 277 #define SOLVER_PROBLEM_NOT_INSTALLABLE          SOLVER_RULE_RPM_NOT_INSTALLABLE
 278 #define SOLVER_PROBLEM_NOTHING_PROVIDES_DEP     SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP
 279 #define SOLVER_PROBLEM_SAME_NAME                SOLVER_RULE_RPM_SAME_NAME
 280 #define SOLVER_PROBLEM_PACKAGE_CONFLICT         SOLVER_RULE_RPM_PACKAGE_CONFLICT
 281 #define SOLVER_PROBLEM_PACKAGE_OBSOLETES        SOLVER_RULE_RPM_PACKAGE_OBSOLETES
 282 #define SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE SOLVER_RULE_RPM_PACKAGE_REQUIRES
 283 #define SOLVER_PROBLEM_SELF_CONFLICT            SOLVER_RULE_RPM_SELF_CONFLICT
 284 #define SOLVER_PROBLEM_RPM_RULE                 SOLVER_RULE_RPM
 285 #define SOLVER_PROBLEM_DISTUPGRADE_RULE         SOLVER_RULE_DISTUPGRADE
 286 #define SOLVER_PROBLEM_INFARCH_RULE             SOLVER_RULE_INFARCH
 287
 288 #endif
 289
 290
 291 extern Solver *solver_create(Pool *pool);
 292 extern void solver_free(Solver *solv);
 293 extern int  solver_solve(Solver *solv, Queue *job);
 294
 295 extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap);
 296 extern void solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap);
 297
 298 /* XXX: why is this not static? */
 299 Id *solver_create_decisions_obsoletesmap(Solver *solv);
 300
 301 void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps);
 302 int solver_calc_installsizechange(Solver *solv);
 303 void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res);
 304
 305 void solver_find_involved(Solver *solv, Queue *installedq, Solvable *s, Queue *q);
 306
 307 /* iterate over all literals of a rule */
 308 /* WARNING: loop body must not relocate whatprovidesdata, e.g. by
 309  * looking up the providers of a dependency */
 310 #define FOR_RULELITERALS(l, dp, r)                              \
 311     for (l = r->d < 0 ? -r->d - 1 : r->d,                       \
 312          dp = !l ? &r->w2 : pool->whatprovidesdata + l,         \
 313          l = r->p; l; l = (dp != &r->w2 + 1 ? *dp++ : 0))
 314
 315 /* iterate over all packages selected by a job */
 316 #define FOR_JOB_SELECT(p, pp, select, what)                                     \
 317     if (select == SOLVER_SOLVABLE_REPO || select == SOLVER_SOLVABLE_ALL)        \
 318         p = pp = 0;                                                             \
 319     else for (pp = (select == SOLVER_SOLVABLE ? 0 :                             \
 320                select == SOLVER_SOLVABLE_ONE_OF ? what :                        \
 321                pool_whatprovides(pool, what)),                                  \
 322          p = (select == SOLVER_SOLVABLE ? what : pool->whatprovidesdata[pp++]) ; p ; p = pool->whatprovidesdata[pp++]) \
 323       if (select != SOLVER_SOLVABLE_NAME || pool_match_nevr(pool, pool->solvables + p, what))
 324
 325 #ifdef __cplusplus
 326 }
 327 #endif
 328
 329 #endif /* LIBSOLV_SOLVER_H */