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->nrepos; i++)
118 repo = pool->repos[i];
119 xfree(repo->idarraydata);
120 xfree(repo->rpmdbid);
123 xfree(pool->id2arch);
124 xfree(pool->solvables);
126 xfree(pool->stringspace);
127 xfree(pool->strings);
129 for (i = 0; i < DEP2STRBUF; i++)
130 xfree(pool->dep2strbuf[i]);
135 static Pool *pool_shrink_whatprovides_sortcmp_data;
138 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
141 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
143 oa = pool->whatprovides[*(Id *)ap];
144 ob = pool->whatprovides[*(Id *)bp];
146 return *(Id *)ap - *(Id *)bp;
151 da = pool->whatprovidesdata + oa;
152 db = pool->whatprovidesdata + ob;
154 if ((r = (*da++ - *db++)) != 0)
158 return *(Id *)ap - *(Id *)bp;
162 pool_shrink_whatprovides(Pool *pool)
166 Id lastid, *last, *dp, *lp;
170 if (pool->nstrings < 3)
172 sorted = xmalloc2(pool->nstrings, sizeof(Id));
173 for (id = 0; id < pool->nstrings; id++)
175 pool_shrink_whatprovides_sortcmp_data = pool;
176 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
179 for (i = 1; i < pool->nstrings; i++)
182 o = pool->whatprovides[id];
183 if (o == 0 || o == 1)
185 dp = pool->whatprovidesdata + o;
199 pool->whatprovides[id] = -lastid;
203 last = pool->whatprovidesdata + o;
207 dp = pool->whatprovidesdata + 2;
208 for (id = 1; id < pool->nstrings; id++)
210 o = pool->whatprovides[id];
211 if (o == 0 || o == 1)
218 pool->whatprovides[id] = pool->whatprovides[i];
221 lp = pool->whatprovidesdata + o;
224 pool->whatprovides[id] = dp - pool->whatprovidesdata;
225 while ((*dp++ = *lp++) != 0)
228 o = dp - pool->whatprovidesdata;
230 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
231 if (pool->whatprovidesdataoff == o)
233 r = pool->whatprovidesdataoff - o;
234 pool->whatprovidesdataoff = o;
235 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
236 if (r > pool->whatprovidesdataleft)
237 r = pool->whatprovidesdataleft;
238 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
245 * create hashes over complete pool to ease lookups
250 pool_prepare(Pool *pool)
252 int i, num, np, extra;
257 Offset *whatprovides;
258 Id *whatprovidesdata, *d;
261 printf("number of solvables: %d\n", pool->nsolvables);
263 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
265 pool_freeidhashes(pool);
266 pool_freewhatprovides(pool);
267 num = pool->nstrings + pool->nrels;
268 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
270 /* count providers for each name */
271 for (i = 1; i < pool->nsolvables; i++)
274 s = pool->solvables + i;
277 if (!pool_installable(pool, s))
279 pp = s->repo->idarraydata + s->provides;
280 while ((id = *pp++) != ID_NULL)
284 Reldep *rd = GETRELDEP(pool, id);
287 whatprovides[id]++; /* inc count of providers */
291 off = 2; /* first entry is undef, second is empty list */
293 np = 0; /* number of names provided */
294 for (i = 0; i < num; i++, idp++)
297 if (!n) /* no providers */
299 *idp = off; /* move from counts to offsets into whatprovidesdata */
300 off += n + 1; /* make space for all providers + terminating ID_NULL */
301 np++; /* inc # of provider 'slots' */
305 printf("provide ids: %d\n", np);
306 extra = 2 * pool->nrels;
312 printf("provide space needed: %d + %d\n", off, extra);
314 /* alloc space for all providers + extra */
315 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
317 /* now fill data for all provides */
318 for (i = 1; i < pool->nsolvables; i++)
321 s = pool->solvables + i;
324 if (!pool_installable(pool, s))
327 /* for all provides of this solvable */
328 pp = s->repo->idarraydata + s->provides;
329 while ((id = *pp++) != 0)
333 Reldep *rd = GETRELDEP(pool, id);
336 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
340 while (*d) /* find free slot */
345 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
350 *d = i; /* put solvable Id into data */
353 pool->whatprovides = whatprovides;
354 pool->whatprovidesdata = whatprovidesdata;
355 pool->whatprovidesdataoff = off;
356 pool->whatprovidesdataleft = extra;
357 pool_shrink_whatprovides(pool);
361 /******************************************************************************/
364 * pool_queuetowhatprovides
366 * on-demand filling of provider information
367 * move queue data into whatprovidesdata
369 * returns: Offset into whatprovides
373 pool_queuetowhatprovides(Pool *pool, Queue *q)
376 int count = q->count;
378 if (count == 0) /* queue empty -> ID_EMPTY */
381 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
382 if (pool->whatprovidesdataleft < count + 1)
385 printf("growing provides hash data...\n");
386 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
387 pool->whatprovidesdataleft = count + 4096;
390 /* copy queue to next free slot */
391 off = pool->whatprovidesdataoff;
392 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
394 /* adapt count and ID_NULL-terminate */
395 pool->whatprovidesdataoff += count;
396 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
397 pool->whatprovidesdataleft -= count + 1;
403 /******************************************************************************/
408 * add packages fulfilling the relation to whatprovides array
409 * no exact providers, do range match
414 pool_addrelproviders(Pool *pool, Id d)
416 Reldep *rd = GETRELDEP(pool, d);
422 int flags = rd->flags;
424 Id p, *pp, *pp2, *pp3;
426 d = GETRELID(pool, d);
427 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
432 pp = GET_PROVIDESP(name, p);
433 pp2 = GET_PROVIDESP(evr, p);
434 while ((p = *pp++) != 0)
436 for (pp3 = pp2; *pp3;)
439 queue_push(&plist, p);
445 pp = GET_PROVIDESP(name, p);
446 while ((p = *pp++) != 0)
447 queue_push(&plist, p);
448 pp = GET_PROVIDESP(evr, p);
449 while ((p = *pp++) != 0)
450 queue_pushunique(&plist, p);
453 if (pool->nscallback)
455 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
459 pool->whatprovides[d] = p;
460 return pool->whatprovidesdata + p;
463 queue_push(&plist, SYSTEMSOLVABLE);
470 /* convert to whatprovides id */
473 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
475 if (flags && flags < 8)
477 FOR_PROVIDES(p, pp, name)
481 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
483 /* solvable p provides name in some rels */
484 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
485 while ((pid = *pidp++) != 0)
491 break; /* yes, provides all versions */
493 continue; /* wrong provides name */
494 prd = GETRELDEP(pool, pid);
495 if (prd->name != name)
496 continue; /* wrong provides name */
497 /* right package, both deps are rels */
501 if (flags == 7 || pflags == 7)
502 break; /* included */
503 if ((pflags & flags & 5) != 0)
504 break; /* same direction, match */
508 if ((pflags & flags & 2) != 0)
509 break; /* both have =, match */
513 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
514 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
519 continue; /* no rel match */
520 queue_push(&plist, p);
522 /* make our system solvable provide all unknown rpmlib() stuff */
523 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
524 queue_push(&plist, SYSTEMSOLVABLE);
526 /* add providers to whatprovides */
528 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
530 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
533 return pool->whatprovidesdata + pool->whatprovides[d];