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 void *appdata; /* application private pointer */
57 struct _Stringpool ss;
59 Reldep *rels; /* table of rels: Id -> Reldep */
60 int nrels; /* number of unique rels */
61 Hashtable relhashtbl; /* hashtable: (name,evr,op)Hash -> Id */
67 struct _Repo *installed; /* packages considered installed */
72 const char **languages;
75 int languagecacheother;
77 /* flags to tell the library how the installed rpm works */
78 int promoteepoch; /* true: missing epoch is replaced by epoch of dependency */
79 int obsoleteusesprovides; /* true: obsoletes are matched against provides, not names */
80 int implicitobsoleteusesprovides; /* true: implicit obsoletes due to same name are matched against provides, not names */
81 int obsoleteusescolors; /* true: obsoletes check arch color */
82 int novirtualconflicts; /* true: conflicts on names, not on provides */
83 int allowselfconflicts; /* true: packages which conflict with itself are installable */
85 Id *id2arch; /* map arch ids to scores */
86 unsigned char *id2color; /* map arch ids to colors */
87 Id lastarch; /* last valid entry in id2arch/id2color */
89 Queue vendormap; /* map vendor to vendorclasses mask */
91 /* providers data, as two-step indirect list
92 * whatprovides[Id] -> Offset into whatprovidesdata for name
93 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
95 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
96 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
98 Id *whatprovidesdata; /* Ids of solvable providing Id */
99 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
100 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
102 /* If nonzero, then consider only the solvables with Ids set in this
103 bitmap for solving. If zero, consider all solvables. */
106 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
107 void *nscallbackdata;
109 /* our tmp space string space */
110 char *tmpspacebuf[POOL_TMPSPACEBUF];
111 int tmpspacelen[POOL_TMPSPACEBUF];
114 /* debug mask and callback */
116 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
117 void *debugcallbackdata;
120 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
121 void *loadcallbackdata;
123 /* search position */
127 #define SAT_FATAL (1<<0)
128 #define SAT_ERROR (1<<1)
129 #define SAT_WARN (1<<2)
130 #define SAT_DEBUG_STATS (1<<3)
131 #define SAT_DEBUG_RULE_CREATION (1<<4)
132 #define SAT_DEBUG_PROPAGATE (1<<5)
133 #define SAT_DEBUG_ANALYZE (1<<6)
134 #define SAT_DEBUG_UNSOLVABLE (1<<7)
135 #define SAT_DEBUG_SOLUTIONS (1<<8)
136 #define SAT_DEBUG_POLICY (1<<9)
137 #define SAT_DEBUG_RESULT (1<<10)
138 #define SAT_DEBUG_JOB (1<<11)
139 #define SAT_DEBUG_SCHUBI (1<<12)
140 #define SAT_DEBUG_SOLVER (1<<13)
141 #define SAT_DEBUG_TRANSACTION (1<<14)
143 #define SAT_DEBUG_TO_STDERR (1<<30)
145 //-----------------------------------------------
148 /* mark dependencies with relation by setting bit31 */
150 #define MAKERELDEP(id) ((id) | 0x80000000)
151 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
152 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
153 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
162 #define REL_NAMESPACE 19
164 #define REL_FILECONFLICT 21
166 #if !defined(__GNUC__) && !defined(__attribute__)
167 # define __attribute__(x)
173 extern Pool *pool_create(void);
177 extern void pool_free(Pool *pool);
179 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
181 extern char *pool_alloctmpspace(Pool *pool, int len);
182 extern char *pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3);
184 extern void pool_set_installed(Pool *pool, struct _Repo *repo);
187 * Solvable management
189 extern Id pool_add_solvable(Pool *pool);
190 extern Id pool_add_solvable_block(Pool *pool, int count);
192 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
193 static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
195 return pool->solvables + p;
198 extern const char *solvable2str(Pool *pool, Solvable *s);
199 static inline const char *solvid2str(Pool *pool, Id p)
201 return solvable2str(pool, pool->solvables + p);
204 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
205 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
207 Id solvable_lookup_id(Solvable *s, Id keyname);
208 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
209 const char *solvable_lookup_str(Solvable *s, Id keyname);
210 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
211 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
212 int solvable_lookup_bool(Solvable *s, Id keyname);
213 int solvable_lookup_void(Solvable *s, Id keyname);
214 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
215 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
216 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
217 int solvable_identical(Solvable *s1, Solvable *s2);
218 Id solvable_selfprovidedep(Solvable *s);
220 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
221 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
222 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
224 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
226 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
227 int pool_match_dep(Pool *pool, Id d1, Id d2);
229 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
234 return pool_match_nevr_rel(pool, s, d);
239 * Prepares a pool for solving
241 extern void pool_createwhatprovides(Pool *pool);
242 extern void pool_addfileprovides(Pool *pool);
243 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
244 extern void pool_freewhatprovides(Pool *pool);
245 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
247 extern Id pool_addrelproviders(Pool *pool, Id d);
249 static inline Id pool_whatprovides(Pool *pool, Id d)
253 return pool->whatprovides[d];
255 if (pool->whatprovides_rel[v])
256 return pool->whatprovides_rel[v];
257 return pool_addrelproviders(pool, d);
260 static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
262 Id off = pool_whatprovides(pool, d);
263 return pool->whatprovidesdata + off;
266 extern void pool_setdebuglevel(Pool *pool, int level);
268 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
270 pool->debugcallback = debugcallback;
271 pool->debugcallbackdata = debugcallbackdata;
274 static inline void pool_setdebugmask(Pool *pool, int mask)
276 pool->debugmask = mask;
279 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
281 pool->loadcallback = cb;
282 pool->loadcallbackdata = loadcbdata;
285 /* search the pool. the following filters are available:
286 * p - search just this solvable
287 * key - search only this key
288 * match - key must match this string
290 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);
292 void pool_clear_pos(Pool *pool);
295 typedef struct _duchanges {
301 void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
302 int pool_calc_installsizechange(Pool *pool, Map *installedmap);
303 void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
304 void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
306 const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
307 Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
308 unsigned int pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound);
309 int pool_lookup_void(Pool *pool, Id entry, Id keyname);
310 const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
311 const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
313 void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
317 /* loop over all providers of d */
318 #define FOR_PROVIDES(v, vp, d) \
319 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
321 /* loop over all repositories */
322 /* note that idx is not the repoid */
323 #define FOR_REPOS(idx, r) \
324 for (idx = 0; idx < pool->nrepos; idx++) \
325 if ((r = pool->repos[idx]) != 0)
328 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
329 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
336 #endif /* SATSOLVER_POOL_H */