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"
21 #include "attr_store.h"
25 typedef struct _Repokey {
27 Id type; /* REPOKEY_TYPE_xxx */
29 unsigned int storage; /* KEY_STORAGE_xxx */
32 #define KEY_STORAGE_DROPPED 0
33 #define KEY_STORAGE_SOLVABLE 1
34 #define KEY_STORAGE_INCORE 2
35 #define KEY_STORAGE_VERTICAL_OFFSET 3
38 typedef struct _Repo {
40 struct _Pool *pool; /* pool containing repo data */
42 int start; /* start of this repo solvables within pool->solvables */
43 int end; /* last solvable + 1 of this repo */
44 int nsolvables; /* number of solvables repo is contributing to pool */
45 int nextra; /* number of extra objects (non-solvables) */
47 int priority; /* priority of this repo */
49 Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
53 Id *rpmdbid; /* hmm, go to repodata? */
55 Repodata *repodata; /* our stores for non-solvable related data */
56 unsigned nrepodata; /* number of our stores.. */
59 extern Repo *repo_create(Pool *pool, const char *name);
60 extern void repo_free(Repo *repo, int reuseids);
61 extern void repo_freeallrepos(Pool *pool, int reuseids);
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_legacy(Repo *repo, Offset provides, Offset supplements);
68 static inline const char *repo_name(const Repo *repo)
73 static inline Id repo_add_solvable(Repo *repo)
75 extern Id pool_add_solvable(Pool *pool);
76 Id p = pool_add_solvable(repo->pool);
77 if (!repo->start || repo->start == repo->end)
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;
111 if (p + count > repo->end)
112 repo->end = p + count;
114 repo->nsolvables += count;
115 for (s = repo->pool->solvables + p; count--; s++)
120 static inline void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
122 extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
125 if (start + count == repo->end)
127 repo->nsolvables -= count;
128 for (s = repo->pool->solvables + start, i = count; i--; s++)
130 pool_free_solvable_block(repo->pool, start, count, reuseids);
133 #define FOR_REPO_SOLVABLES(r, p, s) \
134 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
138 /* search callback values */
140 #define SEARCH_NEXT_KEY 1
141 #define SEARCH_NEXT_SOLVABLE 2
142 #define SEARCH_STOP 3
144 typedef struct _KeyValue {
153 #define SEARCH_STRINGMASK 15
154 #define SEARCH_STRING 1
155 #define SEARCH_SUBSTRING 2
156 #define SEARCH_GLOB 3
157 #define SEARCH_REGEX 4
159 #define SEARCH_NOCASE (1<<8)
160 #define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
161 #define SEARCH_EXTRA (1<<10)
162 #define SEARCH_ALL_REPOS (1<<11)
165 #define __SEARCH_ONESOLVABLE (1 << 31)
167 Repodata *repo_add_repodata(Repo *repo, int localpool);
169 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);
171 /* returns the string value of the attribute, or NULL if not found */
172 const char * repo_lookup_str(Solvable *s, Id key);
173 /* returns the integer value of the attribute, or 0 if not found */
174 unsigned int repo_lookup_num(Solvable *s, Id key);
175 /* generic attribute lookup */
176 int repo_lookup(Solvable *s, Id key, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata);
178 typedef struct _Dataiterator
182 unsigned char *nextkeydp;
199 dataiterator_init(&di, repo, 0, 0, "bla", SEARCH_SUBSTRING);
200 while (dataiterator_step(&di))
201 dosomething(di.solvid, di.key, di.kv); */
202 void dataiterator_init(Dataiterator *di, Repo *repo, Id p, Id keyname,
203 const char *match, int flags);
204 int dataiterator_step(Dataiterator *di);
205 int dataiterator_match(Dataiterator *di, int flags, const void *match);
206 void dataiterator_skip_attribute(Dataiterator *di);
207 void dataiterator_skip_solvable(Dataiterator *di);
208 void dataiterator_skip_repo(Dataiterator *di);
209 void dataiterator_jump_to_solvable(Dataiterator *di, Solvable *s);
210 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
212 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
213 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
214 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
215 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
216 void repo_internalize(Repo *repo);
217 void repo_disable_paging(Repo *repo);
219 #endif /* SATSOLVER_REPO_H */