4 * The pool contains information about solvables
5 * stored optimized for memory consumption and fast retrieval.
15 #include "poolid_private.h"
21 // reset all whatprovides
24 pool_freewhatprovides(Pool *pool)
26 pool->whatprovides = xfree(pool->whatprovides);
27 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
28 pool->whatprovidesdataoff = 0;
29 pool->whatprovidesdataleft = 0;
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 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",
67 int count, totalsize = 0;
71 pool = (Pool *)xcalloc(1, sizeof(*pool));
73 // count number and total size of predefined strings
74 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
75 totalsize += strlen(initpool_data[count]) + 1;
77 // alloc appropriate space
78 pool->stringspace = (char *)xmalloc((totalsize + STRINGSPACE_BLOCK) & ~STRINGSPACE_BLOCK);
79 pool->strings = (Offset *)xmalloc(((count + STRING_BLOCK) & ~STRING_BLOCK) * sizeof(Offset));
81 // now copy predefined strings into allocated space
83 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
85 strcpy(pool->stringspace + pool->sstrings, initpool_data[count]);
86 pool->strings[count] = pool->sstrings;
87 pool->sstrings += strlen(initpool_data[count]) + 1;
89 pool->nstrings = count;
91 // pre-alloc space for a RelDep
92 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
95 // pre-alloc space for a Solvable
96 pool->solvables = (Solvable *)xcalloc(2, sizeof(Solvable));
98 s = pool->solvables + SYSTEMSOLVABLE;
99 s->name = SYSTEM_SYSTEM;
100 s->arch = ARCH_NOARCH;
109 pool_free(Pool *pool)
114 pool_freewhatprovides(pool);
115 pool_freeidhashes(pool);
116 for (i = 0; i < pool->nsources; i++)
118 source = pool->sources[i];
119 xfree(source->idarraydata);
120 xfree(source->rpmdbid);
123 xfree(pool->id2arch);
124 xfree(pool->solvables);
125 xfree(pool->sources);
126 xfree(pool->stringspace);
127 xfree(pool->strings);
133 static Pool *pool_shrink_whatprovides_sortcmp_data;
136 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
139 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
141 oa = pool->whatprovides[*(Id *)ap];
142 ob = pool->whatprovides[*(Id *)bp];
144 return *(Id *)ap - *(Id *)bp;
149 da = pool->whatprovidesdata + oa;
150 db = pool->whatprovidesdata + ob;
152 if ((r = (*da++ - *db++)) != 0)
156 return *(Id *)ap - *(Id *)bp;
160 pool_shrink_whatprovides(Pool *pool)
164 Id lastid, *last, *dp, *lp;
168 if (pool->nstrings < 3)
170 sorted = xmalloc2(pool->nstrings, sizeof(Id));
171 for (id = 0; id < pool->nstrings; id++)
173 pool_shrink_whatprovides_sortcmp_data = pool;
174 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
177 for (i = 1; i < pool->nstrings; i++)
180 o = pool->whatprovides[id];
181 if (o == 0 || o == 1)
183 dp = pool->whatprovidesdata + o;
197 pool->whatprovides[id] = -lastid;
201 last = pool->whatprovidesdata + o;
205 dp = pool->whatprovidesdata + 2;
206 for (id = 1; id < pool->nstrings; id++)
208 o = pool->whatprovides[id];
209 if (o == 0 || o == 1)
216 pool->whatprovides[id] = pool->whatprovides[i];
219 lp = pool->whatprovidesdata + o;
222 pool->whatprovides[id] = dp - pool->whatprovidesdata;
223 while ((*dp++ = *lp++) != 0)
226 o = dp - pool->whatprovidesdata;
228 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
229 if (pool->whatprovidesdataoff == o)
231 r = pool->whatprovidesdataoff - o;
232 pool->whatprovidesdataoff = o;
233 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
234 if (r > pool->whatprovidesdataleft)
235 r = pool->whatprovidesdataleft;
236 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
243 * create hashes over complete pool to ease lookups
248 pool_prepare(Pool *pool)
250 int i, num, np, extra;
256 Offset *whatprovides;
257 Id *whatprovidesdata, *d;
260 printf("number of solvables: %d\n", pool->nsolvables);
262 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
264 pool_freeidhashes(pool);
265 pool_freewhatprovides(pool);
266 num = pool->nstrings + pool->nrels;
267 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
269 /* count providers for each name */
270 for (i = 1; i < pool->nsolvables; i++)
273 s = pool->solvables + i;
276 if (!pool_installable(pool, s))
278 pp = s->source->idarraydata + s->provides;
279 while ((id = *pp++) != ID_NULL)
283 Reldep *rd = GETRELDEP(pool, id);
286 whatprovides[id]++; /* inc count of providers */
290 off = 2; /* first entry is undef, second is empty list */
292 np = 0; /* number of names provided */
293 for (i = 0; i < num; i++, idp++)
296 if (!n) /* no providers */
298 *idp = off; /* move from counts to offsets into whatprovidesdata */
299 off += n + 1; /* make space for all providers + terminating ID_NULL */
300 np++; /* inc # of provider 'slots' */
304 printf("provide ids: %d\n", np);
305 extra = 2 * pool->nrels;
311 printf("provide space needed: %d + %d\n", off, extra);
313 /* alloc space for all providers + extra */
314 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
316 /* now fill data for all provides */
317 for (i = 1; i < pool->nsolvables; i++)
320 s = pool->solvables + i;
323 if (!pool_installable(pool, s))
326 /* for all provides of this solvable */
327 pp = s->source->idarraydata + s->provides;
328 while ((id = *pp++) != 0)
332 Reldep *rd = GETRELDEP(pool, id);
335 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
339 while (*d) /* find free slot */
344 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
349 *d = i; /* put solvable Id into data */
352 pool->whatprovides = whatprovides;
353 pool->whatprovidesdata = whatprovidesdata;
354 pool->whatprovidesdataoff = off;
355 pool->whatprovidesdataleft = extra;
356 pool_shrink_whatprovides(pool);
360 /******************************************************************************/
363 * pool_queuetowhatprovides
365 * on-demand filling of provider information
366 * move queue data into whatprovidesdata
368 * returns: Offset into whatprovides
372 pool_queuetowhatprovides(Pool *pool, Queue *q)
375 int count = q->count;
377 if (count == 0) /* queue empty -> ID_EMPTY */
380 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
381 if (pool->whatprovidesdataleft < count + 1)
384 printf("growing provides hash data...\n");
385 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
386 pool->whatprovidesdataleft = count + 4096;
389 /* copy queue to next free slot */
390 off = pool->whatprovidesdataoff;
391 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
393 /* adapt count and ID_NULL-terminate */
394 pool->whatprovidesdataoff += count;
395 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
396 pool->whatprovidesdataleft -= count + 1;
402 /******************************************************************************/
407 * add packages fulfilling the relation to whatprovides array
408 * no exact providers, do range match
413 pool_addrelproviders(Pool *pool, Id d)
415 Reldep *rd = GETRELDEP(pool, d);
421 int flags = rd->flags;
423 Id p, *pp, *pp2, *pp3;
425 d = GETRELID(pool, d);
426 queueinit_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
431 pp = GET_PROVIDESP(name, p);
432 pp2 = GET_PROVIDESP(evr, p);
433 while ((p = *pp++) != 0)
435 for (pp3 = pp2; *pp3;)
438 queuepush(&plist, p);
444 pp = GET_PROVIDESP(name, p);
445 while ((p = *pp++) != 0)
446 queuepush(&plist, p);
447 pp = GET_PROVIDESP(evr, p);
448 while ((p = *pp++) != 0)
449 queuepushunique(&plist, p);
452 if (pool->nscallback)
454 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
458 pool->whatprovides[d] = p;
459 return pool->whatprovidesdata + p;
462 queuepush(&plist, SYSTEMSOLVABLE);
469 /* convert to whatprovides id */
472 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
474 if (flags && flags < 8)
476 FOR_PROVIDES(p, pp, name)
480 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
482 /* solvable p provides name in some rels */
483 pidp = pool->solvables[p].source->idarraydata + pool->solvables[p].provides;
484 while ((pid = *pidp++) != 0)
490 break; /* yes, provides all versions */
492 continue; /* wrong provides name */
493 prd = GETRELDEP(pool, pid);
494 if (prd->name != name)
495 continue; /* wrong provides name */
496 /* right package, both deps are rels */
500 if (flags == 7 || pflags == 7)
501 break; /* included */
502 if ((pflags & flags & 5) != 0)
503 break; /* same direction, match */
507 if ((pflags & flags & 2) != 0)
508 break; /* both have =, match */
512 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
513 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
518 continue; /* no rel match */
519 queuepush(&plist, p);
521 /* make our system solvable provide all unknown rpmlib() stuff */
522 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
523 queuepush(&plist, SYSTEMSOLVABLE);
525 /* add providers to whatprovides */
527 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
529 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
532 return pool->whatprovidesdata + pool->whatprovides[d];