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 repo_fix_legacy(Repo *repo, Offset provides, Offset supplements, Offset freshens)
321 Pool *pool = repo->pool;
323 char buf[1024], *p, *dep;
328 for (i = provides; repo->idarraydata[i]; i++)
330 id = repo->idarraydata[i];
333 dep = (char *)id2str(pool, id);
334 if (!strncmp(dep, "locale(", 7) && strlen(dep) < sizeof(buf) - 2)
337 strcpy(buf + 2, dep);
339 if ((p = strchr(dep, ':')) != 0 && p != dep)
342 idp = str2id(pool, dep, 1);
346 while ((p = strchr(dep, ';')) != 0)
355 strncpy(dep - 9, "language:", 9);
356 idl = str2id(pool, dep - 9, 1);
358 idl = str2id(pool, dep, 1);
359 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
362 id = rel2id(pool, id, idl, REL_OR, 1);
367 if (dep[0] && dep[1])
369 for (p = dep; *p && *p != ')'; p++)
373 strncpy(dep - 9, "language:", 9);
374 idl = str2id(pool, dep - 9, 1);
376 idl = str2id(pool, dep, 1);
377 idl = rel2id(pool, NAMESPACE_LANGUAGE, idl, REL_NAMESPACE, 1);
380 id = rel2id(pool, id, idl, REL_OR, 1);
385 id = rel2id(pool, idp, id, REL_AND, 1);
387 supplements = repo_addid_dep(repo, supplements, id, 0);
389 else if ((p = strchr(dep, ':')) != 0 && p != dep && p[1] == '/' && strlen(dep) < sizeof(buf))
394 idp = str2id(pool, buf, 1);
395 /* strip trailing slashes */
397 while (l > 1 && p[l - 1] == '/')
399 id = str2id(pool, p, 1);
400 id = rel2id(pool, idp, id, REL_WITH, 1);
401 id = rel2id(pool, NAMESPACE_SPLITPROVIDES, id, REL_NAMESPACE, 1);
402 supplements = repo_addid_dep(repo, supplements, id, 0);
408 for (i = supplements; repo->idarraydata[i]; i++)
410 id = repo->idarraydata[i];
413 dep = (char *)id2str(pool, id);
414 if (!strncmp(dep, "system:modalias(", 16))
416 if (!strncmp(dep, "modalias(", 9) && dep[9] && dep[10] && strlen(dep) < sizeof(buf))
419 p = strchr(buf + 9, ':');
420 if (p && p != buf + 9 && strchr(p + 1, ':'))
423 idp = str2id(pool, buf + 9, 1);
424 p[strlen(p) - 1] = 0;
425 id = str2id(pool, p, 1);
426 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
427 id = rel2id(pool, idp, id, REL_AND, 1);
432 p[strlen(p) - 1] = 0;
433 id = str2id(pool, p, 1);
434 id = rel2id(pool, NAMESPACE_MODALIAS, id, REL_NAMESPACE, 1);
437 repo->idarraydata[i] = id;
439 else if (!strncmp(dep, "packageand(", 11) && strlen(dep) < sizeof(buf))
444 while ((p = strchr(dep, ':')) != 0)
452 idp = str2id(pool, dep, 1);
454 id = rel2id(pool, id, idp, REL_AND, 1);
459 if (dep[0] && dep[1])
461 dep[strlen(dep) - 1] = 0;
462 idp = str2id(pool, dep, 1);
464 id = rel2id(pool, id, idp, REL_AND, 1);
469 repo->idarraydata[i] = id;
471 else if (!strncmp(dep, "filesystem(", 11) && strlen(dep) < sizeof(buf))
473 strcpy(buf, dep + 11);
474 if ((p = strrchr(buf, ')')) != 0)
476 id = str2id(pool, buf, 1);
477 id = rel2id(pool, NAMESPACE_FILESYSTEM, id, REL_NAMESPACE, 1);
478 repo->idarraydata[i] = id;
482 if (freshens && repo->idarraydata[freshens])
484 Id idsupp = 0, idfresh = 0;
487 for (i = supplements; repo->idarraydata[i]; i++)
490 idsupp = repo->idarraydata[i];
492 idsupp = rel2id(pool, idsupp, repo->idarraydata[i], REL_OR, 1);
494 for (i = freshens; repo->idarraydata[i]; i++)
497 idfresh = repo->idarraydata[i];
499 idfresh = rel2id(pool, idfresh, repo->idarraydata[i], REL_OR, 1);
504 idsupp = rel2id(pool, idsupp, idfresh, REL_AND, 1);
505 supplements = repo_addid_dep(repo, 0, idsupp, 0);
519 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
524 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
526 struct matchdata *md = cbdata;
527 int flags = md->flags;
529 if ((flags & SEARCH_STRINGMASK) != 0)
533 case REPOKEY_TYPE_ID:
534 case REPOKEY_TYPE_IDARRAY:
535 if (data && data->localpool)
536 kv->str = stringpool_id2str(&data->spool, kv->id);
538 kv->str = id2str(s->repo->pool, kv->id);
540 case REPOKEY_TYPE_STR:
545 switch ((flags & SEARCH_STRINGMASK))
547 case SEARCH_SUBSTRING:
548 if (flags & SEARCH_NOCASE)
550 if (!strcasestr(kv->str, md->match))
555 if (!strstr(kv->str, md->match))
560 if (flags & SEARCH_NOCASE)
562 if (strcasecmp(md->match, kv->str))
567 if (strcmp(md->match, kv->str))
572 if (fnmatch(md->match, kv->str, (flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0))
577 if (regexec(&md->regexp, kv->str, 0, NULL, 0))
584 md->stop = md->callback(md->callback_data, s, data, key, kv);
589 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
590 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
591 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
592 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
593 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
594 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
595 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
596 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
597 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
598 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
599 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
600 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
601 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
602 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
606 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
609 for (; *ida && !md->stop; ida++)
612 kv.eof = ida[1] ? 0 : 1;
613 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
618 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
621 Pool *pool = repo->pool;
629 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
632 repo_search_md(repo, p, keyname, md);
633 if (md->stop > SEARCH_NEXT_SOLVABLE)
639 /* The callback only supports solvables, so we can't iterate over the
643 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
645 s = pool->solvables + p;
653 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
655 if (keyname || md->stop > SEARCH_NEXT_KEY)
661 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
663 if (keyname || md->stop > SEARCH_NEXT_KEY)
669 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
671 if (keyname || md->stop > SEARCH_NEXT_KEY)
673 case SOLVABLE_VENDOR:
677 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
679 if (keyname || md->stop > SEARCH_NEXT_KEY)
681 case SOLVABLE_PROVIDES:
683 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
684 if (keyname || md->stop > SEARCH_NEXT_KEY)
686 case SOLVABLE_OBSOLETES:
688 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
689 if (keyname || md->stop > SEARCH_NEXT_KEY)
691 case SOLVABLE_CONFLICTS:
693 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
694 if (keyname || md->stop > SEARCH_NEXT_KEY)
696 case SOLVABLE_REQUIRES:
698 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
699 if (keyname || md->stop > SEARCH_NEXT_KEY)
701 case SOLVABLE_RECOMMENDS:
703 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
704 if (keyname || md->stop > SEARCH_NEXT_KEY)
706 case SOLVABLE_SUPPLEMENTS:
708 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
709 if (keyname || md->stop > SEARCH_NEXT_KEY)
711 case SOLVABLE_SUGGESTS:
713 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
714 if (keyname || md->stop > SEARCH_NEXT_KEY)
716 case SOLVABLE_ENHANCES:
718 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
719 if (keyname || md->stop > SEARCH_NEXT_KEY)
724 kv.num = repo->rpmdbid[p - repo->start];
725 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
727 if (keyname || md->stop > SEARCH_NEXT_KEY)
735 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
737 if (p < data->start || p >= data->end)
739 if (data->state == REPODATA_STUB)
743 for (j = 1; j < data->nkeys; j++)
744 if (keyname == data->keys[j].name)
746 if (j == data->nkeys)
750 if (data->loadcallback)
751 data->loadcallback(data);
753 data->state = REPODATA_ERROR;
755 if (data->state == REPODATA_ERROR)
757 repodata_search(data, p - data->start, keyname, repo_matchvalue, md);
758 if (md->stop > SEARCH_NEXT_KEY)
764 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)
768 memset(&md, 0, sizeof(md));
769 md.pool = repo->pool;
772 md.callback = callback;
773 md.callback_data = cbdata;
774 repo_search_md(repo, p, keyname, &md);
778 repo_lookup_str(Solvable *s, Id key)
780 Repo *repo = s->repo;
781 Pool *pool = repo->pool;
788 return id2str(pool, s->name);
790 return id2str(pool, s->arch);
792 return id2str(pool, s->evr);
793 case SOLVABLE_VENDOR:
794 return id2str(pool, s->vendor);
796 n = s - pool->solvables;
797 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
799 if (n < data->start || n >= data->end)
801 for (j = 1; j < data->nkeys; j++)
803 if (data->keys[j].name == key && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID || data->keys[j].type == REPOKEY_TYPE_STR))
804 return repodata_lookup_str(data, n - data->start, j);
812 repo_lookup_num(Solvable *s, Id key)
814 Repo *repo = s->repo;
815 Pool *pool = repo->pool;
819 if (key == RPM_RPMDBID)
822 return repo->rpmdbid[(s - pool->solvables) - repo->start];
825 n = s - pool->solvables;
826 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
828 if (n < data->start || n >= data->end)
830 for (j = 1; j < data->nkeys; j++)
832 if (data->keys[j].name == key
833 && (data->keys[j].type == REPOKEY_TYPE_U32
834 || data->keys[j].type == REPOKEY_TYPE_NUM
835 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
838 if (repodata_lookup_num(data, n - data->start, j, &value))
848 * generic attribute lookup
849 * returns non-zero if found
851 * (XXX: return value is broken atm!)
855 repo_lookup(Solvable *s, Id key, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
857 Repo *repo = s->repo;
858 Pool *pool = repo->pool;
862 s_id = s - pool->solvables;
863 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
865 if (s_id < data->start || s_id >= data->end)
867 repodata_search(data, s_id - data->start, key, callback, cbdata);
874 /***********************************************************************/
877 repo_add_repodata(Repo *repo, int localpool)
882 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
883 data = repo->repodata + repo->nrepodata - 1;
884 repodata_init(data, repo, localpool);
889 repo_findrepodata(Repo *repo, Id p, Id keyname)
894 /* FIXME: enter nice code here */
895 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
896 if ((p < 0 && (-1 - p) >= data->extrastart && (-1 - p) < (data->extrastart + data->nextra))
897 || (p >= 0 && p >= data->start && p < data->end))
901 data = repo->repodata;
904 for (i = 1; i < repo->nrepodata; i++)
905 if (data->extrastart + data->nextra
906 > repo->repodata[i].extrastart + repo->repodata[i].nextra)
907 data = repo->repodata + i;
910 data = repo_add_repodata(repo, 0);
911 repodata_extend_extra(data, (-1 - p) - data->extrastart + 1);
912 if (-p > repo->nextra)
916 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
919 if (i < repo->nrepodata)
921 repodata_extend(data, p);
924 return repo_add_repodata(repo, 0);
928 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
930 Repodata *data = repo_findrepodata(repo, p, keyname);
932 /* This is -1 - ((-1 - p) - data->extrastart). */
933 p = p + data->extrastart;
936 repodata_set_id(data, repodata_get_handle(data, p), keyname, id);
940 repo_set_num(Repo *repo, Id p, Id keyname, Id num)
942 Repodata *data = repo_findrepodata(repo, p, keyname);
944 p = p + data->extrastart;
947 repodata_set_num(data, repodata_get_handle(data, p), keyname, num);
951 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
953 Repodata *data = repo_findrepodata(repo, p, keyname);
955 p = p + data->extrastart;
958 repodata_set_str(data, repodata_get_handle(data, p), keyname, str);
962 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
964 Repodata *data = repo_findrepodata(repo, p, keyname);
966 p = p + data->extrastart;
969 repodata_set_poolstr(data, repodata_get_handle(data, p), keyname, str);
973 repo_internalize(Repo *repo)
978 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
979 if (data->attrs || data->extraattrs)
980 repodata_internalize(data);
984 repo_disable_paging(Repo *repo)
989 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
990 repodata_disable_paging(data);
994 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: