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",
66 int count, totalsize = 0;
69 pool = (Pool *)xcalloc(1, sizeof(*pool));
71 // count number and total size of predefined strings
72 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
73 totalsize += strlen(initpool_data[count]) + 1;
75 // alloc appropriate space
76 pool->stringspace = (char *)xmalloc((totalsize + STRINGSPACE_BLOCK) & ~STRINGSPACE_BLOCK);
77 pool->strings = (Offset *)xmalloc(((count + STRING_BLOCK) & ~STRING_BLOCK) * sizeof(Offset));
79 // now copy predefined strings into allocated space
81 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
83 strcpy(pool->stringspace + pool->sstrings, initpool_data[count]);
84 pool->strings[count] = pool->sstrings;
85 pool->sstrings += strlen(initpool_data[count]) + 1;
87 pool->nstrings = count;
89 // pre-alloc space for a RelDep
90 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
93 // pre-alloc space for a Solvable
94 pool->solvables = (Solvable *)xcalloc(1, sizeof(Solvable));
104 pool_free(Pool *pool)
109 pool_freewhatprovides(pool);
110 pool_freeidhashes(pool);
111 for (i = 0; i < pool->nsources; i++)
113 source = pool->sources[i];
114 xfree(source->idarraydata);
115 xfree(source->rpmdbid);
118 xfree(pool->solvables);
119 xfree(pool->sources);
120 xfree(pool->stringspace);
121 xfree(pool->strings);
127 static Pool *pool_shrink_whatprovides_sortcmp_data;
130 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
133 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
135 oa = pool->whatprovides[*(Id *)ap];
136 ob = pool->whatprovides[*(Id *)bp];
138 return *(Id *)ap - *(Id *)bp;
143 da = pool->whatprovidesdata + oa;
144 db = pool->whatprovidesdata + ob;
146 if ((r = (*da++ - *db++)) != 0)
150 return *(Id *)ap - *(Id *)bp;
154 pool_shrink_whatprovides(Pool *pool)
158 Id lastid, *last, *dp, *lp;
162 if (pool->nstrings < 3)
164 sorted = xmalloc2(pool->nstrings, sizeof(Id));
165 for (id = 0; id < pool->nstrings; id++)
167 pool_shrink_whatprovides_sortcmp_data = pool;
168 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
171 for (i = 1; i < pool->nstrings; i++)
174 o = pool->whatprovides[id];
175 if (o == 0 || o == 1)
177 dp = pool->whatprovidesdata + o;
191 pool->whatprovides[id] = -lastid;
195 last = pool->whatprovidesdata + o;
199 dp = pool->whatprovidesdata + 2;
200 for (id = 1; id < pool->nstrings; id++)
202 o = pool->whatprovides[id];
203 if (o == 0 || o == 1)
210 pool->whatprovides[id] = pool->whatprovides[i];
213 lp = pool->whatprovidesdata + o;
216 pool->whatprovides[id] = dp - pool->whatprovidesdata;
217 while ((*dp++ = *lp++) != 0)
220 o = dp - pool->whatprovidesdata;
222 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
223 if (pool->whatprovidesdataoff == o)
225 r = pool->whatprovidesdataoff - o;
226 pool->whatprovidesdataoff = o;
227 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
228 if (r > pool->whatprovidesdataleft)
229 r = pool->whatprovidesdataleft;
230 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
237 * create hashes over complete pool to ease lookups
242 pool_prepare(Pool *pool)
244 int i, num, np, extra;
250 Offset *whatprovides;
251 Id *whatprovidesdata, *d;
254 printf("number of solvables: %d\n", pool->nsolvables);
256 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
258 pool_freeidhashes(pool);
259 pool_freewhatprovides(pool);
260 num = pool->nstrings + pool->nrels;
261 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
263 /* count providers for each name */
264 for (i = 1; i < pool->nsolvables; i++)
267 s = pool->solvables + i;
270 if (!pool_installable(pool, s))
272 pp = s->source->idarraydata + s->provides;
273 while ((id = *pp++) != ID_NULL)
277 Reldep *rd = GETRELDEP(pool, id);
280 whatprovides[id]++; /* inc count of providers */
284 off = 2; /* first entry is undef, second is empty list */
286 np = 0; /* number of names provided */
287 for (i = 0; i < num; i++, idp++)
290 if (!n) /* no providers */
292 *idp = off; /* move from counts to offsets into whatprovidesdata */
293 off += n + 1; /* make space for all providers + terminating ID_NULL */
294 np++; /* inc # of provider 'slots' */
298 printf("provide ids: %d\n", np);
299 extra = 2 * pool->nrels;
305 printf("provide space needed: %d + %d\n", off, extra);
307 /* alloc space for all providers + extra */
308 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
310 /* now fill data for all provides */
311 for (i = 1; i < pool->nsolvables; i++)
314 s = pool->solvables + i;
317 if (!pool_installable(pool, s))
320 /* for all provides of this solvable */
321 pp = s->source->idarraydata + s->provides;
322 while ((id = *pp++) != 0)
326 Reldep *rd = GETRELDEP(pool, id);
329 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
333 while (*d) /* find free slot */
338 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
343 *d = i; /* put solvable Id into data */
346 pool->whatprovides = whatprovides;
347 pool->whatprovidesdata = whatprovidesdata;
348 pool->whatprovidesdataoff = off;
349 pool->whatprovidesdataleft = extra;
350 pool_shrink_whatprovides(pool);
353 /******************************************************************************/
356 * pool_queuetowhatprovides
358 * on-demand filling of provider information
359 * move queue data into whatprovidesdata
361 * returns: Offset into whatprovides
365 pool_queuetowhatprovides(Pool *pool, Queue *q)
368 int count = q->count;
370 if (count == 0) /* queue empty -> ID_EMPTY */
373 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
374 if (pool->whatprovidesdataleft < count + 1)
377 printf("growing provides hash data...\n");
378 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
379 pool->whatprovidesdataleft = count + 4096;
382 /* copy queue to next free slot */
383 off = pool->whatprovidesdataoff;
384 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
386 /* adapt count and ID_NULL-terminate */
387 pool->whatprovidesdataoff += count;
388 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
389 pool->whatprovidesdataleft -= count + 1;
398 * add RangeDep to whatprovides
399 * no exact providers, do range match
404 pool_addrelproviders(Pool *pool, Id d)
406 Reldep *rd = GETRELDEP(pool, d);
412 int flags = rd->flags;
414 Id p, *pp, *pp2, *pp3;
416 d = GETRELID(pool, d);
417 queueinit_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
422 pp = GET_PROVIDESP(name, p);
423 pp2 = GET_PROVIDESP(evr, p);
424 while ((p = *pp++) != 0)
426 for (pp3 = pp2; *pp3;)
429 queuepush(&plist, p);
435 pp = GET_PROVIDESP(name, p);
436 while ((p = *pp++) != 0)
437 queuepush(&plist, p);
438 pp = GET_PROVIDESP(evr, p);
439 while ((p = *pp++) != 0)
440 queuepushunique(&plist, p);
444 /* unknown namespace, just pass through */
445 pp = GET_PROVIDESP(evr, p);
446 while ((p = *pp++) != 0)
447 queuepush(&plist, p);
454 /* convert to whatprovides id */
457 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
459 if (flags && flags < 8)
461 FOR_PROVIDES(p, pp, name)
465 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
467 /* solvable p provides name in some rels */
468 pidp = pool->solvables[p].source->idarraydata + pool->solvables[p].provides;
469 while ((pid = *pidp++) != 0)
475 break; /* yes, provides all versions */
477 continue; /* wrong provides name */
478 prd = GETRELDEP(pool, pid);
479 if (prd->name != name)
480 continue; /* wrong provides name */
481 /* right package, both deps are rels */
485 if (flags == 7 || pflags == 7)
486 break; /* included */
487 if ((pflags & flags & 5) != 0)
488 break; /* same direction, match */
492 if ((pflags & flags & 2) != 0)
493 break; /* both have =, match */
497 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
498 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
503 continue; /* no rel match */
504 queuepush(&plist, p);
507 /* add providers to whatprovides */
509 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
511 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
514 return pool->whatprovidesdata + pool->whatprovides[d];