2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * The pool contains information about solvables
12 * stored optimized for memory consumption and fast retrieval.
24 #include "poolid_private.h"
30 #define SOLVABLE_BLOCK 255
33 * list of string constants, so we can do pointer/Id instead of string comparison
34 * index into array matches ID_xxx constants in pool.h
37 static const char *initpool_data[] = {
48 "solvable:recommends",
50 "solvable:supplements",
53 "rpm:dbid", /* direct key into rpmdb */
54 "solvable:prereqmarker",
55 "solvable:filemarker",
56 "namespace:installed",
58 "namespace:splitprovides",
68 "repokey:type:constant",
69 "repokey:type:constantid",
75 "repokey:type:idarray",
76 "repokey:type:relidarray",
77 "repokey:type:dirstrarray",
78 "repokey:type:dirnumnumarray",
81 "solvable:description",
89 "solvable:messageins",
90 "solvable:messagedel",
92 "solvable:installsize",
96 "solvable:installtime",
101 "solvable:downloadsize",
103 "solvable:sourcearch",
104 "solvable:sourcename",
105 "solvable:sourceevr",
107 "solvable:isvisible", /* from susetags */
109 "solvable:patchcategory",
121 pool = (Pool *)sat_calloc(1, sizeof(*pool));
123 stringpool_init (&pool->ss, initpool_data);
125 /* alloc space for ReDep 0 */
126 pool->rels = sat_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
128 memset(pool->rels, 0, sizeof(Reldep));
130 /* alloc space for Solvable 0 and system solvable */
131 pool->solvables = sat_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
132 pool->nsolvables = 2;
133 memset(pool->solvables, 0, 2 * sizeof(Solvable));
134 s = pool->solvables + SYSTEMSOLVABLE;
135 s->name = SYSTEM_SYSTEM;
136 s->arch = ARCH_NOARCH;
139 queue_init(&pool->vendormap);
141 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
146 /* free all the resources of our pool */
148 pool_free(Pool *pool)
152 pool_freewhatprovides(pool);
153 pool_freeidhashes(pool);
154 repo_freeallrepos(pool, 1);
155 sat_free(pool->id2arch);
156 sat_free(pool->solvables);
157 sat_free(pool->ss.stringspace);
158 sat_free(pool->ss.strings);
159 sat_free(pool->rels);
160 queue_free(&pool->vendormap);
161 for (i = 0; i < DEP2STRBUF; i++)
162 sat_free(pool->dep2strbuf[i]);
163 for (i = 0; i < pool->nlanguages; i++)
164 free((char *)pool->languages[i]);
165 sat_free(pool->languages);
166 sat_free(pool->languagecache);
171 pool_add_solvable(Pool *pool)
173 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
174 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
175 return pool->nsolvables++;
179 pool_add_solvable_block(Pool *pool, int count)
181 Id nsolvables = pool->nsolvables;
184 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
185 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
186 pool->nsolvables += count;
191 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
195 if (reuseids && start + count == pool->nsolvables)
197 /* might want to shrink solvable array */
198 pool->nsolvables = start;
201 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
206 solvable2str(Pool *pool, Solvable *s)
208 int l, nn = pool->dep2strn;
209 const char *n, *e, *a;
210 n = id2str(pool, s->name);
211 e = id2str(pool, s->evr);
212 a = id2str(pool, s->arch);
213 l = strlen(n) + strlen(e) + strlen(a) + 3;
214 if (l > pool->dep2strlen[nn])
216 pool->dep2strbuf[nn] = sat_realloc(pool->dep2strbuf[nn], l + 32);
217 pool->dep2strlen[nn] = l + 32;
219 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
220 pool->dep2strn = (nn + 1) % DEP2STRBUF;
221 return pool->dep2strbuf[nn];
224 static Pool *pool_shrink_whatprovides_sortcmp_data;
227 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
230 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
232 oa = pool->whatprovides[*(Id *)ap];
233 ob = pool->whatprovides[*(Id *)bp];
235 return *(Id *)ap - *(Id *)bp;
240 da = pool->whatprovidesdata + oa;
241 db = pool->whatprovidesdata + ob;
243 if ((r = (*da++ - *db++)) != 0)
247 return *(Id *)ap - *(Id *)bp;
251 * pool_shrink_whatprovides - unify whatprovides data
253 * whatprovides_rel must be empty for this to work!
257 pool_shrink_whatprovides(Pool *pool)
261 Id lastid, *last, *dp, *lp;
265 if (pool->ss.nstrings < 3)
267 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
268 for (id = 0; id < pool->ss.nstrings; id++)
270 pool_shrink_whatprovides_sortcmp_data = pool;
271 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
274 for (i = 1; i < pool->ss.nstrings; i++)
277 o = pool->whatprovides[id];
278 if (o == 0 || o == 1)
280 dp = pool->whatprovidesdata + o;
294 pool->whatprovides[id] = -lastid;
298 last = pool->whatprovidesdata + o;
302 dp = pool->whatprovidesdata + 2;
303 for (id = 1; id < pool->ss.nstrings; id++)
305 o = pool->whatprovides[id];
306 if (o == 0 || o == 1)
313 pool->whatprovides[id] = pool->whatprovides[i];
316 lp = pool->whatprovidesdata + o;
319 pool->whatprovides[id] = dp - pool->whatprovidesdata;
320 while ((*dp++ = *lp++) != 0)
323 o = dp - pool->whatprovidesdata;
324 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
325 if (pool->whatprovidesdataoff == o)
327 r = pool->whatprovidesdataoff - o;
328 pool->whatprovidesdataoff = o;
329 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
330 if (r > pool->whatprovidesdataleft)
331 r = pool->whatprovidesdataleft;
332 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
337 * pool_createwhatprovides()
339 * create hashes over pool of solvables to ease provide lookups
343 pool_createwhatprovides(Pool *pool)
345 int i, num, np, extra;
350 Offset *whatprovides;
351 Id *whatprovidesdata, *d;
353 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
354 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
356 pool_freeidhashes(pool); /* XXX: should not be here! */
357 pool_freewhatprovides(pool);
358 num = pool->ss.nstrings;
359 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
360 memset(whatprovides, 0, num * sizeof(Offset));
361 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
362 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
364 /* count providers for each name */
365 for (i = 1; i < pool->nsolvables; i++)
368 s = pool->solvables + i;
371 if (!pool_installable(pool, s))
373 pp = s->repo->idarraydata + s->provides;
374 while ((id = *pp++) != ID_NULL)
378 Reldep *rd = GETRELDEP(pool, id);
381 whatprovides[id]++; /* inc count of providers */
385 off = 2; /* first entry is undef, second is empty list */
387 np = 0; /* number of names provided */
388 for (i = 0; i < num; i++, idp++)
391 if (!n) /* no providers */
393 *idp = off; /* move from counts to offsets into whatprovidesdata */
394 off += n + 1; /* make space for all providers + terminating ID_NULL */
395 np++; /* inc # of provider 'slots' */
398 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
400 /* reserve some space for relation data */
401 extra = 2 * pool->nrels;
405 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
407 /* alloc space for all providers + extra */
408 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
410 /* now fill data for all provides */
411 for (i = 1; i < pool->nsolvables; i++)
414 s = pool->solvables + i;
417 if (!pool_installable(pool, s))
420 /* for all provides of this solvable */
421 pp = s->repo->idarraydata + s->provides;
422 while ((id = *pp++) != 0)
426 Reldep *rd = GETRELDEP(pool, id);
429 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
433 while (*d) /* find free slot */
438 *d = i; /* put solvable Id into data */
441 pool->whatprovidesdata = whatprovidesdata;
442 pool->whatprovidesdataoff = off;
443 pool->whatprovidesdataleft = extra;
444 pool_shrink_whatprovides(pool);
448 * free all of our whatprovides data
449 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
452 pool_freewhatprovides(Pool *pool)
454 pool->whatprovides = sat_free(pool->whatprovides);
455 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
456 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
457 pool->whatprovidesdataoff = 0;
458 pool->whatprovidesdataleft = 0;
462 /******************************************************************************/
465 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
467 * on-demand filling of provider information
468 * move queue data into whatprovidesdata
470 * returns: Offset into whatprovides
474 pool_queuetowhatprovides(Pool *pool, Queue *q)
477 int count = q->count;
479 if (count == 0) /* queue empty -> ID_EMPTY */
482 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
483 if (pool->whatprovidesdataleft < count + 1)
485 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
486 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
487 pool->whatprovidesdataleft = count + 4096;
490 /* copy queue to next free slot */
491 off = pool->whatprovidesdataoff;
492 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
494 /* adapt count and ID_NULL-terminate */
495 pool->whatprovidesdataoff += count;
496 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
497 pool->whatprovidesdataleft -= count + 1;
503 /*************************************************************************/
508 * add packages fulfilling the relation to whatprovides array
509 * no exact providers, do range match
514 pool_addrelproviders(Pool *pool, Id d)
516 Reldep *rd = GETRELDEP(pool, d);
522 int flags = rd->flags;
524 Id p, *pp, *pp2, *pp3;
527 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
532 pp = pool_whatprovides(pool, name);
533 pp2 = pool_whatprovides(pool, evr);
534 while ((p = *pp++) != 0)
536 for (pp3 = pp2; *pp3;)
539 queue_push(&plist, p);
545 pp = pool_whatprovides(pool, name);
546 while ((p = *pp++) != 0)
547 queue_push(&plist, p);
548 pp = pool_whatprovides(pool, evr);
549 while ((p = *pp++) != 0)
550 queue_pushunique(&plist, p);
553 if (pool->nscallback)
555 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
559 pool->whatprovides_rel[d] = p;
560 return pool->whatprovidesdata + p;
563 queue_push(&plist, SYSTEMSOLVABLE);
570 /* convert to whatprovides id */
572 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
574 if (flags && flags < 8)
576 FOR_PROVIDES(p, pp, name)
579 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
581 /* solvable p provides name in some rels */
582 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
583 while ((pid = *pidp++) != 0)
590 #ifdef DEBIAN_SEMANTICS
591 continue; /* unversioned provides can
592 * never match versioned deps */
594 break; /* yes, provides all versions */
598 continue; /* wrong provides name */
599 prd = GETRELDEP(pool, pid);
600 if (prd->name != name)
601 continue; /* wrong provides name */
602 /* right package, both deps are rels */
606 if (flags == 7 || pflags == 7)
607 break; /* included */
608 if ((pflags & flags & 5) != 0)
609 break; /* same direction, match */
613 if ((pflags & flags & 2) != 0)
614 break; /* both have =, match */
618 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
619 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
624 continue; /* no rel match */
625 queue_push(&plist, p);
627 /* make our system solvable provide all unknown rpmlib() stuff */
628 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
629 queue_push(&plist, SYSTEMSOLVABLE);
631 /* add providers to whatprovides */
633 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
635 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
638 return pool->whatprovidesdata + pool->whatprovides_rel[d];
641 /*************************************************************************/
644 pool_debug(Pool *pool, int type, const char *format, ...)
649 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
651 if ((pool->debugmask & type) == 0)
654 va_start(args, format);
655 if (!pool->debugcallback)
657 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
658 vprintf(format, args);
660 vfprintf(stderr, format, args);
663 vsnprintf(buf, sizeof(buf), format, args);
664 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
668 pool_setdebuglevel(Pool *pool, int level)
670 int mask = SAT_DEBUG_RESULT;
672 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
674 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
676 mask |= SAT_DEBUG_PROPAGATE;
678 mask |= SAT_DEBUG_RULE_CREATION;
680 mask |= SAT_DEBUG_SCHUBI;
681 pool->debugmask = mask;
684 /*************************************************************************/
694 #define SEARCHFILES_BLOCK 127
697 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
702 while ((dep = *ida++) != 0)
704 while (ISRELDEP(dep))
707 sid = pool->ss.nstrings + GETRELID(dep);
708 if (MAPTST(&sf->seen, sid))
713 MAPSET(&sf->seen, sid);
714 rd = GETRELDEP(pool, dep);
717 else if (rd->flags == REL_NAMESPACE)
719 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
723 if (MAPTST(&sf->seen, sid))
728 MAPSET(&sf->seen, sid);
737 pool_addfileprovides_dep(pool, ids, sf, isf);
743 if (MAPTST(&sf->seen, dep))
745 MAPSET(&sf->seen, dep);
746 s = id2str(pool, dep);
749 sf->ids = sat_extend(sf->ids, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
750 sf->dirs = sat_extend(sf->dirs, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
751 sf->names = sat_extend(sf->names, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
752 sf->ids[sf->nfiles] = dep;
753 sr = strrchr(s, '/');
754 sf->names[sf->nfiles] = strdup(sr + 1);
755 sf->dirs[sf->nfiles] = sat_malloc(sr - s + 1);
757 strncpy(sf->dirs[sf->nfiles], s, sr - s);
758 sf->dirs[sf->nfiles][sr - s] = 0;
763 struct addfileprovides_cbdata {
775 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
777 struct addfileprovides_cbdata *cbd = cbdata;
780 if (data != cbd->olddata)
782 map_free(&cbd->useddirs);
783 map_init(&cbd->useddirs, data->dirpool.ndirs);
784 for (i = 0; i < cbd->nfiles; i++)
786 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
789 MAPSET(&cbd->useddirs, did);
793 if (!MAPTST(&cbd->useddirs, value->id))
795 for (i = 0; i < cbd->nfiles; i++)
797 if (cbd->dids[i] != value->id)
799 if (!strcmp(cbd->names[i], value->str))
802 if (i == cbd->nfiles)
804 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
809 pool_addfileprovides(Pool *pool, Repo *installed)
813 struct searchfiles sf, isf;
814 struct addfileprovides_cbdata cbd;
817 memset(&sf, 0, sizeof(sf));
818 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
819 memset(&isf, 0, sizeof(isf));
820 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
822 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
828 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
830 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
832 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
834 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
836 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
838 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
840 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
842 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
846 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
847 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
849 map_init(&cbd.useddirs, 1);
853 for (i = 0; i < sf.nfiles; i++)
854 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
856 cbd.nfiles = sf.nfiles;
859 cbd.names = sf.names;
861 cbd.dids = sat_realloc2(cbd.dids, sf.nfiles, sizeof(Id));
862 pool_search(pool, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
864 for (i = 0; i < sf.nfiles; i++)
866 sat_free(sf.dirs[i]);
867 sat_free(sf.names[i]);
872 if (isf.nfiles && installed)
875 for (i = 0; i < isf.nfiles; i++)
876 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
878 cbd.nfiles = isf.nfiles;
881 cbd.names = isf.names;
883 cbd.dids = sat_realloc2(cbd.dids, isf.nfiles, sizeof(Id));
884 repo_search(installed, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
886 for (i = 0; i < isf.nfiles; i++)
888 sat_free(isf.dirs[i]);
889 sat_free(isf.names[i]);
894 map_free(&cbd.useddirs);
896 pool_freewhatprovides(pool); /* as we have added provides */
900 pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata)
904 if (pool->solvables[p].repo)
905 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
908 /* FIXME: obey callback return value! */
909 for (p = 1; p < pool->nsolvables; p++)
910 if (pool->solvables[p].repo)
911 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
916 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
920 pool->languagecache = sat_free(pool->languagecache);
921 pool->languagecacheother = 0;
922 if (pool->nlanguages)
924 for (i = 0; i < pool->nlanguages; i++)
925 free((char *)pool->languages[i]);
926 free(pool->languages);
928 pool->nlanguages = nlanguages;
931 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
932 for (i = 0; i < pool->nlanguages; i++)
933 pool->languages[i] = strdup(languages[i]);