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
20 #include "pooltypes.h"
26 // see initpool_data[] in pool.c
29 #define ID_NULL STRID_NULL
30 #define ID_EMPTY STRID_EMPTY
31 #define SOLVABLE_NAME 2
32 #define SOLVABLE_ARCH 3
33 #define SOLVABLE_EVR 4
34 #define SOLVABLE_VENDOR 5
35 #define SOLVABLE_PROVIDES 6
36 #define SOLVABLE_OBSOLETES 7
37 #define SOLVABLE_CONFLICTS 8
38 #define SOLVABLE_REQUIRES 9
39 #define SOLVABLE_RECOMMENDS 10
40 #define SOLVABLE_SUGGESTS 11
41 #define SOLVABLE_SUPPLEMENTS 12
42 #define SOLVABLE_ENHANCES 13
43 #define SOLVABLE_FRESHENS 14
44 #define RPM_RPMDBID 15
45 #define SOLVABLE_PREREQMARKER 16 // normal requires before this, prereqs after this
46 #define SOLVABLE_FILEMARKER 17 // normal provides before this, generated file provides after this
47 #define NAMESPACE_INSTALLED 18
48 #define NAMESPACE_MODALIAS 19
49 #define SYSTEM_SYSTEM 20
52 #define ARCH_NOARCH 23
54 /* well known solvable */
55 #define SYSTEMSOLVABLE 1
58 /* how many strings to maintain (round robin) */
61 //-----------------------------------------------
66 struct _Stringpool ss;
68 Reldep *rels; // table of rels: Id -> Reldep
69 int nrels; // number of unique rels
70 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
79 int promoteepoch; /* 0/1 */
81 Id *id2arch; /* map arch ids to scores */
82 Id lastarch; /* last valid entry in id2arch */
83 Queue vendormap; /* map vendor to vendorclasses mask */
85 /* providers data, as two-step indirect list
86 * whatprovides[Id] -> Offset into whatprovidesdata for name
87 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
89 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
90 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
92 Id *whatprovidesdata; /* Ids of solvable providing Id */
93 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
94 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
96 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
99 /* our dep2str string space */
100 char *dep2strbuf[DEP2STRBUF];
101 int dep2strlen[DEP2STRBUF];
104 /* debug mask and callback */
106 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
107 void *debugcallbackdata;
110 #define SAT_FATAL (1<<0)
111 #define SAT_ERROR (1<<1)
112 #define SAT_WARN (1<<2)
113 #define SAT_DEBUG_STATS (1<<3)
114 #define SAT_DEBUG_RULE_CREATION (1<<4)
115 #define SAT_DEBUG_PROPAGATE (1<<5)
116 #define SAT_DEBUG_ANALYZE (1<<6)
117 #define SAT_DEBUG_UNSOLVABLE (1<<7)
118 #define SAT_DEBUG_SOLUTIONS (1<<8)
119 #define SAT_DEBUG_POLICY (1<<9)
120 #define SAT_DEBUG_RESULT (1<<10)
121 #define SAT_DEBUG_JOB (1<<11)
122 #define SAT_DEBUG_SCHUBI (1<<12)
125 #define TYPE_IDARRAY 2
128 #define TYPE_REL_IDARRAY 5
130 #define TYPE_ATTR_INT 6
131 #define TYPE_ATTR_CHUNK 7
132 #define TYPE_ATTR_STRING 8
133 #define TYPE_ATTR_INTLIST 9
134 #define TYPE_ATTR_LOCALIDS 10
135 #define TYPE_ATTR_TYPE_MAX 10
137 //-----------------------------------------------
140 /* mark dependencies with relation by setting bit31 */
142 #define MAKERELDEP(id) ((id) | 0x80000000)
143 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
144 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
145 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
154 #define REL_NAMESPACE 19
156 #if !defined(__GNUC__) && !defined(__attribute__)
157 # define __attribute__(x)
163 extern Pool *pool_create(void);
167 extern void pool_free(Pool *pool);
169 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
172 * Solvable management
174 extern Id pool_add_solvable(Pool *pool);
175 extern Id pool_add_solvable_block(Pool *pool, int count);
177 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
178 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
180 return pool->solvables + p;
182 extern const char *solvable2str(Pool *pool, Solvable *s);
186 * Prepares a pool for solving
188 extern void pool_createwhatprovides(Pool *pool);
189 extern void pool_freewhatprovides(Pool *pool);
190 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
192 static inline int pool_installable(Pool *pool, Solvable *s)
194 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
196 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
201 extern Id *pool_addrelproviders(Pool *pool, Id d);
203 static inline Id *pool_whatprovides(Pool *pool, Id d)
207 return pool->whatprovidesdata + pool->whatprovides[d];
209 if (pool->whatprovides_rel[v])
210 return pool->whatprovidesdata + pool->whatprovides_rel[v];
211 return pool_addrelproviders(pool, d);
214 extern void pool_setdebuglevel(Pool *pool, int level);
216 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
218 pool->debugcallback = debugcallback;
219 pool->debugcallbackdata = debugcallbackdata;
222 static inline void pool_setdebugmask(Pool *pool, int mask)
224 pool->debugmask = mask;
227 /* loop over all providers of d */
228 #define FOR_PROVIDES(v, vp, d) \
229 for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
231 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
232 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
239 #endif /* SATSOLVER_POOL_H */