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 */
90 int decisioncnt_orphan;
92 /* learnt rule history */
97 int (*solution_callback)(struct _Solver *solv, void *data);
98 void *solution_callback_data;
100 int propagate_index; /* index into decisionq for non-propagated decisions */
102 Queue problems; /* list of lists of conflicting rules, < 0 for job rules */
103 Queue solutions; /* refined problem storage space */
105 Queue recommendations; /* recommended packages */
106 Queue suggestions; /* suggested packages */
107 Queue orphaned; /* orphaned packages */
109 int stats_learned; /* statistic */
110 int stats_unsolvable; /* statistic */
112 Map recommendsmap; /* recommended packages from decisionmap */
113 Map suggestsmap; /* suggested packages from decisionmap */
114 int recommends_index; /* recommendsmap/suggestsmap is created up to this level */
116 Id *obsoletes; /* obsoletes for each installed solvable */
117 Id *obsoletes_data; /* data area for obsoletes */
118 Id *multiversionupdaters; /* updaters for multiversion packages in updatesystem mode */
120 /*-------------------------------------------------------------------------------------------------------------
121 * Solver configuration
122 *-------------------------------------------------------------------------------------------------------------*/
124 int fixsystem; /* repair errors in rpm dependency graph */
125 int allowdowngrade; /* allow to downgrade installed solvable */
126 int allowarchchange; /* allow to change architecture of installed solvables */
127 int allowvendorchange; /* allow to change vendor of installed solvables */
128 int allowuninstall; /* allow removal of installed solvables */
129 int updatesystem; /* update all packages to the newest version */
130 int noupdateprovide; /* true: update packages needs not to provide old package */
131 int dosplitprovides; /* true: consider legacy split provides */
132 int dontinstallrecommended; /* true: do not install recommended packages */
133 int ignorealreadyrecommended; /* true: ignore recommended packages that were already recommended by the installed packages */
134 int dontshowinstalledrecommended; /* true: do not show recommended packages that are already installed */
136 /* distupgrade also needs updatesystem and dosplitprovides */
138 int distupgrade_removeunsupported;
140 int noinfarchcheck; /* true: do not forbid inferior architectures */
142 /* Callbacks for defining the bahaviour of the SAT solver */
144 /* Finding best candidate
146 * Callback definition:
147 * void bestSolvable (Pool *pool, Queue *canditates)
148 * candidates : List of canditates which has to be sorted by the function call
149 * return candidates: Sorted list of the candidates(first is the best).
151 BestSolvableCb bestSolvableCb;
153 /* Checking if two solvables has compatible architectures
155 * Callback definition:
156 * int archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
158 * return 0 it the two solvables has compatible architectures
160 ArchCheckCb archCheckCb;
162 /* Checking if two solvables has compatible vendors
164 * Callback definition:
165 * int vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
167 * return 0 it the two solvables has compatible architectures
169 VendorCheckCb vendorCheckCb;
171 /* Evaluate update candidate
173 * Callback definition:
174 * void pdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
175 * solvable : for which updates should be search
176 * candidates : List of candidates (This list depends on other
177 * restrictions like architecture and vendor policies too)
179 UpdateCandidateCb updateCandidateCb;
181 Map dupmap; /* dup these packages*/
182 int dupmap_all; /* dup all packages */
183 Map dupinvolvedmap; /* packages involved in dup process */
185 Map droporphanedmap; /* packages to drop in dup mode */
186 int droporphanedmap_all;
188 Map cleandepsmap; /* try to drop these packages as of cleandeps erases */
190 Queue *ruleinfoq; /* tmp space for solver_ruleinfo() */
194 extern void solver_run_sat(Solver *solv, int disablerules, int doweak);
195 extern void solver_reset(Solver *solv);
197 extern int solver_dep_installed(Solver *solv, Id dep);
198 extern int solver_splitprovides(Solver *solv, Id dep);
201 solver_dep_fulfilled(Solver *solv, Id dep)
203 Pool *pool = solv->pool;
208 Reldep *rd = GETRELDEP(pool, dep);
209 if (rd->flags == REL_AND)
211 if (!solver_dep_fulfilled(solv, rd->name))
213 return solver_dep_fulfilled(solv, rd->evr);
215 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
216 return solver_splitprovides(solv, rd->evr);
217 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
218 return solver_dep_installed(solv, rd->evr);
220 FOR_PROVIDES(p, pp, dep)
222 if (solv->decisionmap[p] > 0)
229 solver_is_supplementing(Solver *solv, Solvable *s)
234 supp = s->repo->idarraydata + s->supplements;
235 while ((sup = *supp++) != 0)
236 if (solver_dep_fulfilled(solv, sup))
242 solver_is_enhancing(Solver *solv, Solvable *s)
247 enhp = s->repo->idarraydata + s->enhances;
248 while ((enh = *enhp++) != 0)
249 if (solver_dep_fulfilled(solv, enh))
254 #endif /* LIBSOLV_SOLVER_P_H */