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));
47 pool->nrepos = 1; /* start with repoid 1 */
48 pool->repos = (Repo **)solv_calloc(2, sizeof(Repo *));
51 pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
52 pool->repos[pool->nrepos] = repo;
54 repo->repoid = pool->nrepos++;
55 repo->name = name ? solv_strdup(name) : 0;
57 repo->start = pool->nsolvables;
58 repo->end = pool->nsolvables;
64 repo_freedata(Repo *repo)
67 for (i = 1; i < repo->nrepodata; i++)
68 repodata_freedata(repo->repodata + i);
69 solv_free(repo->repodata);
70 solv_free(repo->idarraydata);
71 solv_free(repo->rpmdbid);
72 solv_free(repo->lastidhash);
73 solv_free((char *)repo->name);
77 /* delete all solvables and repodata blocks from this repo */
80 repo_empty(Repo *repo, int reuseids)
82 Pool *pool = repo->pool;
86 pool_freewhatprovides(pool);
87 if (reuseids && repo->end == pool->nsolvables)
89 /* it's ok to reuse the ids. As this is the last repo, we can
90 just shrink the solvable array */
91 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
94 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
96 /* zero out (i.e. free) solvables belonging to this repo */
97 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
99 memset(s, 0, sizeof(*s));
100 repo->nsolvables = 0;
102 /* free all data belonging to this repo */
103 repo->idarraydata = solv_free(repo->idarraydata);
104 repo->idarraysize = 0;
106 repo->rpmdbid = solv_free(repo->rpmdbid);
107 for (i = 1; i < repo->nrepodata; i++)
108 repodata_freedata(repo->repodata + i);
109 solv_free(repo->repodata);
115 * remove repo from pool, delete solvables
120 repo_free(Repo *repo, int reuseids)
122 Pool *pool = repo->pool;
125 if (repo == pool->installed)
127 repo_empty(repo, reuseids);
128 for (i = 1; i < pool->nrepos; i++) /* find repo in pool */
129 if (pool->repos[i] == repo)
131 if (i == pool->nrepos) /* repo not in pool, return */
133 if (i == pool->nrepos - 1 && reuseids)
142 repo_add_solvable(Repo *repo)
144 Id p = pool_add_solvable(repo->pool);
145 if (!repo->start || repo->start == repo->end)
146 repo->start = repo->end = p;
147 /* warning: sidedata must be extended before adapting start/end */
149 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
152 if (p + 1 > repo->end)
155 repo->pool->solvables[p].repo = repo;
160 repo_add_solvable_block(Repo *repo, int count)
166 p = pool_add_solvable_block(repo->pool, count);
167 if (!repo->start || repo->start == repo->end)
168 repo->start = repo->end = p;
169 /* warning: sidedata must be extended before adapting start/end */
171 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
174 if (p + count > repo->end)
175 repo->end = p + count;
176 repo->nsolvables += count;
177 for (s = repo->pool->solvables + p; count--; s++)
183 repo_free_solvable(Repo *repo, Id p, int reuseids)
185 repo_free_solvable_block(repo, p, 1, reuseids);
189 repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
194 if (start + count == repo->end)
196 repo->nsolvables -= count;
197 for (s = repo->pool->solvables + start, i = count; i--; s++)
199 pool_free_solvable_block(repo->pool, start, count, reuseids);
200 FOR_REPODATAS(repo, i, data)
201 if (data->end > repo->end)
202 repodata_shrink(data, repo->end);
206 /* repository sidedata is solvable data allocated on demand.
207 * It is used for data that is normally not present
208 * in the solvable like the rpmdbid.
209 * The solvable allocation funcions need to make sure that
210 * the sidedata gets extended if new solvables get added.
213 #define REPO_SIDEDATA_BLOCK 63
216 repo_sidedata_create(Repo *repo, size_t size)
218 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
222 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
224 int n = repo->end - repo->start;
227 int d = repo->start - p;
228 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
229 memmove((char *)b + d * size, b, n * size);
230 memset(b, 0, d * size);
233 if (p + count > repo->end)
235 int d = p + count - repo->end;
236 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
237 memset((char *)b + n * size, 0, d * size);
243 * add Id to idarraydata used to store dependencies
244 * olddeps: old array offset to extend
245 * returns new array offset
249 repo_addid(Repo *repo, Offset olddeps, Id id)
255 idarray = repo->idarraydata;
256 idarraysize = repo->idarraysize;
258 if (!idarray) /* alloc idarray if not done yet */
261 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
266 if (!olddeps) /* no deps yet */
268 olddeps = idarraysize;
269 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
271 else if (olddeps == repo->lastoff) /* extend at end */
273 else /* can't extend, copy old */
276 olddeps = idarraysize;
277 for (; idarray[i]; i++)
279 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
280 idarray[idarraysize++] = idarray[i];
282 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
285 idarray[idarraysize++] = id; /* insert Id into array */
286 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
287 idarray[idarraysize++] = 0; /* ensure NULL termination */
289 repo->idarraydata = idarray;
290 repo->idarraysize = idarraysize;
291 repo->lastoff = olddeps;
296 #define REPO_ADDID_DEP_HASHTHRES 64
297 #define REPO_ADDID_DEP_HASHMIN 128
300 * Optimization for packages with an excessive amount of provides/requires:
301 * if the number of deps exceed a threshold, we build a hash of the already
305 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
324 /* maintain hash and lastmarkerpos */
325 if (repo->lastidhash_idarraysize != repo->idarraysize || size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
327 repo->lastmarkerpos = 0;
328 if (size * 2 > repo->lastidhash_mask)
330 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
331 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
333 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
334 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
336 h = oid & repo->lastidhash_mask;
337 hh = HASHCHAIN_START;
338 while (repo->lastidhash[h] != 0)
339 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
340 repo->lastidhash[h] = oid;
341 if (marker && oid == marker)
342 repo->lastmarkerpos = oidp - repo->idarraydata;
344 repo->lastmarker = marker;
345 repo->lastidhash_idarraysize = repo->idarraysize;
348 /* check the hash! */
349 h = id & repo->lastidhash_mask;
350 hh = HASHCHAIN_START;
351 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
352 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
353 /* put new element in hash */
355 repo->lastidhash[h] = id;
356 else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
358 if (marker && !before && !repo->lastmarkerpos)
360 /* we have to add the marker first */
361 repo->lastmarkerpos = repo->idarraysize - 1;
362 olddeps = repo_addid(repo, olddeps, marker);
363 /* now put marker in hash */
364 h = marker & repo->lastidhash_mask;
365 hh = HASHCHAIN_START;
366 while (repo->lastidhash[h] != 0)
367 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
368 repo->lastidhash[h] = marker;
369 repo->lastidhash_idarraysize = repo->idarraysize;
373 /* new entry, insert in correct position */
374 if (marker && before && repo->lastmarkerpos)
376 /* need to add it before the marker */
377 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
378 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
379 repo->idarraydata[repo->lastmarkerpos++] = id;
383 /* just append it to the end */
384 olddeps = repo_addid(repo, olddeps, id);
386 repo->lastidhash_idarraysize = repo->idarraysize;
389 /* we already have it in the hash */
392 if (marker == SOLVABLE_FILEMARKER)
394 /* check if it is in the wrong half */
395 /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
396 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
401 /* yes, wrong half. copy it over */
402 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
403 repo->idarraydata[repo->lastmarkerpos++] = id;
408 /* check if it is in the correct half */
409 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
412 /* nope, copy it over */
413 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
417 return olddeps; /* should not happen */
418 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
419 repo->idarraydata[repo->idarraysize - 2] = id;
420 repo->lastmarkerpos--; /* marker has been moved */
425 * add dependency (as Id) to repo, also unifies dependencies
426 * olddeps = offset into idarraydata
427 * marker= 0 for normal dep
428 * marker > 0 add dep after marker
429 * marker < 0 add dep before -marker
430 * returns new start of dependency array
433 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
435 Id oid, *oidp, *markerp;
441 olddeps = repo_addid(repo, olddeps, marker);
442 return repo_addid(repo, olddeps, id);
445 /* check if we should use the hash optimization */
446 if (olddeps == repo->lastoff)
448 int size = repo->idarraysize - 1 - repo->lastoff;
449 if (size >= REPO_ADDID_DEP_HASHTHRES)
450 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
467 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
470 return repo_addid(repo, olddeps, id);
474 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
484 if (marker == SOLVABLE_FILEMARKER)
486 if (!markerp || !before)
488 /* we found it, but in the second half */
489 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
493 if (markerp || before)
495 /* we found it, but in the first half */
497 for (; (oid = *oidp) != 0; oidp++)
502 /* no marker in array yet */
505 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
507 return repo_addid(repo, olddeps, id);
511 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
515 /* id not yet in array */
516 if (!before && !markerp)
517 olddeps = repo_addid(repo, olddeps, marker);
518 else if (before && markerp)
523 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
526 return repo_addid(repo, olddeps, id);
532 * make space for 'num' more dependencies
533 * returns new start of dependency array
535 * reserved ids will always begin at offset idarraysize
539 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
541 num++; /* room for trailing ID_NULL */
543 if (!repo->idarraysize) /* ensure buffer space */
545 repo->idarraysize = 1;
546 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
547 repo->idarraydata[0] = 0;
552 if (olddeps && olddeps != repo->lastoff) /* if not appending */
554 /* can't insert into idarray, this would invalidate all 'larger' offsets
555 * so create new space at end and move existing deps there.
556 * Leaving 'hole' at old position.
562 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
564 count = idend - idstart - 1 + num; /* new size */
566 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
567 /* move old deps to end */
568 olddeps = repo->lastoff = repo->idarraysize;
569 memcpy(repo->idarraydata + olddeps, idstart, count - num);
570 repo->idarraysize = olddeps + count - num;
575 if (olddeps) /* appending */
579 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
581 /* appending or new */
582 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
584 return repo->lastoff;
588 /***********************************************************************/
591 * some SUSE specific fixups, should go into a separate file
595 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
597 Pool *pool = repo->pool;
599 char buf[1024], *p, *dep;
604 for (i = provides; repo->idarraydata[i]; i++)
606 id = repo->idarraydata[i];
609 dep = (char *)pool_id2str(pool, id);
610 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
613 strcpy(buf + 2, dep);
615 if ((p = strchr(dep, ':')) != 0 && p != dep)
618 idp = pool_str2id(pool, dep, 1);
622 while ((p = strchr(dep, ';')) != 0)
630 idl = pool_str2id(pool, dep, 1);
631 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
633 id = pool_rel2id(pool, id, idl, REL_OR, 1);
638 if (dep[0] && dep[1])
640 for (p = dep; *p && *p != ')'; p++)
643 idl = pool_str2id(pool, dep, 1);
644 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
646 id = pool_rel2id(pool, id, idl, REL_OR, 1);
651 id = pool_rel2id(pool, idp, id, REL_AND, 1);
653 supplements = repo_addid_dep(repo, supplements, id, 0);
655 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
660 idp = pool_str2id(pool, buf, 1);
661 /* strip trailing slashes */
663 while (l > 1 && p[l - 1] == '/')
665 id = pool_str2id(pool, p, 1);
666 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
667 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
668 supplements = repo_addid_dep(repo, supplements, id, 0);
674 for (i = supplements; repo->idarraydata[i]; i++)
676 id = repo->idarraydata[i];
679 dep = (char *)pool_id2str(pool, id);
680 if (!strncmp(dep, "system:modalias(", 16))
682 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
685 p = strchr(buf + 9, ':');
686 if (p && p != buf + 9 && strchr(p + 1, ':'))
689 idp = pool_str2id(pool, buf + 9, 1);
690 p[strlen(p) - 1] = 0;
691 id = pool_str2id(pool, p, 1);
692 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
693 id = pool_rel2id(pool, idp, id, REL_AND, 1);
698 p[strlen(p) - 1] = 0;
699 id = pool_str2id(pool, p, 1);
700 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
703 repo->idarraydata[i] = id;
705 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
710 while ((p = strchr(dep, ':')) != 0)
718 idp = pool_str2id(pool, dep, 1);
720 id = pool_rel2id(pool, id, idp, REL_AND, 1);
725 if (dep[0] && dep[1])
727 dep[strlen(dep) - 1] = 0;
728 idp = pool_str2id(pool, dep, 1);
730 id = pool_rel2id(pool, id, idp, REL_AND, 1);
735 repo->idarraydata[i] = id;
737 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
739 strcpy(buf, dep + 11);
740 if ((p = strrchr(buf, ')')) != 0)
742 id = pool_str2id(pool, buf, 1);
743 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
744 repo->idarraydata[i] = id;
748 if (freshens && repo->idarraydata[freshens])
750 Id idsupp = 0, idfresh = 0;
751 if (!supplements || !repo->idarraydata[supplements])
753 for (i = supplements; repo->idarraydata[i]; i++)
756 idsupp = repo->idarraydata[i];
758 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
760 for (i = freshens; repo->idarraydata[i]; i++)
763 idfresh = repo->idarraydata[i];
765 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
770 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
771 supplements = repo_addid_dep(repo, 0, idsupp, 0);
777 repo_fix_conflicts(Repo *repo, Offset conflicts)
779 char buf[1024], *p, *dep;
780 Pool *pool = repo->pool;
786 for (i = conflicts; repo->idarraydata[i]; i++)
788 id = repo->idarraydata[i];
791 dep = (char *)pool_id2str(pool, id);
792 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
794 strcpy(buf, dep + 15);
795 if ((p = strchr(buf, ')')) != 0)
797 id = pool_str2id(pool, buf, 1);
798 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
799 repo->idarraydata[i] = id;
805 /***********************************************************************/
813 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
818 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
820 struct matchdata *md = cbdata;
822 if (md->matcher.match)
824 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
826 if (!datamatcher_match(&md->matcher, kv->str))
829 md->stop = md->callback(md->callback_data, s, data, key, kv);
834 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
835 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
836 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
837 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
838 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
839 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
840 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
841 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
842 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
843 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
844 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
845 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
846 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
847 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
851 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
856 for (; *ida && !md->stop; ida++)
859 kv.eof = ida[1] ? 0 : 1;
860 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
866 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
869 Pool *pool = repo->pool;
878 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
881 repo_search_md(repo, p, keyname, md);
882 if (md->stop > SEARCH_NEXT_SOLVABLE)
888 /* The callback only supports solvables, so we can't iterate over the
892 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
894 s = pool->solvables + p;
902 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
904 if (keyname || md->stop > SEARCH_NEXT_KEY)
910 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
912 if (keyname || md->stop > SEARCH_NEXT_KEY)
918 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
920 if (keyname || md->stop > SEARCH_NEXT_KEY)
922 case SOLVABLE_VENDOR:
926 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
928 if (keyname || md->stop > SEARCH_NEXT_KEY)
930 case SOLVABLE_PROVIDES:
932 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
933 if (keyname || md->stop > SEARCH_NEXT_KEY)
935 case SOLVABLE_OBSOLETES:
937 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
938 if (keyname || md->stop > SEARCH_NEXT_KEY)
940 case SOLVABLE_CONFLICTS:
942 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
943 if (keyname || md->stop > SEARCH_NEXT_KEY)
945 case SOLVABLE_REQUIRES:
947 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
948 if (keyname || md->stop > SEARCH_NEXT_KEY)
950 case SOLVABLE_RECOMMENDS:
952 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
953 if (keyname || md->stop > SEARCH_NEXT_KEY)
955 case SOLVABLE_SUPPLEMENTS:
957 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
958 if (keyname || md->stop > SEARCH_NEXT_KEY)
960 case SOLVABLE_SUGGESTS:
962 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
963 if (keyname || md->stop > SEARCH_NEXT_KEY)
965 case SOLVABLE_ENHANCES:
967 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
968 if (keyname || md->stop > SEARCH_NEXT_KEY)
973 kv.num = repo->rpmdbid[p - repo->start];
974 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
976 if (keyname || md->stop > SEARCH_NEXT_KEY)
984 FOR_REPODATAS(repo, i, data)
986 if (p < data->start || p >= data->end)
988 if (keyname && !repodata_precheck_keyname(data, keyname))
990 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
992 /* do not search filelist extensions */
993 if (data->state != REPODATA_AVAILABLE)
995 for (j = 1; j < data->nkeys; j++)
996 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
998 if (j == data->nkeys)
1001 if (data->state == REPODATA_STUB)
1005 for (j = 1; j < data->nkeys; j++)
1006 if (keyname == data->keys[j].name)
1008 if (j == data->nkeys)
1012 if (data->loadcallback)
1013 data->loadcallback(data);
1015 data->state = REPODATA_ERROR;
1017 if (data->state == REPODATA_ERROR)
1019 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1020 if (md->stop > SEARCH_NEXT_KEY)
1026 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)
1028 struct matchdata md;
1030 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1032 memset(&md, 0, sizeof(md));
1033 md.pool = repo->pool;
1035 md.callback = callback;
1036 md.callback_data = cbdata;
1038 datamatcher_init(&md.matcher, match, flags);
1039 repo_search_md(repo, p, keyname, &md);
1041 datamatcher_free(&md.matcher);
1045 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1047 Pool *pool = repo->pool;
1057 return pool_id2str(pool, pool->solvables[entry].name);
1059 return pool_id2str(pool, pool->solvables[entry].arch);
1061 return pool_id2str(pool, pool->solvables[entry].evr);
1062 case SOLVABLE_VENDOR:
1063 return pool_id2str(pool, pool->solvables[entry].vendor);
1066 FOR_REPODATAS(repo, i, data)
1068 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1070 if (!repodata_precheck_keyname(data, keyname))
1072 str = repodata_lookup_str(data, entry, keyname);
1075 if (repodata_lookup_type(data, entry, keyname))
1083 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
1091 if (keyname == RPM_RPMDBID)
1093 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1094 return repo->rpmdbid[entry - repo->start];
1098 FOR_REPODATAS(repo, i, data)
1100 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1102 if (!repodata_precheck_keyname(data, keyname))
1104 if (repodata_lookup_num(data, entry, keyname, &value))
1106 if (repodata_lookup_type(data, entry, keyname))
1113 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1124 return repo->pool->solvables[entry].name;
1126 return repo->pool->solvables[entry].arch;
1128 return repo->pool->solvables[entry].evr;
1129 case SOLVABLE_VENDOR:
1130 return repo->pool->solvables[entry].vendor;
1133 FOR_REPODATAS(repo, i, data)
1135 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1137 if (!repodata_precheck_keyname(data, keyname))
1139 id = repodata_lookup_id(data, entry, keyname);
1141 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1142 if (repodata_lookup_type(data, entry, keyname))
1149 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1155 for (p = repo->idarraydata + off; *p; p++)
1161 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1169 case SOLVABLE_PROVIDES:
1170 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1171 case SOLVABLE_OBSOLETES:
1172 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1173 case SOLVABLE_CONFLICTS:
1174 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1175 case SOLVABLE_REQUIRES:
1176 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1177 case SOLVABLE_RECOMMENDS:
1178 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1179 case SOLVABLE_SUGGESTS:
1180 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1181 case SOLVABLE_SUPPLEMENTS:
1182 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1183 case SOLVABLE_ENHANCES:
1184 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1187 FOR_REPODATAS(repo, i, data)
1189 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1191 if (!repodata_precheck_keyname(data, keyname))
1193 if (repodata_lookup_idarray(data, entry, keyname, q))
1195 if (data->localpool)
1197 for (i = 0; i < q->count; i++)
1198 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1202 if (repodata_lookup_type(data, entry, keyname))
1209 const unsigned char *
1210 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1214 const unsigned char *chk;
1216 FOR_REPODATAS(repo, i, data)
1218 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1220 if (!repodata_precheck_keyname(data, keyname))
1222 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1225 if (repodata_lookup_type(data, entry, keyname))
1233 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1235 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1236 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1240 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1246 FOR_REPODATAS(repo, i, data)
1248 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1250 if (!repodata_precheck_keyname(data, keyname))
1252 type = repodata_lookup_type(data, entry, keyname);
1254 return type == REPOKEY_TYPE_VOID;
1260 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1266 FOR_REPODATAS(repo, i, data)
1268 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1270 if (!repodata_precheck_keyname(data, keyname))
1272 type = repodata_lookup_type(data, entry, keyname);
1274 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1279 /***********************************************************************/
1282 repo_add_repodata(Repo *repo, int flags)
1285 if ((flags & REPO_USE_LOADING) != 0)
1287 for (i = repo->nrepodata - 1; i > 0; i--)
1288 if (repo->repodata[i].state == REPODATA_LOADING)
1290 Repodata *data = repo->repodata + i;
1292 /* hack: we mis-use REPO_REUSE_REPODATA here */
1293 if (!(flags & REPO_REUSE_REPODATA))
1294 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1297 return 0; /* must not create a new repodata! */
1299 if ((flags & REPO_REUSE_REPODATA) != 0)
1301 for (i = repo->nrepodata - 1; i > 0; i--)
1302 if (repo->repodata[i].state != REPODATA_STUB)
1303 return repo->repodata + i;
1305 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1309 repo_last_repodata(Repo *repo)
1312 for (i = repo->nrepodata - 1; i > 0; i--)
1313 if (repo->repodata[i].state != REPODATA_STUB)
1314 return repo->repodata + i;
1315 return repo_add_repodata(repo, 0);
1319 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1327 repo->pool->solvables[p].name = id;
1330 repo->pool->solvables[p].arch = id;
1333 repo->pool->solvables[p].evr = id;
1335 case SOLVABLE_VENDOR:
1336 repo->pool->solvables[p].vendor = id;
1340 data = repo_last_repodata(repo);
1341 if (data->localpool)
1342 id = repodata_localize_id(data, id, 1);
1343 repodata_set_id(data, p, keyname, id);
1347 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1352 if (keyname == RPM_RPMDBID)
1355 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1356 repo->rpmdbid[p] = num;
1360 data = repo_last_repodata(repo);
1361 repodata_set_num(data, p, keyname, num);
1365 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1375 case SOLVABLE_VENDOR:
1376 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1380 data = repo_last_repodata(repo);
1381 repodata_set_str(data, p, keyname, str);
1385 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1395 case SOLVABLE_VENDOR:
1396 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1400 data = repo_last_repodata(repo);
1401 repodata_set_poolstr(data, p, keyname, str);
1405 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1407 Repodata *data = repo_last_repodata(repo);
1408 repodata_add_poolstr_array(data, p, keyname, str);
1412 repo_internalize(Repo *repo)
1417 FOR_REPODATAS(repo, i, data)
1418 if (data->attrs || data->xattrs)
1419 repodata_internalize(data);
1423 repo_disable_paging(Repo *repo)
1428 FOR_REPODATAS(repo, i, data)
1429 repodata_disable_paging(data);
1433 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: