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"
19 #include "attr_store.h"
23 typedef struct _Repokey {
25 unsigned int type; /* TYPE_xxx */
27 unsigned int storage; /* KEY_STORAGE_xxx */
30 #define KEY_STORAGE_DROPPED 0
31 #define KEY_STORAGE_SOLVABLE 1
32 #define KEY_STORAGE_INCORE 2
33 #define KEY_STORAGE_VERTICAL_OFFSET 3
36 typedef struct _Repo {
38 struct _Pool *pool; /* pool containing repo data */
40 int start; /* start of this repo solvables within pool->solvables */
41 int end; /* last solvable + 1 of this repo */
42 int nsolvables; /* number of solvables repo is contributing to pool */
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? */
52 Repodata *repodata; /* our stores for non-solvable related data */
53 unsigned nrepodata; /* number of our stores.. */
56 extern Repo *repo_create(Pool *pool, const char *name);
57 extern void repo_free(Repo *repo, int reuseids);
58 extern void repo_freeallrepos(Pool *pool, int reuseids);
60 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
61 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
62 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
63 extern Offset repo_fix_legacy(Repo *repo, Offset provides, Offset supplements);
66 extern void repo_add_attrstore (Repo *repo, Attrstore *s, const char *location);
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)
87 if (p + 1 > repo->end)
91 repo->pool->solvables[p].repo = repo;
95 static inline Id repo_add_solvable_block(Repo *repo, int count)
97 extern Id pool_add_solvable_block(Pool *pool, int count);
102 p = pool_add_solvable_block(repo->pool, count);
103 if (!repo->start || repo->start == repo->end)
106 repo->end = 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
145 typedef struct _KeyValue {
154 #define SEARCH_STRINGMASK 15
155 #define SEARCH_STRING 1
156 #define SEARCH_SUBSTRING 2
157 #define SEARCH_GLOB 3
158 #define SEARCH_REGEX 4
160 #define SEARCH_NOCASE (1<<8)
161 #define SEARCH_NO_STORAGE_SOLVABLE (1<<9)
164 #define __SEARCH_ONESOLVABLE (1 << 31)
166 Repodata *repo_add_repodata(Repo *repo);
167 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);
169 /* returns the string value of the attribute, or NULL if not found */
170 const char * repo_lookup_str(Solvable *s, Id key);
171 /* returns the integer value of the attribute, or 0 if not found */
172 int repo_lookup_num(Solvable *s, Id key);
173 /* generic attribute lookup */
174 int repo_lookup(Solvable *s, Id key, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata);
176 typedef struct _Dataiterator
180 unsigned char *nextkeydp;
193 dataiterator_init(&di, repo, 0, 0, "bla", SEARCH_SUBSTRING);
194 while (dataiterator_step(&di))
195 dosomething(di.solvid, di.key, di.kv); */
196 void dataiterator_init(Dataiterator *di, Repo *repo, Id p, Id keyname,
197 const char *match, int flags);
198 int dataiterator_step(Dataiterator *di);
200 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
201 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
202 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
203 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
204 void repo_internalize(Repo *repo);
206 #endif /* SATSOLVER_REPO_H */