00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013 #ifndef SATSOLVER_REPO_H
00014 #define SATSOLVER_REPO_H
00015
00016 #include "pooltypes.h"
00017 #include "pool.h"
00018 #include "repodata.h"
00019
00020
00021
00022 typedef struct _Repo {
00023 const char *name;
00024 Id repoid;
00025 void *appdata;
00026
00027 Pool *pool;
00028
00029 int start;
00030 int end;
00031 int nsolvables;
00032
00033 int disabled;
00034 int priority;
00035 int subpriority;
00036
00037 Id *idarraydata;
00038 int idarraysize;
00039 Offset lastoff;
00040
00041 Id *rpmdbid;
00042
00043 Repodata *repodata;
00044 unsigned nrepodata;
00045 } Repo;
00046
00047 extern Repo *repo_create(Pool *pool, const char *name);
00048 extern void repo_free(Repo *repo, int reuseids);
00049 extern void repo_empty(Repo *repo, int reuseids);
00050 extern void repo_freeallrepos(Pool *pool, int reuseids);
00051 extern void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids);
00052 extern void *repo_sidedata_create(Repo *repo, size_t size);
00053 extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
00054
00055 extern Offset repo_addid(Repo *repo, Offset olddeps, Id id);
00056 extern Offset repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker);
00057 extern Offset repo_reserve_ids(Repo *repo, Offset olddeps, int num);
00058 extern Offset repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens);
00059 extern Offset repo_fix_conflicts(Repo *repo, Offset conflicts);
00060
00061 static inline const char *repo_name(const Repo *repo)
00062 {
00063 return repo->name;
00064 }
00065
00066 static inline Id repo_add_solvable(Repo *repo)
00067 {
00068 extern Id pool_add_solvable(Pool *pool);
00069 Id p = pool_add_solvable(repo->pool);
00070 if (!repo->start || repo->start == repo->end)
00071 repo->start = repo->end = p;
00072
00073 if (repo->rpmdbid)
00074 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
00075 if (p < repo->start)
00076 repo->start = p;
00077 if (p + 1 > repo->end)
00078 repo->end = p + 1;
00079 repo->nsolvables++;
00080 repo->pool->solvables[p].repo = repo;
00081 return p;
00082 }
00083
00084 static inline Id repo_add_solvable_block(Repo *repo, int count)
00085 {
00086 extern Id pool_add_solvable_block(Pool *pool, int count);
00087 Id p;
00088 Solvable *s;
00089 if (!count)
00090 return 0;
00091 p = pool_add_solvable_block(repo->pool, count);
00092 if (!repo->start || repo->start == repo->end)
00093 repo->start = repo->end = p;
00094
00095 if (repo->rpmdbid)
00096 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
00097 if (p < repo->start)
00098 repo->start = p;
00099 if (p + count > repo->end)
00100 repo->end = p + count;
00101 repo->nsolvables += count;
00102 for (s = repo->pool->solvables + p; count--; s++)
00103 s->repo = repo;
00104 return p;
00105 }
00106
00107
00108 #define FOR_REPO_SOLVABLES(r, p, s) \
00109 for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
00110 if (s->repo == (r))
00111
00112
00113
00114
00115 static inline Repo *pool_id2repo(Pool *pool, Id repoid)
00116 {
00117 return repoid ? pool->repos[repoid - 1] : 0;
00118 }
00119
00120 static inline int pool_installable(const Pool *pool, Solvable *s)
00121 {
00122 if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
00123 return 0;
00124 if (s->repo && s->repo->disabled)
00125 return 0;
00126 if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
00127 return 0;
00128 if (pool->considered)
00129 {
00130 Id id = s - pool->solvables;
00131 if (!MAPTST(pool->considered, id))
00132 return 0;
00133 }
00134 return 1;
00135 }
00136
00137
00138
00139 #define SEARCH_NEXT_KEY 1
00140 #define SEARCH_NEXT_SOLVABLE 2
00141 #define SEARCH_STOP 3
00142 #define SEARCH_ENTERSUB -1
00143
00144 typedef struct _KeyValue {
00145 Id id;
00146 const char *str;
00147 int num;
00148 int num2;
00149
00150 int entry;
00151 int eof;
00152
00153 struct _KeyValue *parent;
00154 } KeyValue;
00155
00156
00157 #define SEARCH_STRINGMASK 15
00158 #define SEARCH_STRING 1
00159 #define SEARCH_STRINGSTART 2
00160 #define SEARCH_STRINGEND 3
00161 #define SEARCH_SUBSTRING 4
00162 #define SEARCH_GLOB 5
00163 #define SEARCH_REGEX 6
00164 #define SEARCH_ERROR 15
00165 #define SEARCH_NOCASE (1<<7)
00166
00167
00168 #define SEARCH_NO_STORAGE_SOLVABLE (1<<8)
00169 #define SEARCH_SUB (1<<9)
00170 #define SEARCH_ARRAYSENTINEL (1<<10)
00171 #define SEARCH_DISABLED_REPOS (1<<11)
00172 #define SEARCH_COMPLETE_FILELIST (1<<12)
00173
00174
00175 #define SEARCH_SKIP_KIND (1<<16)
00176
00177
00178
00179 #define SEARCH_FILES (1<<17)
00180 #define SEARCH_CHECKSUMS (1<<18)
00181
00182
00183 #define SEARCH_THISSOLVID (1<<31)
00184
00185
00186
00187 #define REPO_REUSE_REPODATA (1 << 0)
00188 #define REPO_NO_INTERNALIZE (1 << 1)
00189 #define REPO_LOCALPOOL (1 << 2)
00190 #define REPO_USE_LOADING (1 << 3)
00191 #define REPO_EXTEND_SOLVABLES (1 << 4)
00192
00193 Repodata *repo_add_repodata(Repo *repo, int flags);
00194 Repodata *repo_last_repodata(Repo *repo);
00195
00196 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);
00197
00198
00199 const char *repo_lookup_str(Repo *repo, Id entry, Id key);
00200
00201 unsigned int repo_lookup_num(Repo *repo, Id entry, Id key, unsigned int notfound);
00202 Id repo_lookup_id(Repo *repo, Id entry, Id keyid);
00203 int repo_lookup_void(Repo *repo, Id entry, Id keyid);
00204 const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyid, Id *typep);
00205
00206 typedef struct _Datamatcher {
00207 int flags;
00208 const char *match;
00209 void *matchdata;
00210 int error;
00211 } Datamatcher;
00212
00213 typedef struct _Dataiterator
00214 {
00215 int state;
00216 int flags;
00217
00218 Pool *pool;
00219 Repo *repo;
00220 Repodata *data;
00221
00222
00223 unsigned char *dp;
00224 unsigned char *ddp;
00225 Id *idp;
00226 Id *keyp;
00227
00228
00229 Repokey *key;
00230 KeyValue kv;
00231
00232
00233 Datamatcher matcher;
00234
00235
00236 Id keyname;
00237 Id repodataid;
00238 Id solvid;
00239 Id repoid;
00240
00241 Id keynames[3 + 1];
00242 int nkeynames;
00243 int rootlevel;
00244
00245
00246 struct di_parent {
00247 KeyValue kv;
00248 unsigned char *dp;
00249 Id *keyp;
00250 } parents[3];
00251 int nparents;
00252
00253 } Dataiterator;
00254
00255 int datamatcher_init(Datamatcher *ma, const char *match, int flags);
00256 void datamatcher_free(Datamatcher *ma);
00257 int datamatcher_match(Datamatcher *ma, const char *str);
00258
00259
00260
00261
00262
00263
00264
00265
00266
00267
00268
00269
00270
00271
00272
00273
00274
00275
00276
00277
00278
00279
00280
00281
00282
00283
00284
00285 int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags);
00286 void dataiterator_init_clone(Dataiterator *di, Dataiterator *from);
00287 void dataiterator_set_search(Dataiterator *di, Repo *repo, Id p);
00288 void dataiterator_set_keyname(Dataiterator *di, Id keyname);
00289 int dataiterator_set_match(Dataiterator *di, const char *match, int flags);
00290
00291 void dataiterator_prepend_keyname(Dataiterator *di, Id keyname);
00292 void dataiterator_free(Dataiterator *di);
00293 int dataiterator_step(Dataiterator *di);
00294 void dataiterator_setpos(Dataiterator *di);
00295 void dataiterator_setpos_parent(Dataiterator *di);
00296 int dataiterator_match(Dataiterator *di, Datamatcher *ma);
00297 void dataiterator_skip_attribute(Dataiterator *di);
00298 void dataiterator_skip_solvable(Dataiterator *di);
00299 void dataiterator_skip_repo(Dataiterator *di);
00300 void dataiterator_jump_to_solvid(Dataiterator *di, Id solvid);
00301 void dataiterator_jump_to_repo(Dataiterator *di, Repo *repo);
00302 void dataiterator_entersub(Dataiterator *di);
00303 void dataiterator_clonepos(Dataiterator *di, Dataiterator *from);
00304 void dataiterator_seek(Dataiterator *di, int whence);
00305
00306 #define DI_SEEK_STAY (1 << 16)
00307 #define DI_SEEK_CHILD 1
00308 #define DI_SEEK_PARENT 2
00309 #define DI_SEEK_REWIND 3
00310
00311
00312 void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
00313 void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
00314 void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
00315 void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
00316 void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
00317 void repo_internalize(Repo *repo);
00318 void repo_disable_paging(Repo *repo);
00319
00320 #endif