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 "satversion.h"
23 #include "pooltypes.h"
33 /* well known solvable */
34 #define SYSTEMSOLVABLE 1
37 /* how many strings to maintain (round robin) */
38 #define POOL_TMPSPACEBUF 16
40 //-----------------------------------------------
47 typedef struct _Repopos {
56 void *appdata; /* application private pointer */
58 struct _Stringpool ss;
60 Reldep *rels; /* table of rels: Id -> Reldep */
61 int nrels; /* number of unique rels */
62 Hashtable relhashtbl; /* hashtable: (name,evr,op)Hash -> Id */
68 struct _Repo *installed; /* packages considered installed */
73 const char **languages;
76 int languagecacheother;
78 /* flags to tell the library how the installed rpm works */
79 int promoteepoch; /* true: missing epoch is replaced by epoch of dependency */
80 int obsoleteusesprovides; /* true: obsoletes are matched against provides, not names */
81 int implicitobsoleteusesprovides; /* true: implicit obsoletes due to same name are matched against provides, not names */
82 int obsoleteusescolors; /* true: obsoletes check arch color */
83 int novirtualconflicts; /* true: conflicts on names, not on provides */
84 int allowselfconflicts; /* true: packages which conflict with itself are installable */
86 Id *id2arch; /* map arch ids to scores */
87 unsigned char *id2color; /* map arch ids to colors */
88 Id lastarch; /* last valid entry in id2arch/id2color */
90 Queue vendormap; /* map vendor to vendorclasses mask */
92 /* providers data, as two-step indirect list
93 * whatprovides[Id] -> Offset into whatprovidesdata for name
94 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
96 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
97 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
99 Id *whatprovidesdata; /* Ids of solvable providing Id */
100 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
101 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
103 /* If nonzero, then consider only the solvables with Ids set in this
104 bitmap for solving. If zero, consider all solvables. */
107 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
108 void *nscallbackdata;
110 /* our tmp space string space */
111 char *tmpspacebuf[POOL_TMPSPACEBUF];
112 int tmpspacelen[POOL_TMPSPACEBUF];
115 /* debug mask and callback */
117 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
118 void *debugcallbackdata;
121 int (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
122 void *loadcallbackdata;
124 /* search position */
128 #define SAT_FATAL (1<<0)
129 #define SAT_ERROR (1<<1)
130 #define SAT_WARN (1<<2)
131 #define SAT_DEBUG_STATS (1<<3)
132 #define SAT_DEBUG_RULE_CREATION (1<<4)
133 #define SAT_DEBUG_PROPAGATE (1<<5)
134 #define SAT_DEBUG_ANALYZE (1<<6)
135 #define SAT_DEBUG_UNSOLVABLE (1<<7)
136 #define SAT_DEBUG_SOLUTIONS (1<<8)
137 #define SAT_DEBUG_POLICY (1<<9)
138 #define SAT_DEBUG_RESULT (1<<10)
139 #define SAT_DEBUG_JOB (1<<11)
140 #define SAT_DEBUG_SCHUBI (1<<12)
141 #define SAT_DEBUG_SOLVER (1<<13)
142 #define SAT_DEBUG_TRANSACTION (1<<14)
144 #define SAT_DEBUG_TO_STDERR (1<<30)
146 //-----------------------------------------------
149 /* mark dependencies with relation by setting bit31 */
151 #define MAKERELDEP(id) ((id) | 0x80000000)
152 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
153 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
154 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
163 #define REL_NAMESPACE 19
165 #define REL_FILECONFLICT 21
167 #if !defined(__GNUC__) && !defined(__attribute__)
168 # define __attribute__(x)
174 extern Pool *pool_create(void);
178 extern void pool_free(Pool *pool);
180 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
182 extern char *pool_alloctmpspace(Pool *pool, int len);
183 extern char *pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3);
185 extern void pool_set_installed(Pool *pool, struct _Repo *repo);
188 * Solvable management
190 extern Id pool_add_solvable(Pool *pool);
191 extern Id pool_add_solvable_block(Pool *pool, int count);
193 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
194 static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
196 return pool->solvables + p;
199 extern const char *solvable2str(Pool *pool, Solvable *s);
200 static inline const char *solvid2str(Pool *pool, Id p)
202 return solvable2str(pool, pool->solvables + p);
205 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
206 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
208 Id solvable_lookup_id(Solvable *s, Id keyname);
209 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
210 const char *solvable_lookup_str(Solvable *s, Id keyname);
211 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
212 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
213 int solvable_lookup_bool(Solvable *s, Id keyname);
214 int solvable_lookup_void(Solvable *s, Id keyname);
215 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
216 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
217 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
218 int solvable_identical(Solvable *s1, Solvable *s2);
219 Id solvable_selfprovidedep(Solvable *s);
221 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
222 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
223 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
225 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
227 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
228 int pool_match_dep(Pool *pool, Id d1, Id d2);
230 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
235 return pool_match_nevr_rel(pool, s, d);
240 * Prepares a pool for solving
242 extern void pool_createwhatprovides(Pool *pool);
243 extern void pool_addfileprovides(Pool *pool);
244 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
245 extern void pool_freewhatprovides(Pool *pool);
246 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
248 extern Id pool_addrelproviders(Pool *pool, Id d);
250 static inline Id pool_whatprovides(Pool *pool, Id d)
254 return pool->whatprovides[d];
256 if (pool->whatprovides_rel[v])
257 return pool->whatprovides_rel[v];
258 return pool_addrelproviders(pool, d);
261 static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
263 Id off = pool_whatprovides(pool, d);
264 return pool->whatprovidesdata + off;
267 extern void pool_setdebuglevel(Pool *pool, int level);
269 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
271 pool->debugcallback = debugcallback;
272 pool->debugcallbackdata = debugcallbackdata;
275 static inline void pool_setdebugmask(Pool *pool, int mask)
277 pool->debugmask = mask;
280 static inline void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
282 pool->loadcallback = cb;
283 pool->loadcallbackdata = loadcbdata;
286 /* search the pool. the following filters are available:
287 * p - search just this solvable
288 * key - search only this key
289 * match - key must match this string
291 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);
293 void pool_clear_pos(Pool *pool);
296 typedef struct _DUChanges {
302 void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
303 int pool_calc_installsizechange(Pool *pool, Map *installedmap);
304 void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
305 void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
307 const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
308 Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
309 unsigned int pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound);
310 int pool_lookup_void(Pool *pool, Id entry, Id keyname);
311 const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
312 const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
314 void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
318 /* loop over all providers of d */
319 #define FOR_PROVIDES(v, vp, d) \
320 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
322 /* loop over all repositories */
323 /* note that idx is not the repoid */
324 #define FOR_REPOS(idx, r) \
325 for (idx = 0; idx < pool->nrepos; idx++) \
326 if ((r = pool->repos[idx]) != 0)
329 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
330 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
337 #endif /* SATSOLVER_POOL_H */