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_REPO_H
14 #define SATSOLVER_REPO_H
16 #include "pooltypes.h"
20 typedef struct _Repokey {
22 Id type; /* REPOKEY_TYPE_xxx */
24 unsigned int storage; /* KEY_STORAGE_xxx */
27 #define KEY_STORAGE_DROPPED 0
28 #define KEY_STORAGE_SOLVABLE 1
29 #define KEY_STORAGE_INCORE 2
30 #define KEY_STORAGE_VERTICAL_OFFSET 3
33 typedef struct _Repo {
35 struct _Pool *pool; /* pool containing repo data */
37 int start; /* start of this repo solvables within pool->solvables */
38 int end; /* last solvable + 1 of this repo */
39 int nsolvables; /* number of solvables repo is contributing to pool */
41 int priority; /* priority of this repo */
43 Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
47 Id *rpmdbid; /* hmm, go to repodata? */
48 unsigned char rpmdbcookie[32];
50 Repodata *repodata; /* our stores for non-solvable related data */
51 unsigned nrepodata; /* number of our stores.. */
54 extern Repo *repo_create(Pool *pool, const char *name);
55 extern void repo_free(Repo *repo, int reuseids);
56 extern void repo_freeallrepos(Pool *pool, int reuseids);
57 extern void *repo_sidedata_create(Repo *repo, size_t size);
58 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
60 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
61 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
62 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
63 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
64 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
66 static inline const char *repo_name(const Repo *repo)
71 static inline Id repo_add_solvable(Repo *repo)
73 extern Id pool_add_solvable(Pool *pool);
74 Id p = pool_add_solvable(repo->pool);
75 if (!repo->start || repo->start == repo->end)
83 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
86 if (p + 1 > repo->end)
90 repo->pool->solvables[p].repo = repo;
94 static inline Id repo_add_solvable_block(Repo *repo, int count)
96 extern Id pool_add_solvable_block(Pool *pool, int count);
101 p = pool_add_solvable_block(repo->pool, count);
102 if (!repo->start || repo->start == repo->end)
105 repo->end = p + count;
110 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
113 if (p + count > repo->end)
114 repo->end = p + count;
116 repo->nsolvables += count;
117 for (s = repo->pool->solvables + p; count--; s++)
122 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
124 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
127 if (start + count == repo->end)
129 repo->nsolvables -= count;
130 for (s = repo->pool->solvables + start, i = count; i--; s++)
132 pool_free_solvable_block(repo->pool, start, count, reuseids);
135 #define FOR_REPO_SOLVABLES(r, p, s) \
136 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
140 /* search callback values */
142 #define SEARCH_NEXT_KEY 1
143 #define SEARCH_NEXT_SOLVABLE 2
144 #define SEARCH_STOP 3
146 typedef struct _KeyValue {
152 int entry; /* array entry, starts with 0 */
153 int eof; /* last entry reached */
155 struct _KeyValue *parent;
159 #define SEARCH_STRINGMASK 15
160 #define SEARCH_STRING 1
161 #define SEARCH_SUBSTRING 2
162 #define SEARCH_GLOB 3
163 #define SEARCH_REGEX 4
164 #define SEARCH_ERROR 5
166 #define SEARCH_NOCASE (1<<8)
167 #define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
168 #define SEARCH_SUB (1<<10)
169 #define SEARCH_ALL_REPOS (1<<11)
170 #define SEARCH_SKIP_KIND (1<<12)
173 /* By default we don't match in attributes representing filelists
174 because the construction of those strings is costly. Specify this
175 flag if you want this. In that case kv->str will contain the full
176 filename (if matched of course). */
177 #define SEARCH_FILES (1<<13)
180 #define SEARCH_THISENTRY (1<<31)
183 /* standard flags used in the repo_add functions */
184 #define REPO_REUSE_REPODATA (1 << 0)
185 #define REPO_NO_INTERNALIZE (1 << 1)
187 Repodata *repo_add_repodata(Repo *repo, int localpool);
188 Repodata *repo_last_repodata(Repo *repo);
190 void repo_search(Repo *repo, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata);
192 /* returns the string value of the attribute, or NULL if not found */
193 const char *repo_lookup_str(Repo *repo, Id entry, Id key);
194 /* returns the integer value of the attribute, or 0 if not found */
195 unsigned int repo_lookup_num(Repo *repo, Id entry, Id key, unsigned int notfound);
196 Id repo_lookup_id(Repo *repo, Id entry, Id keyid);
197 int repo_lookup_void(Repo *repo, Id entry, Id keyid);
198 const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyid, Id *typep);
202 typedef struct _Dataiterator
206 unsigned char *nextkeydp;
225 typedef struct _Datamatcher {
232 typedef struct _Dataiterator
254 /* iterators/filters */
271 void datamatcher_init(Datamatcher *ma, Pool *pool, const char *match, int flags);
272 void datamatcher_free(Datamatcher *ma);
273 int datamatcher_match(Datamatcher *ma, Repodata *data, Repokey *key, KeyValue *kv);
277 dataiterator_init(&di, repo, 0, 0, "bla", SEARCH_SUBSTRING);
278 while (dataiterator_step(&di))
279 dosomething(di.solvid, di.key, di.kv);
280 dataiterator_free(&di); */
281 void dataiterator_init(Dataiterator *di, Repo *repo, Id p, Id keyname,
282 const char *match, int flags);
283 void dataiterator_free(Dataiterator *di);
284 int dataiterator_step(Dataiterator *di);
285 void dataiterator_setpos(Dataiterator *di);
286 int dataiterator_match(Dataiterator *di, int flags, const void *match);
287 void dataiterator_skip_attribute(Dataiterator *di);
288 void dataiterator_skip_solvable(Dataiterator *di);
289 void dataiterator_skip_repo(Dataiterator *di);
290 void dataiterator_jump_to_solvable(Dataiterator *di, Solvable *s);
291 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
293 /* to be removed ... */
294 int dataiterator_match(Dataiterator *di, int flags, const void *match);
296 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
297 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
298 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
299 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
300 void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
301 void repo_internalize(Repo *repo);
302 void repo_disable_paging(Repo *repo);
304 #endif /* SATSOLVER_REPO_H */