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)
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 (i > 1 && p[i - 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;
484 int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv);
489 repo_matchvalue(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
491 struct matchdata *md = cbdata;
492 int flags = md->flags;
494 if ((flags & SEARCH_STRINGMASK) != 0)
498 case REPOKEY_TYPE_ID:
499 case REPOKEY_TYPE_IDARRAY:
500 if (data && data->localpool)
501 kv->str = stringpool_id2str(&data->spool, kv->id);
503 kv->str = id2str(s->repo->pool, kv->id);
505 case REPOKEY_TYPE_STR:
510 switch ((flags & SEARCH_STRINGMASK))
512 case SEARCH_SUBSTRING:
513 if (flags & SEARCH_NOCASE)
515 if (!strcasestr(kv->str, md->match))
520 if (!strstr(kv->str, md->match))
525 if (flags & SEARCH_NOCASE)
527 if (strcasecmp(md->match, kv->str))
532 if (strcmp(md->match, kv->str))
537 if (fnmatch(md->match, kv->str, (flags & SEARCH_NOCASE) ? FNM_CASEFOLD : 0))
542 if (regexec(&md->regexp, kv->str, 0, NULL, 0))
549 md->stop = md->callback(md->callback_data, s, data, key, kv);
554 static Repokey solvablekeys[RPM_RPMDBID - SOLVABLE_NAME + 1] = {
555 { SOLVABLE_NAME, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
556 { SOLVABLE_ARCH, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
557 { SOLVABLE_EVR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
558 { SOLVABLE_VENDOR, REPOKEY_TYPE_ID, 0, KEY_STORAGE_SOLVABLE },
559 { SOLVABLE_PROVIDES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
560 { SOLVABLE_OBSOLETES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
561 { SOLVABLE_CONFLICTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
562 { SOLVABLE_REQUIRES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
563 { SOLVABLE_RECOMMENDS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
564 { SOLVABLE_SUGGESTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
565 { SOLVABLE_SUPPLEMENTS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
566 { SOLVABLE_ENHANCES, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
567 { SOLVABLE_FRESHENS, REPOKEY_TYPE_IDARRAY, 0, KEY_STORAGE_SOLVABLE },
568 { RPM_RPMDBID, REPOKEY_TYPE_U32, 0, KEY_STORAGE_SOLVABLE },
572 domatch_idarray(Solvable *s, Id keyname, struct matchdata *md, Id *ida)
575 for (; *ida && !md->stop; ida++)
578 kv.eof = ida[1] ? 0 : 1;
579 repo_matchvalue(md, s, 0, solvablekeys + (keyname - SOLVABLE_NAME), &kv);
584 repo_search_md(Repo *repo, Id p, Id keyname, struct matchdata *md)
587 Pool *pool = repo->pool;
595 for (p = repo->start, s = repo->pool->solvables + p; p < repo->end; p++, s++)
598 repo_search_md(repo, p, keyname, md);
599 if (md->stop > SEARCH_NEXT_SOLVABLE)
604 s = pool->solvables + p;
606 if (!(flags & SEARCH_NO_STORAGE_SOLVABLE))
615 repo_matchvalue(md, s, 0, solvablekeys + 0, &kv);
617 if (keyname || md->stop > SEARCH_NEXT_KEY)
623 repo_matchvalue(md, s, 0, solvablekeys + 1, &kv);
625 if (keyname || md->stop > SEARCH_NEXT_KEY)
631 repo_matchvalue(md, s, 0, solvablekeys + 2, &kv);
633 if (keyname || md->stop > SEARCH_NEXT_KEY)
635 case SOLVABLE_VENDOR:
639 repo_matchvalue(md, s, 0, solvablekeys + 3, &kv);
641 if (keyname || md->stop > SEARCH_NEXT_KEY)
643 case SOLVABLE_PROVIDES:
645 domatch_idarray(s, SOLVABLE_PROVIDES, md, repo->idarraydata + s->provides);
646 if (keyname || md->stop > SEARCH_NEXT_KEY)
648 case SOLVABLE_OBSOLETES:
650 domatch_idarray(s, SOLVABLE_OBSOLETES, md, repo->idarraydata + s->obsoletes);
651 if (keyname || md->stop > SEARCH_NEXT_KEY)
653 case SOLVABLE_CONFLICTS:
655 domatch_idarray(s, SOLVABLE_CONFLICTS, md, repo->idarraydata + s->conflicts);
656 if (keyname || md->stop > SEARCH_NEXT_KEY)
658 case SOLVABLE_REQUIRES:
660 domatch_idarray(s, SOLVABLE_REQUIRES, md, repo->idarraydata + s->requires);
661 if (keyname || md->stop > SEARCH_NEXT_KEY)
663 case SOLVABLE_RECOMMENDS:
665 domatch_idarray(s, SOLVABLE_RECOMMENDS, md, repo->idarraydata + s->recommends);
666 if (keyname || md->stop > SEARCH_NEXT_KEY)
668 case SOLVABLE_SUPPLEMENTS:
670 domatch_idarray(s, SOLVABLE_SUPPLEMENTS, md, repo->idarraydata + s->supplements);
671 if (keyname || md->stop > SEARCH_NEXT_KEY)
673 case SOLVABLE_SUGGESTS:
675 domatch_idarray(s, SOLVABLE_SUGGESTS, md, repo->idarraydata + s->suggests);
676 if (keyname || md->stop > SEARCH_NEXT_KEY)
678 case SOLVABLE_ENHANCES:
680 domatch_idarray(s, SOLVABLE_ENHANCES, md, repo->idarraydata + s->enhances);
681 if (keyname || md->stop > SEARCH_NEXT_KEY)
683 case SOLVABLE_FRESHENS:
685 domatch_idarray(s, SOLVABLE_FRESHENS, md, repo->idarraydata + s->freshens);
686 if (keyname || md->stop > SEARCH_NEXT_KEY)
691 kv.num = repo->rpmdbid[p - repo->start];
692 repo_matchvalue(md, s, 0, solvablekeys + (RPM_RPMDBID - SOLVABLE_NAME), &kv);
694 if (keyname || md->stop > SEARCH_NEXT_KEY)
702 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
704 if (p < data->start || p >= data->end)
706 if (data->state == REPODATA_STUB)
710 for (j = 1; j < data->nkeys; j++)
711 if (keyname == data->keys[j].name)
713 if (j == data->nkeys)
717 if (data->loadcallback)
718 data->loadcallback(data);
720 data->state = REPODATA_ERROR;
722 if (data->state == REPODATA_ERROR)
724 repodata_search(data, p - data->start, keyname, repo_matchvalue, md);
725 if (md->stop > SEARCH_NEXT_KEY)
731 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)
735 memset(&md, 0, sizeof(md));
736 md.pool = repo->pool;
739 md.callback = callback;
740 md.callback_data = cbdata;
741 repo_search_md(repo, p, keyname, &md);
745 repo_lookup_str(Solvable *s, Id key)
747 Repo *repo = s->repo;
748 Pool *pool = repo->pool;
755 return id2str(pool, s->name);
757 return id2str(pool, s->arch);
759 return id2str(pool, s->evr);
760 case SOLVABLE_VENDOR:
761 return id2str(pool, s->vendor);
763 n = s - pool->solvables;
764 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
766 if (n < data->start || n >= data->end)
768 for (j = 1; j < data->nkeys; j++)
770 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))
771 return repodata_lookup_str(data, n - data->start, j);
778 repo_lookup_num(Solvable *s, Id key)
780 Repo *repo = s->repo;
781 Pool *pool = repo->pool;
785 if (key == RPM_RPMDBID)
788 return repo->rpmdbid[(s - pool->solvables) - repo->start];
791 n = s - pool->solvables;
792 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
794 if (n < data->start || n >= data->end)
796 for (j = 1; j < data->nkeys; j++)
798 if (data->keys[j].name == key
799 && (data->keys[j].type == REPOKEY_TYPE_U32
800 || data->keys[j].type == REPOKEY_TYPE_NUM
801 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
804 if (repodata_lookup_num(data, n - data->start, j, &value))
814 * generic attribute lookup
815 * returns non-zero if found
817 * (XXX: return value is broken atm!)
821 repo_lookup(Solvable *s, Id key, int (*callback)(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv), void *cbdata)
823 Repo *repo = s->repo;
824 Pool *pool = repo->pool;
828 s_id = s - pool->solvables;
829 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
831 if (s_id < data->start || s_id >= data->end)
833 repodata_search(data, s_id - data->start, key, callback, cbdata);
840 /***********************************************************************/
843 repo_add_repodata(Repo *repo)
848 repo->repodata = sat_realloc2(repo->repodata, repo->nrepodata, sizeof(*data));
849 data = repo->repodata + repo->nrepodata - 1;
850 repodata_init(data, repo, 0);
855 findrepodata(Repo *repo, Id p, Id keyname)
860 /* FIXME: enter nice code here */
861 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
862 if (p >= data->start && p < data->end)
864 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
867 if (i < repo->nrepodata)
869 repodata_extend(data, p);
872 return repo_add_repodata(repo);
876 repo_set_id(Repo *repo, Id p, Id keyname, Id id)
878 Repodata *data = findrepodata(repo, p, keyname);
879 repodata_set_id(data, p - data->start, keyname, id);
883 repo_set_num(Repo *repo, Id p, Id keyname, Id num)
885 Repodata *data = findrepodata(repo, p, keyname);
886 repodata_set_num(data, p - data->start, keyname, num);
890 repo_set_str(Repo *repo, Id p, Id keyname, const char *str)
892 Repodata *data = findrepodata(repo, p, keyname);
893 repodata_set_str(data, p - data->start, keyname, str);
897 repo_set_poolstr(Repo *repo, Id p, Id keyname, const char *str)
899 Repodata *data = findrepodata(repo, p, keyname);
900 repodata_set_poolstr(data, p - data->start, keyname, str);
904 repo_internalize(Repo *repo)
909 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
911 repodata_internalize(data);
916 vim:cinoptions={.5s,g0,p5,t0,(0,^-0.5s,n-0.5s:tw=78:cindent:sw=4: