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",
111 "solvable:headerend",
123 pool = (Pool *)sat_calloc(1, sizeof(*pool));
125 stringpool_init (&pool->ss, initpool_data);
127 /* alloc space for ReDep 0 */
128 pool->rels = sat_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
130 memset(pool->rels, 0, sizeof(Reldep));
132 /* alloc space for Solvable 0 and system solvable */
133 pool->solvables = sat_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
134 pool->nsolvables = 2;
135 memset(pool->solvables, 0, 2 * sizeof(Solvable));
136 s = pool->solvables + SYSTEMSOLVABLE;
137 s->name = SYSTEM_SYSTEM;
138 s->arch = ARCH_NOARCH;
141 queue_init(&pool->vendormap);
143 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
148 /* free all the resources of our pool */
150 pool_free(Pool *pool)
154 pool_freewhatprovides(pool);
155 pool_freeidhashes(pool);
156 repo_freeallrepos(pool, 1);
157 sat_free(pool->id2arch);
158 sat_free(pool->solvables);
159 sat_free(pool->ss.stringspace);
160 sat_free(pool->ss.strings);
161 sat_free(pool->rels);
162 queue_free(&pool->vendormap);
163 for (i = 0; i < POOL_TMPSPACEBUF; i++)
164 sat_free(pool->tmpspacebuf[i]);
165 for (i = 0; i < pool->nlanguages; i++)
166 free((char *)pool->languages[i]);
167 sat_free(pool->languages);
168 sat_free(pool->languagecache);
173 pool_add_solvable(Pool *pool)
175 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
176 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
177 return pool->nsolvables++;
181 pool_add_solvable_block(Pool *pool, int count)
183 Id nsolvables = pool->nsolvables;
186 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
187 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
188 pool->nsolvables += count;
193 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
197 if (reuseids && start + count == pool->nsolvables)
199 /* might want to shrink solvable array */
200 pool->nsolvables = start;
203 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
207 static Pool *pool_shrink_whatprovides_sortcmp_data;
210 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
213 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
215 oa = pool->whatprovides[*(Id *)ap];
216 ob = pool->whatprovides[*(Id *)bp];
218 return *(Id *)ap - *(Id *)bp;
223 da = pool->whatprovidesdata + oa;
224 db = pool->whatprovidesdata + ob;
226 if ((r = (*da++ - *db++)) != 0)
230 return *(Id *)ap - *(Id *)bp;
234 * pool_shrink_whatprovides - unify whatprovides data
236 * whatprovides_rel must be empty for this to work!
240 pool_shrink_whatprovides(Pool *pool)
244 Id lastid, *last, *dp, *lp;
248 if (pool->ss.nstrings < 3)
250 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
251 for (id = 0; id < pool->ss.nstrings; id++)
253 pool_shrink_whatprovides_sortcmp_data = pool;
254 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
257 for (i = 1; i < pool->ss.nstrings; i++)
260 o = pool->whatprovides[id];
261 if (o == 0 || o == 1)
263 dp = pool->whatprovidesdata + o;
277 pool->whatprovides[id] = -lastid;
281 last = pool->whatprovidesdata + o;
285 dp = pool->whatprovidesdata + 2;
286 for (id = 1; id < pool->ss.nstrings; id++)
288 o = pool->whatprovides[id];
289 if (o == 0 || o == 1)
296 pool->whatprovides[id] = pool->whatprovides[i];
299 lp = pool->whatprovidesdata + o;
302 pool->whatprovides[id] = dp - pool->whatprovidesdata;
303 while ((*dp++ = *lp++) != 0)
306 o = dp - pool->whatprovidesdata;
307 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
308 if (pool->whatprovidesdataoff == o)
310 r = pool->whatprovidesdataoff - o;
311 pool->whatprovidesdataoff = o;
312 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
313 if (r > pool->whatprovidesdataleft)
314 r = pool->whatprovidesdataleft;
315 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
320 * pool_createwhatprovides()
322 * create hashes over pool of solvables to ease provide lookups
326 pool_createwhatprovides(Pool *pool)
328 int i, num, np, extra;
333 Offset *whatprovides;
334 Id *whatprovidesdata, *d;
336 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
337 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
339 pool_freeidhashes(pool); /* XXX: should not be here! */
340 pool_freewhatprovides(pool);
341 num = pool->ss.nstrings;
342 pool->whatprovides = whatprovides = sat_extend_resize(0, num, sizeof(Offset), WHATPROVIDES_BLOCK);
343 memset(whatprovides, 0, num * sizeof(Offset));
344 pool->whatprovides_rel = sat_extend_resize(0, pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
345 memset(pool->whatprovides_rel, 0, pool->nrels * sizeof(Offset));
347 /* count providers for each name */
348 for (i = 1; i < pool->nsolvables; i++)
351 s = pool->solvables + i;
354 if (!pool_installable(pool, s))
356 pp = s->repo->idarraydata + s->provides;
357 while ((id = *pp++) != ID_NULL)
361 Reldep *rd = GETRELDEP(pool, id);
364 whatprovides[id]++; /* inc count of providers */
368 off = 2; /* first entry is undef, second is empty list */
370 np = 0; /* number of names provided */
371 for (i = 0; i < num; i++, idp++)
374 if (!n) /* no providers */
376 *idp = off; /* move from counts to offsets into whatprovidesdata */
377 off += n + 1; /* make space for all providers + terminating ID_NULL */
378 np++; /* inc # of provider 'slots' */
381 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
383 /* reserve some space for relation data */
384 extra = 2 * pool->nrels;
388 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
390 /* alloc space for all providers + extra */
391 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
393 /* now fill data for all provides */
394 for (i = 1; i < pool->nsolvables; i++)
397 s = pool->solvables + i;
400 if (!pool_installable(pool, s))
403 /* for all provides of this solvable */
404 pp = s->repo->idarraydata + s->provides;
405 while ((id = *pp++) != 0)
409 Reldep *rd = GETRELDEP(pool, id);
412 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
416 while (*d) /* find free slot */
421 *d = i; /* put solvable Id into data */
424 pool->whatprovidesdata = whatprovidesdata;
425 pool->whatprovidesdataoff = off;
426 pool->whatprovidesdataleft = extra;
427 pool_shrink_whatprovides(pool);
431 * free all of our whatprovides data
432 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
435 pool_freewhatprovides(Pool *pool)
437 pool->whatprovides = sat_free(pool->whatprovides);
438 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
439 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
440 pool->whatprovidesdataoff = 0;
441 pool->whatprovidesdataleft = 0;
445 /******************************************************************************/
448 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
450 * on-demand filling of provider information
451 * move queue data into whatprovidesdata
453 * returns: Offset into whatprovides
457 pool_queuetowhatprovides(Pool *pool, Queue *q)
460 int count = q->count;
462 if (count == 0) /* queue empty -> ID_EMPTY */
465 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
466 if (pool->whatprovidesdataleft < count + 1)
468 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
469 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
470 pool->whatprovidesdataleft = count + 4096;
473 /* copy queue to next free slot */
474 off = pool->whatprovidesdataoff;
475 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
477 /* adapt count and ID_NULL-terminate */
478 pool->whatprovidesdataoff += count;
479 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
480 pool->whatprovidesdataleft -= count + 1;
486 /*************************************************************************/
491 * add packages fulfilling the relation to whatprovides array
492 * no exact providers, do range match
497 pool_addrelproviders(Pool *pool, Id d)
499 Reldep *rd = GETRELDEP(pool, d);
505 int flags = rd->flags;
507 Id p, *pp, *pp2, *pp3;
510 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
515 pp = pool_whatprovides(pool, name);
516 pp2 = pool_whatprovides(pool, evr);
517 while ((p = *pp++) != 0)
519 for (pp3 = pp2; *pp3;)
522 queue_push(&plist, p);
528 pp = pool_whatprovides(pool, name);
529 while ((p = *pp++) != 0)
530 queue_push(&plist, p);
531 pp = pool_whatprovides(pool, evr);
532 while ((p = *pp++) != 0)
533 queue_pushunique(&plist, p);
536 if (pool->nscallback)
538 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
542 pool->whatprovides_rel[d] = p;
543 return pool->whatprovidesdata + p;
546 queue_push(&plist, SYSTEMSOLVABLE);
553 /* convert to whatprovides id */
555 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
557 if (flags && flags < 8)
559 FOR_PROVIDES(p, pp, name)
562 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
564 /* solvable p provides name in some rels */
565 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
566 while ((pid = *pidp++) != 0)
573 #ifdef DEBIAN_SEMANTICS
574 continue; /* unversioned provides can
575 * never match versioned deps */
577 break; /* yes, provides all versions */
581 continue; /* wrong provides name */
582 prd = GETRELDEP(pool, pid);
583 if (prd->name != name)
584 continue; /* wrong provides name */
585 /* right package, both deps are rels */
589 if (flags == 7 || pflags == 7)
590 break; /* included */
591 if ((pflags & flags & 5) != 0)
592 break; /* same direction, match */
596 if ((pflags & flags & 2) != 0)
597 break; /* both have =, match */
601 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
602 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
607 continue; /* no rel match */
608 queue_push(&plist, p);
610 /* make our system solvable provide all unknown rpmlib() stuff */
611 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
612 queue_push(&plist, SYSTEMSOLVABLE);
614 /* add providers to whatprovides */
616 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
618 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
621 return pool->whatprovidesdata + pool->whatprovides_rel[d];
624 /*************************************************************************/
627 pool_debug(Pool *pool, int type, const char *format, ...)
632 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
634 if ((pool->debugmask & type) == 0)
637 va_start(args, format);
638 if (!pool->debugcallback)
640 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
641 vprintf(format, args);
643 vfprintf(stderr, format, args);
646 vsnprintf(buf, sizeof(buf), format, args);
647 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
651 pool_setdebuglevel(Pool *pool, int level)
653 int mask = SAT_DEBUG_RESULT;
655 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
657 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
659 mask |= SAT_DEBUG_PROPAGATE;
661 mask |= SAT_DEBUG_RULE_CREATION;
663 mask |= SAT_DEBUG_SCHUBI;
664 pool->debugmask = mask;
667 /*************************************************************************/
677 #define SEARCHFILES_BLOCK 127
680 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
685 while ((dep = *ida++) != 0)
687 while (ISRELDEP(dep))
690 sid = pool->ss.nstrings + GETRELID(dep);
691 if (MAPTST(&sf->seen, sid))
696 MAPSET(&sf->seen, sid);
697 rd = GETRELDEP(pool, dep);
700 else if (rd->flags == REL_NAMESPACE)
702 if (isf && (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES))
706 if (MAPTST(&sf->seen, sid))
711 MAPSET(&sf->seen, sid);
720 pool_addfileprovides_dep(pool, ids, sf, isf);
726 if (MAPTST(&sf->seen, dep))
728 MAPSET(&sf->seen, dep);
729 s = id2str(pool, dep);
732 sf->ids = sat_extend(sf->ids, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
733 sf->dirs = sat_extend(sf->dirs, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
734 sf->names = sat_extend(sf->names, sf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
735 sf->ids[sf->nfiles] = dep;
736 sr = strrchr(s, '/');
737 sf->names[sf->nfiles] = strdup(sr + 1);
738 sf->dirs[sf->nfiles] = sat_malloc(sr - s + 1);
740 strncpy(sf->dirs[sf->nfiles], s, sr - s);
741 sf->dirs[sf->nfiles][sr - s] = 0;
746 struct addfileprovides_cbdata {
758 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
760 struct addfileprovides_cbdata *cbd = cbdata;
763 if (data != cbd->olddata)
765 map_free(&cbd->useddirs);
766 map_init(&cbd->useddirs, data->dirpool.ndirs);
767 for (i = 0; i < cbd->nfiles; i++)
769 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
772 MAPSET(&cbd->useddirs, did);
776 if (!MAPTST(&cbd->useddirs, value->id))
778 for (i = 0; i < cbd->nfiles; i++)
780 if (cbd->dids[i] != value->id)
782 if (!strcmp(cbd->names[i], value->str))
785 if (i == cbd->nfiles)
787 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
792 pool_addfileprovides(Pool *pool, Repo *installed)
796 struct searchfiles sf, isf;
797 struct addfileprovides_cbdata cbd;
800 memset(&sf, 0, sizeof(sf));
801 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
802 memset(&isf, 0, sizeof(isf));
803 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
805 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
811 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, &isf);
813 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, &isf);
815 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, &isf);
817 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, &isf);
819 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, &isf);
821 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, &isf);
823 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, &isf);
825 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &sf, &isf);
829 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
830 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
832 map_init(&cbd.useddirs, 1);
836 for (i = 0; i < sf.nfiles; i++)
837 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
839 cbd.nfiles = sf.nfiles;
842 cbd.names = sf.names;
844 cbd.dids = sat_realloc2(cbd.dids, sf.nfiles, sizeof(Id));
845 pool_search(pool, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
847 for (i = 0; i < sf.nfiles; i++)
849 sat_free(sf.dirs[i]);
850 sat_free(sf.names[i]);
855 if (isf.nfiles && installed)
858 for (i = 0; i < isf.nfiles; i++)
859 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
861 cbd.nfiles = isf.nfiles;
864 cbd.names = isf.names;
866 cbd.dids = sat_realloc2(cbd.dids, isf.nfiles, sizeof(Id));
867 repo_search(installed, 0, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, &cbd);
869 for (i = 0; i < isf.nfiles; i++)
871 sat_free(isf.dirs[i]);
872 sat_free(isf.names[i]);
877 map_free(&cbd.useddirs);
879 pool_freewhatprovides(pool); /* as we have added provides */
883 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)
887 if (pool->solvables[p].repo)
888 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
891 /* FIXME: obey callback return value! */
892 for (p = 1; p < pool->nsolvables; p++)
893 if (pool->solvables[p].repo)
894 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
899 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
903 pool->languagecache = sat_free(pool->languagecache);
904 pool->languagecacheother = 0;
905 if (pool->nlanguages)
907 for (i = 0; i < pool->nlanguages; i++)
908 free((char *)pool->languages[i]);
909 free(pool->languages);
911 pool->nlanguages = nlanguages;
914 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
915 for (i = 0; i < pool->nlanguages; i++)
916 pool->languages[i] = strdup(languages[i]);
920 pool_alloctmpspace(Pool *pool, int len)
922 int n = pool->tmpspacen;
925 if (len > pool->tmpspacelen[n])
927 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
928 pool->tmpspacelen[n] = len + 32;
930 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
931 return pool->tmpspacebuf[n];