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);
132 /* repository sidedata is solvable data allocated on demand.
133 * It is used for data that is normally not present
134 * in the solvable like the rpmdbid.
135 * The solvable allocation funcions need to make sure that
136 * the sidedata gets extended if new solvables get added.
139 #define REPO_SIDEDATA_BLOCK 63
142 repo_sidedata_create(Repo *repo, size_t size)
144 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
148 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
150 int n = repo->end - repo->start;
153 int d = repo->start - p;
154 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
155 memmove((char *)b + d * size, b, n * size);
156 memset(b, 0, d * size);
159 if (p + count > repo->end)
161 int d = p + count - repo->end;
162 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
163 memset((char *)b + n * size, 0, d * size);
169 * add Id to idarraydata used to store dependencies
170 * olddeps: old array offset to extend
171 * returns new array offset
175 repo_addid(Repo *repo, Offset olddeps, Id id)
181 idarray = repo->idarraydata;
182 idarraysize = repo->idarraysize;
184 if (!idarray) /* alloc idarray if not done yet */
187 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
192 if (!olddeps) /* no deps yet */
194 olddeps = idarraysize;
195 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
197 else if (olddeps == repo->lastoff) /* extend at end */
199 else /* can't extend, copy old */
202 olddeps = idarraysize;
203 for (; idarray[i]; i++)
205 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
206 idarray[idarraysize++] = idarray[i];
208 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
211 idarray[idarraysize++] = id; /* insert Id into array */
212 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
213 idarray[idarraysize++] = 0; /* ensure NULL termination */
215 repo->idarraydata = idarray;
216 repo->idarraysize = idarraysize;
217 repo->lastoff = olddeps;
224 * add dependency (as Id) to repo, also unifies dependencies
225 * olddeps = offset into idarraydata
226 * marker= 0 for normal dep
227 * marker > 0 add dep after marker
228 * marker < 0 add dep after -marker
229 * returns new start of dependency array
232 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
234 Id oid, *oidp, *markerp;
240 olddeps = repo_addid(repo, olddeps, marker);
241 return repo_addid(repo, olddeps, id);
246 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
251 return repo_addid(repo, olddeps, id);
261 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
271 if (markerp || before)
273 /* we found it, but in the wrong half */
275 for (; (oid = *oidp) != ID_NULL; oidp++)
280 /* no marker in array yet */
283 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
285 return repo_addid(repo, olddeps, id);
289 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
293 /* id not yet in array */
294 if (!before && !markerp)
295 olddeps = repo_addid(repo, olddeps, marker);
296 else if (before && markerp)
301 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
304 return repo_addid(repo, olddeps, id);
310 * make space for 'num' more dependencies
311 * returns new start of dependency array
313 * reserved ids will always begin at offset idarraysize
317 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
319 num++; /* room for trailing ID_NULL */
321 if (!repo->idarraysize) /* ensure buffer space */
323 repo->idarraysize = 1;
324 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
325 repo->idarraydata[0] = 0;
330 if (olddeps && olddeps != repo->lastoff) /* if not appending */
332 /* can't insert into idarray, this would invalidate all 'larger' offsets
333 * so create new space at end and move existing deps there.
334 * Leaving 'hole' at old position.
340 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
342 count = idend - idstart - 1 + num; /* new size */
344 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
345 /* move old deps to end */
346 olddeps = repo->lastoff = repo->idarraysize;
347 memcpy(repo->idarraydata + olddeps, idstart, count - num);
348 repo->idarraysize = olddeps + count - num;
353 if (olddeps) /* appending */
357 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
359 /* appending or new */
360 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
362 return repo->lastoff;
368 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
370 Pool *pool = repo->pool;
372 char buf[1024], *p, *dep;
377 for (i = provides; repo->idarraydata[i]; i++)
379 id = repo->idarraydata[i];
382 dep = (char *)id2str(pool, id);
383 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
386 strcpy(buf + 2, dep);
388 if ((p = strchr(dep, ':')) != 0 && p != dep)
391 idp = str2id(pool, dep, 1);
395 while ((p = strchr(dep, ';')) != 0)
404 strncpy(dep - 9, "language:", 9);
405 idl = str2id(pool, dep - 9, 1);
407 idl = str2id(pool, dep, 1);
408 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
411 id = rel2id(pool, id, idl, REL_OR, 1);
416 if (dep[0] && dep[1])
418 for (p = dep; *p && *p != ')'; p++)
422 strncpy(dep - 9, "language:", 9);
423 idl = str2id(pool, dep - 9, 1);
425 idl = str2id(pool, dep, 1);
426 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
429 id = rel2id(pool, id, idl, REL_OR, 1);
434 id = rel2id(pool, idp, id, REL_AND, 1);
436 supplements = repo_addid_dep(repo, supplements, id, 0);
438 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
443 idp = str2id(pool, buf, 1);
444 /* strip trailing slashes */
446 while (l > 1 && p[l - 1] == '/')
448 id = str2id(pool, p, 1);
449 id = rel2id(pool, idp, id, REL_WITH, 1);
450 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
451 supplements = repo_addid_dep(repo, supplements, id, 0);
457 for (i = supplements; repo->idarraydata[i]; i++)
459 id = repo->idarraydata[i];
462 dep = (char *)id2str(pool, id);
463 if (!strncmp(dep, "system:modalias(", 16))
465 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
468 p = strchr(buf + 9, ':');
469 if (p && p != buf + 9 && strchr(p + 1, ':'))
472 idp = str2id(pool, buf + 9, 1);
473 p[strlen(p) - 1] = 0;
474 id = str2id(pool, p, 1);
475 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
476 id = rel2id(pool, idp, id, REL_AND, 1);
481 p[strlen(p) - 1] = 0;
482 id = str2id(pool, p, 1);
483 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
486 repo->idarraydata[i] = id;
488 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
493 while ((p = strchr(dep, ':')) != 0)
501 idp = str2id(pool, dep, 1);
503 id = rel2id(pool, id, idp, REL_AND, 1);
508 if (dep[0] && dep[1])
510 dep[strlen(dep) - 1] = 0;
511 idp = str2id(pool, dep, 1);
513 id = rel2id(pool, id, idp, REL_AND, 1);
518 repo->idarraydata[i] = id;
520 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
522 strcpy(buf, dep + 11);
523 if ((p = strrchr(buf, ')')) != 0)
525 id = str2id(pool, buf, 1);
526 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
527 repo->idarraydata[i] = id;
531 if (freshens && repo->idarraydata[freshens])
533 Id idsupp = 0, idfresh = 0;
536 for (i = supplements; repo->idarraydata[i]; i++)
539 idsupp = repo->idarraydata[i];
541 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
543 for (i = freshens; repo->idarraydata[i]; i++)
546 idfresh = repo->idarraydata[i];
548 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
553 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
554 supplements = repo_addid_dep(repo, 0, idsupp, 0);
560 repo_fix_conflicts(Repo *repo, Offset conflicts)
562 char buf[1024], *p, *dep;
563 Pool *pool = repo->pool;
569 for (i = conflicts; repo->idarraydata[i]; i++)
571 id = repo->idarraydata[i];
574 dep = (char *)id2str(pool, id);
575 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
577 strcpy(buf, dep + 15);
578 if ((p = strchr(buf, ')')) != 0)
580 id = str2id(pool, buf, 1);
581 id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
582 repo->idarraydata[i] = id;
594 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
599 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
601 struct matchdata *md = cbdata;
603 if (md->matcher.match)
605 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
607 if (!datamatcher_match(&md->matcher, kv->str))
610 md->stop = md->callback(md->callback_data, s, data, key, kv);
615 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
616 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
617 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
618 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
619 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
620 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
621 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
622 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
623 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
624 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
625 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
626 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
627 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
628 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
632 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
637 for (; *ida && !md->stop; ida++)
640 kv.eof = ida[1] ? 0 : 1;
641 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
647 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
650 Pool *pool = repo->pool;
659 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
662 repo_search_md(repo, p, keyname, md);
663 if (md->stop > SEARCH_NEXT_SOLVABLE)
669 /* The callback only supports solvables, so we can't iterate over the
673 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
675 s = pool->solvables + p;
683 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
685 if (keyname || md->stop > SEARCH_NEXT_KEY)
691 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
693 if (keyname || md->stop > SEARCH_NEXT_KEY)
699 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
701 if (keyname || md->stop > SEARCH_NEXT_KEY)
703 case SOLVABLE_VENDOR:
707 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
709 if (keyname || md->stop > SEARCH_NEXT_KEY)
711 case SOLVABLE_PROVIDES:
713 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
714 if (keyname || md->stop > SEARCH_NEXT_KEY)
716 case SOLVABLE_OBSOLETES:
718 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
719 if (keyname || md->stop > SEARCH_NEXT_KEY)
721 case SOLVABLE_CONFLICTS:
723 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
724 if (keyname || md->stop > SEARCH_NEXT_KEY)
726 case SOLVABLE_REQUIRES:
728 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
729 if (keyname || md->stop > SEARCH_NEXT_KEY)
731 case SOLVABLE_RECOMMENDS:
733 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
734 if (keyname || md->stop > SEARCH_NEXT_KEY)
736 case SOLVABLE_SUPPLEMENTS:
738 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
739 if (keyname || md->stop > SEARCH_NEXT_KEY)
741 case SOLVABLE_SUGGESTS:
743 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
744 if (keyname || md->stop > SEARCH_NEXT_KEY)
746 case SOLVABLE_ENHANCES:
748 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
749 if (keyname || md->stop > SEARCH_NEXT_KEY)
754 kv.num = repo->rpmdbid[p - repo->start];
755 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
757 if (keyname || md->stop > SEARCH_NEXT_KEY)
765 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
767 if (p < data->start || p >= data->end)
769 if (keyname && !repodata_precheck_keyname(data, keyname))
771 if (data->state == REPODATA_STUB)
775 for (j = 1; j < data->nkeys; j++)
776 if (keyname == data->keys[j].name)
778 if (j == data->nkeys)
782 if (data->loadcallback)
783 data->loadcallback(data);
785 data->state = REPODATA_ERROR;
787 if (data->state == REPODATA_ERROR)
789 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
790 if (md->stop > SEARCH_NEXT_KEY)
796 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)
800 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
802 memset(&md, 0, sizeof(md));
803 md.pool = repo->pool;
805 md.callback = callback;
806 md.callback_data = cbdata;
808 datamatcher_init(&md.matcher, match, flags);
809 repo_search_md(repo, p, keyname, &md);
811 datamatcher_free(&md.matcher);
815 repo_lookup_str(Repo *repo, Id entry, Id keyname)
817 Pool *pool = repo->pool;
824 return id2str(pool, pool->solvables[entry].name);
826 return id2str(pool, pool->solvables[entry].arch);
828 return id2str(pool, pool->solvables[entry].evr);
829 case SOLVABLE_VENDOR:
830 return id2str(pool, pool->solvables[entry].vendor);
832 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
834 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
836 if (!repodata_precheck_keyname(data, keyname))
838 for (j = 1; j < data->nkeys; j++)
840 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))
841 return repodata_lookup_str(data, entry, keyname);
849 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
854 if (keyname == RPM_RPMDBID)
856 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
857 return repo->rpmdbid[entry - repo->start];
860 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
862 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
864 if (!repodata_precheck_keyname(data, keyname))
866 for (j = 1; j < data->nkeys; j++)
868 if (data->keys[j].name == keyname
869 && (data->keys[j].type == REPOKEY_TYPE_U32
870 || data->keys[j].type == REPOKEY_TYPE_NUM
871 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
874 if (repodata_lookup_num(data, entry, keyname, &value))
883 repo_lookup_id(Repo *repo, Id entry, Id keyname)
891 return repo->pool->solvables[entry].name;
893 return repo->pool->solvables[entry].arch;
895 return repo->pool->solvables[entry].evr;
896 case SOLVABLE_VENDOR:
897 return repo->pool->solvables[entry].vendor;
899 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
901 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
903 if (!repodata_precheck_keyname(data, keyname))
905 for (j = 1; j < data->nkeys; j++)
907 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID))
909 Id id = repodata_lookup_id(data, entry, keyname);
911 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
918 const unsigned char *
919 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
923 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
925 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
927 if (!repodata_precheck_keyname(data, keyname))
929 for (j = 1; j < data->nkeys; j++)
931 if (data->keys[j].name == keyname)
933 const unsigned char *chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
944 repo_lookup_void(Repo *repo, Id entry, Id keyname)
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
957 && (data->keys[j].type == REPOKEY_TYPE_VOID))
959 if (repodata_lookup_void(data, entry, keyname))
967 /***********************************************************************/
970 repo_add_repodata(Repo *repo, int localpool)
975 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
976 data = repo->repodata + repo->nrepodata - 1;
977 repodata_initdata(data, repo, localpool);
982 repo_last_repodata(Repo *repo)
985 for (i = repo->nrepodata - 1; i >= 0; i--)
986 if (repo->repodata[i].state != REPODATA_STUB)
987 return repo->repodata + i;
988 return repo_add_repodata(repo, 0);
992 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
994 Repodata *data = repo_last_repodata(repo);
995 repodata_set_id(data, p, keyname, id);
999 repo_set_num(Repo *repo, Id p, Id keyname, Id num)
1001 Repodata *data = repo_last_repodata(repo);
1002 repodata_set_num(data, p, keyname, num);
1006 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1008 Repodata *data = repo_last_repodata(repo);
1009 repodata_set_str(data, p, keyname, str);
1013 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1015 Repodata *data = repo_last_repodata(repo);
1016 repodata_set_poolstr(data, p, keyname, str);
1020 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1022 Repodata *data = repo_last_repodata(repo);
1023 repodata_add_poolstr_array(data, p, keyname, str);
1027 repo_internalize(Repo *repo)
1032 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1033 if (data->attrs || data->xattrs)
1034 repodata_internalize(data);
1038 repo_disable_paging(Repo *repo)
1043 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1044 repodata_disable_paging(data);
1048 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: