2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
13 #ifndef SATSOLVER_SOLVER_H
14 #define SATSOLVER_SOLVER_H
16 #include "pooltypes.h"
22 /* ----------------------------------------------
25 * providerN(B) == Package Id of package providing tag B
26 * N = 1, 2, 3, in case of multiple providers
28 * A requires B : !A | provider1(B) | provider2(B)
30 * A conflicts B : (!A | !provider1(B)) & (!A | !provider2(B)) ...
32 * 'not' is encoded as a negative Id
34 * Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
38 Id p; /* first literal in rule */
39 Id d; /* Id offset into 'list of providers terminated by 0' as used by whatprovides; pool->whatprovides + d */
40 /* in case of binary rules, d == 0, w1 == p, w2 == other literal */
41 Id w1, w2; /* watches, literals not-yet-decided */
42 /* if !w1, disabled */
43 /* if !w2, assertion, not rule */
44 Id n1, n2; /* next rules in linked list, corresponding to w1,w2 */
49 typedef struct solver {
53 int fixsystem; /* repair errors in rpm dependency graph */
54 int allowdowngrade; /* allow to downgrade installed solvable */
55 int allowarchchange; /* allow to change architecture of installed solvables */
56 int allowvendorchange; /* allow to change vendor of installed solvables */
57 int allowuninstall; /* allow removal of installed solvables */
58 int updatesystem; /* distupgrade */
59 int allowvirtualconflicts; /* false: conflicts on package name, true: conflicts on package provides */
60 int noupdateprovide; /* true: update packages needs not to provide old package */
61 int dosplitprovides; /* true: consider legacy split provides */
63 Rule *rules; /* all rules */
64 Id nrules; /* index of the last rule */
66 Id jobrules; /* user rules */
67 Id systemrules; /* policy rules, e.g. keep packages installed or update. All literals > 0 */
68 Id weakrules; /* rules that can be autodisabled */
69 Id learntrules; /* learnt rules */
71 Id *weaksystemrules; /* please try to install (r->d) */
72 Map noupdate; /* don't try to update these
73 installed solvables */
75 Id *watches; /* Array of rule offsets
76 * watches has nsolvables*2 entries and is addressed from the middle
77 * middle-solvable : decision to conflict, offset point to linked-list of rules
78 * middle+solvable : decision to install: offset point to linked-list of rules
85 Queue decisionq_why; /* index of rule, Offset into rules */
86 int directdecisions; /* number of decisions with no rule */
88 Id *decisionmap; /* map for all available solvables, > 0: level of decision when installed, < 0 level of decision when conflict */
90 /* learnt rule history */
95 int (*solution_callback)(struct solver *solv, void *data);
96 void *solution_callback_data;
101 Queue suggestions; /* suggested packages */
103 Map recommendsmap; /* recommended packages from decisionmap */
104 Map suggestsmap; /* suggested packages from decisionmap */
105 int recommends_index; /* recommended level */
107 Id *obsoletes; /* obsoletes for each installed solvable */
108 Id *obsoletes_data; /* data area for obsoletes */
110 Queue covenantq; /* Covenants honored by this solver (generic locks) */
120 SOLVER_INSTALL_SOLVABLE,
121 SOLVER_ERASE_SOLVABLE,
122 SOLVER_INSTALL_SOLVABLE_NAME,
123 SOLVER_ERASE_SOLVABLE_NAME,
124 SOLVER_INSTALL_SOLVABLE_PROVIDES,
125 SOLVER_ERASE_SOLVABLE_PROVIDES,
126 SOLVER_INSTALL_SOLVABLE_UPDATE
130 SOLVER_PROBLEM_UPDATE_RULE,
131 SOLVER_PROBLEM_JOB_RULE,
132 SOLVER_PROBLEM_JOB_NOTHING_PROVIDES_DEP,
133 SOLVER_PROBLEM_NOT_INSTALLABLE,
134 SOLVER_PROBLEM_NOTHING_PROVIDES_DEP,
135 SOLVER_PROBLEM_SAME_NAME,
136 SOLVER_PROBLEM_PACKAGE_CONFLICT,
137 SOLVER_PROBLEM_PACKAGE_OBSOLETES,
138 SOLVER_PROBLEM_DEP_PROVIDERS_NOT_INSTALLABLE
142 extern Solver *solver_create(Pool *pool, Repo *installed);
143 extern void solver_free(Solver *solv);
144 extern void solver_solve(Solver *solv, Queue *job);
145 extern int solver_dep_installed(Solver *solv, Id dep);
146 extern int solver_splitprovides(Solver *solv, Id dep);
148 extern Id solver_next_problem(Solver *solv, Id problem);
149 extern Id solver_next_solution(Solver *solv, Id problem, Id solution);
150 extern Id solver_next_solutionelement(Solver *solv, Id problem, Id solution, Id element, Id *p, Id *rp);
151 extern Id solver_findproblemrule(Solver *solv, Id problem);
152 extern SolverProbleminfo solver_problemruleinfo(Solver *solv, Queue *job, Id rid, Id *depp, Id *sourcep, Id *targetp);
154 Id *create_obsoletesmap(Solver *solv);
156 /* debug functions, do not use */
157 void printdecisions(Solver *solv);
158 void printsolutions(Solver *solv, Queue *job);
162 solver_dep_fulfilled(Solver *solv, Id dep)
164 Pool *pool = solv->pool;
169 Reldep *rd = GETRELDEP(pool, dep);
170 if (rd->flags == REL_AND)
172 if (!solver_dep_fulfilled(solv, rd->name))
174 return solver_dep_fulfilled(solv, rd->evr);
176 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
177 return solver_splitprovides(solv, rd->evr);
178 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_INSTALLED)
179 return solver_dep_installed(solv, rd->evr);
181 FOR_PROVIDES(p, pp, dep)
183 if (solv->decisionmap[p] > 0)
190 solver_is_supplementing(Solver *solv, Solvable *s)
193 if (!s->supplements && !s->freshens)
197 supp = s->repo->idarraydata + s->supplements;
198 while ((sup = *supp++) != 0)
199 if (solver_dep_fulfilled(solv, sup))
206 supp = s->repo->idarraydata + s->freshens;
207 while ((sup = *supp++) != 0)
208 if (solver_dep_fulfilled(solv, sup))
217 solver_is_enhancing(Solver *solv, Solvable *s)
222 enhp = s->repo->idarraydata + s->enhances;
223 while ((enh = *enhp++) != 0)
224 if (solver_dep_fulfilled(solv, enh))
229 #endif /* SATSOLVER_SOLVER_H */