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"
29 #define SOLVABLE_BLOCK 255
32 // list of string constants, so we can do pointer/Id instead of string comparison
33 // index into array matches ID_xxx constants in pool.h
35 static const char *initpool_data[] = {
46 "solvable:recommends",
48 "solvable:supplements",
51 "rpm:dbid", /* direct key into rpmdb */
52 "solvable:prereqmarker",
53 "solvable:filemarker",
54 "namespace:installed",
73 pool = (Pool *)xcalloc(1, sizeof(*pool));
75 stringpool_init (&pool->ss, initpool_data);
77 // pre-alloc space for a RelDep
78 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
81 // pre-alloc space for a Solvable
82 pool->solvables = (Solvable *)xcalloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
84 queue_init(&pool->vendormap);
85 s = pool->solvables + SYSTEMSOLVABLE;
86 s->name = SYSTEM_SYSTEM;
87 s->arch = ARCH_NOARCH;
90 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
95 /* free all the resources of our pool */
101 pool_freewhatprovides(pool);
102 pool_freeidhashes(pool);
103 repo_freeallrepos(pool, 1);
104 xfree(pool->id2arch);
105 xfree(pool->solvables);
106 xfree(pool->ss.stringspace);
107 xfree(pool->ss.strings);
109 queue_free(&pool->vendormap);
110 for (i = 0; i < DEP2STRBUF; i++)
111 xfree(pool->dep2strbuf[i]);
116 pool_add_solvable(Pool *pool)
118 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
119 pool->solvables = xrealloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
120 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
121 return pool->nsolvables++;
125 pool_add_solvable_block(Pool *pool, int count)
127 Id nsolvables = pool->nsolvables;
130 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
131 pool->solvables = xrealloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
132 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
133 pool->nsolvables += count;
138 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
142 if (reuseids && start + count == pool->nsolvables)
144 /* might want to shrink solvable array */
145 pool->nsolvables = start;
148 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
153 solvable2str(Pool *pool, Solvable *s)
155 int l, nn = pool->dep2strn;
156 const char *n, *e, *a;
157 n = id2str(pool, s->name);
158 e = id2str(pool, s->evr);
159 a = id2str(pool, s->arch);
160 l = strlen(n) + strlen(e) + strlen(a) + 3;
161 if (l > pool->dep2strlen[nn])
163 pool->dep2strbuf[nn] = xrealloc(pool->dep2strbuf[nn], l + 32);
164 pool->dep2strlen[nn] = l + 32;
166 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
167 pool->dep2strn = (nn + 1) % DEP2STRBUF;
168 return pool->dep2strbuf[nn];
171 static Pool *pool_shrink_whatprovides_sortcmp_data;
174 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
177 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
179 oa = pool->whatprovides[*(Id *)ap];
180 ob = pool->whatprovides[*(Id *)bp];
182 return *(Id *)ap - *(Id *)bp;
187 da = pool->whatprovidesdata + oa;
188 db = pool->whatprovidesdata + ob;
190 if ((r = (*da++ - *db++)) != 0)
194 return *(Id *)ap - *(Id *)bp;
198 * pool_shrink_whatprovides - unify whatprovides data
200 * whatprovides_rel must be empty for this to work!
204 pool_shrink_whatprovides(Pool *pool)
208 Id lastid, *last, *dp, *lp;
212 if (pool->ss.nstrings < 3)
214 sorted = xmalloc2(pool->ss.nstrings, sizeof(Id));
215 for (id = 0; id < pool->ss.nstrings; id++)
217 pool_shrink_whatprovides_sortcmp_data = pool;
218 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
221 for (i = 1; i < pool->ss.nstrings; i++)
224 o = pool->whatprovides[id];
225 if (o == 0 || o == 1)
227 dp = pool->whatprovidesdata + o;
241 pool->whatprovides[id] = -lastid;
245 last = pool->whatprovidesdata + o;
249 dp = pool->whatprovidesdata + 2;
250 for (id = 1; id < pool->ss.nstrings; id++)
252 o = pool->whatprovides[id];
253 if (o == 0 || o == 1)
260 pool->whatprovides[id] = pool->whatprovides[i];
263 lp = pool->whatprovidesdata + o;
266 pool->whatprovides[id] = dp - pool->whatprovidesdata;
267 while ((*dp++ = *lp++) != 0)
270 o = dp - pool->whatprovidesdata;
271 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
272 if (pool->whatprovidesdataoff == o)
274 r = pool->whatprovidesdataoff - o;
275 pool->whatprovidesdataoff = o;
276 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
277 if (r > pool->whatprovidesdataleft)
278 r = pool->whatprovidesdataleft;
279 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
284 * pool_createwhatprovides()
286 * create hashes over pool of solvables to ease provide lookups
290 pool_createwhatprovides(Pool *pool)
292 int i, num, np, extra;
297 Offset *whatprovides;
298 Id *whatprovidesdata, *d;
300 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
301 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
303 pool_freeidhashes(pool); /* XXX: should not be here! */
304 pool_freewhatprovides(pool);
305 num = pool->ss.nstrings;
306 pool->whatprovides = whatprovides = (Offset *)xcalloc((num + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
307 pool->whatprovides_rel = (Offset *)xcalloc((pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
309 /* count providers for each name */
310 for (i = 1; i < pool->nsolvables; i++)
313 s = pool->solvables + i;
316 if (!pool_installable(pool, s))
318 pp = s->repo->idarraydata + s->provides;
319 while ((id = *pp++) != ID_NULL)
323 Reldep *rd = GETRELDEP(pool, id);
326 whatprovides[id]++; /* inc count of providers */
330 off = 2; /* first entry is undef, second is empty list */
332 np = 0; /* number of names provided */
333 for (i = 0; i < num; i++, idp++)
336 if (!n) /* no providers */
338 *idp = off; /* move from counts to offsets into whatprovidesdata */
339 off += n + 1; /* make space for all providers + terminating ID_NULL */
340 np++; /* inc # of provider 'slots' */
343 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
345 /* reserve some space for relation data */
346 extra = 2 * pool->nrels;
350 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
352 /* alloc space for all providers + extra */
353 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
355 /* now fill data for all provides */
356 for (i = 1; i < pool->nsolvables; i++)
359 s = pool->solvables + i;
362 if (!pool_installable(pool, s))
365 /* for all provides of this solvable */
366 pp = s->repo->idarraydata + s->provides;
367 while ((id = *pp++) != 0)
371 Reldep *rd = GETRELDEP(pool, id);
374 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
378 while (*d) /* find free slot */
383 *d = i; /* put solvable Id into data */
386 pool->whatprovidesdata = whatprovidesdata;
387 pool->whatprovidesdataoff = off;
388 pool->whatprovidesdataleft = extra;
389 pool_shrink_whatprovides(pool);
393 * free all of our whatprovides data
394 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
397 pool_freewhatprovides(Pool *pool)
399 pool->whatprovides = xfree(pool->whatprovides);
400 pool->whatprovides_rel = xfree(pool->whatprovides_rel);
401 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
402 pool->whatprovidesdataoff = 0;
403 pool->whatprovidesdataleft = 0;
407 /******************************************************************************/
410 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
412 * on-demand filling of provider information
413 * move queue data into whatprovidesdata
415 * returns: Offset into whatprovides
419 pool_queuetowhatprovides(Pool *pool, Queue *q)
422 int count = q->count;
424 if (count == 0) /* queue empty -> ID_EMPTY */
427 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
428 if (pool->whatprovidesdataleft < count + 1)
430 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
431 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
432 pool->whatprovidesdataleft = count + 4096;
435 /* copy queue to next free slot */
436 off = pool->whatprovidesdataoff;
437 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
439 /* adapt count and ID_NULL-terminate */
440 pool->whatprovidesdataoff += count;
441 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
442 pool->whatprovidesdataleft -= count + 1;
448 /*************************************************************************/
453 * add packages fulfilling the relation to whatprovides array
454 * no exact providers, do range match
459 pool_addrelproviders(Pool *pool, Id d)
461 Reldep *rd = GETRELDEP(pool, d);
467 int flags = rd->flags;
469 Id p, *pp, *pp2, *pp3;
472 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
477 pp = pool_whatprovides(pool, name);
478 pp2 = pool_whatprovides(pool, evr);
479 while ((p = *pp++) != 0)
481 for (pp3 = pp2; *pp3;)
484 queue_push(&plist, p);
490 pp = pool_whatprovides(pool, name);
491 while ((p = *pp++) != 0)
492 queue_push(&plist, p);
493 pp = pool_whatprovides(pool, evr);
494 while ((p = *pp++) != 0)
495 queue_pushunique(&plist, p);
498 if (pool->nscallback)
500 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
504 pool->whatprovides_rel[d] = p;
505 return pool->whatprovidesdata + p;
508 queue_push(&plist, SYSTEMSOLVABLE);
515 /* convert to whatprovides id */
517 POOL_DEBUG(DEBUG_1, "addrelproviders: what provides %s?\n", id2str(pool, name));
519 if (flags && flags < 8)
521 FOR_PROVIDES(p, pp, name)
524 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
526 /* solvable p provides name in some rels */
527 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
528 while ((pid = *pidp++) != 0)
535 #ifdef DEBIAN_SEMANTICS
536 continue; /* unversioned provides can
537 * never match versioned deps */
539 break; /* yes, provides all versions */
543 continue; /* wrong provides name */
544 prd = GETRELDEP(pool, pid);
545 if (prd->name != name)
546 continue; /* wrong provides name */
547 /* right package, both deps are rels */
551 if (flags == 7 || pflags == 7)
552 break; /* included */
553 if ((pflags & flags & 5) != 0)
554 break; /* same direction, match */
558 if ((pflags & flags & 2) != 0)
559 break; /* both have =, match */
563 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
564 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
569 continue; /* no rel match */
570 queue_push(&plist, p);
572 /* make our system solvable provide all unknown rpmlib() stuff */
573 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
574 queue_push(&plist, SYSTEMSOLVABLE);
576 /* add providers to whatprovides */
578 POOL_DEBUG(DEBUG_1, "addrelproviders: adding %d packages to %d\n", plist.count, d);
580 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
583 return pool->whatprovidesdata + pool->whatprovides_rel[d];
586 /*************************************************************************/
589 pool_debug(Pool *pool, int type, const char *format, ...)
594 if ((type & SAT_FATAL) == 0)
596 if ((pool->debugmask & type) == 0)
599 va_start(args, format);
600 if (!pool->debugcallback)
602 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
603 vprintf(format, args);
605 vfprintf(stderr, format, args);
608 vsnprintf(buf, sizeof(buf), format, args);
609 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
613 pool_setdebuglevel(Pool *pool, int level)
615 int mask = SAT_DEBUG_RESULT;
617 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
619 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
621 mask |= SAT_DEBUG_PROPAGATE;
623 mask |= SAT_DEBUG_RULE_CREATION;
625 mask |= SAT_DEBUG_SCHUBI;
626 pool->debugmask = mask;