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);
72 * remove repo from pool, zero out (i.e. free) solvables
77 repo_free(Repo *repo, int reuseids)
79 Pool *pool = repo->pool;
83 pool_freewhatprovides(pool);
84 if (repo == pool->installed)
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--)
95 pool->nsolvables = i + 1;
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 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
102 if (pool->repos[i] == repo)
104 if (i == pool->nrepos) /* repo not in pool, return */
106 if (i < pool->nrepos - 1)
108 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
110 for (; i < pool->nrepos - 1; i++)
111 pool->repos[i]->repoid = i + 1;
118 repo_freeallrepos(Pool *pool, int reuseids)
122 pool_freewhatprovides(pool);
123 for (i = 0; i < pool->nrepos; i++)
124 repo_freedata(pool->repos[i]);
125 pool->repos = sat_free(pool->repos);
127 /* the first two solvables don't belong to a repo */
128 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
131 void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
136 if (start + count == repo->end)
138 repo->nsolvables -= count;
139 for (s = repo->pool->solvables + start, i = count; i--; s++)
141 pool_free_solvable_block(repo->pool, start, count, reuseids);
142 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
143 if (data->end > repo->end)
144 repodata_shrink(data, repo->end);
148 /* repository sidedata is solvable data allocated on demand.
149 * It is used for data that is normally not present
150 * in the solvable like the rpmdbid.
151 * The solvable allocation funcions need to make sure that
152 * the sidedata gets extended if new solvables get added.
155 #define REPO_SIDEDATA_BLOCK 63
158 repo_sidedata_create(Repo *repo, size_t size)
160 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
164 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
166 int n = repo->end - repo->start;
169 int d = repo->start - p;
170 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
171 memmove((char *)b + d * size, b, n * size);
172 memset(b, 0, d * size);
175 if (p + count > repo->end)
177 int d = p + count - repo->end;
178 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
179 memset((char *)b + n * size, 0, d * size);
185 * add Id to idarraydata used to store dependencies
186 * olddeps: old array offset to extend
187 * returns new array offset
191 repo_addid(Repo *repo, Offset olddeps, Id id)
197 idarray = repo->idarraydata;
198 idarraysize = repo->idarraysize;
200 if (!idarray) /* alloc idarray if not done yet */
203 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
208 if (!olddeps) /* no deps yet */
210 olddeps = idarraysize;
211 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
213 else if (olddeps == repo->lastoff) /* extend at end */
215 else /* can't extend, copy old */
218 olddeps = idarraysize;
219 for (; idarray[i]; i++)
221 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
222 idarray[idarraysize++] = idarray[i];
224 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
227 idarray[idarraysize++] = id; /* insert Id into array */
228 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
229 idarray[idarraysize++] = 0; /* ensure NULL termination */
231 repo->idarraydata = idarray;
232 repo->idarraysize = idarraysize;
233 repo->lastoff = olddeps;
240 * add dependency (as Id) to repo, also unifies dependencies
241 * olddeps = offset into idarraydata
242 * marker= 0 for normal dep
243 * marker > 0 add dep after marker
244 * marker < 0 add dep after -marker
245 * returns new start of dependency array
248 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
250 Id oid, *oidp, *markerp;
256 olddeps = repo_addid(repo, olddeps, marker);
257 return repo_addid(repo, olddeps, id);
262 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
267 return repo_addid(repo, olddeps, id);
277 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
287 if (markerp || before)
289 /* we found it, but in the wrong half */
291 for (; (oid = *oidp) != ID_NULL; oidp++)
296 /* no marker in array yet */
299 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
301 return repo_addid(repo, olddeps, id);
305 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
309 /* id not yet in array */
310 if (!before && !markerp)
311 olddeps = repo_addid(repo, olddeps, marker);
312 else if (before && markerp)
317 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
320 return repo_addid(repo, olddeps, id);
326 * make space for 'num' more dependencies
327 * returns new start of dependency array
329 * reserved ids will always begin at offset idarraysize
333 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
335 num++; /* room for trailing ID_NULL */
337 if (!repo->idarraysize) /* ensure buffer space */
339 repo->idarraysize = 1;
340 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
341 repo->idarraydata[0] = 0;
346 if (olddeps && olddeps != repo->lastoff) /* if not appending */
348 /* can't insert into idarray, this would invalidate all 'larger' offsets
349 * so create new space at end and move existing deps there.
350 * Leaving 'hole' at old position.
356 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
358 count = idend - idstart - 1 + num; /* new size */
360 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
361 /* move old deps to end */
362 olddeps = repo->lastoff = repo->idarraysize;
363 memcpy(repo->idarraydata + olddeps, idstart, count - num);
364 repo->idarraysize = olddeps + count - num;
369 if (olddeps) /* appending */
373 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
375 /* appending or new */
376 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
378 return repo->lastoff;
384 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
386 Pool *pool = repo->pool;
388 char buf[1024], *p, *dep;
393 for (i = provides; repo->idarraydata[i]; i++)
395 id = repo->idarraydata[i];
398 dep = (char *)id2str(pool, id);
399 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
402 strcpy(buf + 2, dep);
404 if ((p = strchr(dep, ':')) != 0 && p != dep)
407 idp = str2id(pool, dep, 1);
411 while ((p = strchr(dep, ';')) != 0)
420 strncpy(dep - 9, "language:", 9);
421 idl = str2id(pool, dep - 9, 1);
423 idl = str2id(pool, dep, 1);
424 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
427 id = rel2id(pool, id, idl, REL_OR, 1);
432 if (dep[0] && dep[1])
434 for (p = dep; *p && *p != ')'; p++)
438 strncpy(dep - 9, "language:", 9);
439 idl = str2id(pool, dep - 9, 1);
441 idl = str2id(pool, dep, 1);
442 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
445 id = rel2id(pool, id, idl, REL_OR, 1);
450 id = rel2id(pool, idp, id, REL_AND, 1);
452 supplements = repo_addid_dep(repo, supplements, id, 0);
454 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
459 idp = str2id(pool, buf, 1);
460 /* strip trailing slashes */
462 while (l > 1 && p[l - 1] == '/')
464 id = str2id(pool, p, 1);
465 id = rel2id(pool, idp, id, REL_WITH, 1);
466 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
467 supplements = repo_addid_dep(repo, supplements, id, 0);
473 for (i = supplements; repo->idarraydata[i]; i++)
475 id = repo->idarraydata[i];
478 dep = (char *)id2str(pool, id);
479 if (!strncmp(dep, "system:modalias(", 16))
481 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
484 p = strchr(buf + 9, ':');
485 if (p && p != buf + 9 && strchr(p + 1, ':'))
488 idp = str2id(pool, buf + 9, 1);
489 p[strlen(p) - 1] = 0;
490 id = str2id(pool, p, 1);
491 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
492 id = rel2id(pool, idp, id, REL_AND, 1);
497 p[strlen(p) - 1] = 0;
498 id = str2id(pool, p, 1);
499 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
502 repo->idarraydata[i] = id;
504 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
509 while ((p = strchr(dep, ':')) != 0)
517 idp = str2id(pool, dep, 1);
519 id = rel2id(pool, id, idp, REL_AND, 1);
524 if (dep[0] && dep[1])
526 dep[strlen(dep) - 1] = 0;
527 idp = str2id(pool, dep, 1);
529 id = rel2id(pool, id, idp, REL_AND, 1);
534 repo->idarraydata[i] = id;
536 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
538 strcpy(buf, dep + 11);
539 if ((p = strrchr(buf, ')')) != 0)
541 id = str2id(pool, buf, 1);
542 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
543 repo->idarraydata[i] = id;
547 if (freshens && repo->idarraydata[freshens])
549 Id idsupp = 0, idfresh = 0;
552 for (i = supplements; repo->idarraydata[i]; i++)
555 idsupp = repo->idarraydata[i];
557 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
559 for (i = freshens; repo->idarraydata[i]; i++)
562 idfresh = repo->idarraydata[i];
564 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
569 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
570 supplements = repo_addid_dep(repo, 0, idsupp, 0);
576 repo_fix_conflicts(Repo *repo, Offset conflicts)
578 char buf[1024], *p, *dep;
579 Pool *pool = repo->pool;
585 for (i = conflicts; repo->idarraydata[i]; i++)
587 id = repo->idarraydata[i];
590 dep = (char *)id2str(pool, id);
591 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
593 strcpy(buf, dep + 15);
594 if ((p = strchr(buf, ')')) != 0)
596 id = str2id(pool, buf, 1);
597 id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
598 repo->idarraydata[i] = id;
610 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
615 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
617 struct matchdata *md = cbdata;
619 if (md->matcher.match)
621 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
623 if (!datamatcher_match(&md->matcher, kv->str))
626 md->stop = md->callback(md->callback_data, s, data, key, kv);
631 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
632 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
633 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
634 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
635 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
636 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
637 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
638 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
639 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
640 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
641 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
642 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
643 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
644 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
648 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
653 for (; *ida && !md->stop; ida++)
656 kv.eof = ida[1] ? 0 : 1;
657 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
663 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
666 Pool *pool = repo->pool;
675 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
678 repo_search_md(repo, p, keyname, md);
679 if (md->stop > SEARCH_NEXT_SOLVABLE)
685 /* The callback only supports solvables, so we can't iterate over the
689 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
691 s = pool->solvables + p;
699 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
701 if (keyname || md->stop > SEARCH_NEXT_KEY)
707 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
709 if (keyname || md->stop > SEARCH_NEXT_KEY)
715 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
717 if (keyname || md->stop > SEARCH_NEXT_KEY)
719 case SOLVABLE_VENDOR:
723 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
725 if (keyname || md->stop > SEARCH_NEXT_KEY)
727 case SOLVABLE_PROVIDES:
729 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
730 if (keyname || md->stop > SEARCH_NEXT_KEY)
732 case SOLVABLE_OBSOLETES:
734 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
735 if (keyname || md->stop > SEARCH_NEXT_KEY)
737 case SOLVABLE_CONFLICTS:
739 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
740 if (keyname || md->stop > SEARCH_NEXT_KEY)
742 case SOLVABLE_REQUIRES:
744 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
745 if (keyname || md->stop > SEARCH_NEXT_KEY)
747 case SOLVABLE_RECOMMENDS:
749 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
750 if (keyname || md->stop > SEARCH_NEXT_KEY)
752 case SOLVABLE_SUPPLEMENTS:
754 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
755 if (keyname || md->stop > SEARCH_NEXT_KEY)
757 case SOLVABLE_SUGGESTS:
759 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
760 if (keyname || md->stop > SEARCH_NEXT_KEY)
762 case SOLVABLE_ENHANCES:
764 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
765 if (keyname || md->stop > SEARCH_NEXT_KEY)
770 kv.num = repo->rpmdbid[p - repo->start];
771 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
773 if (keyname || md->stop > SEARCH_NEXT_KEY)
781 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
783 if (p < data->start || p >= data->end)
785 if (keyname && !repodata_precheck_keyname(data, keyname))
787 if (data->state == REPODATA_STUB)
791 for (j = 1; j < data->nkeys; j++)
792 if (keyname == data->keys[j].name)
794 if (j == data->nkeys)
798 if (data->loadcallback)
799 data->loadcallback(data);
801 data->state = REPODATA_ERROR;
803 if (data->state == REPODATA_ERROR)
805 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
806 if (md->stop > SEARCH_NEXT_KEY)
808 if (keyname == SOLVABLE_FILELIST)
810 if (!(md->flags & SEARCH_COMPLETE_FILELIST))
812 if (md->matcher.match && (md->flags & (SEARCH_STRINGMASK|SEARCH_NOCASE)) == SEARCH_STRING && repodata_filelistfilter_matches(data, md->matcher.match))
819 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)
823 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
825 memset(&md, 0, sizeof(md));
826 md.pool = repo->pool;
828 md.callback = callback;
829 md.callback_data = cbdata;
831 datamatcher_init(&md.matcher, match, flags);
832 repo_search_md(repo, p, keyname, &md);
834 datamatcher_free(&md.matcher);
838 repo_lookup_str(Repo *repo, Id entry, Id keyname)
840 Pool *pool = repo->pool;
847 return id2str(pool, pool->solvables[entry].name);
849 return id2str(pool, pool->solvables[entry].arch);
851 return id2str(pool, pool->solvables[entry].evr);
852 case SOLVABLE_VENDOR:
853 return id2str(pool, pool->solvables[entry].vendor);
855 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
857 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
859 if (!repodata_precheck_keyname(data, keyname))
861 for (j = 1; j < data->nkeys; j++)
863 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))
864 return repodata_lookup_str(data, entry, keyname);
872 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
877 if (keyname == RPM_RPMDBID)
879 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
880 return repo->rpmdbid[entry - repo->start];
883 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
885 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
887 if (!repodata_precheck_keyname(data, keyname))
889 for (j = 1; j < data->nkeys; j++)
891 if (data->keys[j].name == keyname
892 && (data->keys[j].type == REPOKEY_TYPE_U32
893 || data->keys[j].type == REPOKEY_TYPE_NUM
894 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
897 if (repodata_lookup_num(data, entry, keyname, &value))
906 repo_lookup_id(Repo *repo, Id entry, Id keyname)
914 return repo->pool->solvables[entry].name;
916 return repo->pool->solvables[entry].arch;
918 return repo->pool->solvables[entry].evr;
919 case SOLVABLE_VENDOR:
920 return repo->pool->solvables[entry].vendor;
922 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
924 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
926 if (!repodata_precheck_keyname(data, keyname))
928 for (j = 1; j < data->nkeys; j++)
930 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID))
932 Id id = repodata_lookup_id(data, entry, keyname);
934 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
941 const unsigned char *
942 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
946 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
948 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
950 if (!repodata_precheck_keyname(data, keyname))
952 for (j = 1; j < data->nkeys; j++)
954 if (data->keys[j].name == keyname)
956 const unsigned char *chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
967 repo_lookup_void(Repo *repo, Id entry, Id keyname)
971 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
973 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
975 if (!repodata_precheck_keyname(data, keyname))
977 for (j = 1; j < data->nkeys; j++)
979 if (data->keys[j].name == keyname
980 && (data->keys[j].type == REPOKEY_TYPE_VOID))
982 if (repodata_lookup_void(data, entry, keyname))
990 /***********************************************************************/
993 repo_add_repodata(Repo *repo, int flags)
996 if ((flags & REPO_USE_LOADING) != 0)
998 for (i = repo->nrepodata - 1; i >= 0; i--)
999 if (repo->repodata[i].state == REPODATA_LOADING)
1001 Repodata *data = repo->repodata + i;
1003 /* hack: we mis-use REPO_REUSE_REPODATA here */
1004 if (!(flags & REPO_REUSE_REPODATA))
1006 repodata_freedata(data);
1007 repodata_initdata(data, repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1011 return 0; /* must not create a new repodata! */
1013 if ((flags & REPO_REUSE_REPODATA) != 0)
1015 for (i = repo->nrepodata - 1; i >= 0; i--)
1016 if (repo->repodata[i].state != REPODATA_STUB)
1017 return repo->repodata + i;
1019 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1023 repo_last_repodata(Repo *repo)
1026 for (i = repo->nrepodata - 1; i >= 0; i--)
1027 if (repo->repodata[i].state != REPODATA_STUB)
1028 return repo->repodata + i;
1029 return repo_add_repodata(repo, 0);
1033 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1035 Repodata *data = repo_last_repodata(repo);
1036 repodata_set_id(data, p, keyname, id);
1040 repo_set_num(Repo *repo, Id p, Id keyname, Id num)
1042 Repodata *data = repo_last_repodata(repo);
1043 repodata_set_num(data, p, keyname, num);
1047 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1049 Repodata *data = repo_last_repodata(repo);
1050 repodata_set_str(data, p, keyname, str);
1054 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1056 Repodata *data = repo_last_repodata(repo);
1057 repodata_set_poolstr(data, p, keyname, str);
1061 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1063 Repodata *data = repo_last_repodata(repo);
1064 repodata_add_poolstr_array(data, p, keyname, str);
1068 repo_internalize(Repo *repo)
1073 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1074 if (data->attrs || data->xattrs)
1075 repodata_internalize(data);
1079 repo_disable_paging(Repo *repo)
1084 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1085 repodata_disable_paging(data);
1089 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: