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; /* solvable side data */
49 Repodata *repodata; /* our stores for non-solvable related data */
50 unsigned nrepodata; /* number of our stores.. */
53 extern Repo *repo_create(Pool *pool, const char *name);
54 extern void repo_free(Repo *repo, int reuseids);
55 extern void repo_freeallrepos(Pool *pool, int reuseids);
56 extern void *repo_sidedata_create(Repo *repo, size_t size);
57 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
59 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
60 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
61 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
62 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
63 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
65 static inline const char *repo_name(const Repo *repo)
70 static inline Id repo_add_solvable(Repo *repo)
72 extern Id pool_add_solvable(Pool *pool);
73 Id p = pool_add_solvable(repo->pool);
74 if (!repo->start || repo->start == repo->end)
82 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
85 if (p + 1 > repo->end)
89 repo->pool->solvables[p].repo = repo;
93 static inline Id repo_add_solvable_block(Repo *repo, int count)
95 extern Id pool_add_solvable_block(Pool *pool, int count);
100 p = pool_add_solvable_block(repo->pool, count);
101 if (!repo->start || repo->start == repo->end)
104 repo->end = p + count;
109 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
112 if (p + count > repo->end)
113 repo->end = p + count;
115 repo->nsolvables += count;
116 for (s = repo->pool->solvables + p; count--; s++)
121 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
123 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
126 if (start + count == repo->end)
128 repo->nsolvables -= count;
129 for (s = repo->pool->solvables + start, i = count; i--; s++)
131 pool_free_solvable_block(repo->pool, start, count, reuseids);
134 #define FOR_REPO_SOLVABLES(r, p, s) \
135 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
139 /* search callback values */
141 #define SEARCH_NEXT_KEY 1
142 #define SEARCH_NEXT_SOLVABLE 2
143 #define SEARCH_STOP 3
144 #define SEARCH_ENTERSUB -1
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_ARRAYSENTINEL (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_THISSOLVID (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 {
231 typedef struct _Dataiterator
253 /* iterators/filters */
273 int datamatcher_init(Datamatcher *ma, const char *match, int flags);
274 void datamatcher_free(Datamatcher *ma);
275 int datamatcher_match(Datamatcher *ma, const char *str);
280 * Iterator like interface to 'search' functionality
282 * Dataiterator is per-pool, additional filters can be applied
283 * to limit the search domain. See dataiterator_init below.
287 * dataiterator_init(&di, repo->pool, repo, 0, 0, "bla", SEARCH_SUBSTRING);
288 * while (dataiterator_step(&di))
289 * dosomething(di.solvid, di.key, di.kv);
290 * dataiterator_free(&di);
294 * Initialize dataiterator
296 * di: Pointer to Dataiterator to be initialized
297 * pool: Search domain for the iterator
298 * repo: if non-null, limit search to this repo
299 * solvid: if non-null, limit search to this solvable
300 * keyname: if non-null, limit search to this keyname
301 * match: if non-null, limit search to this match
303 int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname,
304 const char *match, int flags);
305 void dataiterator_prepend_keyname(Dataiterator *di, Id keyname);
306 void dataiterator_free(Dataiterator *di);
307 int dataiterator_step(Dataiterator *di);
308 void dataiterator_setpos(Dataiterator *di);
309 void dataiterator_setpos_parent(Dataiterator *di);
310 int dataiterator_match(Dataiterator *di, Datamatcher *ma);
311 void dataiterator_skip_attribute(Dataiterator *di);
312 void dataiterator_skip_solvable(Dataiterator *di);
313 void dataiterator_skip_repo(Dataiterator *di);
314 void dataiterator_jump_to_solvid(Dataiterator *di, Id solvid);
315 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
316 void dataiterator_entersub(Dataiterator *di);
318 /* to be removed ... */
319 int dataiterator_match_obsolete(Dataiterator *di, int flags, const void *match);
321 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
322 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
323 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
324 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
325 void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
326 void repo_internalize(Repo *repo);
327 void repo_disable_paging(Repo *repo);
329 #endif /* SATSOLVER_REPO_H */