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
26 #include "poolid_private.h"
30 #define IDARRAY_BLOCK 4095
39 repo_create(Pool *pool, const char *name)
43 pool_freewhatprovides(pool);
44 repo = (Repo *)solv_calloc(1, sizeof(*repo));
45 pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
46 pool->repos[pool->nrepos++] = repo;
47 repo->repoid = pool->nrepos;
48 repo->name = name ? strdup(name) : 0;
50 repo->start = pool->nsolvables;
51 repo->end = pool->nsolvables;
57 repo_freedata(Repo *repo)
60 for (i = 0; i < repo->nrepodata; i++)
61 repodata_freedata(repo->repodata + i);
62 solv_free(repo->repodata);
63 solv_free(repo->idarraydata);
64 solv_free(repo->rpmdbid);
65 solv_free(repo->lastidhash);
66 solv_free((char *)repo->name);
70 /* delete all solvables and repodata blocks from this repo */
73 repo_empty(Repo *repo, int reuseids)
75 Pool *pool = repo->pool;
79 pool_freewhatprovides(pool);
80 if (reuseids && repo->end == pool->nsolvables)
82 /* it's ok to reuse the ids. As this is the last repo, we can
83 just shrink the solvable array */
84 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
87 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
89 /* zero out (i.e. free) solvables belonging to this repo */
90 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
92 memset(s, 0, sizeof(*s));
95 /* free all data belonging to this repo */
96 repo->idarraydata = solv_free(repo->idarraydata);
97 repo->idarraysize = 0;
99 repo->rpmdbid = solv_free(repo->rpmdbid);
100 for (i = 0; i < repo->nrepodata; i++)
101 repodata_freedata(repo->repodata + i);
102 solv_free(repo->repodata);
108 * remove repo from pool, delete solvables
113 repo_free(Repo *repo, int reuseids)
115 Pool *pool = repo->pool;
118 if (repo == pool->installed)
120 repo_empty(repo, reuseids);
121 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
122 if (pool->repos[i] == repo)
124 if (i == pool->nrepos) /* repo not in pool, return */
126 if (i < pool->nrepos - 1)
128 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
130 for (; i < pool->nrepos - 1; i++)
131 pool->repos[i]->repoid = i + 1;
138 repo_freeallrepos(Pool *pool, int reuseids)
142 pool_freewhatprovides(pool);
143 for (i = 0; i < pool->nrepos; i++)
144 repo_freedata(pool->repos[i]);
145 pool->repos = solv_free(pool->repos);
147 /* the first two solvables don't belong to a repo */
148 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
151 Id repo_add_solvable(Repo *repo)
153 Id p = pool_add_solvable(repo->pool);
154 if (!repo->start || repo->start == repo->end)
155 repo->start = repo->end = p;
156 /* warning: sidedata must be extended before adapting start/end */
158 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
161 if (p + 1 > repo->end)
164 repo->pool->solvables[p].repo = repo;
168 Id repo_add_solvable_block(Repo *repo, int count)
174 p = pool_add_solvable_block(repo->pool, count);
175 if (!repo->start || repo->start == repo->end)
176 repo->start = repo->end = p;
177 /* warning: sidedata must be extended before adapting start/end */
179 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
182 if (p + count > repo->end)
183 repo->end = p + count;
184 repo->nsolvables += count;
185 for (s = repo->pool->solvables + p; count--; s++)
190 void repo_free_solvable(Repo *repo, Id p, int reuseids)
192 repo_free_solvable_block(repo, p, 1, reuseids);
195 void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
200 if (start + count == repo->end)
202 repo->nsolvables -= count;
203 for (s = repo->pool->solvables + start, i = count; i--; s++)
205 pool_free_solvable_block(repo->pool, start, count, reuseids);
206 FOR_REPODATAS(repo, i, data)
207 if (data->end > repo->end)
208 repodata_shrink(data, repo->end);
212 /* repository sidedata is solvable data allocated on demand.
213 * It is used for data that is normally not present
214 * in the solvable like the rpmdbid.
215 * The solvable allocation funcions need to make sure that
216 * the sidedata gets extended if new solvables get added.
219 #define REPO_SIDEDATA_BLOCK 63
222 repo_sidedata_create(Repo *repo, size_t size)
224 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
228 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
230 int n = repo->end - repo->start;
233 int d = repo->start - p;
234 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
235 memmove((char *)b + d * size, b, n * size);
236 memset(b, 0, d * size);
239 if (p + count > repo->end)
241 int d = p + count - repo->end;
242 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
243 memset((char *)b + n * size, 0, d * size);
249 * add Id to idarraydata used to store dependencies
250 * olddeps: old array offset to extend
251 * returns new array offset
255 repo_addid(Repo *repo, Offset olddeps, Id id)
261 idarray = repo->idarraydata;
262 idarraysize = repo->idarraysize;
264 if (!idarray) /* alloc idarray if not done yet */
267 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
272 if (!olddeps) /* no deps yet */
274 olddeps = idarraysize;
275 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
277 else if (olddeps == repo->lastoff) /* extend at end */
279 else /* can't extend, copy old */
282 olddeps = idarraysize;
283 for (; idarray[i]; i++)
285 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
286 idarray[idarraysize++] = idarray[i];
288 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
291 idarray[idarraysize++] = id; /* insert Id into array */
292 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
293 idarray[idarraysize++] = 0; /* ensure NULL termination */
295 repo->idarraydata = idarray;
296 repo->idarraysize = idarraysize;
297 repo->lastoff = olddeps;
302 #define REPO_ADDID_DEP_HASHTHRES 64
303 #define REPO_ADDID_DEP_HASHMIN 128
306 * Optimization for packages with an excessive amount of provides/requires:
307 * if the number of deps exceed a threshold, we build a hash of the already
311 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
330 /* maintain hash and lastmarkerpos */
331 if (repo->lastidhash_idarraysize != repo->idarraysize || size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
333 repo->lastmarkerpos = 0;
334 if (size * 2 > repo->lastidhash_mask)
336 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
337 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
339 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
340 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
342 h = oid & repo->lastidhash_mask;
343 hh = HASHCHAIN_START;
344 while (repo->lastidhash[h] != 0)
345 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
346 repo->lastidhash[h] = oid;
347 if (marker && oid == marker)
348 repo->lastmarkerpos = oidp - repo->idarraydata;
350 repo->lastmarker = marker;
351 repo->lastidhash_idarraysize = repo->idarraysize;
354 /* check the hash! */
355 h = id & repo->lastidhash_mask;
356 hh = HASHCHAIN_START;
357 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
358 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
359 /* put new element in hash */
361 repo->lastidhash[h] = id;
362 else if (marker == SOLVABLE_FILEMARKER)
364 if (marker && !before && !repo->lastmarkerpos)
366 /* we have to add the marker first */
367 repo->lastmarkerpos = repo->idarraysize - 1;
368 olddeps = repo_addid(repo, olddeps, marker);
369 /* now put marker in hash */
370 h = marker & repo->lastidhash_mask;
371 hh = HASHCHAIN_START;
372 while (repo->lastidhash[h] != 0)
373 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
374 repo->lastidhash[h] = marker;
375 repo->lastidhash_idarraysize = repo->idarraysize;
379 /* new entry, insert in correct position */
380 if (marker && before && repo->lastmarkerpos)
382 /* need to add it before the marker */
383 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
384 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
385 repo->idarraydata[repo->lastmarkerpos++] = id;
389 /* just append it to the end */
390 olddeps = repo_addid(repo, olddeps, id);
392 repo->lastidhash_idarraysize = repo->idarraysize;
395 /* we already have it in the hash */
396 if (!marker || before)
398 /* check if it is in the correct half */
399 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
402 /* nope, copy it over */
403 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
407 return olddeps; /* should not happen */
408 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
409 repo->idarraydata[repo->idarraysize - 2] = id;
410 repo->lastmarkerpos--; /* marker has been moved */
415 * add dependency (as Id) to repo, also unifies dependencies
416 * olddeps = offset into idarraydata
417 * marker= 0 for normal dep
418 * marker > 0 add dep after marker
419 * marker < 0 add dep before -marker
420 * returns new start of dependency array
423 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
425 Id oid, *oidp, *markerp;
431 olddeps = repo_addid(repo, olddeps, marker);
432 return repo_addid(repo, olddeps, id);
435 /* check if we should use the hash optimization */
436 if (olddeps == repo->lastoff)
438 int size = repo->idarraysize - 1 - repo->lastoff;
439 if (size >= REPO_ADDID_DEP_HASHTHRES)
440 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
457 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
460 return repo_addid(repo, olddeps, id);
464 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
474 if (markerp || before || marker == SOLVABLE_FILEMARKER)
476 /* we found it, but in the first half */
478 for (; (oid = *oidp) != 0; oidp++)
483 /* no marker in array yet */
486 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
488 return repo_addid(repo, olddeps, id);
492 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
496 /* id not yet in array */
497 if (!before && !markerp)
498 olddeps = repo_addid(repo, olddeps, marker);
499 else if (before && markerp)
504 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
507 return repo_addid(repo, olddeps, id);
513 * make space for 'num' more dependencies
514 * returns new start of dependency array
516 * reserved ids will always begin at offset idarraysize
520 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
522 num++; /* room for trailing ID_NULL */
524 if (!repo->idarraysize) /* ensure buffer space */
526 repo->idarraysize = 1;
527 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
528 repo->idarraydata[0] = 0;
533 if (olddeps && olddeps != repo->lastoff) /* if not appending */
535 /* can't insert into idarray, this would invalidate all 'larger' offsets
536 * so create new space at end and move existing deps there.
537 * Leaving 'hole' at old position.
543 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
545 count = idend - idstart - 1 + num; /* new size */
547 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
548 /* move old deps to end */
549 olddeps = repo->lastoff = repo->idarraysize;
550 memcpy(repo->idarraydata + olddeps, idstart, count - num);
551 repo->idarraysize = olddeps + count - num;
556 if (olddeps) /* appending */
560 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
562 /* appending or new */
563 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
565 return repo->lastoff;
571 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
573 Pool *pool = repo->pool;
575 char buf[1024], *p, *dep;
580 for (i = provides; repo->idarraydata[i]; i++)
582 id = repo->idarraydata[i];
585 dep = (char *)pool_id2str(pool, id);
586 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
589 strcpy(buf + 2, dep);
591 if ((p = strchr(dep, ':')) != 0 && p != dep)
594 idp = pool_str2id(pool, dep, 1);
598 while ((p = strchr(dep, ';')) != 0)
607 strncpy(dep - 9, "language:", 9);
608 idl = pool_str2id(pool, dep - 9, 1);
610 idl = pool_str2id(pool, dep, 1);
611 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
614 id = pool_rel2id(pool, id, idl, REL_OR, 1);
619 if (dep[0] && dep[1])
621 for (p = dep; *p && *p != ')'; p++)
625 strncpy(dep - 9, "language:", 9);
626 idl = pool_str2id(pool, dep - 9, 1);
628 idl = pool_str2id(pool, dep, 1);
629 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
632 id = pool_rel2id(pool, id, idl, REL_OR, 1);
637 id = pool_rel2id(pool, idp, id, REL_AND, 1);
639 supplements = repo_addid_dep(repo, supplements, id, 0);
641 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
646 idp = pool_str2id(pool, buf, 1);
647 /* strip trailing slashes */
649 while (l > 1 && p[l - 1] == '/')
651 id = pool_str2id(pool, p, 1);
652 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
653 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
654 supplements = repo_addid_dep(repo, supplements, id, 0);
660 for (i = supplements; repo->idarraydata[i]; i++)
662 id = repo->idarraydata[i];
665 dep = (char *)pool_id2str(pool, id);
666 if (!strncmp(dep, "system:modalias(", 16))
668 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
671 p = strchr(buf + 9, ':');
672 if (p && p != buf + 9 && strchr(p + 1, ':'))
675 idp = pool_str2id(pool, buf + 9, 1);
676 p[strlen(p) - 1] = 0;
677 id = pool_str2id(pool, p, 1);
678 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
679 id = pool_rel2id(pool, idp, id, REL_AND, 1);
684 p[strlen(p) - 1] = 0;
685 id = pool_str2id(pool, p, 1);
686 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
689 repo->idarraydata[i] = id;
691 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
696 while ((p = strchr(dep, ':')) != 0)
704 idp = pool_str2id(pool, dep, 1);
706 id = pool_rel2id(pool, id, idp, REL_AND, 1);
711 if (dep[0] && dep[1])
713 dep[strlen(dep) - 1] = 0;
714 idp = pool_str2id(pool, dep, 1);
716 id = pool_rel2id(pool, id, idp, REL_AND, 1);
721 repo->idarraydata[i] = id;
723 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
725 strcpy(buf, dep + 11);
726 if ((p = strrchr(buf, ')')) != 0)
728 id = pool_str2id(pool, buf, 1);
729 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
730 repo->idarraydata[i] = id;
734 if (freshens && repo->idarraydata[freshens])
736 Id idsupp = 0, idfresh = 0;
739 for (i = supplements; repo->idarraydata[i]; i++)
742 idsupp = repo->idarraydata[i];
744 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
746 for (i = freshens; repo->idarraydata[i]; i++)
749 idfresh = repo->idarraydata[i];
751 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
756 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
757 supplements = repo_addid_dep(repo, 0, idsupp, 0);
763 repo_fix_conflicts(Repo *repo, Offset conflicts)
765 char buf[1024], *p, *dep;
766 Pool *pool = repo->pool;
772 for (i = conflicts; repo->idarraydata[i]; i++)
774 id = repo->idarraydata[i];
777 dep = (char *)pool_id2str(pool, id);
778 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
780 strcpy(buf, dep + 15);
781 if ((p = strchr(buf, ')')) != 0)
783 id = pool_str2id(pool, buf, 1);
784 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
785 repo->idarraydata[i] = id;
797 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
802 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
804 struct matchdata *md = cbdata;
806 if (md->matcher.match)
808 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
810 if (!datamatcher_match(&md->matcher, kv->str))
813 md->stop = md->callback(md->callback_data, s, data, key, kv);
818 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
819 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
820 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
821 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
822 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
823 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
824 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
825 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
826 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
827 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
828 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
829 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
830 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
831 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
835 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
840 for (; *ida && !md->stop; ida++)
843 kv.eof = ida[1] ? 0 : 1;
844 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
850 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
853 Pool *pool = repo->pool;
862 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
865 repo_search_md(repo, p, keyname, md);
866 if (md->stop > SEARCH_NEXT_SOLVABLE)
872 /* The callback only supports solvables, so we can't iterate over the
876 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
878 s = pool->solvables + p;
886 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
888 if (keyname || md->stop > SEARCH_NEXT_KEY)
894 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
896 if (keyname || md->stop > SEARCH_NEXT_KEY)
902 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
904 if (keyname || md->stop > SEARCH_NEXT_KEY)
906 case SOLVABLE_VENDOR:
910 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
912 if (keyname || md->stop > SEARCH_NEXT_KEY)
914 case SOLVABLE_PROVIDES:
916 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
917 if (keyname || md->stop > SEARCH_NEXT_KEY)
919 case SOLVABLE_OBSOLETES:
921 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
922 if (keyname || md->stop > SEARCH_NEXT_KEY)
924 case SOLVABLE_CONFLICTS:
926 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
927 if (keyname || md->stop > SEARCH_NEXT_KEY)
929 case SOLVABLE_REQUIRES:
931 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
932 if (keyname || md->stop > SEARCH_NEXT_KEY)
934 case SOLVABLE_RECOMMENDS:
936 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
937 if (keyname || md->stop > SEARCH_NEXT_KEY)
939 case SOLVABLE_SUPPLEMENTS:
941 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
942 if (keyname || md->stop > SEARCH_NEXT_KEY)
944 case SOLVABLE_SUGGESTS:
946 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
947 if (keyname || md->stop > SEARCH_NEXT_KEY)
949 case SOLVABLE_ENHANCES:
951 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
952 if (keyname || md->stop > SEARCH_NEXT_KEY)
957 kv.num = repo->rpmdbid[p - repo->start];
958 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
960 if (keyname || md->stop > SEARCH_NEXT_KEY)
968 FOR_REPODATAS(repo, i, data)
970 if (p < data->start || p >= data->end)
972 if (keyname && !repodata_precheck_keyname(data, keyname))
974 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
976 /* do not search filelist extensions */
977 if (data->state != REPODATA_AVAILABLE)
979 for (j = 1; j < data->nkeys; j++)
980 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
982 if (j == data->nkeys)
985 if (data->state == REPODATA_STUB)
989 for (j = 1; j < data->nkeys; j++)
990 if (keyname == data->keys[j].name)
992 if (j == data->nkeys)
996 if (data->loadcallback)
997 data->loadcallback(data);
999 data->state = REPODATA_ERROR;
1001 if (data->state == REPODATA_ERROR)
1003 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1004 if (md->stop > SEARCH_NEXT_KEY)
1010 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)
1012 struct matchdata md;
1014 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1016 memset(&md, 0, sizeof(md));
1017 md.pool = repo->pool;
1019 md.callback = callback;
1020 md.callback_data = cbdata;
1022 datamatcher_init(&md.matcher, match, flags);
1023 repo_search_md(repo, p, keyname, &md);
1025 datamatcher_free(&md.matcher);
1029 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1031 Pool *pool = repo->pool;
1041 return pool_id2str(pool, pool->solvables[entry].name);
1043 return pool_id2str(pool, pool->solvables[entry].arch);
1045 return pool_id2str(pool, pool->solvables[entry].evr);
1046 case SOLVABLE_VENDOR:
1047 return pool_id2str(pool, pool->solvables[entry].vendor);
1050 FOR_REPODATAS(repo, i, data)
1052 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1054 if (!repodata_precheck_keyname(data, keyname))
1056 str = repodata_lookup_str(data, entry, keyname);
1059 if (repodata_lookup_type(data, entry, keyname))
1067 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
1075 if (keyname == RPM_RPMDBID)
1077 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1078 return repo->rpmdbid[entry - repo->start];
1082 FOR_REPODATAS(repo, i, data)
1084 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1086 if (!repodata_precheck_keyname(data, keyname))
1088 if (repodata_lookup_num(data, entry, keyname, &value))
1090 if (repodata_lookup_type(data, entry, keyname))
1097 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1108 return repo->pool->solvables[entry].name;
1110 return repo->pool->solvables[entry].arch;
1112 return repo->pool->solvables[entry].evr;
1113 case SOLVABLE_VENDOR:
1114 return repo->pool->solvables[entry].vendor;
1117 FOR_REPODATAS(repo, i, data)
1119 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1121 if (!repodata_precheck_keyname(data, keyname))
1123 id = repodata_lookup_id(data, entry, keyname);
1125 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1126 if (repodata_lookup_type(data, entry, keyname))
1133 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1139 for (p = repo->idarraydata + off; *p; p++)
1145 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1153 case SOLVABLE_PROVIDES:
1154 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1155 case SOLVABLE_OBSOLETES:
1156 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1157 case SOLVABLE_CONFLICTS:
1158 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1159 case SOLVABLE_REQUIRES:
1160 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1161 case SOLVABLE_RECOMMENDS:
1162 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1163 case SOLVABLE_SUGGESTS:
1164 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1165 case SOLVABLE_SUPPLEMENTS:
1166 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1167 case SOLVABLE_ENHANCES:
1168 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1171 FOR_REPODATAS(repo, i, data)
1173 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1175 if (!repodata_precheck_keyname(data, keyname))
1177 if (repodata_lookup_idarray(data, entry, keyname, q))
1179 if (data->localpool)
1181 for (i = 0; i < q->count; i++)
1182 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1186 if (repodata_lookup_type(data, entry, keyname))
1193 const unsigned char *
1194 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1198 const unsigned char *chk;
1200 FOR_REPODATAS(repo, i, data)
1202 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1204 if (!repodata_precheck_keyname(data, keyname))
1206 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1209 if (repodata_lookup_type(data, entry, keyname))
1217 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1219 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1220 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1224 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1230 FOR_REPODATAS(repo, i, data)
1232 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1234 if (!repodata_precheck_keyname(data, keyname))
1236 type = repodata_lookup_type(data, entry, keyname);
1238 return type == REPOKEY_TYPE_VOID;
1244 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1250 FOR_REPODATAS(repo, i, data)
1252 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1254 if (!repodata_precheck_keyname(data, keyname))
1256 type = repodata_lookup_type(data, entry, keyname);
1258 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1263 /***********************************************************************/
1266 repo_add_repodata(Repo *repo, int flags)
1269 if ((flags & REPO_USE_LOADING) != 0)
1271 for (i = repo->nrepodata - 1; i >= 0; i--)
1272 if (repo->repodata[i].state == REPODATA_LOADING)
1274 Repodata *data = repo->repodata + i;
1276 /* hack: we mis-use REPO_REUSE_REPODATA here */
1277 if (!(flags & REPO_REUSE_REPODATA))
1278 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1281 return 0; /* must not create a new repodata! */
1283 if ((flags & REPO_REUSE_REPODATA) != 0)
1285 for (i = repo->nrepodata - 1; i >= 0; i--)
1286 if (repo->repodata[i].state != REPODATA_STUB)
1287 return repo->repodata + i;
1289 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1293 repo_last_repodata(Repo *repo)
1296 for (i = repo->nrepodata - 1; i >= 0; i--)
1297 if (repo->repodata[i].state != REPODATA_STUB)
1298 return repo->repodata + i;
1299 return repo_add_repodata(repo, 0);
1303 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1311 repo->pool->solvables[p].name = id;
1314 repo->pool->solvables[p].arch = id;
1317 repo->pool->solvables[p].evr = id;
1319 case SOLVABLE_VENDOR:
1320 repo->pool->solvables[p].vendor = id;
1324 data = repo_last_repodata(repo);
1325 if (data->localpool)
1326 id = repodata_localize_id(data, id, 1);
1327 repodata_set_id(data, p, keyname, id);
1331 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1336 if (keyname == RPM_RPMDBID)
1339 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1340 repo->rpmdbid[p] = num;
1344 data = repo_last_repodata(repo);
1345 repodata_set_num(data, p, keyname, num);
1349 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1359 case SOLVABLE_VENDOR:
1360 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1364 data = repo_last_repodata(repo);
1365 repodata_set_str(data, p, keyname, str);
1369 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1379 case SOLVABLE_VENDOR:
1380 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1384 data = repo_last_repodata(repo);
1385 repodata_set_poolstr(data, p, keyname, str);
1389 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1391 Repodata *data = repo_last_repodata(repo);
1392 repodata_add_poolstr_array(data, p, keyname, str);
1396 repo_internalize(Repo *repo)
1401 FOR_REPODATAS(repo, i, data)
1402 if (data->attrs || data->xattrs)
1403 repodata_internalize(data);
1407 repo_disable_paging(Repo *repo)
1412 FOR_REPODATAS(repo, i, data)
1413 repodata_disable_paging(data);
1417 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: