X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=src%2Frepo.c;h=9e59fe25e991c9cc71cf0db29fb5df40f98254e8;hb=ce3d4f8072b41fd5eb64807a3616c7b30f10436c;hp=c012572c1b992505fa08283a9e80a4b94c5aa697;hpb=fe25182504257e2edc5135e8be196bb626bcc092;p=platform%2Fupstream%2Flibsolv.git

diff --git a/src/repo.c b/src/repo.c
index c012572..9e59fe2 100644
--- a/src/repo.c
+++ b/src/repo.c
@@ -42,10 +42,17 @@ repo_create(Pool *pool, const char *name)
 
   pool_freewhatprovides(pool);
   repo = (Repo *)solv_calloc(1, sizeof(*repo));
-  pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
-  pool->repos[pool->nrepos++] = repo;
-  repo->repoid = pool->nrepos;
-  repo->name = name ? strdup(name) : 0;
+  if (!pool->nrepos)
+    {
+      pool->nrepos = 1;	/* start with repoid 1 */
+      pool->repos = (Repo **)solv_calloc(2, sizeof(Repo *));
+    }
+  else
+    pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
+  pool->repos[pool->nrepos] = repo;
+  pool->urepos++;
+  repo->repoid = pool->nrepos++;
+  repo->name = name ? solv_strdup(name) : 0;
   repo->pool = pool;
   repo->start = pool->nsolvables;
   repo->end = pool->nsolvables;
@@ -53,11 +60,11 @@ repo_create(Pool *pool, const char *name)
   return repo;
 }
 
-static void
+void
 repo_freedata(Repo *repo)
 {
   int i;
-  for (i = 0; i < repo->nrepodata; i++)
+  for (i = 1; i < repo->nrepodata; i++)
     repodata_freedata(repo->repodata + i);
   solv_free(repo->repodata);
   solv_free(repo->idarraydata);
@@ -85,11 +92,13 @@ repo_empty(Repo *repo, int reuseids)
 	if (s->repo != repo)
 	  break;
       pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
+      repo->end = i + 1;
     }
   /* 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->end = repo->start;
   repo->nsolvables = 0;
 
   /* free all data belonging to this repo */
@@ -97,7 +106,7 @@ repo_empty(Repo *repo, int reuseids)
   repo->idarraysize = 0;
   repo->lastoff = 0;
   repo->rpmdbid = solv_free(repo->rpmdbid);
-  for (i = 0; i < repo->nrepodata; i++)
+  for (i = 1; i < repo->nrepodata; i++)
     repodata_freedata(repo->repodata + i);
   solv_free(repo->repodata);
   repo->repodata = 0;
@@ -118,44 +127,28 @@ repo_free(Repo *repo, int reuseids)
   if (repo == pool->installed)
     pool->installed = 0;
   repo_empty(repo, reuseids);
-  for (i = 0; i < pool->nrepos; i++)	/* find repo in pool */
+  for (i = 1; 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--;
+  if (i == pool->nrepos - 1 && reuseids)
+    pool->nrepos--;
+  else
+    pool->repos[i] = 0;
+  pool->urepos--;
   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 = solv_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);
-}
-
-Id repo_add_solvable(Repo *repo)
+Id
+repo_add_solvable(Repo *repo)
 {
   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); 
+    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)
@@ -165,10 +158,11 @@ Id repo_add_solvable(Repo *repo)
   return p;
 }
 
-Id repo_add_solvable_block(Repo *repo, int count)
+Id
+repo_add_solvable_block(Repo *repo, int count)
 {
   Id p;
-  Solvable *s; 
+  Solvable *s;
   if (!count)
     return 0;
   p = pool_add_solvable_block(repo->pool, count);
@@ -187,12 +181,14 @@ Id repo_add_solvable_block(Repo *repo, int count)
   return p;
 }
 
-void repo_free_solvable(Repo *repo, Id p, int reuseids)
+void
+repo_free_solvable(Repo *repo, Id p, int reuseids)
 {
   repo_free_solvable_block(repo, p, 1, reuseids);
 }
 
