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]);
167 pool_add_solvable(Pool *pool)
169 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
170 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
171 return pool->nsolvables++;
175 pool_add_solvable_block(Pool *pool, int count)
177 Id nsolvables = pool->nsolvables;
180 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
181 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
182 pool->nsolvables += count;
187 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
191 if (reuseids && start + count == pool->nsolvables)
193 /* might want to shrink solvable array */
194 pool->nsolvables = start;
197 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
202 solvable2str(Pool *pool, Solvable *s)
204 int l, nn = pool->dep2strn;
205 const char *n, *e, *a;
206 n = id2str(pool, s->name);
207 e = id2str(pool, s->evr);
208 a = id2str(pool, s->arch);
209 l = strlen(n) + strlen(e) + strlen(a) + 3;
210 if (l > pool->dep2strlen[nn])
212 pool->dep2strbuf[nn] = sat_realloc(pool->dep2strbuf[nn], l + 32);
213 pool->dep2strlen[nn] = l + 32;
215 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
216 pool->dep2strn = (nn + 1) % DEP2STRBUF;
217 return pool->dep2strbuf[nn];
220 static Pool *pool_shrink_whatprovides_sortcmp_data;
223 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
226 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
228 oa = pool->whatprovides[*(Id *)ap];
229 ob = pool->whatprovides[*(Id *)bp];
231 return *(Id *)ap - *(Id *)bp;
236 da = pool->whatprovidesdata + oa;
237 db = pool->whatprovidesdata + ob;
239 if ((r = (*da++ - *db++)) != 0)
243 return *(Id *)ap - *(Id *)bp;
247 * pool_shrink_whatprovides - unify whatprovides data
249 * whatprovides_rel must be empty for this to work!
253 pool_shrink_whatprovides(Pool *pool)
257 Id lastid, *last, *dp, *lp;
261 if (pool->ss.nstrings < 3)
263 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
264 for (id = 0; id < pool->ss.nstrings; id++)
266 pool_shrink_whatprovides_sortcmp_data = pool;
267 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
270 for (i = 1; i < pool->ss.nstrings; i++)
273 o = pool->whatprovides[id];
274 if (o == 0 || o == 1)
276 dp = pool->whatprovidesdata + o;
290 pool->whatprovides[id] = -lastid;
294 last = pool->whatprovidesdata + o;
298 dp = pool->whatprovidesdata + 2;
299 for (id = 1; id < pool->ss.nstrings; id++)
301 o = pool->whatprovides[id];
302 if (o == 0 || o == 1)
309 pool->whatprovides[id] = pool->whatprovides[i];
312 lp = pool->whatprovidesdata + o;
315 pool->whatprovides[id] = dp - pool->whatprovidesdata;
316 while ((*dp++ = *lp++) != 0)
319 o = dp - pool->whatprovidesdata;
320 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
321 if (pool->whatprovidesdataoff == o)
323 r = pool->whatprovidesdataoff - o;
324 pool->whatprovidesdataoff = o;
325 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
326 if (r > pool->whatprovidesdataleft)
327 r = pool->whatprovidesdataleft;
328 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
333 * pool_createwhatprovides()
335 * create hashes over pool of solvables to ease provide lookups
339 pool_createwhatprovides(Pool *pool)
341 int i, num, np, extra;
346 Offset *whatprovides;
347 Id *whatprovidesdata, *d;
349 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
350 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
352 pool_freeidhashes(pool); /* XXX: should not be here! */
353 pool_freewhatprovides(pool);
354 num = pool->ss.nstrings;
355 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
356 memset(whatprovides, 0, num * sizeof(Offset));
357 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
358 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
360 /* count providers for each name */
361 for (i = 1; i < pool->nsolvables; i++)
364 s = pool->solvables + i;
367 if (!pool_installable(pool, s))
369 pp = s->repo->idarraydata + s->provides;
370 while ((id = *pp++) != ID_NULL)
374 Reldep *rd = GETRELDEP(pool, id);
377 whatprovides[id]++; /* inc count of providers */
381 off = 2; /* first entry is undef, second is empty list */
383 np = 0; /* number of names provided */
384 for (i = 0; i < num; i++, idp++)
387 if (!n) /* no providers */
389 *idp = off; /* move from counts to offsets into whatprovidesdata */
390 off += n + 1; /* make space for all providers + terminating ID_NULL */
391 np++; /* inc # of provider 'slots' */
394 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
396 /* reserve some space for relation data */
397 extra = 2 * pool->nrels;
401 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
403 /* alloc space for all providers + extra */
404 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
406 /* now fill data for all provides */
407 for (i = 1; i < pool->nsolvables; i++)
410 s = pool->solvables + i;
413 if (!pool_installable(pool, s))
416 /* for all provides of this solvable */
417 pp = s->repo->idarraydata + s->provides;
418 while ((id = *pp++) != 0)
422 Reldep *rd = GETRELDEP(pool, id);
425 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
429 while (*d) /* find free slot */
434 *d = i; /* put solvable Id into data */
437 pool->whatprovidesdata = whatprovidesdata;
438 pool->whatprovidesdataoff = off;
439 pool->whatprovidesdataleft = extra;
440 pool_shrink_whatprovides(pool);
444 * free all of our whatprovides data
445 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
448 pool_freewhatprovides(Pool *pool)
450 pool->whatprovides = sat_free(pool->whatprovides);
451 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
452 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
453 pool->whatprovidesdataoff = 0;
454 pool->whatprovidesdataleft = 0;
458 /******************************************************************************/
461 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
463 * on-demand filling of provider information
464 * move queue data into whatprovidesdata
466 * returns: Offset into whatprovides
470 pool_queuetowhatprovides(Pool *pool, Queue *q)
473 int count = q->count;
475 if (count == 0) /* queue empty -> ID_EMPTY */
478 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
479 if (pool->whatprovidesdataleft < count + 1)
481 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
482 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
483 pool->whatprovidesdataleft = count + 4096;
486 /* copy queue to next free slot */
487 off = pool->whatprovidesdataoff;
488 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
490 /* adapt count and ID_NULL-terminate */
491 pool->whatprovidesdataoff += count;
492 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
493 pool->whatprovidesdataleft -= count + 1;
499 /*************************************************************************/
504 * add packages fulfilling the relation to whatprovides array
505 * no exact providers, do range match
510 pool_addrelproviders(Pool *pool, Id d)
512 Reldep *rd = GETRELDEP(pool, d);
518 int flags = rd->flags;
520 Id p, *pp, *pp2, *pp3;
523 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
528 pp = pool_whatprovides(pool, name);
529 pp2 = pool_whatprovides(pool, evr);
530 while ((p = *pp++) != 0)
532 for (pp3 = pp2; *pp3;)
535 queue_push(&plist, p);
541 pp = pool_whatprovides(pool, name);
542 while ((p = *pp++) != 0)
543 queue_push(&plist, p);
544 pp = pool_whatprovides(pool, evr);
545 while ((p = *pp++) != 0)
546 queue_pushunique(&plist, p);
549 if (pool->nscallback)
551 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
555 pool->whatprovides_rel[d] = p;
556 return pool->whatprovidesdata + p;
559 queue_push(&plist, SYSTEMSOLVABLE);
566 /* convert to whatprovides id */
568 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
570 if (flags && flags < 8)
572 FOR_PROVIDES(p, pp, name)
575 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
577 /* solvable p provides name in some rels */
578 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
579 while ((pid = *pidp++) != 0)
586 #ifdef DEBIAN_SEMANTICS
587 continue; /* unversioned provides can
588 * never match versioned deps */
590 break; /* yes, provides all versions */
594 continue; /* wrong provides name */
595 prd = GETRELDEP(pool, pid);
596 if (prd->name != name)
597 continue; /* wrong provides name */
598 /* right package, both deps are rels */
602 if (flags == 7 || pflags == 7)
603 break; /* included */
604 if ((pflags & flags & 5) != 0)
605 break; /* same direction, match */
609 if ((pflags & flags & 2) != 0)
610 break; /* both have =, match */
614 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
615 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
620 continue; /* no rel match */
621 queue_push(&plist, p);
623 /* make our system solvable provide all unknown rpmlib() stuff */
624 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
625 queue_push(&plist, SYSTEMSOLVABLE);
627 /* add providers to whatprovides */
629 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
631 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
634 return pool->whatprovidesdata + pool->whatprovides_rel[d];
637 /*************************************************************************/
640 pool_debug(Pool *pool, int type, const char *format, ...)
645 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
647 if ((pool->debugmask & type) == 0)
650 va_start(args, format);
651 if (!pool->debugcallback)
653 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
654 vprintf(format, args);
656 vfprintf(stderr, format, args);
659 vsnprintf(buf, sizeof(buf), format, args);
660 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
664 pool_setdebuglevel(Pool *pool, int level)
666 int mask = SAT_DEBUG_RESULT;
668 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
670 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
672 mask |= SAT_DEBUG_PROPAGATE;
674 mask |= SAT_DEBUG_RULE_CREATION;
676 mask |= SAT_DEBUG_SCHUBI;
677 pool->debugmask = mask;
680 /*************************************************************************/
690 #define SEARCHFILES_BLOCK 127
693 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
698 while ((dep = *ida++) != 0)
700 while (ISRELDEP(dep))
703 sid = pool->ss.nstrings + GETRELID(dep);
704 if (MAPTST(&sf->seen, sid))
709 MAPSET(&sf->seen, sid);
710 rd = GETRELDEP(pool, dep);
713 else if (rd->flags == REL_NAMESPACE)
715 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
719 if (MAPTST(&sf->seen, sid))
724 MAPSET(&sf->seen, sid);
733 pool_addfileprovides_dep(pool, ids, sf, isf);
739 if (MAPTST(&sf->seen, dep))
741 MAPSET(&sf->seen, dep);
742 s = id2str(pool, dep);
745 sf->ids = sat_extend(sf->ids, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
746 sf->dirs = sat_extend(sf->dirs, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
747 sf->names = sat_extend(sf->names, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
748 sf->ids[sf->nfiles] = dep;
749 sr = strrchr(s, '/');
750 sf->names[sf->nfiles] = strdup(sr + 1);
751 sf->dirs[sf->nfiles] = sat_malloc(sr - s + 1);
753 strncpy(sf->dirs[sf->nfiles], s, sr - s);
754 sf->dirs[sf->nfiles][sr - s] = 0;
759 struct addfileprovides_cbdata {
771 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
773 struct addfileprovides_cbdata *cbd = cbdata;
776 if (data != cbd->olddata)
778 map_free(&cbd->useddirs);
779 map_init(&cbd->useddirs, data->dirpool.ndirs);
780 for (i = 0; i < cbd->nfiles; i++)
782 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
785 MAPSET(&cbd->useddirs, did);
789 if (!MAPTST(&cbd->useddirs, value->id))
791 for (i = 0; i < cbd->nfiles; i++)
793 if (cbd->dids[i] != value->id)
795 if (!strcmp(cbd->names[i], value->str))
798 if (i == cbd->nfiles)
800 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
805 pool_addfileprovides(Pool *pool, Repo *installed)
809 struct searchfiles sf, isf;
810 struct addfileprovides_cbdata cbd;
813 memset(&sf, 0, sizeof(sf));
814 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
815 memset(&isf, 0, sizeof(isf));
816 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
818 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
824 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
826 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
828 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
830 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
832 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
834 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
836 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
838 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
842 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
843 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
845 map_init(&cbd.useddirs, 1);
849 for (i = 0; i < sf.nfiles; i++)
850 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
852 cbd.nfiles = sf.nfiles;
855 cbd.names = sf.names;
857 cbd.dids = sat_realloc2(cbd.dids, sf.nfiles, sizeof(Id));
858 pool_search(pool, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
860 for (i = 0; i < sf.nfiles; i++)
862 sat_free(sf.dirs[i]);
863 sat_free(sf.names[i]);
868 if (isf.nfiles && installed)
871 for (i = 0; i < isf.nfiles; i++)
872 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
874 cbd.nfiles = isf.nfiles;
877 cbd.names = isf.names;
879 cbd.dids = sat_realloc2(cbd.dids, isf.nfiles, sizeof(Id));
880 repo_search(installed, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
882 for (i = 0; i < isf.nfiles; i++)
884 sat_free(isf.dirs[i]);
885 sat_free(isf.names[i]);
890 map_free(&cbd.useddirs);
892 pool_freewhatprovides(pool); /* as we have added provides */
895 void 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)
899 if (pool->solvables[p].repo)
900 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
903 /* FIXME: obey callback return value! */
904 for (p = 1; p < pool->nsolvables; p++)
905 if (pool->solvables[p].repo)
906 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);