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 {
24 struct _Pool *pool; /* pool containing repo data */
26 int start; /* start of this repo solvables within pool->solvables */
27 int end; /* last solvable + 1 of this repo */
28 int nsolvables; /* number of solvables repo is contributing to pool */
30 int priority; /* priority of this repo */
31 int subpriority; /* sub-priority of this repo, used just for sorting, not pruning */
33 Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
37 Id *rpmdbid; /* solvable side data */
39 Repodata *repodata; /* our stores for non-solvable related data */
40 unsigned nrepodata; /* number of our stores.. */
43 extern Repo *repo_create(Pool *pool, const char *name);
44 extern void repo_free(Repo *repo, int reuseids);
45 extern void repo_freeallrepos(Pool *pool, int reuseids);
46 extern void *repo_sidedata_create(Repo *repo, size_t size);
47 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
49 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
50 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
51 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
52 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
53 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
55 static inline const char *repo_name(const Repo *repo)
60 static inline Id repo_add_solvable(Repo *repo)
62 extern Id pool_add_solvable(Pool *pool);
63 Id p = pool_add_solvable(repo->pool);
64 if (!repo->start || repo->start == repo->end)
72 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
75 if (p + 1 > repo->end)
79 repo->pool->solvables[p].repo = repo;
83 static inline Id repo_add_solvable_block(Repo *repo, int count)
85 extern Id pool_add_solvable_block(Pool *pool, int count);
90 p = pool_add_solvable_block(repo->pool, count);
91 if (!repo->start || repo->start == repo->end)
94 repo->end = p + count;
99 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
102 if (p + count > repo->end)
103 repo->end = p + count;
105 repo->nsolvables += count;
106 for (s = repo->pool->solvables + p; count--; s++)
111 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
113 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
116 if (start + count == repo->end)
118 repo->nsolvables -= count;
119 for (s = repo->pool->solvables + start, i = count; i--; s++)
121 pool_free_solvable_block(repo->pool, start, count, reuseids);
124 #define FOR_REPO_SOLVABLES(r, p, s) \
125 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
129 /* search callback values */
131 #define SEARCH_NEXT_KEY 1
132 #define SEARCH_NEXT_SOLVABLE 2
133 #define SEARCH_STOP 3
134 #define SEARCH_ENTERSUB -1
136 typedef struct _KeyValue {
142 int entry; /* array entry, starts with 0 */
143 int eof; /* last entry reached */
145 struct _KeyValue *parent;
149 #define SEARCH_STRINGMASK 15
150 #define SEARCH_STRING 1
151 #define SEARCH_SUBSTRING 2
152 #define SEARCH_GLOB 3
153 #define SEARCH_REGEX 4
154 #define SEARCH_ERROR 5
156 #define SEARCH_NOCASE (1<<8)
157 #define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
158 #define SEARCH_SUB (1<<10)
159 #define SEARCH_ARRAYSENTINEL (1<<11)
160 #define SEARCH_SKIP_KIND (1<<12)
163 /* By default we don't match in attributes representing filelists
164 because the construction of those strings is costly. Specify this
165 flag if you want this. In that case kv->str will contain the full
166 filename (if matched of course). */
167 #define SEARCH_FILES (1<<13)
170 #define SEARCH_THISSOLVID (1<<31)
173 /* standard flags used in the repo_add functions */
174 #define REPO_REUSE_REPODATA (1 << 0)
175 #define REPO_NO_INTERNALIZE (1 << 1)
177 Repodata *repo_add_repodata(Repo *repo, int localpool);
178 Repodata *repo_last_repodata(Repo *repo);
180 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);
182 /* returns the string value of the attribute, or NULL if not found */
183 const char *repo_lookup_str(Repo *repo, Id entry, Id key);
184 /* returns the integer value of the attribute, or 0 if not found */
185 unsigned int repo_lookup_num(Repo *repo, Id entry, Id key, unsigned int notfound);
186 Id repo_lookup_id(Repo *repo, Id entry, Id keyid);
187 int repo_lookup_void(Repo *repo, Id entry, Id keyid);
188 const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyid, Id *typep);
190 typedef struct _Datamatcher {
196 typedef struct _Dataiterator
218 /* iterators/filters */
236 int datamatcher_init(Datamatcher *ma, const char *match, int flags);
237 void datamatcher_free(Datamatcher *ma);
238 int datamatcher_match(Datamatcher *ma, const char *str);
243 * Iterator like interface to 'search' functionality
245 * Dataiterator is per-pool, additional filters can be applied
246 * to limit the search domain. See dataiterator_init below.
250 * dataiterator_init(&di, repo->pool, repo, 0, 0, "bla", SEARCH_SUBSTRING);
251 * while (dataiterator_step(&di))
252 * dosomething(di.solvid, di.key, di.kv);
253 * dataiterator_free(&di);
257 * Initialize dataiterator
259 * di: Pointer to Dataiterator to be initialized
260 * pool: Search domain for the iterator
261 * repo: if non-null, limit search to this repo
262 * solvid: if non-null, limit search to this solvable
263 * keyname: if non-null, limit search to this keyname
264 * match: if non-null, limit search to this match
266 int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname,
267 const char *match, int flags);
268 void dataiterator_prepend_keyname(Dataiterator *di, Id keyname);
269 void dataiterator_free(Dataiterator *di);
270 int dataiterator_step(Dataiterator *di);
271 void dataiterator_setpos(Dataiterator *di);
272 void dataiterator_setpos_parent(Dataiterator *di);
273 int dataiterator_match(Dataiterator *di, Datamatcher *ma);
274 void dataiterator_skip_attribute(Dataiterator *di);
275 void dataiterator_skip_solvable(Dataiterator *di);
276 void dataiterator_skip_repo(Dataiterator *di);
277 void dataiterator_jump_to_solvid(Dataiterator *di, Id solvid);
278 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
279 void dataiterator_entersub(Dataiterator *di);
281 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
282 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
283 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
284 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
285 void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
286 void repo_internalize(Repo *repo);
287 void repo_disable_paging(Repo *repo);
289 #endif /* SATSOLVER_REPO_H */