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; // hash table: (name,evr,op ->) Hash -> Id
68 const char **languages;
71 int languagecacheother;
73 int promoteepoch; /* 0/1 */
75 Id *id2arch; /* map arch ids to scores */
76 Id lastarch; /* last valid entry in id2arch */
77 Queue vendormap; /* map vendor to vendorclasses mask */
79 /* providers data, as two-step indirect list
80 * whatprovides[Id] -> Offset into whatprovidesdata for name
81 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
83 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
84 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
86 Id *whatprovidesdata; /* Ids of solvable providing Id */
87 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
88 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
90 /* If nonzero, then consider only the solvables with Ids set in this
91 bitmap for solving. If zero, consider all solvables. */
94 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
97 /* our tmp space string space */
98 char *tmpspacebuf[POOL_TMPSPACEBUF];
99 int tmpspacelen[POOL_TMPSPACEBUF];
102 /* debug mask and callback */
104 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
105 void *debugcallbackdata;
108 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
109 void *loadcallbackdata;
111 /* search position */
115 #define SAT_FATAL (1<<0)
116 #define SAT_ERROR (1<<1)
117 #define SAT_WARN (1<<2)
118 #define SAT_DEBUG_STATS (1<<3)
119 #define SAT_DEBUG_RULE_CREATION (1<<4)
120 #define SAT_DEBUG_PROPAGATE (1<<5)
121 #define SAT_DEBUG_ANALYZE (1<<6)
122 #define SAT_DEBUG_UNSOLVABLE (1<<7)
123 #define SAT_DEBUG_SOLUTIONS (1<<8)
124 #define SAT_DEBUG_POLICY (1<<9)
125 #define SAT_DEBUG_RESULT (1<<10)
126 #define SAT_DEBUG_JOB (1<<11)
127 #define SAT_DEBUG_SCHUBI (1<<12)
129 //-----------------------------------------------
132 /* mark dependencies with relation by setting bit31 */
134 #define MAKERELDEP(id) ((id) | 0x80000000)
135 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
136 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
137 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
146 #define REL_NAMESPACE 19
149 #if !defined(__GNUC__) && !defined(__attribute__)
150 # define __attribute__(x)
156 extern Pool *pool_create(void);
160 extern void pool_free(Pool *pool);
162 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
164 extern char *pool_alloctmpspace(Pool *pool, int len);
167 * Solvable management
169 extern Id pool_add_solvable(Pool *pool);
170 extern Id pool_add_solvable_block(Pool *pool, int count);
172 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
173 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
175 return pool->solvables + p;
177 extern const char *solvable2str(Pool *pool, Solvable *s);
179 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
180 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
182 Id solvable_lookup_id(Solvable *s, Id keyname);
183 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
184 const char *solvable_lookup_str(Solvable *s, Id keyname);
185 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
186 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
187 int solvable_lookup_bool(Solvable *s, Id keyname);
188 int solvable_lookup_void(Solvable *s, Id keyname);
189 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
190 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
191 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
192 int solvable_identical(Pool *pool, Solvable *s1, Solvable *s2);
194 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
195 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
196 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
198 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
200 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
202 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
207 return pool_match_nevr_rel(pool, s, d);
212 * Prepares a pool for solving
214 extern void pool_createwhatprovides(Pool *pool);
215 extern void pool_addfileprovides(Pool *pool, struct _Repo *installed);
216 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
217 extern void pool_freewhatprovides(Pool *pool);
218 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
220 static inline int pool_installable(Pool *pool, Solvable *s)
222 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
224 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
226 if (pool->considered)
228 Id id = s - pool->solvables;
229 if (!MAPTST(pool->considered, id))
235 extern Id pool_addrelproviders(Pool *pool, Id d);
237 static inline Id pool_whatprovides(Pool *pool, Id d)
241 return pool->whatprovides[d];
243 if (pool->whatprovides_rel[v])
244 return pool->whatprovides_rel[v];
245 return pool_addrelproviders(pool, d);
248 extern void pool_setdebuglevel(Pool *pool, int level);
250 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
252 pool->debugcallback = debugcallback;
253 pool->debugcallbackdata = debugcallbackdata;
256 static inline void pool_setdebugmask(Pool *pool, int mask)
258 pool->debugmask = mask;
261 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
263 pool->loadcallback = cb;
264 pool->loadcallbackdata = loadcbdata;
267 /* search the pool. the following filters are available:
268 * p - search just this solvable
269 * key - search only this key
270 * match - key must match this string
272 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);
274 void pool_clear_pos(Pool *pool);
277 typedef struct _duchanges {
283 void pool_calc_duchanges(Pool *pool, struct _Repo *oldinstalled, Map *installedmap, DUChanges *mps, int nmps);
284 int pool_calc_installsizechange(Pool *pool, struct _Repo *oldinstalled, Map *installedmap);
285 void pool_trivial_installable(Pool *pool, struct _Repo *oldinstalled, Map *installedmap, Queue *pkgs, Queue *res);
288 /* loop over all providers of d */
289 #define FOR_PROVIDES(v, vp, d) \
290 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
292 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
293 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
300 #endif /* SATSOLVER_POOL_H */