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"
30 #define IDARRAY_BLOCK 4095
39 repo_create(Pool *pool, const char *name)
43 pool_freewhatprovides(pool);
44 repo = (Repo *)sat_calloc(1, sizeof(*repo));
45 pool->repos = (Repo **)sat_realloc2(pool->repos, pool->nrepos + 1, sizeof(Repo *));
46 pool->repos[pool->nrepos++] = repo;
47 repo->repoid = pool->nrepos;
48 repo->name = name ? strdup(name) : 0;
50 repo->start = pool->nsolvables;
51 repo->end = pool->nsolvables;
57 repo_freedata(Repo *repo)
60 for (i = 0; i < repo->nrepodata; i++)
61 repodata_freedata(repo->repodata + i);
62 sat_free(repo->repodata);
63 sat_free(repo->idarraydata);
64 sat_free(repo->rpmdbid);
65 sat_free((char *)repo->name);
69 /* delete all solvables and repodata blocks from this repo */
72 repo_empty(Repo *repo, int reuseids)
74 Pool *pool = repo->pool;
78 pool_freewhatprovides(pool);
79 if (reuseids && repo->end == pool->nsolvables)
81 /* it's ok to reuse the ids. As this is the last repo, we can
82 just shrink the solvable array */
83 for (i = repo->end - 1, s = pool->solvables + i; i >= repo->start; i--, s--)
86 pool_free_solvable_block(pool, i + 1, repo->end - (i + 1), reuseids);
88 /* zero out (i.e. free) solvables belonging to this repo */
89 for (i = repo->start, s = pool->solvables + i; i < repo->end; i++, s++)
91 memset(s, 0, sizeof(*s));
94 /* free all data belonging to this repo */
95 repo->idarraydata = sat_free(repo->idarraydata);
96 repo->idarraysize = 0;
98 repo->rpmdbid = sat_free(repo->rpmdbid);
99 for (i = 0; i < repo->nrepodata; i++)
100 repodata_freedata(repo->repodata + i);
101 sat_free(repo->repodata);
107 * remove repo from pool, delete solvables
112 repo_free(Repo *repo, int reuseids)
114 Pool *pool = repo->pool;
117 if (repo == pool->installed)
119 repo_empty(repo, reuseids);
120 for (i = 0; i < pool->nrepos; i++) /* find repo in pool */
121 if (pool->repos[i] == repo)
123 if (i == pool->nrepos) /* repo not in pool, return */
125 if (i < pool->nrepos - 1)
127 memmove(pool->repos + i, pool->repos + i + 1, (pool->nrepos - 1 - i) * sizeof(Repo *));
129 for (; i < pool->nrepos - 1; i++)
130 pool->repos[i]->repoid = i + 1;
137 repo_freeallrepos(Pool *pool, int reuseids)
141 pool_freewhatprovides(pool);
142 for (i = 0; i < pool->nrepos; i++)
143 repo_freedata(pool->repos[i]);
144 pool->repos = sat_free(pool->repos);
146 /* the first two solvables don't belong to a repo */
147 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
150 void repo_free_solvable_block(Repo *repo, Id start, int count, int reuseids)
155 if (start + count == repo->end)
157 repo->nsolvables -= count;
158 for (s = repo->pool->solvables + start, i = count; i--; s++)
160 pool_free_solvable_block(repo->pool, start, count, reuseids);
161 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
162 if (data->end > repo->end)
163 repodata_shrink(data, repo->end);
167 /* repository sidedata is solvable data allocated on demand.
168 * It is used for data that is normally not present
169 * in the solvable like the rpmdbid.
170 * The solvable allocation funcions need to make sure that
171 * the sidedata gets extended if new solvables get added.
174 #define REPO_SIDEDATA_BLOCK 63
177 repo_sidedata_create(Repo *repo, size_t size)
179 return sat_calloc_block(repo->end - repo->start, size, REPO_SIDEDATA_BLOCK);
183 repo_sidedata_extend(Repo *repo, void *b, size_t size, Id p, int count)
185 int n = repo->end - repo->start;
188 int d = repo->start - p;
189 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
190 memmove((char *)b + d * size, b, n * size);
191 memset(b, 0, d * size);
194 if (p + count > repo->end)
196 int d = p + count - repo->end;
197 b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
198 memset((char *)b + n * size, 0, d * size);
204 * add Id to idarraydata used to store dependencies
205 * olddeps: old array offset to extend
206 * returns new array offset
210 repo_addid(Repo *repo, Offset olddeps, Id id)
216 idarray = repo->idarraydata;
217 idarraysize = repo->idarraysize;
219 if (!idarray) /* alloc idarray if not done yet */
222 idarray = sat_extend_resize(0, 1, sizeof(Id), IDARRAY_BLOCK);
227 if (!olddeps) /* no deps yet */
229 olddeps = idarraysize;
230 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
232 else if (olddeps == repo->lastoff) /* extend at end */
234 else /* can't extend, copy old */
237 olddeps = idarraysize;
238 for (; idarray[i]; i++)
240 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
241 idarray[idarraysize++] = idarray[i];
243 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
246 idarray[idarraysize++] = id; /* insert Id into array */
247 idarray = sat_extend(idarray, idarraysize, 1, sizeof(Id), IDARRAY_BLOCK);
248 idarray[idarraysize++] = 0; /* ensure NULL termination */
250 repo->idarraydata = idarray;
251 repo->idarraysize = idarraysize;
252 repo->lastoff = olddeps;
259 * add dependency (as Id) to repo, also unifies dependencies
260 * olddeps = offset into idarraydata
261 * marker= 0 for normal dep
262 * marker > 0 add dep after marker
263 * marker < 0 add dep after -marker
264 * returns new start of dependency array
267 repo_addid_dep(Repo *repo, Offset olddeps, Id id, Id marker)
269 Id oid, *oidp, *markerp;
275 olddeps = repo_addid(repo, olddeps, marker);
276 return repo_addid(repo, olddeps, id);
281 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
286 return repo_addid(repo, olddeps, id);
296 for (oidp = repo->idarraydata + olddeps; (oid = *oidp) != ID_NULL; oidp++)
306 if (markerp || before)
308 /* we found it, but in the wrong half */
310 for (; (oid = *oidp) != ID_NULL; oidp++)
315 /* no marker in array yet */
318 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
320 return repo_addid(repo, olddeps, id);
324 memmove(markerp, markerp + 1, (oidp - markerp) * sizeof(Id));
328 /* id not yet in array */
329 if (!before && !markerp)
330 olddeps = repo_addid(repo, olddeps, marker);
331 else if (before && markerp)
336 memmove(markerp + 1, markerp, (oidp - markerp) * sizeof(Id));
339 return repo_addid(repo, olddeps, id);
345 * make space for 'num' more dependencies
346 * returns new start of dependency array
348 * reserved ids will always begin at offset idarraysize
352 repo_reserve_ids(Repo *repo, Offset olddeps, int num)
354 num++; /* room for trailing ID_NULL */
356 if (!repo->idarraysize) /* ensure buffer space */
358 repo->idarraysize = 1;
359 repo->idarraydata = sat_extend_resize(0, 1 + num, sizeof(Id), IDARRAY_BLOCK);
360 repo->idarraydata[0] = 0;
365 if (olddeps && olddeps != repo->lastoff) /* if not appending */
367 /* can't insert into idarray, this would invalidate all 'larger' offsets
368 * so create new space at end and move existing deps there.
369 * Leaving 'hole' at old position.
375 for (idstart = idend = repo->idarraydata + olddeps; *idend++; ) /* find end */
377 count = idend - idstart - 1 + num; /* new size */
379 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, count, sizeof(Id), IDARRAY_BLOCK);
380 /* move old deps to end */
381 olddeps = repo->lastoff = repo->idarraysize;
382 memcpy(repo->idarraydata + olddeps, idstart, count - num);
383 repo->idarraysize = olddeps + count - num;
388 if (olddeps) /* appending */
392 repo->idarraydata = sat_extend(repo->idarraydata, repo->idarraysize, num, sizeof(Id), IDARRAY_BLOCK);
394 /* appending or new */
395 repo->lastoff = olddeps ? olddeps : repo->idarraysize;
397 return repo->lastoff;
403 repo_fix_supplements(Repo *repo, Offset provides, Offset supplements, Offset freshens)
405 Pool *pool = repo->pool;
407 char buf[1024], *p, *dep;
412 for (i = provides; repo->idarraydata[i]; i++)
414 id = repo->idarraydata[i];
417 dep = (char *)pool_id2str(pool, id);
418 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
421 strcpy(buf + 2, dep);
423 if ((p = strchr(dep, ':')) != 0 && p != dep)
426 idp = pool_str2id(pool, dep, 1);
430 while ((p = strchr(dep, ';')) != 0)
439 strncpy(dep - 9, "language:", 9);
440 idl = pool_str2id(pool, dep - 9, 1);
442 idl = pool_str2id(pool, dep, 1);
443 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
446 id = pool_rel2id(pool, id, idl, REL_OR, 1);
451 if (dep[0] && dep[1])
453 for (p = dep; *p && *p != ')'; p++)
457 strncpy(dep - 9, "language:", 9);
458 idl = pool_str2id(pool, dep - 9, 1);
460 idl = pool_str2id(pool, dep, 1);
461 idl = pool_rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
464 id = pool_rel2id(pool, id, idl, REL_OR, 1);
469 id = pool_rel2id(pool, idp, id, REL_AND, 1);
471 supplements = repo_addid_dep(repo, supplements, id, 0);
473 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
478 idp = pool_str2id(pool, buf, 1);
479 /* strip trailing slashes */
481 while (l > 1 && p[l - 1] == '/')
483 id = pool_str2id(pool, p, 1);
484 id = pool_rel2id(pool, idp, id, REL_WITH, 1);
485 id = pool_rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
486 supplements = repo_addid_dep(repo, supplements, id, 0);
492 for (i = supplements; repo->idarraydata[i]; i++)
494 id = repo->idarraydata[i];
497 dep = (char *)pool_id2str(pool, id);
498 if (!strncmp(dep, "system:modalias(", 16))
500 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
503 p = strchr(buf + 9, ':');
504 if (p && p != buf + 9 && strchr(p + 1, ':'))
507 idp = pool_str2id(pool, buf + 9, 1);
508 p[strlen(p) - 1] = 0;
509 id = pool_str2id(pool, p, 1);
510 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
511 id = pool_rel2id(pool, idp, id, REL_AND, 1);
516 p[strlen(p) - 1] = 0;
517 id = pool_str2id(pool, p, 1);
518 id = pool_rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
521 repo->idarraydata[i] = id;
523 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
528 while ((p = strchr(dep, ':')) != 0)
536 idp = pool_str2id(pool, dep, 1);
538 id = pool_rel2id(pool, id, idp, REL_AND, 1);
543 if (dep[0] && dep[1])
545 dep[strlen(dep) - 1] = 0;
546 idp = pool_str2id(pool, dep, 1);
548 id = pool_rel2id(pool, id, idp, REL_AND, 1);
553 repo->idarraydata[i] = id;
555 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
557 strcpy(buf, dep + 11);
558 if ((p = strrchr(buf, ')')) != 0)
560 id = pool_str2id(pool, buf, 1);
561 id = pool_rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
562 repo->idarraydata[i] = id;
566 if (freshens && repo->idarraydata[freshens])
568 Id idsupp = 0, idfresh = 0;
571 for (i = supplements; repo->idarraydata[i]; i++)
574 idsupp = repo->idarraydata[i];
576 idsupp = pool_rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
578 for (i = freshens; repo->idarraydata[i]; i++)
581 idfresh = repo->idarraydata[i];
583 idfresh = pool_rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
588 idsupp = pool_rel2id(pool, idsupp, idfresh, REL_AND, 1);
589 supplements = repo_addid_dep(repo, 0, idsupp, 0);
595 repo_fix_conflicts(Repo *repo, Offset conflicts)
597 char buf[1024], *p, *dep;
598 Pool *pool = repo->pool;
604 for (i = conflicts; repo->idarraydata[i]; i++)
606 id = repo->idarraydata[i];
609 dep = (char *)pool_id2str(pool, id);
610 if (!strncmp(dep, "otherproviders(", 15) && strlen(dep) < sizeof(buf) - 2)
612 strcpy(buf, dep + 15);
613 if ((p = strchr(buf, ')')) != 0)
615 id = pool_str2id(pool, buf, 1);
616 id = pool_rel2id(pool, NAMESPACE_OTHERPROVIDERS, id, REL_NAMESPACE, 1);
617 repo->idarraydata[i] = id;
629 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
634 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
636 struct matchdata *md = cbdata;
638 if (md->matcher.match)
640 if (!repodata_stringify(md->pool, data, key, kv, md->flags))
642 if (!datamatcher_match(&md->matcher, kv->str))
645 md->stop = md->callback(md->callback_data, s, data, key, kv);
650 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
651 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
652 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
653 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
654 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
655 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
656 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
657 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
658 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
659 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
660 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
661 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
662 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
663 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
667 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
672 for (; *ida && !md->stop; ida++)
675 kv.eof = ida[1] ? 0 : 1;
676 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
682 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
685 Pool *pool = repo->pool;
694 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
697 repo_search_md(repo, p, keyname, md);
698 if (md->stop > SEARCH_NEXT_SOLVABLE)
704 /* The callback only supports solvables, so we can't iterate over the
708 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
710 s = pool->solvables + p;
718 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
720 if (keyname || md->stop > SEARCH_NEXT_KEY)
726 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
728 if (keyname || md->stop > SEARCH_NEXT_KEY)
734 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
736 if (keyname || md->stop > SEARCH_NEXT_KEY)
738 case SOLVABLE_VENDOR:
742 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
744 if (keyname || md->stop > SEARCH_NEXT_KEY)
746 case SOLVABLE_PROVIDES:
748 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
749 if (keyname || md->stop > SEARCH_NEXT_KEY)
751 case SOLVABLE_OBSOLETES:
753 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
754 if (keyname || md->stop > SEARCH_NEXT_KEY)
756 case SOLVABLE_CONFLICTS:
758 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
759 if (keyname || md->stop > SEARCH_NEXT_KEY)
761 case SOLVABLE_REQUIRES:
763 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
764 if (keyname || md->stop > SEARCH_NEXT_KEY)
766 case SOLVABLE_RECOMMENDS:
768 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
769 if (keyname || md->stop > SEARCH_NEXT_KEY)
771 case SOLVABLE_SUPPLEMENTS:
773 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
774 if (keyname || md->stop > SEARCH_NEXT_KEY)
776 case SOLVABLE_SUGGESTS:
778 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
779 if (keyname || md->stop > SEARCH_NEXT_KEY)
781 case SOLVABLE_ENHANCES:
783 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
784 if (keyname || md->stop > SEARCH_NEXT_KEY)
789 kv.num = repo->rpmdbid[p - repo->start];
790 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
792 if (keyname || md->stop > SEARCH_NEXT_KEY)
800 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
802 if (p < data->start || p >= data->end)
804 if (keyname && !repodata_precheck_keyname(data, keyname))
806 if (keyname == SOLVABLE_FILELIST && !(md->flags & SEARCH_COMPLETE_FILELIST))
808 /* do not search filelist extensions */
809 if (data->state != REPODATA_AVAILABLE)
811 for (j = 1; j < data->nkeys; j++)
812 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
814 if (j == data->nkeys)
817 if (data->state == REPODATA_STUB)
821 for (j = 1; j < data->nkeys; j++)
822 if (keyname == data->keys[j].name)
824 if (j == data->nkeys)
828 if (data->loadcallback)
829 data->loadcallback(data);
831 data->state = REPODATA_ERROR;
833 if (data->state == REPODATA_ERROR)
835 repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
836 if (md->stop > SEARCH_NEXT_KEY)
842 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)
846 if (repo->disabled && !(flags & SEARCH_DISABLED_REPOS))
848 memset(&md, 0, sizeof(md));
849 md.pool = repo->pool;
851 md.callback = callback;
852 md.callback_data = cbdata;
854 datamatcher_init(&md.matcher, match, flags);
855 repo_search_md(repo, p, keyname, &md);
857 datamatcher_free(&md.matcher);
861 repo_lookup_str(Repo *repo, Id entry, Id keyname)
863 Pool *pool = repo->pool;
873 return pool_id2str(pool, pool->solvables[entry].name);
875 return pool_id2str(pool, pool->solvables[entry].arch);
877 return pool_id2str(pool, pool->solvables[entry].evr);
878 case SOLVABLE_VENDOR:
879 return pool_id2str(pool, pool->solvables[entry].vendor);
882 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
884 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
886 if (!repodata_precheck_keyname(data, keyname))
888 str = repodata_lookup_str(data, entry, keyname);
891 if (repodata_lookup_type(data, entry, keyname))
899 repo_lookup_num(Repo *repo, Id entry, Id keyname, unsigned int notfound)
907 if (keyname == RPM_RPMDBID)
909 if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
910 return repo->rpmdbid[entry - repo->start];
914 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
916 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
918 if (!repodata_precheck_keyname(data, keyname))
920 if (repodata_lookup_num(data, entry, keyname, &value))
922 if (repodata_lookup_type(data, entry, keyname))
929 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;
949 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
951 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
953 if (!repodata_precheck_keyname(data, keyname))
955 id = repodata_lookup_id(data, entry, keyname);
957 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
958 if (repodata_lookup_type(data, entry, keyname))
965 lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
971 for (p = repo->idarraydata + off; *p; p++)
977 repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
985 case SOLVABLE_PROVIDES:
986 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].provides, q);
987 case SOLVABLE_OBSOLETES:
988 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].obsoletes, q);
989 case SOLVABLE_CONFLICTS:
990 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].conflicts, q);
991 case SOLVABLE_REQUIRES:
992 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].requires, q);
993 case SOLVABLE_RECOMMENDS:
994 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].recommends, q);
995 case SOLVABLE_SUGGESTS:
996 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].suggests, q);
997 case SOLVABLE_SUPPLEMENTS:
998 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].supplements, q);
999 case SOLVABLE_ENHANCES:
1000 return lookup_idarray_solvable(repo, repo->pool->solvables[entry].enhances, q);
1003 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1005 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1007 if (!repodata_precheck_keyname(data, keyname))
1009 if (repodata_lookup_idarray(data, entry, keyname, q))
1011 if (data->localpool)
1013 for (i = 0; i < q->count; i++)
1014 q->elements[i] = repodata_globalize_id(data, q->elements[i], 1);
1018 if (repodata_lookup_type(data, entry, keyname))
1025 const unsigned char *
1026 repo_lookup_bin_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1030 const unsigned char *chk;
1032 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1034 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1036 if (!repodata_precheck_keyname(data, keyname))
1038 chk = repodata_lookup_bin_checksum(data, entry, keyname, typep);
1041 if (repodata_lookup_type(data, entry, keyname))
1049 repo_lookup_checksum(Repo *repo, Id entry, Id keyname, Id *typep)
1051 const unsigned char *chk = repo_lookup_bin_checksum(repo, entry, keyname, typep);
1052 return chk ? pool_bin2hex(repo->pool, chk, sat_chksum_len(*typep)) : 0;
1056 repo_lookup_void(Repo *repo, Id entry, Id keyname)
1062 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1064 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1066 if (!repodata_precheck_keyname(data, keyname))
1068 type = repodata_lookup_type(data, entry, keyname);
1070 return type == REPOKEY_TYPE_VOID;
1076 repo_lookup_type(Repo *repo, Id entry, Id keyname)
1082 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1084 if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
1086 if (!repodata_precheck_keyname(data, keyname))
1088 type = repodata_lookup_type(data, entry, keyname);
1090 return type == REPOKEY_TYPE_DELETED ? 0 : type;
1095 /***********************************************************************/
1098 repo_add_repodata(Repo *repo, int flags)
1101 if ((flags & REPO_USE_LOADING) != 0)
1103 for (i = repo->nrepodata - 1; i >= 0; i--)
1104 if (repo->repodata[i].state == REPODATA_LOADING)
1106 Repodata *data = repo->repodata + i;
1108 /* hack: we mis-use REPO_REUSE_REPODATA here */
1109 if (!(flags & REPO_REUSE_REPODATA))
1110 repodata_empty(data, (flags & REPO_LOCALPOOL) ? 1 : 0);
1113 return 0; /* must not create a new repodata! */
1115 if ((flags & REPO_REUSE_REPODATA) != 0)
1117 for (i = repo->nrepodata - 1; i >= 0; i--)
1118 if (repo->repodata[i].state != REPODATA_STUB)
1119 return repo->repodata + i;
1121 return repodata_create(repo, (flags & REPO_LOCALPOOL) ? 1 : 0);
1125 repo_last_repodata(Repo *repo)
1128 for (i = repo->nrepodata - 1; i >= 0; i--)
1129 if (repo->repodata[i].state != REPODATA_STUB)
1130 return repo->repodata + i;
1131 return repo_add_repodata(repo, 0);
1135 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
1143 repo->pool->solvables[p].name = id;
1146 repo->pool->solvables[p].arch = id;
1149 repo->pool->solvables[p].evr = id;
1151 case SOLVABLE_VENDOR:
1152 repo->pool->solvables[p].vendor = id;
1156 data = repo_last_repodata(repo);
1157 if (data->localpool)
1158 id = repodata_localize_id(data, id, 1);
1159 repodata_set_id(data, p, keyname, id);
1163 repo_set_num(Repo *repo, Id p, Id keyname, unsigned int num)
1168 if (keyname == RPM_RPMDBID)
1171 repo->rpmdbid = repo_sidedata_create(repo, sizeof(Id));
1172 repo->rpmdbid[p] = num;
1176 data = repo_last_repodata(repo);
1177 repodata_set_num(data, p, keyname, num);
1181 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
1191 case SOLVABLE_VENDOR:
1192 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1196 data = repo_last_repodata(repo);
1197 repodata_set_str(data, p, keyname, str);
1201 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
1211 case SOLVABLE_VENDOR:
1212 repo_set_id(repo, p, keyname, pool_str2id(repo->pool, str, 1));
1216 data = repo_last_repodata(repo);
1217 repodata_set_poolstr(data, p, keyname, str);
1221 repo_add_poolstr_array(Repo *repo, Id p, Id keyname, const char *str)
1223 Repodata *data = repo_last_repodata(repo);
1224 repodata_add_poolstr_array(data, p, keyname, str);
1228 repo_internalize(Repo *repo)
1233 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1234 if (data->attrs || data->xattrs)
1235 repodata_internalize(data);
1239 repo_disable_paging(Repo *repo)
1244 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
1245 repodata_disable_paging(data);
1249 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: