*
*/
-#ifndef SATSOLVER_REPO_H
-#define SATSOLVER_REPO_H
+#ifndef LIBSOLV_REPO_H
+#define LIBSOLV_REPO_H
#include "pooltypes.h"
#include "pool.h"
#include "repodata.h"
+#include "hash.h"
typedef struct _Repo {
- const char *name; /* application private name pointer */
+ const char *name; /* name pointer */
Id repoid; /* our id */
void *appdata; /* application private pointer */
Id *idarraydata; /* array of metadata Ids, solvable dependencies are offsets into this array */
int idarraysize;
- Offset lastoff; /* start of last array in idarraydata */
-
- Id *rpmdbid; /* solvable side data */
Repodata *repodata; /* our stores for non-solvable related data */
unsigned nrepodata; /* number of our stores.. */
+
+ Id *rpmdbid; /* solvable side data: rpm database id */
+
+ Offset lastoff; /* start of last array in idarraydata */
+
+ Hashtable lastidhash; /* hash to speed up repo_addid_dep */
+ Hashmask lastidhash_mask;
+ int lastidhash_idarraysize;
+ int lastmarker;
+ Offset lastmarkerpos;
} Repo;
extern Repo *repo_create(Pool *pool, const char *name);
extern void repo_free(Repo *repo, int reuseids);
+extern void repo_empty(Repo *repo, int reuseids);
extern void repo_freeallrepos(Pool *pool, int reuseids);
+extern Id repo_add_solvable(Repo *repo);
+extern Id repo_add_solvable_block(Repo *repo, int count);
+extern void repo_free_solvable(Repo *repo, Id p, int reuseids);
extern void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids);
extern void *repo_sidedata_create(Repo *repo, size_t size);
extern void *repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count);
return repo->name;
}
-static inline Id repo_add_solvable(Repo *repo)
-{
- extern Id pool_add_solvable(Pool *pool);
- Id p = pool_add_solvable(repo->pool);
- if (!repo->start || repo->start == repo->end)
- repo->start = repo->end = p;
- /* warning: sidedata must be extended before adapting start/end */
- if (repo->rpmdbid)
- repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
- if (p < repo->start)
- repo->start = p;
- if (p + 1 > repo->end)
- repo->end = p + 1;
- repo->nsolvables++;
- repo->pool->solvables[p].repo = repo;
- return p;
-}
-
-static inline Id repo_add_solvable_block(Repo *repo, int count)
-{
- extern Id pool_add_solvable_block(Pool *pool, int count);
- Id p;
- Solvable *s;
- if (!count)
- return 0;
- p = pool_add_solvable_block(repo->pool, count);
- if (!repo->start || repo->start == repo->end)
- repo->start = repo->end = p;
- /* warning: sidedata must be extended before adapting start/end */
- if (repo->rpmdbid)
- repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
- if (p < repo->start)
- repo->start = p;
- if (p + count > repo->end)
- repo->end = p + count;
- repo->nsolvables += count;
- for (s = repo->pool->solvables + p; count--; s++)
- s->repo = repo;
- return p;
-}
-
-
#define FOR_REPO_SOLVABLES(r, p, s) \
for (p = (r)->start, s = (r)->pool->solvables + p; p < (r)->end; p++, s = (r)->pool->solvables + p) \
if (s->repo == (r))
static inline Repo *pool_id2repo(Pool *pool, Id repoid)
{
- return pool->repos[repoid - 1];
+ return repoid ? pool->repos[repoid - 1] : 0;
}
static inline int pool_installable(const Pool *pool, Solvable *s)
} KeyValue;
/* search matcher flags */
-#define SEARCH_STRINGMASK 15
-#define SEARCH_STRING 1
-#define SEARCH_SUBSTRING 2
-#define SEARCH_GLOB 3
-#define SEARCH_REGEX 4
-#define SEARCH_ERROR 5
+#define SEARCH_STRINGMASK 15
+#define SEARCH_STRING 1
+#define SEARCH_STRINGSTART 2
+#define SEARCH_STRINGEND 3
+#define SEARCH_SUBSTRING 4
+#define SEARCH_GLOB 5
+#define SEARCH_REGEX 6
+#define SEARCH_ERROR 15
#define SEARCH_NOCASE (1<<7)
/* iterator control */
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);
/* returns the string value of the attribute, or NULL if not found */
-const char *repo_lookup_str(Repo *repo, Id entry, Id key);
-/* returns the integer value of the attribute, or 0 if not found */
-unsigned int repo_lookup_num(Repo *repo, Id entry, Id key, unsigned int notfound);
-Id repo_lookup_id(Repo *repo, Id entry, Id keyid);
-int repo_lookup_void(Repo *repo, Id entry, Id keyid);
-const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyid, Id *typep);
+Id repo_lookup_type(Repo *repo, Id entry, Id keyname);
+const char *repo_lookup_str(Repo *repo, Id entry, Id keyname);
+/* returns the integer value of the attribute, or notfound if not found */
+unsigned int repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound);
+Id repo_lookup_id(Repo *repo, Id entry, Id keyname);
+int repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q);
+int repo_lookup_void(Repo *repo, Id entry, Id keyname);
+const char *repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep);
+const unsigned char *repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep);
typedef struct _Datamatcher {
int flags;
} Dataiterator;
-int datamatcher_init(Datamatcher *ma, const char *match, int flags);
+int datamatcher_init(Datamatcher *ma, const char *match, int flags);
void datamatcher_free(Datamatcher *ma);
-int datamatcher_match(Datamatcher *ma, const char *str);
+int datamatcher_match(Datamatcher *ma, const char *str);
/*
* Dataiterator
* keyname: if non-null, limit search to this keyname
* match: if non-null, limit search to this match
*/
-int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags);
+int dataiterator_init(Dataiterator *di, Pool *pool, Repo *repo, Id p, Id keyname, const char *match, int flags);
void dataiterator_init_clone(Dataiterator *di, Dataiterator *from);
void dataiterator_set_search(Dataiterator *di, Repo *repo, Id p);
void dataiterator_set_keyname(Dataiterator *di, Id keyname);
-int dataiterator_set_match(Dataiterator *di, const char *match, int flags);
+int dataiterator_set_match(Dataiterator *di, const char *match, int flags);
void dataiterator_prepend_keyname(Dataiterator *di, Id keyname);
void dataiterator_free(Dataiterator *di);
-int dataiterator_step(Dataiterator *di);
+int dataiterator_step(Dataiterator *di);
void dataiterator_setpos(Dataiterator *di);
void dataiterator_setpos_parent(Dataiterator *di);
-int dataiterator_match(Dataiterator *di, Datamatcher *ma);
+int dataiterator_match(Dataiterator *di, Datamatcher *ma);
void dataiterator_skip_attribute(Dataiterator *di);
void dataiterator_skip_solvable(Dataiterator *di);
void dataiterator_skip_repo(Dataiterator *di);
void repo_set_id(Repo *repo, Id p, Id keyname, Id id);
-void repo_set_num(Repo *repo, Id p, Id keyname, Id num);
+void repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num);
void repo_set_str(Repo *repo, Id p, Id keyname, const char *str);
void repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str);
void repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str);
void repo_internalize(Repo *repo);
void repo_disable_paging(Repo *repo);
-#endif /* SATSOLVER_REPO_H */
+#define FOR_REPODATAS(repo, rdid, data) \
+ for (rdid = 0, data = repo->repodata + rdid; rdid < repo->nrepodata; rdid++, data++)
+
+#endif /* LIBSOLV_REPO_H */
projects / platform / upstream / libsolv.git / blobdiff