1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
|
/*
* Copyright (c) 2007, Novell Inc.
*
* This program is licensed under the BSD license, read LICENSE.BSD
* for further information
*/
/*
* pool.h
*
*/
#ifndef SATSOLVER_POOL_H
#define SATSOLVER_POOL_H
#ifdef __cplusplus
extern "C" {
#endif
#include "pooltypes.h"
#include "poolid.h"
#include "solvable.h"
#include "queue.h"
#include "strpool.h"
// see initpool_data[] in pool.c
/* well known ids */
#define ID_NULL STRID_NULL
#define ID_EMPTY STRID_EMPTY
#define SOLVABLE_NAME 2
#define SOLVABLE_ARCH 3
#define SOLVABLE_EVR 4
#define SOLVABLE_VENDOR 5
#define SOLVABLE_PROVIDES 6
#define SOLVABLE_OBSOLETES 7
#define SOLVABLE_CONFLICTS 8
#define SOLVABLE_REQUIRES 9
#define SOLVABLE_RECOMMENDS 10
#define SOLVABLE_SUGGESTS 11
#define SOLVABLE_SUPPLEMENTS 12
#define SOLVABLE_ENHANCES 13
#define SOLVABLE_FRESHENS 14
#define RPM_RPMDBID 15
#define SOLVABLE_PREREQMARKER 16 // normal requires before this, prereqs after this
#define SOLVABLE_FILEMARKER 17 // normal provides before this, generated file provides after this
#define NAMESPACE_INSTALLED 18
#define NAMESPACE_MODALIAS 19
#define SYSTEM_SYSTEM 20
#define ARCH_SRC 21
#define ARCH_NOSRC 22
#define ARCH_NOARCH 23
#define REPODATA_EXTERNAL 24
#define REPODATA_KEYS 25
#define REPODATA_LOCATION 26
#define ID_NUM_INTERNAL 27
/* well known solvable */
#define SYSTEMSOLVABLE 1
/* how many strings to maintain (round robin) */
#define DEP2STRBUF 16
//-----------------------------------------------
struct _Repo;
struct _Pool {
struct _Stringpool ss;
Reldep *rels; // table of rels: Id -> Reldep
int nrels; // number of unique rels
Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
Hashmask relhashmask;
struct _Repo **repos;
int nrepos;
Solvable *solvables;
int nsolvables;
int promoteepoch; /* 0/1 */
Id *id2arch; /* map arch ids to scores */
Id lastarch; /* last valid entry in id2arch */
Queue vendormap; /* map vendor to vendorclasses mask */
/* providers data, as two-step indirect list
* whatprovides[Id] -> Offset into whatprovidesdata for name
* whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
*/
Offset *whatprovides; /* Offset to providers of a specific name, Id -> Offset */
Offset *whatprovides_rel; /* Offset to providers of a specific relation, Id -> Offset */
Id *whatprovidesdata; /* Ids of solvable providing Id */
Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
void *nscallbackdata;
/* our dep2str string space */
char *dep2strbuf[DEP2STRBUF];
int dep2strlen[DEP2STRBUF];
int dep2strn;
/* debug mask and callback */
int debugmask;
void (*debugcallback)(struct _Pool *, void *data, int type, const char *str);
void *debugcallbackdata;
};
#define SAT_FATAL (1<<0)
#define SAT_ERROR (1<<1)
#define SAT_WARN (1<<2)
#define SAT_DEBUG_STATS (1<<3)
#define SAT_DEBUG_RULE_CREATION (1<<4)
#define SAT_DEBUG_PROPAGATE (1<<5)
#define SAT_DEBUG_ANALYZE (1<<6)
#define SAT_DEBUG_UNSOLVABLE (1<<7)
#define SAT_DEBUG_SOLUTIONS (1<<8)
#define SAT_DEBUG_POLICY (1<<9)
#define SAT_DEBUG_RESULT (1<<10)
#define SAT_DEBUG_JOB (1<<11)
#define SAT_DEBUG_SCHUBI (1<<12)
#define TYPE_VOID 0
#define TYPE_ID 1
#define TYPE_IDARRAY 2
#define TYPE_STR 3
#define TYPE_U32 4
#define TYPE_REL_IDARRAY 5
#define TYPE_ATTR_INT 6
#define TYPE_ATTR_CHUNK 7
#define TYPE_ATTR_STRING 8
#define TYPE_ATTR_INTLIST 9
#define TYPE_ATTR_LOCALIDS 10
#define TYPE_COUNT_NAMED 11
#define TYPE_COUNTED 12
#define TYPE_IDVALUEARRAY 13
#define TYPE_IDVALUEVALUEARRAY 14
/* The special types are usable to encode one-valued attributes, they have
no associated data. This is useful to encode values which many solvables
have in common, and whose overall set is relatively limited. A prime
example would be the media number. Be warned: careless use of this
leads to combinatoric explosion of number of schemas. */
#define TYPE_ATTR_SPECIAL_START 15
#define TYPE_ATTR_SPECIAL_END (TYPE_ATTR_SPECIAL_START + 31)
#define TYPE_ATTR_TYPE_MAX TYPE_ATTR_SPECIAL_END
//-----------------------------------------------
/* mark dependencies with relation by setting bit31 */
#define MAKERELDEP(id) ((id) | 0x80000000)
#define ISRELDEP(id) (((id) & 0x80000000) != 0)
#define GETRELID(id) ((id) ^ 0x80000000) /* returns Id */
#define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
#define REL_GT 1
#define REL_EQ 2
#define REL_LT 4
#define REL_AND 16
#define REL_OR 17
#define REL_WITH 18
#define REL_NAMESPACE 19
#if !defined(__GNUC__) && !defined(__attribute__)
# define __attribute__(x)
#endif
/**
* Creates a new pool
*/
extern Pool *pool_create(void);
/**
* Delete a pool
*/
extern void pool_free(Pool *pool);
extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
/**
* Solvable management
*/
extern Id pool_add_solvable(Pool *pool);
extern Id pool_add_solvable_block(Pool *pool, int count);
extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
static inline Solvable *pool_id2solvable(Pool *pool, Id p)
{
return pool->solvables + p;
}
extern const char *solvable2str(Pool *pool, Solvable *s);
/**
* Prepares a pool for solving
*/
extern void pool_createwhatprovides(Pool *pool);
extern void pool_addfileprovides(Pool *pool);
extern void pool_freewhatprovides(Pool *pool);
extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
static inline int pool_installable(Pool *pool, Solvable *s)
{
if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
return 0;
if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
return 0;
return 1;
}
extern Id *pool_addrelproviders(Pool *pool, Id d);
static inline Id *pool_whatprovides(Pool *pool, Id d)
{
Id v;
if (!ISRELDEP(d))
return pool->whatprovidesdata + pool->whatprovides[d];
v = GETRELID(d);
if (pool->whatprovides_rel[v])
return pool->whatprovidesdata + pool->whatprovides_rel[v];
return pool_addrelproviders(pool, d);
}
extern void pool_setdebuglevel(Pool *pool, int level);
static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
{
pool->debugcallback = debugcallback;
pool->debugcallbackdata = debugcallbackdata;
}
static inline void pool_setdebugmask(Pool *pool, int mask)
{
pool->debugmask = mask;
}
/* loop over all providers of d */
#define FOR_PROVIDES(v, vp, d) \
for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
#define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
#define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
#ifdef __cplusplus
}
#endif
#endif /* SATSOLVER_POOL_H */
|
