2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
13 #ifndef LIBSOLV_POOL_H
14 #define LIBSOLV_POOL_H
22 #include "solvversion.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 _Datapos {
55 struct _Pool_tmpspace {
56 char *buf[POOL_TMPSPACEBUF];
57 int len[POOL_TMPSPACEBUF];
62 void *appdata; /* application private pointer */
64 struct _Stringpool ss;
66 Reldep *rels; /* table of rels: Id -> Reldep */
67 int nrels; /* number of unique rels */
68 Hashtable relhashtbl; /* hashtable: (name,evr,op)Hash -> Id */
72 int nrepos; /* repos allocated */
73 int urepos; /* repos in use */
75 struct _Repo *installed; /* packages considered installed */
78 int nsolvables; /* solvables allocated */
80 const char **languages;
83 int languagecacheother;
85 /* flags to tell the library how the installed rpm works */
86 int promoteepoch; /* true: missing epoch is replaced by epoch of dependency */
87 int obsoleteusesprovides; /* true: obsoletes are matched against provides, not names */
88 int implicitobsoleteusesprovides; /* true: implicit obsoletes due to same name are matched against provides, not names */
89 int obsoleteusescolors; /* true: obsoletes check arch color */
90 int noinstalledobsoletes; /* true: ignore obsoletes of installed packages */
91 int allowselfconflicts; /* true: packages which conflict with itself are installable */
93 #ifdef MULTI_SEMANTICS
97 Id *id2arch; /* map arch ids to scores */
98 unsigned char *id2color; /* map arch ids to colors */
99 Id lastarch; /* last valid entry in id2arch/id2color */
101 Queue vendormap; /* map vendor to vendorclasses mask */
102 const char **vendorclasses; /* vendor equivalence classes */
104 /* providers data, as two-step indirect list
105 * whatprovides[Id] -> Offset into whatprovidesdata for name
106 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
108 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
109 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
111 Id *whatprovidesdata; /* Ids of solvable providing Id */
112 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
113 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
115 /* If nonzero, then consider only the solvables with Ids set in this
116 bitmap for solving. If zero, consider all solvables. */
119 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
120 void *nscallbackdata;
122 /* our tmp space string space */
123 struct _Pool_tmpspace tmpspace;
125 /* debug mask and callback */
127 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
128 void *debugcallbackdata;
131 int (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
132 void *loadcallbackdata;
134 /* search position */
138 #ifdef MULTI_SEMANTICS
139 # define DISTTYPE_RPM 0
140 # define DISTTYPE_DEB 1
143 #define SOLV_FATAL (1<<0)
144 #define SOLV_ERROR (1<<1)
145 #define SOLV_WARN (1<<2)
146 #define SOLV_DEBUG_STATS (1<<3)
147 #define SOLV_DEBUG_RULE_CREATION (1<<4)
148 #define SOLV_DEBUG_PROPAGATE (1<<5)
149 #define SOLV_DEBUG_ANALYZE (1<<6)
150 #define SOLV_DEBUG_UNSOLVABLE (1<<7)
151 #define SOLV_DEBUG_SOLUTIONS (1<<8)
152 #define SOLV_DEBUG_POLICY (1<<9)
153 #define SOLV_DEBUG_RESULT (1<<10)
154 #define SOLV_DEBUG_JOB (1<<11)
155 #define SOLV_DEBUG_SOLVER (1<<12)
156 #define SOLV_DEBUG_TRANSACTION (1<<13)
158 #define SOLV_DEBUG_TO_STDERR (1<<30)
160 /* ----------------------------------------------- */
163 /* mark dependencies with relation by setting bit31 */
165 #define MAKERELDEP(id) ((id) | 0x80000000)
166 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
167 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
168 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
177 #define REL_NAMESPACE 19
179 #define REL_FILECONFLICT 21
181 #if !defined(__GNUC__) && !defined(__attribute__)
182 # define __attribute__(x)
185 extern Pool *pool_create(void);
186 extern void pool_free(Pool *pool);
187 extern void pool_freeallrepos(Pool *pool, int reuseids);
189 extern void pool_setdebuglevel(Pool *pool, int level);
190 #ifdef MULTI_SEMANTICS
191 extern void pool_setdisttype(Pool *pool, int disttype);
193 extern void pool_setvendorclasses(Pool *pool, const char **vendorclasses);
195 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
196 extern void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata);
197 extern void pool_setdebugmask(Pool *pool, int mask);
198 extern void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata);
201 extern char *pool_alloctmpspace(Pool *pool, int len);
202 extern void pool_freetmpspace(Pool *pool, const char *space);
203 extern char *pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3);
204 extern char *pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3);
205 extern const char *pool_bin2hex(Pool *pool, const unsigned char *buf, int len);
207 extern void pool_set_installed(Pool *pool, struct _Repo *repo);
210 * Solvable management
212 extern Id pool_add_solvable(Pool *pool);
213 extern Id pool_add_solvable_block(Pool *pool, int count);
215 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
216 static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
218 return pool->solvables + p;
221 extern const char *pool_solvable2str(Pool *pool, Solvable *s);
222 static inline const char *pool_solvid2str(Pool *pool, Id p)
224 return pool_solvable2str(pool, pool->solvables + p);
227 void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
228 Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
230 Id solvable_lookup_id(Solvable *s, Id keyname);
231 unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
232 const char *solvable_lookup_str(Solvable *s, Id keyname);
233 const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
234 const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase);
235 int solvable_lookup_bool(Solvable *s, Id keyname);
236 int solvable_lookup_void(Solvable *s, Id keyname);
237 char * solvable_get_location(Solvable *s, unsigned int *medianrp);
238 const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
239 const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
240 int solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q);
241 int solvable_identical(Solvable *s1, Solvable *s2);
242 Id solvable_selfprovidedep(Solvable *s);
244 int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
245 int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
246 int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
248 void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
250 int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
251 int pool_match_dep(Pool *pool, Id d1, Id d2);
253 static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
258 return pool_match_nevr_rel(pool, s, d);
263 * Prepares a pool for solving
265 extern void pool_createwhatprovides(Pool *pool);
266 extern void pool_addfileprovides(Pool *pool);
267 extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
268 extern void pool_freewhatprovides(Pool *pool);
269 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
271 extern Id pool_addrelproviders(Pool *pool, Id d);
273 static inline Id pool_whatprovides(Pool *pool, Id d)
277 return pool->whatprovides[d];
279 if (pool->whatprovides_rel[v])
280 return pool->whatprovides_rel[v];
281 return pool_addrelproviders(pool, d);
284 static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
286 Id off = pool_whatprovides(pool, d);
287 return pool->whatprovidesdata + off;
290 /* search the pool. the following filters are available:
291 * p - search just this solvable
292 * key - search only this key
293 * match - key must match this string
295 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);
297 void pool_clear_pos(Pool *pool);
300 typedef struct _DUChanges {
306 void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
307 int pool_calc_installsizechange(Pool *pool, Map *installedmap);
308 void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
309 void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
311 const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
312 Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
313 unsigned int pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound);
314 int pool_lookup_void(Pool *pool, Id entry, Id keyname);
315 const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
316 const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
318 void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
322 /* loop over all providers of d */
323 #define FOR_PROVIDES(v, vp, d) \
324 for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
326 /* loop over all repositories */
327 #define FOR_REPOS(repoid, r) \
328 for (repoid = 1; repoid < pool->nrepos; repoid++) \
329 if ((r = pool->repos[repoid]) != 0)
332 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
333 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
340 #endif /* LIBSOLV_POOL_H */