-void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
+void
+repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
 {
   Solvable *s;
   Repodata *data;
@@ -204,8 +200,72 @@ void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
     s->repo = 0;
   pool_free_solvable_block(repo->pool, start, count, reuseids);
   FOR_REPODATAS(repo, i, data)
-    if (data->end > repo->end)
-      repodata_shrink(data, repo->end);
+    {
+      int dstart, dend;
+      if (data->end > repo->end)
+        repodata_shrink(data, repo->end);
+      dstart = data->start > start ? data->start : start;
+      dend = data->end < start + count ? data->end : start + count;
+      if (dstart < dend)
+	{
+	  if (data->attrs)
+	    {
+	      int j;
+	      for (j = dstart; j < dend; j++)	
+		data->attrs[j - data->start] = solv_free(data->attrs[j - data->start]);
+	    }
+	  if (data->incoreoffset)
+	    memset(data->incoreoffset + (dstart - data->start), 0, (dend - dstart) * sizeof(Id));
+	}
+    }
+}
+
+/* specialized version of repo_add_solvable_block that inserts the new solvable
+ * block before the indicated repo, which gets relocated.
+ * used in repo_add_rpmdb
+ */
+Id
+repo_add_solvable_block_before(Repo *repo, int count, Repo *beforerepo)
+{
+  Pool *pool = repo->pool;
+  Id p;
+  Solvable *s;
+  Repodata *data;
+  int i;
+
+  if (!count || !beforerepo || beforerepo->end != pool->nsolvables || beforerepo->start == beforerepo->end)
+    return repo_add_solvable_block(repo, count);
+  p = beforerepo->start;
+  /* make sure all solvables belong to beforerepo */
+  for (i = p, s = pool->solvables + i; i < beforerepo->end; i++, s++)
+    if (s->repo && s->repo != beforerepo)
+      return repo_add_solvable_block(repo, count);
+  /* now move beforerepo to back */
+  pool_add_solvable_block(pool, count);	/* must return beforerepo->end! */
+  memmove(pool->solvables + p + count, pool->solvables + p, (beforerepo->end - p) * sizeof(Solvable));
+  memset(pool->solvables + p, 0, sizeof(Solvable) * count);
+  /* adapt repodata */
+  FOR_REPODATAS(beforerepo, i, data)
+    {
+      if (data->start < p)
+	continue;
+      data->start += count;
+      data->end += count;
+    }
+  beforerepo->start += count;
+  beforerepo->end += count;
+  /* we now have count free solvables at id 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 = pool->solvables + p; count--; s++)
+    s->repo = repo;
+  return p;
 }
 
 
@@ -302,7 +362,7 @@ repo_addid(Repo *repo, Offset olddeps, Id id)
 #define REPO_ADDID_DEP_HASHTHRES	64
 #define REPO_ADDID_DEP_HASHMIN		128
 
-/* 
+/*
  * Optimization for packages with an excessive amount of provides/requires:
  * if the number of deps exceed a threshold, we build a hash of the already
  * seen ids.
@@ -328,9 +388,10 @@ repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
     }
 
   /* maintain hash and lastmarkerpos */
-  if (repo->lastidhash_idarraysize != repo->idarraysize || size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
+  if (repo->lastidhash_idarraysize != repo->idarraysize || (Hashval)size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
     {
-      if (size * 2 > repo->lastidhash_mask)
+      repo->lastmarkerpos = 0;
+      if (size * 2 > (Hashval)repo->lastidhash_mask)
 	{
 	  repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
 	  repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
@@ -358,6 +419,8 @@ repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
   /* put new element in hash */
   if (!hid)
     repo->lastidhash[h] = id;
+  else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
+    return olddeps;
   if (marker && !before && !repo->lastmarkerpos)
     {
       /* we have to add the marker first */
@@ -373,6 +436,7 @@ repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
     }
   if (!hid)
     {
+      /* new entry, insert in correct position */
       if (marker && before && repo->lastmarkerpos)
 	{
 	  /* need to add it before the marker */
@@ -389,7 +453,23 @@ repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
       return olddeps;
     }
   /* we already have it in the hash */
-  if (!marker || before || marker == SOLVABLE_FILEMARKER)
+  if (!marker)
+    return olddeps;
+  if (marker == SOLVABLE_FILEMARKER)
+    {
+      /* check if it is in the wrong half */
+      /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
+      for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
+	if (oid == id)
+	  break;
+      if (!oid)
+	return olddeps;
+      /* yes, wrong half. copy it over */
+      memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
+      repo->idarraydata[repo->lastmarkerpos++] = id;
+      return olddeps;
+    }
+  if (before)
     return olddeps;
   /* check if it is in the correct half */
   for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
@@ -403,6 +483,7 @@ repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
     return olddeps;	/* should not happen */
   memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
   repo->idarraydata[repo->idarraysize - 2] = id;
+  repo->lastmarkerpos--;	/* marker has been moved */
   return olddeps;
 }
 
@@ -466,7 +547,16 @@ repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
 
   if (oid)
     {
-      if (markerp || before || marker == SOLVABLE_FILEMARKER)
+      if (marker == SOLVABLE_FILEMARKER)
+	{
+	  if (!markerp || !before)
+            return olddeps;
+          /* we found it, but in the second half */
+          memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
+          *markerp = id;
+          return olddeps;
+	}
+      if (markerp || before)
         return olddeps;
       /* we found it, but in the first half */
       markerp = oidp++;
@@ -502,6 +592,20 @@ repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
   return repo_addid(repo, olddeps, id);
 }
 
+/* return standard marker for the keyname dependency.
+ * 1: return positive marker, -1: return negative marker
+ */
+Id
+solv_depmarker(Id keyname, Id marker)
+{
+  if (marker != 1 && marker != -1)
+    return marker;
+  if (keyname == SOLVABLE_PROVIDES)
+    return marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
+  if (keyname == SOLVABLE_REQUIRES)
+    return marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
+  return 0;
+}
 
 /*
  * reserve Ids
@@ -510,7 +614,6 @@ repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
  *
  * reserved ids will always begin at offset idarraysize
  */
-
 Offset
 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
 {
@@ -561,227 +664,7 @@ repo_reserve_ids(Repo *repo, Offset olddeps, int num)
 }
 
 
-
-Offset
-repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
-{
-  Pool *pool = repo->pool;
-  Id id, idp, idl;
-  char buf[1024], *p, *dep;
-  int i, l;
-
-  if (provides)
-    {
-      for (i = provides; repo->idarraydata[i]; i++)
-	{
-	  id = repo->idarraydata[i];
-	  if (ISRELDEP(id))
-	    continue;
-	  dep = (char *)pool_id2str(pool, id);
-	  if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
-	    {
-	      idp = 0;
-	      strcpy(buf + 2, dep);
-	      dep = buf + 2 + 7;
-	      if ((p = strchr(dep, ':')) != 0 && p != dep)
-		{
-		  *p++ = 0;
-		  idp = pool_str2id(pool, dep, 1);
-		  dep = p;
-		}
-	      id = 0;
-	      while ((p = strchr(dep, ';')) != 0)
-		{
-		  if (p == dep)
-		    {
-		      dep = p + 1;
-		      continue;
-		    }
-		  *p++ = 0;
-#if 0
-		  strncpy(dep - 9, "language:", 9);
-		  idl = pool_str2id(pool, dep - 9, 1);
-#else
-		  idl = pool_str2id(pool, dep, 1);
-		  idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
-#endif
-		  if (id)
-		    id = pool_rel2id(pool, id, idl, REL_OR, 1);
-		  else
-		    id = idl;
-		  dep = p;
-		}
-	      if (dep[0] && dep[1])
-		{
-	 	  for (p = dep; *p && *p != ')'; p++)
-		    ;
-		  *p = 0;
-#if 0
-		  strncpy(dep - 9, "language:", 9);
-		  idl = pool_str2id(pool, dep - 9, 1);
-#else
-		  idl = pool_str2id(pool, dep, 1);
-		  idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
-#endif
-		  if (id)
-		    id = pool_rel2id(pool, id, idl, REL_OR, 1);
-		  else
-		    id = idl;
-		}
-	      if (idp)
-		id = pool_rel2id(pool, idp, id, REL_AND, 1);
-	      if (id)
-		supplements = repo_addid_dep(repo, supplements, id, 0);
-	    }
-	  else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
-	    {
-	      strcpy(buf, dep);
-	      p = buf + (p - dep);
-	      *p++ = 0;
-	      idp = pool_str2id(pool, buf, 1);
-	      /* strip trailing slashes */
-	      l = strlen(p);
-	      while (l > 1 && p[l - 1] == '/')
-		p[--l] = 0;
-	      id = pool_str2id(pool, p, 1);
-	      id = pool_rel2id(pool, idp, id, REL_WITH, 1);
-	      id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
-	      supplements = repo_addid_dep(repo, supplements, id, 0);
-	    }
-	}
-    }
-  if (supplements)
-    {
-      for (i = supplements; repo->idarraydata[i]; i++)
-	{
-	  id = repo->idarraydata[i];
-	  if (ISRELDEP(id))
-	    continue;
-	  dep = (char *)pool_id2str(pool, id);
-	  if (!strncmp(dep, "system:modalias(", 16))
-	    dep += 7;
-	  if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
-	    {
-	      strcpy(buf, dep);
-	      p = strchr(buf + 9, ':');
-	      if (p && p != buf + 9 && strchr(p + 1, ':'))
-		{
-		  *p++ = 0;
-		  idp = pool_str2id(pool, buf + 9, 1);
-		  p[strlen(p) - 1] = 0;
-		  id = pool_str2id(pool, p, 1);
-		  id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
-		  id = pool_rel2id(pool, idp, id, REL_AND, 1);
-		}
-	      else
-		{
-		  p = buf + 9;
-		  p[strlen(p) - 1] = 0;
-		  id = pool_str2id(pool, p, 1);
-		  id = pool_rel2id(pool, NAMESPACE_MODALIAS, 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)
-		    {
-		      dep = p + 1;
-		      continue;
-		    }
-		  *p++ = 0;
-		  idp = pool_str2id(pool, dep, 1);
-		  if (id)
-		    id = pool_rel2id(pool, id, idp, REL_AND, 1);
-		  else
-		    id = idp;
-		  dep = p;
-		}
-	      if (dep[0] && dep[1])
-		{
-		  dep[strlen(dep) - 1] = 0;
-		  idp = pool_str2id(pool, dep, 1);
-		  if (id)
-		    id = pool_rel2id(pool, id, idp, REL_AND, 1);
-		  else
-		    id = idp;
-		}
-	      if (id)
-		repo->idarraydata[i] = id;
-	    }
-	  else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
-	    {
-	      strcpy(buf, dep + 11);
-	      if ((p = strrchr(buf, ')')) != 0)
-		*p = 0;
-	      id = pool_str2id(pool, buf, 1);
-	      id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
-	      repo->idarraydata[i] = id;
-	    }
-	}
-    }
-  if (freshens && repo->idarraydata[freshens])
-    {
-      Id idsupp = 0, idfresh = 0;
-      if (!supplements)
-	return freshens;
-      for (i = supplements; repo->idarraydata[i]; i++)
-        {
-	  if (!idsupp)
-	    idsupp = repo->idarraydata[i];
-	  else
-	    idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
-        }
-      for (i = freshens; repo->idarraydata[i]; i++)
-        {
-	  if (!idfresh)
-	    idfresh = repo->idarraydata[i];
-	  else
-	    idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
-        }
-      if (!idsupp)
-        idsupp = idfresh;
-      else
-	idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
-      supplements = repo_addid_dep(repo, 0, idsupp, 0);
-    }
-  return supplements;
-}
-
-Offset
-repo_fix_conflicts(Repo *repo, Offset conflicts)
-{
-  char buf[1024], *p, *dep;
-  Pool *pool = repo->pool;
-  Id id;
-  int i;
-
-  if (!conflicts)
-    return conflicts;
-  for (i = conflicts; repo->idarraydata[i]; i++)
-    {
-      id = repo->idarraydata[i];
-      if (ISRELDEP(id))
-	continue;
-      dep = (char *)pool_id2str(pool, id);
-      if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
-	{
-	  strcpy(buf, dep + 15);
-	  if ((p = strchr(buf, ')')) != 0)
-	    *p = 0;
-	  id = pool_str2id(pool, buf, 1);
-	  id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
-	  repo->idarraydata[i] = id;
-	}
-    }
-  return conflicts;
-}
+/***********************************************************************/
 
 struct matchdata
 {
@@ -800,9 +683,13 @@ repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValu
 
   if (md->matcher.match)
     {
-      if (!repodata_stringify(md->pool, data, key, kv, md->flags))
+      const char *str;
+      if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
+	if (!datamatcher_checkbasename(&md->matcher, kv->str))
+	  return 0;
+      if (!(str = repodata_stringify(md->pool, data, key, kv, md->flags)))
 	return 0;
-      if (!datamatcher_match(&md->matcher, kv->str))
+      if (!datamatcher_match(&md->matcher, str))
 	return 0;
     }
   md->stop = md->callback(md->callback_data, s, data, key, kv);
@@ -810,7 +697,9 @@ repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValu
 }
 
 
-static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
+/* list of all keys we store in the solvable */
+/* also used in the dataiterator code in repodata.c */
+Repokey repo_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 },
@@ -823,7 +712,7 @@ static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
   { 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 },
+  { RPM_RPMDBID,          REPOKEY_TYPE_NUM, 0, KEY_STORAGE_SOLVABLE },
 };
 
 static void
@@ -836,7 +725,7 @@ domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
     {
       kv.id = *ida;
       kv.eof = ida[1] ? 0 : 1;
-      repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
+      repo_matchvalue(md, s, 0, repo_solvablekeys + (keyname - SOLVABLE_NAME), &kv);
       kv.entry++;
     }
 }
@@ -878,7 +767,7 @@ repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
 	    if (s->name)
 	      {
 		kv.id = s->name;
-		repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
+		repo_matchvalue(md, s, 0, repo_solvablekeys + 0, &kv);
 	      }
 	    if (keyname || md->stop > SEARCH_NEXT_KEY)
 	      return;
@@ -886,7 +775,7 @@ repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
 	    if (s->arch)
 	      {
 		kv.id = s->arch;
-		repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
+		repo_matchvalue(md, s, 0, repo_solvablekeys + 1, &kv);
 	      }
 	    if (keyname || md->stop > SEARCH_NEXT_KEY)
 	      return;
@@ -894,7 +783,7 @@ repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
 	    if (s->evr)
 	      {
 		kv.id = s->evr;
-		repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
+		repo_matchvalue(md, s, 0, repo_solvablekeys + 2, &kv);
 	      }
 	    if (keyname || md->stop > SEARCH_NEXT_KEY)
 	      return;
@@ -902,7 +791,7 @@ repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
 	    if (s->vendor)
 	      {
 		kv.id = s->vendor;
-		repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
+		repo_matchvalue(md, s, 0, repo_solvablekeys + 3, &kv);
 	      }
 	    if (keyname || md->stop > SEARCH_NEXT_KEY)
 	      return;
@@ -950,7 +839,8 @@ repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
 	    if (repo->rpmdbid)
 	      {
 		kv.num = repo->rpmdbid[p - repo->start];
-		repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
+		kv.num2 = 0;
+		repo_matchvalue(md, s, 0, repo_solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
 	      }
 	    if (keyname || md->stop > SEARCH_NEXT_KEY)
 	      return;
@@ -1042,6 +932,8 @@ repo_lookup_str(Repo *repo, Id entry, Id keyname)
 	  return pool_id2str(pool, pool->solvables[entry].vendor);
 	}
     }
+  else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1058,12 +950,13 @@ repo_lookup_str(Repo *repo, Id entry, Id keyname)
 }
 
 
-unsigned int
-repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
+unsigned long long
+repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned long long notfound)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
-  unsigned int value;
+  unsigned long long value;
 
   if (entry >= 0)
     {
@@ -1074,6 +967,8 @@ repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
 	  return notfound;
 	}
     }
+  else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, &value) ? value : notfound;
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1091,6 +986,7 @@ repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
 Id
 repo_lookup_id(Repo *repo, Id entry, Id keyname)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
   Id id;
@@ -1109,6 +1005,12 @@ repo_lookup_id(Repo *repo, Id entry, Id keyname)
 	  return repo->pool->solvables[entry].vendor;
 	}
     }
+  else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    {
+      Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
+      Id id = repodata_lookup_id(data, entry, keyname);
+      return data->localpool ? repodata_globalize_id(data, id, 1) : id;
+    }
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1139,6 +1041,7 @@ lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
 int
 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
   if (entry >= 0)
@@ -1163,6 +1066,19 @@ repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
 	  return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
         }
     }
+  else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    {
+      Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
+      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;
+	}
+    }
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1185,13 +1101,51 @@ repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
   return 0;
 }
 
+int
+repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
+{
+  int r = repo_lookup_idarray(repo, entry, keyname, q);
+  if (!r)
+    return 0;
+  if (marker == -1 || marker == 1)
+    marker = solv_depmarker(keyname, marker);
+  if (marker && q->count)
+    {
+      int i;
+      if (marker < 0)
+	{
+	  marker = -marker;
+	  for (i = 0; i < q->count; i++)
+	    if (q->elements[i] == marker)
+	      {
+		queue_truncate(q, i);
+		return r;
+	      }
+	}
+      else
+	{
+	  for (i = 0; i < q->count; i++)
+	    if (q->elements[i] == marker)
+	      {
+		queue_deleten(q, 0, i + 1);
+		return r;
+	      }
+	  queue_empty(q);
+	}
+    }
+  return r;
+}
+
 const unsigned char *
 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
   const unsigned char *chk;
 
