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"
28 #define SOLVABLE_BLOCK 255
30 // reset all whatprovides
33 pool_freewhatprovides(Pool *pool)
35 pool->whatprovides = xfree(pool->whatprovides);
36 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
37 pool->whatprovidesdataoff = 0;
38 pool->whatprovidesdataleft = 0;
42 // list of string constants, so we can do pointer/Id instead of string comparison
43 // index into array matches ID_xxx constants in pool.h
45 static const char *initpool_data[] = {
56 "solvable:recommends",
58 "solvable:supplements",
61 "rpm:dbid", /* direct key into rpmdb */
62 "solvable:prereqmarker",
63 "solvable:filemarker",
64 "namespace:installed",
81 pool = (Pool *)xcalloc(1, sizeof(*pool));
83 stringpool_init (&pool->ss, initpool_data);
85 // pre-alloc space for a RelDep
86 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
89 // pre-alloc space for a Solvable
90 pool->solvables = (Solvable *)xcalloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
92 queue_init(&pool->vendormap);
93 s = pool->solvables + SYSTEMSOLVABLE;
94 s->name = SYSTEM_SYSTEM;
95 s->arch = ARCH_NOARCH;
104 pool_free(Pool *pool)
108 pool_freewhatprovides(pool);
109 pool_freeidhashes(pool);
110 pool_freeallrepos(pool, 1);
111 xfree(pool->id2arch);
112 xfree(pool->solvables);
113 xfree(pool->ss.stringspace);
114 xfree(pool->ss.strings);
116 queue_free(&pool->vendormap);
117 for (i = 0; i < DEP2STRBUF; i++)
118 xfree(pool->dep2strbuf[i]);
123 pool_add_solvable(Pool *pool)
125 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
126 pool->solvables = xrealloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
127 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
128 return pool->nsolvables++;
132 pool_add_solvable_block(Pool *pool, int count)
134 Id nsolvables = pool->nsolvables;
137 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
138 pool->solvables = xrealloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
139 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
140 pool->nsolvables += count;
145 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
149 if (reuseids && start + count == pool->nsolvables)
151 /* might want to shrink solvable array */
152 pool->nsolvables = start;
155 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
158 static Pool *pool_shrink_whatprovides_sortcmp_data;
161 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
164 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
166 oa = pool->whatprovides[*(Id *)ap];
167 ob = pool->whatprovides[*(Id *)bp];
169 return *(Id *)ap - *(Id *)bp;
174 da = pool->whatprovidesdata + oa;
175 db = pool->whatprovidesdata + ob;
177 if ((r = (*da++ - *db++)) != 0)
181 return *(Id *)ap - *(Id *)bp;
185 pool_shrink_whatprovides(Pool *pool)
189 Id lastid, *last, *dp, *lp;
193 if (pool->ss.nstrings < 3)
195 sorted = xmalloc2(pool->ss.nstrings, sizeof(Id));
196 for (id = 0; id < pool->ss.nstrings; id++)
198 pool_shrink_whatprovides_sortcmp_data = pool;
199 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
202 for (i = 1; i < pool->ss.nstrings; i++)
205 o = pool->whatprovides[id];
206 if (o == 0 || o == 1)
208 dp = pool->whatprovidesdata + o;
222 pool->whatprovides[id] = -lastid;
226 last = pool->whatprovidesdata + o;
230 dp = pool->whatprovidesdata + 2;
231 for (id = 1; id < pool->ss.nstrings; id++)
233 o = pool->whatprovides[id];
234 if (o == 0 || o == 1)
241 pool->whatprovides[id] = pool->whatprovides[i];
244 lp = pool->whatprovidesdata + o;
247 pool->whatprovides[id] = dp - pool->whatprovidesdata;
248 while ((*dp++ = *lp++) != 0)
251 o = dp - pool->whatprovidesdata;
253 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
254 if (pool->whatprovidesdataoff == o)
256 r = pool->whatprovidesdataoff - o;
257 pool->whatprovidesdataoff = o;
258 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
259 if (r > pool->whatprovidesdataleft)
260 r = pool->whatprovidesdataleft;
261 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
268 * create hashes over complete pool to ease lookups
273 pool_prepare(Pool *pool)
275 int i, num, np, extra;
280 Offset *whatprovides;
281 Id *whatprovidesdata, *d;
284 printf("number of solvables: %d\n", pool->nsolvables);
286 printf("number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
288 pool_freeidhashes(pool);
289 pool_freewhatprovides(pool);
290 num = pool->ss.nstrings + pool->nrels;
291 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
293 /* count providers for each name */
294 for (i = 1; i < pool->nsolvables; i++)
297 s = pool->solvables + i;
300 if (!pool_installable(pool, s))
302 pp = s->repo->idarraydata + s->provides;
303 while ((id = *pp++) != ID_NULL)
307 Reldep *rd = GETRELDEP(pool, id);
310 whatprovides[id]++; /* inc count of providers */
314 off = 2; /* first entry is undef, second is empty list */
316 np = 0; /* number of names provided */
317 for (i = 0; i < num; i++, idp++)
320 if (!n) /* no providers */
322 *idp = off; /* move from counts to offsets into whatprovidesdata */
323 off += n + 1; /* make space for all providers + terminating ID_NULL */
324 np++; /* inc # of provider 'slots' */
328 printf("provide ids: %d\n", np);
329 extra = 2 * pool->nrels;
335 printf("provide space needed: %d + %d\n", off, extra);
337 /* alloc space for all providers + extra */
338 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
340 /* now fill data for all provides */
341 for (i = 1; i < pool->nsolvables; i++)
344 s = pool->solvables + i;
347 if (!pool_installable(pool, s))
350 /* for all provides of this solvable */
351 pp = s->repo->idarraydata + s->provides;
352 while ((id = *pp++) != 0)
356 Reldep *rd = GETRELDEP(pool, id);
359 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
363 while (*d) /* find free slot */
368 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
373 *d = i; /* put solvable Id into data */
376 pool->whatprovides = whatprovides;
377 pool->whatprovidesdata = whatprovidesdata;
378 pool->whatprovidesdataoff = off;
379 pool->whatprovidesdataleft = extra;
380 pool_shrink_whatprovides(pool);
384 /******************************************************************************/
387 * pool_queuetowhatprovides
389 * on-demand filling of provider information
390 * move queue data into whatprovidesdata
392 * returns: Offset into whatprovides
396 pool_queuetowhatprovides(Pool *pool, Queue *q)
399 int count = q->count;
401 if (count == 0) /* queue empty -> ID_EMPTY */
404 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
405 if (pool->whatprovidesdataleft < count + 1)
408 printf("growing provides hash data...\n");
409 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
410 pool->whatprovidesdataleft = count + 4096;
413 /* copy queue to next free slot */
414 off = pool->whatprovidesdataoff;
415 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
417 /* adapt count and ID_NULL-terminate */
418 pool->whatprovidesdataoff += count;
419 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
420 pool->whatprovidesdataleft -= count + 1;
426 /******************************************************************************/
431 * add packages fulfilling the relation to whatprovides array
432 * no exact providers, do range match
437 pool_addrelproviders(Pool *pool, Id d)
439 Reldep *rd = GETRELDEP(pool, d);
445 int flags = rd->flags;
447 Id p, *pp, *pp2, *pp3;
449 d = GETRELID(pool, d);
450 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
455 pp = GET_PROVIDESP(name, p);
456 pp2 = GET_PROVIDESP(evr, p);
457 while ((p = *pp++) != 0)
459 for (pp3 = pp2; *pp3;)
462 queue_push(&plist, p);
468 pp = GET_PROVIDESP(name, p);
469 while ((p = *pp++) != 0)
470 queue_push(&plist, p);
471 pp = GET_PROVIDESP(evr, p);
472 while ((p = *pp++) != 0)
473 queue_pushunique(&plist, p);
476 if (pool->nscallback)
478 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
482 pool->whatprovides[d] = p;
483 return pool->whatprovidesdata + p;
486 queue_push(&plist, SYSTEMSOLVABLE);
493 /* convert to whatprovides id */
496 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
498 if (flags && flags < 8)
500 FOR_PROVIDES(p, pp, name)
504 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
506 /* solvable p provides name in some rels */
507 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
508 while ((pid = *pidp++) != 0)
514 break; /* yes, provides all versions */
516 continue; /* wrong provides name */
517 prd = GETRELDEP(pool, pid);
518 if (prd->name != name)
519 continue; /* wrong provides name */
520 /* right package, both deps are rels */
524 if (flags == 7 || pflags == 7)
525 break; /* included */
526 if ((pflags & flags & 5) != 0)
527 break; /* same direction, match */
531 if ((pflags & flags & 2) != 0)
532 break; /* both have =, match */
536 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
537 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
542 continue; /* no rel match */
543 queue_push(&plist, p);
545 /* make our system solvable provide all unknown rpmlib() stuff */
546 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
547 queue_push(&plist, SYSTEMSOLVABLE);
549 /* add providers to whatprovides */
551 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
553 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
556 return pool->whatprovidesdata + pool->whatprovides[d];