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"
22 typedef struct _Repo {
23 const char *name; /* application private name pointer */
24 Id repoid; /* our id */
25 void *appdata; /* application private pointer */
27 Pool *pool; /* pool containing this repo */
29 int start; /* start of this repo solvables within pool->solvables */
30 int end; /* last solvable + 1 of this repo */
31 int nsolvables; /* number of solvables repo is contributing to pool */
33 int disabled; /* ignore the solvables? */
34 int priority; /* priority of this repo */
35 int subpriority; /* sub-priority of this repo, used just for sorting, not pruning */
37 Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
39 Offset lastoff; /* start of last array in idarraydata */
41 Id *rpmdbid; /* solvable side data */
43 Repodata *repodata; /* our stores for non-solvable related data */
44 unsigned nrepodata; /* number of our stores.. */
47 extern Repo *repo_create(Pool *pool, const char *name);
48 extern void repo_free(Repo *repo, int reuseids);
49 extern void repo_freeallrepos(Pool *pool, int reuseids);
50 extern void *repo_sidedata_create(Repo *repo, size_t size);
51 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
53 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
54 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
55 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
56 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
57 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
59 static inline const char *repo_name(const Repo *repo)
64 static inline Id repo_add_solvable(Repo *repo)
66 extern Id pool_add_solvable(Pool *pool);
67 Id p = pool_add_solvable(repo->pool);
68 if (!repo->start || repo->start == repo->end)
69 repo->start = repo->end = p;
70 /* warning: sidedata must be extended before adapting start/end */
72 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
75 if (p + 1 > repo->end)
78 repo->pool->solvables[p].repo = repo;
82 static inline Id repo_add_solvable_block(Repo *repo, int count)
84 extern Id pool_add_solvable_block(Pool *pool, int count);
89 p = pool_add_solvable_block(repo->pool, count);
90 if (!repo->start || repo->start == repo->end)
91 repo->start = repo->end = p;
92 /* warning: sidedata must be extended before adapting start/end */
94 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
97 if (p + count > repo->end)
98 repo->end = p + count;
99 repo->nsolvables += count;
100 for (s = repo->pool->solvables + p; count--; s++)
105 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
107 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
110 if (start + count == repo->end)
112 repo->nsolvables -= count;
113 for (s = repo->pool->solvables + start, i = count; i--; s++)
115 pool_free_solvable_block(repo->pool, start, count, reuseids);
118 #define FOR_REPO_SOLVABLES(r, p, s) \
119 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
123 /* those two functions are here because they need the Repo definition */
125 static inline Repo *pool_id2repo(Pool *pool, Id repoid)
127 return pool->repos[repoid - 1];
130 static inline int pool_installable(const Pool *pool, Solvable *s)
132 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
134 if (s->repo && s->repo->disabled)
136 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
138 if (pool->considered)
140 Id id = s - pool->solvables;
141 if (!MAPTST(pool->considered, id))
147 /* search callback values */
149 #define SEARCH_NEXT_KEY 1
150 #define SEARCH_NEXT_SOLVABLE 2
151 #define SEARCH_STOP 3
152 #define SEARCH_ENTERSUB -1
154 typedef struct _KeyValue {
160 int entry; /* array entry, starts with 0 */
161 int eof; /* last entry reached */
163 struct _KeyValue *parent;
166 /* search matcher flags */
167 #define SEARCH_STRINGMASK 15
168 #define SEARCH_STRING 1
169 #define SEARCH_SUBSTRING 2
170 #define SEARCH_GLOB 3
171 #define SEARCH_REGEX 4
172 #define SEARCH_ERROR 5
173 #define SEARCH_NOCASE (1<<7)
175 /* iterator control */
176 #define SEARCH_NO_STORAGE_SOLVABLE (1<<8)
177 #define SEARCH_SUB (1<<9)
178 #define SEARCH_ARRAYSENTINEL (1<<10)
179 #define SEARCH_DISABLED_REPOS (1<<11)
181 /* stringification flags */
182 #define SEARCH_SKIP_KIND (1<<16)
183 /* By default we stringify just to the basename of a file because
184 the construction of the full filename is costly. Specify this
185 flag if you want to match full filenames */
186 #define SEARCH_FILES (1<<17)
187 #define SEARCH_CHECKSUMS (1<<18)
189 /* dataiterator internal */
190 #define SEARCH_THISSOLVID (1<<31)
193 /* standard flags used in the repo_add functions */
194 #define REPO_REUSE_REPODATA (1 << 0)
195 #define REPO_NO_INTERNALIZE (1 << 1)
197 Repodata *repo_add_repodata(Repo *repo, int localpool);
198 Repodata *repo_last_repodata(Repo *repo);
200 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);
202 /* returns the string value of the attribute, or NULL if not found */
203 const char *repo_lookup_str(Repo *repo, Id entry, Id key);
204 /* returns the integer value of the attribute, or 0 if not found */
205 unsigned int repo_lookup_num(Repo *repo, Id entry, Id key, unsigned int notfound);
206 Id repo_lookup_id(Repo *repo, Id entry, Id keyid);
207 int repo_lookup_void(Repo *repo, Id entry, Id keyid);
208 const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyid, Id *typep);
210 typedef struct _Datamatcher {
217 typedef struct _Dataiterator
239 /* iterators/filters */
259 int datamatcher_init(Datamatcher *ma, const char *match, int flags);
260 void datamatcher_free(Datamatcher *ma);
261 int datamatcher_match(Datamatcher *ma, const char *str);
266 * Iterator like interface to 'search' functionality
268 * Dataiterator is per-pool, additional filters can be applied
269 * to limit the search domain. See dataiterator_init below.
273 * dataiterator_init(&di, repo->pool, repo, 0, 0, "bla", SEARCH_SUBSTRING);
274 * while (dataiterator_step(&di))
275 * dosomething(di.solvid, di.key, di.kv);
276 * dataiterator_free(&di);
280 * Initialize dataiterator
282 * di: Pointer to Dataiterator to be initialized
283 * pool: Search domain for the iterator
284 * repo: if non-null, limit search to this repo
285 * solvid: if non-null, limit search to this solvable
286 * keyname: if non-null, limit search to this keyname
287 * match: if non-null, limit search to this match
289 int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags);
290 void dataiterator_init_clone(Dataiterator *di, Dataiterator *from);
291 void dataiterator_set_search(Dataiterator *di, Repo *repo, Id p);
292 void dataiterator_set_keyname(Dataiterator *di, Id keyname);
293 int dataiterator_set_match(Dataiterator *di, const char *match, int flags);
295 void dataiterator_prepend_keyname(Dataiterator *di, Id keyname);
296 void dataiterator_free(Dataiterator *di);
297 int dataiterator_step(Dataiterator *di);
298 void dataiterator_setpos(Dataiterator *di);
299 void dataiterator_setpos_parent(Dataiterator *di);
300 int dataiterator_match(Dataiterator *di, Datamatcher *ma);
301 void dataiterator_skip_attribute(Dataiterator *di);
302 void dataiterator_skip_solvable(Dataiterator *di);
303 void dataiterator_skip_repo(Dataiterator *di);
304 void dataiterator_jump_to_solvid(Dataiterator *di, Id solvid);
305 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
306 void dataiterator_entersub(Dataiterator *di);
307 void dataiterator_clonepos(Dataiterator *di, Dataiterator *from);
308 void dataiterator_seek(Dataiterator *di, int whence);
310 #define DI_SEEK_STAY (1 << 16)
311 #define DI_SEEK_CHILD 1
312 #define DI_SEEK_PARENT 2
313 #define DI_SEEK_REWIND 3
316 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
317 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
318 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
319 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
320 void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
321 void repo_internalize(Repo *repo);
322 void repo_disable_paging(Repo *repo);
324 #endif /* SATSOLVER_REPO_H */