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));
46 pool->nrepos = 1; /* start with repoid 1 */
47 pool->repos = (Repo **)solv_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
48 pool->repos[pool->nrepos] = repo;
50 repo->repoid = pool->nrepos++;
51 repo->name = name ? solv_strdup(name) : 0;
53 repo->start = pool->nsolvables;
54 repo->end = pool->nsolvables;
60 repo_freedata(Repo *repo)
63 for (i = 0; i < repo->nrepodata; i++)
64 repodata_freedata(repo->repodata + i);
65 solv_free(repo->repodata);
66 solv_free(repo->idarraydata);
67 solv_free(repo->rpmdbid);
68 solv_free(repo->lastidhash);
69 solv_free((char *)repo->name);
73 /* delete all solvables and repodata blocks from this repo */
76 repo_empty(Repo *repo, int reuseids)
78 Pool *pool = repo->pool;
82 pool_freewhatprovides(pool);
83 if (reuseids && repo->end == pool->nsolvables)
85 /* it's ok to reuse the ids. As this is the last repo, we can
86 just shrink the solvable array */
87 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
90 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
92 /* zero out (i.e. free) solvables belonging to this repo */
93 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
95 memset(s, 0, sizeof(*s));
98 /* free all data belonging to this repo */
99 repo->idarraydata = solv_free(repo->idarraydata);
100 repo->idarraysize = 0;
102 repo->rpmdbid = solv_free(repo->rpmdbid);
103 for (i = 0; i < repo->nrepodata; i++)
104 repodata_freedata(repo->repodata + i);
105 solv_free(repo->repodata);
111 * remove repo from pool, delete solvables
116 repo_free(Repo *repo, int reuseids)
118 Pool *pool = repo->pool;
121 if (repo == pool->installed)
123 repo_empty(repo, reuseids);
124 for (i = 1; i < pool->nrepos; i++) /* find repo in pool */
125 if (pool->repos[i] == repo)
127 if (i == pool->nrepos) /* repo not in pool, return */
129 if (i == pool->nrepos - 1 && reuseids)
138 repo_add_solvable(Repo *repo)
140 Id p = pool_add_solvable(repo->pool);
141 if (!repo->start || repo->start == repo->end)
142 repo->start = repo->end = p;
143 /* warning: sidedata must be extended before adapting start/end */
145 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, 1);
148 if (p + 1 > repo->end)
151 repo->pool->solvables[p].repo = repo;
156 repo_add_solvable_block(Repo *repo, int count)
162 p = pool_add_solvable_block(repo->pool, count);
163 if (!repo->start || repo->start == repo->end)
164 repo->start = repo->end = p;
165 /* warning: sidedata must be extended before adapting start/end */
167 repo->rpmdbid = (Id *)repo_sidedata_extend(repo, repo->rpmdbid, sizeof(Id), p, count);
170 if (p + count > repo->end)
171 repo->end = p + count;
172 repo->nsolvables += count;
173 for (s = repo->pool->solvables + p; count--; s++)
179 repo_free_solvable(Repo *repo, Id p, int reuseids)
181 repo_free_solvable_block(repo, p, 1, reuseids);
185 repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
190 if (start + count == repo->end)
192 repo->nsolvables -= count;
193 for (s = repo->pool->solvables + start, i = count; i--; s++)
195 pool_free_solvable_block(repo->pool, start, count, reuseids);
196 FOR_REPODATAS(repo, i, data)
197 if (data->end > repo->end)
198 repodata_shrink(data, repo->end);
202 /* repository sidedata is solvable data allocated on demand.
203 * It is used for data that is normally not present
204 * in the solvable like the rpmdbid.
205 * The solvable allocation funcions need to make sure that
206 * the sidedata gets extended if new solvables get added.
209 #define REPO_SIDEDATA_BLOCK 63
212 repo_sidedata_create(Repo *repo, size_t size)
214 return solv_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
218 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
220 int n = repo->end - repo->start;
223 int d = repo->start - p;
224 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
225 memmove((char *)b + d * size, b, n * size);
226 memset(b, 0, d * size);
229 if (p + count > repo->end)
231 int d = p + count - repo->end;
232 b = solv_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
233 memset((char *)b + n * size, 0, d * size);
239 * add Id to idarraydata used to store dependencies
240 * olddeps: old array offset to extend
241 * returns new array offset
245 repo_addid(Repo *repo, Offset olddeps, Id id)
251 idarray = repo->idarraydata;
252 idarraysize = repo->idarraysize;
254 if (!idarray) /* alloc idarray if not done yet */
257 idarray = solv_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
262 if (!olddeps) /* no deps yet */
264 olddeps = idarraysize;
265 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
267 else if (olddeps == repo->lastoff) /* extend at end */
269 else /* can't extend, copy old */
272 olddeps = idarraysize;
273 for (; idarray[i]; i++)
275 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
276 idarray[idarraysize++] = idarray[i];
278 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
281 idarray[idarraysize++] = id; /* insert Id into array */
282 idarray = solv_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
283 idarray[idarraysize++] = 0; /* ensure NULL termination */
285 repo->idarraydata = idarray;
286 repo->idarraysize = idarraysize;
287 repo->lastoff = olddeps;
292 #define REPO_ADDID_DEP_HASHTHRES 64
293 #define REPO_ADDID_DEP_HASHMIN 128
296 * Optimization for packages with an excessive amount of provides/requires:
297 * if the number of deps exceed a threshold, we build a hash of the already
301 repo_addid_dep_hash(Repo *repo, Offset olddeps, Id id, Id marker, int size)
320 /* maintain hash and lastmarkerpos */
321 if (repo->lastidhash_idarraysize != repo->idarraysize || size * 2 > repo->lastidhash_mask || repo->lastmarker != marker)
323 repo->lastmarkerpos = 0;
324 if (size * 2 > repo->lastidhash_mask)
326 repo->lastidhash_mask = mkmask(size < REPO_ADDID_DEP_HASHMIN ? REPO_ADDID_DEP_HASHMIN : size);
327 repo->lastidhash = solv_realloc2(repo->lastidhash, repo->lastidhash_mask + 1, sizeof(Id));
329 memset(repo->lastidhash, 0, (repo->lastidhash_mask + 1) * sizeof(Id));
330 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
332 h = oid & repo->lastidhash_mask;
333 hh = HASHCHAIN_START;
334 while (repo->lastidhash[h] != 0)
335 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
336 repo->lastidhash[h] = oid;
337 if (marker && oid == marker)
338 repo->lastmarkerpos = oidp - repo->idarraydata;
340 repo->lastmarker = marker;
341 repo->lastidhash_idarraysize = repo->idarraysize;
344 /* check the hash! */
345 h = id & repo->lastidhash_mask;
346 hh = HASHCHAIN_START;
347 while ((hid = repo->lastidhash[h]) != 0 && hid != id)
348 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
349 /* put new element in hash */
351 repo->lastidhash[h] = id;
352 else if (marker == SOLVABLE_FILEMARKER && (!before || !repo->lastmarkerpos))
354 if (marker && !before && !repo->lastmarkerpos)
356 /* we have to add the marker first */
357 repo->lastmarkerpos = repo->idarraysize - 1;
358 olddeps = repo_addid(repo, olddeps, marker);
359 /* now put marker in hash */
360 h = marker & repo->lastidhash_mask;
361 hh = HASHCHAIN_START;
362 while (repo->lastidhash[h] != 0)
363 h = HASHCHAIN_NEXT(h, hh, repo->lastidhash_mask);
364 repo->lastidhash[h] = marker;
365 repo->lastidhash_idarraysize = repo->idarraysize;
369 /* new entry, insert in correct position */
370 if (marker && before && repo->lastmarkerpos)
372 /* need to add it before the marker */
373 olddeps = repo_addid(repo, olddeps, id); /* dummy to make room */
374 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (repo->idarraysize - repo->lastmarkerpos - 2) * sizeof(Id));
375 repo->idarraydata[repo->lastmarkerpos++] = id;
379 /* just append it to the end */
380 olddeps = repo_addid(repo, olddeps, id);
382 repo->lastidhash_idarraysize = repo->idarraysize;
385 /* we already have it in the hash */
388 if (marker == SOLVABLE_FILEMARKER)
390 /* check if it is in the wrong half */
391 /* (we already made sure that "before" and "lastmarkerpos" are set, see above) */
392 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
397 /* yes, wrong half. copy it over */
398 memmove(repo->idarraydata + repo->lastmarkerpos + 1, repo->idarraydata + repo->lastmarkerpos, (oidp - (repo->idarraydata + repo->lastmarkerpos)) * sizeof(Id));
399 repo->idarraydata[repo->lastmarkerpos++] = id;
404 /* check if it is in the correct half */
405 for (oidp = repo->idarraydata + repo->lastmarkerpos + 1; (oid = *oidp) != 0; oidp++)
408 /* nope, copy it over */
409 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
413 return olddeps; /* should not happen */
414 memmove(oidp, oidp + 1, (repo->idarraydata + repo->idarraysize - oidp - 2) * sizeof(Id));
415 repo->idarraydata[repo->idarraysize - 2] = id;
416 repo->lastmarkerpos--; /* marker has been moved */
421 * add dependency (as Id) to repo, also unifies dependencies
422 * olddeps = offset into idarraydata
423 * marker= 0 for normal dep
424 * marker > 0 add dep after marker
425 * marker < 0 add dep before -marker
426 * returns new start of dependency array
429 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
431 Id oid, *oidp, *markerp;
437 olddeps = repo_addid(repo, olddeps, marker);
438 return repo_addid(repo, olddeps, id);
441 /* check if we should use the hash optimization */
442 if (olddeps == repo->lastoff)
444 int size = repo->idarraysize - 1 - repo->lastoff;
445 if (size >= REPO_ADDID_DEP_HASHTHRES)
446 return repo_addid_dep_hash(repo, olddeps, id, marker, size);
463 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
466 return repo_addid(repo, olddeps, id);
470 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != 0; oidp++)
480 if (marker == SOLVABLE_FILEMARKER)
482 if (!markerp || !before)
484 /* we found it, but in the second half */
485 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
489 if (markerp || before)
491 /* we found it, but in the first half */
493 for (; (oid = *oidp) != 0; oidp++)
498 /* no marker in array yet */
501 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
503 return repo_addid(repo, olddeps, id);
507 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
511 /* id not yet in array */
512 if (!before && !markerp)
513 olddeps = repo_addid(repo, olddeps, marker);
514 else if (before && markerp)
519 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
522 return repo_addid(repo, olddeps, id);
528 * make space for 'num' more dependencies
529 * returns new start of dependency array
531 * reserved ids will always begin at offset idarraysize
535 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
537 num++; /* room for trailing ID_NULL */
539 if (!repo->idarraysize) /* ensure buffer space */
541 repo->idarraysize = 1;
542 repo->idarraydata = solv_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
543 repo->idarraydata[0] = 0;
548 if (olddeps && olddeps != repo->lastoff) /* if not appending */
550 /* can't insert into idarray, this would invalidate all 'larger' offsets
551 * so create new space at end and move existing deps there.
552 * Leaving 'hole' at old position.
558 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
560 count = idend - idstart - 1 + num; /* new size */
562 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
563 /* move old deps to end */
564 olddeps = repo->lastoff = repo->idarraysize;
565 memcpy(repo->idarraydata + olddeps, idstart, count - num);
566 repo->idarraysize = olddeps + count - num;
571 if (olddeps) /* appending */
575 repo->idarraydata = solv_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
577 /* appending or new */
578 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
580 return repo->lastoff;
586 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
588 Pool *pool = repo->pool;
590 char buf[1024], *p, *dep;
595 for (i = provides; repo->idarraydata[i]; i++)
597 id = repo->idarraydata[i];
600 dep = (char *)pool_id2str(pool, id);
601 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
604 strcpy(buf + 2, dep);
606 if ((p = strchr(dep, ':')) != 0 && p != dep)
609 idp = pool_str2id(pool, dep, 1);
613 while ((p = strchr(dep, ';')) != 0)
622 strncpy(dep - 9, "language:", 9);
623 idl = pool_str2id(pool, dep - 9, 1);
625 idl = pool_str2id(pool, dep, 1);
626 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
629 id = pool_rel2id(pool, id, idl, REL_OR, 1);
634 if (dep[0] && dep[1])
636 for (p = dep; *p && *p != ')'; p++)
640 strncpy(dep - 9, "language:", 9);
641 idl = pool_str2id(pool, dep - 9, 1);
643 idl = pool_str2id(pool, dep, 1);
644 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
647 id = pool_rel2id(pool, id, idl, REL_OR, 1);
652 id = pool_rel2id(pool, idp, id, REL_AND, 1);
654 supplements = repo_addid_dep(repo, supplements, id, 0);
656 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
661 idp = pool_str2id(pool, buf, 1);
662 /* strip trailing slashes */
664 while (l > 1 && p[l - 1] == '/')
666 id = pool_str2id(pool, p, 1);
667 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
668 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
669 supplements = repo_addid_dep(repo, supplements, id, 0);
675 for (i = supplements; repo->idarraydata[i]; i++)
677 id = repo->idarraydata[i];
680 dep = (char *)pool_id2str(pool, id);
681 if (!strncmp(dep, "system:modalias(", 16))
683 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
686 p = strchr(buf + 9, ':');
687 if (p && p != buf + 9 && strchr(p + 1, ':'))
690 idp = pool_str2id(pool, buf + 9, 1);
691 p[strlen(p) - 1] = 0;
692 id = pool_str2id(pool, p, 1);
693 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
694 id = pool_rel2id(pool, idp, id, REL_AND, 1);
699 p[strlen(p) - 1] = 0;
700 id = pool_str2id(pool, p, 1);
701 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
704 repo->idarraydata[i] = id;
706 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
711 while ((p = strchr(dep, ':')) != 0)
719 idp = pool_str2id(pool, dep, 1);
721 id = pool_rel2id(pool, id, idp, REL_AND, 1);
726 if (dep[0] && dep[1])
728 dep[strlen(dep) - 1] = 0;
729 idp = pool_str2id(pool, dep, 1);
731 id = pool_rel2id(pool, id, idp, REL_AND, 1);
736 repo->idarraydata[i] = id;
738 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
740 strcpy(buf, dep + 11);
741 if ((p = strrchr(buf, ')')) != 0)
743 id = pool_str2id(pool, buf, 1);
744 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
745 repo->idarraydata[i] = id;
749 if (freshens && repo->idarraydata[freshens])
751 Id idsupp = 0, idfresh = 0;
754 for (i = supplements; repo->idarraydata[i]; i++)
757 idsupp = repo->idarraydata[i];
759 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
761 for (i = freshens; repo->idarraydata[i]; i++)
764 idfresh = repo->idarraydata[i];
766 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
771 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
772 supplements = repo_addid_dep(repo, 0, idsupp, 0);
778 repo_fix_conflicts(Repo *repo, Offset conflicts)
780 char buf[1024], *p, *dep;
781 Pool *pool = repo->pool;
787 for (i = conflicts; repo->idarraydata[i]; i++)
789 id = repo->idarraydata[i];
792 dep = (char *)pool_id2str(pool, id);
793 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
795 strcpy(buf, dep + 15);
796 if ((p = strchr(buf, ')')) != 0)
798 id = pool_str2id(pool, buf, 1);
799 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
800 repo->idarraydata[i] = id;
812 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
817 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
819 struct matchdata *md = cbdata;
821 if (md->matcher.match)
823 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
825 if (!datamatcher_match(&md->matcher, kv->str))
828 md->stop = md->callback(md->callback_data, s, data, key, kv);
833 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
834 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
835 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
836 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
837 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
838 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
839 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
840 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
841 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
842 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
843 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
844 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
845 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
846 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
850 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
855 for (; *ida && !md->stop; ida++)
858 kv.eof = ida[1] ? 0 : 1;
859 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
865 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
868 Pool *pool = repo->pool;
877 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
880 repo_search_md(repo, p, keyname, md);
881 if (md->stop > SEARCH_NEXT_SOLVABLE)
887 /* The callback only supports solvables, so we can't iterate over the
891 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
893 s = pool->solvables + p;
901 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
903 if (keyname || md->stop > SEARCH_NEXT_KEY)
909 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
911 if (keyname || md->stop > SEARCH_NEXT_KEY)
917 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
919 if (keyname || md->stop > SEARCH_NEXT_KEY)
921 case SOLVABLE_VENDOR:
925 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
927 if (keyname || md->stop > SEARCH_NEXT_KEY)
929 case SOLVABLE_PROVIDES:
931 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
932 if (keyname || md->stop > SEARCH_NEXT_KEY)
934 case SOLVABLE_OBSOLETES:
936 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
937 if (keyname || md->stop > SEARCH_NEXT_KEY)
939 case SOLVABLE_CONFLICTS:
941 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
942 if (keyname || md->stop > SEARCH_NEXT_KEY)
944 case SOLVABLE_REQUIRES:
946 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
947 if (keyname || md->stop > SEARCH_NEXT_KEY)
949 case SOLVABLE_RECOMMENDS:
951 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
952 if (keyname || md->stop > SEARCH_NEXT_KEY)
954 case SOLVABLE_SUPPLEMENTS:
956 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
957 if (keyname || md->stop > SEARCH_NEXT_KEY)
959 case SOLVABLE_SUGGESTS:
961 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
962 if (keyname || md->stop > SEARCH_NEXT_KEY)
964 case SOLVABLE_ENHANCES:
966 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
967 if (keyname || md->stop > SEARCH_NEXT_KEY)
972 kv.num = repo->rpmdbid[p - repo->start];
973 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
975 if (keyname || md->stop > SEARCH_NEXT_KEY)
983 FOR_REPODATAS(repo, i, data)
985 if (p < data->start || p >= data->end)
987 if (keyname && !repodata_precheck_keyname(data, keyname))
989 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
991 /* do not search filelist extensions */
992 if (data->state != REPODATA_AVAILABLE)
994 for (j = 1; j < data->nkeys; j++)
995 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
997 if (j == data->nkeys)
1000 if (data->state == REPODATA_STUB)
1004 for (j = 1; j < data->nkeys; j++)
1005 if (keyname == data->keys[j].name)
1007 if (j == data->nkeys)
1011 if (data->loadcallback)
1012 data->loadcallback(data);
1014 data->state = REPODATA_ERROR;
1016 if (data->state == REPODATA_ERROR)
1018 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
1019 if (md->stop > SEARCH_NEXT_KEY)
1025 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)
1027 struct matchdata md;
1029 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
1031 memset(&md, 0, sizeof(md));
1032 md.pool = repo->pool;
1034 md.callback = callback;
1035 md.callback_data = cbdata;
1037 datamatcher_init(&md.matcher, match, flags);
1038 repo_search_md(repo, p, keyname, &md);
1040 datamatcher_free(&md.matcher);
1044 repo_lookup_str(Repo *repo, Id entry, Id keyname)
1046 Pool *pool = repo->pool;
1056 return pool_id2str(pool, pool->solvables[entry].name);
1058 return pool_id2str(pool, pool->solvables[entry].arch);
1060 return pool_id2str(pool, pool->solvables[entry].evr);
1061 case SOLVABLE_VENDOR:
1062 return pool_id2str(pool, pool->solvables[entry].vendor);
1065 FOR_REPODATAS(repo, i, data)
1067 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1069 if (!repodata_precheck_keyname(data, keyname))
1071 str = repodata_lookup_str(data, entry, keyname);
1074 if (repodata_lookup_type(data, entry, keyname))
1082 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
1090 if (keyname == RPM_RPMDBID)
1092 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
1093 return repo->rpmdbid[entry - repo->start];
1097 FOR_REPODATAS(repo, i, data)
1099 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1101 if (!repodata_precheck_keyname(data, keyname))
1103 if (repodata_lookup_num(data, entry, keyname, &value))
1105 if (repodata_lookup_type(data, entry, keyname))
1112 repo_lookup_id(Repo *repo, Id entry, Id keyname)
1123 return repo->pool->solvables[entry].name;
1125 return repo->pool->solvables[entry].arch;
1127 return repo->pool->solvables[entry].evr;
1128 case SOLVABLE_VENDOR:
1129 return repo->pool->solvables[entry].vendor;
1132 FOR_REPODATAS(repo, i, data)
1134 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1136 if (!repodata_precheck_keyname(data, keyname))
1138 id = repodata_lookup_id(data, entry, keyname);
1140 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1141 if (repodata_lookup_type(data, entry, keyname))
1148 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
1154 for (p = repo->idarraydata + off; *p; p++)
1160 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
1168 case SOLVABLE_PROVIDES:
1169 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
1170 case SOLVABLE_OBSOLETES:
1171 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
1172 case SOLVABLE_CONFLICTS:
1173 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
1174 case SOLVABLE_REQUIRES:
1175 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
1176 case SOLVABLE_RECOMMENDS:
1177 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
1178 case SOLVABLE_SUGGESTS:
1179 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
1180 case SOLVABLE_SUPPLEMENTS:
1181 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
1182 case SOLVABLE_ENHANCES:
1183 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1186 FOR_REPODATAS(repo, i, data)
1188 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1190 if (!repodata_precheck_keyname(data, keyname))
1192 if (repodata_lookup_idarray(data, entry, keyname, q))
1194 if (data->localpool)
1196 for (i = 0; i < q->count; i++)
1197 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1201 if (repodata_lookup_type(data, entry, keyname))
1208 const unsigned char *
1209 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1213 const unsigned char *chk;
1215 FOR_REPODATAS(repo, i, data)
1217 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1219 if (!repodata_precheck_keyname(data, keyname))
1221 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1224 if (repodata_lookup_type(data, entry, keyname))
1232 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1234 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1235 return chk ? pool_bin2hex(repo->pool, chk, solv_chksum_len(*typep)) : 0;
1239 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1245 FOR_REPODATAS(repo, i, data)
1247 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1249 if (!repodata_precheck_keyname(data, keyname))
1251 type = repodata_lookup_type(data, entry, keyname);
1253 return type == REPOKEY_TYPE_VOID;
1259 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1265 FOR_REPODATAS(repo, i, data)
1267 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1269 if (!repodata_precheck_keyname(data, keyname))
1271 type = repodata_lookup_type(data, entry, keyname);
1273 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1278 /***********************************************************************/
1281 repo_add_repodata(Repo *repo, int flags)
1284 if ((flags & REPO_USE_LOADING) != 0)
1286 for (i = repo->nrepodata - 1; i >= 0; i--)
1287 if (repo->repodata[i].state == REPODATA_LOADING)
1289 Repodata *data = repo->repodata + i;
1291 /* hack: we mis-use REPO_REUSE_REPODATA here */
1292 if (!(flags & REPO_REUSE_REPODATA))
1293 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1296 return 0; /* must not create a new repodata! */
1298 if ((flags & REPO_REUSE_REPODATA) != 0)
1300 for (i = repo->nrepodata - 1; i >= 0; i--)
1301 if (repo->repodata[i].state != REPODATA_STUB)
1302 return repo->repodata + i;
1304 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1308 repo_last_repodata(Repo *repo)
1311 for (i = repo->nrepodata - 1; i >= 0; i--)
1312 if (repo->repodata[i].state != REPODATA_STUB)
1313 return repo->repodata + i;
1314 return repo_add_repodata(repo, 0);
1318 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1326 repo->pool->solvables[p].name = id;
1329 repo->pool->solvables[p].arch = id;
1332 repo->pool->solvables[p].evr = id;
1334 case SOLVABLE_VENDOR:
1335 repo->pool->solvables[p].vendor = id;
1339 data = repo_last_repodata(repo);
1340 if (data->localpool)
1341 id = repodata_localize_id(data, id, 1);
1342 repodata_set_id(data, p, keyname, id);
1346 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1351 if (keyname == RPM_RPMDBID)
1354 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1355 repo->rpmdbid[p] = num;
1359 data = repo_last_repodata(repo);
1360 repodata_set_num(data, p, keyname, num);
1364 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1374 case SOLVABLE_VENDOR:
1375 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1379 data = repo_last_repodata(repo);
1380 repodata_set_str(data, p, keyname, str);
1384 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1394 case SOLVABLE_VENDOR:
1395 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1399 data = repo_last_repodata(repo);
1400 repodata_set_poolstr(data, p, keyname, str);
1404 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1406 Repodata *data = repo_last_repodata(repo);
1407 repodata_add_poolstr_array(data, p, keyname, str);
1411 repo_internalize(Repo *repo)
1416 FOR_REPODATAS(repo, i, data)
1417 if (data->attrs || data->xattrs)
1418 repodata_internalize(data);
1422 repo_disable_paging(Repo *repo)
1427 FOR_REPODATAS(repo, i, data)
1428 repodata_disable_paging(data);
1432 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: