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",
70 pool = (Pool *)xcalloc(1, sizeof(*pool));
72 stringpool_init (&pool->ss, initpool_data);
74 // pre-alloc space for a RelDep
75 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
78 // pre-alloc space for a Solvable
79 pool->solvables = (Solvable *)xcalloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
81 queue_init(&pool->vendormap);
82 s = pool->solvables + SYSTEMSOLVABLE;
83 s->name = SYSTEM_SYSTEM;
84 s->arch = ARCH_NOARCH;
87 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
92 /* free all the resources of our pool */
98 pool_freewhatprovides(pool);
99 pool_freeidhashes(pool);
100 repo_freeallrepos(pool, 1);
101 xfree(pool->id2arch);
102 xfree(pool->solvables);
103 xfree(pool->ss.stringspace);
104 xfree(pool->ss.strings);
106 queue_free(&pool->vendormap);
107 for (i = 0; i < DEP2STRBUF; i++)
108 xfree(pool->dep2strbuf[i]);
113 pool_add_solvable(Pool *pool)
115 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
116 pool->solvables = xrealloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
117 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
118 return pool->nsolvables++;
122 pool_add_solvable_block(Pool *pool, int count)
124 Id nsolvables = pool->nsolvables;
127 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
128 pool->solvables = xrealloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
129 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
130 pool->nsolvables += count;
135 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
139 if (reuseids && start + count == pool->nsolvables)
141 /* might want to shrink solvable array */
142 pool->nsolvables = start;
145 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
150 solvable2str(Pool *pool, Solvable *s)
152 int l, nn = pool->dep2strn;
153 const char *n, *e, *a;
154 n = id2str(pool, s->name);
155 e = id2str(pool, s->evr);
156 a = id2str(pool, s->arch);
157 l = strlen(n) + strlen(e) + strlen(a) + 3;
158 if (l > pool->dep2strlen[nn])
160 pool->dep2strbuf[nn] = xrealloc(pool->dep2strbuf[nn], l + 32);
161 pool->dep2strlen[nn] = l + 32;
163 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
164 pool->dep2strn = (nn + 1) % DEP2STRBUF;
165 return pool->dep2strbuf[nn];
168 static Pool *pool_shrink_whatprovides_sortcmp_data;
171 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
174 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
176 oa = pool->whatprovides[*(Id *)ap];
177 ob = pool->whatprovides[*(Id *)bp];
179 return *(Id *)ap - *(Id *)bp;
184 da = pool->whatprovidesdata + oa;
185 db = pool->whatprovidesdata + ob;
187 if ((r = (*da++ - *db++)) != 0)
191 return *(Id *)ap - *(Id *)bp;
195 * pool_shrink_whatprovides - unify whatprovides data
197 * whatprovides_rel must be empty for this to work!
201 pool_shrink_whatprovides(Pool *pool)
205 Id lastid, *last, *dp, *lp;
209 if (pool->ss.nstrings < 3)
211 sorted = xmalloc2(pool->ss.nstrings, sizeof(Id));
212 for (id = 0; id < pool->ss.nstrings; id++)
214 pool_shrink_whatprovides_sortcmp_data = pool;
215 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
218 for (i = 1; i < pool->ss.nstrings; i++)
221 o = pool->whatprovides[id];
222 if (o == 0 || o == 1)
224 dp = pool->whatprovidesdata + o;
238 pool->whatprovides[id] = -lastid;
242 last = pool->whatprovidesdata + o;
246 dp = pool->whatprovidesdata + 2;
247 for (id = 1; id < pool->ss.nstrings; id++)
249 o = pool->whatprovides[id];
250 if (o == 0 || o == 1)
257 pool->whatprovides[id] = pool->whatprovides[i];
260 lp = pool->whatprovidesdata + o;
263 pool->whatprovides[id] = dp - pool->whatprovidesdata;
264 while ((*dp++ = *lp++) != 0)
267 o = dp - pool->whatprovidesdata;
268 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
269 if (pool->whatprovidesdataoff == o)
271 r = pool->whatprovidesdataoff - o;
272 pool->whatprovidesdataoff = o;
273 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
274 if (r > pool->whatprovidesdataleft)
275 r = pool->whatprovidesdataleft;
276 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
281 * pool_createwhatprovides()
283 * create hashes over pool of solvables to ease provide lookups
287 pool_createwhatprovides(Pool *pool)
289 int i, num, np, extra;
294 Offset *whatprovides;
295 Id *whatprovidesdata, *d;
297 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
298 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
300 pool_freeidhashes(pool); /* XXX: should not be here! */
301 pool_freewhatprovides(pool);
302 num = pool->ss.nstrings;
303 pool->whatprovides = whatprovides = (Offset *)xcalloc((num + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
304 pool->whatprovides_rel = (Offset *)xcalloc((pool->nrels + WHATPROVIDES_BLOCK) & ~WHATPROVIDES_BLOCK, sizeof(Offset));
306 /* count providers for each name */
307 for (i = 1; i < pool->nsolvables; i++)
310 s = pool->solvables + i;
313 if (!pool_installable(pool, s))
315 pp = s->repo->idarraydata + s->provides;
316 while ((id = *pp++) != ID_NULL)
320 Reldep *rd = GETRELDEP(pool, id);
323 whatprovides[id]++; /* inc count of providers */
327 off = 2; /* first entry is undef, second is empty list */
329 np = 0; /* number of names provided */
330 for (i = 0; i < num; i++, idp++)
333 if (!n) /* no providers */
335 *idp = off; /* move from counts to offsets into whatprovidesdata */
336 off += n + 1; /* make space for all providers + terminating ID_NULL */
337 np++; /* inc # of provider 'slots' */
340 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
342 /* reserve some space for relation data */
343 extra = 2 * pool->nrels;
347 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
349 /* alloc space for all providers + extra */
350 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
352 /* now fill data for all provides */
353 for (i = 1; i < pool->nsolvables; i++)
356 s = pool->solvables + i;
359 if (!pool_installable(pool, s))
362 /* for all provides of this solvable */
363 pp = s->repo->idarraydata + s->provides;
364 while ((id = *pp++) != 0)
368 Reldep *rd = GETRELDEP(pool, id);
371 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
375 while (*d) /* find free slot */
380 *d = i; /* put solvable Id into data */
383 pool->whatprovidesdata = whatprovidesdata;
384 pool->whatprovidesdataoff = off;
385 pool->whatprovidesdataleft = extra;
386 pool_shrink_whatprovides(pool);
390 * free all of our whatprovides data
391 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
394 pool_freewhatprovides(Pool *pool)
396 pool->whatprovides = xfree(pool->whatprovides);
397 pool->whatprovides_rel = xfree(pool->whatprovides_rel);
398 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
399 pool->whatprovidesdataoff = 0;
400 pool->whatprovidesdataleft = 0;
404 /******************************************************************************/
407 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
409 * on-demand filling of provider information
410 * move queue data into whatprovidesdata
412 * returns: Offset into whatprovides
416 pool_queuetowhatprovides(Pool *pool, Queue *q)
419 int count = q->count;
421 if (count == 0) /* queue empty -> ID_EMPTY */
424 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
425 if (pool->whatprovidesdataleft < count + 1)
427 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
428 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
429 pool->whatprovidesdataleft = count + 4096;
432 /* copy queue to next free slot */
433 off = pool->whatprovidesdataoff;
434 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
436 /* adapt count and ID_NULL-terminate */
437 pool->whatprovidesdataoff += count;
438 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
439 pool->whatprovidesdataleft -= count + 1;
445 /*************************************************************************/
450 * add packages fulfilling the relation to whatprovides array
451 * no exact providers, do range match
456 pool_addrelproviders(Pool *pool, Id d)
458 Reldep *rd = GETRELDEP(pool, d);
464 int flags = rd->flags;
466 Id p, *pp, *pp2, *pp3;
469 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
474 pp = pool_whatprovides(pool, name);
475 pp2 = pool_whatprovides(pool, evr);
476 while ((p = *pp++) != 0)
478 for (pp3 = pp2; *pp3;)
481 queue_push(&plist, p);
487 pp = pool_whatprovides(pool, name);
488 while ((p = *pp++) != 0)
489 queue_push(&plist, p);
490 pp = pool_whatprovides(pool, evr);
491 while ((p = *pp++) != 0)
492 queue_pushunique(&plist, p);
495 if (pool->nscallback)
497 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
501 pool->whatprovides_rel[d] = p;
502 return pool->whatprovidesdata + p;
505 queue_push(&plist, SYSTEMSOLVABLE);
512 /* convert to whatprovides id */
514 POOL_DEBUG(DEBUG_1, "addrelproviders: what provides %s?\n", id2str(pool, name));
516 if (flags && flags < 8)
518 FOR_PROVIDES(p, pp, name)
521 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
523 /* solvable p provides name in some rels */
524 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
525 while ((pid = *pidp++) != 0)
532 #ifdef DEBIAN_SEMANTICS
533 continue; /* unversioned provides can
534 * never match versioned deps */
536 break; /* yes, provides all versions */
540 continue; /* wrong provides name */
541 prd = GETRELDEP(pool, pid);
542 if (prd->name != name)
543 continue; /* wrong provides name */
544 /* right package, both deps are rels */
548 if (flags == 7 || pflags == 7)
549 break; /* included */
550 if ((pflags & flags & 5) != 0)
551 break; /* same direction, match */
555 if ((pflags & flags & 2) != 0)
556 break; /* both have =, match */
560 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
561 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
566 continue; /* no rel match */
567 queue_push(&plist, p);
569 /* make our system solvable provide all unknown rpmlib() stuff */
570 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
571 queue_push(&plist, SYSTEMSOLVABLE);
573 /* add providers to whatprovides */
575 POOL_DEBUG(DEBUG_1, "addrelproviders: adding %d packages to %d\n", plist.count, d);
577 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
580 return pool->whatprovidesdata + pool->whatprovides_rel[d];
583 /*************************************************************************/
586 pool_debug(Pool *pool, int type, const char *format, ...)
591 if ((type & SAT_FATAL) == 0)
593 if ((pool->debugmask & type) == 0)
596 va_start(args, format);
597 if (!pool->debugcallback)
599 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
600 vprintf(format, args);
602 vfprintf(stderr, format, args);
605 vsnprintf(buf, sizeof(buf), format, args);
606 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
610 pool_setdebuglevel(Pool *pool, int level)
612 int mask = SAT_DEBUG_RESULT;
614 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
616 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
618 mask |= SAT_DEBUG_PROPAGATE;
620 mask |= SAT_DEBUG_RULE_CREATION;
622 mask |= SAT_DEBUG_SCHUBI;
623 pool->debugmask = mask;