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]);
216 if (data->lasthandle >= dstart && data->lasthandle < dend)
217 data->lasthandle = 0;
219 if (data->incoreoffset)
220 memset(data->incoreoffset + (dstart - data->start), 0, (dend - dstart) * sizeof(Id));
225 /* specialized version of repo_add_solvable_block that inserts the new solvable
226 * block before the indicated repo, which gets relocated.
227 * used in repo_add_rpmdb
230 repo_add_solvable_block_before(Repo *repo, int count, Repo *beforerepo)
232 Pool *pool = repo->pool;
238 if (!count || !beforerepo || beforerepo->end != pool->nsolvables || beforerepo->start == beforerepo->end)
239 return repo_add_solvable_block(repo, count);
240 p = beforerepo->start;
241 /* make sure all solvables belong to beforerepo */
242 for (i = p, s = pool->solvables + i; i < beforerepo->end; i++, s++)
243 if (s->repo && s->repo != beforerepo)
244 return repo_add_solvable_block(repo, count);
245 /* now move beforerepo to back */
246 pool_add_solvable_block(pool, count); /* must return beforerepo->end! */
247 memmove(pool->solvables + p + count, pool->solvables + p, (beforerepo->end - p) * sizeof(Solvable));
248 memset(pool->solvables + p, 0, sizeof(Solvable) * count);
250 FOR_REPODATAS(beforerepo, i, data)
254 data->start += count;
257 beforerepo->start += count;
258 beforerepo->end += count;
259 /* we now have count free solvables at id p */
260 /* warning: sidedata must be extended before adapting start/end */
262 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
265 if (p + count > repo->end)
266 repo->end = p + count;
267 repo->nsolvables += count;
268 for (s = pool->solvables + p; count--; s++)
274 /* repository sidedata is solvable data allocated on demand.
275 * It is used for data that is normally not present
276 * in the solvable like the rpmdbid.
277 * The solvable allocation funcions need to make sure that
278 * the sidedata gets extended if new solvables get added.
281 #define REPO_SIDEDATA_BLOCK 63
284 repo_sidedata_create(Repo *repo, size_t size)
286 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
290 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
292 int n = repo->end - repo->start;
295 int d = repo->start - p;
296 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
297 memmove((char *)b + d * size, b, n * size);
298 memset(b, 0, d * size);
301 if (p + count > repo->end)
303 int d = p + count - repo->end;
304 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
305 memset((char *)b + n * size, 0, d * size);
311 * add Id to idarraydata used to store dependencies
312 * olddeps: old array offset to extend
313 * returns new array offset
317 repo_addid(Repo *repo, Offset olddeps, Id id)
323 idarray = repo->idarraydata;
324 idarraysize = repo->idarraysize;
326 if (!idarray) /* alloc idarray if not done yet */
329 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
334 if (!olddeps) /* no deps yet */
336 olddeps = idarraysize;
337 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
339 else if (olddeps == repo->lastoff) /* extend at end */
341 else /* can't extend, copy old */
344 olddeps = idarraysize;
345 for (; idarray[i]; i++)
347 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
348 idarray[idarraysize++] = idarray[i];
350 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
353 idarray[idarraysize++] = id; /* insert Id into array */
354 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
355 idarray[idarraysize++] = 0; /* ensure NULL termination */
357 repo->idarraydata = idarray;
358 repo->idarraysize = idarraysize;
359 repo->lastoff = olddeps;
364 #define REPO_ADDID_DEP_HASHTHRES 64
365 #define REPO_ADDID_DEP_HASHMIN 128
368 * Optimization for packages with an excessive amount of provides/requires:
369 * if the number of deps exceed a threshold, we build a hash of the already
373 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
392 /* maintain hash and lastmarkerpos */
393 if (repo->lastidhash_idarraysize != repo->idarraysize || (Hashval)size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
395 repo->lastmarkerpos = 0;
396 if ((Hashval)size * 2 > repo->lastidhash_mask)
398 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
399 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
401 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
402 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
404 h = oid & repo->lastidhash_mask;
405 hh = HASHCHAIN_START;
406 while (repo->lastidhash[h] != 0)
407 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
408 repo->lastidhash[h] = oid;
409 if (marker && oid == marker)
410 repo->lastmarkerpos = oidp - repo->idarraydata;
412 repo->lastmarker = marker;
413 repo->lastidhash_idarraysize = repo->idarraysize;
416 /* check the hash! */
417 h = id & repo->lastidhash_mask;
418 hh = HASHCHAIN_START;
419 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
420 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
421 /* put new element in hash */
423 repo->lastidhash[h] = id;
424 else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
426 if (marker && !before && !repo->lastmarkerpos)
428 /* we have to add the marker first */
429 repo->lastmarkerpos = repo->idarraysize - 1;
430 olddeps = repo_addid(repo, olddeps, marker);
431 /* now put marker in hash */
432 h = marker & repo->lastidhash_mask;
433 hh = HASHCHAIN_START;
434 while (repo->lastidhash[h] != 0)
435 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
436 repo->lastidhash[h] = marker;
437 repo->lastidhash_idarraysize = repo->idarraysize;
441 /* new entry, insert in correct position */
442 if (marker && before && repo->lastmarkerpos)
444 /* need to add it before the marker */
445 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
446 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
447 repo->idarraydata[repo->lastmarkerpos++] = id;
451 /* just append it to the end */
452 olddeps = repo_addid(repo, olddeps, id);
454 repo->lastidhash_idarraysize = repo->idarraysize;
457 /* we already have it in the hash */
460 if (marker == SOLVABLE_FILEMARKER)
462 /* check if it is in the wrong half */
463 /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
464 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
469 /* yes, wrong half. copy it over */
470 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
471 repo->idarraydata[repo->lastmarkerpos++] = id;
476 /* check if it is in the correct half */
477 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
480 /* nope, copy it over */
481 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
485 return olddeps; /* should not happen */
486 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
487 repo->idarraydata[repo->idarraysize - 2] = id;
488 repo->lastmarkerpos--; /* marker has been moved */
493 * add dependency (as Id) to repo, also unifies dependencies
494 * olddeps = offset into idarraydata
495 * marker= 0 for normal dep
496 * marker > 0 add dep after marker
497 * marker < 0 add dep before -marker
498 * returns new start of dependency array
501 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
503 Id oid, *oidp, *markerp;
509 olddeps = repo_addid(repo, olddeps, marker);
510 return repo_addid(repo, olddeps, id);
513 /* check if we should use the hash optimization */
514 if (olddeps == repo->lastoff)
516 int size = repo->idarraysize - 1 - repo->lastoff;
517 if (size >= REPO_ADDID_DEP_HASHTHRES)
518 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
535 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
538 return repo_addid(repo, olddeps, id);
542 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
552 if (marker == SOLVABLE_FILEMARKER)
554 if (!markerp || !before)
556 /* we found it, but in the second half */
557 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
561 if (markerp || before)
563 /* we found it, but in the first half */
565 for (; (oid = *oidp) != 0; oidp++)
570 /* no marker in array yet */
573 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
575 return repo_addid(repo, olddeps, id);
579 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
583 /* id not yet in array */
584 if (!before && !markerp)
585 olddeps = repo_addid(repo, olddeps, marker);
586 else if (before && markerp)
591 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
594 return repo_addid(repo, olddeps, id);
597 /* return standard marker for the keyname dependency.
598 * 1: return positive marker, -1: return negative marker
601 solv_depmarker(Id keyname, Id marker)
603 if (marker != 1 && marker != -1)
605 if (keyname == SOLVABLE_PROVIDES)
606 return marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
607 if (keyname == SOLVABLE_REQUIRES)
608 return marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
614 * make space for 'num' more dependencies
615 * returns new start of dependency array
617 * reserved ids will always begin at offset idarraysize
620 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
622 num++; /* room for trailing ID_NULL */
624 if (!repo->idarraysize) /* ensure buffer space */
626 repo->idarraysize = 1;
627 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
628 repo->idarraydata[0] = 0;
633 if (olddeps && olddeps != repo->lastoff) /* if not appending */
635 /* can't insert into idarray, this would invalidate all 'larger' offsets
636 * so create new space at end and move existing deps there.
637 * Leaving 'hole' at old position.
643 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
645 count = idend - idstart - 1 + num; /* new size */
647 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
648 /* move old deps to end */
649 olddeps = repo->lastoff = repo->idarraysize;
650 memcpy(repo->idarraydata + olddeps, idstart, count - num);
651 repo->idarraysize = olddeps + count - num;
656 if (olddeps) /* appending */
660 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
662 /* appending or new */
663 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
665 return repo->lastoff;
669 /***********************************************************************/
678 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
683 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
685 struct matchdata *md = cbdata;
687 if (md->matcher.match)
690 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
691 if (!datamatcher_checkbasename(&md->matcher, kv->str))
693 if (!(str = repodata_stringify(md->pool, data, key, kv, md->flags)))
695 if (!datamatcher_match(&md->matcher, str))
700 /* stringify filelist if requested */
701 if (key->name == SOLVABLE_FILELIST && key->type == REPOKEY_TYPE_DIRSTRARRAY && (md->matcher.flags & SEARCH_FILES) != 0)
702 repodata_stringify(md->pool, data, key, kv, md->flags);
704 md->stop = md->callback(md->callback_data, s, data, key, kv);
709 /* list of all keys we store in the solvable */
710 /* also used in the dataiterator code in repodata.c */
711 Repokey repo_solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
712 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
713 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
714 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
715 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
716 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
717 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
718 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
719 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
720 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
721 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
722 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
723 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
724 { RPM_RPMDBID, REPOKEY_TYPE_NUM, 0, KEY_STORAGE_SOLVABLE },
728 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
733 for (; *ida && !md->stop; ida++)
736 kv.eof = ida[1] ? 0 : 1;
737 repo_matchvalue(md, s, 0, repo_solvablekeys + (keyname - SOLVABLE_NAME), &kv);
743 solvable_offsetptr(Solvable *s, Id keyname)
747 case SOLVABLE_PROVIDES:
749 case SOLVABLE_OBSOLETES:
750 return &s->obsoletes;
751 case SOLVABLE_CONFLICTS:
752 return &s->conflicts;
753 case SOLVABLE_REQUIRES:
755 case SOLVABLE_RECOMMENDS:
756 return &s->recommends;
757 case SOLVABLE_SUGGESTS:
759 case SOLVABLE_SUPPLEMENTS:
760 return &s->supplements;
761 case SOLVABLE_ENHANCES:
769 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
772 Pool *pool = repo->pool;
782 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
785 repo_search_md(repo, p, keyname, md);
786 if (md->stop > SEARCH_NEXT_SOLVABLE)
791 if (p < 0 && p != SOLVID_META)
792 return; /* SOLVID_POS not supported yet */
794 if (p > 0 && !(flags & SEARCH_NO_STORAGE_SOLVABLE))
796 s = pool->solvables + p;
804 repo_matchvalue(md, s, 0, repo_solvablekeys + 0, &kv);
806 if (keyname || md->stop > SEARCH_NEXT_KEY)
812 repo_matchvalue(md, s, 0, repo_solvablekeys + 1, &kv);
814 if (keyname || md->stop > SEARCH_NEXT_KEY)
820 repo_matchvalue(md, s, 0, repo_solvablekeys + 2, &kv);
822 if (keyname || md->stop > SEARCH_NEXT_KEY)
824 case SOLVABLE_VENDOR:
828 repo_matchvalue(md, s, 0, repo_solvablekeys + 3, &kv);
830 if (keyname || md->stop > SEARCH_NEXT_KEY)
832 case SOLVABLE_PROVIDES:
834 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
835 if (keyname || md->stop > SEARCH_NEXT_KEY)
837 case SOLVABLE_OBSOLETES:
839 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
840 if (keyname || md->stop > SEARCH_NEXT_KEY)
842 case SOLVABLE_CONFLICTS:
844 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
845 if (keyname || md->stop > SEARCH_NEXT_KEY)
847 case SOLVABLE_REQUIRES:
849 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
850 if (keyname || md->stop > SEARCH_NEXT_KEY)
852 case SOLVABLE_RECOMMENDS:
854 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
855 if (keyname || md->stop > SEARCH_NEXT_KEY)
857 case SOLVABLE_SUPPLEMENTS:
859 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
860 if (keyname || md->stop > SEARCH_NEXT_KEY)
862 case SOLVABLE_SUGGESTS:
864 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
865 if (keyname || md->stop > SEARCH_NEXT_KEY)
867 case SOLVABLE_ENHANCES:
869 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
870 if (keyname || md->stop > SEARCH_NEXT_KEY)
875 kv.num = (unsigned int)repo->rpmdbid[p - repo->start];
877 repo_matchvalue(md, s, 0, repo_solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
879 if (keyname || md->stop > SEARCH_NEXT_KEY)
889 if (keyname == SOLVABLE_FILELIST)
890 data = repo_lookup_filelist_repodata(repo, p, &md->matcher);
892 data = repo_lookup_repodata_opt(repo, p, keyname);
894 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
898 keyskip = repo_create_keyskip(repo, p, &md->keyskip);
899 FOR_REPODATAS(repo, i, data)
901 if (p != SOLVID_META && (p < data->start || p >= data->end))
903 repodata_search_keyskip(data, p, keyname, md->flags, keyskip, repo_matchvalue, md);
904 if (md->stop > SEARCH_NEXT_KEY)
910 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)
914 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
916 memset(&md, 0, sizeof(md));
917 md.pool = repo->pool;
919 md.callback = callback;
920 md.callback_data = cbdata;
922 datamatcher_init(&md.matcher, match, flags);
923 repo_search_md(repo, p, keyname, &md);
925 datamatcher_free(&md.matcher);
926 solv_free(md.keyskip);
930 repo_lookup_repodata(Repo *repo, Id entry, Id keyname)
936 if (entry == SOLVID_POS)
938 Pool *pool = repo->pool;
939 return pool->pos.repo == repo && pool->pos.repodataid ? pool->pos.repo->repodata + pool->pos.repodataid : 0;
941 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
943 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
945 if (!repodata_precheck_keyname(data, keyname))
947 if ((type = repodata_lookup_type(data, entry, keyname)) != 0)
948 return type == REPOKEY_TYPE_DELETED ? 0 : data;
953 /* like repo_lookup_repodata, but may return a repodata that contains no match instead of NULL */
955 repo_lookup_repodata_opt(Repo *repo, Id entry, Id keyname)
957 Repodata *data, *found = 0;
961 if (entry == SOLVID_POS)
963 Pool *pool = repo->pool;
964 return pool->pos.repo == repo && pool->pos.repodataid ? pool->pos.repo->repodata + pool->pos.repodataid : 0;
966 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
968 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
970 if (!repodata_precheck_keyname(data, keyname))
972 if (found && (type = repodata_lookup_type(found, entry, keyname)) != 0)
973 return type == REPOKEY_TYPE_DELETED ? 0 : found;
980 repo_lookup_filelist_repodata(Repo *repo, Id entry, Datamatcher *matcher)
987 if (entry <= 0 || !matcher || !matcher->match || ((matcher->flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_STRING
988 && (matcher->flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) != SEARCH_GLOB))
989 return repo_lookup_repodata_opt(repo, entry, SOLVABLE_FILELIST); /* cannot use filtered filelist */
992 for (rdid = repo->nrepodata - 1, data = repo->repodata + rdid; rdid > 0; rdid--, data--)
994 if (entry < data->start || entry >= data->end)
996 if (data->filelisttype == REPODATA_FILELIST_FILTERED)
998 if (data->state != REPODATA_AVAILABLE)
1000 if (data->state != REPODATA_STUB)
1002 repodata_load(data);
1003 if (data->state != REPODATA_AVAILABLE || entry < data->start || entry >= data->end)
1006 /* does this contain any data about the solvable we're looking for? */
1007 if (!data->incoreoffset[entry - data->start])
1008 continue; /* no, ignore */
1009 if (haveextension && repodata_filelistfilter_matches(data, matcher->match))
1011 break; /* fall back to normal code */
1013 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1015 if (data->filelisttype == REPODATA_FILELIST_EXTENSION)
1020 if ((type = repodata_lookup_type(data, entry, SOLVABLE_FILELIST)) != 0)
1023 break; /* need to look in extension */
1024 return type == REPOKEY_TYPE_DELETED ? 0 : data;
1027 /* cannot use filtered filelist */
1028 return repo_lookup_repodata_opt(repo, entry, SOLVABLE_FILELIST);
1032 /* the keyskip array has the following format:
1033 * 0: keyname area size
1036 * 3: entry for keyname 0
1037 * 4: entry for keyname 1
1041 repo_create_keyskip(Repo *repo, Id entry, Id **oldkeyskip)
1043 Repodata *data, *last = 0;
1047 if (repo->nrepodata <= 2)
1048 return 0; /* just one repodata, nothing to filter */
1049 keyskip = oldkeyskip ? *oldkeyskip : 0;
1052 if (keyskip[1] >= 0x10000000)
1053 keyskip = solv_free(keyskip);
1055 keyskip[1] = keyskip[2];
1057 FOR_REPODATAS(repo, rdid, data)
1059 if (entry != SOLVID_META)
1061 if (data->state != REPODATA_AVAILABLE && data->state != REPODATA_LOADING)
1063 if (data->state != REPODATA_STUB)
1065 repodata_load(data);
1066 if (data->state != REPODATA_AVAILABLE)
1069 if ((entry < data->start || entry >= data->end))
1071 if (!data->incoreoffset[entry - data->start])
1075 keyskip = repodata_fill_keyskip(last, entry, keyskip);
1082 *oldkeyskip = keyskip;
1085 keyskip = repodata_fill_keyskip(last, entry, keyskip);
1087 keyskip[2] = keyskip[1] + repo->nrepodata;
1089 *oldkeyskip = keyskip;
1094 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1100 Pool *pool = repo->pool;
1104 return pool_id2str(pool, pool->solvables[entry].name);
1106 return pool_id2str(pool, pool->solvables[entry].arch);
1108 return pool_id2str(pool, pool->solvables[entry].evr);
1109 case SOLVABLE_VENDOR:
1110 return pool_id2str(pool, pool->solvables[entry].vendor);
1113 data = repo_lookup_repodata_opt(repo, entry, keyname);
1114 return data ? repodata_lookup_str(data, entry, keyname) : 0;
1119 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned long long notfound)
1125 if (keyname == RPM_RPMDBID)
1127 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1128 return (unsigned int)repo->rpmdbid[entry - repo->start];
1132 data = repo_lookup_repodata_opt(repo, entry, keyname);
1133 return data ? repodata_lookup_num(data, entry, keyname, notfound) : notfound;
1137 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1147 return repo->pool->solvables[entry].name;
1149 return repo->pool->solvables[entry].arch;
1151 return repo->pool->solvables[entry].evr;
1152 case SOLVABLE_VENDOR:
1153 return repo->pool->solvables[entry].vendor;
1156 data = repo_lookup_repodata_opt(repo, entry, keyname);
1157 if (data && (id = repodata_lookup_id(data, entry, keyname)) != 0)
1158 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1163 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1172 case SOLVABLE_PROVIDES:
1173 case SOLVABLE_OBSOLETES:
1174 case SOLVABLE_CONFLICTS:
1175 case SOLVABLE_REQUIRES:
1176 case SOLVABLE_RECOMMENDS:
1177 case SOLVABLE_SUGGESTS:
1178 case SOLVABLE_SUPPLEMENTS:
1179 case SOLVABLE_ENHANCES:
1180 offp = solvable_offsetptr(repo->pool->solvables + entry, keyname);
1184 for (p = repo->idarraydata + *offp; *p; p++)
1190 data = repo_lookup_repodata_opt(repo, entry, keyname);
1191 if (data && repodata_lookup_idarray(data, entry, keyname, q))
1193 if (data->localpool)
1195 for (i = 0; i < q->count; i++)
1196 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1205 repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
1207 int r = repo_lookup_idarray(repo, entry, keyname, q);
1210 if (marker == -1 || marker == 1)
1211 marker = solv_depmarker(keyname, marker);
1212 if (marker && q->count)
1218 for (i = 0; i < q->count; i++)
1219 if (q->elements[i] == marker)
1221 queue_truncate(q, i);
1227 for (i = 0; i < q->count; i++)
1228 if (q->elements[i] == marker)
1230 queue_deleten(q, 0, i + 1);
1239 const unsigned char *
1240 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1242 const unsigned char *chk;
1243 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1244 if (data && (chk = repodata_lookup_bin_checksum(data, entry, keyname, typep)) != 0)
1251 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1253 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1254 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1258 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1260 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1262 return repodata_lookup_void(data, entry, keyname);
1267 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1271 if (keyname >= SOLVABLE_NAME && keyname <= RPM_RPMDBID)
1272 return repo_solvablekeys[keyname - SOLVABLE_NAME].type;
1273 data = repo_lookup_repodata_opt(repo, entry, keyname);
1274 if (data && (type = repodata_lookup_type(data, entry, keyname)) != 0 && type != REPOKEY_TYPE_DELETED)
1280 repo_lookup_binary(Repo *repo, Id entry, Id keyname, int *lenp)
1283 Repodata *data = repo_lookup_repodata_opt(repo, entry, keyname);
1284 if (data && (bin = repodata_lookup_binary(data, entry, keyname, lenp)) != 0)
1291 repo_lookup_count(Repo *repo, Id entry, Id keyname)
1294 if (keyname >= SOLVABLE_NAME && keyname <= RPM_RPMDBID)
1295 if (entry >= 0 && keyname >= SOLVABLE_NAME && keyname <= RPM_RPMDBID)
1302 case SOLVABLE_PROVIDES:
1303 case SOLVABLE_OBSOLETES:
1304 case SOLVABLE_CONFLICTS:
1305 case SOLVABLE_REQUIRES:
1306 case SOLVABLE_RECOMMENDS:
1307 case SOLVABLE_SUGGESTS:
1308 case SOLVABLE_SUPPLEMENTS:
1309 case SOLVABLE_ENHANCES:
1310 offp = solvable_offsetptr(repo->pool->solvables + entry, keyname);
1311 for (cnt = 0, p = repo->idarraydata + *offp; *p; p++)
1317 data = repo_lookup_repodata_opt(repo, entry, keyname);
1318 return data ? repodata_lookup_count(data, entry, keyname) : 0;
1321 /***********************************************************************/
1324 repo_add_repodata(Repo *repo, int flags)
1328 if ((flags & REPO_USE_LOADING) != 0)
1330 for (i = repo->nrepodata - 1; i > 0; i--)
1331 if (repo->repodata[i].state == REPODATA_LOADING)
1333 Repodata *data = repo->repodata + i;
1335 /* hack: we mis-use REPO_REUSE_REPODATA here */
1336 if (!(flags & REPO_REUSE_REPODATA))
1337 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1340 return 0; /* must not create a new repodata! */
1342 if ((flags & REPO_REUSE_REPODATA) != 0)
1344 for (i = repo->nrepodata - 1; i > 0; i--)
1345 if (repo->repodata[i].state != REPODATA_STUB)
1346 return repo->repodata + i;
1348 if (!repo->nrepodata)
1350 repo->nrepodata = 2; /* start with id 1 */
1351 repo->repodata = solv_calloc(repo->nrepodata, sizeof(*data));
1356 repo->repodata = solv_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
1358 data = repo->repodata + repo->nrepodata - 1;
1359 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1364 repo_id2repodata(Repo *repo, Id id)
1366 return id ? repo->repodata + id : 0;
1370 repo_last_repodata(Repo *repo)
1373 for (i = repo->nrepodata - 1; i > 0; i--)
1374 if (repo->repodata[i].state != REPODATA_STUB)
1375 return repo->repodata + i;
1376 return repo_add_repodata(repo, 0);
1380 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1388 repo->pool->solvables[p].name = id;
1391 repo->pool->solvables[p].arch = id;
1394 repo->pool->solvables[p].evr = id;
1396 case SOLVABLE_VENDOR:
1397 repo->pool->solvables[p].vendor = id;
1401 data = repo_last_repodata(repo);
1402 if (data->localpool)
1403 id = repodata_localize_id(data, id, 1);
1404 repodata_set_id(data, p, keyname, id);
1408 repo_set_num(Repo *repo, Id p, Id keyname, unsigned long long num)
1413 if (keyname == RPM_RPMDBID)
1416 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1417 repo->rpmdbid[p - repo->start] = (Id)num;
1421 data = repo_last_repodata(repo);
1422 repodata_set_num(data, p, keyname, num);
1426 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1436 case SOLVABLE_VENDOR:
1437 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1441 data = repo_last_repodata(repo);
1442 repodata_set_str(data, p, keyname, str);
1446 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1456 case SOLVABLE_VENDOR:
1457 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1461 data = repo_last_repodata(repo);
1462 repodata_set_poolstr(data, p, keyname, str);
1466 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1468 Repodata *data = repo_last_repodata(repo);
1469 repodata_add_poolstr_array(data, p, keyname, str);
1473 repo_add_deparray(Repo *repo, Id p, Id keyname, Id dep, Id marker)
1476 if (marker == -1 || marker == 1)
1477 marker = solv_depmarker(keyname, marker);
1483 case SOLVABLE_PROVIDES:
1484 case SOLVABLE_OBSOLETES:
1485 case SOLVABLE_CONFLICTS:
1486 case SOLVABLE_REQUIRES:
1487 case SOLVABLE_RECOMMENDS:
1488 case SOLVABLE_SUGGESTS:
1489 case SOLVABLE_SUPPLEMENTS:
1490 case SOLVABLE_ENHANCES:
1491 offp = solvable_offsetptr(repo->pool->solvables + p, keyname);
1492 *offp = repo_addid_dep(repo, *offp, dep, marker);
1496 data = repo_last_repodata(repo);
1497 repodata_add_idarray(data, p, keyname, dep);
1501 repo_add_idarray(Repo *repo, Id p, Id keyname, Id id)
1503 repo_add_deparray(repo, p, keyname, id, 0);
1507 repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
1510 if (marker == -1 || marker == 1)
1511 marker = solv_depmarker(keyname, marker);
1514 /* complex case, splice old and new arrays */
1518 repo_lookup_deparray(repo, p, keyname, &q2, -marker);
1523 queue_push(&q2, marker);
1524 for (i = 0; i < q->count; i++)
1525 queue_push(&q2, q->elements[i]);
1531 queue_insert(&q2, 0, -marker);
1532 queue_insertn(&q2, 0, q->count, q->elements);
1534 repo_set_deparray(repo, p, keyname, &q2, 0);
1544 case SOLVABLE_PROVIDES:
1545 case SOLVABLE_OBSOLETES:
1546 case SOLVABLE_CONFLICTS:
1547 case SOLVABLE_REQUIRES:
1548 case SOLVABLE_RECOMMENDS:
1549 case SOLVABLE_SUGGESTS:
1550 case SOLVABLE_SUPPLEMENTS:
1551 case SOLVABLE_ENHANCES:
1553 for (i = 0; i < q->count; i++)
1554 off = repo_addid_dep(repo, off, q->elements[i], 0);
1555 offp = solvable_offsetptr(repo->pool->solvables + p, keyname);
1560 data = repo_last_repodata(repo);
1561 repodata_set_idarray(data, p, keyname, q);
1565 repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
1567 repo_set_deparray(repo, p, keyname, q, 0);
1571 repo_unset(Repo *repo, Id p, Id keyname)
1576 Solvable *s = repo->pool->solvables + p;
1588 case SOLVABLE_VENDOR:
1593 repo->rpmdbid[p - repo->start] = 0;
1595 case SOLVABLE_PROVIDES:
1598 case SOLVABLE_OBSOLETES:
1601 case SOLVABLE_CONFLICTS:
1604 case SOLVABLE_REQUIRES:
1607 case SOLVABLE_RECOMMENDS:
1610 case SOLVABLE_SUGGESTS:
1613 case SOLVABLE_SUPPLEMENTS:
1615 case SOLVABLE_ENHANCES:
1622 data = repo_last_repodata(repo);
1623 repodata_unset(data, p, keyname);
1627 repo_internalize(Repo *repo)
1632 FOR_REPODATAS(repo, i, data)
1633 if (data->attrs || data->xattrs)
1634 repodata_internalize(data);
1638 repo_disable_paging(Repo *repo)
1643 FOR_REPODATAS(repo, i, data)
1644 repodata_disable_paging(data);