2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Manage metadata coming from one repository
21 #include "poolid_private.h"
23 #include "attr_store_p.h"
25 #define IDARRAY_BLOCK 4095
34 repo_create(Pool *pool, const char *name)
38 pool_freewhatprovides(pool);
39 repo = (Repo *)xcalloc(1, sizeof(*repo));
40 pool->repos = (Repo **)xrealloc(pool->repos, (pool->nrepos + 1) * sizeof(Repo *));
41 pool->repos[pool->nrepos++] = repo;
42 repo->name = name ? strdup(name) : 0;
44 repo->start = pool->nsolvables;
45 repo->end = pool->nsolvables;
51 repo_freedata(Repo *repo)
53 xfree(repo->idarraydata);
55 xfree((char *)repo->name);
61 * olddeps = old array to extend
66 repo_addid(Repo *repo, Offset olddeps, Id id)
72 idarray = repo->idarraydata;
73 idarraysize = repo->idarraysize;
75 if (!idarray) /* alloc idarray if not done yet */
77 idarray = (Id *)xmalloc((1 + IDARRAY_BLOCK) * sizeof(Id));
83 if (!olddeps) /* no deps yet */
85 olddeps = idarraysize;
86 if ((idarraysize & IDARRAY_BLOCK) == 0)
87 idarray = (Id *)xrealloc(idarray, (idarraysize + 1 + IDARRAY_BLOCK) * sizeof(Id));
89 else if (olddeps == repo->lastoff) /* extend at end */
91 else /* can't extend, copy old */
94 olddeps = idarraysize;
95 for (; idarray[i]; i++)
97 if ((idarraysize & IDARRAY_BLOCK) == 0)
98 idarray = (Id *)xrealloc(idarray, (idarraysize + 1 + IDARRAY_BLOCK) * sizeof(Id));
99 idarray[idarraysize++] = idarray[i];
101 if ((idarraysize & IDARRAY_BLOCK) == 0)
102 idarray = (Id *)xrealloc(idarray, (idarraysize + 1 + IDARRAY_BLOCK) * sizeof(Id));
105 idarray[idarraysize++] = id; /* insert Id into array */
107 if ((idarraysize & IDARRAY_BLOCK) == 0) /* realloc if at block boundary */
108 idarray = (Id *)xrealloc(idarray, (idarraysize + 1 + IDARRAY_BLOCK) * sizeof(Id));
110 idarray[idarraysize++] = 0; /* ensure NULL termination */
112 repo->idarraydata = idarray;
113 repo->idarraysize = idarraysize;
114 repo->lastoff = olddeps;
121 * add dependency (as Id) to repo
122 * olddeps = offset into idarraydata
123 * isreq = 0 for normal dep
124 * isreq = 1 for requires
125 * isreq = 2 for pre-requires
130 repo_addid_dep(Repo *repo, Offset olddeps, Id id, int isreq)
132 Id oid, *oidp, *marker = 0;
135 return repo_addid(repo, olddeps, id);
139 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
144 return repo_addid(repo, olddeps, id);
147 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
149 if (oid == SOLVABLE_PREREQMARKER)
157 if (marker || isreq == 1)
160 for (; (oid = *oidp) != ID_NULL; oidp++)
161 if (oid == SOLVABLE_PREREQMARKER)
167 memmove(marker, marker + 1, (oidp - marker) * sizeof(Id));
168 *oidp = SOLVABLE_PREREQMARKER;
169 return repo_addid(repo, olddeps, id);
173 memmove(marker, marker + 1, (oidp - marker) * sizeof(Id));
177 if (isreq == 2 && !marker)
178 olddeps = repo_addid(repo, olddeps, SOLVABLE_PREREQMARKER);
179 else if (isreq == 1 && marker)
184 memmove(marker + 1, marker, (oidp - marker) * sizeof(Id));
185 *marker = SOLVABLE_PREREQMARKER;
187 return repo_addid(repo, olddeps, id);
193 * make space for 'num' more dependencies
197 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
199 num++; /* room for trailing ID_NULL */
201 if (!repo->idarraysize) /* ensure buffer space */
203 repo->idarraysize = 1;
204 repo->idarraydata = (Id *)xmalloc(((1 + num + IDARRAY_BLOCK) & ~IDARRAY_BLOCK) * sizeof(Id));
205 repo->idarraydata[0] = 0;
210 if (olddeps && olddeps != repo->lastoff) /* if not appending */
212 /* can't insert into idarray, this would invalidate all 'larger' offsets
213 * so create new space at end and move existing deps there.
214 * Leaving 'hole' at old position.
220 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
222 count = idend - idstart - 1 + num; /* new size */
224 /* realloc if crossing block boundary */
225 if (((repo->idarraysize - 1) | IDARRAY_BLOCK) != ((repo->idarraysize + count - 1) | IDARRAY_BLOCK))
226 repo->idarraydata = (Id *)xrealloc(repo->idarraydata, ((repo->idarraysize + count + IDARRAY_BLOCK) & ~IDARRAY_BLOCK) * sizeof(Id));
228 /* move old deps to end */
229 olddeps = repo->lastoff = repo->idarraysize;
230 memcpy(repo->idarraydata + olddeps, idstart, count - num);
231 repo->idarraysize = olddeps + count - num;
236 if (olddeps) /* appending */
239 /* realloc if crossing block boundary */
240 if (((repo->idarraysize - 1) | IDARRAY_BLOCK) != ((repo->idarraysize + num - 1) | IDARRAY_BLOCK))
241 repo->idarraydata = (Id *)xrealloc(repo->idarraydata, ((repo->idarraysize + num + IDARRAY_BLOCK) & ~IDARRAY_BLOCK) * sizeof(Id));
243 /* appending or new */
244 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
246 return repo->lastoff;
251 * remove repo from pool, zero out solvables
256 repo_free(Repo *repo, int reuseids)
258 Pool *pool = repo->pool;
262 pool_freewhatprovides(pool);
264 if (reuseids && repo->end == pool->nsolvables)
266 /* it's ok to reuse the ids. As this is the last repo, we can
267 just shrink the solvable array */
268 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
272 pool->nsolvables = i + 1;
274 /* zero out solvables belonging to this repo */
275 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
277 memset(s, 0, sizeof(*s));
278 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
279 if (pool->repos[i] == repo)
281 if (i == pool->nrepos) /* repo not in pool, return */
283 if (i < pool->nrepos - 1)
284 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
290 repo_freeallrepos(Pool *pool, int reuseids)
294 pool_freewhatprovides(pool);
295 for (i = 0; i < pool->nrepos; i++)
296 repo_freedata(pool->repos[i]);
297 pool->repos = xfree(pool->repos);
299 /* the first two solvables don't belong to a repo */
300 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
304 repo_fix_legacy(Repo *repo, Offset provides, Offset supplements)
306 Pool *pool = repo->pool;
307 Id id, idp, idl, idns;
308 char buf[1024], *p, *dep;
313 for (i = provides; repo->idarraydata[i]; i++)
315 id = repo->idarraydata[i];
318 dep = (char *)id2str(pool, id);
319 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
322 strcpy(buf + 2, dep);
324 if ((p = strchr(dep, ':')) != 0 && p != dep)
327 idp = str2id(pool, dep, 1);
331 while ((p = strchr(dep, ';')) != 0)
338 strncpy(dep - 9, "language:", 9);
340 idl = str2id(pool, dep - 9, 1);
342 id = rel2id(pool, id, idl, REL_OR, 1);
347 if (dep[0] && dep[1])
349 for (p = dep; *p && *p != ')'; p++)
352 strncpy(dep - 9, "language:", 9);
353 idl = str2id(pool, dep - 9, 1);
355 id = rel2id(pool, id, idl, REL_OR, 1);
360 id = rel2id(pool, idp, id, REL_AND, 1);
362 supplements = repo_addid_dep(repo, supplements, id, 0);
364 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
369 idp = str2id(pool, buf, 1);
370 idns = str2id(pool, "namespace:installed", 1);
371 id = str2id(pool, p, 1);
372 id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
373 id = rel2id(pool, idp, id, REL_AND, 1);
374 supplements = repo_addid_dep(repo, supplements, id, 0);
380 for (i = supplements; repo->idarraydata[i]; i++)
382 id = repo->idarraydata[i];
385 dep = (char *)id2str(pool, id);
386 if (!strncmp(dep, "system:modalias(", 16))
388 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
391 p = strchr(buf + 9, ':');
392 idns = str2id(pool, "namespace:modalias", 1);
393 if (p && p != buf + 9 && strchr(p + 1, ':'))
396 idp = str2id(pool, buf + 9, 1);
397 p[strlen(p) - 1] = 0;
398 id = str2id(pool, p, 1);
399 id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
400 id = rel2id(pool, idp, id, REL_AND, 1);
405 p[strlen(p) - 1] = 0;
406 id = str2id(pool, p, 1);
407 id = rel2id(pool, idns, id, REL_NAMESPACE, 1);
410 repo->idarraydata[i] = id;
412 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
417 while ((p = strchr(dep, ':')) != 0)
425 idp = str2id(pool, dep, 1);
427 id = rel2id(pool, id, idp, REL_AND, 1);
432 if (dep[0] && dep[1])
434 dep[strlen(dep) - 1] = 0;
435 idp = str2id(pool, dep, 1);
437 id = rel2id(pool, id, idp, REL_AND, 1);
442 repo->idarraydata[i] = id;
450 repodata_search(Repodata *data, Id key)
455 repodata_lookup_id(Repodata *data, Id num, Id key)
457 Id id, k, *kp, *keyp;
459 fseek(data->fp, data->itemoffsets[num] , SEEK_SET);
460 Id *keyp = data->schemadata + data->schemata[read_id(data->fp, data->numschemata)];
461 /* make sure our schema contains the key */
462 for (kp = keyp; (k = *kp++) != 0)
468 while ((k = *keyp++) != 0)
472 switch (keys[key].type)
475 while ((read_u8(data->fp) & 0x80) != 0)
482 while(read_u8(data->fp) != 0)
486 while ((read_u8(data->fp) & 0xc0) != 0)
491 id = read_id(data->fp, 0);
492 return data->ss.stringspace + data->ss.strings[id];
496 repo_lookup_id(Solvable *s, Id key)
499 Repo *repo = s->repo;
511 case SOLVABLE_VENDOR:
514 /* convert solvable id into repo item count */
515 if (repo->end - repo->start + 1 == repo->nsolvables)
517 n = (s - pool->solvables);
518 if (n < repo->start || n > repo->end)
524 for (i = repo->start, rs = pool->solvables + i, n = 0; i < repo->end; i++, rs++)
526 if (rs->repo != repo)
535 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
537 for (j = 0; j < data->nkeys; j++)
539 if (data->keys[j].name == key && data->keys[j].type == TYPE_ID)
540 return repodata_lookup_id(data, n, j);
548 key_cmp (const void *pa, const void *pb)
550 struct key { Id name; unsigned type; };
551 struct key *a = (struct key*)pa;
552 struct key *b = (struct key*)pb;
553 return a->name - b->name;
557 repo_add_attrstore (Repo *repo, Attrstore *s, const char *name)
561 /* If this is meant to be the embedded attributes, make sure we don't
562 have them already. */
565 for (i = 0; i < repo->nrepodata; i++)
566 if (repo->repodata[i].name == 0)
568 if (i != repo->nrepodata)
570 pool_debug (repo->pool, SAT_FATAL, "embedded attribs added twice\n");
575 repo->repodata = xrealloc (repo->repodata, repo->nrepodata * sizeof (*data));
576 data = repo->repodata + repo->nrepodata - 1;
577 memset (data, 0, sizeof (*data));
579 data->nkeys = s->nkeys;
580 /* Don't store the first key, it's {0,0,0}. */
584 data->keys = xmalloc (data->nkeys * sizeof (data->keys[0]));
585 for (i = 0; i < data->nkeys; i++)
587 data->keys[i].name = s->keys[i + 1].name;
588 data->keys[i].type = s->keys[i + 1].type;
590 qsort (data->keys, data->nkeys, sizeof (data->keys[0]), key_cmp);
593 data->name = strdup (name);