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",
60 "namespace:filesystem",
69 "repokey:type:constant",
70 "repokey:type:constantid",
76 "repokey:type:idarray",
77 "repokey:type:relidarray",
78 "repokey:type:dirstrarray",
79 "repokey:type:dirnumnumarray",
82 "solvable:description",
90 "solvable:messageins",
91 "solvable:messagedel",
93 "solvable:installsize",
97 "solvable:installtime",
100 "solvable:mediafile",
102 "solvable:downloadsize",
104 "solvable:sourcearch",
105 "solvable:sourcename",
106 "solvable:sourceevr",
108 "solvable:isvisible", /* from susetags */
110 "solvable:patchcategory",
122 pool = (Pool *)sat_calloc(1, sizeof(*pool));
124 stringpool_init (&pool->ss, initpool_data);
126 /* alloc space for ReDep 0 */
127 pool->rels = sat_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
129 memset(pool->rels, 0, sizeof(Reldep));
131 /* alloc space for Solvable 0 and system solvable */
132 pool->solvables = sat_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
133 pool->nsolvables = 2;
134 memset(pool->solvables, 0, 2 * sizeof(Solvable));
135 s = pool->solvables + SYSTEMSOLVABLE;
136 s->name = SYSTEM_SYSTEM;
137 s->arch = ARCH_NOARCH;
140 queue_init(&pool->vendormap);
142 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
147 /* free all the resources of our pool */
149 pool_free(Pool *pool)
153 pool_freewhatprovides(pool);
154 pool_freeidhashes(pool);
155 repo_freeallrepos(pool, 1);
156 sat_free(pool->id2arch);
157 sat_free(pool->solvables);
158 sat_free(pool->ss.stringspace);
159 sat_free(pool->ss.strings);
160 sat_free(pool->rels);
161 queue_free(&pool->vendormap);
162 for (i = 0; i < POOL_TMPSPACEBUF; i++)
163 sat_free(pool->tmpspacebuf[i]);
164 for (i = 0; i < pool->nlanguages; i++)
165 free((char *)pool->languages[i]);
166 sat_free(pool->languages);
167 sat_free(pool->languagecache);
172 pool_add_solvable(Pool *pool)
174 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
175 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
176 return pool->nsolvables++;
180 pool_add_solvable_block(Pool *pool, int count)
182 Id nsolvables = pool->nsolvables;
185 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
186 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
187 pool->nsolvables += count;
192 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
196 if (reuseids && start + count == pool->nsolvables)
198 /* might want to shrink solvable array */
199 pool->nsolvables = start;
202 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
206 static Pool *pool_shrink_whatprovides_sortcmp_data;
209 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
212 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
214 oa = pool->whatprovides[*(Id *)ap];
215 ob = pool->whatprovides[*(Id *)bp];
217 return *(Id *)ap - *(Id *)bp;
222 da = pool->whatprovidesdata + oa;
223 db = pool->whatprovidesdata + ob;
225 if ((r = (*da++ - *db++)) != 0)
229 return *(Id *)ap - *(Id *)bp;
233 * pool_shrink_whatprovides - unify whatprovides data
235 * whatprovides_rel must be empty for this to work!
239 pool_shrink_whatprovides(Pool *pool)
243 Id lastid, *last, *dp, *lp;
247 if (pool->ss.nstrings < 3)
249 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
250 for (id = 0; id < pool->ss.nstrings; id++)
252 pool_shrink_whatprovides_sortcmp_data = pool;
253 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
256 for (i = 1; i < pool->ss.nstrings; i++)
259 o = pool->whatprovides[id];
260 if (o == 0 || o == 1)
262 dp = pool->whatprovidesdata + o;
276 pool->whatprovides[id] = -lastid;
280 last = pool->whatprovidesdata + o;
284 dp = pool->whatprovidesdata + 2;
285 for (id = 1; id < pool->ss.nstrings; id++)
287 o = pool->whatprovides[id];
288 if (o == 0 || o == 1)
295 pool->whatprovides[id] = pool->whatprovides[i];
298 lp = pool->whatprovidesdata + o;
301 pool->whatprovides[id] = dp - pool->whatprovidesdata;
302 while ((*dp++ = *lp++) != 0)
305 o = dp - pool->whatprovidesdata;
306 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
307 if (pool->whatprovidesdataoff == o)
309 r = pool->whatprovidesdataoff - o;
310 pool->whatprovidesdataoff = o;
311 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
312 if (r > pool->whatprovidesdataleft)
313 r = pool->whatprovidesdataleft;
314 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
319 * pool_createwhatprovides()
321 * create hashes over pool of solvables to ease provide lookups
325 pool_createwhatprovides(Pool *pool)
327 int i, num, np, extra;
332 Offset *whatprovides;
333 Id *whatprovidesdata, *d;
335 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
336 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
338 pool_freeidhashes(pool); /* XXX: should not be here! */
339 pool_freewhatprovides(pool);
340 num = pool->ss.nstrings;
341 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
342 memset(whatprovides, 0, num * sizeof(Offset));
343 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
344 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
346 /* count providers for each name */
347 for (i = 1; i < pool->nsolvables; i++)
350 s = pool->solvables + i;
353 if (!pool_installable(pool, s))
355 pp = s->repo->idarraydata + s->provides;
356 while ((id = *pp++) != ID_NULL)
360 Reldep *rd = GETRELDEP(pool, id);
363 whatprovides[id]++; /* inc count of providers */
367 off = 2; /* first entry is undef, second is empty list */
369 np = 0; /* number of names provided */
370 for (i = 0; i < num; i++, idp++)
373 if (!n) /* no providers */
375 *idp = off; /* move from counts to offsets into whatprovidesdata */
376 off += n + 1; /* make space for all providers + terminating ID_NULL */
377 np++; /* inc # of provider 'slots' */
380 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
382 /* reserve some space for relation data */
383 extra = 2 * pool->nrels;
387 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
389 /* alloc space for all providers + extra */
390 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
392 /* now fill data for all provides */
393 for (i = 1; i < pool->nsolvables; i++)
396 s = pool->solvables + i;
399 if (!pool_installable(pool, s))
402 /* for all provides of this solvable */
403 pp = s->repo->idarraydata + s->provides;
404 while ((id = *pp++) != 0)
408 Reldep *rd = GETRELDEP(pool, id);
411 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
415 while (*d) /* find free slot */
420 *d = i; /* put solvable Id into data */
423 pool->whatprovidesdata = whatprovidesdata;
424 pool->whatprovidesdataoff = off;
425 pool->whatprovidesdataleft = extra;
426 pool_shrink_whatprovides(pool);
430 * free all of our whatprovides data
431 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
434 pool_freewhatprovides(Pool *pool)
436 pool->whatprovides = sat_free(pool->whatprovides);
437 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
438 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
439 pool->whatprovidesdataoff = 0;
440 pool->whatprovidesdataleft = 0;
444 /******************************************************************************/
447 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
449 * on-demand filling of provider information
450 * move queue data into whatprovidesdata
452 * returns: Offset into whatprovides
456 pool_queuetowhatprovides(Pool *pool, Queue *q)
459 int count = q->count;
461 if (count == 0) /* queue empty -> ID_EMPTY */
464 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
465 if (pool->whatprovidesdataleft < count + 1)
467 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
468 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
469 pool->whatprovidesdataleft = count + 4096;
472 /* copy queue to next free slot */
473 off = pool->whatprovidesdataoff;
474 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
476 /* adapt count and ID_NULL-terminate */
477 pool->whatprovidesdataoff += count;
478 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
479 pool->whatprovidesdataleft -= count + 1;
485 /*************************************************************************/
490 * add packages fulfilling the relation to whatprovides array
491 * no exact providers, do range match
496 pool_addrelproviders(Pool *pool, Id d)
498 Reldep *rd = GETRELDEP(pool, d);
504 int flags = rd->flags;
506 Id p, *pp, *pp2, *pp3;
509 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
514 pp = pool_whatprovides(pool, name);
515 pp2 = pool_whatprovides(pool, evr);
516 while ((p = *pp++) != 0)
518 for (pp3 = pp2; *pp3;)
521 queue_push(&plist, p);
527 pp = pool_whatprovides(pool, name);
528 while ((p = *pp++) != 0)
529 queue_push(&plist, p);
530 pp = pool_whatprovides(pool, evr);
531 while ((p = *pp++) != 0)
532 queue_pushunique(&plist, p);
535 if (pool->nscallback)
537 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
541 pool->whatprovides_rel[d] = p;
542 return pool->whatprovidesdata + p;
545 queue_push(&plist, SYSTEMSOLVABLE);
552 /* convert to whatprovides id */
554 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
556 if (flags && flags < 8)
558 FOR_PROVIDES(p, pp, name)
561 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
563 /* solvable p provides name in some rels */
564 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
565 while ((pid = *pidp++) != 0)
572 #ifdef DEBIAN_SEMANTICS
573 continue; /* unversioned provides can
574 * never match versioned deps */
576 break; /* yes, provides all versions */
580 continue; /* wrong provides name */
581 prd = GETRELDEP(pool, pid);
582 if (prd->name != name)
583 continue; /* wrong provides name */
584 /* right package, both deps are rels */
588 if (flags == 7 || pflags == 7)
589 break; /* included */
590 if ((pflags & flags & 5) != 0)
591 break; /* same direction, match */
595 if ((pflags & flags & 2) != 0)
596 break; /* both have =, match */
600 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
601 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
606 continue; /* no rel match */
607 queue_push(&plist, p);
609 /* make our system solvable provide all unknown rpmlib() stuff */
610 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
611 queue_push(&plist, SYSTEMSOLVABLE);
613 /* add providers to whatprovides */
615 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
617 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
620 return pool->whatprovidesdata + pool->whatprovides_rel[d];
623 /*************************************************************************/
626 pool_debug(Pool *pool, int type, const char *format, ...)
631 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
633 if ((pool->debugmask & type) == 0)
636 va_start(args, format);
637 if (!pool->debugcallback)
639 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
640 vprintf(format, args);
642 vfprintf(stderr, format, args);
645 vsnprintf(buf, sizeof(buf), format, args);
646 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
650 pool_setdebuglevel(Pool *pool, int level)
652 int mask = SAT_DEBUG_RESULT;
654 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
656 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
658 mask |= SAT_DEBUG_PROPAGATE;
660 mask |= SAT_DEBUG_RULE_CREATION;
662 mask |= SAT_DEBUG_SCHUBI;
663 pool->debugmask = mask;
666 /*************************************************************************/
676 #define SEARCHFILES_BLOCK 127
679 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
684 while ((dep = *ida++) != 0)
686 while (ISRELDEP(dep))
689 sid = pool->ss.nstrings + GETRELID(dep);
690 if (MAPTST(&sf->seen, sid))
695 MAPSET(&sf->seen, sid);
696 rd = GETRELDEP(pool, dep);
699 else if (rd->flags == REL_NAMESPACE)
701 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
705 if (MAPTST(&sf->seen, sid))
710 MAPSET(&sf->seen, sid);
719 pool_addfileprovides_dep(pool, ids, sf, isf);
725 if (MAPTST(&sf->seen, dep))
727 MAPSET(&sf->seen, dep);
728 s = id2str(pool, dep);
731 sf->ids = sat_extend(sf->ids, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
732 sf->dirs = sat_extend(sf->dirs, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
733 sf->names = sat_extend(sf->names, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
734 sf->ids[sf->nfiles] = dep;
735 sr = strrchr(s, '/');
736 sf->names[sf->nfiles] = strdup(sr + 1);
737 sf->dirs[sf->nfiles] = sat_malloc(sr - s + 1);
739 strncpy(sf->dirs[sf->nfiles], s, sr - s);
740 sf->dirs[sf->nfiles][sr - s] = 0;
745 struct addfileprovides_cbdata {
757 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
759 struct addfileprovides_cbdata *cbd = cbdata;
762 if (data != cbd->olddata)
764 map_free(&cbd->useddirs);
765 map_init(&cbd->useddirs, data->dirpool.ndirs);
766 for (i = 0; i < cbd->nfiles; i++)
768 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
771 MAPSET(&cbd->useddirs, did);
775 if (!MAPTST(&cbd->useddirs, value->id))
777 for (i = 0; i < cbd->nfiles; i++)
779 if (cbd->dids[i] != value->id)
781 if (!strcmp(cbd->names[i], value->str))
784 if (i == cbd->nfiles)
786 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
791 pool_addfileprovides(Pool *pool, Repo *installed)
795 struct searchfiles sf, isf;
796 struct addfileprovides_cbdata cbd;
799 memset(&sf, 0, sizeof(sf));
800 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
801 memset(&isf, 0, sizeof(isf));
802 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
804 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
810 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
812 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
814 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
816 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
818 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
820 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
822 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
824 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
828 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
829 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
831 map_init(&cbd.useddirs, 1);
835 for (i = 0; i < sf.nfiles; i++)
836 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
838 cbd.nfiles = sf.nfiles;
841 cbd.names = sf.names;
843 cbd.dids = sat_realloc2(cbd.dids, sf.nfiles, sizeof(Id));
844 pool_search(pool, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
846 for (i = 0; i < sf.nfiles; i++)
848 sat_free(sf.dirs[i]);
849 sat_free(sf.names[i]);
854 if (isf.nfiles && installed)
857 for (i = 0; i < isf.nfiles; i++)
858 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
860 cbd.nfiles = isf.nfiles;
863 cbd.names = isf.names;
865 cbd.dids = sat_realloc2(cbd.dids, isf.nfiles, sizeof(Id));
866 repo_search(installed, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
868 for (i = 0; i < isf.nfiles; i++)
870 sat_free(isf.dirs[i]);
871 sat_free(isf.names[i]);
876 map_free(&cbd.useddirs);
878 pool_freewhatprovides(pool); /* as we have added provides */
882 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)
886 if (pool->solvables[p].repo)
887 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
890 /* FIXME: obey callback return value! */
891 for (p = 1; p < pool->nsolvables; p++)
892 if (pool->solvables[p].repo)
893 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
898 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
902 pool->languagecache = sat_free(pool->languagecache);
903 pool->languagecacheother = 0;
904 if (pool->nlanguages)
906 for (i = 0; i < pool->nlanguages; i++)
907 free((char *)pool->languages[i]);
908 free(pool->languages);
910 pool->nlanguages = nlanguages;
913 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
914 for (i = 0; i < pool->nlanguages; i++)
915 pool->languages[i] = strdup(languages[i]);
919 pool_alloctmpspace(Pool *pool, int len)
921 int n = pool->tmpspacen;
924 if (len > pool->tmpspacelen[n])
926 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
927 pool->tmpspacelen[n] = len + 32;
929 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
930 return pool->tmpspacebuf[n];