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.
23 #include "poolid_private.h"
28 #define SOLVABLE_BLOCK 255
30 // reset all whatprovides
33 pool_freewhatprovides(Pool *pool)
35 pool->whatprovides = xfree(pool->whatprovides);
36 pool->whatprovidesdata = xfree(pool->whatprovidesdata);
37 pool->whatprovidesdataoff = 0;
38 pool->whatprovidesdataleft = 0;
42 // list of string constants, so we can do pointer/Id instead of string comparison
43 // index into array matches ID_xxx constants in pool.h
45 static const char *initpool_data[] = {
56 "solvable:recommends",
58 "solvable:supplements",
61 "rpm:dbid", /* direct key into rpmdb */
62 "solvable:prereqmarker",
63 "solvable:filemarker",
64 "namespace:installed",
81 pool = (Pool *)xcalloc(1, sizeof(*pool));
83 stringpool_init (&pool->ss, initpool_data);
85 // pre-alloc space for a RelDep
86 pool->rels = (Reldep *)xcalloc(1 + REL_BLOCK, sizeof(Reldep));
89 // pre-alloc space for a Solvable
90 pool->solvables = (Solvable *)xcalloc(SOLVABLE_BLOCK + 1, sizeof(Solvable));
92 queue_init(&pool->vendormap);
93 s = pool->solvables + SYSTEMSOLVABLE;
94 s->name = SYSTEM_SYSTEM;
95 s->arch = ARCH_NOARCH;
104 pool_free(Pool *pool)
108 pool_freewhatprovides(pool);
109 pool_freeidhashes(pool);
110 repo_freeallrepos(pool, 1);
111 xfree(pool->id2arch);
112 xfree(pool->solvables);
113 xfree(pool->ss.stringspace);
114 xfree(pool->ss.strings);
116 queue_free(&pool->vendormap);
117 for (i = 0; i < DEP2STRBUF; i++)
118 xfree(pool->dep2strbuf[i]);
123 pool_add_solvable(Pool *pool)
125 if ((pool->nsolvables & SOLVABLE_BLOCK) == 0)
126 pool->solvables = xrealloc2(pool->solvables, pool->nsolvables + (SOLVABLE_BLOCK + 1), sizeof(Solvable));
127 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
128 return pool->nsolvables++;
132 pool_add_solvable_block(Pool *pool, int count)
134 Id nsolvables = pool->nsolvables;
137 if (((nsolvables - 1) | SOLVABLE_BLOCK) != ((nsolvables + count - 1) | SOLVABLE_BLOCK))
138 pool->solvables = xrealloc2(pool->solvables, (nsolvables + count + SOLVABLE_BLOCK) & ~SOLVABLE_BLOCK, sizeof(Solvable));
139 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
140 pool->nsolvables += count;
145 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
149 if (reuseids && start + count == pool->nsolvables)
151 /* might want to shrink solvable array */
152 pool->nsolvables = start;
155 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
160 solvable2str(Pool *pool, Solvable *s)
162 int l, nn = pool->dep2strn;
163 const char *n, *e, *a;
164 n = id2str(pool, s->name);
165 e = id2str(pool, s->evr);
166 a = id2str(pool, s->arch);
167 l = strlen(n) + strlen(e) + strlen(a) + 3;
168 if (l > pool->dep2strlen[nn])
170 pool->dep2strbuf[nn] = xrealloc(pool->dep2strbuf[nn], l + 32);
171 pool->dep2strlen[nn] = l + 32;
173 sprintf(pool->dep2strbuf[nn], "%s-%s.%s", n, e, a);
174 pool->dep2strn = (nn + 1) % DEP2STRBUF;
175 return pool->dep2strbuf[nn];
178 static Pool *pool_shrink_whatprovides_sortcmp_data;
181 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
184 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
186 oa = pool->whatprovides[*(Id *)ap];
187 ob = pool->whatprovides[*(Id *)bp];
189 return *(Id *)ap - *(Id *)bp;
194 da = pool->whatprovidesdata + oa;
195 db = pool->whatprovidesdata + ob;
197 if ((r = (*da++ - *db++)) != 0)
201 return *(Id *)ap - *(Id *)bp;
205 pool_shrink_whatprovides(Pool *pool)
209 Id lastid, *last, *dp, *lp;
213 if (pool->ss.nstrings < 3)
215 sorted = xmalloc2(pool->ss.nstrings, sizeof(Id));
216 for (id = 0; id < pool->ss.nstrings; id++)
218 pool_shrink_whatprovides_sortcmp_data = pool;
219 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
222 for (i = 1; i < pool->ss.nstrings; i++)
225 o = pool->whatprovides[id];
226 if (o == 0 || o == 1)
228 dp = pool->whatprovidesdata + o;
242 pool->whatprovides[id] = -lastid;
246 last = pool->whatprovidesdata + o;
250 dp = pool->whatprovidesdata + 2;
251 for (id = 1; id < pool->ss.nstrings; id++)
253 o = pool->whatprovides[id];
254 if (o == 0 || o == 1)
261 pool->whatprovides[id] = pool->whatprovides[i];
264 lp = pool->whatprovidesdata + o;
267 pool->whatprovides[id] = dp - pool->whatprovidesdata;
268 while ((*dp++ = *lp++) != 0)
271 o = dp - pool->whatprovidesdata;
273 printf("shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
274 if (pool->whatprovidesdataoff == o)
276 r = pool->whatprovidesdataoff - o;
277 pool->whatprovidesdataoff = o;
278 pool->whatprovidesdata = xrealloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
279 if (r > pool->whatprovidesdataleft)
280 r = pool->whatprovidesdataleft;
281 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
286 * pool_createwhatprovides()
288 * create hashes over complete pool to ease lookups
293 pool_createwhatprovides(Pool *pool)
295 int i, num, np, extra;
300 Offset *whatprovides;
301 Id *whatprovidesdata, *d;
304 printf("number of solvables: %d\n", pool->nsolvables);
306 printf("number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
308 pool_freeidhashes(pool);
309 pool_freewhatprovides(pool);
310 num = pool->ss.nstrings + pool->nrels;
311 whatprovides = (Offset *)xcalloc(num, sizeof(Offset));
313 /* count providers for each name */
314 for (i = 1; i < pool->nsolvables; i++)
317 s = pool->solvables + i;
320 if (!pool_installable(pool, s))
322 pp = s->repo->idarraydata + s->provides;
323 while ((id = *pp++) != ID_NULL)
327 Reldep *rd = GETRELDEP(pool, id);
330 whatprovides[id]++; /* inc count of providers */
334 off = 2; /* first entry is undef, second is empty list */
336 np = 0; /* number of names provided */
337 for (i = 0; i < num; i++, idp++)
340 if (!n) /* no providers */
342 *idp = off; /* move from counts to offsets into whatprovidesdata */
343 off += n + 1; /* make space for all providers + terminating ID_NULL */
344 np++; /* inc # of provider 'slots' */
348 printf("provide ids: %d\n", np);
349 extra = 2 * pool->nrels;
355 printf("provide space needed: %d + %d\n", off, extra);
357 /* alloc space for all providers + extra */
358 whatprovidesdata = (Id *)xcalloc(off + extra, sizeof(Id));
360 /* now fill data for all provides */
361 for (i = 1; i < pool->nsolvables; i++)
364 s = pool->solvables + i;
367 if (!pool_installable(pool, s))
370 /* for all provides of this solvable */
371 pp = s->repo->idarraydata + s->provides;
372 while ((id = *pp++) != 0)
376 Reldep *rd = GETRELDEP(pool, id);
379 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
383 while (*d) /* find free slot */
388 if (pool->verbose) printf("duplicate entry for %s in package %s.%s\n", id2str(pool, id), id2str(pool, s->name), id2str(pool, s->arch));
393 *d = i; /* put solvable Id into data */
396 pool->whatprovides = whatprovides;
397 pool->whatprovidesdata = whatprovidesdata;
398 pool->whatprovidesdataoff = off;
399 pool->whatprovidesdataleft = extra;
400 pool_shrink_whatprovides(pool);
404 /******************************************************************************/
407 * pool_queuetowhatprovides
409 * on-demand filling of provider information
410 * move queue data into whatprovidesdata
412 * returns: Offset into whatprovides
416 pool_queuetowhatprovides(Pool *pool, Queue *q)
419 int count = q->count;
421 if (count == 0) /* queue empty -> ID_EMPTY */
424 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
425 if (pool->whatprovidesdataleft < count + 1)
428 printf("growing provides hash data...\n");
429 pool->whatprovidesdata = (Id *)xrealloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
430 pool->whatprovidesdataleft = count + 4096;
433 /* copy queue to next free slot */
434 off = pool->whatprovidesdataoff;
435 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
437 /* adapt count and ID_NULL-terminate */
438 pool->whatprovidesdataoff += count;
439 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
440 pool->whatprovidesdataleft -= count + 1;
446 /******************************************************************************/
451 * add packages fulfilling the relation to whatprovides array
452 * no exact providers, do range match
457 pool_addrelproviders(Pool *pool, Id d)
459 Reldep *rd = GETRELDEP(pool, d);
465 int flags = rd->flags;
467 Id p, *pp, *pp2, *pp3;
469 d = GETRELID(pool, d);
470 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
475 pp = pool_whatprovides(pool, name);
476 pp2 = pool_whatprovides(pool, evr);
477 while ((p = *pp++) != 0)
479 for (pp3 = pp2; *pp3;)
482 queue_push(&plist, p);
488 pp = pool_whatprovides(pool, name);
489 while ((p = *pp++) != 0)
490 queue_push(&plist, p);
491 pp = pool_whatprovides(pool, evr);
492 while ((p = *pp++) != 0)
493 queue_pushunique(&plist, p);
496 if (pool->nscallback)
498 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
502 pool->whatprovides[d] = p;
503 return pool->whatprovidesdata + p;
506 queue_push(&plist, SYSTEMSOLVABLE);
513 /* convert to whatprovides id */
516 printf("addrelproviders: what provides %s?\n", id2str(pool, name));
518 if (flags && flags < 8)
520 FOR_PROVIDES(p, pp, name)
524 printf("addrelproviders: checking package %s\n", id2str(pool, pool->p[p].name));
526 /* solvable p provides name in some rels */
527 pidp = pool->solvables[p].repo->idarraydata + pool->solvables[p].provides;
528 while ((pid = *pidp++) != 0)
534 break; /* yes, provides all versions */
536 continue; /* wrong provides name */
537 prd = GETRELDEP(pool, pid);
538 if (prd->name != name)
539 continue; /* wrong provides name */
540 /* right package, both deps are rels */
544 if (flags == 7 || pflags == 7)
545 break; /* included */
546 if ((pflags & flags & 5) != 0)
547 break; /* same direction, match */
551 if ((pflags & flags & 2) != 0)
552 break; /* both have =, match */
556 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
557 if ((f & (1 << (1 + evrcmp(pool, pevr, evr)))) != 0)
562 continue; /* no rel match */
563 queue_push(&plist, p);
565 /* make our system solvable provide all unknown rpmlib() stuff */
566 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
567 queue_push(&plist, SYSTEMSOLVABLE);
569 /* add providers to whatprovides */
571 if (pool->verbose) printf("addrelproviders: adding %d packages to %d\n", plist.count, d);
573 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &plist);
576 return pool->whatprovidesdata + pool->whatprovides[d];