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 Repo *installed; /* copy of pool->installed */
23 /* list of rules, ordered
24 * rpm rules first, then features, updates, jobs, learnt
25 * see start/end offsets below
27 Rule *rules; /* all rules */
28 Id nrules; /* [Offset] index of the last rule */
30 Queue ruleassertions; /* Queue of all assertion rules */
32 /* start/end offset for rule 'areas' */
34 Id rpmrules_end; /* [Offset] rpm rules end */
36 Id featurerules; /* feature rules start/end */
39 Id updaterules; /* policy rules, e.g. keep packages installed or update. All literals > 0 */
42 Id jobrules; /* user rules */
45 Id infarchrules; /* inferior arch rules */
48 Id duprules; /* dist upgrade rules */
51 Id choicerules; /* choice rules (always weak) */
55 Id learntrules; /* learnt rules, (end == nrules) */
57 Map noupdate; /* don't try to update these
58 installed solvables */
59 Map noobsoletes; /* ignore obsoletes for these (multiinstall) */
61 Map updatemap; /* bring these installed packages to the newest version */
62 int updatemap_all; /* bring all packages to the newest version */
64 Map fixmap; /* fix these packages */
65 int fixmap_all; /* fix all packages */
67 Queue weakruleq; /* index into 'rules' for weak ones */
68 Map weakrulemap; /* map rule# to '1' for weak rules, 1..learntrules */
70 Id *watches; /* Array of rule offsets
71 * watches has nsolvables*2 entries and is addressed from the middle
72 * middle-solvable : decision to conflict, offset point to linked-list of rules
73 * middle+solvable : decision to install: offset point to linked-list of rules
76 Queue ruletojob; /* index into job queue: jobs for which a rule exits */
79 Queue decisionq; /* >0:install, <0:remove/conflict */
80 Queue decisionq_why; /* index of rule, Offset into rules */
82 Id *decisionmap; /* map for all available solvables,
84 * > 0: level of decision when installed,
85 * < 0: level of decision when conflict */
87 int decisioncnt_update;
89 int decisioncnt_resolve;
91 int decisioncnt_orphan;
93 /* learnt rule history */
98 int (*solution_callback)(struct _Solver *solv, void *data);
99 void *solution_callback_data;
101 int propagate_index; /* index into decisionq for non-propagated decisions */
103 Queue problems; /* list of lists of conflicting rules, < 0 for job rules */
104 Queue solutions; /* refined problem storage space */
106 Queue recommendations; /* recommended packages */
107 Queue suggestions; /* suggested packages */
108 Queue orphaned; /* orphaned packages */
110 int stats_learned; /* statistic */
111 int stats_unsolvable; /* statistic */
113 Map recommendsmap; /* recommended packages from decisionmap */
114 Map suggestsmap; /* suggested packages from decisionmap */
115 int recommends_index; /* recommendsmap/suggestsmap is created up to this level */
117 Id *obsoletes; /* obsoletes for each installed solvable */
118 Id *obsoletes_data; /* data area for obsoletes */
119 Id *multiversionupdaters; /* updaters for multiversion packages in updatesystem mode */
121 /*-------------------------------------------------------------------------------------------------------------
122 * Solver configuration
123 *-------------------------------------------------------------------------------------------------------------*/
125 int fixsystem; /* repair errors in rpm dependency graph */
126 int allowdowngrade; /* allow to downgrade installed solvable */
127 int allowarchchange; /* allow to change architecture of installed solvables */
128 int allowvendorchange; /* allow to change vendor of installed solvables */
129 int allowuninstall; /* allow removal of installed solvables */
130 int updatesystem; /* update all packages to the newest version */
131 int noupdateprovide; /* true: update packages needs not to provide old package */
132 int dosplitprovides; /* true: consider legacy split provides */
133 int dontinstallrecommended; /* true: do not install recommended packages */
134 int ignorealreadyrecommended; /* true: ignore recommended packages that were already recommended by the installed packages */
135 int dontshowinstalledrecommended; /* true: do not show recommended packages that are already installed */
137 /* distupgrade also needs updatesystem and dosplitprovides */
139 int distupgrade_removeunsupported;
141 int noinfarchcheck; /* true: do not forbid inferior architectures */
143 /* Callbacks for defining the bahaviour of the SAT solver */
145 /* Finding best candidate
147 * Callback definition:
148 * void bestSolvable (Pool *pool, Queue *canditates)
149 * candidates : List of canditates which has to be sorted by the function call
150 * return candidates: Sorted list of the candidates(first is the best).
152 BestSolvableCb bestSolvableCb;
154 /* Checking if two solvables has compatible architectures
156 * Callback definition:
157 * int archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
159 * return 0 it the two solvables has compatible architectures
161 ArchCheckCb archCheckCb;
163 /* Checking if two solvables has compatible vendors
165 * Callback definition:
166 * int vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2);
168 * return 0 it the two solvables has compatible architectures
170 VendorCheckCb vendorCheckCb;
172 /* Evaluate update candidate
174 * Callback definition:
175 * void pdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates)
176 * solvable : for which updates should be search
177 * candidates : List of candidates (This list depends on other
178 * restrictions like architecture and vendor policies too)
180 UpdateCandidateCb updateCandidateCb;
182 Map dupmap; /* dup these packages*/
183 int dupmap_all; /* dup all packages */
184 Map dupinvolvedmap; /* packages involved in dup process */
186 Map droporphanedmap; /* packages to drop in dup mode */
187 int droporphanedmap_all;
189 Map cleandepsmap; /* try to drop these packages as of cleandeps erases */
191 Queue *ruleinfoq; /* tmp space for solver_ruleinfo() */
195 extern void solver_run_sat(Solver *solv, int disablerules, int doweak);
196 extern void solver_reset(Solver *solv);
198 extern int solver_dep_installed(Solver *solv, Id dep);
199 extern int solver_splitprovides(Solver *solv, Id dep);
202 solver_dep_fulfilled(Solver *solv, Id dep)
204 Pool *pool = solv->pool;
209 Reldep *rd = GETRELDEP(pool, dep);
210 if (rd->flags == REL_AND)
212 if (!solver_dep_fulfilled(solv, rd->name))
214 return solver_dep_fulfilled(solv, rd->evr);
216 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
217 return solver_splitprovides(solv, rd->evr);
218 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
219 return solver_dep_installed(solv, rd->evr);
221 FOR_PROVIDES(p, pp, dep)
223 if (solv->decisionmap[p] > 0)
230 solver_is_supplementing(Solver *solv, Solvable *s)
235 supp = s->repo->idarraydata + s->supplements;
236 while ((sup = *supp++) != 0)
237 if (solver_dep_fulfilled(solv, sup))
243 solver_is_enhancing(Solver *solv, Solvable *s)
248 enhp = s->repo->idarraydata + s->enhances;
249 while ((enh = *enhp++) != 0)
250 if (solver_dep_fulfilled(solv, enh))
255 #endif /* LIBSOLV_SOLVER_P_H */