ebb2232bb0a3e11aa415194e4616d7962494687a
[platform/upstream/libsolv.git] / 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 #include "pooltypes.h"
17 #include "pool.h"
18 #include "repo.h"
19 #include "queue.h"
20 #include "bitmap.h"
21 #include "transaction.h"
22 #include "rules.h"
23 #include "problems.h"
24
25 #ifdef __cplusplus
26 extern "C" {
27 #endif
28
29 struct _Solver {
30   Pool *pool;                           /* back pointer to pool */
31   Queue job;                            /* copy of the job we're solving */
32
33   int (*solution_callback)(struct _Solver *solv, void *data);
34   void *solution_callback_data;
35
36   int pooljobcnt;                       /* number of pooljob entries in job queue */
37
38 #ifdef LIBSOLV_INTERNAL
39   Repo *installed;                      /* copy of pool->installed */
40
41   /* list of rules, ordered
42    * pkg rules first, then features, updates, jobs, learnt
43    * see start/end offsets below
44    */
45   Rule *rules;                          /* all rules */
46   Id nrules;                            /* [Offset] index of the last rule */
47   Id lastpkgrule;                       /* last package rule we added */
48
49   Queue ruleassertions;                 /* Queue of all assertion rules */
50
51   /* start/end offset for rule 'areas' */
52
53   Id pkgrules_end;                      /* [Offset] dep rules end */
54
55   Id featurerules;                      /* feature rules start/end */
56   Id featurerules_end;
57
58   Id updaterules;                       /* policy rules, e.g. keep packages installed or update. All literals > 0 */
59   Id updaterules_end;
60
61   Id jobrules;                          /* user rules */
62   Id jobrules_end;
63
64   Id infarchrules;                      /* inferior arch rules */
65   Id infarchrules_end;
66
67   Id duprules;                          /* dist upgrade rules */
68   Id duprules_end;
69
70   Id bestrules;                         /* rules from SOLVER_FORCEBEST */
71   Id bestrules_up;                      /* update rule part starts here*/
72   Id bestrules_end;
73   Id *bestrules_pkg;
74
75   Id yumobsrules;                       /* rules from yum obsoletes handling */
76   Id yumobsrules_end;
77   Id *yumobsrules_info;                 /* the dependency for each rule */
78
79   Id choicerules;                       /* choice rules (always weak) */
80   Id choicerules_end;
81   Id *choicerules_ref;
82
83   Id learntrules;                       /* learnt rules, (end == nrules) */
84
85   Map noupdate;                         /* don't try to update these
86                                            installed solvables */
87   Map multiversion;                     /* ignore obsoletes for these (multiinstall) */
88
89   Map updatemap;                        /* bring these installed packages to the newest version */
90   int updatemap_all;                    /* bring all packages to the newest version */
91
92   Map bestupdatemap;                    /* create best rule for those packages */
93   int bestupdatemap_all;                /* bring all packages to the newest version */
94
95   Map fixmap;                           /* fix these packages */
96   int fixmap_all;                       /* fix all packages */
97
98   Queue weakruleq;                      /* index into 'rules' for weak ones */
99   Map weakrulemap;                      /* map rule# to '1' for weak rules, 1..learntrules */
100
101   Id *watches;                          /* Array of rule offsets
102                                          * watches has nsolvables*2 entries and is addressed from the middle
103                                          * middle-solvable : decision to conflict, offset point to linked-list of rules
104                                          * middle+solvable : decision to install: offset point to linked-list of rules
105                                          */
106
107   Queue ruletojob;                      /* index into job queue: jobs for which a rule exits */
108
109   /* our decisions: */
110   Queue decisionq;                      /* >0:install, <0:remove/conflict */
111   Queue decisionq_why;                  /* index of rule, Offset into rules */
112   Queue decisionq_reason;               /* reason for decision, indexed by level */
113
114   Id *decisionmap;                      /* map for all available solvables,
115                                          * = 0: undecided
116                                          * > 0: level of decision when installed,
117                                          * < 0: level of decision when conflict */
118
119   /* learnt rule history */
120   Queue learnt_why;
121   Queue learnt_pool;
122
123   Queue branches;
124   int propagate_index;                  /* index into decisionq for non-propagated decisions */
125
126   Queue problems;                       /* list of lists of conflicting rules, < 0 for job rules */
127   Queue solutions;                      /* refined problem storage space */
128
129   Queue orphaned;                       /* orphaned packages (to be removed?) */
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   Queue *recommendscplxq;
138   Queue *suggestscplxq;
139
140   Id *obsoletes;                        /* obsoletes for each installed solvable */
141   Id *obsoletes_data;                   /* data area for obsoletes */
142   Id *specialupdaters;                  /* updaters for packages with a limited update rule */
143
144   /*-------------------------------------------------------------------------------------------------------------
145    * Solver configuration
146    *-------------------------------------------------------------------------------------------------------------*/
147
148   int allowdowngrade;                   /* allow to downgrade installed solvable */
149   int allownamechange;                  /* allow to change name of installed solvables */
150   int allowarchchange;                  /* allow to change architecture of installed solvables */
151   int allowvendorchange;                /* allow to change vendor of installed solvables */
152   int allowuninstall;                   /* allow removal of installed solvables */
153   int noupdateprovide;                  /* true: update packages needs not to provide old package */
154   int needupdateprovide;                /* true: update packages must provide old package */
155   int dosplitprovides;                  /* true: consider legacy split provides */
156   int dontinstallrecommended;           /* true: do not install recommended packages */
157   int addalreadyrecommended;            /* true: also install recommended packages that were already recommended by the installed packages */
158   int dontshowinstalledrecommended;     /* true: do not show recommended packages that are already installed */
159
160   int noinfarchcheck;                   /* true: do not forbid inferior architectures */
161   int keepexplicitobsoletes;            /* true: honor obsoletes during multiinstall */
162   int bestobeypolicy;                   /* true: stay in policy with the best rules */
163   int noautotarget;                     /* true: do not assume targeted for up/dup jobs that contain no installed solvable */
164   int focus_installed;                  /* true: resolve update rules first */
165   int focus_best;                       /* true: resolve job dependencies first */
166   int do_yum_obsoletes;                 /* true: add special yumobs rules */
167   int urpmreorder;                      /* true: do special urpm package reordering */
168   int strongrecommends;                 /* true: create weak rules for recommends */
169   int install_also_updates;             /* true: do not prune install job rules to installed packages */
170
171   int process_orphans;                  /* true: do special orphan processing */
172   Map dupmap;                           /* dup to those packages */
173   Map dupinvolvedmap;                   /* packages involved in dup process */
174   int dupinvolvedmap_all;               /* all packages are involved */
175   int dup_allowdowngrade;               /* dup mode: allow to downgrade installed solvable */
176   int dup_allownamechange;              /* dup mode: allow to change name of installed solvable */
177   int dup_allowarchchange;              /* dup mode: allow to change architecture of installed solvables */
178   int dup_allowvendorchange;            /* dup mode: allow to change vendor of installed solvables */
179
180   Map droporphanedmap;                  /* packages to drop in dup mode */
181   int droporphanedmap_all;
182
183   Map cleandepsmap;                     /* try to drop these packages as of cleandeps erases */
184
185   Queue *ruleinfoq;                     /* tmp space for solver_ruleinfo() */
186
187   Queue *cleandeps_updatepkgs;          /* packages we update in cleandeps mode */
188   Queue *cleandeps_mistakes;            /* mistakes we made */
189
190   Queue *update_targets;                /* update to specific packages */
191
192   Queue *installsuppdepq;               /* deps from the install namespace provides hack */
193
194   Queue addedmap_deduceq;               /* deduce addedmap from pkg rules */
195   Id *instbuddy;                        /* buddies of installed packages */
196   int keep_orphans;                     /* how to treat orphans */
197   int break_orphans;                    /* how to treat orphans */
198   Queue *brokenorphanrules;             /* broken rules of orphaned packages */
199
200   Map allowuninstallmap;                /* ok to uninstall those */
201   int allowuninstall_all;
202
203   Queue *favorq;
204   Map favormap;                         /* favored / disfavored packages */
205   Map isdisfavormap;
206
207   int installedpos;                     /* for resolve_installed */
208   int do_extra_reordering;              /* reorder for future installed packages */
209
210   Queue *recommendsruleq;               /* pkg rules comming from recommends */
211 #endif  /* LIBSOLV_INTERNAL */
212 };
213
214 typedef struct _Solver Solver;
215
216 /*
217  * queue commands
218  */
219
220 #define SOLVER_SOLVABLE                 0x01
221 #define SOLVER_SOLVABLE_NAME            0x02
222 #define SOLVER_SOLVABLE_PROVIDES        0x03
223 #define SOLVER_SOLVABLE_ONE_OF          0x04
224 #define SOLVER_SOLVABLE_REPO            0x05
225 #define SOLVER_SOLVABLE_ALL             0x06
226
227 #define SOLVER_SELECTMASK               0xff
228
229 #define SOLVER_NOOP                     0x0000
230 #define SOLVER_INSTALL                  0x0100
231 #define SOLVER_ERASE                    0x0200
232 #define SOLVER_UPDATE                   0x0300
233 #define SOLVER_WEAKENDEPS               0x0400
234 #define SOLVER_MULTIVERSION             0x0500
235 #define SOLVER_LOCK                     0x0600
236 #define SOLVER_DISTUPGRADE              0x0700
237 #define SOLVER_VERIFY                   0x0800
238 #define SOLVER_DROP_ORPHANED            0x0900
239 #define SOLVER_USERINSTALLED            0x0a00
240 #define SOLVER_ALLOWUNINSTALL           0x0b00
241 #define SOLVER_FAVOR                    0x0c00
242 #define SOLVER_DISFAVOR                 0x0d00
243
244 #define SOLVER_JOBMASK                  0xff00
245
246 #define SOLVER_WEAK                     0x010000
247 #define SOLVER_ESSENTIAL                0x020000
248 #define SOLVER_CLEANDEPS                0x040000
249 /* ORUPDATE makes SOLVER_INSTALL not prune to installed
250  * packages, thus updating installed packages */
251 #define SOLVER_ORUPDATE                 0x080000
252 /* FORCEBEST makes the solver insist on best packages, so
253  * you will get problem reported if the best package is
254  * not installable. This can be used with INSTALL, UPDATE
255  * and DISTUPGRADE */
256 #define SOLVER_FORCEBEST                0x100000
257 /* TARGETED is used in up/dup jobs to make the solver
258  * treat the specified selection as target packages.
259  * It is automatically assumed if the selection does not
260  * contain an "installed" package unless the
261  * NO_AUTOTARGET solver flag is set */
262 #define SOLVER_TARGETED                 0x200000
263 /* This (SOLVER_INSTALL) job was automatically added
264  * and thus does not the add to the userinstalled packages */
265 #define SOLVER_NOTBYUSER                0x400000
266
267 #define SOLVER_SETEV                    0x01000000
268 #define SOLVER_SETEVR                   0x02000000
269 #define SOLVER_SETARCH                  0x04000000
270 #define SOLVER_SETVENDOR                0x08000000
271 #define SOLVER_SETREPO                  0x10000000
272 #define SOLVER_NOAUTOSET                0x20000000
273 #define SOLVER_SETNAME                  0x40000000
274
275 #define SOLVER_SETMASK                  0x7f000000
276
277 /* legacy */
278 #define SOLVER_NOOBSOLETES              SOLVER_MULTIVERSION
279
280 #define SOLVER_REASON_UNRELATED         0
281 #define SOLVER_REASON_UNIT_RULE         1
282 #define SOLVER_REASON_KEEP_INSTALLED    2
283 #define SOLVER_REASON_RESOLVE_JOB       3
284 #define SOLVER_REASON_UPDATE_INSTALLED  4
285 #define SOLVER_REASON_CLEANDEPS_ERASE   5
286 #define SOLVER_REASON_RESOLVE           6
287 #define SOLVER_REASON_WEAKDEP           7
288 #define SOLVER_REASON_RESOLVE_ORPHAN    8
289
290 #define SOLVER_REASON_RECOMMENDED       16
291 #define SOLVER_REASON_SUPPLEMENTED      17
292
293
294 #define SOLVER_FLAG_ALLOW_DOWNGRADE             1
295 #define SOLVER_FLAG_ALLOW_ARCHCHANGE            2
296 #define SOLVER_FLAG_ALLOW_VENDORCHANGE          3
297 #define SOLVER_FLAG_ALLOW_UNINSTALL             4
298 #define SOLVER_FLAG_NO_UPDATEPROVIDE            5
299 #define SOLVER_FLAG_SPLITPROVIDES               6
300 #define SOLVER_FLAG_IGNORE_RECOMMENDED          7
301 #define SOLVER_FLAG_ADD_ALREADY_RECOMMENDED     8
302 #define SOLVER_FLAG_NO_INFARCHCHECK             9
303 #define SOLVER_FLAG_ALLOW_NAMECHANGE            10
304 #define SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES     11
305 #define SOLVER_FLAG_BEST_OBEY_POLICY            12
306 #define SOLVER_FLAG_NO_AUTOTARGET               13
307 #define SOLVER_FLAG_DUP_ALLOW_DOWNGRADE         14
308 #define SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE        15
309 #define SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE      16
310 #define SOLVER_FLAG_DUP_ALLOW_NAMECHANGE        17
311 #define SOLVER_FLAG_KEEP_ORPHANS                18
312 #define SOLVER_FLAG_BREAK_ORPHANS               19
313 #define SOLVER_FLAG_FOCUS_INSTALLED             20
314 #define SOLVER_FLAG_YUM_OBSOLETES               21
315 #define SOLVER_FLAG_NEED_UPDATEPROVIDE          22
316 #define SOLVER_FLAG_URPM_REORDER                23
317 #define SOLVER_FLAG_FOCUS_BEST                  24
318 #define SOLVER_FLAG_STRONG_RECOMMENDS           25
319 #define SOLVER_FLAG_INSTALL_ALSO_UPDATES        26
320
321 #define GET_USERINSTALLED_NAMES                 (1 << 0)        /* package names instead of ids */
322 #define GET_USERINSTALLED_INVERTED              (1 << 1)        /* autoinstalled */
323 #define GET_USERINSTALLED_NAMEARCH              (1 << 2)        /* package/arch tuples instead of ids */
324
325 #define SOLVER_ALTERNATIVE_TYPE_RULE            1
326 #define SOLVER_ALTERNATIVE_TYPE_RECOMMENDS      2
327 #define SOLVER_ALTERNATIVE_TYPE_SUGGESTS        3
328
329 extern Solver *solver_create(Pool *pool);
330 extern void solver_free(Solver *solv);
331 extern int  solver_solve(Solver *solv, Queue *job);
332 extern Transaction *solver_create_transaction(Solver *solv);
333 extern int solver_set_flag(Solver *solv, int flag, int value);
334 extern int solver_get_flag(Solver *solv, int flag);
335
336 extern int  solver_get_decisionlevel(Solver *solv, Id p);
337 extern void solver_get_decisionqueue(Solver *solv, Queue *decisionq);
338 extern int  solver_get_lastdecisionblocklevel(Solver *solv);
339 extern void solver_get_decisionblock(Solver *solv, int level, Queue *decisionq);
340
341 extern void solver_get_orphaned(Solver *solv, Queue *orphanedq);
342 extern void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected);
343 extern void solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered);
344 extern void solver_get_userinstalled(Solver *solv, Queue *q, int flags);
345 extern void pool_add_userinstalled_jobs(Pool *pool, Queue *q, Queue *job, int flags);
346 extern void solver_get_cleandeps(Solver *solv, Queue *cleandepsq);
347
348 extern int  solver_describe_decision(Solver *solv, Id p, Id *infop);
349 extern void solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq);
350
351 extern int solver_alternatives_count(Solver *solv);
352 extern int solver_get_alternative(Solver *solv, Id alternative, Id *idp, Id *fromp, Id *chosenp, Queue *choices, int *levelp);
353
354 extern void solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap);
355 extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap);    /* obsolete */
356 extern void solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap);
357
358 extern void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps);
359 extern int solver_calc_installsizechange(Solver *solv);
360
361 extern void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what);
362 extern int  pool_isemptyupdatejob(Pool *pool, Id how, Id what);
363
364 extern const char *solver_select2str(Pool *pool, Id select, Id what);
365 extern const char *pool_job2str(Pool *pool, Id how, Id what, Id flagmask);
366 extern const char *solver_alternative2str(Solver *solv, int type, Id id, Id from);
367
368
369 /* iterate over all literals of a rule */
370 #define FOR_RULELITERALS(l, pp, r)                              \
371     for (pp = r->d < 0 ? -r->d - 1 : r->d,                      \
372          l = r->p; l; l = (pp <= 0 ? (pp-- ? 0 : r->w2) :       \
373          pool->whatprovidesdata[pp++]))
374
375
376
377
378 /* XXX: this currently doesn't work correctly for SOLVER_SOLVABLE_REPO and
379    SOLVER_SOLVABLE_ALL */
380
381 /* iterate over all packages selected by a job */
382 #define FOR_JOB_SELECT(p, pp, select, what)                                     \
383     if (select == SOLVER_SOLVABLE_REPO || select == SOLVER_SOLVABLE_ALL)        \
384         p = pp = 0;                                                             \
385     else for (pp = (select == SOLVER_SOLVABLE ? 0 :                             \
386                select == SOLVER_SOLVABLE_ONE_OF ? what :                        \
387                pool_whatprovides(pool, what)),                                  \
388          p = (select == SOLVER_SOLVABLE ? what : pool->whatprovidesdata[pp++]); \
389                                          p ; p = pool->whatprovidesdata[pp++])  \
390       if (select == SOLVER_SOLVABLE_NAME &&                                     \
391                         pool_match_nevr(pool, pool->solvables + p, what) == 0)  \
392         continue;                                                               \
393       else
394
395 /* weird suse stuff */
396 extern void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res);
397
398 #ifdef __cplusplus
399 }
400 #endif
401
402 #endif /* LIBSOLV_SOLVER_H */