2 * Copyright (c) 2011, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
9 * solver_p.h - private functions
13 #ifndef LIBSOLV_SOLVER_P_H
14 #define LIBSOLV_SOLVER_P_H
18 Pool *pool; /* back pointer to pool */
19 Queue job; /* copy of the job we're solving */
21 Transaction trans; /* calculated transaction */
23 Repo *installed; /* copy of pool->installed */
25 /* list of rules, ordered
26 * rpm rules first, then features, updates, jobs, learnt
27 * see start/end offsets below
29 Rule *rules; /* all rules */
30 Id nrules; /* [Offset] index of the last rule */
32 Queue ruleassertions; /* Queue of all assertion rules */
34 /* start/end offset for rule 'areas' */
36 Id rpmrules_end; /* [Offset] rpm rules end */
38 Id featurerules; /* feature rules start/end */
41 Id updaterules; /* policy rules, e.g. keep packages installed or update. All literals > 0 */
44 Id jobrules; /* user rules */
47 Id infarchrules; /* inferior arch rules */
50 Id duprules; /* dist upgrade rules */
53 Id choicerules; /* choice rules (always weak) */
57 Id learntrules; /* learnt rules, (end == nrules) */
59 Map noupdate; /* don't try to update these
60 installed solvables */
61 Map noobsoletes; /* ignore obsoletes for these (multiinstall) */
63 Map updatemap; /* bring these installed packages to the newest version */
64 int updatemap_all; /* bring all packages to the newest version */
66 Map fixmap; /* fix these packages */
67 int fixmap_all; /* fix all packages */
69 Queue weakruleq; /* index into 'rules' for weak ones */
70 Map weakrulemap; /* map rule# to '1' for weak rules, 1..learntrules */
72 Id *watches; /* Array of rule offsets
73 * watches has nsolvables*2 entries and is addressed from the middle
74 * middle-solvable : decision to conflict, offset point to linked-list of rules
75 * middle+solvable : decision to install: offset point to linked-list of rules
78 Queue ruletojob; /* index into job queue: jobs for which a rule exits */
81 Queue decisionq; /* >0:install, <0:remove/conflict */
82 Queue decisionq_why; /* index of rule, Offset into rules */
84 Id *decisionmap; /* map for all available solvables,
86 * > 0: level of decision when installed,
87 * < 0: level of decision when conflict */
89 int decisioncnt_update;
91 int decisioncnt_resolve;
93 int decisioncnt_orphan;
95 /* learnt rule history */
100 int (*solution_callback)(struct _Solver *solv, void *data);
101 void *solution_callback_data;
103 int propagate_index; /* index into decisionq for non-propagated decisions */
105 Queue problems; /* list of lists of conflicting rules, < 0 for job rules */
106 Queue solutions; /* refined problem storage space */
108 Queue recommendations; /* recommended packages */
109 Queue suggestions; /* suggested packages */
110 Queue orphaned; /* orphaned packages */
112 int stats_learned; /* statistic */
113 int stats_unsolvable; /* statistic */
115 Map recommendsmap; /* recommended packages from decisionmap */
116 Map suggestsmap; /* suggested packages from decisionmap */
117 int recommends_index; /* recommendsmap/suggestsmap is created up to this level */
119 Id *obsoletes; /* obsoletes for each installed solvable */
120 Id *obsoletes_data; /* data area for obsoletes */
121 Id *multiversionupdaters; /* updaters for multiversion packages in updatesystem mode */
123 /*-------------------------------------------------------------------------------------------------------------
124 * Solver configuration
125 *-------------------------------------------------------------------------------------------------------------*/
127 int fixsystem; /* repair errors in rpm dependency graph */
128 int allowdowngrade; /* allow to downgrade installed solvable */
129 int allowarchchange; /* allow to change architecture of installed solvables */
130 int allowvendorchange; /* allow to change vendor of installed solvables */
131 int allowuninstall; /* allow removal of installed solvables */
132 int updatesystem; /* update all packages to the newest version */
133 int noupdateprovide; /* true: update packages needs not to provide old package */
134 int dosplitprovides; /* true: consider legacy split provides */
135 int dontinstallrecommended; /* true: do not install recommended packages */
136 int ignorealreadyrecommended; /* true: ignore recommended packages that were already recommended by the installed packages */
137 int dontshowinstalledrecommended; /* true: do not show recommended packages that are already installed */
139 /* distupgrade also needs updatesystem and dosplitprovides */
141 int distupgrade_removeunsupported;
143 int noinfarchcheck; /* true: do not forbid inferior architectures */
145 /* Callbacks for defining the bahaviour of the SAT solver */
147 /* Finding best candidate
149 * Callback definition:
150 * void bestSolvable (Pool *pool, Queue *canditates)
151 * candidates : List of canditates which has to be sorted by the function call
152 * return candidates: Sorted list of the candidates(first is the best).
154 BestSolvableCb bestSolvableCb;
156 /* Checking if two solvables has compatible architectures
158 * Callback definition:
159 * int archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
161 * return 0 it the two solvables has compatible architectures
163 ArchCheckCb archCheckCb;
165 /* Checking if two solvables has compatible vendors
167 * Callback definition:
168 * int vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
170 * return 0 it the two solvables has compatible architectures
172 VendorCheckCb vendorCheckCb;
174 /* Evaluate update candidate
176 * Callback definition:
177 * void pdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
178 * solvable : for which updates should be search
179 * candidates : List of candidates (This list depends on other
180 * restrictions like architecture and vendor policies too)
182 UpdateCandidateCb updateCandidateCb;
184 Map dupmap; /* dup these packages*/
185 int dupmap_all; /* dup all packages */
186 Map dupinvolvedmap; /* packages involved in dup process */
188 Map droporphanedmap; /* packages to drop in dup mode */
189 int droporphanedmap_all;
191 Map cleandepsmap; /* try to drop these packages as of cleandeps erases */
193 Queue *ruleinfoq; /* tmp space for solver_ruleinfo() */
197 extern void solver_run_sat(Solver *solv, int disablerules, int doweak);
198 extern void solver_reset(Solver *solv);
200 extern int solver_dep_installed(Solver *solv, Id dep);
201 extern int solver_splitprovides(Solver *solv, Id dep);
204 solver_dep_fulfilled(Solver *solv, Id dep)
206 Pool *pool = solv->pool;
211 Reldep *rd = GETRELDEP(pool, dep);
212 if (rd->flags == REL_AND)
214 if (!solver_dep_fulfilled(solv, rd->name))
216 return solver_dep_fulfilled(solv, rd->evr);
218 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
219 return solver_splitprovides(solv, rd->evr);
220 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
221 return solver_dep_installed(solv, rd->evr);
223 FOR_PROVIDES(p, pp, dep)
225 if (solv->decisionmap[p] > 0)
232 solver_is_supplementing(Solver *solv, Solvable *s)
237 supp = s->repo->idarraydata + s->supplements;
238 while ((sup = *supp++) != 0)
239 if (solver_dep_fulfilled(solv, sup))
245 solver_is_enhancing(Solver *solv, Solvable *s)
250 enhp = s->repo->idarraydata + s->enhances;
251 while ((enh = *enhp++) != 0)
252 if (solver_dep_fulfilled(solv, enh))
257 #endif /* LIBSOLV_SOLVER_P_H */