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",
74 pool = (Pool *)sat_calloc(1, sizeof(*pool));
76 stringpool_init (&pool->ss, initpool_data);
78 // pre-alloc space for a RelDep
79 pool->rels = (Reldep *)sat_calloc(1 + REL_BLOCK, sizeof(Reldep));
82 // pre-alloc space for a Solvable
83 pool->solvables = (Solvable *)sat_calloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
85 queue_init(&pool->vendormap);
86 s = pool->solvables + SYSTEMSOLVABLE;
87 s->name = SYSTEM_SYSTEM;
88 s->arch = ARCH_NOARCH;
91 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
96 /* free all the resources of our pool */
102 pool_freewhatprovides(pool);
103 pool_freeidhashes(pool);
104 repo_freeallrepos(pool, 1);
105 sat_free(pool->id2arch);
106 sat_free(pool->solvables);
107 sat_free(pool->ss.stringspace);
108 sat_free(pool->ss.strings);
109 sat_free(pool->rels);
110 queue_free(&pool->vendormap);
111 for (i = 0; i < DEP2STRBUF; i++)
112 sat_free(pool->dep2strbuf[i]);
117 pool_add_solvable(Pool *pool)
119 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
120 pool->solvables = sat_realloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
121 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
122 return pool->nsolvables++;
126 pool_add_solvable_block(Pool *pool, int count)
128 Id nsolvables = pool->nsolvables;
131 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
132 pool->solvables = sat_realloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
133 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
134 pool->nsolvables += count;
139 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
143 if (reuseids && start + count == pool->nsolvables)
145 /* might want to shrink solvable array */
146 pool->nsolvables = start;
149 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
154 solvable2str(Pool *pool, Solvable *s)
156 int l, nn = pool->dep2strn;
157 const char *n, *e, *a;
158 n = id2str(pool, s->name);
159 e = id2str(pool, s->evr);
160 a = id2str(pool, s->arch);
161 l = strlen(n) + strlen(e) + strlen(a) + 3;
162 if (l > pool->dep2strlen[nn])
164 pool->dep2strbuf[nn] = sat_realloc(pool->dep2strbuf[nn], l + 32);
165 pool->dep2strlen[nn] = l + 32;
167 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
168 pool->dep2strn = (nn + 1) % DEP2STRBUF;
169 return pool->dep2strbuf[nn];
172 static Pool *pool_shrink_whatprovides_sortcmp_data;
175 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
178 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
180 oa = pool->whatprovides[*(Id *)ap];
181 ob = pool->whatprovides[*(Id *)bp];
183 return *(Id *)ap - *(Id *)bp;
188 da = pool->whatprovidesdata + oa;
189 db = pool->whatprovidesdata + ob;
191 if ((r = (*da++ - *db++)) != 0)
195 return *(Id *)ap - *(Id *)bp;
199 * pool_shrink_whatprovides - unify whatprovides data
201 * whatprovides_rel must be empty for this to work!
205 pool_shrink_whatprovides(Pool *pool)
209 Id lastid, *last, *dp, *lp;
213 if (pool->ss.nstrings < 3)
215 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
216 for (id = 0; id < pool->ss.nstrings; id++)
218 pool_shrink_whatprovides_sortcmp_data = pool;
219 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
222 for (i = 1; i < pool->ss.nstrings; i++)
225 o = pool->whatprovides[id];
226 if (o == 0 || o == 1)
228 dp = pool->whatprovidesdata + o;
242 pool->whatprovides[id] = -lastid;
246 last = pool->whatprovidesdata + o;
250 dp = pool->whatprovidesdata + 2;
251 for (id = 1; id < pool->ss.nstrings; id++)
253 o = pool->whatprovides[id];
254 if (o == 0 || o == 1)
261 pool->whatprovides[id] = pool->whatprovides[i];
264 lp = pool->whatprovidesdata + o;
267 pool->whatprovides[id] = dp - pool->whatprovidesdata;
268 while ((*dp++ = *lp++) != 0)
271 o = dp - pool->whatprovidesdata;
272 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
273 if (pool->whatprovidesdataoff == o)
275 r = pool->whatprovidesdataoff - o;
276 pool->whatprovidesdataoff = o;
277 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
278 if (r > pool->whatprovidesdataleft)
279 r = pool->whatprovidesdataleft;
280 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
285 * pool_createwhatprovides()
287 * create hashes over pool of solvables to ease provide lookups
291 pool_createwhatprovides(Pool *pool)
293 int i, num, np, extra;
298 Offset *whatprovides;
299 Id *whatprovidesdata, *d;
301 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
302 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
304 pool_freeidhashes(pool); /* XXX: should not be here! */
305 pool_freewhatprovides(pool);
306 num = pool->ss.nstrings;
307 pool->whatprovides = whatprovides = sat_calloc((num + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
308 pool->whatprovides_rel = sat_calloc((pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
310 /* count providers for each name */
311 for (i = 1; i < pool->nsolvables; i++)
314 s = pool->solvables + i;
317 if (!pool_installable(pool, s))
319 pp = s->repo->idarraydata + s->provides;
320 while ((id = *pp++) != ID_NULL)
324 Reldep *rd = GETRELDEP(pool, id);
327 whatprovides[id]++; /* inc count of providers */
331 off = 2; /* first entry is undef, second is empty list */
333 np = 0; /* number of names provided */
334 for (i = 0; i < num; i++, idp++)
337 if (!n) /* no providers */
339 *idp = off; /* move from counts to offsets into whatprovidesdata */
340 off += n + 1; /* make space for all providers + terminating ID_NULL */
341 np++; /* inc # of provider 'slots' */
344 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
346 /* reserve some space for relation data */
347 extra = 2 * pool->nrels;
351 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
353 /* alloc space for all providers + extra */
354 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
356 /* now fill data for all provides */
357 for (i = 1; i < pool->nsolvables; i++)
360 s = pool->solvables + i;
363 if (!pool_installable(pool, s))
366 /* for all provides of this solvable */
367 pp = s->repo->idarraydata + s->provides;
368 while ((id = *pp++) != 0)
372 Reldep *rd = GETRELDEP(pool, id);
375 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
379 while (*d) /* find free slot */
384 *d = i; /* put solvable Id into data */
387 pool->whatprovidesdata = whatprovidesdata;
388 pool->whatprovidesdataoff = off;
389 pool->whatprovidesdataleft = extra;
390 pool_shrink_whatprovides(pool);
394 * free all of our whatprovides data
395 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
398 pool_freewhatprovides(Pool *pool)
400 pool->whatprovides = sat_free(pool->whatprovides);
401 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
402 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
403 pool->whatprovidesdataoff = 0;
404 pool->whatprovidesdataleft = 0;
408 /******************************************************************************/
411 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
413 * on-demand filling of provider information
414 * move queue data into whatprovidesdata
416 * returns: Offset into whatprovides
420 pool_queuetowhatprovides(Pool *pool, Queue *q)
423 int count = q->count;
425 if (count == 0) /* queue empty -> ID_EMPTY */
428 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
429 if (pool->whatprovidesdataleft < count + 1)
431 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
432 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
433 pool->whatprovidesdataleft = count + 4096;
436 /* copy queue to next free slot */
437 off = pool->whatprovidesdataoff;
438 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
440 /* adapt count and ID_NULL-terminate */
441 pool->whatprovidesdataoff += count;
442 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
443 pool->whatprovidesdataleft -= count + 1;
449 /*************************************************************************/
454 * add packages fulfilling the relation to whatprovides array
455 * no exact providers, do range match
460 pool_addrelproviders(Pool *pool, Id d)
462 Reldep *rd = GETRELDEP(pool, d);
468 int flags = rd->flags;
470 Id p, *pp, *pp2, *pp3;
473 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
478 pp = pool_whatprovides(pool, name);
479 pp2 = pool_whatprovides(pool, evr);
480 while ((p = *pp++) != 0)
482 for (pp3 = pp2; *pp3;)
485 queue_push(&plist, p);
491 pp = pool_whatprovides(pool, name);
492 while ((p = *pp++) != 0)
493 queue_push(&plist, p);
494 pp = pool_whatprovides(pool, evr);
495 while ((p = *pp++) != 0)
496 queue_pushunique(&plist, p);
499 if (pool->nscallback)
501 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
505 pool->whatprovides_rel[d] = p;
506 return pool->whatprovidesdata + p;
509 queue_push(&plist, SYSTEMSOLVABLE);
516 /* convert to whatprovides id */
518 POOL_DEBUG(DEBUG_1, "addrelproviders: what provides %s?\n", id2str(pool, name));
520 if (flags && flags < 8)
522 FOR_PROVIDES(p, pp, name)
525 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
527 /* solvable p provides name in some rels */
528 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
529 while ((pid = *pidp++) != 0)
536 #ifdef DEBIAN_SEMANTICS
537 continue; /* unversioned provides can
538 * never match versioned deps */
540 break; /* yes, provides all versions */
544 continue; /* wrong provides name */
545 prd = GETRELDEP(pool, pid);
546 if (prd->name != name)
547 continue; /* wrong provides name */
548 /* right package, both deps are rels */
552 if (flags == 7 || pflags == 7)
553 break; /* included */
554 if ((pflags & flags & 5) != 0)
555 break; /* same direction, match */
559 if ((pflags & flags & 2) != 0)
560 break; /* both have =, match */
564 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
565 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
570 continue; /* no rel match */
571 queue_push(&plist, p);
573 /* make our system solvable provide all unknown rpmlib() stuff */
574 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
575 queue_push(&plist, SYSTEMSOLVABLE);
577 /* add providers to whatprovides */
579 POOL_DEBUG(DEBUG_1, "addrelproviders: adding %d packages to %d\n", plist.count, d);
581 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
584 return pool->whatprovidesdata + pool->whatprovides_rel[d];
587 /*************************************************************************/
590 pool_debug(Pool *pool, int type, const char *format, ...)
595 if ((type & SAT_FATAL) == 0)
597 if ((pool->debugmask & type) == 0)
600 va_start(args, format);
601 if (!pool->debugcallback)
603 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
604 vprintf(format, args);
606 vfprintf(stderr, format, args);
609 vsnprintf(buf, sizeof(buf), format, args);
610 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
614 pool_setdebuglevel(Pool *pool, int level)
616 int mask = SAT_DEBUG_RESULT;
618 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
620 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
622 mask |= SAT_DEBUG_PROPAGATE;
624 mask |= SAT_DEBUG_RULE_CREATION;
626 mask |= SAT_DEBUG_SCHUBI;
627 pool->debugmask = mask;
630 /*************************************************************************/
637 #define SEARCHFILES_BLOCK 127
640 pool_addfileprovides_dep(Pool *pool, Id *ida, Map *seen, struct searchfiles *sf)
645 while ((dep = *ida++) != 0)
647 while (ISRELDEP(dep))
650 sid = pool->ss.nstrings + GETRELID(dep);
651 if (MAPTST(seen, sid))
657 rd = GETRELDEP(pool, dep);
660 else if (rd->flags == REL_NAMESPACE)
662 if (rd->name == NAMESPACE_INSTALLED)
664 dep = 0; /* for now */
674 pool_addfileprovides_dep(pool, ids, seen, sf);
680 if (MAPTST(seen, dep))
683 s = id2str(pool, dep);
686 if ((sf->nfiles & SEARCHFILES_BLOCK) == 0)
687 sf->files = sat_realloc2(sf->files, sf->nfiles + (SEARCHFILES_BLOCK + 1), sizeof(const char *));
688 sf->files[sf->nfiles++] = strdup(s);
694 addfileprovides_cb(void *data, Solvable *s, Id key, const char *str)
696 Pool *pool = s->repo->pool;
698 id = str2id(pool, str, 0);
700 return 0; /* can't happen */
701 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
707 pool_addfileprovides(Pool *pool)
712 struct searchfiles sf;
715 map_init(&seen, pool->ss.nstrings + pool->nrels);
716 memset(&sf, 0, sizeof(sf));
718 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
724 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &seen, &sf);
726 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &seen, &sf);
728 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &seen, &sf);
730 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &seen, &sf);
732 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &seen, &sf);
734 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &seen, &sf);
736 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &seen, &sf);
738 pool_addfileprovides_dep(pool, repo->idarraydata + s->freshens, &seen, &sf);
741 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
745 for (i = 0; i < sf.nfiles; i++)
746 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", sf.files[i]);
748 if ((sf.nfiles & SEARCHFILES_BLOCK) == 0)
749 sf.files = sat_realloc2(sf.files, sf.nfiles + (SEARCHFILES_BLOCK + 1), sizeof(const char *));
750 sf.files[sf.nfiles++] = 0;
752 pool_search(0, SOLVABLE_FILELIST, (const char *)sf.files, SEARCH_STRING|SEARCH_MULTIPLE, addfileprovides_cb, 0);
755 pool_freewhatprovides(pool); /* as we have added provides */