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->solvables);
124 xfree(pool->sources);
125 xfree(pool->stringspace);
126 xfree(pool->strings);
132 static Pool *pool_shrink_whatprovides_sortcmp_data;
135 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
138 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
140 oa = pool->whatprovides[*(Id *)ap];
141 ob = pool->whatprovides[*(Id *)bp];
143 return *(Id *)ap - *(Id *)bp;
148 da = pool->whatprovidesdata + oa;
149 db = pool->whatprovidesdata + ob;
151 if ((r = (*da++ - *db++)) != 0)
155 return *(Id *)ap - *(Id *)bp;
159 pool_shrink_whatprovides(Pool *pool)
163 Id lastid, *last, *dp, *lp;
167 if (pool->nstrings < 3)
169 sorted = xmalloc2(pool->nstrings, sizeof(Id));
170 for (id = 0; id < pool->nstrings; id++)
172 pool_shrink_whatprovides_sortcmp_data = pool;
173 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
176 for (i = 1; i < pool->nstrings; i++)
179 o = pool->whatprovides[id];
180 if (o == 0 || o == 1)
182 dp = pool->whatprovidesdata + o;
196 pool->whatprovides[id] = -lastid;
200 last = pool->whatprovidesdata + o;
204 dp = pool->whatprovidesdata + 2;
205 for (id = 1; id < pool->nstrings; id++)
207 o = pool->whatprovides[id];
208 if (o == 0 || o == 1)
215 pool->whatprovides[id] = pool->whatprovides[i];
218 lp = pool->whatprovidesdata + o;
221 pool->whatprovides[id] = dp - pool->whatprovidesdata;
222 while ((*dp++ = *lp++) != 0)
225 o = dp - pool->whatprovidesdata;
227 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
228 if (pool->whatprovidesdataoff == o)
230 r = pool->whatprovidesdataoff - o;
231 pool->whatprovidesdataoff = o;
232 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
233 if (r > pool->whatprovidesdataleft)
234 r = pool->whatprovidesdataleft;
235 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
242 * create hashes over complete pool to ease lookups
247 pool_prepare(Pool *pool)
249 int i, num, np, extra;
255 Offset *whatprovides;
256 Id *whatprovidesdata, *d;
259 printf("number of solvables: %d\n", pool->nsolvables);
261 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
263 pool_freeidhashes(pool);
264 pool_freewhatprovides(pool);
265 num = pool->nstrings + pool->nrels;
266 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
268 /* count providers for each name */
269 for (i = 1; i < pool->nsolvables; i++)
272 s = pool->solvables + i;
275 if (!pool_installable(pool, s))
277 pp = s->source->idarraydata + s->provides;
278 while ((id = *pp++) != ID_NULL)
282 Reldep *rd = GETRELDEP(pool, id);
285 whatprovides[id]++; /* inc count of providers */
289 off = 2; /* first entry is undef, second is empty list */
291 np = 0; /* number of names provided */
292 for (i = 0; i < num; i++, idp++)
295 if (!n) /* no providers */
297 *idp = off; /* move from counts to offsets into whatprovidesdata */
298 off += n + 1; /* make space for all providers + terminating ID_NULL */
299 np++; /* inc # of provider 'slots' */
303 printf("provide ids: %d\n", np);
304 extra = 2 * pool->nrels;
310 printf("provide space needed: %d + %d\n", off, extra);
312 /* alloc space for all providers + extra */
313 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
315 /* now fill data for all provides */
316 for (i = 1; i < pool->nsolvables; i++)
319 s = pool->solvables + i;
322 if (!pool_installable(pool, s))
325 /* for all provides of this solvable */
326 pp = s->source->idarraydata + s->provides;
327 while ((id = *pp++) != 0)
331 Reldep *rd = GETRELDEP(pool, id);
334 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
338 while (*d) /* find free slot */
343 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
348 *d = i; /* put solvable Id into data */
351 pool->whatprovides = whatprovides;
352 pool->whatprovidesdata = whatprovidesdata;
353 pool->whatprovidesdataoff = off;
354 pool->whatprovidesdataleft = extra;
355 pool_shrink_whatprovides(pool);
359 /******************************************************************************/
362 * pool_queuetowhatprovides
364 * on-demand filling of provider information
365 * move queue data into whatprovidesdata
367 * returns: Offset into whatprovides
371 pool_queuetowhatprovides(Pool *pool, Queue *q)
374 int count = q->count;
376 if (count == 0) /* queue empty -> ID_EMPTY */
379 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
380 if (pool->whatprovidesdataleft < count + 1)
383 printf("growing provides hash data...\n");
384 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
385 pool->whatprovidesdataleft = count + 4096;
388 /* copy queue to next free slot */
389 off = pool->whatprovidesdataoff;
390 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
392 /* adapt count and ID_NULL-terminate */
393 pool->whatprovidesdataoff += count;
394 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
395 pool->whatprovidesdataleft -= count + 1;
401 /******************************************************************************/
406 * add RangeDep to whatprovides
407 * no exact providers, do range match
412 pool_addrelproviders(Pool *pool, Id d)
414 Reldep *rd = GETRELDEP(pool, d);
420 int flags = rd->flags;
422 Id p, *pp, *pp2, *pp3;
424 d = GETRELID(pool, d);
425 queueinit_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
430 pp = GET_PROVIDESP(name, p);
431 pp2 = GET_PROVIDESP(evr, p);
432 while ((p = *pp++) != 0)
434 for (pp3 = pp2; *pp3;)
437 queuepush(&plist, p);
443 pp = GET_PROVIDESP(name, p);
444 while ((p = *pp++) != 0)
445 queuepush(&plist, p);
446 pp = GET_PROVIDESP(evr, p);
447 while ((p = *pp++) != 0)
448 queuepushunique(&plist, p);
451 if (pool->nscallback)
453 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
457 pool->whatprovides[d] = p;
458 return pool->whatprovidesdata + p;
461 queuepush(&plist, SYSTEMSOLVABLE);
468 /* convert to whatprovides id */
471 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
473 if (flags && flags < 8)
475 FOR_PROVIDES(p, pp, name)
479 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
481 /* solvable p provides name in some rels */
482 pidp = pool->solvables[p].source->idarraydata + pool->solvables[p].provides;
483 while ((pid = *pidp++) != 0)
489 break; /* yes, provides all versions */
491 continue; /* wrong provides name */
492 prd = GETRELDEP(pool, pid);
493 if (prd->name != name)
494 continue; /* wrong provides name */
495 /* right package, both deps are rels */
499 if (flags == 7 || pflags == 7)
500 break; /* included */
501 if ((pflags & flags & 5) != 0)
502 break; /* same direction, match */
506 if ((pflags & flags & 2) != 0)
507 break; /* both have =, match */
511 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
512 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
517 continue; /* no rel match */
518 queuepush(&plist, p);
520 /* make our system solvable provide all unknown rpmlib() stuff */
521 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
522 queuepush(&plist, SYSTEMSOLVABLE);
524 /* add providers to whatprovides */
526 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
528 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
531 return pool->whatprovidesdata + pool->whatprovides[d];