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 //-----------------------------------------------
47 struct _Stringpool ss;
49 Reldep *rels; // table of rels: Id -> Reldep
50 int nrels; // number of unique rels
51 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
60 const char **languages;
63 int languagecacheother;
65 int promoteepoch; /* 0/1 */
67 Id *id2arch; /* map arch ids to scores */
68 Id lastarch; /* last valid entry in id2arch */
69 Queue vendormap; /* map vendor to vendorclasses mask */
71 /* providers data, as two-step indirect list
72 * whatprovides[Id] -> Offset into whatprovidesdata for name
73 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
75 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
76 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
78 Id *whatprovidesdata; /* Ids of solvable providing Id */
79 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
80 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
82 /* If nonzero, then consider only the solvables with Ids set in this
83 bitmap for solving. If zero, consider all solvables. */
86 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
89 /* our tmp space string space */
90 char *tmpspacebuf[POOL_TMPSPACEBUF];
91 int tmpspacelen[POOL_TMPSPACEBUF];
94 /* debug mask and callback */
96 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
97 void *debugcallbackdata;
100 FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
101 void *loadcallbackdata;
104 #define SAT_FATAL (1<<0)
105 #define SAT_ERROR (1<<1)
106 #define SAT_WARN (1<<2)
107 #define SAT_DEBUG_STATS (1<<3)
108 #define SAT_DEBUG_RULE_CREATION (1<<4)
109 #define SAT_DEBUG_PROPAGATE (1<<5)
110 #define SAT_DEBUG_ANALYZE (1<<6)
111 #define SAT_DEBUG_UNSOLVABLE (1<<7)
112 #define SAT_DEBUG_SOLUTIONS (1<<8)
113 #define SAT_DEBUG_POLICY (1<<9)
114 #define SAT_DEBUG_RESULT (1<<10)
115 #define SAT_DEBUG_JOB (1<<11)
116 #define SAT_DEBUG_SCHUBI (1<<12)
118 //-----------------------------------------------
121 /* mark dependencies with relation by setting bit31 */
123 #define MAKERELDEP(id) ((id) | 0x80000000)
124 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
125 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
126 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
135 #define REL_NAMESPACE 19
138 #if !defined(__GNUC__) && !defined(__attribute__)
139 # define __attribute__(x)
145 extern Pool *pool_create(void);
149 extern void pool_free(Pool *pool);
151 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
153 extern char *pool_alloctmpspace(Pool *pool, int len);
156 * Solvable management
158 extern Id pool_add_solvable(Pool *pool);
159 extern Id pool_add_solvable_block(Pool *pool, int count);
161 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
162 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
164 return pool->solvables + p;
166 extern const char *solvable2str(Pool *pool, Solvable *s);
168 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
170 Id solvable_lookup_id(Solvable *s, Id keyname);
171 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
172 const char *solvable_lookup_str(Solvable *s, Id keyname);
173 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
174 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
175 int solvable_lookup_bool(Solvable *s, Id keyname);
176 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
177 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
178 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
180 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
181 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
182 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
183 void create_trivial_installable_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
188 * Prepares a pool for solving
190 extern void pool_createwhatprovides(Pool *pool);
191 extern void pool_addfileprovides(Pool *pool, struct _Repo *installed);
192 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
193 extern void pool_freewhatprovides(Pool *pool);
194 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
196 static inline int pool_installable(Pool *pool, Solvable *s)
198 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
200 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
202 if (pool->considered)
204 Id id = s - pool->solvables;
205 if (!MAPTST(pool->considered, id))
211 extern Id *pool_addrelproviders(Pool *pool, Id d);
213 static inline Id *pool_whatprovides(Pool *pool, Id d)
217 return pool->whatprovidesdata + pool->whatprovides[d];
219 if (pool->whatprovides_rel[v])
220 return pool->whatprovidesdata + pool->whatprovides_rel[v];
221 return pool_addrelproviders(pool, d);
224 extern void pool_setdebuglevel(Pool *pool, int level);
226 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
228 pool->debugcallback = debugcallback;
229 pool->debugcallbackdata = debugcallbackdata;
232 static inline void pool_setdebugmask(Pool *pool, int mask)
234 pool->debugmask = mask;
237 static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
239 pool->loadcallback = cb;
240 pool->loadcallbackdata = loadcbdata;
243 /* search the pool. the following filters are available:
244 * p - search just this solvable
245 * key - search only this key
246 * match - key must match this string
248 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);
250 typedef struct _duchanges {
256 void pool_calc_duchanges(Pool *pool, Queue *pkgs, DUChanges *mps, int nmps);
257 int pool_calc_installsizechange(Pool *pool, Queue *pkgs);
259 /* loop over all providers of d */
260 #define FOR_PROVIDES(v, vp, d) \
261 for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
263 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
264 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
271 #endif /* SATSOLVER_POOL_H */