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.
22 #include "poolid_private.h"
28 // reset all whatprovides
31 pool_freewhatprovides(Pool *pool)
33 pool->whatprovides = xfree(pool->whatprovides);
34 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
35 pool->whatprovidesdataoff = 0;
36 pool->whatprovidesdataleft = 0;
40 // list of string constants, so we can do pointer/Id instead of string comparison
41 // index into array matches ID_xxx constants in pool.h
43 static char *initpool_data[] = {
54 "solvable:recommends",
56 "solvable:supplements",
59 "rpm:dbid", /* direct key into rpmdb */
60 "solvable:prereqmarker",
61 "solvable:filemarker",
62 "namespace:installed",
75 int count, totalsize = 0;
79 pool = (Pool *)xcalloc(1, sizeof(*pool));
81 // count number and total size of predefined strings
82 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
83 totalsize += strlen(initpool_data[count]) + 1;
85 // alloc appropriate space
86 pool->stringspace = (char *)xmalloc((totalsize + STRINGSPACE_BLOCK) & ~STRINGSPACE_BLOCK);
87 pool->strings = (Offset *)xmalloc(((count + STRING_BLOCK) & ~STRING_BLOCK) * sizeof(Offset));
89 // now copy predefined strings into allocated space
91 for (count = 0; count < sizeof(initpool_data)/sizeof(*initpool_data); count++)
93 strcpy(pool->stringspace + pool->sstrings, initpool_data[count]);
94 pool->strings[count] = pool->sstrings;
95 pool->sstrings += strlen(initpool_data[count]) + 1;
97 pool->nstrings = count;
99 // pre-alloc space for a RelDep
100 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
103 // pre-alloc space for a Solvable
104 pool->solvables = (Solvable *)xcalloc(2, sizeof(Solvable));
105 pool->nsolvables = 2;
106 queue_init(&pool->vendormap);
107 s = pool->solvables + SYSTEMSOLVABLE;
108 s->name = SYSTEM_SYSTEM;
109 s->arch = ARCH_NOARCH;
118 pool_free(Pool *pool)
123 pool_freewhatprovides(pool);
124 pool_freeidhashes(pool);
125 for (i = 0; i < pool->nrepos; i++)
127 repo = pool->repos[i];
128 xfree(repo->idarraydata);
129 xfree(repo->rpmdbid);
132 xfree(pool->id2arch);
133 xfree(pool->solvables);
135 xfree(pool->stringspace);
136 xfree(pool->strings);
138 queue_free(&pool->vendormap);
139 for (i = 0; i < DEP2STRBUF; i++)
140 xfree(pool->dep2strbuf[i]);
145 static Pool *pool_shrink_whatprovides_sortcmp_data;
148 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
151 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
153 oa = pool->whatprovides[*(Id *)ap];
154 ob = pool->whatprovides[*(Id *)bp];
156 return *(Id *)ap - *(Id *)bp;
161 da = pool->whatprovidesdata + oa;
162 db = pool->whatprovidesdata + ob;
164 if ((r = (*da++ - *db++)) != 0)
168 return *(Id *)ap - *(Id *)bp;
172 pool_shrink_whatprovides(Pool *pool)
176 Id lastid, *last, *dp, *lp;
180 if (pool->nstrings < 3)
182 sorted = xmalloc2(pool->nstrings, sizeof(Id));
183 for (id = 0; id < pool->nstrings; id++)
185 pool_shrink_whatprovides_sortcmp_data = pool;
186 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
189 for (i = 1; i < pool->nstrings; i++)
192 o = pool->whatprovides[id];
193 if (o == 0 || o == 1)
195 dp = pool->whatprovidesdata + o;
209 pool->whatprovides[id] = -lastid;
213 last = pool->whatprovidesdata + o;
217 dp = pool->whatprovidesdata + 2;
218 for (id = 1; id < pool->nstrings; id++)
220 o = pool->whatprovides[id];
221 if (o == 0 || o == 1)
228 pool->whatprovides[id] = pool->whatprovides[i];
231 lp = pool->whatprovidesdata + o;
234 pool->whatprovides[id] = dp - pool->whatprovidesdata;
235 while ((*dp++ = *lp++) != 0)
238 o = dp - pool->whatprovidesdata;
240 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
241 if (pool->whatprovidesdataoff == o)
243 r = pool->whatprovidesdataoff - o;
244 pool->whatprovidesdataoff = o;
245 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
246 if (r > pool->whatprovidesdataleft)
247 r = pool->whatprovidesdataleft;
248 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
255 * create hashes over complete pool to ease lookups
260 pool_prepare(Pool *pool)
262 int i, num, np, extra;
267 Offset *whatprovides;
268 Id *whatprovidesdata, *d;
271 printf("number of solvables: %d\n", pool->nsolvables);
273 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
275 pool_freeidhashes(pool);
276 pool_freewhatprovides(pool);
277 num = pool->nstrings + pool->nrels;
278 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
280 /* count providers for each name */
281 for (i = 1; i < pool->nsolvables; i++)
284 s = pool->solvables + i;
287 if (!pool_installable(pool, s))
289 pp = s->repo->idarraydata + s->provides;
290 while ((id = *pp++) != ID_NULL)
294 Reldep *rd = GETRELDEP(pool, id);
297 whatprovides[id]++; /* inc count of providers */
301 off = 2; /* first entry is undef, second is empty list */
303 np = 0; /* number of names provided */
304 for (i = 0; i < num; i++, idp++)
307 if (!n) /* no providers */
309 *idp = off; /* move from counts to offsets into whatprovidesdata */
310 off += n + 1; /* make space for all providers + terminating ID_NULL */
311 np++; /* inc # of provider 'slots' */
315 printf("provide ids: %d\n", np);
316 extra = 2 * pool->nrels;
322 printf("provide space needed: %d + %d\n", off, extra);
324 /* alloc space for all providers + extra */
325 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
327 /* now fill data for all provides */
328 for (i = 1; i < pool->nsolvables; i++)
331 s = pool->solvables + i;
334 if (!pool_installable(pool, s))
337 /* for all provides of this solvable */
338 pp = s->repo->idarraydata + s->provides;
339 while ((id = *pp++) != 0)
343 Reldep *rd = GETRELDEP(pool, id);
346 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
350 while (*d) /* find free slot */
355 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
360 *d = i; /* put solvable Id into data */
363 pool->whatprovides = whatprovides;
364 pool->whatprovidesdata = whatprovidesdata;
365 pool->whatprovidesdataoff = off;
366 pool->whatprovidesdataleft = extra;
367 pool_shrink_whatprovides(pool);
371 /******************************************************************************/
374 * pool_queuetowhatprovides
376 * on-demand filling of provider information
377 * move queue data into whatprovidesdata
379 * returns: Offset into whatprovides
383 pool_queuetowhatprovides(Pool *pool, Queue *q)
386 int count = q->count;
388 if (count == 0) /* queue empty -> ID_EMPTY */
391 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
392 if (pool->whatprovidesdataleft < count + 1)
395 printf("growing provides hash data...\n");
396 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
397 pool->whatprovidesdataleft = count + 4096;
400 /* copy queue to next free slot */
401 off = pool->whatprovidesdataoff;
402 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
404 /* adapt count and ID_NULL-terminate */
405 pool->whatprovidesdataoff += count;
406 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
407 pool->whatprovidesdataleft -= count + 1;
413 /******************************************************************************/
418 * add packages fulfilling the relation to whatprovides array
419 * no exact providers, do range match
424 pool_addrelproviders(Pool *pool, Id d)
426 Reldep *rd = GETRELDEP(pool, d);
432 int flags = rd->flags;
434 Id p, *pp, *pp2, *pp3;
436 d = GETRELID(pool, d);
437 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
442 pp = GET_PROVIDESP(name, p);
443 pp2 = GET_PROVIDESP(evr, p);
444 while ((p = *pp++) != 0)
446 for (pp3 = pp2; *pp3;)
449 queue_push(&plist, p);
455 pp = GET_PROVIDESP(name, p);
456 while ((p = *pp++) != 0)
457 queue_push(&plist, p);
458 pp = GET_PROVIDESP(evr, p);
459 while ((p = *pp++) != 0)
460 queue_pushunique(&plist, p);
463 if (pool->nscallback)
465 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
469 pool->whatprovides[d] = p;
470 return pool->whatprovidesdata + p;
473 queue_push(&plist, SYSTEMSOLVABLE);
480 /* convert to whatprovides id */
483 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
485 if (flags && flags < 8)
487 FOR_PROVIDES(p, pp, name)
491 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
493 /* solvable p provides name in some rels */
494 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
495 while ((pid = *pidp++) != 0)
501 break; /* yes, provides all versions */
503 continue; /* wrong provides name */
504 prd = GETRELDEP(pool, pid);
505 if (prd->name != name)
506 continue; /* wrong provides name */
507 /* right package, both deps are rels */
511 if (flags == 7 || pflags == 7)
512 break; /* included */
513 if ((pflags & flags & 5) != 0)
514 break; /* same direction, match */
518 if ((pflags & flags & 2) != 0)
519 break; /* both have =, match */
523 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
524 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
529 continue; /* no rel match */
530 queue_push(&plist, p);
532 /* make our system solvable provide all unknown rpmlib() stuff */
533 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
534 queue_push(&plist, SYSTEMSOLVABLE);
536 /* add providers to whatprovides */
538 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
540 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
543 return pool->whatprovidesdata + pool->whatprovides[d];