18 // see initpool_data[] in pool.c
23 #define SOLVABLE_NAME 2
24 #define SOLVABLE_ARCH 3
25 #define SOLVABLE_EVR 4
26 #define SOLVABLE_PROVIDES 5
27 #define SOLVABLE_OBSOLETES 6
28 #define SOLVABLE_CONFLICTS 7
29 #define SOLVABLE_REQUIRES 8
30 #define SOLVABLE_RECOMMENDS 9
31 #define SOLVABLE_SUGGESTS 10
32 #define SOLVABLE_SUPPLEMENTS 11
33 #define SOLVABLE_ENHANCES 12
34 #define SOLVABLE_FRESHENS 13
35 #define RPM_RPMDBID 14
36 #define SOLVABLE_PREREQMARKER 15 // normal requires before this, prereqs after this
37 #define SOLVABLE_FILEMARKER 16 // normal provides before this, generated file provides after this
38 #define NAMESPACE_INSTALLED 17
39 #define NAMESPACE_MODALIAS 18
42 #define ARCH_NOARCH 21
44 //-----------------------------------------------
47 int verbose; // pool is used everywhere, so put the verbose flag here
49 Offset *strings; // table of offsets into stringspace, indexed by Id: Id -> Offset
50 int nstrings; // number of unique strings in stringspace
51 char *stringspace; // space for all unique strings: stringspace + Offset = string
52 Offset sstrings; // next free pos in stringspace
54 Hashtable stringhashtbl; // hash table: (string ->) Hash -> Id
55 Hashmask stringhashmask; // modulo value for hash table (size of table - 1)
57 Reldep *rels; // table of rels: Id -> Reldep
58 int nrels; // number of unique rels
59 Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
70 Id *id2arch; /* map arch ids to scores */
71 Id lastarch; /* last valid entry in id2arch */
73 /* providers data, as two-step indirect list
74 * whatprovides[Id] -> Offset into whatprovidesdata for name
75 * whatprovidesdata[Offset] -> ID_NULL-terminated list of solvables providing Id
77 Offset *whatprovides; /* Offset to providers of a specific name, 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 */
84 #define TYPE_IDARRAY 2
87 #define TYPE_BITMAP 128
90 //-----------------------------------------------
93 // "foo" -> Id -> lookup in table, returns offset into whatprovidesdata where array of Ids providing 'foo' are located, 0-terminated
96 #define GET_PROVIDESP(d, v) (ISRELDEP(d) ? \
97 (v = GETRELID(pool, d), pool->whatprovides[v] ? \
98 pool->whatprovidesdata + pool->whatprovides[v] : \
99 addrelproviders(pool, d) \
101 (pool->whatprovidesdata + pool->whatprovides[d]))
103 /* loop over all providers of d */
104 #define FOR_PROVIDES(v, vp, d) \
105 for (vp = GET_PROVIDESP(d, v) ; (v = *vp++) != ID_NULL; )
107 /* mark dependencies with relation by setting bit31 */
109 #define MAKERELDEP(id) ((id) | 0x80000000)
110 #define ISRELDEP(id) (((id) & 0x80000000) != 0)
111 #define GETRELID(pool, id) ((pool)->nstrings + ((id) ^ 0x80000000)) /* returns Id */
112 #define GETRELDEP(pool, id) ((pool)->rels + ((id) ^ 0x80000000)) /* returns Reldep* */
121 #define REL_NAMESPACE 19
123 extern Pool *pool_create(void);
124 extern void pool_free(Pool *pool);
125 extern void pool_freesource(Pool *pool, Source *source);
126 extern void pool_prepare(Pool *pool);
127 extern void pool_freewhatprovides(Pool *pool);
128 extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
130 extern Id *addrelproviders(Pool *pool, Id d);
132 extern Source *pool_source(Pool *pool, Solvable *s);