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 if (size * 2 > repo->lastidhash_mask)
335 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
336 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
338 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
339 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
341 h = oid & repo->lastidhash_mask;
342 hh = HASHCHAIN_START;
343 while (repo->lastidhash[h] != 0)
344 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
345 repo->lastidhash[h] = oid;
346 if (marker && oid == marker)
347 repo->lastmarkerpos = oidp - repo->idarraydata;
349 repo->lastmarker = marker;
350 repo->lastidhash_idarraysize = repo->idarraysize;
353 /* check the hash! */
354 h = id & repo->lastidhash_mask;
355 hh = HASHCHAIN_START;
356 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
357 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
358 /* put new element in hash */
360 repo->lastidhash[h] = id;
361 else if (marker == SOLVABLE_FILEMARKER)
363 if (marker && !before && !repo->lastmarkerpos)
365 /* we have to add the marker first */
366 repo->lastmarkerpos = repo->idarraysize - 1;
367 olddeps = repo_addid(repo, olddeps, marker);
368 /* now put marker in hash */
369 h = marker & repo->lastidhash_mask;
370 hh = HASHCHAIN_START;
371 while (repo->lastidhash[h] != 0)
372 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
373 repo->lastidhash[h] = marker;
374 repo->lastidhash_idarraysize = repo->idarraysize;
378 /* new entry, insert in correct position */
379 if (marker && before && repo->lastmarkerpos)
381 /* need to add it before the marker */
382 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
383 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
384 repo->idarraydata[repo->lastmarkerpos++] = id;
388 /* just append it to the end */
389 olddeps = repo_addid(repo, olddeps, id);
391 repo->lastidhash_idarraysize = repo->idarraysize;
394 /* we already have it in the hash */
395 if (!marker || before)
397 /* check if it is in the correct half */
398 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
401 /* nope, copy it over */
402 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
406 return olddeps; /* should not happen */
407 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
408 repo->idarraydata[repo->idarraysize - 2] = id;
409 repo->lastmarkerpos--; /* marker has been moved */
414 * add dependency (as Id) to repo, also unifies dependencies
415 * olddeps = offset into idarraydata
416 * marker= 0 for normal dep
417 * marker > 0 add dep after marker
418 * marker < 0 add dep before -marker
419 * returns new start of dependency array
422 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
424 Id oid, *oidp, *markerp;
430 olddeps = repo_addid(repo, olddeps, marker);
431 return repo_addid(repo, olddeps, id);
434 /* check if we should use the hash optimization */
435 if (olddeps == repo->lastoff)
437 int size = repo->idarraysize - 1 - repo->lastoff;
438 if (size >= REPO_ADDID_DEP_HASHTHRES)
439 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
456 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
459 return repo_addid(repo, olddeps, id);
463 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
473 if (markerp || before || marker == SOLVABLE_FILEMARKER)
475 /* we found it, but in the first half */
477 for (; (oid = *oidp) != 0; oidp++)
482 /* no marker in array yet */
485 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
487 return repo_addid(repo, olddeps, id);
491 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
495 /* id not yet in array */
496 if (!before && !markerp)
497 olddeps = repo_addid(repo, olddeps, marker);
498 else if (before && markerp)
503 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
506 return repo_addid(repo, olddeps, id);
512 * make space for 'num' more dependencies
513 * returns new start of dependency array
515 * reserved ids will always begin at offset idarraysize
519 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
521 num++; /* room for trailing ID_NULL */
523 if (!repo->idarraysize) /* ensure buffer space */
525 repo->idarraysize = 1;
526 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
527 repo->idarraydata[0] = 0;
532 if (olddeps && olddeps != repo->lastoff) /* if not appending */
534 /* can't insert into idarray, this would invalidate all 'larger' offsets
535 * so create new space at end and move existing deps there.
536 * Leaving 'hole' at old position.
542 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
544 count = idend - idstart - 1 + num; /* new size */
546 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
547 /* move old deps to end */
548 olddeps = repo->lastoff = repo->idarraysize;
549 memcpy(repo->idarraydata + olddeps, idstart, count - num);
550 repo->idarraysize = olddeps + count - num;
555 if (olddeps) /* appending */
559 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
561 /* appending or new */
562 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
564 return repo->lastoff;
570 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
572 Pool *pool = repo->pool;
574 char buf[1024], *p, *dep;
579 for (i = provides; repo->idarraydata[i]; i++)
581 id = repo->idarraydata[i];
584 dep = (char *)pool_id2str(pool, id);
585 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
588 strcpy(buf + 2, dep);
590 if ((p = strchr(dep, ':')) != 0 && p != dep)
593 idp = pool_str2id(pool, dep, 1);
597 while ((p = strchr(dep, ';')) != 0)
606 strncpy(dep - 9, "language:", 9);
607 idl = pool_str2id(pool, dep - 9, 1);
609 idl = pool_str2id(pool, dep, 1);
610 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
613 id = pool_rel2id(pool, id, idl, REL_OR, 1);
618 if (dep[0] && dep[1])
620 for (p = dep; *p && *p != ')'; p++)
624 strncpy(dep - 9, "language:", 9);
625 idl = pool_str2id(pool, dep - 9, 1);
627 idl = pool_str2id(pool, dep, 1);
628 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
631 id = pool_rel2id(pool, id, idl, REL_OR, 1);
636 id = pool_rel2id(pool, idp, id, REL_AND, 1);
638 supplements = repo_addid_dep(repo, supplements, id, 0);
640 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
645 idp = pool_str2id(pool, buf, 1);
646 /* strip trailing slashes */
648 while (l > 1 && p[l - 1] == '/')
650 id = pool_str2id(pool, p, 1);
651 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
652 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
653 supplements = repo_addid_dep(repo, supplements, id, 0);
659 for (i = supplements; repo->idarraydata[i]; i++)
661 id = repo->idarraydata[i];
664 dep = (char *)pool_id2str(pool, id);
665 if (!strncmp(dep, "system:modalias(", 16))
667 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
670 p = strchr(buf + 9, ':');
671 if (p && p != buf + 9 && strchr(p + 1, ':'))
674 idp = pool_str2id(pool, buf + 9, 1);
675 p[strlen(p) - 1] = 0;
676 id = pool_str2id(pool, p, 1);
677 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
678 id = pool_rel2id(pool, idp, id, REL_AND, 1);
683 p[strlen(p) - 1] = 0;
684 id = pool_str2id(pool, p, 1);
685 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
688 repo->idarraydata[i] = id;
690 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
695 while ((p = strchr(dep, ':')) != 0)
703 idp = pool_str2id(pool, dep, 1);
705 id = pool_rel2id(pool, id, idp, REL_AND, 1);
710 if (dep[0] && dep[1])
712 dep[strlen(dep) - 1] = 0;
713 idp = pool_str2id(pool, dep, 1);
715 id = pool_rel2id(pool, id, idp, REL_AND, 1);
720 repo->idarraydata[i] = id;
722 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
724 strcpy(buf, dep + 11);
725 if ((p = strrchr(buf, ')')) != 0)
727 id = pool_str2id(pool, buf, 1);
728 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
729 repo->idarraydata[i] = id;
733 if (freshens && repo->idarraydata[freshens])
735 Id idsupp = 0, idfresh = 0;
738 for (i = supplements; repo->idarraydata[i]; i++)
741 idsupp = repo->idarraydata[i];
743 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
745 for (i = freshens; repo->idarraydata[i]; i++)
748 idfresh = repo->idarraydata[i];
750 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
755 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
756 supplements = repo_addid_dep(repo, 0, idsupp, 0);
762 repo_fix_conflicts(Repo *repo, Offset conflicts)
764 char buf[1024], *p, *dep;
765 Pool *pool = repo->pool;
771 for (i = conflicts; repo->idarraydata[i]; i++)
773 id = repo->idarraydata[i];
776 dep = (char *)pool_id2str(pool, id);
777 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
779 strcpy(buf, dep + 15);
780 if ((p = strchr(buf, ')')) != 0)
782 id = pool_str2id(pool, buf, 1);
783 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
784 repo->idarraydata[i] = id;
796 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
801 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
803 struct matchdata *md = cbdata;
805 if (md->matcher.match)
807 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
809 if (!datamatcher_match(&md->matcher, kv->str))
812 md->stop = md->callback(md->callback_data, s, data, key, kv);
817 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
818 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
819 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
820 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
821 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
822 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
823 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
824 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
825 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
826 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
827 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
828 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
829 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
830 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
834 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
839 for (; *ida && !md->stop; ida++)
842 kv.eof = ida[1] ? 0 : 1;
843 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
849 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
852 Pool *pool = repo->pool;
861 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
864 repo_search_md(repo, p, keyname, md);
865 if (md->stop > SEARCH_NEXT_SOLVABLE)
871 /* The callback only supports solvables, so we can't iterate over the
875 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
877 s = pool->solvables + p;
885 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
887 if (keyname || md->stop > SEARCH_NEXT_KEY)
893 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
895 if (keyname || md->stop > SEARCH_NEXT_KEY)
901 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
903 if (keyname || md->stop > SEARCH_NEXT_KEY)
905 case SOLVABLE_VENDOR:
909 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
911 if (keyname || md->stop > SEARCH_NEXT_KEY)
913 case SOLVABLE_PROVIDES:
915 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
916 if (keyname || md->stop > SEARCH_NEXT_KEY)
918 case SOLVABLE_OBSOLETES:
920 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
921 if (keyname || md->stop > SEARCH_NEXT_KEY)
923 case SOLVABLE_CONFLICTS:
925 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
926 if (keyname || md->stop > SEARCH_NEXT_KEY)
928 case SOLVABLE_REQUIRES:
930 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
931 if (keyname || md->stop > SEARCH_NEXT_KEY)
933 case SOLVABLE_RECOMMENDS:
935 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
936 if (keyname || md->stop > SEARCH_NEXT_KEY)
938 case SOLVABLE_SUPPLEMENTS:
940 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
941 if (keyname || md->stop > SEARCH_NEXT_KEY)
943 case SOLVABLE_SUGGESTS:
945 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
946 if (keyname || md->stop > SEARCH_NEXT_KEY)
948 case SOLVABLE_ENHANCES:
950 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
951 if (keyname || md->stop > SEARCH_NEXT_KEY)
956 kv.num = repo->rpmdbid[p - repo->start];
957 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
959 if (keyname || md->stop > SEARCH_NEXT_KEY)
967 FOR_REPODATAS(repo, i, data)
969 if (p < data->start || p >= data->end)
971 if (keyname && !repodata_precheck_keyname(data, keyname))
973 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
975 /* do not search filelist extensions */
976 if (data->state != REPODATA_AVAILABLE)
978 for (j = 1; j < data->nkeys; j++)
979 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
981 if (j == data->nkeys)
984 if (data->state == REPODATA_STUB)
988 for (j = 1; j < data->nkeys; j++)
989 if (keyname == data->keys[j].name)
991 if (j == data->nkeys)
995 if (data->loadcallback)
996 data->loadcallback(data);
998 data->state = REPODATA_ERROR;
1000 if (data->state == REPODATA_ERROR)
1002 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1003 if (md->stop > SEARCH_NEXT_KEY)
1009 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)
1011 struct matchdata md;
1013 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1015 memset(&md, 0, sizeof(md));
1016 md.pool = repo->pool;
1018 md.callback = callback;
1019 md.callback_data = cbdata;
1021 datamatcher_init(&md.matcher, match, flags);
1022 repo_search_md(repo, p, keyname, &md);
1024 datamatcher_free(&md.matcher);
1028 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1030 Pool *pool = repo->pool;
1040 return pool_id2str(pool, pool->solvables[entry].name);
1042 return pool_id2str(pool, pool->solvables[entry].arch);
1044 return pool_id2str(pool, pool->solvables[entry].evr);
1045 case SOLVABLE_VENDOR:
1046 return pool_id2str(pool, pool->solvables[entry].vendor);
1049 FOR_REPODATAS(repo, i, data)
1051 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1053 if (!repodata_precheck_keyname(data, keyname))
1055 str = repodata_lookup_str(data, entry, keyname);
1058 if (repodata_lookup_type(data, entry, keyname))
1066 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
1074 if (keyname == RPM_RPMDBID)
1076 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1077 return repo->rpmdbid[entry - repo->start];
1081 FOR_REPODATAS(repo, i, data)
1083 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1085 if (!repodata_precheck_keyname(data, keyname))
1087 if (repodata_lookup_num(data, entry, keyname, &value))
1089 if (repodata_lookup_type(data, entry, keyname))
1096 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1107 return repo->pool->solvables[entry].name;
1109 return repo->pool->solvables[entry].arch;
1111 return repo->pool->solvables[entry].evr;
1112 case SOLVABLE_VENDOR:
1113 return repo->pool->solvables[entry].vendor;
1116 FOR_REPODATAS(repo, i, data)
1118 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1120 if (!repodata_precheck_keyname(data, keyname))
1122 id = repodata_lookup_id(data, entry, keyname);
1124 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1125 if (repodata_lookup_type(data, entry, keyname))
1132 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1138 for (p = repo->idarraydata + off; *p; p++)
1144 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1152 case SOLVABLE_PROVIDES:
1153 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1154 case SOLVABLE_OBSOLETES:
1155 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1156 case SOLVABLE_CONFLICTS:
1157 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1158 case SOLVABLE_REQUIRES:
1159 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1160 case SOLVABLE_RECOMMENDS:
1161 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1162 case SOLVABLE_SUGGESTS:
1163 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1164 case SOLVABLE_SUPPLEMENTS:
1165 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1166 case SOLVABLE_ENHANCES:
1167 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1170 FOR_REPODATAS(repo, i, data)
1172 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1174 if (!repodata_precheck_keyname(data, keyname))
1176 if (repodata_lookup_idarray(data, entry, keyname, q))
1178 if (data->localpool)
1180 for (i = 0; i < q->count; i++)
1181 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1185 if (repodata_lookup_type(data, entry, keyname))
1192 const unsigned char *
1193 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1197 const unsigned char *chk;
1199 FOR_REPODATAS(repo, i, data)
1201 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1203 if (!repodata_precheck_keyname(data, keyname))
1205 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1208 if (repodata_lookup_type(data, entry, keyname))
1216 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1218 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1219 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1223 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1229 FOR_REPODATAS(repo, i, data)
1231 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1233 if (!repodata_precheck_keyname(data, keyname))
1235 type = repodata_lookup_type(data, entry, keyname);
1237 return type == REPOKEY_TYPE_VOID;
1243 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1249 FOR_REPODATAS(repo, i, data)
1251 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1253 if (!repodata_precheck_keyname(data, keyname))
1255 type = repodata_lookup_type(data, entry, keyname);
1257 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1262 /***********************************************************************/
1265 repo_add_repodata(Repo *repo, int flags)
1268 if ((flags & REPO_USE_LOADING) != 0)
1270 for (i = repo->nrepodata - 1; i >= 0; i--)
1271 if (repo->repodata[i].state == REPODATA_LOADING)
1273 Repodata *data = repo->repodata + i;
1275 /* hack: we mis-use REPO_REUSE_REPODATA here */
1276 if (!(flags & REPO_REUSE_REPODATA))
1277 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1280 return 0; /* must not create a new repodata! */
1282 if ((flags & REPO_REUSE_REPODATA) != 0)
1284 for (i = repo->nrepodata - 1; i >= 0; i--)
1285 if (repo->repodata[i].state != REPODATA_STUB)
1286 return repo->repodata + i;
1288 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1292 repo_last_repodata(Repo *repo)
1295 for (i = repo->nrepodata - 1; i >= 0; i--)
1296 if (repo->repodata[i].state != REPODATA_STUB)
1297 return repo->repodata + i;
1298 return repo_add_repodata(repo, 0);
1302 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1310 repo->pool->solvables[p].name = id;
1313 repo->pool->solvables[p].arch = id;
1316 repo->pool->solvables[p].evr = id;
1318 case SOLVABLE_VENDOR:
1319 repo->pool->solvables[p].vendor = id;
1323 data = repo_last_repodata(repo);
1324 if (data->localpool)
1325 id = repodata_localize_id(data, id, 1);
1326 repodata_set_id(data, p, keyname, id);
1330 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1335 if (keyname == RPM_RPMDBID)
1338 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1339 repo->rpmdbid[p] = num;
1343 data = repo_last_repodata(repo);
1344 repodata_set_num(data, p, keyname, num);
1348 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1358 case SOLVABLE_VENDOR:
1359 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1363 data = repo_last_repodata(repo);
1364 repodata_set_str(data, p, keyname, str);
1368 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1378 case SOLVABLE_VENDOR:
1379 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1383 data = repo_last_repodata(repo);
1384 repodata_set_poolstr(data, p, keyname, str);
1388 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1390 Repodata *data = repo_last_repodata(repo);
1391 repodata_add_poolstr_array(data, p, keyname, str);
1395 repo_internalize(Repo *repo)
1400 FOR_REPODATAS(repo, i, data)
1401 if (data->attrs || data->xattrs)
1402 repodata_internalize(data);
1406 repo_disable_paging(Repo *repo)
1411 FOR_REPODATAS(repo, i, data)
1412 repodata_disable_paging(data);
1416 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: