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"
29 #include "attr_store_p.h"
32 #define IDARRAY_BLOCK 4095
41 repo_create(Pool *pool, const char *name)
45 pool_freewhatprovides(pool);
46 repo = (Repo *)sat_calloc(1, sizeof(*repo));
47 pool->repos = (Repo **)sat_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
48 pool->repos[pool->nrepos++] = repo;
49 repo->repoid = pool->nrepos;
50 repo->name = name ? strdup(name) : 0;
52 repo->start = pool->nsolvables;
53 repo->end = pool->nsolvables;
59 repo_freedata(Repo *repo)
62 for (i = 0; i < repo->nrepodata; i++)
63 repodata_freedata(repo->repodata + i);
64 sat_free(repo->repodata);
65 sat_free(repo->idarraydata);
66 sat_free(repo->rpmdbid);
67 sat_free((char *)repo->name);
71 /* delete all solvables and repodata blocks from this repo */
74 repo_empty(Repo *repo, int reuseids)
76 Pool *pool = repo->pool;
80 pool_freewhatprovides(pool);
81 if (repo == pool->installed)
84 if (reuseids && repo->end == pool->nsolvables)
86 /* it's ok to reuse the ids. As this is the last repo, we can
87 just shrink the solvable array */
88 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
91 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
93 /* zero out (i.e. free) solvables belonging to this repo */
94 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
96 memset(s, 0, sizeof(*s));
99 /* free all data belonging to this repo */
100 repo->idarraydata = sat_free(repo->idarraydata);
101 repo->idarraysize = 0;
103 repo->rpmdbid = sat_free(repo->rpmdbid);
104 for (i = 0; i < repo->nrepodata; i++)
105 repodata_freedata(repo->repodata + i);
106 sat_free(repo->repodata);
112 * remove repo from pool, delete solvables
117 repo_free(Repo *repo, int reuseids)
119 Pool *pool = repo->pool;
122 repo_empty(repo, reuseids);
123 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
124 if (pool->repos[i] == repo)
126 if (i == pool->nrepos) /* repo not in pool, return */
128 if (i < pool->nrepos - 1)
130 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
132 for (; i < pool->nrepos - 1; i++)
133 pool->repos[i]->repoid = i + 1;
140 repo_freeallrepos(Pool *pool, int reuseids)
144 pool_freewhatprovides(pool);
145 for (i = 0; i < pool->nrepos; i++)
146 repo_freedata(pool->repos[i]);
147 pool->repos = sat_free(pool->repos);
149 /* the first two solvables don't belong to a repo */
150 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
153 void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
158 if (start + count == repo->end)
160 repo->nsolvables -= count;
161 for (s = repo->pool->solvables + start, i = count; i--; s++)
163 pool_free_solvable_block(repo->pool, start, count, reuseids);
164 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
165 if (data->end > repo->end)
166 repodata_shrink(data, repo->end);
170 /* repository sidedata is solvable data allocated on demand.
171 * It is used for data that is normally not present
172 * in the solvable like the rpmdbid.
173 * The solvable allocation funcions need to make sure that
174 * the sidedata gets extended if new solvables get added.
177 #define REPO_SIDEDATA_BLOCK 63
180 repo_sidedata_create(Repo *repo, size_t size)
182 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
186 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
188 int n = repo->end - repo->start;
191 int d = repo->start - p;
192 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
193 memmove((char *)b + d * size, b, n * size);
194 memset(b, 0, d * size);
197 if (p + count > repo->end)
199 int d = p + count - repo->end;
200 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
201 memset((char *)b + n * size, 0, d * size);
207 * add Id to idarraydata used to store dependencies
208 * olddeps: old array offset to extend
209 * returns new array offset
213 repo_addid(Repo *repo, Offset olddeps, Id id)
219 idarray = repo->idarraydata;
220 idarraysize = repo->idarraysize;
222 if (!idarray) /* alloc idarray if not done yet */
225 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
230 if (!olddeps) /* no deps yet */
232 olddeps = idarraysize;
233 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
235 else if (olddeps == repo->lastoff) /* extend at end */
237 else /* can't extend, copy old */
240 olddeps = idarraysize;
241 for (; idarray[i]; i++)
243 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
244 idarray[idarraysize++] = idarray[i];
246 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
249 idarray[idarraysize++] = id; /* insert Id into array */
250 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
251 idarray[idarraysize++] = 0; /* ensure NULL termination */
253 repo->idarraydata = idarray;
254 repo->idarraysize = idarraysize;
255 repo->lastoff = olddeps;
262 * add dependency (as Id) to repo, also unifies dependencies
263 * olddeps = offset into idarraydata
264 * marker= 0 for normal dep
265 * marker > 0 add dep after marker
266 * marker < 0 add dep after -marker
267 * returns new start of dependency array
270 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
272 Id oid, *oidp, *markerp;
278 olddeps = repo_addid(repo, olddeps, marker);
279 return repo_addid(repo, olddeps, id);
284 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
289 return repo_addid(repo, olddeps, id);
299 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
309 if (markerp || before)
311 /* we found it, but in the wrong half */
313 for (; (oid = *oidp) != ID_NULL; oidp++)
318 /* no marker in array yet */
321 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
323 return repo_addid(repo, olddeps, id);
327 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
331 /* id not yet in array */
332 if (!before && !markerp)
333 olddeps = repo_addid(repo, olddeps, marker);
334 else if (before && markerp)
339 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
342 return repo_addid(repo, olddeps, id);
348 * make space for 'num' more dependencies
349 * returns new start of dependency array
351 * reserved ids will always begin at offset idarraysize
355 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
357 num++; /* room for trailing ID_NULL */
359 if (!repo->idarraysize) /* ensure buffer space */
361 repo->idarraysize = 1;
362 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
363 repo->idarraydata[0] = 0;
368 if (olddeps && olddeps != repo->lastoff) /* if not appending */
370 /* can't insert into idarray, this would invalidate all 'larger' offsets
371 * so create new space at end and move existing deps there.
372 * Leaving 'hole' at old position.
378 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
380 count = idend - idstart - 1 + num; /* new size */
382 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
383 /* move old deps to end */
384 olddeps = repo->lastoff = repo->idarraysize;
385 memcpy(repo->idarraydata + olddeps, idstart, count - num);
386 repo->idarraysize = olddeps + count - num;
391 if (olddeps) /* appending */
395 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
397 /* appending or new */
398 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
400 return repo->lastoff;
406 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
408 Pool *pool = repo->pool;
410 char buf[1024], *p, *dep;
415 for (i = provides; repo->idarraydata[i]; i++)
417 id = repo->idarraydata[i];
420 dep = (char *)id2str(pool, id);
421 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
424 strcpy(buf + 2, dep);
426 if ((p = strchr(dep, ':')) != 0 && p != dep)
429 idp = str2id(pool, dep, 1);
433 while ((p = strchr(dep, ';')) != 0)
442 strncpy(dep - 9, "language:", 9);
443 idl = str2id(pool, dep - 9, 1);
445 idl = str2id(pool, dep, 1);
446 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
449 id = rel2id(pool, id, idl, REL_OR, 1);
454 if (dep[0] && dep[1])
456 for (p = dep; *p && *p != ')'; p++)
460 strncpy(dep - 9, "language:", 9);
461 idl = str2id(pool, dep - 9, 1);
463 idl = str2id(pool, dep, 1);
464 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
467 id = rel2id(pool, id, idl, REL_OR, 1);
472 id = rel2id(pool, idp, id, REL_AND, 1);
474 supplements = repo_addid_dep(repo, supplements, id, 0);
476 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
481 idp = str2id(pool, buf, 1);
482 /* strip trailing slashes */
484 while (l > 1 && p[l - 1] == '/')
486 id = str2id(pool, p, 1);
487 id = rel2id(pool, idp, id, REL_WITH, 1);
488 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
489 supplements = repo_addid_dep(repo, supplements, id, 0);
495 for (i = supplements; repo->idarraydata[i]; i++)
497 id = repo->idarraydata[i];
500 dep = (char *)id2str(pool, id);
501 if (!strncmp(dep, "system:modalias(", 16))
503 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
506 p = strchr(buf + 9, ':');
507 if (p && p != buf + 9 && strchr(p + 1, ':'))
510 idp = str2id(pool, buf + 9, 1);
511 p[strlen(p) - 1] = 0;
512 id = str2id(pool, p, 1);
513 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
514 id = rel2id(pool, idp, id, REL_AND, 1);
519 p[strlen(p) - 1] = 0;
520 id = str2id(pool, p, 1);
521 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
524 repo->idarraydata[i] = id;
526 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
531 while ((p = strchr(dep, ':')) != 0)
539 idp = str2id(pool, dep, 1);
541 id = rel2id(pool, id, idp, REL_AND, 1);
546 if (dep[0] && dep[1])
548 dep[strlen(dep) - 1] = 0;
549 idp = str2id(pool, dep, 1);
551 id = rel2id(pool, id, idp, REL_AND, 1);
556 repo->idarraydata[i] = id;
558 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
560 strcpy(buf, dep + 11);
561 if ((p = strrchr(buf, ')')) != 0)
563 id = str2id(pool, buf, 1);
564 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
565 repo->idarraydata[i] = id;
569 if (freshens && repo->idarraydata[freshens])
571 Id idsupp = 0, idfresh = 0;
574 for (i = supplements; repo->idarraydata[i]; i++)
577 idsupp = repo->idarraydata[i];
579 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
581 for (i = freshens; repo->idarraydata[i]; i++)
584 idfresh = repo->idarraydata[i];
586 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
591 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
592 supplements = repo_addid_dep(repo, 0, idsupp, 0);
598 repo_fix_conflicts(Repo *repo, Offset conflicts)
600 char buf[1024], *p, *dep;
601 Pool *pool = repo->pool;
607 for (i = conflicts; repo->idarraydata[i]; i++)
609 id = repo->idarraydata[i];
612 dep = (char *)id2str(pool, id);
613 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
615 strcpy(buf, dep + 15);
616 if ((p = strchr(buf, ')')) != 0)
618 id = str2id(pool, buf, 1);
619 id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
620 repo->idarraydata[i] = id;
632 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
637 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
639 struct matchdata *md = cbdata;
641 if (md->matcher.match)
643 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
645 if (!datamatcher_match(&md->matcher, kv->str))
648 md->stop = md->callback(md->callback_data, s, data, key, kv);
653 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
654 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
655 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
656 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
657 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
658 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
659 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
660 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
661 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
662 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
663 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
664 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
665 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
666 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
670 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
675 for (; *ida && !md->stop; ida++)
678 kv.eof = ida[1] ? 0 : 1;
679 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
685 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
688 Pool *pool = repo->pool;
697 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
700 repo_search_md(repo, p, keyname, md);
701 if (md->stop > SEARCH_NEXT_SOLVABLE)
707 /* The callback only supports solvables, so we can't iterate over the
711 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
713 s = pool->solvables + p;
721 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
723 if (keyname || md->stop > SEARCH_NEXT_KEY)
729 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
731 if (keyname || md->stop > SEARCH_NEXT_KEY)
737 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
739 if (keyname || md->stop > SEARCH_NEXT_KEY)
741 case SOLVABLE_VENDOR:
745 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
747 if (keyname || md->stop > SEARCH_NEXT_KEY)
749 case SOLVABLE_PROVIDES:
751 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
752 if (keyname || md->stop > SEARCH_NEXT_KEY)
754 case SOLVABLE_OBSOLETES:
756 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
757 if (keyname || md->stop > SEARCH_NEXT_KEY)
759 case SOLVABLE_CONFLICTS:
761 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
762 if (keyname || md->stop > SEARCH_NEXT_KEY)
764 case SOLVABLE_REQUIRES:
766 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
767 if (keyname || md->stop > SEARCH_NEXT_KEY)
769 case SOLVABLE_RECOMMENDS:
771 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
772 if (keyname || md->stop > SEARCH_NEXT_KEY)
774 case SOLVABLE_SUPPLEMENTS:
776 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
777 if (keyname || md->stop > SEARCH_NEXT_KEY)
779 case SOLVABLE_SUGGESTS:
781 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
782 if (keyname || md->stop > SEARCH_NEXT_KEY)
784 case SOLVABLE_ENHANCES:
786 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
787 if (keyname || md->stop > SEARCH_NEXT_KEY)
792 kv.num = repo->rpmdbid[p - repo->start];
793 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
795 if (keyname || md->stop > SEARCH_NEXT_KEY)
803 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
805 if (p < data->start || p >= data->end)
807 if (keyname && !repodata_precheck_keyname(data, keyname))
809 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
811 /* do not search filelist extensions */
812 if (data->state != REPODATA_AVAILABLE)
814 for (j = 1; j < data->nkeys; j++)
815 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
817 if (j == data->nkeys)
820 if (data->state == REPODATA_STUB)
824 for (j = 1; j < data->nkeys; j++)
825 if (keyname == data->keys[j].name)
827 if (j == data->nkeys)
831 if (data->loadcallback)
832 data->loadcallback(data);
834 data->state = REPODATA_ERROR;
836 if (data->state == REPODATA_ERROR)
838 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
839 if (md->stop > SEARCH_NEXT_KEY)
845 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)
849 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
851 memset(&md, 0, sizeof(md));
852 md.pool = repo->pool;
854 md.callback = callback;
855 md.callback_data = cbdata;
857 datamatcher_init(&md.matcher, match, flags);
858 repo_search_md(repo, p, keyname, &md);
860 datamatcher_free(&md.matcher);
864 repo_lookup_str(Repo *repo, Id entry, Id keyname)
866 Pool *pool = repo->pool;
873 return id2str(pool, pool->solvables[entry].name);
875 return id2str(pool, pool->solvables[entry].arch);
877 return id2str(pool, pool->solvables[entry].evr);
878 case SOLVABLE_VENDOR:
879 return id2str(pool, pool->solvables[entry].vendor);
881 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
883 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
885 if (!repodata_precheck_keyname(data, keyname))
887 for (j = 1; j < data->nkeys; j++)
889 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID || data->keys[j].type == REPOKEY_TYPE_STR))
890 return repodata_lookup_str(data, entry, keyname);
898 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
903 if (keyname == RPM_RPMDBID)
905 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
906 return repo->rpmdbid[entry - repo->start];
909 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
911 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
913 if (!repodata_precheck_keyname(data, keyname))
915 for (j = 1; j < data->nkeys; j++)
917 if (data->keys[j].name == keyname
918 && (data->keys[j].type == REPOKEY_TYPE_U32
919 || data->keys[j].type == REPOKEY_TYPE_NUM
920 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
923 if (repodata_lookup_num(data, entry, keyname, &value))
932 repo_lookup_id(Repo *repo, Id entry, Id keyname)
940 return repo->pool->solvables[entry].name;
942 return repo->pool->solvables[entry].arch;
944 return repo->pool->solvables[entry].evr;
945 case SOLVABLE_VENDOR:
946 return repo->pool->solvables[entry].vendor;
948 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
950 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
952 if (!repodata_precheck_keyname(data, keyname))
954 for (j = 1; j < data->nkeys; j++)
956 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID))
958 Id id = repodata_lookup_id(data, entry, keyname);
960 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
967 const unsigned char *
968 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
972 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
974 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
976 if (!repodata_precheck_keyname(data, keyname))
978 for (j = 1; j < data->nkeys; j++)
980 if (data->keys[j].name == keyname)
982 const unsigned char *chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
993 repo_lookup_void(Repo *repo, Id entry, Id keyname)
997 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
999 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1001 if (!repodata_precheck_keyname(data, keyname))
1003 for (j = 1; j < data->nkeys; j++)
1005 if (data->keys[j].name == keyname
1006 && (data->keys[j].type == REPOKEY_TYPE_VOID))
1008 if (repodata_lookup_void(data, entry, keyname))
1016 /***********************************************************************/
1019 repo_add_repodata(Repo *repo, int flags)
1022 if ((flags & REPO_USE_LOADING) != 0)
1024 for (i = repo->nrepodata - 1; i >= 0; i--)
1025 if (repo->repodata[i].state == REPODATA_LOADING)
1027 Repodata *data = repo->repodata + i;
1029 /* hack: we mis-use REPO_REUSE_REPODATA here */
1030 if (!(flags & REPO_REUSE_REPODATA))
1032 repodata_freedata(data);
1033 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1037 return 0; /* must not create a new repodata! */
1039 if ((flags & REPO_REUSE_REPODATA) != 0)
1041 for (i = repo->nrepodata - 1; i >= 0; i--)
1042 if (repo->repodata[i].state != REPODATA_STUB)
1043 return repo->repodata + i;
1045 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1049 repo_last_repodata(Repo *repo)
1052 for (i = repo->nrepodata - 1; i >= 0; i--)
1053 if (repo->repodata[i].state != REPODATA_STUB)
1054 return repo->repodata + i;
1055 return repo_add_repodata(repo, 0);
1059 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1061 Repodata *data = repo_last_repodata(repo);
1062 repodata_set_id(data, p, keyname, id);
1066 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1068 Repodata *data = repo_last_repodata(repo);
1069 repodata_set_num(data, p, keyname, num);
1073 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1075 Repodata *data = repo_last_repodata(repo);
1076 repodata_set_str(data, p, keyname, str);
1080 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1082 Repodata *data = repo_last_repodata(repo);
1083 repodata_set_poolstr(data, p, keyname, str);
1087 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1089 Repodata *data = repo_last_repodata(repo);
1090 repodata_add_poolstr_array(data, p, keyname, str);
1094 repo_internalize(Repo *repo)
1099 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1100 if (data->attrs || data->xattrs)
1101 repodata_internalize(data);
1105 repo_disable_paging(Repo *repo)
1110 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1111 repodata_disable_paging(data);
1115 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: