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 struct _Solver {
  40   Pool *pool;                           /* back pointer to pool */
  41   Queue job;                            /* copy of the job we're solving */
  42
  43   int (*solution_callback)(struct _Solver *solv, void *data);
  44   void *solution_callback_data;
  45
  46   /* Callbacks for defining the bahaviour of the solver */
  47
  48   /* Finding best candidate
  49    *
  50    * Callback definition:
  51    * void  bestSolvable (Pool *pool, Queue *canditates)
  52    *     candidates       : List of canditates which has to be sorted by the function call
  53    *     return candidates: Sorted list of the candidates(first is the best).
  54    */
  55   BestSolvableCb bestSolvableCb;
  56
  57   /* Checking if two solvables has compatible architectures
  58    *
  59    * Callback definition:
  60    *     int  archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  61    *
  62    *     return 0 it the two solvables has compatible architectures
  63    */
  64   ArchCheckCb archCheckCb;
  65
  66   /* Checking if two solvables has compatible vendors
  67    *
  68    * Callback definition:
  69    *     int  vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
  70    *
  71    *     return 0 it the two solvables has compatible architectures
  72    */
  73   VendorCheckCb vendorCheckCb;
  74
  75   /* Evaluate update candidate
  76    *
  77    * Callback definition:
  78    * void UpdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
  79    *     solvable   : for which updates should be search
  80    *     candidates : List of candidates (This list depends on other
  81    *                  restrictions like architecture and vendor policies too)
  82    */
  83   UpdateCandidateCb   updateCandidateCb;
  84
  85 #ifdef LIBSOLV_INTERNAL
  86   Repo *installed;                      /* copy of pool->installed */
  87
  88   /* list of rules, ordered
  89    * rpm rules first, then features, updates, jobs, learnt
  90    * see start/end offsets below
  91    */
  92   Rule *rules;                          /* all rules */
  93   Id nrules;                            /* [Offset] index of the last rule */
  94
  95   Queue ruleassertions;                 /* Queue of all assertion rules */
  96
  97   /* start/end offset for rule 'areas' */
  98
  99   Id rpmrules_end;                      /* [Offset] rpm rules end */
 100
 101   Id featurerules;                      /* feature rules start/end */
 102   Id featurerules_end;
 103
 104   Id updaterules;                       /* policy rules, e.g. keep packages installed or update. All literals > 0 */
 105   Id updaterules_end;
 106
 107   Id jobrules;                          /* user rules */
 108   Id jobrules_end;
 109
 110   Id infarchrules;                      /* inferior arch rules */
 111   Id infarchrules_end;
 112
 113   Id duprules;                          /* dist upgrade rules */
 114   Id duprules_end;
 115
 116   Id choicerules;                       /* choice rules (always weak) */
 117   Id choicerules_end;
 118   Id *choicerules_ref;
 119
 120   Id learntrules;                       /* learnt rules, (end == nrules) */
 121
 122   Map noupdate;                         /* don't try to update these
 123                                            installed solvables */
 124   Map noobsoletes;                      /* ignore obsoletes for these (multiinstall) */
 125
 126   Map updatemap;                        /* bring these installed packages to the newest version */
 127   int updatemap_all;                    /* bring all packages to the newest version */
 128
 129   Map fixmap;                           /* fix these packages */
 130   int fixmap_all;                       /* fix all packages */
 131
 132   Queue weakruleq;                      /* index into 'rules' for weak ones */
 133   Map weakrulemap;                      /* map rule# to '1' for weak rules, 1..learntrules */
 134
 135   Id *watches;                          /* Array of rule offsets
 136                                          * watches has nsolvables*2 entries and is addressed from the middle
 137                                          * middle-solvable : decision to conflict, offset point to linked-list of rules
 138                                          * middle+solvable : decision to install: offset point to linked-list of rules
 139                                          */
 140
 141   Queue ruletojob;                      /* index into job queue: jobs for which a rule exits */
 142
 143   /* our decisions: */
 144   Queue decisionq;                      /* >0:install, <0:remove/conflict */
 145   Queue decisionq_why;                  /* index of rule, Offset into rules */
 146
 147   Id *decisionmap;                      /* map for all available solvables,
 148                                          * = 0: undecided
 149                                          * > 0: level of decision when installed,
 150                                          * < 0: level of decision when conflict */
 151
 152   int decisioncnt_update;
 153   int decisioncnt_keep;
 154   int decisioncnt_resolve;
 155   int decisioncnt_weak;
 156   int decisioncnt_orphan;
 157
 158   /* learnt rule history */
 159   Queue learnt_why;
 160   Queue learnt_pool;
 161
 162   Queue branches;
 163   int propagate_index;                  /* index into decisionq for non-propagated decisions */
 164
 165   Queue problems;                       /* list of lists of conflicting rules, < 0 for job rules */
 166   Queue solutions;                      /* refined problem storage space */
 167
 168   Queue orphaned;                       /* orphaned packages (to be removed?) */
 169
 170   int stats_learned;                    /* statistic */
 171   int stats_unsolvable;                 /* statistic */
 172
 173   Map recommendsmap;                    /* recommended packages from decisionmap */
 174   Map suggestsmap;                      /* suggested packages from decisionmap */
 175   int recommends_index;                 /* recommendsmap/suggestsmap is created up to this level */
 176
 177   Id *obsoletes;                        /* obsoletes for each installed solvable */
 178   Id *obsoletes_data;                   /* data area for obsoletes */
 179   Id *multiversionupdaters;             /* updaters for multiversion packages in updatesystem mode */
 180
 181   /*-------------------------------------------------------------------------------------------------------------
 182    * Solver configuration
 183    *-------------------------------------------------------------------------------------------------------------*/
 184
 185   int allowdowngrade;                   /* allow to downgrade installed solvable */
 186   int allownamechange;                  /* allow to change name of installed solvables */
 187   int allowarchchange;                  /* allow to change architecture of installed solvables */
 188   int allowvendorchange;                /* allow to change vendor of installed solvables */
 189   int allowuninstall;                   /* allow removal of installed solvables */
 190   int noupdateprovide;                  /* true: update packages needs not to provide old package */
 191   int dosplitprovides;                  /* true: consider legacy split provides */
 192   int dontinstallrecommended;           /* true: do not install recommended packages */
 193   int addalreadyrecommended;            /* true: also install recommended packages that were already recommended by the installed packages */
 194   int dontshowinstalledrecommended;     /* true: do not show recommended packages that are already installed */
 195
 196   int noinfarchcheck;                   /* true: do not forbid inferior architectures */
 197   int keepexplicitobsoletes;            /* true: honor obsoletes during multiinstall */
 198
 199
 200   Map dupmap;                           /* dup these packages*/
 201   int dupmap_all;                       /* dup all packages */
 202   Map dupinvolvedmap;                   /* packages involved in dup process */
 203   int dup_allowdowngrade;               /* dup mode: allow to downgrade installed solvable */
 204   int dup_allownamechange;              /* dup mode: allow to change name of installed solvable */
 205   int dup_allowarchchange;              /* dup mode: allow to change architecture of installed solvables */
 206   int dup_allowvendorchange;            /* dup mode: allow to change vendor of installed solvables */
 207
 208   Map droporphanedmap;                  /* packages to drop in dup mode */
 209   int droporphanedmap_all;
 210
 211   Map cleandepsmap;                     /* try to drop these packages as of cleandeps erases */
 212
 213   Queue *ruleinfoq;                     /* tmp space for solver_ruleinfo() */
 214
 215   Queue *cleandeps_updatepkgs;          /* packages we update in cleandeps mode */
 216   Queue *cleandeps_mistakes;            /* mistakes we made */
 217
 218   Queue *update_targets;                /* update to specific packages */
 219 #endif  /* LIBSOLV_INTERNAL */
 220 };
 221
 222 typedef struct _Solver Solver;
 223
 224 /*
 225  * queue commands
 226  */
 227
 228 #define SOLVER_SOLVABLE                 0x01
 229 #define SOLVER_SOLVABLE_NAME            0x02
 230 #define SOLVER_SOLVABLE_PROVIDES        0x03
 231 #define SOLVER_SOLVABLE_ONE_OF          0x04
 232 #define SOLVER_SOLVABLE_REPO            0x05
 233 #define SOLVER_SOLVABLE_ALL             0x06
 234
 235 #define SOLVER_SELECTMASK               0xff
 236
 237 #define SOLVER_NOOP                     0x0000
 238 #define SOLVER_INSTALL                  0x0100
 239 #define SOLVER_ERASE                    0x0200
 240 #define SOLVER_UPDATE                   0x0300
 241 #define SOLVER_WEAKENDEPS               0x0400
 242 #define SOLVER_NOOBSOLETES              0x0500
 243 #define SOLVER_LOCK                     0x0600
 244 #define SOLVER_DISTUPGRADE              0x0700
 245 #define SOLVER_VERIFY                   0x0800
 246 #define SOLVER_DROP_ORPHANED            0x0900
 247 #define SOLVER_USERINSTALLED            0x0a00
 248
 249 #define SOLVER_JOBMASK                  0xff00
 250
 251 #define SOLVER_WEAK                     0x010000
 252 #define SOLVER_ESSENTIAL                0x020000
 253 #define SOLVER_CLEANDEPS                0x040000
 254 /* ORUPDATE makes SOLVER_INSTALL not prune to installed
 255  * packages, thus updating installed packages */
 256 #define SOLVER_ORUPDATE                 0x080000
 257 /* FORCEBEST makes the solver insist on best packages, so
 258  * you will get problem reported if the best package is
 259  * not installable. This can be used with INSTALL, UPDATE
 260  * and DISTUPGRADE */
 261 /* Also, it's not implemented yet ;) */
 262 #define SOLVER_FORCEBEST                0x100000
 263
 264 #define SOLVER_SETEV                    0x01000000
 265 #define SOLVER_SETEVR                   0x02000000
 266 #define SOLVER_SETARCH                  0x04000000
 267 #define SOLVER_SETVENDOR                0x08000000
 268 #define SOLVER_SETREPO                  0x10000000
 269 #define SOLVER_NOAUTOSET                0x20000000
 270 #define SOLVER_SETNAME                  0x40000000
 271
 272 #define SOLVER_SETMASK                  0x7f000000
 273
 274 #define SOLVER_REASON_UNRELATED         0
 275 #define SOLVER_REASON_UNIT_RULE         1
 276 #define SOLVER_REASON_KEEP_INSTALLED    2
 277 #define SOLVER_REASON_RESOLVE_JOB       3
 278 #define SOLVER_REASON_UPDATE_INSTALLED  4
 279 #define SOLVER_REASON_CLEANDEPS_ERASE   5
 280 #define SOLVER_REASON_RESOLVE           6
 281 #define SOLVER_REASON_WEAKDEP           7
 282 #define SOLVER_REASON_RESOLVE_ORPHAN    8
 283
 284 #define SOLVER_REASON_RECOMMENDED       16
 285 #define SOLVER_REASON_SUPPLEMENTED      17
 286
 287
 288 #define SOLVER_FLAG_ALLOW_DOWNGRADE             1
 289 #define SOLVER_FLAG_ALLOW_ARCHCHANGE            2
 290 #define SOLVER_FLAG_ALLOW_VENDORCHANGE          3
 291 #define SOLVER_FLAG_ALLOW_UNINSTALL             4
 292 #define SOLVER_FLAG_NO_UPDATEPROVIDE            5
 293 #define SOLVER_FLAG_SPLITPROVIDES               6
 294 #define SOLVER_FLAG_IGNORE_RECOMMENDED          7
 295 #define SOLVER_FLAG_ADD_ALREADY_RECOMMENDED     8
 296 #define SOLVER_FLAG_NO_INFARCHCHECK             9
 297 #define SOLVER_FLAG_ALLOW_NAMECHANGE            10
 298 #define SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES     11
 299
 300 extern Solver *solver_create(Pool *pool);
 301 extern void solver_free(Solver *solv);
 302 extern int  solver_solve(Solver *solv, Queue *job);
 303 extern Transaction *solver_create_transaction(Solver *solv);
 304 extern int solver_set_flag(Solver *solv, int flag, int value);
 305 extern int solver_get_flag(Solver *solv, int flag);
 306
 307 extern int  solver_get_decisionlevel(Solver *solv, Id p);
 308 extern void solver_get_decisionqueue(Solver *solv, Queue *decisionq);
 309 extern int  solver_get_lastdecisionblocklevel(Solver *solv);
 310 extern void solver_get_decisionblock(Solver *solv, int level, Queue *decisionq);
 311
 312 extern void solver_get_orphaned(Solver *solv, Queue *orphanedq);
 313 extern void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected);
 314 extern void solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered);
 315
 316 extern int  solver_describe_decision(Solver *solv, Id p, Id *infop);
 317 extern void solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq);
 318
 319
 320 extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap);
 321 extern void solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap);
 322
 323 /* XXX: why is this not static? */
 324 Id *solver_create_decisions_obsoletesmap(Solver *solv);
 325
 326 void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps);
 327 int solver_calc_installsizechange(Solver *solv);
 328 void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res);
 329
 330 void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what);
 331 int  pool_isemptyupdatejob(Pool *pool, Id how, Id what);
 332
 333 /* iterate over all literals of a rule */
 334 /* WARNING: loop body must not relocate whatprovidesdata, e.g. by
 335  * looking up the providers of a dependency */
 336 #define FOR_RULELITERALS(l, dp, r)                              \
 337     for (l = r->d < 0 ? -r->d - 1 : r->d,                       \
 338          dp = !l ? &r->w2 : pool->whatprovidesdata + l,         \
 339          l = r->p; l; l = (dp != &r->w2 + 1 ? *dp++ : 0))
 340
 341 /* XXX: this currently doesn't work correctly for SOLVER_SOLVABLE_REPO and
 342    SOLVER_SOLVABLE_ALL */
 343
 344 /* iterate over all packages selected by a job */
 345 #define FOR_JOB_SELECT(p, pp, select, what)                                     \
 346     if (select == SOLVER_SOLVABLE_REPO || select == SOLVER_SOLVABLE_ALL)        \
 347         p = pp = 0;                                                             \
 348     else for (pp = (select == SOLVER_SOLVABLE ? 0 :                             \
 349                select == SOLVER_SOLVABLE_ONE_OF ? what :                        \
 350                pool_whatprovides(pool, what)),                                  \
 351          p = (select == SOLVER_SOLVABLE ? what : pool->whatprovidesdata[pp++]); \
 352                                          p ; p = pool->whatprovidesdata[pp++])  \
 353       if (select == SOLVER_SOLVABLE_NAME &&                                     \
 354                         pool_match_nevr(pool, pool->solvables + p, what) == 0)  \
 355         continue;                                                               \
 356       else
 357
 358 #ifdef __cplusplus
 359 }
 360 #endif
 361
 362 #endif /* LIBSOLV_SOLVER_H */