2 * Copyright (c) 2011, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
9 * solver_private.h - private functions
13 #ifndef LIBSOLV_SOLVER_PRIVATE_H
14 #define LIBSOLV_SOLVER_PRIVATE_H
16 extern void solver_run_sat(Solver *solv, int disablerules, int doweak);
17 extern void solver_reset(Solver *solv);
19 extern int solver_splitprovides(Solver *solv, Id dep, Map *m);
20 extern int solver_dep_possible_slow(Solver *solv, Id dep, Map *m);
21 extern int solver_dep_fulfilled_cplx(Solver *solv, Reldep *rd);
22 extern int solver_is_supplementing_alreadyinstalled(Solver *solv, Solvable *s);
23 extern void solver_intersect_obsoleted(Solver *solv, Id p, Queue *q, int qstart, Map *m);
25 extern void solver_createcleandepsmap(Solver *solv, Map *cleandepsmap, int unneeded);
26 extern int solver_check_cleandeps_mistakes(Solver *solv);
29 #define ISSIMPLEDEP(pool, dep) (!ISRELDEP(dep) || GETRELDEP(pool, dep)->flags < 8)
32 solver_dep_possible(Solver *solv, Id dep, Map *m)
34 Pool *pool = solv->pool;
37 if (!ISSIMPLEDEP(pool, dep))
38 return solver_dep_possible_slow(solv, dep, m);
39 FOR_PROVIDES(p, pp, dep)
48 solver_dep_fulfilled(Solver *solv, Id dep)
50 Pool *pool = solv->pool;
55 Reldep *rd = GETRELDEP(pool, dep);
56 if (rd->flags == REL_COND || rd->flags == REL_UNLESS || rd->flags == REL_AND || rd->flags == REL_OR)
57 return solver_dep_fulfilled_cplx(solv, rd);
58 if (rd->flags == REL_NAMESPACE && rd->name == NAMESPACE_SPLITPROVIDES)
59 return solver_splitprovides(solv, rd->evr, 0);
61 FOR_PROVIDES(p, pp, dep)
63 if (solv->decisionmap[p] > 0)
70 solver_is_supplementing(Solver *solv, Solvable *s)
75 supp = s->repo->idarraydata + s->supplements;
76 while ((sup = *supp++) != 0)
77 if (solver_dep_fulfilled(solv, sup))
83 solver_is_enhancing(Solver *solv, Solvable *s)
88 enhp = s->repo->idarraydata + s->enhances;
89 while ((enh = *enhp++) != 0)
90 if (solver_dep_fulfilled(solv, enh))
95 #endif /* LIBSOLV_SOLVER_PRIVATE_H */