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 (reuseids && repo->end == pool->nsolvables)
83 /* it's ok to reuse the ids. As this is the last repo, we can
84 just shrink the solvable array */
85 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
88 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
90 /* zero out (i.e. free) solvables belonging to this repo */
91 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
93 memset(s, 0, sizeof(*s));
96 /* free all data belonging to this repo */
97 repo->idarraydata = sat_free(repo->idarraydata);
98 repo->idarraysize = 0;
100 repo->rpmdbid = sat_free(repo->rpmdbid);
101 for (i = 0; i < repo->nrepodata; i++)
102 repodata_freedata(repo->repodata + i);
103 sat_free(repo->repodata);
109 * remove repo from pool, delete solvables
114 repo_free(Repo *repo, int reuseids)
116 Pool *pool = repo->pool;
119 if (repo == pool->installed)
121 repo_empty(repo, reuseids);
122 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
123 if (pool->repos[i] == repo)
125 if (i == pool->nrepos) /* repo not in pool, return */
127 if (i < pool->nrepos - 1)
129 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
131 for (; i < pool->nrepos - 1; i++)
132 pool->repos[i]->repoid = i + 1;
139 repo_freeallrepos(Pool *pool, int reuseids)
143 pool_freewhatprovides(pool);
144 for (i = 0; i < pool->nrepos; i++)
145 repo_freedata(pool->repos[i]);
146 pool->repos = sat_free(pool->repos);
148 /* the first two solvables don't belong to a repo */
149 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
152 void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
157 if (start + count == repo->end)
159 repo->nsolvables -= count;
160 for (s = repo->pool->solvables + start, i = count; i--; s++)
162 pool_free_solvable_block(repo->pool, start, count, reuseids);
163 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
164 if (data->end > repo->end)
165 repodata_shrink(data, repo->end);
169 /* repository sidedata is solvable data allocated on demand.
170 * It is used for data that is normally not present
171 * in the solvable like the rpmdbid.
172 * The solvable allocation funcions need to make sure that
173 * the sidedata gets extended if new solvables get added.
176 #define REPO_SIDEDATA_BLOCK 63
179 repo_sidedata_create(Repo *repo, size_t size)
181 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
185 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
187 int n = repo->end - repo->start;
190 int d = repo->start - p;
191 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
192 memmove((char *)b + d * size, b, n * size);
193 memset(b, 0, d * size);
196 if (p + count > repo->end)
198 int d = p + count - repo->end;
199 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
200 memset((char *)b + n * size, 0, d * size);
206 * add Id to idarraydata used to store dependencies
207 * olddeps: old array offset to extend
208 * returns new array offset
212 repo_addid(Repo *repo, Offset olddeps, Id id)
218 idarray = repo->idarraydata;
219 idarraysize = repo->idarraysize;
221 if (!idarray) /* alloc idarray if not done yet */
224 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
229 if (!olddeps) /* no deps yet */
231 olddeps = idarraysize;
232 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
234 else if (olddeps == repo->lastoff) /* extend at end */
236 else /* can't extend, copy old */
239 olddeps = idarraysize;
240 for (; idarray[i]; i++)
242 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
243 idarray[idarraysize++] = idarray[i];
245 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
248 idarray[idarraysize++] = id; /* insert Id into array */
249 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
250 idarray[idarraysize++] = 0; /* ensure NULL termination */
252 repo->idarraydata = idarray;
253 repo->idarraysize = idarraysize;
254 repo->lastoff = olddeps;
261 * add dependency (as Id) to repo, also unifies dependencies
262 * olddeps = offset into idarraydata
263 * marker= 0 for normal dep
264 * marker > 0 add dep after marker
265 * marker < 0 add dep after -marker
266 * returns new start of dependency array
269 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
271 Id oid, *oidp, *markerp;
277 olddeps = repo_addid(repo, olddeps, marker);
278 return repo_addid(repo, olddeps, id);
283 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
288 return repo_addid(repo, olddeps, id);
298 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
308 if (markerp || before)
310 /* we found it, but in the wrong half */
312 for (; (oid = *oidp) != ID_NULL; oidp++)
317 /* no marker in array yet */
320 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
322 return repo_addid(repo, olddeps, id);
326 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
330 /* id not yet in array */
331 if (!before && !markerp)
332 olddeps = repo_addid(repo, olddeps, marker);
333 else if (before && markerp)
338 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
341 return repo_addid(repo, olddeps, id);
347 * make space for 'num' more dependencies
348 * returns new start of dependency array
350 * reserved ids will always begin at offset idarraysize
354 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
356 num++; /* room for trailing ID_NULL */
358 if (!repo->idarraysize) /* ensure buffer space */
360 repo->idarraysize = 1;
361 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
362 repo->idarraydata[0] = 0;
367 if (olddeps && olddeps != repo->lastoff) /* if not appending */
369 /* can't insert into idarray, this would invalidate all 'larger' offsets
370 * so create new space at end and move existing deps there.
371 * Leaving 'hole' at old position.
377 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
379 count = idend - idstart - 1 + num; /* new size */
381 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
382 /* move old deps to end */
383 olddeps = repo->lastoff = repo->idarraysize;
384 memcpy(repo->idarraydata + olddeps, idstart, count - num);
385 repo->idarraysize = olddeps + count - num;
390 if (olddeps) /* appending */
394 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
396 /* appending or new */
397 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
399 return repo->lastoff;
405 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
407 Pool *pool = repo->pool;
409 char buf[1024], *p, *dep;
414 for (i = provides; repo->idarraydata[i]; i++)
416 id = repo->idarraydata[i];
419 dep = (char *)id2str(pool, id);
420 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
423 strcpy(buf + 2, dep);
425 if ((p = strchr(dep, ':')) != 0 && p != dep)
428 idp = str2id(pool, dep, 1);
432 while ((p = strchr(dep, ';')) != 0)
441 strncpy(dep - 9, "language:", 9);
442 idl = str2id(pool, dep - 9, 1);
444 idl = str2id(pool, dep, 1);
445 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
448 id = rel2id(pool, id, idl, REL_OR, 1);
453 if (dep[0] && dep[1])
455 for (p = dep; *p && *p != ')'; p++)
459 strncpy(dep - 9, "language:", 9);
460 idl = str2id(pool, dep - 9, 1);
462 idl = str2id(pool, dep, 1);
463 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
466 id = rel2id(pool, id, idl, REL_OR, 1);
471 id = rel2id(pool, idp, id, REL_AND, 1);
473 supplements = repo_addid_dep(repo, supplements, id, 0);
475 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
480 idp = str2id(pool, buf, 1);
481 /* strip trailing slashes */
483 while (l > 1 && p[l - 1] == '/')
485 id = str2id(pool, p, 1);
486 id = rel2id(pool, idp, id, REL_WITH, 1);
487 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
488 supplements = repo_addid_dep(repo, supplements, id, 0);
494 for (i = supplements; repo->idarraydata[i]; i++)
496 id = repo->idarraydata[i];
499 dep = (char *)id2str(pool, id);
500 if (!strncmp(dep, "system:modalias(", 16))
502 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
505 p = strchr(buf + 9, ':');
506 if (p && p != buf + 9 && strchr(p + 1, ':'))
509 idp = str2id(pool, buf + 9, 1);
510 p[strlen(p) - 1] = 0;
511 id = str2id(pool, p, 1);
512 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
513 id = rel2id(pool, idp, id, REL_AND, 1);
518 p[strlen(p) - 1] = 0;
519 id = str2id(pool, p, 1);
520 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
523 repo->idarraydata[i] = id;
525 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
530 while ((p = strchr(dep, ':')) != 0)
538 idp = str2id(pool, dep, 1);
540 id = rel2id(pool, id, idp, REL_AND, 1);
545 if (dep[0] && dep[1])
547 dep[strlen(dep) - 1] = 0;
548 idp = str2id(pool, dep, 1);
550 id = rel2id(pool, id, idp, REL_AND, 1);
555 repo->idarraydata[i] = id;
557 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
559 strcpy(buf, dep + 11);
560 if ((p = strrchr(buf, ')')) != 0)
562 id = str2id(pool, buf, 1);
563 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
564 repo->idarraydata[i] = id;
568 if (freshens && repo->idarraydata[freshens])
570 Id idsupp = 0, idfresh = 0;
573 for (i = supplements; repo->idarraydata[i]; i++)
576 idsupp = repo->idarraydata[i];
578 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
580 for (i = freshens; repo->idarraydata[i]; i++)
583 idfresh = repo->idarraydata[i];
585 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
590 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
591 supplements = repo_addid_dep(repo, 0, idsupp, 0);
597 repo_fix_conflicts(Repo *repo, Offset conflicts)
599 char buf[1024], *p, *dep;
600 Pool *pool = repo->pool;
606 for (i = conflicts; repo->idarraydata[i]; i++)
608 id = repo->idarraydata[i];
611 dep = (char *)id2str(pool, id);
612 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
614 strcpy(buf, dep + 15);
615 if ((p = strchr(buf, ')')) != 0)
617 id = str2id(pool, buf, 1);
618 id = rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
619 repo->idarraydata[i] = id;
631 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
636 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
638 struct matchdata *md = cbdata;
640 if (md->matcher.match)
642 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
644 if (!datamatcher_match(&md->matcher, kv->str))
647 md->stop = md->callback(md->callback_data, s, data, key, kv);
652 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
653 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
654 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
655 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
656 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
657 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
658 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
659 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
660 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
661 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
662 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
663 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
664 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
665 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
669 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
674 for (; *ida && !md->stop; ida++)
677 kv.eof = ida[1] ? 0 : 1;
678 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
684 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
687 Pool *pool = repo->pool;
696 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
699 repo_search_md(repo, p, keyname, md);
700 if (md->stop > SEARCH_NEXT_SOLVABLE)
706 /* The callback only supports solvables, so we can't iterate over the
710 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
712 s = pool->solvables + p;
720 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
722 if (keyname || md->stop > SEARCH_NEXT_KEY)
728 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
730 if (keyname || md->stop > SEARCH_NEXT_KEY)
736 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
738 if (keyname || md->stop > SEARCH_NEXT_KEY)
740 case SOLVABLE_VENDOR:
744 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
746 if (keyname || md->stop > SEARCH_NEXT_KEY)
748 case SOLVABLE_PROVIDES:
750 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
751 if (keyname || md->stop > SEARCH_NEXT_KEY)
753 case SOLVABLE_OBSOLETES:
755 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
756 if (keyname || md->stop > SEARCH_NEXT_KEY)
758 case SOLVABLE_CONFLICTS:
760 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
761 if (keyname || md->stop > SEARCH_NEXT_KEY)
763 case SOLVABLE_REQUIRES:
765 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
766 if (keyname || md->stop > SEARCH_NEXT_KEY)
768 case SOLVABLE_RECOMMENDS:
770 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
771 if (keyname || md->stop > SEARCH_NEXT_KEY)
773 case SOLVABLE_SUPPLEMENTS:
775 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
776 if (keyname || md->stop > SEARCH_NEXT_KEY)
778 case SOLVABLE_SUGGESTS:
780 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
781 if (keyname || md->stop > SEARCH_NEXT_KEY)
783 case SOLVABLE_ENHANCES:
785 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
786 if (keyname || md->stop > SEARCH_NEXT_KEY)
791 kv.num = repo->rpmdbid[p - repo->start];
792 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
794 if (keyname || md->stop > SEARCH_NEXT_KEY)
802 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
804 if (p < data->start || p >= data->end)
806 if (keyname && !repodata_precheck_keyname(data, keyname))
808 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
810 /* do not search filelist extensions */
811 if (data->state != REPODATA_AVAILABLE)
813 for (j = 1; j < data->nkeys; j++)
814 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
816 if (j == data->nkeys)
819 if (data->state == REPODATA_STUB)
823 for (j = 1; j < data->nkeys; j++)
824 if (keyname == data->keys[j].name)
826 if (j == data->nkeys)
830 if (data->loadcallback)
831 data->loadcallback(data);
833 data->state = REPODATA_ERROR;
835 if (data->state == REPODATA_ERROR)
837 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
838 if (md->stop > SEARCH_NEXT_KEY)
844 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)
848 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
850 memset(&md, 0, sizeof(md));
851 md.pool = repo->pool;
853 md.callback = callback;
854 md.callback_data = cbdata;
856 datamatcher_init(&md.matcher, match, flags);
857 repo_search_md(repo, p, keyname, &md);
859 datamatcher_free(&md.matcher);
863 repo_lookup_str(Repo *repo, Id entry, Id keyname)
865 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 str = repodata_lookup_str(data, entry, keyname);
890 if (repodata_lookup_type(data, entry, keyname))
898 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
904 if (keyname == RPM_RPMDBID)
906 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
907 return repo->rpmdbid[entry - repo->start];
910 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
912 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
914 if (!repodata_precheck_keyname(data, keyname))
916 if (repodata_lookup_num(data, entry, keyname, &value))
918 if (repodata_lookup_type(data, entry, keyname))
925 repo_lookup_id(Repo *repo, Id entry, Id keyname)
934 return repo->pool->solvables[entry].name;
936 return repo->pool->solvables[entry].arch;
938 return repo->pool->solvables[entry].evr;
939 case SOLVABLE_VENDOR:
940 return repo->pool->solvables[entry].vendor;
942 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
944 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
946 if (!repodata_precheck_keyname(data, keyname))
948 id = repodata_lookup_id(data, entry, keyname);
950 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
951 if (repodata_lookup_type(data, entry, keyname))
957 const unsigned char *
958 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
962 const unsigned char *chk;
964 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
966 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
968 if (!repodata_precheck_keyname(data, keyname))
970 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
973 if (repodata_lookup_type(data, entry, keyname))
981 repo_lookup_void(Repo *repo, Id entry, Id keyname)
987 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
989 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
991 if (!repodata_precheck_keyname(data, keyname))
993 type = repodata_lookup_type(data, entry, keyname);
995 return type == REPOKEY_TYPE_VOID;
1001 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1007 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1009 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1011 if (!repodata_precheck_keyname(data, keyname))
1013 type = repodata_lookup_type(data, entry, keyname);
1015 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1020 /***********************************************************************/
1023 repo_add_repodata(Repo *repo, int flags)
1026 if ((flags & REPO_USE_LOADING) != 0)
1028 for (i = repo->nrepodata - 1; i >= 0; i--)
1029 if (repo->repodata[i].state == REPODATA_LOADING)
1031 Repodata *data = repo->repodata + i;
1033 /* hack: we mis-use REPO_REUSE_REPODATA here */
1034 if (!(flags & REPO_REUSE_REPODATA))
1035 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1038 return 0; /* must not create a new repodata! */
1040 if ((flags & REPO_REUSE_REPODATA) != 0)
1042 for (i = repo->nrepodata - 1; i >= 0; i--)
1043 if (repo->repodata[i].state != REPODATA_STUB)
1044 return repo->repodata + i;
1046 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1050 repo_last_repodata(Repo *repo)
1053 for (i = repo->nrepodata - 1; i >= 0; i--)
1054 if (repo->repodata[i].state != REPODATA_STUB)
1055 return repo->repodata + i;
1056 return repo_add_repodata(repo, 0);
1060 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1062 Repodata *data = repo_last_repodata(repo);
1063 repodata_set_id(data, p, keyname, id);
1067 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1069 Repodata *data = repo_last_repodata(repo);
1070 repodata_set_num(data, p, keyname, num);
1074 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1076 Repodata *data = repo_last_repodata(repo);
1077 repodata_set_str(data, p, keyname, str);
1081 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1083 Repodata *data = repo_last_repodata(repo);
1084 repodata_set_poolstr(data, p, keyname, str);
1088 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1090 Repodata *data = repo_last_repodata(repo);
1091 repodata_add_poolstr_array(data, p, keyname, str);
1095 repo_internalize(Repo *repo)
1100 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1101 if (data->attrs || data->xattrs)
1102 repodata_internalize(data);
1106 repo_disable_paging(Repo *repo)
1111 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1112 repodata_disable_paging(data);
1116 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: