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);
97 /* zero out (i.e. free) solvables belonging to this repo */
98 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
100 memset(s, 0, sizeof(*s));
101 repo->end = repo->start;
102 repo->nsolvables = 0;
104 /* free all data belonging to this repo */
105 repo->idarraydata = solv_free(repo->idarraydata);
106 repo->idarraysize = 0;
108 repo->rpmdbid = solv_free(repo->rpmdbid);
109 for (i = 1; i < repo->nrepodata; i++)
110 repodata_freedata(repo->repodata + i);
111 solv_free(repo->repodata);
117 * remove repo from pool, delete solvables
122 repo_free(Repo *repo, int reuseids)
124 Pool *pool = repo->pool;
127 if (repo == pool->installed)
129 repo_empty(repo, reuseids);
130 for (i = 1; i < pool->nrepos; i++) /* find repo in pool */
131 if (pool->repos[i] == repo)
133 if (i == pool->nrepos) /* repo not in pool, return */
135 if (i == pool->nrepos - 1 && reuseids)
144 repo_add_solvable(Repo *repo)
146 Id p = pool_add_solvable(repo->pool);
147 if (!repo->start || repo->start == repo->end)
148 repo->start = repo->end = p;
149 /* warning: sidedata must be extended before adapting start/end */
151 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
154 if (p + 1 > repo->end)
157 repo->pool->solvables[p].repo = repo;
162 repo_add_solvable_block(Repo *repo, int count)
168 p = pool_add_solvable_block(repo->pool, count);
169 if (!repo->start || repo->start == repo->end)
170 repo->start = repo->end = p;
171 /* warning: sidedata must be extended before adapting start/end */
173 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
176 if (p + count > repo->end)
177 repo->end = p + count;
178 repo->nsolvables += count;
179 for (s = repo->pool->solvables + p; count--; s++)
185 repo_free_solvable(Repo *repo, Id p, int reuseids)
187 repo_free_solvable_block(repo, p, 1, reuseids);
191 repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
196 if (start + count == repo->end)
198 repo->nsolvables -= count;
199 for (s = repo->pool->solvables + start, i = count; i--; s++)
201 pool_free_solvable_block(repo->pool, start, count, reuseids);
202 FOR_REPODATAS(repo, i, data)
205 if (data->end > repo->end)
206 repodata_shrink(data, repo->end);
207 dstart = data->start > start ? data->start : start;
208 dend = data->end < start + count ? data->end : start + count;
214 for (j = dstart; j < dend; j++)
215 data->attrs[j - data->start] = solv_free(data->attrs[j - data->start]);
217 if (data->incoreoffset)
218 memset(data->incoreoffset + (dstart - data->start), 0, (dend - dstart) * sizeof(Id));
223 /* specialized version of repo_add_solvable_block that inserts the new solvable
224 * block before the indicated repo, which gets relocated.
225 * used in repo_add_rpmdb
228 repo_add_solvable_block_before(Repo *repo, int count, Repo *beforerepo)
230 Pool *pool = repo->pool;
236 if (!count || !beforerepo || beforerepo->end != pool->nsolvables || beforerepo->start == beforerepo->end)
237 return repo_add_solvable_block(repo, count);
238 p = beforerepo->start;
239 /* make sure all solvables belong to beforerepo */
240 for (i = p, s = pool->solvables + i; i < beforerepo->end; i++, s++)
241 if (s->repo && s->repo != beforerepo)
242 return repo_add_solvable_block(repo, count);
243 /* now move beforerepo to back */
244 pool_add_solvable_block(pool, count); /* must return beforerepo->end! */
245 memmove(pool->solvables + p + count, pool->solvables + p, (beforerepo->end - p) * sizeof(Solvable));
246 memset(pool->solvables + p, 0, sizeof(Solvable) * count);
248 FOR_REPODATAS(beforerepo, i, data)
252 data->start += count;
255 beforerepo->start += count;
256 beforerepo->end += count;
257 /* we now have count free solvables at id p */
258 /* warning: sidedata must be extended before adapting start/end */
260 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
263 if (p + count > repo->end)
264 repo->end = p + count;
265 repo->nsolvables += count;
266 for (s = pool->solvables + p; count--; s++)
272 /* repository sidedata is solvable data allocated on demand.
273 * It is used for data that is normally not present
274 * in the solvable like the rpmdbid.
275 * The solvable allocation funcions need to make sure that
276 * the sidedata gets extended if new solvables get added.
279 #define REPO_SIDEDATA_BLOCK 63
282 repo_sidedata_create(Repo *repo, size_t size)
284 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
288 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
290 int n = repo->end - repo->start;
293 int d = repo->start - p;
294 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
295 memmove((char *)b + d * size, b, n * size);
296 memset(b, 0, d * size);
299 if (p + count > repo->end)
301 int d = p + count - repo->end;
302 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
303 memset((char *)b + n * size, 0, d * size);
309 * add Id to idarraydata used to store dependencies
310 * olddeps: old array offset to extend
311 * returns new array offset
315 repo_addid(Repo *repo, Offset olddeps, Id id)
321 idarray = repo->idarraydata;
322 idarraysize = repo->idarraysize;
324 if (!idarray) /* alloc idarray if not done yet */
327 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
332 if (!olddeps) /* no deps yet */
334 olddeps = idarraysize;
335 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
337 else if (olddeps == repo->lastoff) /* extend at end */
339 else /* can't extend, copy old */
342 olddeps = idarraysize;
343 for (; idarray[i]; i++)
345 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
346 idarray[idarraysize++] = idarray[i];
348 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
351 idarray[idarraysize++] = id; /* insert Id into array */
352 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
353 idarray[idarraysize++] = 0; /* ensure NULL termination */
355 repo->idarraydata = idarray;
356 repo->idarraysize = idarraysize;
357 repo->lastoff = olddeps;
362 #define REPO_ADDID_DEP_HASHTHRES 64
363 #define REPO_ADDID_DEP_HASHMIN 128
366 * Optimization for packages with an excessive amount of provides/requires:
367 * if the number of deps exceed a threshold, we build a hash of the already
371 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
390 /* maintain hash and lastmarkerpos */
391 if (repo->lastidhash_idarraysize != repo->idarraysize || (Hashval)size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
393 repo->lastmarkerpos = 0;
394 if (size * 2 > (Hashval)repo->lastidhash_mask)
396 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
397 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
399 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
400 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
402 h = oid & repo->lastidhash_mask;
403 hh = HASHCHAIN_START;
404 while (repo->lastidhash[h] != 0)
405 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
406 repo->lastidhash[h] = oid;
407 if (marker && oid == marker)
408 repo->lastmarkerpos = oidp - repo->idarraydata;
410 repo->lastmarker = marker;
411 repo->lastidhash_idarraysize = repo->idarraysize;
414 /* check the hash! */
415 h = id & repo->lastidhash_mask;
416 hh = HASHCHAIN_START;
417 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
418 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
419 /* put new element in hash */
421 repo->lastidhash[h] = id;
422 else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
424 if (marker && !before && !repo->lastmarkerpos)
426 /* we have to add the marker first */
427 repo->lastmarkerpos = repo->idarraysize - 1;
428 olddeps = repo_addid(repo, olddeps, marker);
429 /* now put marker in hash */
430 h = marker & repo->lastidhash_mask;
431 hh = HASHCHAIN_START;
432 while (repo->lastidhash[h] != 0)
433 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
434 repo->lastidhash[h] = marker;
435 repo->lastidhash_idarraysize = repo->idarraysize;
439 /* new entry, insert in correct position */
440 if (marker && before && repo->lastmarkerpos)
442 /* need to add it before the marker */
443 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
444 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
445 repo->idarraydata[repo->lastmarkerpos++] = id;
449 /* just append it to the end */
450 olddeps = repo_addid(repo, olddeps, id);
452 repo->lastidhash_idarraysize = repo->idarraysize;
455 /* we already have it in the hash */
458 if (marker == SOLVABLE_FILEMARKER)
460 /* check if it is in the wrong half */
461 /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
462 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
467 /* yes, wrong half. copy it over */
468 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
469 repo->idarraydata[repo->lastmarkerpos++] = id;
474 /* check if it is in the correct half */
475 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
478 /* nope, copy it over */
479 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
483 return olddeps; /* should not happen */
484 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
485 repo->idarraydata[repo->idarraysize - 2] = id;
486 repo->lastmarkerpos--; /* marker has been moved */
491 * add dependency (as Id) to repo, also unifies dependencies
492 * olddeps = offset into idarraydata
493 * marker= 0 for normal dep
494 * marker > 0 add dep after marker
495 * marker < 0 add dep before -marker
496 * returns new start of dependency array
499 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
501 Id oid, *oidp, *markerp;
507 olddeps = repo_addid(repo, olddeps, marker);
508 return repo_addid(repo, olddeps, id);
511 /* check if we should use the hash optimization */
512 if (olddeps == repo->lastoff)
514 int size = repo->idarraysize - 1 - repo->lastoff;
515 if (size >= REPO_ADDID_DEP_HASHTHRES)
516 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
533 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
536 return repo_addid(repo, olddeps, id);
540 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
550 if (marker == SOLVABLE_FILEMARKER)
552 if (!markerp || !before)
554 /* we found it, but in the second half */
555 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
559 if (markerp || before)
561 /* we found it, but in the first half */
563 for (; (oid = *oidp) != 0; oidp++)
568 /* no marker in array yet */
571 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
573 return repo_addid(repo, olddeps, id);
577 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
581 /* id not yet in array */
582 if (!before && !markerp)
583 olddeps = repo_addid(repo, olddeps, marker);
584 else if (before && markerp)
589 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
592 return repo_addid(repo, olddeps, id);
595 /* return standard marker for the keyname dependency.
596 * 1: return positive marker, -1: return negative marker
599 solv_depmarker(Id keyname, Id marker)
601 if (marker != 1 && marker != -1)
603 if (keyname == SOLVABLE_PROVIDES)
604 return marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
605 if (keyname == SOLVABLE_REQUIRES)
606 return marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
612 * make space for 'num' more dependencies
613 * returns new start of dependency array
615 * reserved ids will always begin at offset idarraysize
618 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
620 num++; /* room for trailing ID_NULL */
622 if (!repo->idarraysize) /* ensure buffer space */
624 repo->idarraysize = 1;
625 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
626 repo->idarraydata[0] = 0;
631 if (olddeps && olddeps != repo->lastoff) /* if not appending */
633 /* can't insert into idarray, this would invalidate all 'larger' offsets
634 * so create new space at end and move existing deps there.
635 * Leaving 'hole' at old position.
641 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
643 count = idend - idstart - 1 + num; /* new size */
645 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
646 /* move old deps to end */
647 olddeps = repo->lastoff = repo->idarraysize;
648 memcpy(repo->idarraydata + olddeps, idstart, count - num);
649 repo->idarraysize = olddeps + count - num;
654 if (olddeps) /* appending */
658 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
660 /* appending or new */
661 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
663 return repo->lastoff;
667 /***********************************************************************/
670 * some SUSE specific fixups, should go into a separate file
674 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
676 Pool *pool = repo->pool;
678 char buf[1024], *p, *dep;
683 for (i = provides; repo->idarraydata[i]; i++)
685 id = repo->idarraydata[i];
688 dep = (char *)pool_id2str(pool, id);
689 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
692 strcpy(buf + 2, dep);
694 if ((p = strchr(dep, ':')) != 0 && p != dep)
697 idp = pool_str2id(pool, dep, 1);
701 while ((p = strchr(dep, ';')) != 0)
709 idl = pool_str2id(pool, dep, 1);
710 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
712 id = pool_rel2id(pool, id, idl, REL_OR, 1);
717 if (dep[0] && dep[1])
719 for (p = dep; *p && *p != ')'; p++)
722 idl = pool_str2id(pool, dep, 1);
723 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
725 id = pool_rel2id(pool, id, idl, REL_OR, 1);
730 id = pool_rel2id(pool, idp, id, REL_AND, 1);
732 supplements = repo_addid_dep(repo, supplements, id, 0);
734 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
739 idp = pool_str2id(pool, buf, 1);
740 /* strip trailing slashes */
742 while (l > 1 && p[l - 1] == '/')
744 id = pool_str2id(pool, p, 1);
745 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
746 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
747 supplements = repo_addid_dep(repo, supplements, id, 0);
753 for (i = supplements; repo->idarraydata[i]; i++)
755 id = repo->idarraydata[i];
758 dep = (char *)pool_id2str(pool, id);
759 if (!strncmp(dep, "system:modalias(", 16))
761 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
764 p = strchr(buf + 9, ':');
765 if (p && p != buf + 9 && strchr(p + 1, ':'))
768 idp = pool_str2id(pool, buf + 9, 1);
769 p[strlen(p) - 1] = 0;
770 id = pool_str2id(pool, p, 1);
771 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
772 id = pool_rel2id(pool, idp, id, REL_AND, 1);
777 p[strlen(p) - 1] = 0;
778 id = pool_str2id(pool, p, 1);
779 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
782 repo->idarraydata[i] = id;
784 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
789 while ((p = strchr(dep, ':')) != 0)
796 /* argh, allow pattern: prefix. sigh */
797 if (p - dep == 7 && !strncmp(dep, "pattern", 7))
799 p = strchr(p + 1, ':');
804 idp = pool_str2id(pool, dep, 1);
806 id = pool_rel2id(pool, id, idp, REL_AND, 1);
811 if (dep[0] && dep[1])
813 dep[strlen(dep) - 1] = 0;
814 idp = pool_str2id(pool, dep, 1);
816 id = pool_rel2id(pool, id, idp, REL_AND, 1);
821 repo->idarraydata[i] = id;
823 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
825 strcpy(buf, dep + 11);
826 if ((p = strrchr(buf, ')')) != 0)
828 id = pool_str2id(pool, buf, 1);
829 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
830 repo->idarraydata[i] = id;
834 if (freshens && repo->idarraydata[freshens])
836 Id idsupp = 0, idfresh = 0;
837 if (!supplements || !repo->idarraydata[supplements])
839 for (i = supplements; repo->idarraydata[i]; i++)
842 idsupp = repo->idarraydata[i];
844 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
846 for (i = freshens; repo->idarraydata[i]; i++)
849 idfresh = repo->idarraydata[i];
851 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
856 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
857 supplements = repo_addid_dep(repo, 0, idsupp, 0);
863 repo_fix_conflicts(Repo *repo, Offset conflicts)
865 char buf[1024], *p, *dep;
866 Pool *pool = repo->pool;
872 for (i = conflicts; repo->idarraydata[i]; i++)
874 id = repo->idarraydata[i];
877 dep = (char *)pool_id2str(pool, id);
878 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
880 strcpy(buf, dep + 15);
881 if ((p = strchr(buf, ')')) != 0)
883 id = pool_str2id(pool, buf, 1);
884 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
885 repo->idarraydata[i] = id;
891 /***********************************************************************/
899 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
904 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
906 struct matchdata *md = cbdata;
908 if (md->matcher.match)
911 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
912 if (!datamatcher_checkbasename(&md->matcher, kv->str))
914 if (!(str = repodata_stringify(md->pool, data, key, kv, md->flags)))
916 if (!datamatcher_match(&md->matcher, str))
919 md->stop = md->callback(md->callback_data, s, data, key, kv);
924 /* list of all keys we store in the solvable */
925 /* also used in the dataiterator code in repodata.c */
926 Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
927 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
928 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
929 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
930 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
931 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
932 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
933 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
934 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
935 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
936 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
937 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
938 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
939 { RPM_RPMDBID, REPOKEY_TYPE_NUM, 0, KEY_STORAGE_SOLVABLE },
943 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
948 for (; *ida && !md->stop; ida++)
951 kv.eof = ida[1] ? 0 : 1;
952 repo_matchvalue(md, s, 0, repo_solvablekeys + (keyname - SOLVABLE_NAME), &kv);
958 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
961 Pool *pool = repo->pool;
970 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
973 repo_search_md(repo, p, keyname, md);
974 if (md->stop > SEARCH_NEXT_SOLVABLE)
980 /* The callback only supports solvables, so we can't iterate over the
984 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
986 s = pool->solvables + p;
994 repo_matchvalue(md, s, 0, repo_solvablekeys + 0, &kv);
996 if (keyname || md->stop > SEARCH_NEXT_KEY)
1002 repo_matchvalue(md, s, 0, repo_solvablekeys + 1, &kv);
1004 if (keyname || md->stop > SEARCH_NEXT_KEY)
1010 repo_matchvalue(md, s, 0, repo_solvablekeys + 2, &kv);
1012 if (keyname || md->stop > SEARCH_NEXT_KEY)
1014 case SOLVABLE_VENDOR:
1018 repo_matchvalue(md, s, 0, repo_solvablekeys + 3, &kv);
1020 if (keyname || md->stop > SEARCH_NEXT_KEY)
1022 case SOLVABLE_PROVIDES:
1024 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
1025 if (keyname || md->stop > SEARCH_NEXT_KEY)
1027 case SOLVABLE_OBSOLETES:
1029 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
1030 if (keyname || md->stop > SEARCH_NEXT_KEY)
1032 case SOLVABLE_CONFLICTS:
1034 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
1035 if (keyname || md->stop > SEARCH_NEXT_KEY)
1037 case SOLVABLE_REQUIRES:
1039 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
1040 if (keyname || md->stop > SEARCH_NEXT_KEY)
1042 case SOLVABLE_RECOMMENDS:
1044 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
1045 if (keyname || md->stop > SEARCH_NEXT_KEY)
1047 case SOLVABLE_SUPPLEMENTS:
1049 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
1050 if (keyname || md->stop > SEARCH_NEXT_KEY)
1052 case SOLVABLE_SUGGESTS:
1054 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
1055 if (keyname || md->stop > SEARCH_NEXT_KEY)
1057 case SOLVABLE_ENHANCES:
1059 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
1060 if (keyname || md->stop > SEARCH_NEXT_KEY)
1065 kv.num = repo->rpmdbid[p - repo->start];
1067 repo_matchvalue(md, s, 0, repo_solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
1069 if (keyname || md->stop > SEARCH_NEXT_KEY)
1077 FOR_REPODATAS(repo, i, data)
1079 if (p < data->start || p >= data->end)
1081 if (keyname && !repodata_precheck_keyname(data, keyname))
1083 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
1085 /* do not search filelist extensions */
1086 if (data->state != REPODATA_AVAILABLE)
1088 for (j = 1; j < data->nkeys; j++)
1089 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1091 if (j == data->nkeys)
1094 if (data->state == REPODATA_STUB)
1098 for (j = 1; j < data->nkeys; j++)
1099 if (keyname == data->keys[j].name)
1101 if (j == data->nkeys)
1105 if (data->loadcallback)
1106 data->loadcallback(data);
1108 data->state = REPODATA_ERROR;
1110 if (data->state == REPODATA_ERROR)
1112 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1113 if (md->stop > SEARCH_NEXT_KEY)
1119 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)
1121 struct matchdata md;
1123 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1125 memset(&md, 0, sizeof(md));
1126 md.pool = repo->pool;
1128 md.callback = callback;
1129 md.callback_data = cbdata;
1131 datamatcher_init(&md.matcher, match, flags);
1132 repo_search_md(repo, p, keyname, &md);
1134 datamatcher_free(&md.matcher);
1138 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1140 Pool *pool = repo->pool;
1150 return pool_id2str(pool, pool->solvables[entry].name);
1152 return pool_id2str(pool, pool->solvables[entry].arch);
1154 return pool_id2str(pool, pool->solvables[entry].evr);
1155 case SOLVABLE_VENDOR:
1156 return pool_id2str(pool, pool->solvables[entry].vendor);
1159 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1160 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1161 FOR_REPODATAS(repo, i, data)
1163 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1165 if (!repodata_precheck_keyname(data, keyname))
1167 str = repodata_lookup_str(data, entry, keyname);
1170 if (repodata_lookup_type(data, entry, keyname))
1178 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned long long notfound)
1180 Pool *pool = repo->pool;
1183 unsigned long long value;
1187 if (keyname == RPM_RPMDBID)
1189 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1190 return repo->rpmdbid[entry - repo->start];
1194 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1195 return repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, &value) ? value : notfound;
1196 FOR_REPODATAS(repo, i, data)
1198 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1200 if (!repodata_precheck_keyname(data, keyname))
1202 if (repodata_lookup_num(data, entry, keyname, &value))
1204 if (repodata_lookup_type(data, entry, keyname))
1211 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1213 Pool *pool = repo->pool;
1223 return repo->pool->solvables[entry].name;
1225 return repo->pool->solvables[entry].arch;
1227 return repo->pool->solvables[entry].evr;
1228 case SOLVABLE_VENDOR:
1229 return repo->pool->solvables[entry].vendor;
1232 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1234 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1235 Id id = repodata_lookup_id(data, entry, keyname);
1236 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1238 FOR_REPODATAS(repo, i, data)
1240 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1242 if (!repodata_precheck_keyname(data, keyname))
1244 id = repodata_lookup_id(data, entry, keyname);
1246 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1247 if (repodata_lookup_type(data, entry, keyname))
1254 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1260 for (p = repo->idarraydata + off; *p; p++)
1266 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1268 Pool *pool = repo->pool;
1275 case SOLVABLE_PROVIDES:
1276 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1277 case SOLVABLE_OBSOLETES:
1278 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1279 case SOLVABLE_CONFLICTS:
1280 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1281 case SOLVABLE_REQUIRES:
1282 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1283 case SOLVABLE_RECOMMENDS:
1284 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1285 case SOLVABLE_SUGGESTS:
1286 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1287 case SOLVABLE_SUPPLEMENTS:
1288 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1289 case SOLVABLE_ENHANCES:
1290 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1293 else if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1295 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1296 if (repodata_lookup_idarray(data, entry, keyname, q))
1298 if (data->localpool)
1300 for (i = 0; i < q->count; i++)
1301 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1306 FOR_REPODATAS(repo, i, data)
1308 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1310 if (!repodata_precheck_keyname(data, keyname))
1312 if (repodata_lookup_idarray(data, entry, keyname, q))
1314 if (data->localpool)
1316 for (i = 0; i < q->count; i++)
1317 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1321 if (repodata_lookup_type(data, entry, keyname))
1329 repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
1331 int r = repo_lookup_idarray(repo, entry, keyname, q);
1334 if (marker == -1 || marker == 1)
1335 marker = solv_depmarker(keyname, marker);
1336 if (marker && q->count)
1342 for (i = 0; i < q->count; i++)
1343 if (q->elements[i] == marker)
1345 queue_truncate(q, i);
1351 for (i = 0; i < q->count; i++)
1352 if (q->elements[i] == marker)
1354 queue_deleten(q, 0, i + 1);
1363 const unsigned char *
1364 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1366 Pool *pool = repo->pool;
1369 const unsigned char *chk;
1371 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1372 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, typep);
1373 FOR_REPODATAS(repo, i, data)
1375 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1377 if (!repodata_precheck_keyname(data, keyname))
1379 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1382 if (repodata_lookup_type(data, entry, keyname))
1390 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1392 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1393 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1397 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1399 Pool *pool = repo->pool;
1404 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1405 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1406 FOR_REPODATAS(repo, i, data)
1408 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1410 if (!repodata_precheck_keyname(data, keyname))
1412 type = repodata_lookup_type(data, entry, keyname);
1414 return type == REPOKEY_TYPE_VOID;
1420 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1422 Pool *pool = repo->pool;
1427 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1428 return repodata_lookup_type(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname);
1429 FOR_REPODATAS(repo, i, data)
1431 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1433 if (!repodata_precheck_keyname(data, keyname))
1435 type = repodata_lookup_type(data, entry, keyname);
1437 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1443 repo_lookup_binary(Repo *repo, Id entry, Id keyname, int *lenp)
1445 Pool *pool = repo->pool;
1450 if (entry == SOLVID_POS && pool->pos.repo == repo && pool->pos.repodataid)
1451 return repodata_lookup_binary(pool->pos.repo->repodata + pool->pos.repodataid, entry, keyname, lenp);
1452 FOR_REPODATAS(repo, i, data)
1454 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1456 if (!repodata_precheck_keyname(data, keyname))
1458 bin = repodata_lookup_binary(data, entry, keyname, lenp);
1466 /***********************************************************************/
1469 repo_add_repodata(Repo *repo, int flags)
1473 if ((flags & REPO_USE_LOADING) != 0)
1475 for (i = repo->nrepodata - 1; i > 0; i--)
1476 if (repo->repodata[i].state == REPODATA_LOADING)
1478 Repodata *data = repo->repodata + i;
1480 /* hack: we mis-use REPO_REUSE_REPODATA here */
1481 if (!(flags & REPO_REUSE_REPODATA))
1482 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1485 return 0; /* must not create a new repodata! */
1487 if ((flags & REPO_REUSE_REPODATA) != 0)
1489 for (i = repo->nrepodata - 1; i > 0; i--)
1490 if (repo->repodata[i].state != REPODATA_STUB)
1491 return repo->repodata + i;
1493 if (!repo->nrepodata)
1495 repo->nrepodata = 2; /* start with id 1 */
1496 repo->repodata = solv_calloc(repo->nrepodata, sizeof(*data));
1501 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
1503 data = repo->repodata + repo->nrepodata - 1;
1504 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1509 repo_id2repodata(Repo *repo, Id id)
1511 return id ? repo->repodata + id : 0;
1515 repo_last_repodata(Repo *repo)
1518 for (i = repo->nrepodata - 1; i > 0; i--)
1519 if (repo->repodata[i].state != REPODATA_STUB)
1520 return repo->repodata + i;
1521 return repo_add_repodata(repo, 0);
1525 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1533 repo->pool->solvables[p].name = id;
1536 repo->pool->solvables[p].arch = id;
1539 repo->pool->solvables[p].evr = id;
1541 case SOLVABLE_VENDOR:
1542 repo->pool->solvables[p].vendor = id;
1546 data = repo_last_repodata(repo);
1547 if (data->localpool)
1548 id = repodata_localize_id(data, id, 1);
1549 repodata_set_id(data, p, keyname, id);
1553 repo_set_num(Repo *repo, Id p, Id keyname, unsigned long long num)
1558 if (keyname == RPM_RPMDBID)
1561 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1562 repo->rpmdbid[p - repo->start] = num;
1566 data = repo_last_repodata(repo);
1567 repodata_set_num(data, p, keyname, num);
1571 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1581 case SOLVABLE_VENDOR:
1582 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1586 data = repo_last_repodata(repo);
1587 repodata_set_str(data, p, keyname, str);
1591 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1601 case SOLVABLE_VENDOR:
1602 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1606 data = repo_last_repodata(repo);
1607 repodata_set_poolstr(data, p, keyname, str);
1611 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1613 Repodata *data = repo_last_repodata(repo);
1614 repodata_add_poolstr_array(data, p, keyname, str);
1618 repo_add_deparray(Repo *repo, Id p, Id keyname, Id dep, Id marker)
1621 if (marker == -1 || marker == 1)
1622 marker = solv_depmarker(keyname, marker);
1625 Solvable *s = repo->pool->solvables + p;
1628 case SOLVABLE_PROVIDES:
1629 s->provides = repo_addid_dep(repo, s->provides, dep, marker);
1631 case SOLVABLE_OBSOLETES:
1632 s->obsoletes = repo_addid_dep(repo, s->obsoletes, dep, marker);
1634 case SOLVABLE_CONFLICTS:
1635 s->conflicts = repo_addid_dep(repo, s->conflicts, dep, marker);
1637 case SOLVABLE_REQUIRES:
1638 s->requires = repo_addid_dep(repo, s->requires, dep, marker);
1640 case SOLVABLE_RECOMMENDS:
1641 s->recommends = repo_addid_dep(repo, s->recommends, dep, marker);
1643 case SOLVABLE_SUGGESTS:
1644 s->suggests = repo_addid_dep(repo, s->suggests, dep, marker);
1646 case SOLVABLE_SUPPLEMENTS:
1647 s->supplements = repo_addid_dep(repo, s->supplements, dep, marker);
1649 case SOLVABLE_ENHANCES:
1650 s->enhances = repo_addid_dep(repo, s->enhances, dep, marker);
1654 data = repo_last_repodata(repo);
1655 repodata_add_idarray(data, p, keyname, dep);
1659 repo_add_idarray(Repo *repo, Id p, Id keyname, Id id)
1661 repo_add_deparray(repo, p, keyname, id, 0);
1665 repo_set_idarray_solvable(Repo *repo, Queue *q)
1669 for (i = 0; i < q->count; i++)
1670 repo_addid_dep(repo, o, q->elements[i], 0);
1675 repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
1678 if (marker == -1 || marker == 1)
1679 marker = solv_depmarker(keyname, marker);
1682 /* complex case, splice old and new arrays */
1686 repo_lookup_deparray(repo, p, keyname, &q2, -marker);
1691 queue_push(&q2, marker);
1692 for (i = 0; i < q->count; i++)
1693 queue_push(&q2, q->elements[i]);
1699 queue_insert(&q2, 0, -marker);
1700 queue_insertn(&q2, 0, q->count, q->elements);
1702 repo_set_deparray(repo, p, keyname, &q2, 0);
1708 Solvable *s = repo->pool->solvables + p;
1711 case SOLVABLE_PROVIDES:
1712 s->provides = repo_set_idarray_solvable(repo, q);
1714 case SOLVABLE_OBSOLETES:
1715 s->obsoletes = repo_set_idarray_solvable(repo, q);
1717 case SOLVABLE_CONFLICTS:
1718 s->conflicts = repo_set_idarray_solvable(repo, q);
1720 case SOLVABLE_REQUIRES:
1721 s->requires = repo_set_idarray_solvable(repo, q);
1723 case SOLVABLE_RECOMMENDS:
1724 s->recommends = repo_set_idarray_solvable(repo, q);
1726 case SOLVABLE_SUGGESTS:
1727 s->suggests = repo_set_idarray_solvable(repo, q);
1729 case SOLVABLE_SUPPLEMENTS:
1730 s->supplements = repo_set_idarray_solvable(repo, q);
1732 case SOLVABLE_ENHANCES:
1733 s->enhances = repo_set_idarray_solvable(repo, q);
1737 data = repo_last_repodata(repo);
1738 repodata_set_idarray(data, p, keyname, q);
1742 repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
1744 repo_set_deparray(repo, p, keyname, q, 0);
1748 repo_unset(Repo *repo, Id p, Id keyname)
1753 Solvable *s = repo->pool->solvables + p;
1765 case SOLVABLE_VENDOR:
1770 repo->rpmdbid[p - repo->start] = 0;
1772 case SOLVABLE_PROVIDES:
1775 case SOLVABLE_OBSOLETES:
1778 case SOLVABLE_CONFLICTS:
1781 case SOLVABLE_REQUIRES:
1784 case SOLVABLE_RECOMMENDS:
1787 case SOLVABLE_SUGGESTS:
1790 case SOLVABLE_SUPPLEMENTS:
1792 case SOLVABLE_ENHANCES:
1799 data = repo_last_repodata(repo);
1800 repodata_unset(data, p, keyname);
1804 repo_internalize(Repo *repo)
1809 FOR_REPODATAS(repo, i, data)
1810 if (data->attrs || data->xattrs)
1811 repodata_internalize(data);
1815 repo_disable_paging(Repo *repo)
1820 FOR_REPODATAS(repo, i, data)
1821 repodata_disable_paging(data);