File size: 6,650 Bytes
4dd49b2 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 | /*
* Copyright (c) 2007-2009, Novell Inc.
*
* This program is licensed under the BSD license, read LICENSE.BSD
* for further information
*/
/*
* rules.h
*
*/
#ifndef LIBSOLV_RULES_H
#define LIBSOLV_RULES_H
#include "pooltypes.h"
#include "bitmap.h"
#include "queue.h"
#ifdef __cplusplus
extern "C" {
#endif
/* ----------------------------------------------
* Rule
*
* providerN(B) == Package Id of package providing tag B
* N = 1, 2, 3, in case of multiple providers
*
* A requires B : !A | provider1(B) | provider2(B)
*
* A conflicts B : (!A | !provider1(B)) & (!A | !provider2(B)) ...
*
* 'not' is encoded as a negative Id
*
* Binary rule: p = first literal, d = 0, w2 = second literal, w1 = p
*
* There are a lot of rules, so the struct is kept as small as
* possible. Do not add new members unless there is no other way.
*/
typedef struct s_Rule {
Id p; /* first literal in rule */
Id d; /* Id offset into 'list of providers terminated by 0' as used by whatprovides; pool->whatprovides + d */
/* in case of binary rules, d == 0, w1 == p, w2 == other literal */
/* in case of disabled rules: ~d, aka -d - 1 */
Id w1, w2; /* watches, literals not-yet-decided */
/* if !w2, assertion, not rule */
Id n1, n2; /* next rules in linked list, corresponding to w1, w2 */
} Rule;
typedef enum {
SOLVER_RULE_UNKNOWN = 0,
SOLVER_RULE_PKG = 0x100,
SOLVER_RULE_PKG_NOT_INSTALLABLE,
SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP,
SOLVER_RULE_PKG_REQUIRES,
SOLVER_RULE_PKG_SELF_CONFLICT,
SOLVER_RULE_PKG_CONFLICTS,
SOLVER_RULE_PKG_SAME_NAME,
SOLVER_RULE_PKG_OBSOLETES,
SOLVER_RULE_PKG_IMPLICIT_OBSOLETES,
SOLVER_RULE_PKG_INSTALLED_OBSOLETES,
SOLVER_RULE_PKG_RECOMMENDS,
SOLVER_RULE_PKG_CONSTRAINS,
SOLVER_RULE_PKG_SUPPLEMENTS,
SOLVER_RULE_UPDATE = 0x200,
SOLVER_RULE_FEATURE = 0x300,
SOLVER_RULE_JOB = 0x400,
SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP,
SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM,
SOLVER_RULE_JOB_UNKNOWN_PACKAGE,
SOLVER_RULE_JOB_UNSUPPORTED,
SOLVER_RULE_DISTUPGRADE = 0x500,
SOLVER_RULE_INFARCH = 0x600,
SOLVER_RULE_CHOICE = 0x700,
SOLVER_RULE_LEARNT = 0x800,
SOLVER_RULE_BEST = 0x900,
SOLVER_RULE_YUMOBS = 0xa00,
SOLVER_RULE_RECOMMENDS = 0xb00,
SOLVER_RULE_BLACK = 0xc00,
SOLVER_RULE_STRICT_REPO_PRIORITY = 0xd00
} SolverRuleinfo;
#define SOLVER_RULE_TYPEMASK 0xff00
struct s_Solver;
/*-------------------------------------------------------------------
* disable rule
*/
static inline void
solver_disablerule(struct s_Solver *solv, Rule *r)
{
if (r->d >= 0)
r->d = -r->d - 1;
}
/*-------------------------------------------------------------------
* enable rule
*/
static inline void
solver_enablerule(struct s_Solver *solv, Rule *r)
{
if (r->d < 0)
r->d = -r->d - 1;
}
extern Rule *solver_addrule(struct s_Solver *solv, Id p, Id p2, Id d);
extern void solver_unifyrules(struct s_Solver *solv);
extern int solver_rulecmp(struct s_Solver *solv, Rule *r1, Rule *r2);
extern void solver_shrinkrules(struct s_Solver *solv, int nrules);
/* pkg rules */
extern void solver_addpkgrulesforsolvable(struct s_Solver *solv, Solvable *s, Map *m);
extern void solver_addpkgrulesforweak(struct s_Solver *solv, Map *m);
extern void solver_addpkgrulesforlinked(struct s_Solver *solv, Map *m);
extern void solver_addpkgrulesforupdaters(struct s_Solver *solv, Solvable *s, Map *m, int allow_all);
/* update/feature rules */
extern void solver_addfeaturerule(struct s_Solver *solv, Solvable *s);
extern void solver_addupdaterule(struct s_Solver *solv, Solvable *s);
/* infarch rules */
extern void solver_addinfarchrules(struct s_Solver *solv, Map *addedmap);
/* dup rules */
extern void solver_createdupmaps(struct s_Solver *solv);
extern void solver_freedupmaps(struct s_Solver *solv);
extern void solver_addduprules(struct s_Solver *solv, Map *addedmap);
/* choice rules */
extern void solver_addchoicerules(struct s_Solver *solv);
extern void solver_disablechoicerules(struct s_Solver *solv, Rule *r);
/* best rules */
extern void solver_addbestrules(struct s_Solver *solv, int havebestinstalljobs, int haslockjob);
/* yumobs rules */
extern void solver_addyumobsrules(struct s_Solver *solv);
/* black rules */
extern void solver_addblackrules(struct s_Solver *solv);
/* recommends rules */
extern void solver_addrecommendsrules(struct s_Solver *solv);
/* channel priority rules */
extern void solver_addstrictrepopriorules(struct s_Solver *solv, Map *addedmap);
/* policy rule disabling/reenabling */
extern void solver_disablepolicyrules(struct s_Solver *solv);
extern void solver_reenablepolicyrules(struct s_Solver *solv, int jobidx);
extern void solver_reenablepolicyrules_cleandeps(struct s_Solver *solv, Id pkg);
/* rule info */
extern int solver_allruleinfos(struct s_Solver *solv, Id rid, Queue *rq);
extern SolverRuleinfo solver_ruleinfo(struct s_Solver *solv, Id rid, Id *fromp, Id *top, Id *depp);
extern SolverRuleinfo solver_ruleclass(struct s_Solver *solv, Id rid);
extern void solver_ruleliterals(struct s_Solver *solv, Id rid, Queue *q);
extern int solver_rule2jobidx(struct s_Solver *solv, Id rid);
extern Id solver_rule2job(struct s_Solver *solv, Id rid, Id *whatp);
extern Id solver_rule2solvable(struct s_Solver *solv, Id rid);
extern void solver_rule2rules(struct s_Solver *solv, Id rid, Queue *q, int recursive);
extern Id solver_rule2pkgrule(struct s_Solver *solv, Id rid);
extern const char *solver_ruleinfo2str(struct s_Solver *solv, SolverRuleinfo type, Id source, Id target, Id dep);
/* rule infos for weakdep decisions */
extern int solver_allweakdepinfos(struct s_Solver *solv, Id p, Queue *rq);
extern SolverRuleinfo solver_weakdepinfo(struct s_Solver *solv, Id p, Id *fromp, Id *top, Id *depp);
/* orphan handling */
extern void solver_breakorphans(struct s_Solver *solv);
extern void solver_check_brokenorphanrules(struct s_Solver *solv, Queue *dq);
/* legacy */
#define SOLVER_RULE_RPM SOLVER_RULE_PKG
#define SOLVER_RULE_RPM_NOT_INSTALLABLE SOLVER_RULE_PKG_NOT_INSTALLABLE
#define SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP
#define SOLVER_RULE_RPM_PACKAGE_REQUIRES SOLVER_RULE_PKG_REQUIRES
#define SOLVER_RULE_RPM_SELF_CONFLICT SOLVER_RULE_PKG_SELF_CONFLICT
#define SOLVER_RULE_RPM_PACKAGE_CONFLICT SOLVER_RULE_PKG_CONFLICTS
#define SOLVER_RULE_RPM_SAME_NAME SOLVER_RULE_PKG_SAME_NAME
#define SOLVER_RULE_RPM_PACKAGE_OBSOLETES SOLVER_RULE_PKG_OBSOLETES
#define SOLVER_RULE_RPM_IMPLICIT_OBSOLETES SOLVER_RULE_PKG_IMPLICIT_OBSOLETES
#define SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES SOLVER_RULE_PKG_INSTALLED_OBSOLETES
#ifdef __cplusplus
}
#endif
#endif
|