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"
32 /* well known solvable */
33 #define SYSTEMSOLVABLE 1
36 /* how many strings to maintain (round robin) */
37 #define POOL_TMPSPACEBUF 16
39 //-----------------------------------------------
46 typedef struct _Repopos {
55 struct _Stringpool ss;
57 Reldep *rels; /* table of rels: Id -> Reldep */
58 int nrels; /* number of unique rels */
59 Hashtable relhashtbl; /* hashtable: (name,evr,op)Hash -> Id */
65 struct _Repo *installed; /* packages considered installed */
70 const char **languages;
73 int languagecacheother;
75 /* flags to tell the library how the installed rpm works */
76 int promoteepoch; /* true: missing epoch is replaced by epoch of dependency */
77 int obsoleteusesprovides; /* true: obsoletes are matched against provides, not names */
78 int implicitobsoleteusesprovides; /* true: implicit obsoletes due to same name are matched against provides, not names */
79 int novirtualconflicts; /* true: conflicts on names, not on provides */
80 int allowselfconflicts; /* true: packages which conflict with itself are installable */
82 Id *id2arch; /* map arch ids to scores */
83 Id lastarch; /* last valid entry in id2arch */
84 Queue vendormap; /* map vendor to vendorclasses mask */
86 /* providers data, as two-step indirect list
87 * whatprovides[Id] -> Offset into whatprovidesdata for name
88 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
90 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
91 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
93 Id *whatprovidesdata; /* Ids of solvable providing Id */
94 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
95 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
97 /* If nonzero, then consider only the solvables with Ids set in this
98 bitmap for solving. If zero, consider all solvables. */
101 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
102 void *nscallbackdata;
104 /* our tmp space string space */
105 char *tmpspacebuf[POOL_TMPSPACEBUF];
106 int tmpspacelen[POOL_TMPSPACEBUF];
109 /* debug mask and callback */
111 void (*debugcallback)(const struct _Pool *, void *data, int type, const char *str);
112 void *debugcallbackdata;
115 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
116 void *loadcallbackdata;
118 /* search position */
122 #define SAT_FATAL (1<<0)
123 #define SAT_ERROR (1<<1)
124 #define SAT_WARN (1<<2)
125 #define SAT_DEBUG_STATS (1<<3)
126 #define SAT_DEBUG_RULE_CREATION (1<<4)
127 #define SAT_DEBUG_PROPAGATE (1<<5)
128 #define SAT_DEBUG_ANALYZE (1<<6)
129 #define SAT_DEBUG_UNSOLVABLE (1<<7)
130 #define SAT_DEBUG_SOLUTIONS (1<<8)
131 #define SAT_DEBUG_POLICY (1<<9)
132 #define SAT_DEBUG_RESULT (1<<10)
133 #define SAT_DEBUG_JOB (1<<11)
134 #define SAT_DEBUG_SCHUBI (1<<12)
135 #define SAT_DEBUG_SOLVER (1<<13)
136 #define SAT_DEBUG_TRANSACTION (1<<14)
138 #define SAT_DEBUG_TO_STDERR (1<<30)
140 //-----------------------------------------------
143 /* mark dependencies with relation by setting bit31 */
145 #define MAKERELDEP(id) ((id) | 0x80000000)
146 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
147 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
148 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
157 #define REL_NAMESPACE 19
159 #define REL_FILECONFLICT 21
161 #if !defined(__GNUC__) && !defined(__attribute__)
162 # define __attribute__(x)
168 extern Pool *pool_create(void);
172 extern void pool_free(Pool *pool);
174 extern void pool_debug(const Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
176 extern char *pool_alloctmpspace(Pool *pool, int len);
178 extern void pool_set_installed(Pool *pool, struct _Repo *repo);
181 * Solvable management
183 extern Id pool_add_solvable(Pool *pool);
184 extern Id pool_add_solvable_block(Pool *pool, int count);
186 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
187 static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
189 return pool->solvables + p;
192 extern const char *solvable2str(Pool *pool, Solvable *s);
193 static inline const char *solvid2str(Pool *pool, Id p)
195 return solvable2str(pool, pool->solvables + p);
198 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
199 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
201 Id solvable_lookup_id(Solvable *s, Id keyname);
202 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
203 const char *solvable_lookup_str(Solvable *s, Id keyname);
204 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
205 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
206 int solvable_lookup_bool(Solvable *s, Id keyname);
207 int solvable_lookup_void(Solvable *s, Id keyname);
208 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
209 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
210 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
211 int solvable_identical(Solvable *s1, Solvable *s2);
212 Id solvable_selfprovidedep(Solvable *s);
214 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
215 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
216 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
218 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
220 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
221 int pool_match_dep(Pool *pool, Id d1, Id d2);
223 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
228 return pool_match_nevr_rel(pool, s, d);
233 * Prepares a pool for solving
235 extern void pool_createwhatprovides(Pool *pool);
236 extern void pool_addfileprovides(Pool *pool);
237 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
238 extern void pool_freewhatprovides(Pool *pool);
239 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
241 static inline int pool_installable(const Pool *pool, Solvable *s)
243 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
245 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
247 if (pool->considered)
249 Id id = s - pool->solvables;
250 if (!MAPTST(pool->considered, id))
256 extern Id pool_addrelproviders(Pool *pool, Id d);
258 static inline Id pool_whatprovides(Pool *pool, Id d)
262 return pool->whatprovides[d];
264 if (pool->whatprovides_rel[v])
265 return pool->whatprovides_rel[v];
266 return pool_addrelproviders(pool, d);
269 static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
271 Id off = pool_whatprovides(pool, d);
272 return pool->whatprovidesdata + off;
275 extern void pool_setdebuglevel(Pool *pool, int level);
277 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(const struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
279 pool->debugcallback = debugcallback;
280 pool->debugcallbackdata = debugcallbackdata;
283 static inline void pool_setdebugmask(Pool *pool, int mask)
285 pool->debugmask = mask;
288 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
290 pool->loadcallback = cb;
291 pool->loadcallbackdata = loadcbdata;
294 /* search the pool. the following filters are available:
295 * p - search just this solvable
296 * key - search only this key
297 * match - key must match this string
299 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);
301 void pool_clear_pos(Pool *pool);
304 typedef struct _duchanges {
310 void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
311 int pool_calc_installsizechange(Pool *pool, Map *installedmap);
312 void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
313 void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
315 const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
316 Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
317 unsigned int pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound);
318 int pool_lookup_void(Pool *pool, Id entry, Id keyname);
319 const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
320 const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
322 void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
326 /* loop over all providers of d */
327 #define FOR_PROVIDES(v, vp, d) \
328 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
330 /* loop over all repositories */
331 /* note that idx is not the repoid */
332 #define FOR_REPOS(idx, r) \
333 for (idx = 0; idx < pool->nrepos; idx++) \
334 if ((r = pool->repos[idx]) != 0)
337 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
338 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
345 #endif /* SATSOLVER_POOL_H */