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
53 #define REPODATA_EXTERNAL 24
54 #define REPODATA_KEYS 25
55 #define REPODATA_LOCATION 26
57 #define ID_NUM_INTERNAL 27
60 /* well known solvable */
61 #define SYSTEMSOLVABLE 1
64 /* how many strings to maintain (round robin) */
67 //-----------------------------------------------
72 struct _Stringpool ss;
74 Reldep *rels; // table of rels: Id -> Reldep
75 int nrels; // number of unique rels
76 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
85 int promoteepoch; /* 0/1 */
87 Id *id2arch; /* map arch ids to scores */
88 Id lastarch; /* last valid entry in id2arch */
89 Queue vendormap; /* map vendor to vendorclasses mask */
91 /* providers data, as two-step indirect list
92 * whatprovides[Id] -> Offset into whatprovidesdata for name
93 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
95 Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
96 Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
98 Id *whatprovidesdata; /* Ids of solvable providing Id */
99 Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
100 int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
102 Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
103 void *nscallbackdata;
105 /* our dep2str string space */
106 char *dep2strbuf[DEP2STRBUF];
107 int dep2strlen[DEP2STRBUF];
110 /* debug mask and callback */
112 void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
113 void *debugcallbackdata;
116 #define SAT_FATAL (1<<0)
117 #define SAT_ERROR (1<<1)
118 #define SAT_WARN (1<<2)
119 #define SAT_DEBUG_STATS (1<<3)
120 #define SAT_DEBUG_RULE_CREATION (1<<4)
121 #define SAT_DEBUG_PROPAGATE (1<<5)
122 #define SAT_DEBUG_ANALYZE (1<<6)
123 #define SAT_DEBUG_UNSOLVABLE (1<<7)
124 #define SAT_DEBUG_SOLUTIONS (1<<8)
125 #define SAT_DEBUG_POLICY (1<<9)
126 #define SAT_DEBUG_RESULT (1<<10)
127 #define SAT_DEBUG_JOB (1<<11)
128 #define SAT_DEBUG_SCHUBI (1<<12)
132 #define TYPE_IDARRAY 2
135 #define TYPE_REL_IDARRAY 5
137 #define TYPE_ATTR_INT 6
138 #define TYPE_ATTR_CHUNK 7
139 #define TYPE_ATTR_STRING 8
140 #define TYPE_ATTR_INTLIST 9
141 #define TYPE_ATTR_LOCALIDS 10
143 #define TYPE_COUNT_NAMED 11
144 #define TYPE_COUNTED 12
146 #define TYPE_IDVALUEARRAY 13
147 #define TYPE_IDVALUEVALUEARRAY 14
149 /* The special types are usable to encode one-valued attributes, they have
150 no associated data. This is useful to encode values which many solvables
151 have in common, and whose overall set is relatively limited. A prime
152 example would be the media number. Be warned: careless use of this
153 leads to combinatoric explosion of number of schemas. */
154 #define TYPE_ATTR_SPECIAL_START 15
155 #define TYPE_ATTR_SPECIAL_END (TYPE_ATTR_SPECIAL_START + 31)
156 #define TYPE_ATTR_TYPE_MAX TYPE_ATTR_SPECIAL_END
158 //-----------------------------------------------
161 /* mark dependencies with relation by setting bit31 */
163 #define MAKERELDEP(id) ((id) | 0x80000000)
164 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
165 #define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
166 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
175 #define REL_NAMESPACE 19
177 #if !defined(__GNUC__) && !defined(__attribute__)
178 # define __attribute__(x)
184 extern Pool *pool_create(void);
188 extern void pool_free(Pool *pool);
190 extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
193 * Solvable management
195 extern Id pool_add_solvable(Pool *pool);
196 extern Id pool_add_solvable_block(Pool *pool, int count);
198 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
199 static inline Solvable *pool_id2solvable(Pool *pool, Id p)
201 return pool->solvables + p;
203 extern const char *solvable2str(Pool *pool, Solvable *s);
207 * Prepares a pool for solving
209 extern void pool_createwhatprovides(Pool *pool);
210 extern void pool_addfileprovides(Pool *pool);
211 extern void pool_freewhatprovides(Pool *pool);
212 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
214 static inline int pool_installable(Pool *pool, Solvable *s)
216 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
218 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
223 extern Id *pool_addrelproviders(Pool *pool, Id d);
225 static inline Id *pool_whatprovides(Pool *pool, Id d)
229 return pool->whatprovidesdata + pool->whatprovides[d];
231 if (pool->whatprovides_rel[v])
232 return pool->whatprovidesdata + pool->whatprovides_rel[v];
233 return pool_addrelproviders(pool, d);
236 extern void pool_setdebuglevel(Pool *pool, int level);
238 static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
240 pool->debugcallback = debugcallback;
241 pool->debugcallbackdata = debugcallbackdata;
244 static inline void pool_setdebugmask(Pool *pool, int mask)
246 pool->debugmask = mask;
249 /* loop over all providers of d */
250 #define FOR_PROVIDES(v, vp, d) \
251 for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
253 #define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
254 #define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
261 #endif /* SATSOLVER_POOL_H */