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->name = name ? strdup(name) : 0;
51 repo->start = pool->nsolvables;
52 repo->end = pool->nsolvables;
58 repo_freedata(Repo *repo)
61 for (i = 0; i < repo->nrepodata; i++)
62 repodata_free(repo->repodata + i);
63 sat_free(repo->repodata);
64 sat_free(repo->idarraydata);
65 sat_free(repo->rpmdbid);
66 sat_free((char *)repo->name);
72 * olddeps = old array to extend
77 repo_addid(Repo *repo, Offset olddeps, Id id)
83 idarray = repo->idarraydata;
84 idarraysize = repo->idarraysize;
86 if (!idarray) /* alloc idarray if not done yet */
89 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
94 if (!olddeps) /* no deps yet */
96 olddeps = idarraysize;
97 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
99 else if (olddeps == repo->lastoff) /* extend at end */
101 else /* can't extend, copy old */
104 olddeps = idarraysize;
105 for (; idarray[i]; i++)
107 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
108 idarray[idarraysize++] = idarray[i];
110 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
113 idarray[idarraysize++] = id; /* insert Id into array */
114 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
115 idarray[idarraysize++] = 0; /* ensure NULL termination */
117 repo->idarraydata = idarray;
118 repo->idarraysize = idarraysize;
119 repo->lastoff = olddeps;
126 * add dependency (as Id) to repo, also unifies dependencies
127 * olddeps = offset into idarraydata
128 * marker= 0 for normal dep
129 * marker > 0 add dep after marker
130 * marker < 0 add dep after -marker
134 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
136 Id oid, *oidp, *markerp;
142 olddeps = repo_addid(repo, olddeps, marker);
143 return repo_addid(repo, olddeps, id);
148 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
153 return repo_addid(repo, olddeps, id);
163 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
173 if (markerp || before)
175 /* we found it, but in the wrong half */
177 for (; (oid = *oidp) != ID_NULL; oidp++)
182 /* no marker in array yet */
185 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
187 return repo_addid(repo, olddeps, id);
191 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
195 /* id not yet in array */
196 if (!before && !markerp)
197 olddeps = repo_addid(repo, olddeps, marker);
198 else if (before && markerp)
203 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
206 return repo_addid(repo, olddeps, id);
212 * make space for 'num' more dependencies
216 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
218 num++; /* room for trailing ID_NULL */
220 if (!repo->idarraysize) /* ensure buffer space */
222 repo->idarraysize = 1;
223 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
224 repo->idarraydata[0] = 0;
229 if (olddeps && olddeps != repo->lastoff) /* if not appending */
231 /* can't insert into idarray, this would invalidate all 'larger' offsets
232 * so create new space at end and move existing deps there.
233 * Leaving 'hole' at old position.
239 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
241 count = idend - idstart - 1 + num; /* new size */
243 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
244 /* move old deps to end */
245 olddeps = repo->lastoff = repo->idarraysize;
246 memcpy(repo->idarraydata + olddeps, idstart, count - num);
247 repo->idarraysize = olddeps + count - num;
252 if (olddeps) /* appending */
256 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
258 /* appending or new */
259 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
261 return repo->lastoff;
266 * remove repo from pool, zero out solvables
271 repo_free(Repo *repo, int reuseids)
273 Pool *pool = repo->pool;
277 pool_freewhatprovides(pool);
279 if (reuseids && repo->end == pool->nsolvables)
281 /* it's ok to reuse the ids. As this is the last repo, we can
282 just shrink the solvable array */
283 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
287 pool->nsolvables = i + 1;
289 /* zero out solvables belonging to this repo */
290 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
292 memset(s, 0, sizeof(*s));
293 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
294 if (pool->repos[i] == repo)
296 if (i == pool->nrepos) /* repo not in pool, return */
298 if (i < pool->nrepos - 1)
299 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
305 repo_freeallrepos(Pool *pool, int reuseids)
309 pool_freewhatprovides(pool);
310 for (i = 0; i < pool->nrepos; i++)
311 repo_freedata(pool->repos[i]);
312 pool->repos = sat_free(pool->repos);
314 /* the first two solvables don't belong to a repo */
315 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
319 #define REPO_SIDEDATA_BLOCK 63
322 repo_sidedata_create(Repo *repo, size_t size)
324 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
328 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
330 int n = repo->end - repo->start;
333 int d = repo->start - p;
334 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
335 memmove(b + d * size, b, n * size);
336 memset(b, 0, d * size);
339 if (p + count > repo->end)
341 int d = p + count - repo->end;
342 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
343 memset(b + n * size, 0, d * size);
349 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
351 Pool *pool = repo->pool;
353 char buf[1024], *p, *dep;
358 for (i = provides; repo->idarraydata[i]; i++)
360 id = repo->idarraydata[i];
363 dep = (char *)id2str(pool, id);
364 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
367 strcpy(buf + 2, dep);
369 if ((p = strchr(dep, ':')) != 0 && p != dep)
372 idp = str2id(pool, dep, 1);
376 while ((p = strchr(dep, ';')) != 0)
385 strncpy(dep - 9, "language:", 9);
386 idl = str2id(pool, dep - 9, 1);
388 idl = str2id(pool, dep, 1);
389 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
392 id = rel2id(pool, id, idl, REL_OR, 1);
397 if (dep[0] && dep[1])
399 for (p = dep; *p && *p != ')'; p++)
403 strncpy(dep - 9, "language:", 9);
404 idl = str2id(pool, dep - 9, 1);
406 idl = str2id(pool, dep, 1);
407 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
410 id = rel2id(pool, id, idl, REL_OR, 1);
415 id = rel2id(pool, idp, id, REL_AND, 1);
417 supplements = repo_addid_dep(repo, supplements, id, 0);
419 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
424 idp = str2id(pool, buf, 1);
425 /* strip trailing slashes */
427 while (l > 1 && p[l - 1] == '/')
429 id = str2id(pool, p, 1);
430 id = rel2id(pool, idp, id, REL_WITH, 1);
431 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
432 supplements = repo_addid_dep(repo, supplements, id, 0);
438 for (i = supplements; repo->idarraydata[i]; i++)
440 id = repo->idarraydata[i];
443 dep = (char *)id2str(pool, id);
444 if (!strncmp(dep, "system:modalias(", 16))
446 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
449 p = strchr(buf + 9, ':');
450 if (p && p != buf + 9 && strchr(p + 1, ':'))
453 idp = str2id(pool, buf + 9, 1);
454 p[strlen(p) - 1] = 0;
455 id = str2id(pool, p, 1);
456 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
457 id = rel2id(pool, idp, id, REL_AND, 1);
462 p[strlen(p) - 1] = 0;
463 id = str2id(pool, p, 1);
464 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
467 repo->idarraydata[i] = id;
469 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
474 while ((p = strchr(dep, ':')) != 0)
482 idp = str2id(pool, dep, 1);
484 id = rel2id(pool, id, idp, REL_AND, 1);
489 if (dep[0] && dep[1])
491 dep[strlen(dep) - 1] = 0;
492 idp = str2id(pool, dep, 1);
494 id = rel2id(pool, id, idp, REL_AND, 1);
499 repo->idarraydata[i] = id;
501 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
503 strcpy(buf, dep + 11);
504 if ((p = strrchr(buf, ')')) != 0)
506 id = str2id(pool, buf, 1);
507 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
508 repo->idarraydata[i] = id;
512 if (freshens && repo->idarraydata[freshens])
514 Id idsupp = 0, idfresh = 0;
517 for (i = supplements; repo->idarraydata[i]; i++)
520 idsupp = repo->idarraydata[i];
522 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
524 for (i = freshens; repo->idarraydata[i]; i++)
527 idfresh = repo->idarraydata[i];
529 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
534 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
535 supplements = repo_addid_dep(repo, 0, idsupp, 0);
541 repo_fix_conflicts(Repo *repo, Offset conflicts)
543 char buf[1024], *p, *dep;
544 Pool *pool = repo->pool;
550 for (i = conflicts; repo->idarraydata[i]; i++)
552 id = repo->idarraydata[i];
555 dep = (char *)id2str(pool, id);
556 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
558 strcpy(buf, dep + 15);
559 if ((p = strchr(buf, ')')) != 0)
561 id = str2id(pool, buf, 1);
562 id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
563 repo->idarraydata[i] = id;
578 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
583 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
585 struct matchdata *md = cbdata;
586 int flags = md->flags;
588 if ((flags & SEARCH_STRINGMASK) != 0)
592 case REPOKEY_TYPE_ID:
593 case REPOKEY_TYPE_IDARRAY:
594 if (data && data->localpool)
595 kv->str = stringpool_id2str(&data->spool, kv->id);
597 kv->str = id2str(s->repo->pool, kv->id);
599 case REPOKEY_TYPE_STR:
604 switch ((flags & SEARCH_STRINGMASK))
606 case SEARCH_SUBSTRING:
607 if (flags & SEARCH_NOCASE)
609 if (!strcasestr(kv->str, md->match))
614 if (!strstr(kv->str, md->match))
619 if (flags & SEARCH_NOCASE)
621 if (strcasecmp(md->match, kv->str))
626 if (strcmp(md->match, kv->str))
631 if (fnmatch(md->match, kv->str, (flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0))
636 if (regexec(&md->regexp, kv->str, 0, NULL, 0))
643 md->stop = md->callback(md->callback_data, s, data, key, kv);
648 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
649 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
650 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
651 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
652 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
653 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
654 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
655 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
656 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
657 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
658 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
659 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
660 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
661 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
665 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
670 for (; *ida && !md->stop; ida++)
673 kv.eof = ida[1] ? 0 : 1;
674 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
680 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
683 Pool *pool = repo->pool;
692 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
695 repo_search_md(repo, p, keyname, md);
696 if (md->stop > SEARCH_NEXT_SOLVABLE)
702 /* The callback only supports solvables, so we can't iterate over the
706 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
708 s = pool->solvables + p;
716 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
718 if (keyname || md->stop > SEARCH_NEXT_KEY)
724 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
726 if (keyname || md->stop > SEARCH_NEXT_KEY)
732 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
734 if (keyname || md->stop > SEARCH_NEXT_KEY)
736 case SOLVABLE_VENDOR:
740 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
742 if (keyname || md->stop > SEARCH_NEXT_KEY)
744 case SOLVABLE_PROVIDES:
746 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
747 if (keyname || md->stop > SEARCH_NEXT_KEY)
749 case SOLVABLE_OBSOLETES:
751 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
752 if (keyname || md->stop > SEARCH_NEXT_KEY)
754 case SOLVABLE_CONFLICTS:
756 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
757 if (keyname || md->stop > SEARCH_NEXT_KEY)
759 case SOLVABLE_REQUIRES:
761 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
762 if (keyname || md->stop > SEARCH_NEXT_KEY)
764 case SOLVABLE_RECOMMENDS:
766 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
767 if (keyname || md->stop > SEARCH_NEXT_KEY)
769 case SOLVABLE_SUPPLEMENTS:
771 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
772 if (keyname || md->stop > SEARCH_NEXT_KEY)
774 case SOLVABLE_SUGGESTS:
776 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
777 if (keyname || md->stop > SEARCH_NEXT_KEY)
779 case SOLVABLE_ENHANCES:
781 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
782 if (keyname || md->stop > SEARCH_NEXT_KEY)
787 kv.num = repo->rpmdbid[p - repo->start];
788 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
790 if (keyname || md->stop > SEARCH_NEXT_KEY)
798 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
800 if (p < data->start || p >= data->end)
802 if (keyname && !repodata_precheck_keyname(data, keyname))
804 if (data->state == REPODATA_STUB)
808 for (j = 1; j < data->nkeys; j++)
809 if (keyname == data->keys[j].name)
811 if (j == data->nkeys)
815 if (data->loadcallback)
816 data->loadcallback(data);
818 data->state = REPODATA_ERROR;
820 if (data->state == REPODATA_ERROR)
822 repodata_search(data, p, keyname, repo_matchvalue, md);
823 if (md->stop > SEARCH_NEXT_KEY)
829 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)
833 memset(&md, 0, sizeof(md));
834 md.pool = repo->pool;
837 md.callback = callback;
838 md.callback_data = cbdata;
839 repo_search_md(repo, p, keyname, &md);
843 repo_lookup_str(Repo *repo, Id entry, Id keyname)
845 Pool *pool = repo->pool;
852 return id2str(pool, pool->solvables[entry].name);
854 return id2str(pool, pool->solvables[entry].arch);
856 return id2str(pool, pool->solvables[entry].evr);
857 case SOLVABLE_VENDOR:
858 return id2str(pool, pool->solvables[entry].vendor);
860 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
862 if (entry && (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 && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID || data->keys[j].type == REPOKEY_TYPE_STR))
869 return repodata_lookup_str(data, entry, keyname);
877 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
882 if (keyname == RPM_RPMDBID)
884 if (repo->rpmdbid && entry && entry >= repo->start && entry < repo->end)
885 return repo->rpmdbid[entry - repo->start];
888 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
890 if (entry && (entry < data->start || entry >= data->end))
892 if (!repodata_precheck_keyname(data, keyname))
894 for (j = 1; j < data->nkeys; j++)
896 if (data->keys[j].name == keyname
897 && (data->keys[j].type == REPOKEY_TYPE_U32
898 || data->keys[j].type == REPOKEY_TYPE_NUM
899 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
902 if (repodata_lookup_num(data, entry, keyname, &value))
911 repo_lookup_id(Repo *repo, Id entry, Id keyname)
919 return repo->pool->solvables[entry].name;
921 return repo->pool->solvables[entry].arch;
923 return repo->pool->solvables[entry].evr;
924 case SOLVABLE_VENDOR:
925 return repo->pool->solvables[entry].vendor;
927 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
929 if (entry && (entry < data->start || entry >= data->end))
931 if (!repodata_precheck_keyname(data, keyname))
933 for (j = 1; j < data->nkeys; j++)
935 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID))
937 Id id = repodata_lookup_id(data, entry, keyname);
941 id = repodata_globalize_id(data, id);
950 const unsigned char *
951 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
955 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
957 if (entry && (entry < data->start || entry >= data->end))
959 if (!repodata_precheck_keyname(data, keyname))
961 for (j = 1; j < data->nkeys; j++)
963 if (data->keys[j].name == keyname)
965 const unsigned char *chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
976 repo_lookup_void(Repo *repo, Id entry, Id keyname)
980 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
982 if (entry && (entry < data->start || entry >= data->end))
984 if (!repodata_precheck_keyname(data, keyname))
986 for (j = 1; j < data->nkeys; j++)
988 if (data->keys[j].name == keyname
989 && (data->keys[j].type == REPOKEY_TYPE_VOID))
991 if (repodata_lookup_void(data, entry, keyname))
999 /***********************************************************************/
1002 repo_add_repodata(Repo *repo, int localpool)
1007 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
1008 data = repo->repodata + repo->nrepodata - 1;
1009 repodata_init(data, repo, localpool);
1014 repo_last_repodata(Repo *repo)
1017 for (i = repo->nrepodata - 1; i >= 0; i--)
1018 if (repo->repodata[i].state != REPODATA_STUB)
1019 return repo->repodata + i;
1020 return repo_add_repodata(repo, 0);
1024 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1026 Repodata *data = repo_last_repodata(repo);
1027 repodata_set_id(data, p, keyname, id);
1031 repo_set_num(Repo *repo, Id p, Id keyname, Id num)
1033 Repodata *data = repo_last_repodata(repo);
1034 repodata_set_num(data, p, keyname, num);
1038 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1040 Repodata *data = repo_last_repodata(repo);
1041 repodata_set_str(data, p, keyname, str);
1045 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1047 Repodata *data = repo_last_repodata(repo);
1048 repodata_set_poolstr(data, p, keyname, str);
1052 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1054 Repodata *data = repo_last_repodata(repo);
1055 repodata_add_poolstr_array(data, p, keyname, str);
1059 repo_internalize(Repo *repo)
1064 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1065 if (data->attrs || data->xattrs)
1066 repodata_internalize(data);
1070 repo_disable_paging(Repo *repo)
1075 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1076 repodata_disable_paging(data);
1080 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: