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 int promoteepoch; /* 0/1 */
77 Id *id2arch; /* map arch ids to scores */
78 Id lastarch; /* last valid entry in id2arch */
79 Queue vendormap; /* map vendor to vendorclasses mask */
81 /* providers data, as two-step indirect list
82 * whatprovides[Id] -> Offset into whatprovidesdata for name
83 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
85 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
86 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
88 Id *whatprovidesdata; /* Ids of solvable providing Id */
89 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
90 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
92 /* If nonzero, then consider only the solvables with Ids set in this
93 bitmap for solving. If zero, consider all solvables. */
96 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
99 /* our tmp space string space */
100 char *tmpspacebuf[POOL_TMPSPACEBUF];
101 int tmpspacelen[POOL_TMPSPACEBUF];
104 /* debug mask and callback */
106 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
107 void *debugcallbackdata;
110 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
111 void *loadcallbackdata;
113 /* search position */
117 #define SAT_FATAL (1<<0)
118 #define SAT_ERROR (1<<1)
119 #define SAT_WARN (1<<2)
120 #define SAT_DEBUG_STATS (1<<3)
121 #define SAT_DEBUG_RULE_CREATION (1<<4)
122 #define SAT_DEBUG_PROPAGATE (1<<5)
123 #define SAT_DEBUG_ANALYZE (1<<6)
124 #define SAT_DEBUG_UNSOLVABLE (1<<7)
125 #define SAT_DEBUG_SOLUTIONS (1<<8)
126 #define SAT_DEBUG_POLICY (1<<9)
127 #define SAT_DEBUG_RESULT (1<<10)
128 #define SAT_DEBUG_JOB (1<<11)
129 #define SAT_DEBUG_SCHUBI (1<<12)
131 //-----------------------------------------------
134 /* mark dependencies with relation by setting bit31 */
136 #define MAKERELDEP(id) ((id) | 0x80000000)
137 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
138 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
139 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
148 #define REL_NAMESPACE 19
151 #if !defined(__GNUC__) && !defined(__attribute__)
152 # define __attribute__(x)
158 extern Pool *pool_create(void);
162 extern void pool_free(Pool *pool);
164 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
166 extern char *pool_alloctmpspace(Pool *pool, int len);
168 extern void pool_set_installed(Pool *pool, struct _Repo *repo);
171 * Solvable management
173 extern Id pool_add_solvable(Pool *pool);
174 extern Id pool_add_solvable_block(Pool *pool, int count);
176 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
177 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
179 return pool->solvables + p;
181 extern const char *solvable2str(Pool *pool, Solvable *s);
182 static inline const char *solvid2str(Pool *pool, Id p)
184 return solvable2str(pool, pool->solvables + p);
187 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
188 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
190 Id solvable_lookup_id(Solvable *s, Id keyname);
191 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
192 const char *solvable_lookup_str(Solvable *s, Id keyname);
193 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
194 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
195 int solvable_lookup_bool(Solvable *s, Id keyname);
196 int solvable_lookup_void(Solvable *s, Id keyname);
197 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
198 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
199 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
200 int solvable_identical(Solvable *s1, Solvable *s2);
201 Id solvable_selfprovidedep(Solvable *s);
203 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
204 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
205 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
207 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
209 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
211 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
216 return pool_match_nevr_rel(pool, s, d);
221 * Prepares a pool for solving
223 extern void pool_createwhatprovides(Pool *pool);
224 extern void pool_addfileprovides(Pool *pool);
225 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
226 extern void pool_freewhatprovides(Pool *pool);
227 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
229 static inline int pool_installable(Pool *pool, Solvable *s)
231 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
233 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
235 if (pool->considered)
237 Id id = s - pool->solvables;
238 if (!MAPTST(pool->considered, id))
244 extern Id pool_addrelproviders(Pool *pool, Id d);
246 static inline Id pool_whatprovides(Pool *pool, Id d)
250 return pool->whatprovides[d];
252 if (pool->whatprovides_rel[v])
253 return pool->whatprovides_rel[v];
254 return pool_addrelproviders(pool, d);
257 static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
259 Id off = pool_whatprovides(pool, d);
260 return pool->whatprovidesdata + off;
263 extern void pool_setdebuglevel(Pool *pool, int level);
265 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
267 pool->debugcallback = debugcallback;
268 pool->debugcallbackdata = debugcallbackdata;
271 static inline void pool_setdebugmask(Pool *pool, int mask)
273 pool->debugmask = mask;
276 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
278 pool->loadcallback = cb;
279 pool->loadcallbackdata = loadcbdata;
282 /* search the pool. the following filters are available:
283 * p - search just this solvable
284 * key - search only this key
285 * match - key must match this string
287 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);
289 void pool_clear_pos(Pool *pool);
292 typedef struct _duchanges {
298 void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
299 int pool_calc_installsizechange(Pool *pool, Map *installedmap);
300 void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
301 void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
304 /* loop over all providers of d */
305 #define FOR_PROVIDES(v, vp, d) \
306 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
308 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
309 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
316 #endif /* SATSOLVER_POOL_H */