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.
23 #include "poolid_private.h"
27 #include "sat_debug.h"
29 #define SOLVABLE_BLOCK 255
31 // reset all whatprovides
34 pool_freewhatprovides(Pool *pool)
36 pool->whatprovides = xfree(pool->whatprovides);
37 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
38 pool->whatprovidesdataoff = 0;
39 pool->whatprovidesdataleft = 0;
43 // list of string constants, so we can do pointer/Id instead of string comparison
44 // index into array matches ID_xxx constants in pool.h
46 static const char *initpool_data[] = {
57 "solvable:recommends",
59 "solvable:supplements",
62 "rpm:dbid", /* direct key into rpmdb */
63 "solvable:prereqmarker",
64 "solvable:filemarker",
65 "namespace:installed",
82 pool = (Pool *)xcalloc(1, sizeof(*pool));
84 stringpool_init (&pool->ss, initpool_data);
86 // pre-alloc space for a RelDep
87 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
90 // pre-alloc space for a Solvable
91 pool->solvables = (Solvable *)xcalloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
93 queue_init(&pool->vendormap);
94 s = pool->solvables + SYSTEMSOLVABLE;
95 s->name = SYSTEM_SYSTEM;
96 s->arch = ARCH_NOARCH;
105 pool_free(Pool *pool)
109 pool_freewhatprovides(pool);
110 pool_freeidhashes(pool);
111 repo_freeallrepos(pool, 1);
112 xfree(pool->id2arch);
113 xfree(pool->solvables);
114 xfree(pool->ss.stringspace);
115 xfree(pool->ss.strings);
117 queue_free(&pool->vendormap);
118 for (i = 0; i < DEP2STRBUF; i++)
119 xfree(pool->dep2strbuf[i]);
124 pool_add_solvable(Pool *pool)
126 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
127 pool->solvables = xrealloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
128 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
129 return pool->nsolvables++;
133 pool_add_solvable_block(Pool *pool, int count)
135 Id nsolvables = pool->nsolvables;
138 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
139 pool->solvables = xrealloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
140 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
141 pool->nsolvables += count;
146 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
150 if (reuseids && start + count == pool->nsolvables)
152 /* might want to shrink solvable array */
153 pool->nsolvables = start;
156 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
161 solvable2str(Pool *pool, Solvable *s)
163 int l, nn = pool->dep2strn;
164 const char *n, *e, *a;
165 n = id2str(pool, s->name);
166 e = id2str(pool, s->evr);
167 a = id2str(pool, s->arch);
168 l = strlen(n) + strlen(e) + strlen(a) + 3;
169 if (l > pool->dep2strlen[nn])
171 pool->dep2strbuf[nn] = xrealloc(pool->dep2strbuf[nn], l + 32);
172 pool->dep2strlen[nn] = l + 32;
174 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
175 pool->dep2strn = (nn + 1) % DEP2STRBUF;
176 return pool->dep2strbuf[nn];
179 static Pool *pool_shrink_whatprovides_sortcmp_data;
182 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
185 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
187 oa = pool->whatprovides[*(Id *)ap];
188 ob = pool->whatprovides[*(Id *)bp];
190 return *(Id *)ap - *(Id *)bp;
195 da = pool->whatprovidesdata + oa;
196 db = pool->whatprovidesdata + ob;
198 if ((r = (*da++ - *db++)) != 0)
202 return *(Id *)ap - *(Id *)bp;
206 pool_shrink_whatprovides(Pool *pool)
210 Id lastid, *last, *dp, *lp;
214 if (pool->ss.nstrings < 3)
216 sorted = xmalloc2(pool->ss.nstrings, sizeof(Id));
217 for (id = 0; id < pool->ss.nstrings; id++)
219 pool_shrink_whatprovides_sortcmp_data = pool;
220 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
223 for (i = 1; i < pool->ss.nstrings; i++)
226 o = pool->whatprovides[id];
227 if (o == 0 || o == 1)
229 dp = pool->whatprovidesdata + o;
243 pool->whatprovides[id] = -lastid;
247 last = pool->whatprovidesdata + o;
251 dp = pool->whatprovidesdata + 2;
252 for (id = 1; id < pool->ss.nstrings; id++)
254 o = pool->whatprovides[id];
255 if (o == 0 || o == 1)
262 pool->whatprovides[id] = pool->whatprovides[i];
265 lp = pool->whatprovidesdata + o;
268 pool->whatprovides[id] = dp - pool->whatprovidesdata;
269 while ((*dp++ = *lp++) != 0)
272 o = dp - pool->whatprovidesdata;
273 sat_debug (DEBUG_1, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
274 if (pool->whatprovidesdataoff == o)
276 r = pool->whatprovidesdataoff - o;
277 pool->whatprovidesdataoff = o;
278 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
279 if (r > pool->whatprovidesdataleft)
280 r = pool->whatprovidesdataleft;
281 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
286 * pool_createwhatprovides()
288 * create hashes over complete pool to ease lookups
293 pool_createwhatprovides(Pool *pool)
295 int i, num, np, extra;
300 Offset *whatprovides;
301 Id *whatprovidesdata, *d;
303 sat_debug (DEBUG_1,"number of solvables: %d\n", pool->nsolvables);
304 sat_debug (DEBUG_1,"number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
306 pool_freeidhashes(pool);
307 pool_freewhatprovides(pool);
308 num = pool->ss.nstrings + pool->nrels;
309 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
311 /* count providers for each name */
312 for (i = 1; i < pool->nsolvables; i++)
315 s = pool->solvables + i;
318 if (!pool_installable(pool, s))
320 pp = s->repo->idarraydata + s->provides;
321 while ((id = *pp++) != ID_NULL)
325 Reldep *rd = GETRELDEP(pool, id);
328 whatprovides[id]++; /* inc count of providers */
332 off = 2; /* first entry is undef, second is empty list */
334 np = 0; /* number of names provided */
335 for (i = 0; i < num; i++, idp++)
338 if (!n) /* no providers */
340 *idp = off; /* move from counts to offsets into whatprovidesdata */
341 off += n + 1; /* make space for all providers + terminating ID_NULL */
342 np++; /* inc # of provider 'slots' */
345 sat_debug (DEBUG_1, "provide ids: %d\n", np);
346 extra = 2 * pool->nrels;
351 sat_debug (DEBUG_1, "provide space needed: %d + %d\n", off, extra);
353 /* alloc space for all providers + extra */
354 whatprovidesdata = (Id *)xcalloc(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 sat_debug (DEBUG_4, "duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
389 *d = i; /* put solvable Id into data */
392 pool->whatprovides = whatprovides;
393 pool->whatprovidesdata = whatprovidesdata;
394 pool->whatprovidesdataoff = off;
395 pool->whatprovidesdataleft = extra;
396 pool_shrink_whatprovides(pool);
400 /******************************************************************************/
403 * pool_queuetowhatprovides
405 * on-demand filling of provider information
406 * move queue data into whatprovidesdata
408 * returns: Offset into whatprovides
412 pool_queuetowhatprovides(Pool *pool, Queue *q)
415 int count = q->count;
417 if (count == 0) /* queue empty -> ID_EMPTY */
420 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
421 if (pool->whatprovidesdataleft < count + 1)
423 sat_debug (DEBUG_1, "growing provides hash data...\n");
424 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
425 pool->whatprovidesdataleft = count + 4096;
428 /* copy queue to next free slot */
429 off = pool->whatprovidesdataoff;
430 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
432 /* adapt count and ID_NULL-terminate */
433 pool->whatprovidesdataoff += count;
434 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
435 pool->whatprovidesdataleft -= count + 1;
441 /******************************************************************************/
446 * add packages fulfilling the relation to whatprovides array
447 * no exact providers, do range match
452 pool_addrelproviders(Pool *pool, Id d)
454 Reldep *rd = GETRELDEP(pool, d);
460 int flags = rd->flags;
462 Id p, *pp, *pp2, *pp3;
464 d = GETRELID(pool, d);
465 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
470 pp = pool_whatprovides(pool, name);
471 pp2 = pool_whatprovides(pool, evr);
472 while ((p = *pp++) != 0)
474 for (pp3 = pp2; *pp3;)
477 queue_push(&plist, p);
483 pp = pool_whatprovides(pool, name);
484 while ((p = *pp++) != 0)
485 queue_push(&plist, p);
486 pp = pool_whatprovides(pool, evr);
487 while ((p = *pp++) != 0)
488 queue_pushunique(&plist, p);
491 if (pool->nscallback)
493 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
497 pool->whatprovides[d] = p;
498 return pool->whatprovidesdata + p;
501 queue_push(&plist, SYSTEMSOLVABLE);
508 /* convert to whatprovides id */
510 sat_debug (DEBUG_1, "addrelproviders: what provides %s?\n", id2str(pool, name));
512 if (flags && flags < 8)
514 FOR_PROVIDES(p, pp, name)
517 sat_debug (DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
519 /* solvable p provides name in some rels */
520 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
521 while ((pid = *pidp++) != 0)
527 break; /* yes, provides all versions */
529 continue; /* wrong provides name */
530 prd = GETRELDEP(pool, pid);
531 if (prd->name != name)
532 continue; /* wrong provides name */
533 /* right package, both deps are rels */
537 if (flags == 7 || pflags == 7)
538 break; /* included */
539 if ((pflags & flags & 5) != 0)
540 break; /* same direction, match */
544 if ((pflags & flags & 2) != 0)
545 break; /* both have =, match */
549 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
550 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
555 continue; /* no rel match */
556 queue_push(&plist, p);
558 /* make our system solvable provide all unknown rpmlib() stuff */
559 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
560 queue_push(&plist, SYSTEMSOLVABLE);
562 /* add providers to whatprovides */
564 sat_debug (DEBUG_1, "addrelproviders: adding %d packages to %d\n", plist.count, d);
566 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
569 return pool->whatprovidesdata + pool->whatprovides[d];