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_POOL_H
14 #define SATSOLVER_POOL_H
22 #include "pooltypes.h"
29 // see initpool_data[] in pool.c
32 #define ID_NULL STRID_NULL
33 #define ID_EMPTY STRID_EMPTY
34 #define SOLVABLE_NAME 2
35 #define SOLVABLE_ARCH 3
36 #define SOLVABLE_EVR 4
37 #define SOLVABLE_VENDOR 5
38 #define SOLVABLE_PROVIDES 6
39 #define SOLVABLE_OBSOLETES 7
40 #define SOLVABLE_CONFLICTS 8
41 #define SOLVABLE_REQUIRES 9
42 #define SOLVABLE_RECOMMENDS 10
43 #define SOLVABLE_SUGGESTS 11
44 #define SOLVABLE_SUPPLEMENTS 12
45 #define SOLVABLE_ENHANCES 13
46 #define SOLVABLE_FRESHENS 14
47 #define RPM_RPMDBID 15
48 #define SOLVABLE_PREREQMARKER 16 // normal requires before this, prereqs after this
49 #define SOLVABLE_FILEMARKER 17 // normal provides before this, generated file provides after this
50 #define NAMESPACE_INSTALLED 18
51 #define NAMESPACE_MODALIAS 19
52 #define NAMESPACE_SPLITPROVIDES 20
53 #define NAMESPACE_LANGUAGE 21
54 #define SYSTEM_SYSTEM 22
57 #define ARCH_NOARCH 25
58 #define REPODATA_EXTERNAL 26
59 #define REPODATA_KEYS 27
60 #define REPODATA_LOCATION 28
62 #define ID_NUM_INTERNAL 29
65 /* well known solvable */
66 #define SYSTEMSOLVABLE 1
69 /* how many strings to maintain (round robin) */
72 //-----------------------------------------------
80 struct _Stringpool ss;
82 Reldep *rels; // table of rels: Id -> Reldep
83 int nrels; // number of unique rels
84 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
93 int promoteepoch; /* 0/1 */
95 Id *id2arch; /* map arch ids to scores */
96 Id lastarch; /* last valid entry in id2arch */
97 Queue vendormap; /* map vendor to vendorclasses mask */
99 /* providers data, as two-step indirect list
100 * whatprovides[Id] -> Offset into whatprovidesdata for name
101 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
103 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
104 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
106 Id *whatprovidesdata; /* Ids of solvable providing Id */
107 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
108 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
110 /* If nonzero, then consider only the solvables with Ids set in this
111 bitmap for solving. If zero, consider all solvables. */
114 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
115 void *nscallbackdata;
117 /* our dep2str string space */
118 char *dep2strbuf[DEP2STRBUF];
119 int dep2strlen[DEP2STRBUF];
122 /* debug mask and callback */
124 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
125 void *debugcallbackdata;
128 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
129 void *loadcallbackdata;
132 #define SAT_FATAL (1<<0)
133 #define SAT_ERROR (1<<1)
134 #define SAT_WARN (1<<2)
135 #define SAT_DEBUG_STATS (1<<3)
136 #define SAT_DEBUG_RULE_CREATION (1<<4)
137 #define SAT_DEBUG_PROPAGATE (1<<5)
138 #define SAT_DEBUG_ANALYZE (1<<6)
139 #define SAT_DEBUG_UNSOLVABLE (1<<7)
140 #define SAT_DEBUG_SOLUTIONS (1<<8)
141 #define SAT_DEBUG_POLICY (1<<9)
142 #define SAT_DEBUG_RESULT (1<<10)
143 #define SAT_DEBUG_JOB (1<<11)
144 #define SAT_DEBUG_SCHUBI (1<<12)
146 /* The void type is usable to encode one-valued attributes, they have
147 no associated data. This is useful to encode values which many solvables
148 have in common, and whose overall set is relatively limited. A prime
149 example would be the media number. The actual value is encoded in the
150 SIZE member of the key structure. Be warned: careless use of this
151 leads to combinatoric explosion of number of schemas. */
153 /* FIXME: Should be 'enum' */
156 #define TYPE_IDARRAY 2
159 #define TYPE_REL_IDARRAY 5
161 #define TYPE_ATTR_INT 6
162 #define TYPE_ATTR_CHUNK 7
163 #define TYPE_ATTR_STRING 8
164 #define TYPE_ATTR_INTLIST 9
165 #define TYPE_ATTR_LOCALIDS 10
167 #define TYPE_COUNT_NAMED 11
168 #define TYPE_COUNTED 12
170 #define TYPE_IDVALUEARRAY 13
173 #define TYPE_DIRNUMNUMARRAY 15
174 #define TYPE_DIRSTRARRAY 16
176 #define TYPE_CONSTANT 17
179 #define TYPE_ATTR_TYPE_MAX 18
181 //-----------------------------------------------
184 /* mark dependencies with relation by setting bit31 */
186 #define MAKERELDEP(id) ((id) | 0x80000000)
187 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
188 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
189 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
198 #define REL_NAMESPACE 19
200 #if !defined(__GNUC__) && !defined(__attribute__)
201 # define __attribute__(x)
207 extern Pool *pool_create(void);
211 extern void pool_free(Pool *pool);
213 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
216 * Solvable management
218 extern Id pool_add_solvable(Pool *pool);
219 extern Id pool_add_solvable_block(Pool *pool, int count);
221 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
222 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
224 return pool->solvables + p;
226 extern const char *solvable2str(Pool *pool, Solvable *s);
230 * Prepares a pool for solving
232 extern void pool_createwhatprovides(Pool *pool);
233 extern void pool_addfileprovides(Pool *pool, struct _Repo *installed);
234 extern void pool_freewhatprovides(Pool *pool);
235 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
237 static inline int pool_installable(Pool *pool, Solvable *s)
239 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
241 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
243 if (pool->considered)
245 Id id = s - pool->solvables;
246 if (!MAPTST(pool->considered, id))
252 extern Id *pool_addrelproviders(Pool *pool, Id d);
254 static inline Id *pool_whatprovides(Pool *pool, Id d)
258 return pool->whatprovidesdata + pool->whatprovides[d];
260 if (pool->whatprovides_rel[v])
261 return pool->whatprovidesdata + pool->whatprovides_rel[v];
262 return pool_addrelproviders(pool, d);
265 extern void pool_setdebuglevel(Pool *pool, int level);
267 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
269 pool->debugcallback = debugcallback;
270 pool->debugcallbackdata = debugcallbackdata;
273 static inline void pool_setdebugmask(Pool *pool, int mask)
275 pool->debugmask = mask;
278 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
280 pool->loadcallback = cb;
281 pool->loadcallbackdata = loadcbdata;
284 /* search the pool. the following filters are available:
285 * p - search just this solvable
286 * key - search only this key
287 * match - key must match this string
289 void pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata);
291 /* loop over all providers of d */
292 #define FOR_PROVIDES(v, vp, d) \
293 for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
295 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
296 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
303 #endif /* SATSOLVER_POOL_H */