/usr/include/x86_64-linux-gnu/solv/rules.h is in libsolv0-dev 0.6.5-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*
* 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
#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 _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_RPM = 0x100,
SOLVER_RULE_RPM_NOT_INSTALLABLE,
SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP,
SOLVER_RULE_RPM_PACKAGE_REQUIRES,
SOLVER_RULE_RPM_SELF_CONFLICT,
SOLVER_RULE_RPM_PACKAGE_CONFLICT,
SOLVER_RULE_RPM_SAME_NAME,
SOLVER_RULE_RPM_PACKAGE_OBSOLETES,
SOLVER_RULE_RPM_IMPLICIT_OBSOLETES,
SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES,
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
} SolverRuleinfo;
#define SOLVER_RULE_TYPEMASK 0xff00
struct _Solver;
/*-------------------------------------------------------------------
* disable rule
*/
static inline void
solver_disablerule(struct _Solver *solv, Rule *r)
{
if (r->d >= 0)
r->d = -r->d - 1;
}
/*-------------------------------------------------------------------
* enable rule
*/
static inline void
solver_enablerule(struct _Solver *solv, Rule *r)
{
if (r->d < 0)
r->d = -r->d - 1;
}
extern Rule *solver_addrule(struct _Solver *solv, Id p, Id d);
extern void solver_unifyrules(struct _Solver *solv);
extern int solver_rulecmp(struct _Solver *solv, Rule *r1, Rule *r2);
extern void solver_shrinkrules(struct _Solver *solv, int nrules);
/* rpm rules */
extern void solver_addrpmrulesforsolvable(struct _Solver *solv, Solvable *s, Map *m);
extern void solver_addrpmrulesforweak(struct _Solver *solv, Map *m);
extern void solver_addrpmrulesforlinked(struct _Solver *solv, Map *m);
extern void solver_addrpmrulesforupdaters(struct _Solver *solv, Solvable *s, Map *m, int allow_all);
/* update/feature rules */
extern void solver_addupdaterule(struct _Solver *solv, Solvable *s, int allow_all);
/* infarch rules */
extern void solver_addinfarchrules(struct _Solver *solv, Map *addedmap);
/* dup rules */
extern void solver_createdupmaps(struct _Solver *solv);
extern void solver_freedupmaps(struct _Solver *solv);
extern void solver_addduprules(struct _Solver *solv, Map *addedmap);
/* choice rules */
extern void solver_addchoicerules(struct _Solver *solv);
extern void solver_disablechoicerules(struct _Solver *solv, Rule *r);
/* best rules */
extern void solver_addbestrules(struct _Solver *solv, int havebestinstalljobs);
/* yumobs rules */
extern void solver_addyumobsrules(struct _Solver *solv);
/* policy rule disabling/reenabling */
extern void solver_disablepolicyrules(struct _Solver *solv);
extern void solver_reenablepolicyrules(struct _Solver *solv, int jobidx);
extern void solver_reenablepolicyrules_cleandeps(struct _Solver *solv, Id pkg);
/* rule info */
extern int solver_allruleinfos(struct _Solver *solv, Id rid, Queue *rq);
extern SolverRuleinfo solver_ruleinfo(struct _Solver *solv, Id rid, Id *fromp, Id *top, Id *depp);
extern SolverRuleinfo solver_ruleclass(struct _Solver *solv, Id rid);
extern void solver_ruleliterals(struct _Solver *solv, Id rid, Queue *q);
extern int solver_rule2jobidx(struct _Solver *solv, Id rid);
extern Id solver_rule2job(struct _Solver *solv, Id rid, Id *whatp);
extern Id solver_rule2solvable(struct _Solver *solv, Id rid);
extern void solver_rule2rules(struct _Solver *solv, Id rid, Queue *q, int recursive);
/* orphan handling */
extern void solver_breakorphans(struct _Solver *solv);
extern void solver_check_brokenorphanrules(struct _Solver *solv, Queue *dq);
#ifdef __cplusplus
}
#endif
#endif
|