+  if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, typep);
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1218,10 +1172,13 @@ repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
 int
 repo_lookup_void(Repo *repo, Id entry, Id keyname)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
   Id type;
 
+  if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1238,10 +1195,13 @@ repo_lookup_void(Repo *repo, Id entry, Id keyname)
 Id
 repo_lookup_type(Repo *repo, Id entry, Id keyname)
 {
+  Pool *pool = repo->pool;
   Repodata *data;
   int i;
   Id type;
 
+  if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_type(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
   FOR_REPODATAS(repo, i, data)
     {
       if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
@@ -1255,15 +1215,40 @@ repo_lookup_type(Repo *repo, Id entry, Id keyname)
   return 0;
 }
 
+const void *
+repo_lookup_binary(Repo *repo, Id entry, Id keyname, int *lenp)
+{
+  Pool *pool = repo->pool;
+  Repodata *data;
+  int i;
+  const void *bin;
+
+  if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
+    return repodata_lookup_binary(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, lenp);
+  FOR_REPODATAS(repo, i, data)
+    {
+      if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
+	continue;
+      if (!repodata_precheck_keyname(data, keyname))
+	continue;
+      bin = repodata_lookup_binary(data, entry, keyname, lenp);
+      if (bin)
+	return bin;
+    }
+  *lenp = 0;
+  return 0;
+}
+
 /***********************************************************************/
 
 Repodata *
 repo_add_repodata(Repo *repo, int flags)
 {
+  Repodata *data;
   int i;
   if ((flags & REPO_USE_LOADING) != 0)
     {
-      for (i = repo->nrepodata - 1; i >= 0; i--)
+      for (i = repo->nrepodata - 1; i > 0; i--)
 	if (repo->repodata[i].state == REPODATA_LOADING)
 	  {
 	    Repodata *data = repo->repodata + i;
@@ -1277,18 +1262,36 @@ repo_add_repodata(Repo *repo, int flags)
     }
   if ((flags & REPO_REUSE_REPODATA) != 0)
     {
-      for (i = repo->nrepodata - 1; i >= 0; i--)
+      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);
+  if (!repo->nrepodata)
+    {
+      repo->nrepodata = 2;      /* start with id 1 */
+      repo->repodata = solv_calloc(repo->nrepodata, sizeof(*data));
+    }
+  else
+    {
+      repo->nrepodata++;
+      repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
+    }
+  data = repo->repodata + repo->nrepodata - 1;
+  repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
+  return data;
+}
+
+Repodata *
+repo_id2repodata(Repo *repo, Id id)
+{
+  return id ? repo->repodata + id : 0;
 }
 
 Repodata *
 repo_last_repodata(Repo *repo)
 {
   int i;
-  for (i = repo->nrepodata - 1; i >= 0; 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);
@@ -1323,7 +1326,7 @@ repo_set_id(Repo *repo, Id p, Id keyname, Id id)
 }
 
 void
-repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
+repo_set_num(Repo *repo, Id p, Id keyname, unsigned long long num)
 {
   Repodata *data;
   if (p >= 0)
@@ -1332,7 +1335,7 @@ repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
 	{
 	  if (!repo->rpmdbid)
 	    repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
-	  repo->rpmdbid[p] = num;
+	  repo->rpmdbid[p - repo->start] = num;
 	  return;
 	}
     }
@@ -1388,6 +1391,192 @@ repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
 }
 
 void
+repo_add_deparray(Repo *repo, Id p, Id keyname, Id dep, Id marker)
+{
+  Repodata *data;
+  if (marker == -1 || marker == 1)
+    marker = solv_depmarker(keyname, marker);
+  if (p >= 0)
+    {
+      Solvable *s = repo->pool->solvables + p;
+      switch (keyname)
+	{
+	case SOLVABLE_PROVIDES:
+	  s->provides = repo_addid_dep(repo, s->provides, dep, marker);
+	  return;
+	case SOLVABLE_OBSOLETES:
+	  s->obsoletes = repo_addid_dep(repo, s->obsoletes, dep, marker);
+	  return;
+	case SOLVABLE_CONFLICTS:
+	  s->conflicts = repo_addid_dep(repo, s->conflicts, dep, marker);
+	  return;
+	case SOLVABLE_REQUIRES:
+	  s->requires = repo_addid_dep(repo, s->requires, dep, marker);
+	  return;
+	case SOLVABLE_RECOMMENDS:
+	  s->recommends = repo_addid_dep(repo, s->recommends, dep, marker);
+	  return;
+	case SOLVABLE_SUGGESTS:
+	  s->suggests = repo_addid_dep(repo, s->suggests, dep, marker);
+	  return;
+	case SOLVABLE_SUPPLEMENTS:
+	  s->supplements = repo_addid_dep(repo, s->supplements, dep, marker);
+	  return;
+	case SOLVABLE_ENHANCES:
+	  s->enhances = repo_addid_dep(repo, s->enhances, dep, marker);
+	  return;
+	}
+    }
+  data = repo_last_repodata(repo);
+  repodata_add_idarray(data, p, keyname, dep);
+}
+
+void
+repo_add_idarray(Repo *repo, Id p, Id keyname, Id id)
+{
+  repo_add_deparray(repo, p, keyname, id, 0);
+}
+
+static Offset
+repo_set_idarray_solvable(Repo *repo, Queue *q)
+{
+  Offset o = 0;
+  int i;
+  for (i = 0; i < q->count; i++)
+    repo_addid_dep(repo, o, q->elements[i], 0);
+  return o;
+}
+
+void
+repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
+{
+  Repodata *data;
+  if (marker == -1 || marker == 1)
+    marker = solv_depmarker(keyname, marker);
+  if (marker)
+    {
+      /* complex case, splice old and new arrays */
+      int i;
+      Queue q2;
+      queue_init(&q2);
+      repo_lookup_deparray(repo, p, keyname, &q2, -marker);
+      if (marker > 0)
+	{
+	  if (q->count)
+	    {
+	      queue_push(&q2, marker);
+	      for (i = 0; i < q->count; i++)
+		queue_push(&q2, q->elements[i]);
+	    }
+	}
+      else
+	{
+	  if (q2.count)
+	    queue_insert(&q2, 0, -marker);
+	  queue_insertn(&q2, 0, q->count, q->elements);
+	}
+      repo_set_deparray(repo, p, keyname, &q2, 0);
+      queue_free(&q2);
+      return;
+    }
+  if (p >= 0)
+    {
+      Solvable *s = repo->pool->solvables + p;
+      switch (keyname)
+	{
+	case SOLVABLE_PROVIDES:
+	  s->provides = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_OBSOLETES:
+	  s->obsoletes = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_CONFLICTS:
+	  s->conflicts = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_REQUIRES:
+	  s->requires = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_RECOMMENDS:
+	  s->recommends = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_SUGGESTS:
+	  s->suggests = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_SUPPLEMENTS:
+	  s->supplements = repo_set_idarray_solvable(repo, q);
+	  return;
+	case SOLVABLE_ENHANCES:
+	  s->enhances = repo_set_idarray_solvable(repo, q);
+	  return;
+	}
+    }
+  data = repo_last_repodata(repo);
+  repodata_set_idarray(data, p, keyname, q);
+}
+
+void
+repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
+{
+  repo_set_deparray(repo, p, keyname, q, 0);
+}
+
+void
+repo_unset(Repo *repo, Id p, Id keyname)
+{
+  Repodata *data;
+  if (p >= 0)
+    {
+      Solvable *s = repo->pool->solvables + p;
+      switch (keyname)
+	{
+	case SOLVABLE_NAME:
+	  s->name = 0;
+	  return;
+	case SOLVABLE_ARCH:
+	  s->arch = 0;
+	  return;
+	case SOLVABLE_EVR:
+	  s->evr = 0;
+	  return;
+	case SOLVABLE_VENDOR:
+	  s->vendor = 0;
+	  return;
+        case RPM_RPMDBID:
+	  if (repo->rpmdbid)
+	    repo->rpmdbid[p - repo->start] = 0;
+	  return;
+	case SOLVABLE_PROVIDES:
+	  s->provides = 0;
+	  return;
+	case SOLVABLE_OBSOLETES:
+	  s->obsoletes = 0;
+	  return;
+	case SOLVABLE_CONFLICTS:
+	  s->conflicts = 0;
+	  return;
+	case SOLVABLE_REQUIRES:
+	  s->requires = 0;
+	  return;
+	case SOLVABLE_RECOMMENDS:
+	  s->recommends = 0;
+	  return;
+	case SOLVABLE_SUGGESTS:
+	  s->suggests = 0;
+	  return;
+	case SOLVABLE_SUPPLEMENTS:
+	  s->supplements = 0;
+	case SOLVABLE_ENHANCES:
+	  s->enhances = 0;
+	  return;
+	default:
+	  break;
+	}
+    }
+  data = repo_last_repodata(repo);
+  repodata_unset(data, p, keyname);
+}
+
+void
 repo_internalize(Repo *repo)
 {
   int i;
@@ -1407,7 +1596,4 @@ repo_disable_paging(Repo *repo)
   FOR_REPODATAS(repo, i, data)
     repodata_disable_paging(data);
 }
-// EOF
-/*
-vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4:
-*/
+