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 < POOL_TMPSPACEBUF; i++)
162 sat_free(pool->tmpspacebuf[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);
205 static Pool *pool_shrink_whatprovides_sortcmp_data;
208 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
211 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
213 oa = pool->whatprovides[*(Id *)ap];
214 ob = pool->whatprovides[*(Id *)bp];
216 return *(Id *)ap - *(Id *)bp;
221 da = pool->whatprovidesdata + oa;
222 db = pool->whatprovidesdata + ob;
224 if ((r = (*da++ - *db++)) != 0)
228 return *(Id *)ap - *(Id *)bp;
232 * pool_shrink_whatprovides - unify whatprovides data
234 * whatprovides_rel must be empty for this to work!
238 pool_shrink_whatprovides(Pool *pool)
242 Id lastid, *last, *dp, *lp;
246 if (pool->ss.nstrings < 3)
248 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
249 for (id = 0; id < pool->ss.nstrings; id++)
251 pool_shrink_whatprovides_sortcmp_data = pool;
252 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
255 for (i = 1; i < pool->ss.nstrings; i++)
258 o = pool->whatprovides[id];
259 if (o == 0 || o == 1)
261 dp = pool->whatprovidesdata + o;
275 pool->whatprovides[id] = -lastid;
279 last = pool->whatprovidesdata + o;
283 dp = pool->whatprovidesdata + 2;
284 for (id = 1; id < pool->ss.nstrings; id++)
286 o = pool->whatprovides[id];
287 if (o == 0 || o == 1)
294 pool->whatprovides[id] = pool->whatprovides[i];
297 lp = pool->whatprovidesdata + o;
300 pool->whatprovides[id] = dp - pool->whatprovidesdata;
301 while ((*dp++ = *lp++) != 0)
304 o = dp - pool->whatprovidesdata;
305 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
306 if (pool->whatprovidesdataoff == o)
308 r = pool->whatprovidesdataoff - o;
309 pool->whatprovidesdataoff = o;
310 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
311 if (r > pool->whatprovidesdataleft)
312 r = pool->whatprovidesdataleft;
313 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
318 * pool_createwhatprovides()
320 * create hashes over pool of solvables to ease provide lookups
324 pool_createwhatprovides(Pool *pool)
326 int i, num, np, extra;
331 Offset *whatprovides;
332 Id *whatprovidesdata, *d;
334 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
335 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
337 pool_freeidhashes(pool); /* XXX: should not be here! */
338 pool_freewhatprovides(pool);
339 num = pool->ss.nstrings;
340 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
341 memset(whatprovides, 0, num * sizeof(Offset));
342 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
343 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
345 /* count providers for each name */
346 for (i = 1; i < pool->nsolvables; i++)
349 s = pool->solvables + i;
352 if (!pool_installable(pool, s))
354 pp = s->repo->idarraydata + s->provides;
355 while ((id = *pp++) != ID_NULL)
359 Reldep *rd = GETRELDEP(pool, id);
362 whatprovides[id]++; /* inc count of providers */
366 off = 2; /* first entry is undef, second is empty list */
368 np = 0; /* number of names provided */
369 for (i = 0; i < num; i++, idp++)
372 if (!n) /* no providers */
374 *idp = off; /* move from counts to offsets into whatprovidesdata */
375 off += n + 1; /* make space for all providers + terminating ID_NULL */
376 np++; /* inc # of provider 'slots' */
379 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
381 /* reserve some space for relation data */
382 extra = 2 * pool->nrels;
386 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
388 /* alloc space for all providers + extra */
389 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
391 /* now fill data for all provides */
392 for (i = 1; i < pool->nsolvables; i++)
395 s = pool->solvables + i;
398 if (!pool_installable(pool, s))
401 /* for all provides of this solvable */
402 pp = s->repo->idarraydata + s->provides;
403 while ((id = *pp++) != 0)
407 Reldep *rd = GETRELDEP(pool, id);
410 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
414 while (*d) /* find free slot */
419 *d = i; /* put solvable Id into data */
422 pool->whatprovidesdata = whatprovidesdata;
423 pool->whatprovidesdataoff = off;
424 pool->whatprovidesdataleft = extra;
425 pool_shrink_whatprovides(pool);
429 * free all of our whatprovides data
430 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
433 pool_freewhatprovides(Pool *pool)
435 pool->whatprovides = sat_free(pool->whatprovides);
436 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
437 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
438 pool->whatprovidesdataoff = 0;
439 pool->whatprovidesdataleft = 0;
443 /******************************************************************************/
446 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
448 * on-demand filling of provider information
449 * move queue data into whatprovidesdata
451 * returns: Offset into whatprovides
455 pool_queuetowhatprovides(Pool *pool, Queue *q)
458 int count = q->count;
460 if (count == 0) /* queue empty -> ID_EMPTY */
463 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
464 if (pool->whatprovidesdataleft < count + 1)
466 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
467 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
468 pool->whatprovidesdataleft = count + 4096;
471 /* copy queue to next free slot */
472 off = pool->whatprovidesdataoff;
473 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
475 /* adapt count and ID_NULL-terminate */
476 pool->whatprovidesdataoff += count;
477 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
478 pool->whatprovidesdataleft -= count + 1;
484 /*************************************************************************/
489 * add packages fulfilling the relation to whatprovides array
490 * no exact providers, do range match
495 pool_addrelproviders(Pool *pool, Id d)
497 Reldep *rd = GETRELDEP(pool, d);
503 int flags = rd->flags;
505 Id p, *pp, *pp2, *pp3;
508 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
513 pp = pool_whatprovides(pool, name);
514 pp2 = pool_whatprovides(pool, evr);
515 while ((p = *pp++) != 0)
517 for (pp3 = pp2; *pp3;)
520 queue_push(&plist, p);
526 pp = pool_whatprovides(pool, name);
527 while ((p = *pp++) != 0)
528 queue_push(&plist, p);
529 pp = pool_whatprovides(pool, evr);
530 while ((p = *pp++) != 0)
531 queue_pushunique(&plist, p);
534 if (pool->nscallback)
536 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
540 pool->whatprovides_rel[d] = p;
541 return pool->whatprovidesdata + p;
544 queue_push(&plist, SYSTEMSOLVABLE);
551 /* convert to whatprovides id */
553 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
555 if (flags && flags < 8)
557 FOR_PROVIDES(p, pp, name)
560 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
562 /* solvable p provides name in some rels */
563 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
564 while ((pid = *pidp++) != 0)
571 #ifdef DEBIAN_SEMANTICS
572 continue; /* unversioned provides can
573 * never match versioned deps */
575 break; /* yes, provides all versions */
579 continue; /* wrong provides name */
580 prd = GETRELDEP(pool, pid);
581 if (prd->name != name)
582 continue; /* wrong provides name */
583 /* right package, both deps are rels */
587 if (flags == 7 || pflags == 7)
588 break; /* included */
589 if ((pflags & flags & 5) != 0)
590 break; /* same direction, match */
594 if ((pflags & flags & 2) != 0)
595 break; /* both have =, match */
599 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
600 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
605 continue; /* no rel match */
606 queue_push(&plist, p);
608 /* make our system solvable provide all unknown rpmlib() stuff */
609 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
610 queue_push(&plist, SYSTEMSOLVABLE);
612 /* add providers to whatprovides */
614 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
616 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
619 return pool->whatprovidesdata + pool->whatprovides_rel[d];
622 /*************************************************************************/
625 pool_debug(Pool *pool, int type, const char *format, ...)
630 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
632 if ((pool->debugmask & type) == 0)
635 va_start(args, format);
636 if (!pool->debugcallback)
638 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
639 vprintf(format, args);
641 vfprintf(stderr, format, args);
644 vsnprintf(buf, sizeof(buf), format, args);
645 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
649 pool_setdebuglevel(Pool *pool, int level)
651 int mask = SAT_DEBUG_RESULT;
653 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
655 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
657 mask |= SAT_DEBUG_PROPAGATE;
659 mask |= SAT_DEBUG_RULE_CREATION;
661 mask |= SAT_DEBUG_SCHUBI;
662 pool->debugmask = mask;
665 /*************************************************************************/
675 #define SEARCHFILES_BLOCK 127
678 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
683 while ((dep = *ida++) != 0)
685 while (ISRELDEP(dep))
688 sid = pool->ss.nstrings + GETRELID(dep);
689 if (MAPTST(&sf->seen, sid))
694 MAPSET(&sf->seen, sid);
695 rd = GETRELDEP(pool, dep);
698 else if (rd->flags == REL_NAMESPACE)
700 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
704 if (MAPTST(&sf->seen, sid))
709 MAPSET(&sf->seen, sid);
718 pool_addfileprovides_dep(pool, ids, sf, isf);
724 if (MAPTST(&sf->seen, dep))
726 MAPSET(&sf->seen, dep);
727 s = id2str(pool, dep);
730 sf->ids = sat_extend(sf->ids, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
731 sf->dirs = sat_extend(sf->dirs, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
732 sf->names = sat_extend(sf->names, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
733 sf->ids[sf->nfiles] = dep;
734 sr = strrchr(s, '/');
735 sf->names[sf->nfiles] = strdup(sr + 1);
736 sf->dirs[sf->nfiles] = sat_malloc(sr - s + 1);
738 strncpy(sf->dirs[sf->nfiles], s, sr - s);
739 sf->dirs[sf->nfiles][sr - s] = 0;
744 struct addfileprovides_cbdata {
756 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
758 struct addfileprovides_cbdata *cbd = cbdata;
761 if (data != cbd->olddata)
763 map_free(&cbd->useddirs);
764 map_init(&cbd->useddirs, data->dirpool.ndirs);
765 for (i = 0; i < cbd->nfiles; i++)
767 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
770 MAPSET(&cbd->useddirs, did);
774 if (!MAPTST(&cbd->useddirs, value->id))
776 for (i = 0; i < cbd->nfiles; i++)
778 if (cbd->dids[i] != value->id)
780 if (!strcmp(cbd->names[i], value->str))
783 if (i == cbd->nfiles)
785 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
790 pool_addfileprovides(Pool *pool, Repo *installed)
794 struct searchfiles sf, isf;
795 struct addfileprovides_cbdata cbd;
798 memset(&sf, 0, sizeof(sf));
799 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
800 memset(&isf, 0, sizeof(isf));
801 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
803 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
809 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
811 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
813 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
815 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
817 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
819 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
821 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
823 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
827 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
828 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
830 map_init(&cbd.useddirs, 1);
834 for (i = 0; i < sf.nfiles; i++)
835 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
837 cbd.nfiles = sf.nfiles;
840 cbd.names = sf.names;
842 cbd.dids = sat_realloc2(cbd.dids, sf.nfiles, sizeof(Id));
843 pool_search(pool, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
845 for (i = 0; i < sf.nfiles; i++)
847 sat_free(sf.dirs[i]);
848 sat_free(sf.names[i]);
853 if (isf.nfiles && installed)
856 for (i = 0; i < isf.nfiles; i++)
857 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
859 cbd.nfiles = isf.nfiles;
862 cbd.names = isf.names;
864 cbd.dids = sat_realloc2(cbd.dids, isf.nfiles, sizeof(Id));
865 repo_search(installed, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
867 for (i = 0; i < isf.nfiles; i++)
869 sat_free(isf.dirs[i]);
870 sat_free(isf.names[i]);
875 map_free(&cbd.useddirs);
877 pool_freewhatprovides(pool); /* as we have added provides */
881 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)
885 if (pool->solvables[p].repo)
886 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
889 /* FIXME: obey callback return value! */
890 for (p = 1; p < pool->nsolvables; p++)
891 if (pool->solvables[p].repo)
892 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
897 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
901 pool->languagecache = sat_free(pool->languagecache);
902 pool->languagecacheother = 0;
903 if (pool->nlanguages)
905 for (i = 0; i < pool->nlanguages; i++)
906 free((char *)pool->languages[i]);
907 free(pool->languages);
909 pool->nlanguages = nlanguages;
912 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
913 for (i = 0; i < pool->nlanguages; i++)
914 pool->languages[i] = strdup(languages[i]);
918 pool_alloctmpspace(Pool *pool, int len)
920 int n = pool->tmpspacen;
923 if (len > pool->tmpspacelen[n])
925 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
926 pool->tmpspacelen[n] = len + 32;
928 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
929 return pool->tmpspacebuf[n];