*
*/
+#define _GNU_SOURCE
+#include <string.h>
+#include <fnmatch.h>
+
#include <stdio.h>
#include <stdlib.h>
-#include <string.h>
+
+
#include "repo.h"
#include "pool.h"
#include "poolid_private.h"
#include "util.h"
-#include "attr_store_p.h"
+#include "chksum.h"
#define IDARRAY_BLOCK 4095
repo = (Repo *)sat_calloc(1, sizeof(*repo));
pool->repos = (Repo **)sat_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
pool->repos[pool->nrepos++] = repo;
+ repo->repoid = pool->nrepos;
repo->name = name ? strdup(name) : 0;
repo->pool = pool;
repo->start = pool->nsolvables;
static void
repo_freedata(Repo *repo)
{
+ int i;
+ for (i = 0; i < repo->nrepodata; i++)
+ repodata_freedata(repo->repodata + i);
+ sat_free(repo->repodata);
sat_free(repo->idarraydata);
sat_free(repo->rpmdbid);
sat_free((char *)repo->name);
sat_free(repo);
}
+/* delete all solvables and repodata blocks from this repo */
+
+void
+repo_empty(Repo *repo, int reuseids)
+{
+ Pool *pool = repo->pool;
+ Solvable *s;
+ int i;
+
+ pool_freewhatprovides(pool);
+ if (reuseids && repo->end == pool->nsolvables)
+ {
+ /* it's ok to reuse the ids. As this is the last repo, we can
+ just shrink the solvable array */
+ for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
+ if (s->repo != repo)
+ break;
+ pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
+ }
+ /* zero out (i.e. free) solvables belonging to this repo */
+ for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
+ if (s->repo == repo)
+ memset(s, 0, sizeof(*s));
+ repo->nsolvables = 0;
+
+ /* free all data belonging to this repo */
+ repo->idarraydata = sat_free(repo->idarraydata);
+ repo->idarraysize = 0;
+ repo->lastoff = 0;
+ repo->rpmdbid = sat_free(repo->rpmdbid);
+ for (i = 0; i < repo->nrepodata; i++)
+ repodata_freedata(repo->repodata + i);
+ sat_free(repo->repodata);
+ repo->repodata = 0;
+ repo->nrepodata = 0;
+}
+
/*
- * add Id to repo
- * olddeps = old array to extend
+ * remove repo from pool, delete solvables
*
*/
+void
+repo_free(Repo *repo, int reuseids)
+{
+ Pool *pool = repo->pool;
+ int i;
+
+ if (repo == pool->installed)
+ pool->installed = 0;
+ repo_empty(repo, reuseids);
+ for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
+ if (pool->repos[i] == repo)
+ break;
+ if (i == pool->nrepos) /* repo not in pool, return */
+ return;
+ if (i < pool->nrepos - 1)
+ {
+ memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
+ /* fix repo ids */
+ for (; i < pool->nrepos - 1; i++)
+ pool->repos[i]->repoid = i + 1;
+ }
+ pool->nrepos--;
+ repo_freedata(repo);
+}
+
+void
+repo_freeallrepos(Pool *pool, int reuseids)
+{
+ int i;
+
+ pool_freewhatprovides(pool);
+ for (i = 0; i < pool->nrepos; i++)
+ repo_freedata(pool->repos[i]);
+ pool->repos = sat_free(pool->repos);
+ pool->nrepos = 0;
+ /* the first two solvables don't belong to a repo */
+ pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
+}
+
+void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
+{
+ Solvable *s;
+ Repodata *data;
+ int i;
+ if (start + count == repo->end)
+ repo->end -= count;
+ repo->nsolvables -= count;
+ for (s = repo->pool->solvables + start, i = count; i--; s++)
+ s->repo = 0;
+ pool_free_solvable_block(repo->pool, start, count, reuseids);
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ if (data->end > repo->end)
+ repodata_shrink(data, repo->end);
+}
+
+
+/* repository sidedata is solvable data allocated on demand.
+ * It is used for data that is normally not present
+ * in the solvable like the rpmdbid.
+ * The solvable allocation funcions need to make sure that
+ * the sidedata gets extended if new solvables get added.
+ */
+
+#define REPO_SIDEDATA_BLOCK 63
+
+void *
+repo_sidedata_create(Repo *repo, size_t size)
+{
+ return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
+}
+
+void *
+repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
+{
+ int n = repo->end - repo->start;
+ if (p < repo->start)
+ {
+ int d = repo->start - p;
+ b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
+ memmove((char *)b + d * size, b, n * size);
+ memset(b, 0, d * size);
+ n += d;
+ }
+ if (p + count > repo->end)
+ {
+ int d = p + count - repo->end;
+ b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
+ memset((char *)b + n * size, 0, d * size);
+ }
+ return b;
+}
+
+/*
+ * add Id to idarraydata used to store dependencies
+ * olddeps: old array offset to extend
+ * returns new array offset
+ */
+
Offset
repo_addid(Repo *repo, Offset olddeps, Id id)
{
if (!idarray) /* alloc idarray if not done yet */
{
- idarray = sat_malloc2(1 + IDARRAY_BLOCK, sizeof(Id));
- idarray[0] = 0;
idarraysize = 1;
+ idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
+ idarray[0] = 0;
repo->lastoff = 0;
}
if (!olddeps) /* no deps yet */
{
olddeps = idarraysize;
- if ((idarraysize & IDARRAY_BLOCK) == 0)
- idarray = sat_realloc2(idarray, idarraysize + 1 + IDARRAY_BLOCK, sizeof(Id));
+ idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
}
else if (olddeps == repo->lastoff) /* extend at end */
idarraysize--;
olddeps = idarraysize;
for (; idarray[i]; i++)
{
- if ((idarraysize & IDARRAY_BLOCK) == 0)
- idarray = sat_realloc2(idarray, idarraysize + 1 + IDARRAY_BLOCK, sizeof(Id));
+ idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
idarray[idarraysize++] = idarray[i];
}
- if ((idarraysize & IDARRAY_BLOCK) == 0)
- idarray = sat_realloc2(idarray, idarraysize + 1 + IDARRAY_BLOCK, sizeof(Id));
+ idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
}
idarray[idarraysize++] = id; /* insert Id into array */
-
- if ((idarraysize & IDARRAY_BLOCK) == 0) /* realloc if at block boundary */
- idarray = sat_realloc2(idarray, idarraysize + 1 + IDARRAY_BLOCK, sizeof(Id));
-
+ idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
idarray[idarraysize++] = 0; /* ensure NULL termination */
repo->idarraydata = idarray;
* marker= 0 for normal dep
* marker > 0 add dep after marker
* marker < 0 add dep after -marker
- *
+ * returns new start of dependency array
*/
Offset
repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
/*
* reserve Ids
* make space for 'num' more dependencies
+ * returns new start of dependency array
+ *
+ * reserved ids will always begin at offset idarraysize
*/
Offset
if (!repo->idarraysize) /* ensure buffer space */
{
repo->idarraysize = 1;
- repo->idarraydata = sat_malloc2((1 + num + IDARRAY_BLOCK) & ~IDARRAY_BLOCK, sizeof(Id));
+ repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
repo->idarraydata[0] = 0;
repo->lastoff = 1;
return 1;
;
count = idend - idstart - 1 + num; /* new size */
- /* realloc if crossing block boundary */
- if (((repo->idarraysize - 1) | IDARRAY_BLOCK) != ((repo->idarraysize + count - 1) | IDARRAY_BLOCK))
- repo->idarraydata = sat_realloc2(repo->idarraydata, (repo->idarraysize + count + IDARRAY_BLOCK) & ~IDARRAY_BLOCK, sizeof(Id));
-
+ repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
/* move old deps to end */
olddeps = repo->lastoff = repo->idarraysize;
memcpy(repo->idarraydata + olddeps, idstart, count - num);
if (olddeps) /* appending */
repo->idarraysize--;
- /* realloc if crossing block boundary */
- if (((repo->idarraysize - 1) | IDARRAY_BLOCK) != ((repo->idarraysize + num - 1) | IDARRAY_BLOCK))
- repo->idarraydata = sat_realloc2(repo->idarraydata, (repo->idarraysize + num + IDARRAY_BLOCK) & ~IDARRAY_BLOCK, sizeof(Id));
+ /* make room*/
+ repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
/* appending or new */
repo->lastoff = olddeps ? olddeps : repo->idarraysize;
}
-/*
- * remove repo from pool, zero out solvables
- *
- */
-
-void
-repo_free(Repo *repo, int reuseids)
-{
- Pool *pool = repo->pool;
- Solvable *s;
- int i;
-
- pool_freewhatprovides(pool);
-
- if (reuseids && repo->end == pool->nsolvables)
- {
- /* it's ok to reuse the ids. As this is the last repo, we can
- just shrink the solvable array */
- for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
- if (s->repo != repo)
- break;
- repo->end = i + 1;
- pool->nsolvables = i + 1;
- }
- /* zero out solvables belonging to this repo */
- for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
- if (s->repo == repo)
- memset(s, 0, sizeof(*s));
- for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
- if (pool->repos[i] == repo)
- break;
- if (i == pool->nrepos) /* repo not in pool, return */
- return;
- if (i < pool->nrepos - 1)
- memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
- pool->nrepos--;
- repo_freedata(repo);
-}
-
-void
-repo_freeallrepos(Pool *pool, int reuseids)
-{
- int i;
-
- pool_freewhatprovides(pool);
- for (i = 0; i < pool->nrepos; i++)
- repo_freedata(pool->repos[i]);
- pool->repos = sat_free(pool->repos);
- pool->nrepos = 0;
- /* the first two solvables don't belong to a repo */
- pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
-}
Offset
-repo_fix_legacy(Repo *repo, Offset provides, Offset supplements)
+repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
{
Pool *pool = repo->pool;
- Id id, idp, idl, idns;
+ Id id, idp, idl;
char buf[1024], *p, *dep;
- int i;
+ int i, l;
if (provides)
{
dep = p + 1;
continue;
}
- strncpy(dep - 9, "language:", 9);
*p++ = 0;
+#if 0
+ strncpy(dep - 9, "language:", 9);
idl = str2id(pool, dep - 9, 1);
+#else
+ idl = str2id(pool, dep, 1);
+ idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
+#endif
if (id)
id = rel2id(pool, id, idl, REL_OR, 1);
else
for (p = dep; *p && *p != ')'; p++)
;
*p = 0;
+#if 0
strncpy(dep - 9, "language:", 9);
idl = str2id(pool, dep - 9, 1);
+#else
+ idl = str2id(pool, dep, 1);
+ idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
+#endif
if (id)
id = rel2id(pool, id, idl, REL_OR, 1);
else
p = buf + (p - dep);
*p++ = 0;
idp = str2id(pool, buf, 1);
- idns = str2id(pool, "namespace:installed", 1);
+ /* strip trailing slashes */
+ l = strlen(p);
+ while (l > 1 && p[l - 1] == '/')
+ p[--l] = 0;
id = str2id(pool, p, 1);
- id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
- id = rel2id(pool, idp, id, REL_AND, 1);
+ id = rel2id(pool, idp, id, REL_WITH, 1);
+ id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
supplements = repo_addid_dep(repo, supplements, id, 0);
}
}
}
- if (!supplements)
- return 0;
- for (i = supplements; repo->idarraydata[i]; i++)
+ if (supplements)
{
- id = repo->idarraydata[i];
- if (ISRELDEP(id))
- continue;
- dep = (char *)id2str(pool, id);
- if (!strncmp(dep, "system:modalias(", 16))
- dep += 7;
- if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
+ for (i = supplements; repo->idarraydata[i]; i++)
{
- strcpy(buf, dep);
- p = strchr(buf + 9, ':');
- idns = str2id(pool, "namespace:modalias", 1);
- if (p && p != buf + 9 && strchr(p + 1, ':'))
+ id = repo->idarraydata[i];
+ if (ISRELDEP(id))
+ continue;
+ dep = (char *)id2str(pool, id);
+ if (!strncmp(dep, "system:modalias(", 16))
+ dep += 7;
+ if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
{
- *p++ = 0;
- idp = str2id(pool, buf + 9, 1);
- p[strlen(p) - 1] = 0;
- id = str2id(pool, p, 1);
- id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
- id = rel2id(pool, idp, id, REL_AND, 1);
+ strcpy(buf, dep);
+ p = strchr(buf + 9, ':');
+ if (p && p != buf + 9 && strchr(p + 1, ':'))
+ {
+ *p++ = 0;
+ idp = str2id(pool, buf + 9, 1);
+ p[strlen(p) - 1] = 0;
+ id = str2id(pool, p, 1);
+ id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
+ id = rel2id(pool, idp, id, REL_AND, 1);
+ }
+ else
+ {
+ p = buf + 9;
+ p[strlen(p) - 1] = 0;
+ id = str2id(pool, p, 1);
+ id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
+ }
+ if (id)
+ repo->idarraydata[i] = id;
}
- else
+ else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
{
- p = buf + 9;
- p[strlen(p) - 1] = 0;
- id = str2id(pool, p, 1);
- id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
- }
- if (id)
- repo->idarraydata[i] = id;
- }
- else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
- {
- strcpy(buf, dep);
- id = 0;
- dep = buf + 11;
- while ((p = strchr(dep, ':')) != 0)
- {
- if (p == dep)
+ strcpy(buf, dep);
+ id = 0;
+ dep = buf + 11;
+ while ((p = strchr(dep, ':')) != 0)
{
- dep = p + 1;
- continue;
+ if (p == dep)
+ {
+ dep = p + 1;
+ continue;
+ }
+ *p++ = 0;
+ idp = str2id(pool, dep, 1);
+ if (id)
+ id = rel2id(pool, id, idp, REL_AND, 1);
+ else
+ id = idp;
+ dep = p;
+ }
+ if (dep[0] && dep[1])
+ {
+ dep[strlen(dep) - 1] = 0;
+ idp = str2id(pool, dep, 1);
+ if (id)
+ id = rel2id(pool, id, idp, REL_AND, 1);
+ else
+ id = idp;
}
- *p++ = 0;
- idp = str2id(pool, dep, 1);
if (id)
- id = rel2id(pool, id, idp, REL_AND, 1);
- else
- id = idp;
- dep = p;
+ repo->idarraydata[i] = id;
}
- if (dep[0] && dep[1])
+ else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
{
- dep[strlen(dep) - 1] = 0;
- idp = str2id(pool, dep, 1);
- if (id)
- id = rel2id(pool, id, idp, REL_AND, 1);
- else
- id = idp;
+ strcpy(buf, dep + 11);
+ if ((p = strrchr(buf, ')')) != 0)
+ *p = 0;
+ id = str2id(pool, buf, 1);
+ id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
+ repo->idarraydata[i] = id;
}
- if (id)
- repo->idarraydata[i] = id;
- }
- }
- return supplements;
-}
-
-static unsigned char *
-data_read_id(unsigned char *dp, Id *idp)
-{
- Id x = 0;
- unsigned char c;
- for (;;)
- {
- c = *dp++;
- if (!(c & 0x80))
- {
- *idp = (x << 7) ^ c;
- return dp;
}
- x = (x << 7) ^ c ^ 128;
}
-}
-
-static unsigned char *
-data_skip(unsigned char *dp, int type)
-{
- switch (type)
+ if (freshens && repo->idarraydata[freshens])
{
- case TYPE_VOID:
- return dp;
- case TYPE_ID:
- while ((*dp & 0x80) != 0)
- dp++;
- return dp;
- case TYPE_IDARRAY:
- case TYPE_REL_IDARRAY:
- case TYPE_IDVALUEARRAY:
- case TYPE_IDVALUEVALUEARRAY:
- while ((*dp & 0xc0) != 0)
- dp++;
- return dp;
- default:
- fprintf(stderr, "unknown type in data_skip\n");
- exit(1);
+ Id idsupp = 0, idfresh = 0;
+ if (!supplements)
+ return freshens;
+ for (i = supplements; repo->idarraydata[i]; i++)
+ {
+ if (!idsupp)
+ idsupp = repo->idarraydata[i];
+ else
+ idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
+ }
+ for (i = freshens; repo->idarraydata[i]; i++)
+ {
+ if (!idfresh)
+ idfresh = repo->idarraydata[i];
+ else
+ idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
+ }
+ if (!idsupp)
+ idsupp = idfresh;
+ else
+ idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
+ supplements = repo_addid_dep(repo, 0, idsupp, 0);
}
+ return supplements;
}
-static unsigned char *
-forward_to_key(Repodata *data, Id key, Id schema, unsigned char *dp)
+Offset
+repo_fix_conflicts(Repo *repo, Offset conflicts)
{
- Id k, *keyp;
+ char buf[1024], *p, *dep;
+ Pool *pool = repo->pool;
+ Id id;
+ int i;
- keyp = data->schemadata + schema;
- while ((k = *keyp++) != 0)
+ if (!conflicts)
+ return conflicts;
+ for (i = conflicts; repo->idarraydata[i]; i++)
{
- if (k == key)
- return dp;
- if (data->keys[k].storage == KEY_STORAGE_VERTICAL_OFFSET)
- {
- /* skip that offset */
- dp = data_skip(dp, TYPE_ID);
- continue;
- }
- if (data->keys[k].storage != KEY_STORAGE_INCORE)
+ id = repo->idarraydata[i];
+ if (ISRELDEP(id))
continue;
- dp = data_skip(dp, data->keys[k].type);
- }
- return 0;
-}
-
-static unsigned char *
-load_page_range(Repodata *data, unsigned int pstart, unsigned int pend)
-{
- /* add smart paging here */
- return 0;
-}
-
-static unsigned char *
-get_data(Repodata *data, Repokey *key, unsigned char **dpp)
-{
- Id off;
- unsigned char *dp = *dpp;
- int i, max;
- unsigned int pstart, pend, poff, plen;
-
- if (!dp)
- return 0;
- if (key->storage == KEY_STORAGE_INCORE)
- {
- *dpp = data_skip(dp, key->type);
- return dp;
- }
- if (key->storage != KEY_STORAGE_VERTICAL_OFFSET)
- return 0;
- if (!data->fp)
- return 0;
- dp = data_read_id(dp, &off);
- *dpp = dp;
- if (key->type == TYPE_VOID)
- return 0;
- max = key->size - off;
- if (max <= 0)
- return 0;
- /* we now have the offset, go into vertical */
- for (i = key - data->keys - 1; i > 0; i--)
- if (data->keys[i].storage == KEY_STORAGE_VERTICAL_OFFSET)
- off += data->keys[i].size;
- pstart = off / BLOB_PAGESIZE;
- pend = pstart;
- poff = off % BLOB_PAGESIZE;
- plen = BLOB_PAGESIZE - poff;
- for (;;)
- {
- if (plen > max)
- plen = max;
- dp = load_page_range(data, pstart, pend) + poff;
- if (!dp)
- return 0;
- switch (key->type)
+ dep = (char *)id2str(pool, id);
+ if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
{
- case TYPE_STR:
- if (memchr(dp, 0, plen))
- return dp;
- break;
- case TYPE_ID:
- for (i = 0; i < plen; i++)
- if ((dp[i] & 0x80) == 0)
- return dp;
- break;
- case TYPE_IDARRAY:
- case TYPE_REL_IDARRAY:
- case TYPE_IDVALUEARRAY:
- case TYPE_IDVALUEVALUEARRAY:
- for (i = 0; i < plen; i++)
- if ((dp[i] & 0xc0) == 0)
- return dp;
- break;
+ strcpy(buf, dep + 15);
+ if ((p = strchr(buf, ')')) != 0)
+ *p = 0;
+ id = str2id(pool, buf, 1);
+ id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
+ repo->idarraydata[i] = id;
}
- if (plen == max)
- return 0;
- pend++;
- plen += BLOB_PAGESIZE;
}
+ return conflicts;
}
-
-const char *
-repodata_lookup_str(Repodata *data, Id entry, Id key)
-{
- Id schema;
- Id id, k, *kp, *keyp;
- unsigned char *dp;
-
- if (data->entryschemau8)
- schema = data->entryschemau8[entry];
- else
- schema = data->entryschema[entry];
- keyp = data->schemadata + schema;
- /* make sure the schema of this solvable contains the key */
- for (kp = keyp; (k = *kp++) != 0; )
- if (k == key)
- break;
- if (k == 0)
- return 0;
- dp = forward_to_key(data, key, schema, data->incoredata + data->incoreoffset[entry]);
- dp = get_data(data, data->keys + key, &dp);
- if (!dp)
- return 0;
- if (data->keys[key].type == TYPE_STR)
- return (const char *)dp;
- /* id type, must either use global or local string strore*/
- dp = data_read_id(dp, &id);
-#if 0
- /* not yet working */
- return data->ss.stringspace + data->ss.strings[id];
-#else
- return id2str(data->repo->pool, id);
-#endif
-}
-
-#define SEARCH_NEXT_KEY 1
-#define SEARCH_NEXT_SOLVABLE 2
-#define SEACH_STOP 3
-
struct matchdata
{
Pool *pool;
- const char *matchstr;
int flags;
-#if 0
- regex_t regex;
-#endif
+ Datamatcher matcher;
int stop;
- int (*callback)(void *data, Solvable *s, Id key, const char *str);
+ int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
void *callback_data;
};
-static void
-domatch(Id p, Id key, struct matchdata *md, const char *str)
+int
+repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
{
- /* fill match code here */
- md->stop = md->callback(md->callback_data, md->pool->solvables + p, key, str);
-}
+ struct matchdata *md = cbdata;
-static void
-repodata_search(Repodata *data, Id entry, Id key, struct matchdata *md)
-{
- Id schema;
- Id id, k, *kp, *keyp;
- unsigned char *dp, *ddp;
- int onekey = 0;
-
- if (data->entryschemau8)
- schema = data->entryschemau8[entry];
- else
- schema = data->entryschema[entry];
- keyp = data->schemadata + schema;
- dp = data->incoredata + data->incoreoffset[entry];
- if (key)
- {
- /* search in a specific key */
- for (kp = keyp; (k = *kp++) != 0; )
- if (k == key)
- break;
- if (k == 0)
- return;
- dp = forward_to_key(data, key, schema, dp);
- if (!dp)
- return;
- keyp = kp - 1;
- onekey = 1;
- }
- md->stop = 0;
- while ((key = *keyp++) != 0)
+ if (md->matcher.match)
{
- ddp = get_data(data, data->keys + key, &dp);
- while (ddp)
- {
- switch (data->keys[key].type)
- {
- case TYPE_STR:
- domatch(data->start + entry, data->keys[key].name, md, (const char *)ddp);
- ddp = 0;
- break;
- case TYPE_ID:
- data_read_id(ddp, &id);
- /* domatch */
- ddp = 0;
- break;
- case TYPE_IDARRAY:
- ddp = data_read_id(ddp, &id);
- if ((id & 0x40) == 0)
- ddp = 0;
- id = (id & 0x3f) | ((id >> 1) & ~0x3f);
- /* domatch */
- while (md->stop == SEARCH_NEXT_KEY && ddp)
- ddp = data_read_id(ddp, &id);
- break;
- default:
- ddp = 0;
- }
- }
- if (onekey || md->stop > SEARCH_NEXT_KEY)
- return;
+ if (!repodata_stringify(md->pool, data, key, kv, md->flags))
+ return 0;
+ if (!datamatcher_match(&md->matcher, kv->str))
+ return 0;
}
+ md->stop = md->callback(md->callback_data, s, data, key, kv);
+ return md->stop;
}
+
+static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
+ { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
+ { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
+};
+
static void
-domatch_idarray(Id p, Id key, struct matchdata *md, Id *ida)
+domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
{
+ KeyValue kv;
+ kv.entry = 0;
+ kv.parent = 0;
for (; *ida && !md->stop; ida++)
- domatch(p, key, md, id2str(md->pool, *ida));
+ {
+ kv.id = *ida;
+ kv.eof = ida[1] ? 0 : 1;
+ repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
+ kv.entry++;
+ }
}
static void
-repo_search_md(Repo *repo, Id p, Id key, struct matchdata *md)
+repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
{
+ KeyValue kv;
Pool *pool = repo->pool;
Repodata *data;
+ int i, j, flags;
Solvable *s;
- int i;
+ kv.parent = 0;
md->stop = 0;
if (!p)
{
for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
{
if (s->repo == repo)
- repo_search_md(repo, p, key, md);
+ repo_search_md(repo, p, keyname, md);
if (md->stop > SEARCH_NEXT_SOLVABLE)
break;
}
return;
}
- s = pool->solvables + p;
- switch(key)
+ else if (p < 0)
+ /* The callback only supports solvables, so we can't iterate over the
+ extra things. */
+ return;
+ flags = md->flags;
+ if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
{
- case 0:
- case SOLVABLE_NAME:
- if (s->name)
- domatch(p, SOLVABLE_NAME, md, id2str(pool, s->name));
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_ARCH:
- if (s->arch)
- domatch(p, SOLVABLE_ARCH, md, id2str(pool, s->arch));
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_EVR:
- if (s->evr)
- domatch(p, SOLVABLE_EVR, md, id2str(pool, s->evr));
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_VENDOR:
- if (s->vendor)
- domatch(p, SOLVABLE_VENDOR, md, id2str(pool, s->vendor));
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_PROVIDES:
- if (s->provides)
- domatch_idarray(p, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_OBSOLETES:
- if (s->obsoletes)
- domatch_idarray(p, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_CONFLICTS:
- if (s->obsoletes)
- domatch_idarray(p, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_REQUIRES:
- if (s->requires)
- domatch_idarray(p, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_RECOMMENDS:
- if (s->recommends)
- domatch_idarray(p, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_SUPPLEMENTS:
- if (s->supplements)
- domatch_idarray(p, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_SUGGESTS:
- if (s->suggests)
- domatch_idarray(p, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_ENHANCES:
- if (s->enhances)
- domatch_idarray(p, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- case SOLVABLE_FRESHENS:
- if (s->freshens)
- domatch_idarray(p, SOLVABLE_FRESHENS, md, repo->idarraydata + s->freshens);
- if (key || md->stop > SEARCH_NEXT_KEY)
- return;
- default:
- break;
+ s = pool->solvables + p;
+ switch(keyname)
+ {
+ case 0:
+ case SOLVABLE_NAME:
+ if (s->name)
+ {
+ kv.id = s->name;
+ repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
+ }
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_ARCH:
+ if (s->arch)
+ {
+ kv.id = s->arch;
+ repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
+ }
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_EVR:
+ if (s->evr)
+ {
+ kv.id = s->evr;
+ repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
+ }
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_VENDOR:
+ if (s->vendor)
+ {
+ kv.id = s->vendor;
+ repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
+ }
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_PROVIDES:
+ if (s->provides)
+ domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_OBSOLETES:
+ if (s->obsoletes)
+ domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_CONFLICTS:
+ if (s->conflicts)
+ domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_REQUIRES:
+ if (s->requires)
+ domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_RECOMMENDS:
+ if (s->recommends)
+ domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_SUPPLEMENTS:
+ if (s->supplements)
+ domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_SUGGESTS:
+ if (s->suggests)
+ domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case SOLVABLE_ENHANCES:
+ if (s->enhances)
+ domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ case RPM_RPMDBID:
+ if (repo->rpmdbid)
+ {
+ kv.num = repo->rpmdbid[p - repo->start];
+ repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
+ }
+ if (keyname || md->stop > SEARCH_NEXT_KEY)
+ return;
+ break;
+ default:
+ break;
+ }
}
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
if (p < data->start || p >= data->end)
continue;
- repodata_search(data, p - data->start, key, md);
+ if (keyname && !repodata_precheck_keyname(data, keyname))
+ continue;
+ if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
+ {
+ /* do not search filelist extensions */
+ if (data->state != REPODATA_AVAILABLE)
+ continue;
+ for (j = 1; j < data->nkeys; j++)
+ if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
+ break;
+ if (j == data->nkeys)
+ continue;
+ }
+ if (data->state == REPODATA_STUB)
+ {
+ if (keyname)
+ {
+ for (j = 1; j < data->nkeys; j++)
+ if (keyname == data->keys[j].name)
+ break;
+ if (j == data->nkeys)
+ continue;
+ }
+ /* load it */
+ if (data->loadcallback)
+ data->loadcallback(data);
+ else
+ data->state = REPODATA_ERROR;
+ }
+ if (data->state == REPODATA_ERROR)
+ continue;
+ repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
if (md->stop > SEARCH_NEXT_KEY)
break;
}
}
void
-repo_search(Repo *repo, Id p, Id key, const char *match, int flags, int (*callback)(void *data, Solvable *s, Id key, const char *str), void *callback_data)
+repo_search(Repo *repo, Id p, Id keyname, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
{
struct matchdata md;
+ if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
+ return;
memset(&md, 0, sizeof(md));
md.pool = repo->pool;
- md.matchstr = match;
md.flags = flags;
md.callback = callback;
- md.callback_data = callback_data;
- repo_search_md(repo, p, key, &md);
+ md.callback_data = cbdata;
+ if (match)
+ datamatcher_init(&md.matcher, match, flags);
+ repo_search_md(repo, p, keyname, &md);
+ if (match)
+ datamatcher_free(&md.matcher);
}
const char *
-repo_lookup_str(Solvable *s, Id key)
+repo_lookup_str(Repo *repo, Id entry, Id keyname)
{
- Repo *repo = s->repo;
Pool *pool = repo->pool;
Repodata *data;
- int i, j, n;
+ int i;
+ const char *str;
- switch(key)
+ if (entry >= 0)
{
- case SOLVABLE_NAME:
- return id2str(pool, s->name);
- case SOLVABLE_ARCH:
- return id2str(pool, s->arch);
- case SOLVABLE_EVR:
- return id2str(pool, s->evr);
- case SOLVABLE_VENDOR:
- return id2str(pool, s->vendor);
+ switch (keyname)
+ {
+ case SOLVABLE_NAME:
+ return id2str(pool, pool->solvables[entry].name);
+ case SOLVABLE_ARCH:
+ return id2str(pool, pool->solvables[entry].arch);
+ case SOLVABLE_EVR:
+ return id2str(pool, pool->solvables[entry].evr);
+ case SOLVABLE_VENDOR:
+ return id2str(pool, pool->solvables[entry].vendor);
+ }
}
- n = s - pool->solvables;
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (n < data->start || n >= data->end)
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
continue;
- for (j = 1; j < data->nkeys; j++)
+ str = repodata_lookup_str(data, entry, keyname);
+ if (str)
+ return str;
+ if (repodata_lookup_type(data, entry, keyname))
+ return 0;
+ }
+ return 0;
+}
+
+
+unsigned int
+repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
+{
+ Repodata *data;
+ int i;
+ unsigned int value;
+
+ if (entry >= 0)
+ {
+ if (keyname == RPM_RPMDBID)
{
- if (data->keys[j].name == key && (data->keys[j].type == TYPE_ID || data->keys[j].type == TYPE_STR))
- return repodata_lookup_str(data, n - data->start, j);
+ if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
+ return repo->rpmdbid[entry - repo->start];
+ return notfound;
}
}
- return 0;
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ {
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ if (repodata_lookup_num(data, entry, keyname, &value))
+ return value;
+ if (repodata_lookup_type(data, entry, keyname))
+ return notfound;
+ }
+ return notfound;
}
+Id
+repo_lookup_id(Repo *repo, Id entry, Id keyname)
+{
+ Repodata *data;
+ int i;
+ Id id;
+ if (entry >= 0)
+ {
+ switch (keyname)
+ {
+ case SOLVABLE_NAME:
+ return repo->pool->solvables[entry].name;
+ case SOLVABLE_ARCH:
+ return repo->pool->solvables[entry].arch;
+ case SOLVABLE_EVR:
+ return repo->pool->solvables[entry].evr;
+ case SOLVABLE_VENDOR:
+ return repo->pool->solvables[entry].vendor;
+ }
+ }
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ {
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ id = repodata_lookup_id(data, entry, keyname);
+ if (id)
+ return data->localpool ? repodata_globalize_id(data, id, 1) : id;
+ if (repodata_lookup_type(data, entry, keyname))
+ return 0;
+ }
+ return 0;
+}
static int
-key_cmp (const void *pa, const void *pb)
+lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
{
- Repokey *a = (Repokey *)pa;
- Repokey *b = (Repokey *)pb;
- return a->name - b->name;
+ Id *p;
+
+ queue_empty(q);
+ if (off)
+ for (p = repo->idarraydata + off; *p; p++)
+ queue_push(q, *p);
+ return 1;
}
-void
-repo_add_attrstore (Repo *repo, Attrstore *s, const char *location)
+int
+repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
{
- unsigned i;
Repodata *data;
- /* If this is meant to be the embedded attributes, make sure we don't
- have them already. */
- if (!location)
+ int i;
+ if (entry >= 0)
{
- for (i = 0; i < repo->nrepodata; i++)
- if (repo->repodata[i].location == 0)
- break;
- if (i != repo->nrepodata)
+ switch (keyname)
{
- pool_debug (repo->pool, SAT_FATAL, "embedded attribs added twice\n");
- exit (1);
+ case SOLVABLE_PROVIDES:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
+ case SOLVABLE_OBSOLETES:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
+ case SOLVABLE_CONFLICTS:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
+ case SOLVABLE_REQUIRES:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
+ case SOLVABLE_RECOMMENDS:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
+ case SOLVABLE_SUGGESTS:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
+ case SOLVABLE_SUPPLEMENTS:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
+ case SOLVABLE_ENHANCES:
+ return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
+ }
+ }
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ {
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ if (repodata_lookup_idarray(data, entry, keyname, q))
+ {
+ if (data->localpool)
+ {
+ for (i = 0; i < q->count; i++)
+ q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
+ }
+ return 1;
}
+ if (repodata_lookup_type(data, entry, keyname))
+ break;
}
- repo->nrepodata++;
- repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
- data = repo->repodata + repo->nrepodata - 1;
- memset (data, 0, sizeof (*data));
- data->s = s;
- data->nkeys = s->nkeys;
- if (data->nkeys)
+ queue_empty(q);
+ return 0;
+}
+
+const unsigned char *
+repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
+{
+ Repodata *data;
+ int i;
+ const unsigned char *chk;
+
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- data->keys = sat_malloc2(data->nkeys, sizeof(data->keys[0]));
- for (i = 1; i < data->nkeys; i++)
- {
- data->keys[i].name = s->keys[i].name;
- data->keys[i].type = s->keys[i].type;
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
+ if (chk)
+ return chk;
+ if (repodata_lookup_type(data, entry, keyname))
+ return 0;
+ }
+ *typep = 0;
+ return 0;
+}
+
+const char *
+repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
+{
+ const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
+ return chk ? pool_bin2hex(repo->pool, chk, sat_chksum_len(*typep)) : 0;
+}
+
+int
+repo_lookup_void(Repo *repo, Id entry, Id keyname)
+{
+ Repodata *data;
+ int i;
+ Id type;
+
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ {
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ type = repodata_lookup_type(data, entry, keyname);
+ if (type)
+ return type == REPOKEY_TYPE_VOID;
+ }
+ return 0;
+}
+
+Id
+repo_lookup_type(Repo *repo, Id entry, Id keyname)
+{
+ Repodata *data;
+ int i;
+ Id type;
+
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ {
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+ continue;
+ if (!repodata_precheck_keyname(data, keyname))
+ continue;
+ type = repodata_lookup_type(data, entry, keyname);
+ if (type)
+ return type == REPOKEY_TYPE_DELETED ? 0 : type;
+ }
+ return 0;
+}
+
+/***********************************************************************/
+
+Repodata *
+repo_add_repodata(Repo *repo, int flags)
+{
+ int i;
+ if ((flags & REPO_USE_LOADING) != 0)
+ {
+ for (i = repo->nrepodata - 1; i >= 0; i--)
+ if (repo->repodata[i].state == REPODATA_LOADING)
+ {
+ Repodata *data = repo->repodata + i;
+ /* re-init */
+ /* hack: we mis-use REPO_REUSE_REPODATA here */
+ if (!(flags & REPO_REUSE_REPODATA))
+ repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
+ return data;
+ }
+ return 0; /* must not create a new repodata! */
+ }
+ if ((flags & REPO_REUSE_REPODATA) != 0)
+ {
+ for (i = repo->nrepodata - 1; i >= 0; i--)
+ if (repo->repodata[i].state != REPODATA_STUB)
+ return repo->repodata + i;
+ }
+ return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
+}
+
+Repodata *
+repo_last_repodata(Repo *repo)
+{
+ int i;
+ for (i = repo->nrepodata - 1; i >= 0; i--)
+ if (repo->repodata[i].state != REPODATA_STUB)
+ return repo->repodata + i;
+ return repo_add_repodata(repo, 0);
+}
+
+void
+repo_set_id(Repo *repo, Id p, Id keyname, Id id)
+{
+ Repodata *data = repo_last_repodata(repo);
+ if (data->localpool)
+ id = repodata_localize_id(data, id, 1);
+ repodata_set_id(data, p, keyname, id);
+}
+
+void
+repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
+{
+ Repodata *data;
+ if (p >= 0)
+ {
+ if (keyname == RPM_RPMDBID)
+ {
+ if (!repo->rpmdbid)
+ repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
+ repo->rpmdbid[p] = num;
+ return;
}
- if (data->nkeys > 2)
- qsort(data->keys + 1, data->nkeys - 1, sizeof(data->keys[0]), key_cmp);
}
- if (location)
- data->location = strdup(location);
+ data = repo_last_repodata(repo);
+ repodata_set_num(data, p, keyname, num);
+}
+
+void
+repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
+{
+ Repodata *data = repo_last_repodata(repo);
+ repodata_set_str(data, p, keyname, str);
+}
+
+void
+repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
+{
+ Repodata *data = repo_last_repodata(repo);
+ repodata_set_poolstr(data, p, keyname, str);
}
+void
+repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
+{
+ Repodata *data = repo_last_repodata(repo);
+ repodata_add_poolstr_array(data, p, keyname, str);
+}
+
+void
+repo_internalize(Repo *repo)
+{
+ int i;
+ Repodata *data;
+
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ if (data->attrs || data->xattrs)
+ repodata_internalize(data);
+}
+
+void
+repo_disable_paging(Repo *repo)
+{
+ int i;
+ Repodata *data;
+
+ for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
+ repodata_disable_paging(data);
+}
// EOF
+/*
+vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4:
+*/
projects / platform / upstream / libsolv.git / blobdiff