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 ((Hashval)size * 2 > 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 /***********************************************************************/
676 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
681 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
683 struct matchdata *md = cbdata;
685 if (md->matcher.match)
688 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
689 if (!datamatcher_checkbasename(&md->matcher, kv->str))
691 if (!(str = repodata_stringify(md->pool, data, key, kv, md->flags)))
693 if (!datamatcher_match(&md->matcher, str))
698 /* stringify filelist if requested */
699 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
700 repodata_stringify(md->pool, data, key, kv, md->flags);
702 md->stop = md->callback(md->callback_data, s, data, key, kv);
707 /* list of all keys we store in the solvable */
708 /* also used in the dataiterator code in repodata.c */
709 Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
710 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
711 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
712 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
713 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
714 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
715 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
716 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
717 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
718 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
719 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
720 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
721 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
722 { RPM_RPMDBID, REPOKEY_TYPE_NUM, 0, KEY_STORAGE_SOLVABLE },
726 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
731 for (; *ida && !md->stop; ida++)
734 kv.eof = ida[1] ? 0 : 1;
735 repo_matchvalue(md, s, 0, repo_solvablekeys + (keyname - SOLVABLE_NAME), &kv);
741 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
744 Pool *pool = repo->pool;
754 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
757 repo_search_md(repo, p, keyname, md);
758 if (md->stop > SEARCH_NEXT_SOLVABLE)
763 if (p < 0 && p != SOLVID_META)
764 return; /* SOLVID_POS not supported yet */
766 if (p > 0 && !(flags & SEARCH_NO_STORAGE_SOLVABLE))
768 s = pool->solvables + p;
776 repo_matchvalue(md, s, 0, repo_solvablekeys + 0, &kv);
778 if (keyname || md->stop > SEARCH_NEXT_KEY)
784 repo_matchvalue(md, s, 0, repo_solvablekeys + 1, &kv);
786 if (keyname || md->stop > SEARCH_NEXT_KEY)
792 repo_matchvalue(md, s, 0, repo_solvablekeys + 2, &kv);
794 if (keyname || md->stop > SEARCH_NEXT_KEY)
796 case SOLVABLE_VENDOR:
800 repo_matchvalue(md, s, 0, repo_solvablekeys + 3, &kv);
802 if (keyname || md->stop > SEARCH_NEXT_KEY)
804 case SOLVABLE_PROVIDES:
806 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
807 if (keyname || md->stop > SEARCH_NEXT_KEY)
809 case SOLVABLE_OBSOLETES:
811 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
812 if (keyname || md->stop > SEARCH_NEXT_KEY)
814 case SOLVABLE_CONFLICTS:
816 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
817 if (keyname || md->stop > SEARCH_NEXT_KEY)
819 case SOLVABLE_REQUIRES:
821 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
822 if (keyname || md->stop > SEARCH_NEXT_KEY)
824 case SOLVABLE_RECOMMENDS:
826 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
827 if (keyname || md->stop > SEARCH_NEXT_KEY)
829 case SOLVABLE_SUPPLEMENTS:
831 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
832 if (keyname || md->stop > SEARCH_NEXT_KEY)
834 case SOLVABLE_SUGGESTS:
836 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
837 if (keyname || md->stop > SEARCH_NEXT_KEY)
839 case SOLVABLE_ENHANCES:
841 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
842 if (keyname || md->stop > SEARCH_NEXT_KEY)
847 kv.num = (unsigned int)repo->rpmdbid[p - repo->start];
849 repo_matchvalue(md, s, 0, repo_solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
851 if (keyname || md->stop > SEARCH_NEXT_KEY)
861 if (keyname == SOLVABLE_FILELIST)
862 data = repo_lookup_filelist_repodata(repo, p, &md->matcher);
864 data = repo_lookup_repodata_opt(repo, p, keyname);
866 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
870 keyskip = repo_create_keyskip(repo, p, &md->keyskip);
871 FOR_REPODATAS(repo, i, data)
873 if (p != SOLVID_META && (p < data->start || p >= data->end))
875 repodata_search_keyskip(data, p, keyname, md->flags, keyskip, repo_matchvalue, md);
876 if (md->stop > SEARCH_NEXT_KEY)
882 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)
886 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
888 memset(&md, 0, sizeof(md));
889 md.pool = repo->pool;
891 md.callback = callback;
892 md.callback_data = cbdata;
894 datamatcher_init(&md.matcher, match, flags);
895 repo_search_md(repo, p, keyname, &md);
897 datamatcher_free(&md.matcher);
898 solv_free(md.keyskip);
902 repo_lookup_repodata(Repo *repo, Id entry, Id keyname)
908 if (entry == SOLVID_POS)
910 Pool *pool = repo->pool;
911 return pool->pos.repo == repo && pool->pos.repodataid ? pool->pos.repo->repodata + pool->pos.repodataid : 0;
913 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
915 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
917 if (!repodata_precheck_keyname(data, keyname))
919 if ((type = repodata_lookup_type(data, entry, keyname)) != 0)
920 return type == REPOKEY_TYPE_DELETED ? 0 : data;
925 /* like repo_lookup_repodata, but may return a repodata that contains no match instead of NULL */
927 repo_lookup_repodata_opt(Repo *repo, Id entry, Id keyname)
929 Repodata *data, *found = 0;
933 if (entry == SOLVID_POS)
935 Pool *pool = repo->pool;
936 return pool->pos.repo == repo && pool->pos.repodataid ? pool->pos.repo->repodata + pool->pos.repodataid : 0;
938 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
940 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
942 if (!repodata_precheck_keyname(data, keyname))
944 if (found && (type = repodata_lookup_type(found, entry, keyname)) != 0)
945 return type == REPOKEY_TYPE_DELETED ? 0 : found;
952 repo_lookup_filelist_repodata(Repo *repo, Id entry, Datamatcher *matcher)
959 if (entry <= 0 || !matcher || !matcher->match || ((matcher->flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_STRING
960 && (matcher->flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_GLOB))
961 return repo_lookup_repodata_opt(repo, entry, SOLVABLE_FILELIST); /* cannot use filtered filelist */
964 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
966 if (entry < data->start || entry >= data->end)
968 if (data->filelisttype == REPODATA_FILELIST_FILTERED)
970 if (data->state != REPODATA_AVAILABLE)
972 if (data->state != REPODATA_STUB)
975 if (data->state != REPODATA_AVAILABLE || entry < data->start || entry >= data->end)
978 /* does this contain any data about the solvable we're looking for? */
979 if (!data->incoreoffset[entry - data->start])
980 continue; /* no, ignore */
981 if (haveextension && repodata_filelistfilter_matches(data, matcher->match))
983 break; /* fall back to normal code */
985 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
987 if (data->filelisttype == REPODATA_FILELIST_EXTENSION)
992 if ((type = repodata_lookup_type(data, entry, SOLVABLE_FILELIST)) != 0)
995 break; /* need to look in extension */
996 return type == REPOKEY_TYPE_DELETED ? 0 : data;
999 /* cannot use filtered filelist */
1000 return repo_lookup_repodata_opt(repo, entry, SOLVABLE_FILELIST);
1004 /* the keyskip array has the following format:
1005 * 0: keyname area size
1008 * 3: entry for keyname 0
1009 * 4: entry for keyname 1
1013 repo_create_keyskip(Repo *repo, Id entry, Id **oldkeyskip)
1015 Repodata *data, *last = 0;
1019 if (repo->nrepodata <= 2)
1020 return 0; /* just one repodata, nothing to filter */
1021 keyskip = oldkeyskip ? *oldkeyskip : 0;
1024 if (keyskip[1] >= 0x10000000)
1025 keyskip = solv_free(keyskip);
1027 keyskip[1] = keyskip[2];
1029 FOR_REPODATAS(repo, rdid, data)
1031 if (entry != SOLVID_META)
1033 if (data->state != REPODATA_AVAILABLE && data->state != REPODATA_LOADING)
1035 if (data->state != REPODATA_STUB)
1037 repodata_load(data);
1038 if (data->state != REPODATA_AVAILABLE)
1041 if ((entry < data->start || entry >= data->end))
1043 if (!data->incoreoffset[entry - data->start])
1047 keyskip = repodata_fill_keyskip(last, entry, keyskip);
1054 *oldkeyskip = keyskip;
1057 keyskip = repodata_fill_keyskip(last, entry, keyskip);
1059 keyskip[2] = keyskip[1] + repo->nrepodata;
1061 *oldkeyskip = keyskip;
1066 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1072 Pool *pool = repo->pool;
1076 return pool_id2str(pool, pool->solvables[entry].name);
1078 return pool_id2str(pool, pool->solvables[entry].arch);
1080 return pool_id2str(pool, pool->solvables[entry].evr);
1081 case SOLVABLE_VENDOR:
1082 return pool_id2str(pool, pool->solvables[entry].vendor);
1085 data = repo_lookup_repodata_opt(repo, entry, keyname);
1086 return data ? repodata_lookup_str(data, entry, keyname) : 0;
1091 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned long long notfound)
1097 if (keyname == RPM_RPMDBID)
1099 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1100 return (unsigned int)repo->rpmdbid[entry - repo->start];
1104 data = repo_lookup_repodata_opt(repo, entry, keyname);
1105 return data ? repodata_lookup_num(data, entry, keyname, notfound) : notfound;
1109 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1119 return repo->pool->solvables[entry].name;
1121 return repo->pool->solvables[entry].arch;
1123 return repo->pool->solvables[entry].evr;
1124 case SOLVABLE_VENDOR:
1125 return repo->pool->solvables[entry].vendor;
1128 data = repo_lookup_repodata_opt(repo, entry, keyname);
1129 if (data && (id = repodata_lookup_id(data, entry, keyname)) != 0)
1130 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1135 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1141 for (p = repo->idarraydata + off; *p; p++)
1147 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1155 case SOLVABLE_PROVIDES:
1156 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1157 case SOLVABLE_OBSOLETES:
1158 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1159 case SOLVABLE_CONFLICTS:
1160 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1161 case SOLVABLE_REQUIRES:
1162 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1163 case SOLVABLE_RECOMMENDS:
1164 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1165 case SOLVABLE_SUGGESTS:
1166 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1167 case SOLVABLE_SUPPLEMENTS:
1168 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1169 case SOLVABLE_ENHANCES:
1170 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1173 data = repo_lookup_repodata_opt(repo, entry, keyname);
1174 if (data && repodata_lookup_idarray(data, entry, keyname, q))
1176 if (data->localpool)
1178 for (i = 0; i < q->count; i++)
1179 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1188 repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
1190 int r = repo_lookup_idarray(repo, entry, keyname, q);
1193 if (marker == -1 || marker == 1)
1194 marker = solv_depmarker(keyname, marker);
1195 if (marker && q->count)
1201 for (i = 0; i < q->count; i++)
1202 if (q->elements[i] == marker)
1204 queue_truncate(q, i);
1210 for (i = 0; i < q->count; i++)
1211 if (q->elements[i] == marker)
1213 queue_deleten(q, 0, i + 1);
1222 const unsigned char *
1223 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1225 const unsigned char *chk;
1226 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1227 if (data && (chk = repodata_lookup_bin_checksum(data, entry, keyname, typep)) != 0)
1234 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1236 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1237 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1241 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1243 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1245 return repodata_lookup_void(data, entry, keyname);
1250 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1254 if (keyname >= SOLVABLE_NAME && keyname <= RPM_RPMDBID)
1255 return repo_solvablekeys[keyname - SOLVABLE_NAME].type;
1256 data = repo_lookup_repodata_opt(repo, entry, keyname);
1257 if (data && (type = repodata_lookup_type(data, entry, keyname)) != 0 && type != REPOKEY_TYPE_DELETED)
1263 repo_lookup_binary(Repo *repo, Id entry, Id keyname, int *lenp)
1266 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1267 if (data && (bin = repodata_lookup_binary(data, entry, keyname, lenp)) != 0)
1273 /***********************************************************************/
1276 repo_add_repodata(Repo *repo, int flags)
1280 if ((flags & REPO_USE_LOADING) != 0)
1282 for (i = repo->nrepodata - 1; i > 0; i--)
1283 if (repo->repodata[i].state == REPODATA_LOADING)
1285 Repodata *data = repo->repodata + i;
1287 /* hack: we mis-use REPO_REUSE_REPODATA here */
1288 if (!(flags & REPO_REUSE_REPODATA))
1289 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1292 return 0; /* must not create a new repodata! */
1294 if ((flags & REPO_REUSE_REPODATA) != 0)
1296 for (i = repo->nrepodata - 1; i > 0; i--)
1297 if (repo->repodata[i].state != REPODATA_STUB)
1298 return repo->repodata + i;
1300 if (!repo->nrepodata)
1302 repo->nrepodata = 2; /* start with id 1 */
1303 repo->repodata = solv_calloc(repo->nrepodata, sizeof(*data));
1308 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
1310 data = repo->repodata + repo->nrepodata - 1;
1311 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1316 repo_id2repodata(Repo *repo, Id id)
1318 return id ? repo->repodata + id : 0;
1322 repo_last_repodata(Repo *repo)
1325 for (i = repo->nrepodata - 1; i > 0; i--)
1326 if (repo->repodata[i].state != REPODATA_STUB)
1327 return repo->repodata + i;
1328 return repo_add_repodata(repo, 0);
1332 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1340 repo->pool->solvables[p].name = id;
1343 repo->pool->solvables[p].arch = id;
1346 repo->pool->solvables[p].evr = id;
1348 case SOLVABLE_VENDOR:
1349 repo->pool->solvables[p].vendor = id;
1353 data = repo_last_repodata(repo);
1354 if (data->localpool)
1355 id = repodata_localize_id(data, id, 1);
1356 repodata_set_id(data, p, keyname, id);
1360 repo_set_num(Repo *repo, Id p, Id keyname, unsigned long long num)
1365 if (keyname == RPM_RPMDBID)
1368 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1369 repo->rpmdbid[p - repo->start] = (Id)num;
1373 data = repo_last_repodata(repo);
1374 repodata_set_num(data, p, keyname, num);
1378 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1388 case SOLVABLE_VENDOR:
1389 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1393 data = repo_last_repodata(repo);
1394 repodata_set_str(data, p, keyname, str);
1398 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1408 case SOLVABLE_VENDOR:
1409 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1413 data = repo_last_repodata(repo);
1414 repodata_set_poolstr(data, p, keyname, str);
1418 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1420 Repodata *data = repo_last_repodata(repo);
1421 repodata_add_poolstr_array(data, p, keyname, str);
1425 repo_add_deparray(Repo *repo, Id p, Id keyname, Id dep, Id marker)
1428 if (marker == -1 || marker == 1)
1429 marker = solv_depmarker(keyname, marker);
1432 Solvable *s = repo->pool->solvables + p;
1435 case SOLVABLE_PROVIDES:
1436 s->provides = repo_addid_dep(repo, s->provides, dep, marker);
1438 case SOLVABLE_OBSOLETES:
1439 s->obsoletes = repo_addid_dep(repo, s->obsoletes, dep, marker);
1441 case SOLVABLE_CONFLICTS:
1442 s->conflicts = repo_addid_dep(repo, s->conflicts, dep, marker);
1444 case SOLVABLE_REQUIRES:
1445 s->requires = repo_addid_dep(repo, s->requires, dep, marker);
1447 case SOLVABLE_RECOMMENDS:
1448 s->recommends = repo_addid_dep(repo, s->recommends, dep, marker);
1450 case SOLVABLE_SUGGESTS:
1451 s->suggests = repo_addid_dep(repo, s->suggests, dep, marker);
1453 case SOLVABLE_SUPPLEMENTS:
1454 s->supplements = repo_addid_dep(repo, s->supplements, dep, marker);
1456 case SOLVABLE_ENHANCES:
1457 s->enhances = repo_addid_dep(repo, s->enhances, dep, marker);
1461 data = repo_last_repodata(repo);
1462 repodata_add_idarray(data, p, keyname, dep);
1466 repo_add_idarray(Repo *repo, Id p, Id keyname, Id id)
1468 repo_add_deparray(repo, p, keyname, id, 0);
1472 repo_set_idarray_solvable(Repo *repo, Queue *q)
1476 for (i = 0; i < q->count; i++)
1477 repo_addid_dep(repo, o, q->elements[i], 0);
1482 repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
1485 if (marker == -1 || marker == 1)
1486 marker = solv_depmarker(keyname, marker);
1489 /* complex case, splice old and new arrays */
1493 repo_lookup_deparray(repo, p, keyname, &q2, -marker);
1498 queue_push(&q2, marker);
1499 for (i = 0; i < q->count; i++)
1500 queue_push(&q2, q->elements[i]);
1506 queue_insert(&q2, 0, -marker);
1507 queue_insertn(&q2, 0, q->count, q->elements);
1509 repo_set_deparray(repo, p, keyname, &q2, 0);
1515 Solvable *s = repo->pool->solvables + p;
1518 case SOLVABLE_PROVIDES:
1519 s->provides = repo_set_idarray_solvable(repo, q);
1521 case SOLVABLE_OBSOLETES:
1522 s->obsoletes = repo_set_idarray_solvable(repo, q);
1524 case SOLVABLE_CONFLICTS:
1525 s->conflicts = repo_set_idarray_solvable(repo, q);
1527 case SOLVABLE_REQUIRES:
1528 s->requires = repo_set_idarray_solvable(repo, q);
1530 case SOLVABLE_RECOMMENDS:
1531 s->recommends = repo_set_idarray_solvable(repo, q);
1533 case SOLVABLE_SUGGESTS:
1534 s->suggests = repo_set_idarray_solvable(repo, q);
1536 case SOLVABLE_SUPPLEMENTS:
1537 s->supplements = repo_set_idarray_solvable(repo, q);
1539 case SOLVABLE_ENHANCES:
1540 s->enhances = repo_set_idarray_solvable(repo, q);
1544 data = repo_last_repodata(repo);
1545 repodata_set_idarray(data, p, keyname, q);
1549 repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
1551 repo_set_deparray(repo, p, keyname, q, 0);
1555 repo_unset(Repo *repo, Id p, Id keyname)
1560 Solvable *s = repo->pool->solvables + p;
1572 case SOLVABLE_VENDOR:
1577 repo->rpmdbid[p - repo->start] = 0;
1579 case SOLVABLE_PROVIDES:
1582 case SOLVABLE_OBSOLETES:
1585 case SOLVABLE_CONFLICTS:
1588 case SOLVABLE_REQUIRES:
1591 case SOLVABLE_RECOMMENDS:
1594 case SOLVABLE_SUGGESTS:
1597 case SOLVABLE_SUPPLEMENTS:
1599 case SOLVABLE_ENHANCES:
1606 data = repo_last_repodata(repo);
1607 repodata_unset(data, p, keyname);
1611 repo_internalize(Repo *repo)
1616 FOR_REPODATAS(repo, i, data)
1617 if (data->attrs || data->xattrs)
1618 repodata_internalize(data);
1622 repo_disable_paging(Repo *repo)
1627 FOR_REPODATAS(repo, i, data)
1628 repodata_disable_paging(data);