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)
122 pool_freewhatprovides(pool);
123 pool_freeidhashes(pool);
124 pool_freeallrepos(pool);
125 xfree(pool->id2arch);
126 xfree(pool->solvables);
127 xfree(pool->stringspace);
128 xfree(pool->strings);
130 queue_free(&pool->vendormap);
131 for (i = 0; i < DEP2STRBUF; i++)
132 xfree(pool->dep2strbuf[i]);
137 static Pool *pool_shrink_whatprovides_sortcmp_data;
140 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
143 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
145 oa = pool->whatprovides[*(Id *)ap];
146 ob = pool->whatprovides[*(Id *)bp];
148 return *(Id *)ap - *(Id *)bp;
153 da = pool->whatprovidesdata + oa;
154 db = pool->whatprovidesdata + ob;
156 if ((r = (*da++ - *db++)) != 0)
160 return *(Id *)ap - *(Id *)bp;
164 pool_shrink_whatprovides(Pool *pool)
168 Id lastid, *last, *dp, *lp;
172 if (pool->nstrings < 3)
174 sorted = xmalloc2(pool->nstrings, sizeof(Id));
175 for (id = 0; id < pool->nstrings; id++)
177 pool_shrink_whatprovides_sortcmp_data = pool;
178 qsort(sorted + 1, pool->nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
181 for (i = 1; i < pool->nstrings; i++)
184 o = pool->whatprovides[id];
185 if (o == 0 || o == 1)
187 dp = pool->whatprovidesdata + o;
201 pool->whatprovides[id] = -lastid;
205 last = pool->whatprovidesdata + o;
209 dp = pool->whatprovidesdata + 2;
210 for (id = 1; id < pool->nstrings; id++)
212 o = pool->whatprovides[id];
213 if (o == 0 || o == 1)
220 pool->whatprovides[id] = pool->whatprovides[i];
223 lp = pool->whatprovidesdata + o;
226 pool->whatprovides[id] = dp - pool->whatprovidesdata;
227 while ((*dp++ = *lp++) != 0)
230 o = dp - pool->whatprovidesdata;
232 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
233 if (pool->whatprovidesdataoff == o)
235 r = pool->whatprovidesdataoff - o;
236 pool->whatprovidesdataoff = o;
237 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
238 if (r > pool->whatprovidesdataleft)
239 r = pool->whatprovidesdataleft;
240 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
247 * create hashes over complete pool to ease lookups
252 pool_prepare(Pool *pool)
254 int i, num, np, extra;
259 Offset *whatprovides;
260 Id *whatprovidesdata, *d;
263 printf("number of solvables: %d\n", pool->nsolvables);
265 printf("number of ids: %d + %d\n", pool->nstrings, pool->nrels);
267 pool_freeidhashes(pool);
268 pool_freewhatprovides(pool);
269 num = pool->nstrings + pool->nrels;
270 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
272 /* count providers for each name */
273 for (i = 1; i < pool->nsolvables; i++)
276 s = pool->solvables + i;
279 if (!pool_installable(pool, s))
281 pp = s->repo->idarraydata + s->provides;
282 while ((id = *pp++) != ID_NULL)
286 Reldep *rd = GETRELDEP(pool, id);
289 whatprovides[id]++; /* inc count of providers */
293 off = 2; /* first entry is undef, second is empty list */
295 np = 0; /* number of names provided */
296 for (i = 0; i < num; i++, idp++)
299 if (!n) /* no providers */
301 *idp = off; /* move from counts to offsets into whatprovidesdata */
302 off += n + 1; /* make space for all providers + terminating ID_NULL */
303 np++; /* inc # of provider 'slots' */
307 printf("provide ids: %d\n", np);
308 extra = 2 * pool->nrels;
314 printf("provide space needed: %d + %d\n", off, extra);
316 /* alloc space for all providers + extra */
317 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
319 /* now fill data for all provides */
320 for (i = 1; i < pool->nsolvables; i++)
323 s = pool->solvables + i;
326 if (!pool_installable(pool, s))
329 /* for all provides of this solvable */
330 pp = s->repo->idarraydata + s->provides;
331 while ((id = *pp++) != 0)
335 Reldep *rd = GETRELDEP(pool, id);
338 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
342 while (*d) /* find free slot */
347 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
352 *d = i; /* put solvable Id into data */
355 pool->whatprovides = whatprovides;
356 pool->whatprovidesdata = whatprovidesdata;
357 pool->whatprovidesdataoff = off;
358 pool->whatprovidesdataleft = extra;
359 pool_shrink_whatprovides(pool);
363 /******************************************************************************/
366 * pool_queuetowhatprovides
368 * on-demand filling of provider information
369 * move queue data into whatprovidesdata
371 * returns: Offset into whatprovides
375 pool_queuetowhatprovides(Pool *pool, Queue *q)
378 int count = q->count;
380 if (count == 0) /* queue empty -> ID_EMPTY */
383 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
384 if (pool->whatprovidesdataleft < count + 1)
387 printf("growing provides hash data...\n");
388 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
389 pool->whatprovidesdataleft = count + 4096;
392 /* copy queue to next free slot */
393 off = pool->whatprovidesdataoff;
394 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
396 /* adapt count and ID_NULL-terminate */
397 pool->whatprovidesdataoff += count;
398 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
399 pool->whatprovidesdataleft -= count + 1;
405 /******************************************************************************/
410 * add packages fulfilling the relation to whatprovides array
411 * no exact providers, do range match
416 pool_addrelproviders(Pool *pool, Id d)
418 Reldep *rd = GETRELDEP(pool, d);
424 int flags = rd->flags;
426 Id p, *pp, *pp2, *pp3;
428 d = GETRELID(pool, d);
429 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
434 pp = GET_PROVIDESP(name, p);
435 pp2 = GET_PROVIDESP(evr, p);
436 while ((p = *pp++) != 0)
438 for (pp3 = pp2; *pp3;)
441 queue_push(&plist, p);
447 pp = GET_PROVIDESP(name, p);
448 while ((p = *pp++) != 0)
449 queue_push(&plist, p);
450 pp = GET_PROVIDESP(evr, p);
451 while ((p = *pp++) != 0)
452 queue_pushunique(&plist, p);
455 if (pool->nscallback)
457 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
461 pool->whatprovides[d] = p;
462 return pool->whatprovidesdata + p;
465 queue_push(&plist, SYSTEMSOLVABLE);
472 /* convert to whatprovides id */
475 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
477 if (flags && flags < 8)
479 FOR_PROVIDES(p, pp, name)
483 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
485 /* solvable p provides name in some rels */
486 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
487 while ((pid = *pidp++) != 0)
493 break; /* yes, provides all versions */
495 continue; /* wrong provides name */
496 prd = GETRELDEP(pool, pid);
497 if (prd->name != name)
498 continue; /* wrong provides name */
499 /* right package, both deps are rels */
503 if (flags == 7 || pflags == 7)
504 break; /* included */
505 if ((pflags & flags & 5) != 0)
506 break; /* same direction, match */
510 if ((pflags & flags & 2) != 0)
511 break; /* both have =, match */
515 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
516 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
521 continue; /* no rel match */
522 queue_push(&plist, p);
524 /* make our system solvable provide all unknown rpmlib() stuff */
525 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
526 queue_push(&plist, SYSTEMSOLVABLE);
528 /* add providers to whatprovides */
530 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
532 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
535 return pool->whatprovidesdata + pool->whatprovides[d];