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)
203 if (data->end > repo->end)
204 repodata_shrink(data, repo->end);
205 dstart = data->start > start ? data->start : start;
206 dend = data->end < start + count ? data->end : start + count;
212 for (j = dstart; j < dend; j++)
213 data->attrs[j - data->start] = solv_free(data->attrs[j - data->start]);
215 if (data->incoreoffset)
216 memset(data->incoreoffset + (dstart - data->start), 0, (dend - dstart) * sizeof(Id));
221 /* specialized version of repo_add_solvable_block that inserts the new solvable
222 * block before the indicated repo, which gets relocated.
223 * used in repo_add_rpmdb
226 repo_add_solvable_block_before(Repo *repo, int count, Repo *beforerepo)
228 Pool *pool = repo->pool;
234 if (!count || !beforerepo || beforerepo->end != pool->nsolvables || beforerepo->start == beforerepo->end)
235 return repo_add_solvable_block(repo, count);
236 p = beforerepo->start;
237 /* make sure all solvables belong to beforerepo */
238 for (i = p, s = pool->solvables + i; i < beforerepo->end; i++, s++)
239 if (s->repo && s->repo != beforerepo)
240 return repo_add_solvable_block(repo, count);
241 /* now move beforerepo to back */
242 pool_add_solvable_block(pool, count); /* must return beforerepo->end! */
243 memmove(pool->solvables + p + count, pool->solvables + p, (beforerepo->end - p) * sizeof(Solvable));
244 memset(pool->solvables + p, 0, sizeof(Solvable) * count);
246 FOR_REPODATAS(beforerepo, i, data)
250 data->start += count;
253 beforerepo->start += count;
254 beforerepo->end += count;
255 /* we now have count free solvables at id p */
256 /* warning: sidedata must be extended before adapting start/end */
258 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
261 if (p + count > repo->end)
262 repo->end = p + count;
263 repo->nsolvables += count;
264 for (s = pool->solvables + p; count--; s++)
270 /* repository sidedata is solvable data allocated on demand.
271 * It is used for data that is normally not present
272 * in the solvable like the rpmdbid.
273 * The solvable allocation funcions need to make sure that
274 * the sidedata gets extended if new solvables get added.
277 #define REPO_SIDEDATA_BLOCK 63
280 repo_sidedata_create(Repo *repo, size_t size)
282 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
286 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
288 int n = repo->end - repo->start;
291 int d = repo->start - p;
292 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
293 memmove((char *)b + d * size, b, n * size);
294 memset(b, 0, d * size);
297 if (p + count > repo->end)
299 int d = p + count - repo->end;
300 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
301 memset((char *)b + n * size, 0, d * size);
307 * add Id to idarraydata used to store dependencies
308 * olddeps: old array offset to extend
309 * returns new array offset
313 repo_addid(Repo *repo, Offset olddeps, Id id)
319 idarray = repo->idarraydata;
320 idarraysize = repo->idarraysize;
322 if (!idarray) /* alloc idarray if not done yet */
325 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
330 if (!olddeps) /* no deps yet */
332 olddeps = idarraysize;
333 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
335 else if (olddeps == repo->lastoff) /* extend at end */
337 else /* can't extend, copy old */
340 olddeps = idarraysize;
341 for (; idarray[i]; i++)
343 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
344 idarray[idarraysize++] = idarray[i];
346 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
349 idarray[idarraysize++] = id; /* insert Id into array */
350 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
351 idarray[idarraysize++] = 0; /* ensure NULL termination */
353 repo->idarraydata = idarray;
354 repo->idarraysize = idarraysize;
355 repo->lastoff = olddeps;
360 #define REPO_ADDID_DEP_HASHTHRES 64
361 #define REPO_ADDID_DEP_HASHMIN 128
364 * Optimization for packages with an excessive amount of provides/requires:
365 * if the number of deps exceed a threshold, we build a hash of the already
369 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
388 /* maintain hash and lastmarkerpos */
389 if (repo->lastidhash_idarraysize != repo->idarraysize || size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
391 repo->lastmarkerpos = 0;
392 if (size * 2 > repo->lastidhash_mask)
394 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
395 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
397 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
398 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
400 h = oid & repo->lastidhash_mask;
401 hh = HASHCHAIN_START;
402 while (repo->lastidhash[h] != 0)
403 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
404 repo->lastidhash[h] = oid;
405 if (marker && oid == marker)
406 repo->lastmarkerpos = oidp - repo->idarraydata;
408 repo->lastmarker = marker;
409 repo->lastidhash_idarraysize = repo->idarraysize;
412 /* check the hash! */
413 h = id & repo->lastidhash_mask;
414 hh = HASHCHAIN_START;
415 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
416 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
417 /* put new element in hash */
419 repo->lastidhash[h] = id;
420 else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
422 if (marker && !before && !repo->lastmarkerpos)
424 /* we have to add the marker first */
425 repo->lastmarkerpos = repo->idarraysize - 1;
426 olddeps = repo_addid(repo, olddeps, marker);
427 /* now put marker in hash */
428 h = marker & repo->lastidhash_mask;
429 hh = HASHCHAIN_START;
430 while (repo->lastidhash[h] != 0)
431 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
432 repo->lastidhash[h] = marker;
433 repo->lastidhash_idarraysize = repo->idarraysize;
437 /* new entry, insert in correct position */
438 if (marker && before && repo->lastmarkerpos)
440 /* need to add it before the marker */
441 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
442 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
443 repo->idarraydata[repo->lastmarkerpos++] = id;
447 /* just append it to the end */
448 olddeps = repo_addid(repo, olddeps, id);
450 repo->lastidhash_idarraysize = repo->idarraysize;
453 /* we already have it in the hash */
456 if (marker == SOLVABLE_FILEMARKER)
458 /* check if it is in the wrong half */
459 /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
460 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
465 /* yes, wrong half. copy it over */
466 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
467 repo->idarraydata[repo->lastmarkerpos++] = id;
472 /* check if it is in the correct half */
473 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
476 /* nope, copy it over */
477 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
481 return olddeps; /* should not happen */
482 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
483 repo->idarraydata[repo->idarraysize - 2] = id;
484 repo->lastmarkerpos--; /* marker has been moved */
489 * add dependency (as Id) to repo, also unifies dependencies
490 * olddeps = offset into idarraydata
491 * marker= 0 for normal dep
492 * marker > 0 add dep after marker
493 * marker < 0 add dep before -marker
494 * returns new start of dependency array
497 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
499 Id oid, *oidp, *markerp;
505 olddeps = repo_addid(repo, olddeps, marker);
506 return repo_addid(repo, olddeps, id);
509 /* check if we should use the hash optimization */
510 if (olddeps == repo->lastoff)
512 int size = repo->idarraysize - 1 - repo->lastoff;
513 if (size >= REPO_ADDID_DEP_HASHTHRES)
514 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
531 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
534 return repo_addid(repo, olddeps, id);
538 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
548 if (marker == SOLVABLE_FILEMARKER)
550 if (!markerp || !before)
552 /* we found it, but in the second half */
553 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
557 if (markerp || before)
559 /* we found it, but in the first half */
561 for (; (oid = *oidp) != 0; oidp++)
566 /* no marker in array yet */
569 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
571 return repo_addid(repo, olddeps, id);
575 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
579 /* id not yet in array */
580 if (!before && !markerp)
581 olddeps = repo_addid(repo, olddeps, marker);
582 else if (before && markerp)
587 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
590 return repo_addid(repo, olddeps, id);
593 /* return standard marker for the keyname dependency.
594 * 1: return positive marker, -1: return negative marker
597 solv_depmarker(Id keyname, Id marker)
599 if (marker != 1 && marker != -1)
601 if (keyname == SOLVABLE_PROVIDES)
602 return marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
603 if (keyname == SOLVABLE_REQUIRES)
604 return marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
610 * make space for 'num' more dependencies
611 * returns new start of dependency array
613 * reserved ids will always begin at offset idarraysize
616 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
618 num++; /* room for trailing ID_NULL */
620 if (!repo->idarraysize) /* ensure buffer space */
622 repo->idarraysize = 1;
623 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
624 repo->idarraydata[0] = 0;
629 if (olddeps && olddeps != repo->lastoff) /* if not appending */
631 /* can't insert into idarray, this would invalidate all 'larger' offsets
632 * so create new space at end and move existing deps there.
633 * Leaving 'hole' at old position.
639 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
641 count = idend - idstart - 1 + num; /* new size */
643 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
644 /* move old deps to end */
645 olddeps = repo->lastoff = repo->idarraysize;
646 memcpy(repo->idarraydata + olddeps, idstart, count - num);
647 repo->idarraysize = olddeps + count - num;
652 if (olddeps) /* appending */
656 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
658 /* appending or new */
659 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
661 return repo->lastoff;
665 /***********************************************************************/
668 * some SUSE specific fixups, should go into a separate file
672 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
674 Pool *pool = repo->pool;
676 char buf[1024], *p, *dep;
681 for (i = provides; repo->idarraydata[i]; i++)
683 id = repo->idarraydata[i];
686 dep = (char *)pool_id2str(pool, id);
687 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
690 strcpy(buf + 2, dep);
692 if ((p = strchr(dep, ':')) != 0 && p != dep)
695 idp = pool_str2id(pool, dep, 1);
699 while ((p = strchr(dep, ';')) != 0)
707 idl = pool_str2id(pool, dep, 1);
708 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
710 id = pool_rel2id(pool, id, idl, REL_OR, 1);
715 if (dep[0] && dep[1])
717 for (p = dep; *p && *p != ')'; p++)
720 idl = pool_str2id(pool, dep, 1);
721 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
723 id = pool_rel2id(pool, id, idl, REL_OR, 1);
728 id = pool_rel2id(pool, idp, id, REL_AND, 1);
730 supplements = repo_addid_dep(repo, supplements, id, 0);
732 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
737 idp = pool_str2id(pool, buf, 1);
738 /* strip trailing slashes */
740 while (l > 1 && p[l - 1] == '/')
742 id = pool_str2id(pool, p, 1);
743 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
744 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
745 supplements = repo_addid_dep(repo, supplements, id, 0);
751 for (i = supplements; repo->idarraydata[i]; i++)
753 id = repo->idarraydata[i];
756 dep = (char *)pool_id2str(pool, id);
757 if (!strncmp(dep, "system:modalias(", 16))
759 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
762 p = strchr(buf + 9, ':');
763 if (p && p != buf + 9 && strchr(p + 1, ':'))
766 idp = pool_str2id(pool, buf + 9, 1);
767 p[strlen(p) - 1] = 0;
768 id = pool_str2id(pool, p, 1);
769 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
770 id = pool_rel2id(pool, idp, id, REL_AND, 1);
775 p[strlen(p) - 1] = 0;
776 id = pool_str2id(pool, p, 1);
777 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
780 repo->idarraydata[i] = id;
782 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
787 while ((p = strchr(dep, ':')) != 0)
794 /* argh, allow pattern: prefix. sigh */
795 if (p - dep == 7 && !strncmp(dep, "pattern", 7))
797 p = strchr(p + 1, ':');
802 idp = pool_str2id(pool, dep, 1);
804 id = pool_rel2id(pool, id, idp, REL_AND, 1);
809 if (dep[0] && dep[1])
811 dep[strlen(dep) - 1] = 0;
812 idp = pool_str2id(pool, dep, 1);
814 id = pool_rel2id(pool, id, idp, REL_AND, 1);
819 repo->idarraydata[i] = id;
821 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
823 strcpy(buf, dep + 11);
824 if ((p = strrchr(buf, ')')) != 0)
826 id = pool_str2id(pool, buf, 1);
827 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
828 repo->idarraydata[i] = id;
832 if (freshens && repo->idarraydata[freshens])
834 Id idsupp = 0, idfresh = 0;
835 if (!supplements || !repo->idarraydata[supplements])
837 for (i = supplements; repo->idarraydata[i]; i++)
840 idsupp = repo->idarraydata[i];
842 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
844 for (i = freshens; repo->idarraydata[i]; i++)
847 idfresh = repo->idarraydata[i];
849 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
854 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
855 supplements = repo_addid_dep(repo, 0, idsupp, 0);
861 repo_fix_conflicts(Repo *repo, Offset conflicts)
863 char buf[1024], *p, *dep;
864 Pool *pool = repo->pool;
870 for (i = conflicts; repo->idarraydata[i]; i++)
872 id = repo->idarraydata[i];
875 dep = (char *)pool_id2str(pool, id);
876 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
878 strcpy(buf, dep + 15);
879 if ((p = strchr(buf, ')')) != 0)
881 id = pool_str2id(pool, buf, 1);
882 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
883 repo->idarraydata[i] = id;
889 /***********************************************************************/
897 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
902 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
904 struct matchdata *md = cbdata;
906 if (md->matcher.match)
908 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
909 if (!datamatcher_checkbasename(&md->matcher, kv->str))
911 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
913 if (!datamatcher_match(&md->matcher, kv->str))
916 md->stop = md->callback(md->callback_data, s, data, key, kv);
921 /* list of all keys we store in the solvable */
922 /* also used in the dataiterator code in repodata.c */
923 Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
924 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
925 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
926 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
927 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
928 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
929 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
930 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
931 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
932 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
933 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
934 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
935 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
936 { RPM_RPMDBID, REPOKEY_TYPE_NUM, 0, KEY_STORAGE_SOLVABLE },
940 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
945 for (; *ida && !md->stop; ida++)
948 kv.eof = ida[1] ? 0 : 1;
949 repo_matchvalue(md, s, 0, repo_solvablekeys + (keyname - SOLVABLE_NAME), &kv);
955 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
958 Pool *pool = repo->pool;
967 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
970 repo_search_md(repo, p, keyname, md);
971 if (md->stop > SEARCH_NEXT_SOLVABLE)
977 /* The callback only supports solvables, so we can't iterate over the
981 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
983 s = pool->solvables + p;
991 repo_matchvalue(md, s, 0, repo_solvablekeys + 0, &kv);
993 if (keyname || md->stop > SEARCH_NEXT_KEY)
999 repo_matchvalue(md, s, 0, repo_solvablekeys + 1, &kv);
1001 if (keyname || md->stop > SEARCH_NEXT_KEY)
1007 repo_matchvalue(md, s, 0, repo_solvablekeys + 2, &kv);
1009 if (keyname || md->stop > SEARCH_NEXT_KEY)
1011 case SOLVABLE_VENDOR:
1015 repo_matchvalue(md, s, 0, repo_solvablekeys + 3, &kv);
1017 if (keyname || md->stop > SEARCH_NEXT_KEY)
1019 case SOLVABLE_PROVIDES:
1021 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
1022 if (keyname || md->stop > SEARCH_NEXT_KEY)
1024 case SOLVABLE_OBSOLETES:
1026 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
1027 if (keyname || md->stop > SEARCH_NEXT_KEY)
1029 case SOLVABLE_CONFLICTS:
1031 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
1032 if (keyname || md->stop > SEARCH_NEXT_KEY)
1034 case SOLVABLE_REQUIRES:
1036 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
1037 if (keyname || md->stop > SEARCH_NEXT_KEY)
1039 case SOLVABLE_RECOMMENDS:
1041 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
1042 if (keyname || md->stop > SEARCH_NEXT_KEY)
1044 case SOLVABLE_SUPPLEMENTS:
1046 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
1047 if (keyname || md->stop > SEARCH_NEXT_KEY)
1049 case SOLVABLE_SUGGESTS:
1051 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
1052 if (keyname || md->stop > SEARCH_NEXT_KEY)
1054 case SOLVABLE_ENHANCES:
1056 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
1057 if (keyname || md->stop > SEARCH_NEXT_KEY)
1062 kv.num = repo->rpmdbid[p - repo->start];
1064 repo_matchvalue(md, s, 0, repo_solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
1066 if (keyname || md->stop > SEARCH_NEXT_KEY)
1074 FOR_REPODATAS(repo, i, data)
1076 if (p < data->start || p >= data->end)
1078 if (keyname && !repodata_precheck_keyname(data, keyname))
1080 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
1082 /* do not search filelist extensions */
1083 if (data->state != REPODATA_AVAILABLE)
1085 for (j = 1; j < data->nkeys; j++)
1086 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1088 if (j == data->nkeys)
1091 if (data->state == REPODATA_STUB)
1095 for (j = 1; j < data->nkeys; j++)
1096 if (keyname == data->keys[j].name)
1098 if (j == data->nkeys)
1102 if (data->loadcallback)
1103 data->loadcallback(data);
1105 data->state = REPODATA_ERROR;
1107 if (data->state == REPODATA_ERROR)
1109 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1110 if (md->stop > SEARCH_NEXT_KEY)
1116 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)
1118 struct matchdata md;
1120 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1122 memset(&md, 0, sizeof(md));
1123 md.pool = repo->pool;
1125 md.callback = callback;
1126 md.callback_data = cbdata;
1128 datamatcher_init(&md.matcher, match, flags);
1129 repo_search_md(repo, p, keyname, &md);
1131 datamatcher_free(&md.matcher);
1135 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1137 Pool *pool = repo->pool;
1147 return pool_id2str(pool, pool->solvables[entry].name);
1149 return pool_id2str(pool, pool->solvables[entry].arch);
1151 return pool_id2str(pool, pool->solvables[entry].evr);
1152 case SOLVABLE_VENDOR:
1153 return pool_id2str(pool, pool->solvables[entry].vendor);
1156 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1157 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1158 FOR_REPODATAS(repo, i, data)
1160 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1162 if (!repodata_precheck_keyname(data, keyname))
1164 str = repodata_lookup_str(data, entry, keyname);
1167 if (repodata_lookup_type(data, entry, keyname))
1175 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned long long notfound)
1177 Pool *pool = repo->pool;
1180 unsigned long long value;
1184 if (keyname == RPM_RPMDBID)
1186 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1187 return repo->rpmdbid[entry - repo->start];
1191 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1192 return repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, &value) ? value : notfound;
1193 FOR_REPODATAS(repo, i, data)
1195 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1197 if (!repodata_precheck_keyname(data, keyname))
1199 if (repodata_lookup_num(data, entry, keyname, &value))
1201 if (repodata_lookup_type(data, entry, keyname))
1208 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1210 Pool *pool = repo->pool;
1220 return repo->pool->solvables[entry].name;
1222 return repo->pool->solvables[entry].arch;
1224 return repo->pool->solvables[entry].evr;
1225 case SOLVABLE_VENDOR:
1226 return repo->pool->solvables[entry].vendor;
1229 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1231 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1232 Id id = repodata_lookup_id(data, entry, keyname);
1233 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1235 FOR_REPODATAS(repo, i, data)
1237 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1239 if (!repodata_precheck_keyname(data, keyname))
1241 id = repodata_lookup_id(data, entry, keyname);
1243 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1244 if (repodata_lookup_type(data, entry, keyname))
1251 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1257 for (p = repo->idarraydata + off; *p; p++)
1263 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1265 Pool *pool = repo->pool;
1272 case SOLVABLE_PROVIDES:
1273 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1274 case SOLVABLE_OBSOLETES:
1275 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1276 case SOLVABLE_CONFLICTS:
1277 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1278 case SOLVABLE_REQUIRES:
1279 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1280 case SOLVABLE_RECOMMENDS:
1281 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1282 case SOLVABLE_SUGGESTS:
1283 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1284 case SOLVABLE_SUPPLEMENTS:
1285 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1286 case SOLVABLE_ENHANCES:
1287 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1290 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1292 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1293 if (repodata_lookup_idarray(data, entry, keyname, q))
1295 if (data->localpool)
1297 for (i = 0; i < q->count; i++)
1298 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1303 FOR_REPODATAS(repo, i, data)
1305 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1307 if (!repodata_precheck_keyname(data, keyname))
1309 if (repodata_lookup_idarray(data, entry, keyname, q))
1311 if (data->localpool)
1313 for (i = 0; i < q->count; i++)
1314 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1318 if (repodata_lookup_type(data, entry, keyname))
1326 repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
1328 int r = repo_lookup_idarray(repo, entry, keyname, q);
1331 if (marker == -1 || marker == 1)
1332 marker = solv_depmarker(keyname, marker);
1333 if (marker && q->count)
1339 for (i = 0; i < q->count; i++)
1340 if (q->elements[i] == marker)
1342 queue_truncate(q, i);
1348 for (i = 0; i < q->count; i++)
1349 if (q->elements[i] == marker)
1351 queue_deleten(q, 0, i + 1);
1360 const unsigned char *
1361 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1363 Pool *pool = repo->pool;
1366 const unsigned char *chk;
1368 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1369 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, typep);
1370 FOR_REPODATAS(repo, i, data)
1372 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1374 if (!repodata_precheck_keyname(data, keyname))
1376 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1379 if (repodata_lookup_type(data, entry, keyname))
1387 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1389 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1390 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1394 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1396 Pool *pool = repo->pool;
1401 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1402 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1403 FOR_REPODATAS(repo, i, data)
1405 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1407 if (!repodata_precheck_keyname(data, keyname))
1409 type = repodata_lookup_type(data, entry, keyname);
1411 return type == REPOKEY_TYPE_VOID;
1417 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1419 Pool *pool = repo->pool;
1424 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1425 return repodata_lookup_type(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1426 FOR_REPODATAS(repo, i, data)
1428 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1430 if (!repodata_precheck_keyname(data, keyname))
1432 type = repodata_lookup_type(data, entry, keyname);
1434 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1440 repo_lookup_binary(Repo *repo, Id entry, Id keyname, int *lenp)
1442 Pool *pool = repo->pool;
1447 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1448 return repodata_lookup_binary(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, lenp);
1449 FOR_REPODATAS(repo, i, data)
1451 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1453 if (!repodata_precheck_keyname(data, keyname))
1455 bin = repodata_lookup_binary(data, entry, keyname, lenp);
1463 /***********************************************************************/
1466 repo_add_repodata(Repo *repo, int flags)
1470 if ((flags & REPO_USE_LOADING) != 0)
1472 for (i = repo->nrepodata - 1; i > 0; i--)
1473 if (repo->repodata[i].state == REPODATA_LOADING)
1475 Repodata *data = repo->repodata + i;
1477 /* hack: we mis-use REPO_REUSE_REPODATA here */
1478 if (!(flags & REPO_REUSE_REPODATA))
1479 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1482 return 0; /* must not create a new repodata! */
1484 if ((flags & REPO_REUSE_REPODATA) != 0)
1486 for (i = repo->nrepodata - 1; i > 0; i--)
1487 if (repo->repodata[i].state != REPODATA_STUB)
1488 return repo->repodata + i;
1490 if (!repo->nrepodata)
1492 repo->nrepodata = 2; /* start with id 1 */
1493 repo->repodata = solv_calloc(repo->nrepodata, sizeof(*data));
1498 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
1500 data = repo->repodata + repo->nrepodata - 1;
1501 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1506 repo_id2repodata(Repo *repo, Id id)
1508 return id ? repo->repodata + id : 0;
1512 repo_last_repodata(Repo *repo)
1515 for (i = repo->nrepodata - 1; i > 0; i--)
1516 if (repo->repodata[i].state != REPODATA_STUB)
1517 return repo->repodata + i;
1518 return repo_add_repodata(repo, 0);
1522 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1530 repo->pool->solvables[p].name = id;
1533 repo->pool->solvables[p].arch = id;
1536 repo->pool->solvables[p].evr = id;
1538 case SOLVABLE_VENDOR:
1539 repo->pool->solvables[p].vendor = id;
1543 data = repo_last_repodata(repo);
1544 if (data->localpool)
1545 id = repodata_localize_id(data, id, 1);
1546 repodata_set_id(data, p, keyname, id);
1550 repo_set_num(Repo *repo, Id p, Id keyname, unsigned long long num)
1555 if (keyname == RPM_RPMDBID)
1558 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1559 repo->rpmdbid[p - repo->start] = num;
1563 data = repo_last_repodata(repo);
1564 repodata_set_num(data, p, keyname, num);
1568 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1578 case SOLVABLE_VENDOR:
1579 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1583 data = repo_last_repodata(repo);
1584 repodata_set_str(data, p, keyname, str);
1588 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1598 case SOLVABLE_VENDOR:
1599 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1603 data = repo_last_repodata(repo);
1604 repodata_set_poolstr(data, p, keyname, str);
1608 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1610 Repodata *data = repo_last_repodata(repo);
1611 repodata_add_poolstr_array(data, p, keyname, str);
1615 repo_add_deparray(Repo *repo, Id p, Id keyname, Id dep, Id marker)
1618 if (marker == -1 || marker == 1)
1619 marker = solv_depmarker(keyname, marker);
1622 Solvable *s = repo->pool->solvables + p;
1625 case SOLVABLE_PROVIDES:
1626 s->provides = repo_addid_dep(repo, s->provides, dep, marker);
1628 case SOLVABLE_OBSOLETES:
1629 s->obsoletes = repo_addid_dep(repo, s->obsoletes, dep, marker);
1631 case SOLVABLE_CONFLICTS:
1632 s->conflicts = repo_addid_dep(repo, s->conflicts, dep, marker);
1634 case SOLVABLE_REQUIRES:
1635 s->requires = repo_addid_dep(repo, s->requires, dep, marker);
1637 case SOLVABLE_RECOMMENDS:
1638 s->recommends = repo_addid_dep(repo, s->recommends, dep, marker);
1640 case SOLVABLE_SUGGESTS:
1641 s->suggests = repo_addid_dep(repo, s->suggests, dep, marker);
1643 case SOLVABLE_SUPPLEMENTS:
1644 s->supplements = repo_addid_dep(repo, s->supplements, dep, marker);
1646 case SOLVABLE_ENHANCES:
1647 s->enhances = repo_addid_dep(repo, s->enhances, dep, marker);
1651 data = repo_last_repodata(repo);
1652 repodata_add_idarray(data, p, keyname, dep);
1656 repo_add_idarray(Repo *repo, Id p, Id keyname, Id id)
1658 repo_add_deparray(repo, p, keyname, id, 0);
1662 repo_set_idarray_solvable(Repo *repo, Queue *q)
1666 for (i = 0; i < q->count; i++)
1667 repo_addid_dep(repo, o, q->elements[i], 0);
1672 repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
1675 if (marker == -1 || marker == 1)
1676 marker = solv_depmarker(keyname, marker);
1679 /* complex case, splice old and new arrays */
1683 repo_lookup_deparray(repo, p, keyname, &q2, -marker);
1688 queue_push(&q2, marker);
1689 for (i = 0; i < q->count; i++)
1690 queue_push(&q2, q->elements[i]);
1696 queue_insert(&q2, 0, -marker);
1697 queue_insertn(&q2, 0, q->count, q->elements);
1699 repo_set_deparray(repo, p, keyname, &q2, 0);
1705 Solvable *s = repo->pool->solvables + p;
1708 case SOLVABLE_PROVIDES:
1709 s->provides = repo_set_idarray_solvable(repo, q);
1711 case SOLVABLE_OBSOLETES:
1712 s->obsoletes = repo_set_idarray_solvable(repo, q);
1714 case SOLVABLE_CONFLICTS:
1715 s->conflicts = repo_set_idarray_solvable(repo, q);
1717 case SOLVABLE_REQUIRES:
1718 s->requires = repo_set_idarray_solvable(repo, q);
1720 case SOLVABLE_RECOMMENDS:
1721 s->recommends = repo_set_idarray_solvable(repo, q);
1723 case SOLVABLE_SUGGESTS:
1724 s->suggests = repo_set_idarray_solvable(repo, q);
1726 case SOLVABLE_SUPPLEMENTS:
1727 s->supplements = repo_set_idarray_solvable(repo, q);
1729 case SOLVABLE_ENHANCES:
1730 s->enhances = repo_set_idarray_solvable(repo, q);
1734 data = repo_last_repodata(repo);
1735 repodata_set_idarray(data, p, keyname, q);
1739 repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
1741 repo_set_deparray(repo, p, keyname, q, 0);
1745 repo_unset(Repo *repo, Id p, Id keyname)
1750 Solvable *s = repo->pool->solvables + p;
1762 case SOLVABLE_VENDOR:
1767 repo->rpmdbid[p - repo->start] = 0;
1769 case SOLVABLE_PROVIDES:
1772 case SOLVABLE_OBSOLETES:
1775 case SOLVABLE_CONFLICTS:
1778 case SOLVABLE_REQUIRES:
1781 case SOLVABLE_RECOMMENDS:
1784 case SOLVABLE_SUGGESTS:
1787 case SOLVABLE_SUPPLEMENTS:
1789 case SOLVABLE_ENHANCES:
1796 data = repo_last_repodata(repo);
1797 repodata_unset(data, p, keyname);
1801 repo_internalize(Repo *repo)
1806 FOR_REPODATAS(repo, i, data)
1807 if (data->attrs || data->xattrs)
1808 repodata_internalize(data);
1812 repo_disable_paging(Repo *repo)
1817 FOR_REPODATAS(repo, i, data)
1818 repodata_disable_paging(data);