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
36 static const char *initpool_data[] = {
47 "solvable:recommends",
49 "solvable:supplements",
52 "rpm:dbid", /* direct key into rpmdb */
53 "solvable:prereqmarker",
54 "solvable:filemarker",
55 "namespace:installed",
57 "namespace:splitprovides",
76 pool = (Pool *)sat_calloc(1, sizeof(*pool));
78 stringpool_init (&pool->ss, initpool_data);
80 /* alloc space for ReDep 0 */
81 pool->rels = sat_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
83 memset(pool->rels, 0, sizeof(Reldep));
85 /* alloc space for Solvable 0 and system solvable */
86 pool->solvables = sat_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
88 memset(pool->solvables, 0, 2 * sizeof(Solvable));
89 s = pool->solvables + SYSTEMSOLVABLE;
90 s->name = SYSTEM_SYSTEM;
91 s->arch = ARCH_NOARCH;
94 queue_init(&pool->vendormap);
96 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
101 /* free all the resources of our pool */
103 pool_free(Pool *pool)
107 pool_freewhatprovides(pool);
108 pool_freeidhashes(pool);
109 repo_freeallrepos(pool, 1);
110 sat_free(pool->id2arch);
111 sat_free(pool->solvables);
112 sat_free(pool->ss.stringspace);
113 sat_free(pool->ss.strings);
114 sat_free(pool->rels);
115 queue_free(&pool->vendormap);
116 for (i = 0; i < DEP2STRBUF; i++)
117 sat_free(pool->dep2strbuf[i]);
122 pool_add_solvable(Pool *pool)
124 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
125 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
126 return pool->nsolvables++;
130 pool_add_solvable_block(Pool *pool, int count)
132 Id nsolvables = pool->nsolvables;
135 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
136 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
137 pool->nsolvables += count;
142 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
146 if (reuseids && start + count == pool->nsolvables)
148 /* might want to shrink solvable array */
149 pool->nsolvables = start;
152 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
157 solvable2str(Pool *pool, Solvable *s)
159 int l, nn = pool->dep2strn;
160 const char *n, *e, *a;
161 n = id2str(pool, s->name);
162 e = id2str(pool, s->evr);
163 a = id2str(pool, s->arch);
164 l = strlen(n) + strlen(e) + strlen(a) + 3;
165 if (l > pool->dep2strlen[nn])
167 pool->dep2strbuf[nn] = sat_realloc(pool->dep2strbuf[nn], l + 32);
168 pool->dep2strlen[nn] = l + 32;
170 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
171 pool->dep2strn = (nn + 1) % DEP2STRBUF;
172 return pool->dep2strbuf[nn];
175 static Pool *pool_shrink_whatprovides_sortcmp_data;
178 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
181 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
183 oa = pool->whatprovides[*(Id *)ap];
184 ob = pool->whatprovides[*(Id *)bp];
186 return *(Id *)ap - *(Id *)bp;
191 da = pool->whatprovidesdata + oa;
192 db = pool->whatprovidesdata + ob;
194 if ((r = (*da++ - *db++)) != 0)
198 return *(Id *)ap - *(Id *)bp;
202 * pool_shrink_whatprovides - unify whatprovides data
204 * whatprovides_rel must be empty for this to work!
208 pool_shrink_whatprovides(Pool *pool)
212 Id lastid, *last, *dp, *lp;
216 if (pool->ss.nstrings < 3)
218 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
219 for (id = 0; id < pool->ss.nstrings; id++)
221 pool_shrink_whatprovides_sortcmp_data = pool;
222 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
225 for (i = 1; i < pool->ss.nstrings; i++)
228 o = pool->whatprovides[id];
229 if (o == 0 || o == 1)
231 dp = pool->whatprovidesdata + o;
245 pool->whatprovides[id] = -lastid;
249 last = pool->whatprovidesdata + o;
253 dp = pool->whatprovidesdata + 2;
254 for (id = 1; id < pool->ss.nstrings; id++)
256 o = pool->whatprovides[id];
257 if (o == 0 || o == 1)
264 pool->whatprovides[id] = pool->whatprovides[i];
267 lp = pool->whatprovidesdata + o;
270 pool->whatprovides[id] = dp - pool->whatprovidesdata;
271 while ((*dp++ = *lp++) != 0)
274 o = dp - pool->whatprovidesdata;
275 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
276 if (pool->whatprovidesdataoff == o)
278 r = pool->whatprovidesdataoff - o;
279 pool->whatprovidesdataoff = o;
280 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
281 if (r > pool->whatprovidesdataleft)
282 r = pool->whatprovidesdataleft;
283 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
288 * pool_createwhatprovides()
290 * create hashes over pool of solvables to ease provide lookups
294 pool_createwhatprovides(Pool *pool)
296 int i, num, np, extra;
301 Offset *whatprovides;
302 Id *whatprovidesdata, *d;
304 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
305 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
307 pool_freeidhashes(pool); /* XXX: should not be here! */
308 pool_freewhatprovides(pool);
309 num = pool->ss.nstrings;
310 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
311 memset(whatprovides, 0, num * sizeof(Offset));
312 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
313 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
315 /* count providers for each name */
316 for (i = 1; i < pool->nsolvables; i++)
319 s = pool->solvables + i;
322 if (!pool_installable(pool, s))
324 pp = s->repo->idarraydata + s->provides;
325 while ((id = *pp++) != ID_NULL)
329 Reldep *rd = GETRELDEP(pool, id);
332 whatprovides[id]++; /* inc count of providers */
336 off = 2; /* first entry is undef, second is empty list */
338 np = 0; /* number of names provided */
339 for (i = 0; i < num; i++, idp++)
342 if (!n) /* no providers */
344 *idp = off; /* move from counts to offsets into whatprovidesdata */
345 off += n + 1; /* make space for all providers + terminating ID_NULL */
346 np++; /* inc # of provider 'slots' */
349 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
351 /* reserve some space for relation data */
352 extra = 2 * pool->nrels;
356 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
358 /* alloc space for all providers + extra */
359 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
361 /* now fill data for all provides */
362 for (i = 1; i < pool->nsolvables; i++)
365 s = pool->solvables + i;
368 if (!pool_installable(pool, s))
371 /* for all provides of this solvable */
372 pp = s->repo->idarraydata + s->provides;
373 while ((id = *pp++) != 0)
377 Reldep *rd = GETRELDEP(pool, id);
380 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
384 while (*d) /* find free slot */
389 *d = i; /* put solvable Id into data */
392 pool->whatprovidesdata = whatprovidesdata;
393 pool->whatprovidesdataoff = off;
394 pool->whatprovidesdataleft = extra;
395 pool_shrink_whatprovides(pool);
399 * free all of our whatprovides data
400 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
403 pool_freewhatprovides(Pool *pool)
405 pool->whatprovides = sat_free(pool->whatprovides);
406 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
407 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
408 pool->whatprovidesdataoff = 0;
409 pool->whatprovidesdataleft = 0;
413 /******************************************************************************/
416 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
418 * on-demand filling of provider information
419 * move queue data into whatprovidesdata
421 * returns: Offset into whatprovides
425 pool_queuetowhatprovides(Pool *pool, Queue *q)
428 int count = q->count;
430 if (count == 0) /* queue empty -> ID_EMPTY */
433 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
434 if (pool->whatprovidesdataleft < count + 1)
436 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
437 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
438 pool->whatprovidesdataleft = count + 4096;
441 /* copy queue to next free slot */
442 off = pool->whatprovidesdataoff;
443 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
445 /* adapt count and ID_NULL-terminate */
446 pool->whatprovidesdataoff += count;
447 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
448 pool->whatprovidesdataleft -= count + 1;
454 /*************************************************************************/
459 * add packages fulfilling the relation to whatprovides array
460 * no exact providers, do range match
465 pool_addrelproviders(Pool *pool, Id d)
467 Reldep *rd = GETRELDEP(pool, d);
473 int flags = rd->flags;
475 Id p, *pp, *pp2, *pp3;
478 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
483 pp = pool_whatprovides(pool, name);
484 pp2 = pool_whatprovides(pool, evr);
485 while ((p = *pp++) != 0)
487 for (pp3 = pp2; *pp3;)
490 queue_push(&plist, p);
496 pp = pool_whatprovides(pool, name);
497 while ((p = *pp++) != 0)
498 queue_push(&plist, p);
499 pp = pool_whatprovides(pool, evr);
500 while ((p = *pp++) != 0)
501 queue_pushunique(&plist, p);
504 if (pool->nscallback)
506 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
510 pool->whatprovides_rel[d] = p;
511 return pool->whatprovidesdata + p;
514 queue_push(&plist, SYSTEMSOLVABLE);
521 /* convert to whatprovides id */
523 POOL_DEBUG(DEBUG_1, "addrelproviders: what provides %s?\n", id2str(pool, name));
525 if (flags && flags < 8)
527 FOR_PROVIDES(p, pp, name)
530 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
532 /* solvable p provides name in some rels */
533 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
534 while ((pid = *pidp++) != 0)
541 #ifdef DEBIAN_SEMANTICS
542 continue; /* unversioned provides can
543 * never match versioned deps */
545 break; /* yes, provides all versions */
549 continue; /* wrong provides name */
550 prd = GETRELDEP(pool, pid);
551 if (prd->name != name)
552 continue; /* wrong provides name */
553 /* right package, both deps are rels */
557 if (flags == 7 || pflags == 7)
558 break; /* included */
559 if ((pflags & flags & 5) != 0)
560 break; /* same direction, match */
564 if ((pflags & flags & 2) != 0)
565 break; /* both have =, match */
569 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
570 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
575 continue; /* no rel match */
576 queue_push(&plist, p);
578 /* make our system solvable provide all unknown rpmlib() stuff */
579 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
580 queue_push(&plist, SYSTEMSOLVABLE);
582 /* add providers to whatprovides */
584 POOL_DEBUG(DEBUG_1, "addrelproviders: adding %d packages to %d\n", plist.count, d);
586 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
589 return pool->whatprovidesdata + pool->whatprovides_rel[d];
592 /*************************************************************************/
595 pool_debug(Pool *pool, int type, const char *format, ...)
600 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
602 if ((pool->debugmask & type) == 0)
605 va_start(args, format);
606 if (!pool->debugcallback)
608 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
609 vprintf(format, args);
611 vfprintf(stderr, format, args);
614 vsnprintf(buf, sizeof(buf), format, args);
615 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
619 pool_setdebuglevel(Pool *pool, int level)
621 int mask = SAT_DEBUG_RESULT;
623 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
625 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
627 mask |= SAT_DEBUG_PROPAGATE;
629 mask |= SAT_DEBUG_RULE_CREATION;
631 mask |= SAT_DEBUG_SCHUBI;
632 pool->debugmask = mask;
635 /*************************************************************************/
643 #define SEARCHFILES_BLOCK 127
646 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
651 while ((dep = *ida++) != 0)
653 while (ISRELDEP(dep))
656 sid = pool->ss.nstrings + GETRELID(dep);
657 if (MAPTST(&sf->seen, sid))
662 MAPSET(&sf->seen, sid);
663 rd = GETRELDEP(pool, dep);
666 else if (rd->flags == REL_NAMESPACE)
668 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
672 if (MAPTST(&sf->seen, sid))
677 MAPSET(&sf->seen, sid);
686 pool_addfileprovides_dep(pool, ids, sf, isf);
692 if (MAPTST(&sf->seen, dep))
694 MAPSET(&sf->seen, dep);
695 s = id2str(pool, dep);
698 sf->files = sat_extend(sf->files, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
699 sf->files[sf->nfiles++] = strdup(s);
705 addfileprovides_cb(void *data, Solvable *s, Id key, const char *str)
707 Pool *pool = s->repo->pool;
709 id = str2id(pool, str, 0);
711 return 0; /* can't happen */
712 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
718 pool_addfileprovides(Pool *pool, Repo *installed)
722 struct searchfiles sf, isf;
725 memset(&sf, 0, sizeof(sf));
726 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
727 memset(&isf, 0, sizeof(isf));
728 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
730 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
736 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
738 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
740 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
742 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
744 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
746 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
748 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
750 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
754 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
755 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
759 for (i = 0; i < sf.nfiles; i++)
760 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", sf.files[i]);
762 sf.files = sat_extend(sf.files, sf.nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
763 sf.files[sf.nfiles++] = 0;
765 pool_search(0, SOLVABLE_FILELIST, (const char *)sf.files, SEARCH_STRING|SEARCH_MULTIPLE, addfileprovides_cb, 0);
769 if (isf.nfiles && installed)
772 for (i = 0; i < isf.nfiles; i++)
773 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", isf.files[i]);
775 isf.files = sat_extend(isf.files, isf.nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
776 isf.files[isf.nfiles++] = 0;
778 repo_search(installed, 0, SOLVABLE_FILELIST, (const char *)isf.files, SEARCH_STRING|SEARCH_MULTIPLE, addfileprovides_cb, 0);
782 pool_freewhatprovides(pool); /* as we have added provides */
802 struct mountpoint *mps;
808 pool_fill_DU_add_cb(void *data, Solvable *s, Id key, const char *str)
810 struct cbdata *cbdata = data;
811 Id mp, dirnum, kbytes, files;
813 dp = data_read_id(dp, &dirnum);
814 dp = data_read_id(dp, &kbytes);
815 data_read_id(dp, &files);
816 if (dirnum < 0 || dirnum > cbdata->nmap)
818 mp = cbdata->dirmap[dirnum];
821 cbdata->mps[mp].kbytes += kbytes;
822 cbdata->mps[mp].files += files;
828 pool_fill_DU_sub_cb(void *data, Solvable *s, Id key, const char *str)
830 struct cbdata *cbdata = data;
831 Id mp, dirnum, kbytes, files;
833 dp = data_read_id(dp, &dirnum);
834 dp = data_read_id(dp, &kbytes);
835 data_read_id(dp, &files);
836 if (dirnum < 0 || dirnum > cbdata->nmap)
838 mp = cbdata->dirmap[dirnum];
841 cbdata->mps[mp].kbytes -= kbytes;
842 cbdata->mps[mp].files -= files;
848 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
851 if (mptree[pos].mountpoint == -1)
852 mptree[pos].mountpoint = mountpoint;
854 mountpoint = mptree[pos].mountpoint;
855 for (i = mptree[pos].child; i; i = mptree[i].sibling)
856 propagate_mountpoints(mptree, i, mountpoint);
860 pool_fill_DU(Pool *pool, struct mountpoint *mps, int nmps)
864 struct mptree *mptree;
870 struct cbdata cbdata;
872 memset(&md, 0, sizeof(md));
877 md.callback_data = &cbdata
883 mptree = sat_malloc2(16, sizeof(mptree));
886 mptree[0].sibling = 0;
890 mptree[0].mountpoint = -1;
893 /* create component tree */
894 for (mp = 0; mp < nmps; mp++)
902 if ((p = strchr('/', path)) == 0)
905 compl = strlen(comp);
916 for (i = mptree[pos].child; i; i = mptree[i].sibling)
917 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, comp, compl))
921 /* create new node */
922 if ((nmptree & 15) == 0)
923 mptree = sat_realloc2(mptree, nmptree + 16, sizeof(mptree));
925 mptree[i].sibling = mptree[pos].child;
927 mptree[i].comp = comp;
928 mptree[i].compl = compl;
929 mptree[i].mountpoint = -1;
930 mptree[pos].child = i;
934 mptree[pos].mountpoint = mp;
936 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
940 for_all_repodatas_containing_DU
942 /* create map from dir to mptree */
943 dirmap = xcalloc2(pool->ndirs, sizeof(Id));
945 for (dn = 2, dirs = pool->dirs + dn; dn < pool->ndirs; dn++)
959 if (!mptree[mp].child)
964 comp = id2str(pool, id);
965 compl = strlen(comp);
966 for (i = mptree[mp].child; i; i = mptree[i].sibling)
967 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, comp, compl))
969 dirmap[dn] = i ? i : -mp;
971 /* change dirmap to point to mountpoint instead of mptree */
972 for (dn = 0; dn < pool->ndirs; dn++)
975 dirmap[i] = mptree[mp > 0 ? mp : -mp].mountpoint;
978 cbdata.nmap = pool->ndirs;
979 cbdata.dirmap = dirmap;
981 md.callback = pool_fill_DU_add_cb;
982 for_solvables_to_be_installed()
984 if (p < data->start || p >= data->end)
986 repodata_search(data, p - data->start, SOLVABLE_DUDATA, &md);
988 md.callback = pool_fill_DU_sub_cb;
989 for_solvables_to_be_erased()
991 if (p < data->start || p >= data->end)
993 repodata_search(data, p - data->start, SOLVABLE_DUDATA, &md);