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
18 #include "pooltypes.h"
22 typedef struct _Repokey {
24 Id type; /* REPOKEY_TYPE_xxx */
26 unsigned int storage; /* KEY_STORAGE_xxx */
29 #define KEY_STORAGE_DROPPED 0
30 #define KEY_STORAGE_SOLVABLE 1
31 #define KEY_STORAGE_INCORE 2
32 #define KEY_STORAGE_VERTICAL_OFFSET 3
35 typedef struct _Repo {
37 struct _Pool *pool; /* pool containing repo data */
39 int start; /* start of this repo solvables within pool->solvables */
40 int end; /* last solvable + 1 of this repo */
41 int nsolvables; /* number of solvables repo is contributing to pool */
42 int nextra; /* number of extra objects (non-solvables) */
44 int priority; /* priority of this repo */
46 Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
50 Id *rpmdbid; /* hmm, go to repodata? */
51 unsigned char rpmdbcookie[32];
53 Repodata *repodata; /* our stores for non-solvable related data */
54 unsigned nrepodata; /* number of our stores.. */
57 extern Repo *repo_create(Pool *pool, const char *name);
58 extern void repo_free(Repo *repo, int reuseids);
59 extern void repo_freeallrepos(Pool *pool, int reuseids);
60 extern void *repo_sidedata_create(Repo *repo, size_t size);
61 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
63 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
64 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
65 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
66 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
67 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
69 static inline const char *repo_name(const Repo *repo)
74 static inline Id repo_add_solvable(Repo *repo)
76 extern Id pool_add_solvable(Pool *pool);
77 Id p = pool_add_solvable(repo->pool);
78 if (!repo->start || repo->start == repo->end)
86 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
89 if (p + 1 > repo->end)
93 repo->pool->solvables[p].repo = repo;
97 static inline Id repo_add_solvable_block(Repo *repo, int count)
99 extern Id pool_add_solvable_block(Pool *pool, int count);
104 p = pool_add_solvable_block(repo->pool, count);
105 if (!repo->start || repo->start == repo->end)
108 repo->end = p + count;
113 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
116 if (p + count > repo->end)
117 repo->end = p + count;
119 repo->nsolvables += count;
120 for (s = repo->pool->solvables + p; count--; s++)
125 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
127 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
130 if (start + count == repo->end)
132 repo->nsolvables -= count;
133 for (s = repo->pool->solvables + start, i = count; i--; s++)
135 pool_free_solvable_block(repo->pool, start, count, reuseids);
138 #define FOR_REPO_SOLVABLES(r, p, s) \
139 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
143 /* search callback values */
145 #define SEARCH_NEXT_KEY 1
146 #define SEARCH_NEXT_SOLVABLE 2
147 #define SEARCH_STOP 3
149 typedef struct _KeyValue {
158 #define SEARCH_STRINGMASK 15
159 #define SEARCH_STRING 1
160 #define SEARCH_SUBSTRING 2
161 #define SEARCH_GLOB 3
162 #define SEARCH_REGEX 4
164 #define SEARCH_NOCASE (1<<8)
165 #define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
166 #define SEARCH_EXTRA (1<<10)
167 #define SEARCH_ALL_REPOS (1<<11)
168 #define SEARCH_SKIP_KIND (1<<12)
170 /* By default we don't match in attributes representing filelists
171 because the construction of those strings is costly. Specify this
172 flag if you want this. In that case kv->str will contain the full
173 filename (if matched of course). */
174 #define SEARCH_FILES (1<<13)
177 #define __SEARCH_ONESOLVABLE (1 << 31)
179 Repodata *repo_add_repodata(Repo *repo, int localpool);
181 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);
183 /* returns the string value of the attribute, or NULL if not found */
184 const char * repo_lookup_str(Solvable *s, Id key);
185 /* returns the integer value of the attribute, or 0 if not found */
186 unsigned int repo_lookup_num(Solvable *s, Id key);
187 /* generic attribute lookup */
188 int repo_lookup(Solvable *s, Id key, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata);
190 typedef struct _Dataiterator
194 unsigned char *nextkeydp;
214 dataiterator_init(&di, repo, 0, 0, "bla", SEARCH_SUBSTRING);
215 while (dataiterator_step(&di))
216 dosomething(di.solvid, di.key, di.kv); */
217 void dataiterator_init(Dataiterator *di, Repo *repo, Id p, Id keyname,
218 const char *match, int flags);
219 int dataiterator_step(Dataiterator *di);
220 int dataiterator_match(Dataiterator *di, int flags, const void *match);
221 void dataiterator_skip_attribute(Dataiterator *di);
222 void dataiterator_skip_solvable(Dataiterator *di);
223 void dataiterator_skip_repo(Dataiterator *di);
224 void dataiterator_jump_to_solvable(Dataiterator *di, Solvable *s);
225 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
227 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
228 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
229 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
230 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
231 void repo_internalize(Repo *repo);
232 void repo_disable_paging(Repo *repo);
234 #endif /* SATSOLVER_REPO_H */