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 {
54 struct _Stringpool ss;
56 Reldep *rels; // table of rels: Id -> Reldep
57 int nrels; // number of unique rels
58 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
67 const char **languages;
70 int languagecacheother;
72 int promoteepoch; /* 0/1 */
74 Id *id2arch; /* map arch ids to scores */
75 Id lastarch; /* last valid entry in id2arch */
76 Queue vendormap; /* map vendor to vendorclasses mask */
78 /* providers data, as two-step indirect list
79 * whatprovides[Id] -> Offset into whatprovidesdata for name
80 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
82 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
83 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
85 Id *whatprovidesdata; /* Ids of solvable providing Id */
86 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
87 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
89 /* If nonzero, then consider only the solvables with Ids set in this
90 bitmap for solving. If zero, consider all solvables. */
93 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
96 /* our tmp space string space */
97 char *tmpspacebuf[POOL_TMPSPACEBUF];
98 int tmpspacelen[POOL_TMPSPACEBUF];
101 /* debug mask and callback */
103 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
104 void *debugcallbackdata;
107 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
108 void *loadcallbackdata;
110 /* search position */
114 #define SAT_FATAL (1<<0)
115 #define SAT_ERROR (1<<1)
116 #define SAT_WARN (1<<2)
117 #define SAT_DEBUG_STATS (1<<3)
118 #define SAT_DEBUG_RULE_CREATION (1<<4)
119 #define SAT_DEBUG_PROPAGATE (1<<5)
120 #define SAT_DEBUG_ANALYZE (1<<6)
121 #define SAT_DEBUG_UNSOLVABLE (1<<7)
122 #define SAT_DEBUG_SOLUTIONS (1<<8)
123 #define SAT_DEBUG_POLICY (1<<9)
124 #define SAT_DEBUG_RESULT (1<<10)
125 #define SAT_DEBUG_JOB (1<<11)
126 #define SAT_DEBUG_SCHUBI (1<<12)
128 //-----------------------------------------------
131 /* mark dependencies with relation by setting bit31 */
133 #define MAKERELDEP(id) ((id) | 0x80000000)
134 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
135 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
136 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
145 #define REL_NAMESPACE 19
148 #if !defined(__GNUC__) && !defined(__attribute__)
149 # define __attribute__(x)
155 extern Pool *pool_create(void);
159 extern void pool_free(Pool *pool);
161 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
163 extern char *pool_alloctmpspace(Pool *pool, int len);
166 * Solvable management
168 extern Id pool_add_solvable(Pool *pool);
169 extern Id pool_add_solvable_block(Pool *pool, int count);
171 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
172 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
174 return pool->solvables + p;
176 extern const char *solvable2str(Pool *pool, Solvable *s);
178 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
179 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
181 Id solvable_lookup_id(Solvable *s, Id keyname);
182 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
183 const char *solvable_lookup_str(Solvable *s, Id keyname);
184 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
185 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
186 int solvable_lookup_bool(Solvable *s, Id keyname);
187 int solvable_lookup_void(Solvable *s, Id keyname);
188 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
189 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
190 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
191 int solvable_identical(Pool *pool, Solvable *s1, Solvable *s2);
193 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
194 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
195 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
197 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
199 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
201 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
206 return pool_match_nevr_rel(pool, s, d);
211 * Prepares a pool for solving
213 extern void pool_createwhatprovides(Pool *pool);
214 extern void pool_addfileprovides(Pool *pool, struct _Repo *installed);
215 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
216 extern void pool_freewhatprovides(Pool *pool);
217 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
219 static inline int pool_installable(Pool *pool, Solvable *s)
221 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
223 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
225 if (pool->considered)
227 Id id = s - pool->solvables;
228 if (!MAPTST(pool->considered, id))
234 extern Id pool_addrelproviders(Pool *pool, Id d);
236 static inline Id pool_whatprovides(Pool *pool, Id d)
240 return pool->whatprovides[d];
242 if (pool->whatprovides_rel[v])
243 return pool->whatprovides_rel[v];
244 return pool_addrelproviders(pool, d);
247 extern void pool_setdebuglevel(Pool *pool, int level);
249 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
251 pool->debugcallback = debugcallback;
252 pool->debugcallbackdata = debugcallbackdata;
255 static inline void pool_setdebugmask(Pool *pool, int mask)
257 pool->debugmask = mask;
260 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
262 pool->loadcallback = cb;
263 pool->loadcallbackdata = loadcbdata;
266 /* search the pool. the following filters are available:
267 * p - search just this solvable
268 * key - search only this key
269 * match - key must match this string
271 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);
273 typedef struct _duchanges {
279 void pool_calc_duchanges(Pool *pool, struct _Repo *oldinstalled, Map *installedmap, DUChanges *mps, int nmps);
280 int pool_calc_installsizechange(Pool *pool, struct _Repo *oldinstalled, Map *installedmap);
281 void pool_trivial_installable(Pool *pool, struct _Repo *oldinstalled, Map *installedmap, Queue *pkgs, Queue *res);
284 /* loop over all providers of d */
285 #define FOR_PROVIDES(v, vp, d) \
286 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
288 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
289 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
296 #endif /* SATSOLVER_POOL_H */