2 * Copyright (c) 2007-2009, 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 "poolvendor.h"
25 #include "poolid_private.h"
34 #define SOLVABLE_BLOCK 255
36 #undef LIBSOLV_KNOWNID_H
37 #define KNOWNID_INITIALIZE
39 #undef KNOWNID_INITIALIZE
48 pool = (Pool *)solv_calloc(1, sizeof(*pool));
50 stringpool_init(&pool->ss, initpool_data);
52 /* alloc space for RelDep 0 */
53 pool->rels = solv_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
55 memset(pool->rels, 0, sizeof(Reldep));
57 /* alloc space for Solvable 0 and system solvable */
58 pool->solvables = solv_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
60 memset(pool->solvables, 0, 2 * sizeof(Solvable));
62 queue_init(&pool->vendormap);
63 queue_init(&pool->pooljobs);
64 queue_init(&pool->lazywhatprovidesq);
67 pool->disttype = DISTTYPE_DEB;
68 pool->noarchid = ARCH_ALL;
69 #elif defined(ARCHLINUX)
70 pool->disttype = DISTTYPE_ARCH;
71 pool->noarchid = ARCH_ANY;
73 pool->disttype = DISTTYPE_HAIKU;
74 pool->noarchid = ARCH_ANY;
75 pool->obsoleteusesprovides = 1;
77 pool->disttype = DISTTYPE_RPM;
78 pool->noarchid = ARCH_NOARCH;
81 /* initialize the system solvable */
82 s = pool->solvables + SYSTEMSOLVABLE;
83 s->name = SYSTEM_SYSTEM;
84 s->arch = pool->noarchid;
87 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
88 #if defined(FEDORA) || defined(MAGEIA)
89 pool->implicitobsoleteusescolors = 1;
92 pool->noobsoletesmultiversion = 1;
93 pool->forbidselfconflicts = 1;
94 pool->obsoleteusesprovides = 1;
95 pool->implicitobsoleteusesprovides = 1;
96 pool->havedistepoch = 1;
102 /* free all the resources of our pool */
104 pool_free(Pool *pool)
108 pool_freewhatprovides(pool);
109 pool_freeidhashes(pool);
110 pool_freeallrepos(pool, 1);
111 solv_free(pool->id2arch);
112 solv_free(pool->id2color);
113 solv_free(pool->solvables);
114 stringpool_free(&pool->ss);
115 solv_free(pool->rels);
116 pool_setvendorclasses(pool, 0);
117 queue_free(&pool->vendormap);
118 queue_free(&pool->pooljobs);
119 queue_free(&pool->lazywhatprovidesq);
120 for (i = 0; i < POOL_TMPSPACEBUF; i++)
121 solv_free(pool->tmpspace.buf[i]);
122 for (i = 0; i < pool->nlanguages; i++)
123 free((char *)pool->languages[i]);
124 solv_free((void *)pool->languages);
125 solv_free(pool->languagecache);
126 solv_free(pool->errstr);
127 solv_free(pool->rootdir);
132 pool_freeallrepos(Pool *pool, int reuseids)
136 pool_freewhatprovides(pool);
137 for (i = 1; i < pool->nrepos; i++)
139 repo_freedata(pool->repos[i]);
140 pool->repos = solv_free(pool->repos);
143 /* the first two solvables don't belong to a repo */
144 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
148 pool_setdisttype(Pool *pool, int disttype)
150 #ifdef MULTI_SEMANTICS
151 int olddisttype = pool->disttype;
155 pool->noarchid = ARCH_NOARCH;
158 pool->noarchid = ARCH_ALL;
162 pool->noarchid = ARCH_ANY;
165 pool->noarchid = ARCH_ANY;
170 pool->disttype = disttype;
171 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
174 return pool->disttype == disttype ? disttype : -1;
179 pool_get_flag(Pool *pool, int flag)
183 case POOL_FLAG_PROMOTEEPOCH:
184 return pool->promoteepoch;
185 case POOL_FLAG_FORBIDSELFCONFLICTS:
186 return pool->forbidselfconflicts;
187 case POOL_FLAG_OBSOLETEUSESPROVIDES:
188 return pool->obsoleteusesprovides;
189 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
190 return pool->implicitobsoleteusesprovides;
191 case POOL_FLAG_OBSOLETEUSESCOLORS:
192 return pool->obsoleteusescolors;
193 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
194 return pool->implicitobsoleteusescolors;
195 case POOL_FLAG_NOINSTALLEDOBSOLETES:
196 return pool->noinstalledobsoletes;
197 case POOL_FLAG_HAVEDISTEPOCH:
198 return pool->havedistepoch;
199 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
200 return pool->noobsoletesmultiversion;
201 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
202 return pool->addfileprovidesfiltered;
203 case POOL_FLAG_NOWHATPROVIDESAUX:
204 return pool->nowhatprovidesaux;
212 pool_set_flag(Pool *pool, int flag, int value)
214 int old = pool_get_flag(pool, flag);
217 case POOL_FLAG_PROMOTEEPOCH:
218 pool->promoteepoch = value;
220 case POOL_FLAG_FORBIDSELFCONFLICTS:
221 pool->forbidselfconflicts = value;
223 case POOL_FLAG_OBSOLETEUSESPROVIDES:
224 pool->obsoleteusesprovides = value;
226 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
227 pool->implicitobsoleteusesprovides = value;
229 case POOL_FLAG_OBSOLETEUSESCOLORS:
230 pool->obsoleteusescolors = value;
232 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
233 pool->implicitobsoleteusescolors = value;
235 case POOL_FLAG_NOINSTALLEDOBSOLETES:
236 pool->noinstalledobsoletes = value;
238 case POOL_FLAG_HAVEDISTEPOCH:
239 pool->havedistepoch = value;
241 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
242 pool->noobsoletesmultiversion = value;
244 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
245 pool->addfileprovidesfiltered = value;
247 case POOL_FLAG_NOWHATPROVIDESAUX:
248 pool->nowhatprovidesaux = value;
258 pool_add_solvable(Pool *pool)
260 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
261 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
262 return pool->nsolvables++;
266 pool_add_solvable_block(Pool *pool, int count)
268 Id nsolvables = pool->nsolvables;
271 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
272 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
273 pool->nsolvables += count;
278 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
282 if (reuseids && start + count == pool->nsolvables)
284 /* might want to shrink solvable array */
285 pool->nsolvables = start;
288 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
293 pool_set_installed(Pool *pool, Repo *installed)
295 if (pool->installed == installed)
297 pool->installed = installed;
298 pool_freewhatprovides(pool);
302 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
307 oa = pool->whatprovides[*(Id *)ap];
308 ob = pool->whatprovides[*(Id *)bp];
310 return *(Id *)ap - *(Id *)bp;
311 da = pool->whatprovidesdata + oa;
312 db = pool->whatprovidesdata + ob;
314 if ((r = (*da++ - *db++)) != 0)
318 return *(Id *)ap - *(Id *)bp;
322 * pool_shrink_whatprovides - unify whatprovides data
324 * whatprovides_rel must be empty for this to work!
328 pool_shrink_whatprovides(Pool *pool)
332 Id lastid, *last, *dp, *lp;
336 if (pool->ss.nstrings < 3)
338 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
339 for (i = id = 0; id < pool->ss.nstrings; id++)
340 if (pool->whatprovides[id] >= 4)
343 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
346 for (i = 0; i < n; i++)
349 o = pool->whatprovides[id];
350 dp = pool->whatprovidesdata + o;
364 pool->whatprovides[id] = -lastid;
368 last = pool->whatprovidesdata + o;
372 dp = pool->whatprovidesdata + 4;
373 for (id = 1; id < pool->ss.nstrings; id++)
375 o = pool->whatprovides[id];
383 pool->whatprovides[id] = pool->whatprovides[i];
388 lp = pool->whatprovidesdata + o;
391 pool->whatprovides[id] = dp - pool->whatprovidesdata;
392 while ((*dp++ = *lp++) != 0)
395 o = dp - pool->whatprovidesdata;
396 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
397 if (pool->whatprovidesdataoff == o)
399 r = pool->whatprovidesdataoff - o;
400 pool->whatprovidesdataoff = o;
401 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
402 if (r > pool->whatprovidesdataleft)
403 r = pool->whatprovidesdataleft;
404 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
407 /* this gets rid of all the zeros in the aux */
409 pool_shrink_whatprovidesaux(Pool *pool)
411 int num = pool->whatprovidesauxoff;
414 Id *op, *wp = pool->whatprovidesauxdata + 1;
417 for (i = 0; i < num; i++)
419 Offset o = pool->whatprovidesaux[i];
422 op = pool->whatprovidesauxdata + o;
423 pool->whatprovidesaux[i] = wp - pool->whatprovidesauxdata;
426 while ((id = *op++) != 0)
429 newoff = wp - pool->whatprovidesauxdata;
430 pool->whatprovidesauxdata = solv_realloc(pool->whatprovidesauxdata, newoff * sizeof(Id));
431 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesauxdata from %d to %d\n", pool->whatprovidesauxdataoff, newoff);
432 pool->whatprovidesauxdataoff = newoff;
437 * pool_createwhatprovides()
439 * create hashes over pool of solvables to ease provide lookups
443 pool_createwhatprovides(Pool *pool)
445 int i, num, np, extra;
450 Offset *whatprovides;
451 Id *whatprovidesdata, *dp, *whatprovidesauxdata;
452 Offset *whatprovidesaux;
453 Repo *installed = pool->installed;
456 now = solv_timems(0);
457 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
458 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
459 POOL_DEBUG(SOLV_DEBUG_STATS, "string memory used: %d K array + %d K data, rel memory used: %d K array\n", pool->ss.nstrings / (1024 / (int)sizeof(Id)), pool->ss.sstrings / 1024, pool->nrels * (int)sizeof(Reldep) / 1024);
460 if (pool->ss.stringhashmask || pool->relhashmask)
461 POOL_DEBUG(SOLV_DEBUG_STATS, "string hash memory: %d K, rel hash memory : %d K\n", (pool->ss.stringhashmask + 1) / (int)(1024/sizeof(Id)), (pool->relhashmask + 1) / (int)(1024/sizeof(Id)));
463 pool_freeidhashes(pool); /* XXX: should not be here! */
464 pool_freewhatprovides(pool);
465 num = pool->ss.nstrings;
466 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
467 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
469 /* count providers for each name */
470 for (i = pool->nsolvables - 1; i > 0; i--)
473 s = pool->solvables + i;
474 if (!s->provides || !s->repo || s->repo->disabled)
476 /* we always need the installed solvable in the whatprovides data,
477 otherwise obsoletes/conflicts on them won't work */
478 if (s->repo != installed && !pool_installable(pool, s))
480 pp = s->repo->idarraydata + s->provides;
481 while ((id = *pp++) != 0)
485 Reldep *rd = GETRELDEP(pool, id);
488 whatprovides[id]++; /* inc count of providers */
492 off = 4; /* first entry is undef, second is empty list, third is system solvable */
493 np = 0; /* number of names provided */
494 for (i = 0, idp = whatprovides; i < num; i++, idp++)
497 if (!n) /* no providers */
499 *idp = 1; /* offset for empty list */
502 off += n; /* make space for all providers */
503 *idp = off++; /* now idp points to terminating zero */
504 np++; /* inc # of provider 'slots' for stats */
507 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
509 /* reserve some space for relation data */
510 extra = 2 * pool->nrels;
514 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
516 /* alloc space for all providers + extra */
517 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
518 whatprovidesdata[2] = SYSTEMSOLVABLE;
520 /* alloc aux vector */
521 whatprovidesauxdata = 0;
522 if (!pool->nowhatprovidesaux)
524 pool->whatprovidesaux = whatprovidesaux = solv_calloc(num, sizeof(Offset));
525 pool->whatprovidesauxoff = num;
526 pool->whatprovidesauxdataoff = off;
527 pool->whatprovidesauxdata = whatprovidesauxdata = solv_calloc(pool->whatprovidesauxdataoff, sizeof(Id));
530 /* now fill data for all provides */
531 for (i = pool->nsolvables - 1; i > 0; i--)
534 s = pool->solvables + i;
535 if (!s->provides || !s->repo || s->repo->disabled)
537 if (s->repo != installed && !pool_installable(pool, s))
540 /* for all provides of this solvable */
541 pp = s->repo->idarraydata + s->provides;
542 while ((id = *pp++) != 0)
547 Reldep *rd = GETRELDEP(pool, id);
550 dp = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
551 if (*dp != i) /* don't add same solvable twice */
558 if (whatprovidesauxdata)
559 whatprovidesauxdata[whatprovides[id]] = auxid;
562 if (pool->whatprovidesaux)
563 memcpy(pool->whatprovidesaux, pool->whatprovides, num * sizeof(Id));
564 pool->whatprovidesdata = whatprovidesdata;
565 pool->whatprovidesdataoff = off;
566 pool->whatprovidesdataleft = extra;
567 pool_shrink_whatprovides(pool);
568 if (pool->whatprovidesaux)
569 pool_shrink_whatprovidesaux(pool);
570 POOL_DEBUG(SOLV_DEBUG_STATS, "whatprovides memory used: %d K id array, %d K data\n", (pool->ss.nstrings + pool->nrels + WHATPROVIDES_BLOCK) / (int)(1024/sizeof(Id)), (pool->whatprovidesdataoff + pool->whatprovidesdataleft) / (int)(1024/sizeof(Id)));
571 if (pool->whatprovidesaux)
572 POOL_DEBUG(SOLV_DEBUG_STATS, "whatprovidesaux memory used: %d K id array, %d K data\n", pool->whatprovidesauxoff / (int)(1024/sizeof(Id)), pool->whatprovidesauxdataoff / (int)(1024/sizeof(Id)));
574 queue_empty(&pool->lazywhatprovidesq);
575 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
577 if (!pool->addedfileprovides)
578 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
579 /* lazyly add file provides */
580 for (i = 1; i < num; i++)
582 const char *str = pool->ss.stringspace + pool->ss.strings[i];
585 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
587 /* setup lazy adding, but remember old value */
588 if (pool->whatprovides[i] > 1)
589 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
590 pool->whatprovides[i] = 0;
591 if (pool->whatprovidesaux)
592 pool->whatprovidesaux[i] = 0; /* sorry */
594 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
597 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
601 * free all of our whatprovides data
602 * be careful, everything internalized with pool_queuetowhatprovides is
606 pool_freewhatprovides(Pool *pool)
608 pool->whatprovides = solv_free(pool->whatprovides);
609 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
610 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
611 pool->whatprovidesdataoff = 0;
612 pool->whatprovidesdataleft = 0;
613 pool->whatprovidesaux = solv_free(pool->whatprovidesaux);
614 pool->whatprovidesauxdata = solv_free(pool->whatprovidesauxdata);
615 pool->whatprovidesauxoff = 0;
616 pool->whatprovidesauxdataoff = 0;
620 /******************************************************************************/
623 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
625 * used for whatprovides, jobs, learnt rules, selections
626 * input: q: queue of Ids
627 * returns: Offset into whatprovidesdata
632 pool_ids2whatprovides(Pool *pool, Id *ids, int count)
636 if (count == 0) /* queue empty -> 1 */
638 if (count == 1 && *ids == SYSTEMSOLVABLE)
641 /* extend whatprovidesdata if needed, +1 for 0-termination */
642 if (pool->whatprovidesdataleft < count + 1)
644 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
645 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
646 pool->whatprovidesdataleft = count + 4096;
649 /* copy queue to next free slot */
650 off = pool->whatprovidesdataoff;
651 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, ids, count * sizeof(Id));
653 /* adapt count and 0-terminate */
654 pool->whatprovidesdataoff += count;
655 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
656 pool->whatprovidesdataleft -= count + 1;
662 pool_queuetowhatprovides(Pool *pool, Queue *q)
664 int count = q->count;
665 if (count == 0) /* queue empty -> 1 */
667 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
669 return pool_ids2whatprovides(pool, q->elements, count);
673 /*************************************************************************/
675 #if defined(MULTI_SEMANTICS)
676 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
677 #elif defined(DEBIAN)
678 # define EVRCMP_DEPCMP EVRCMP_COMPARE
680 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
683 /* check if a package's nevr matches a dependency */
684 /* semi-private, called from public pool_match_nevr */
687 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
689 Reldep *rd = GETRELDEP(pool, d);
692 int flags = rd->flags;
701 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
704 return pool_match_nevr(pool, s, name);
706 if (pool_match_nevr(pool, s, name))
708 return pool_match_nevr(pool, s, evr);
711 if (!pool_match_nevr(pool, s, name))
713 return pool_match_nevr(pool, s, evr);
715 if (!pool_match_nevr(pool, s, name))
717 return !pool_match_nevr(pool, s, evr);
721 /* XXX : need to check for Multi-Arch: allowed! */
722 return pool_match_nevr(pool, s, name);
727 if (!pool_match_nevr(pool, s, name))
730 return (flags & REL_EQ) ? 1 : 0;
735 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
740 return (flags & REL_LT) ? 1 : 0;
742 return (flags & REL_EQ) ? 1 : 0;
744 return (flags & REL_GT) ? 1 : 0;
746 return (flags & REL_EQ) ? 1 : 0;
753 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
754 /* forward declaration */
755 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
758 /* match (flags, evr) against provider (pflags, pevr) */
760 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
762 if (!pflags || !flags || pflags >= 8 || flags >= 8)
764 if (flags == 7 || pflags == 7)
765 return 1; /* rel provides every version */
766 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
767 return 1; /* both rels show in the same direction */
769 return (flags & pflags & REL_EQ) ? 1 : 0;
770 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
773 Reldep *rd = GETRELDEP(pool, pevr);
774 if (rd->flags == REL_COMPAT)
775 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
778 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
781 return (pflags & REL_EQ) ? 1 : 0;
783 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
785 return (flags & pflags & REL_EQ) ? 1 : 0;
787 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
789 return (flags & REL_EQ) ? 1 : 0;
796 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
798 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
800 /* range->name is the actual version, range->evr the backwards compatibility
801 version. If flags are '>=' or '>', we match the compatibility version
802 as well, otherwise only the actual version. */
803 if (!(flags & REL_GT) || (flags & REL_LT))
804 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
805 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
806 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
810 /* public (i.e. not inlined) version of pool_match_flags_evr */
812 pool_intersect_evrs(Pool *pool, int pflags, Id pevr, int flags, Id evr)
814 return pool_match_flags_evr(pool, pflags, pevr, flags, evr);
817 /* match two dependencies (d1 = provider) */
820 pool_match_dep(Pool *pool, Id d1, Id d2)
829 /* we use potentially matches for complex deps */
830 rd1 = GETRELDEP(pool, d1);
831 if (rd1->flags == REL_AND || rd1->flags == REL_OR || rd1->flags == REL_WITH || rd1->flags == REL_WITHOUT || rd1->flags == REL_COND || rd1->flags == REL_UNLESS)
833 if (pool_match_dep(pool, rd1->name, d2))
835 if ((rd1->flags == REL_COND || rd1->flags == REL_UNLESS) && ISRELDEP(rd1->evr))
837 rd1 = GETRELDEP(pool, rd1->evr);
838 if (rd1->flags != REL_ELSE)
841 if (rd1->flags != REL_COND && rd1->flags != REL_UNLESS && rd1->flags != REL_WITHOUT && pool_match_dep(pool, rd1->evr, d2))
848 /* we use potentially matches for complex deps */
849 rd2 = GETRELDEP(pool, d2);
850 if (rd2->flags == REL_AND || rd2->flags == REL_OR || rd2->flags == REL_WITH || rd2->flags == REL_WITHOUT || rd2->flags == REL_COND || rd2->flags == REL_UNLESS)
852 if (pool_match_dep(pool, d1, rd2->name))
854 if ((rd2->flags == REL_COND || rd2->flags == REL_UNLESS) && ISRELDEP(rd2->evr))
856 rd2 = GETRELDEP(pool, rd2->evr);
857 if (rd2->flags != REL_ELSE)
860 if (rd2->flags != REL_COND && rd2->flags != REL_UNLESS && rd2->flags != REL_WITHOUT && pool_match_dep(pool, d1, rd2->evr))
868 return 0; /* cannot match as d1 != d2 */
869 rd2 = GETRELDEP(pool, d2);
870 return pool_match_dep(pool, d1, rd2->name);
872 rd1 = GETRELDEP(pool, d1);
875 return pool_match_dep(pool, rd1->name, d2);
877 rd2 = GETRELDEP(pool, d2);
878 /* first match name */
879 if (!pool_match_dep(pool, rd1->name, rd2->name))
881 /* name matches, check flags and evr */
882 return pool_intersect_evrs(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
886 pool_searchlazywhatprovidesq(Pool *pool, Id d)
889 int end = pool->lazywhatprovidesq.count;
893 elements = pool->lazywhatprovidesq.elements;
894 while (end - start > 16)
896 int mid = (start + end) / 2 & ~1;
897 if (elements[mid] == d)
898 return elements[mid + 1];
899 if (elements[mid] < d)
904 for (; start < end; start += 2)
905 if (elements[start] == d)
906 return elements[start + 1];
913 * lazy populating of the whatprovides array, non relation case
916 pool_addstdproviders(Pool *pool, Id d)
924 if (pool->addedfileprovides == 2)
926 pool->whatprovides[d] = 1;
929 str = pool->ss.stringspace + pool->ss.strings[d];
932 pool->whatprovides[d] = 1;
935 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
936 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES);
937 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
939 Solvable *s = pool->solvables + di.solvid;
940 /* XXX: maybe should add a provides dependency to the solvables
941 * OTOH this is only needed for rel deps that filter the provides,
942 * and those should not use filelist entries */
943 if (s->repo->disabled)
945 if (s->repo != pool->installed && !pool_installable(pool, s))
947 queue_push(&q, di.solvid);
949 dataiterator_free(&di);
950 oldoffset = pool_searchlazywhatprovidesq(pool, d);
952 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
957 Id *oo = pool->whatprovidesdata + oldoffset;
959 /* unify both queues. easy, as we know both are sorted */
960 for (i = 0; i < q.count; i++)
962 if (*oo > q.elements[i])
964 if (*oo < q.elements[i])
965 queue_insert(&q, i, *oo);
971 queue_push(&q, *oo++);
972 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
974 /* end result has same size as oldoffset -> no new entries */
976 pool->whatprovides[d] = oldoffset;
980 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
983 return pool->whatprovides[d];
988 pool_is_kind(Pool *pool, Id name, Id kind)
993 n = pool_id2str(pool, name);
996 const char *kn = pool_id2str(pool, kind);
997 int knl = strlen(kn);
998 return !strncmp(n, kn, knl) && n[knl] == ':' ? 1 : 0;
1004 while(*n >= 'a' && *n <= 'z')
1006 return *n == ':' ? 0 : 1;
1013 * some dependencies are of the from "foo = md5sum", like the
1014 * buildid provides. There's not much we can do to speed up
1015 * getting the providers, because rpm's complex evr comparison
1016 * rules get in the way. But we can use the first character(s)
1017 * of the md5sum to do a simple pre-check.
1020 rpmeqmagic(Pool *pool, Id evr)
1022 const char *s = pool_id2str(pool, evr);
1025 while (*s == '0' && s[1] >= '0' && s[1] <= '9')
1027 /* ignore epoch 0 */
1028 if (*s == '0' && s[1] == ':')
1031 while (*s == '0' && s[1] >= '0' && s[1] <= '9')
1035 if (*s >= '0' && *s <= '9')
1037 if (s[1] >= '0' && s[1] <= '9')
1038 return *s + (s[1] << 8);
1041 if ((*s >= 'a' && *s <= 'z') || (*s >= 'A' && *s <= 'Z'))
1043 if ((s[1] >= 'a' && s[1] <= 'z') || (s[1] >= 'A' && s[1] <= 'Z'))
1044 return *s + (s[1] << 8);
1051 rpmeqmagic_init(Pool *pool, int flags, Id evr)
1053 if (flags != REL_EQ || pool->disttype != DISTTYPE_RPM || pool->promoteepoch || ISRELDEP(evr))
1056 return rpmeqmagic(pool, evr);
1060 rpmeqmagic_cantmatch(Pool *pool, int flags, Id evr, int eqmagic)
1062 int peqmagic = rpmeqmagic(pool, evr);
1063 if (peqmagic > 0 && peqmagic != eqmagic)
1071 * add packages fulfilling the relation to whatprovides array
1073 * some words about REL_AND and REL_IF: we assume the best case
1074 * here, so that you get a "potential" result if you ask for a match.
1075 * E.g. if you ask for "whatrequires A" and package X contains
1076 * "Requires: A & B", you'll get "X" as an answer.
1079 pool_addrelproviders(Pool *pool, Id d)
1085 Id name, evr, flags;
1090 return pool_addstdproviders(pool, d);
1091 rd = GETRELDEP(pool, d);
1096 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
1100 /* special relation */
1107 wp = pool_whatprovides(pool, name);
1108 pp2 = pool_whatprovides_ptr(pool, evr);
1109 pp = pool->whatprovidesdata + wp;
1110 while ((p = *pp++) != 0)
1112 for (pp3 = pp2; *pp3; pp3++)
1116 queue_push(&plist, p); /* found it */
1122 wp = pool_whatprovides(pool, name);
1123 pp2 = pool_whatprovides_ptr(pool, evr);
1124 pp = pool->whatprovidesdata + wp;
1125 while ((p = *pp++) != 0)
1127 for (pp3 = pp2; *pp3; pp3++)
1131 queue_push(&plist, p); /* use it */
1140 if (flags == REL_COND || flags == REL_UNLESS)
1144 Reldep *rd2 = GETRELDEP(pool, evr);
1145 evr = rd2->flags == REL_ELSE ? rd2->evr : 0;
1148 evr = 0; /* assume cond is true */
1150 wp = pool_whatprovides(pool, name);
1151 if (!pool->whatprovidesdata[wp])
1152 wp = evr ? pool_whatprovides(pool, evr) : 1;
1156 pp2 = pool_whatprovides_ptr(pool, evr);
1157 pp = pool->whatprovidesdata + wp;
1161 queue_push(&plist, *pp++);
1166 queue_push(&plist, *pp2++);
1170 queue_push(&plist, *pp++);
1172 queue_push(&plist, *pp2++);
1173 /* if the number of elements did not change, we can reuse wp */
1174 if (pp - (pool->whatprovidesdata + wp) != plist.count)
1180 if (name == NAMESPACE_OTHERPROVIDERS)
1182 wp = pool_whatprovides(pool, evr);
1185 if (pool->nscallback)
1187 /* ask callback which packages provide the dependency
1189 * 1: the system (aka SYSTEMSOLVABLE)
1190 * >1: set of packages, stored as offset on whatprovidesdata
1192 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
1196 queue_push(&plist, SYSTEMSOLVABLE);
1200 /* small hack: make it possible to match <pkg>.src
1201 * we have to iterate over the solvables as src packages do not
1202 * provide anything, thus they are not indexed in our
1203 * whatprovides hash */
1204 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
1207 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
1211 if (s->arch != evr && s->arch != ARCH_NOSRC)
1213 if (pool_disabled_solvable(pool, s))
1215 if (!name || pool_match_nevr(pool, s, name))
1216 queue_push(&plist, p);
1222 FOR_POOL_SOLVABLES(p)
1224 Solvable *s = pool->solvables + p;
1225 if (s->repo != pool->installed && !pool_installable(pool, s))
1228 queue_push(&plist, p);
1232 wp = pool_whatprovides(pool, name);
1233 pp = pool->whatprovidesdata + wp;
1234 while ((p = *pp++) != 0)
1236 Solvable *s = pool->solvables + p;
1238 queue_push(&plist, p);
1244 if (evr != ARCH_ANY)
1246 /* XXX : need to check for Multi-Arch: allowed! */
1247 wp = pool_whatprovides(pool, name);
1250 /* package kind filtering */
1253 FOR_POOL_SOLVABLES(p)
1255 Solvable *s = pool->solvables + p;
1256 if (s->repo != pool->installed && !pool_installable(pool, s))
1258 if (pool_is_kind(pool, s->name, evr))
1259 queue_push(&plist, p);
1263 wp = pool_whatprovides(pool, name);
1264 pp = pool->whatprovidesdata + wp;
1265 while ((p = *pp++) != 0)
1267 Solvable *s = pool->solvables + p;
1268 if (pool_is_kind(pool, s->name, evr))
1269 queue_push(&plist, p);
1274 case REL_FILECONFLICT:
1275 pp = pool_whatprovides_ptr(pool, name);
1276 while ((p = *pp++) != 0)
1278 Id origd = MAKERELDEP(d);
1279 Solvable *s = pool->solvables + p;
1282 pidp = s->repo->idarraydata + s->provides;
1283 while ((pid = *pidp++) != 0)
1287 queue_push(&plist, p);
1292 wp = pool_whatprovides(pool, name);
1295 const char *evrstr = pool_id2str(pool, evr);
1296 pp = pool->whatprovidesdata + wp;
1297 while ((p = *pp++) != 0)
1299 if (solvable_conda_matchversion(pool->solvables + p, evrstr))
1300 queue_push(&plist, p);
1312 /* we can reuse an existing entry */
1314 pool->whatprovides_rel[d] = wp;
1322 /* simple version comparison relation */
1324 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1326 pp = pool_whatprovides_ptr(pool, name);
1327 if (!ISRELDEP(name) && name < pool->whatprovidesauxoff)
1328 ppaux = pool->whatprovidesaux[name] ? pool->whatprovidesauxdata + pool->whatprovidesaux[name] : 0;
1329 while (ISRELDEP(name))
1331 rd = GETRELDEP(pool, name);
1334 while ((p = *pp++) != 0)
1336 Solvable *s = pool->solvables + p;
1340 if (pid && pid != 1)
1343 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: aux hit %d %s\n", p, pool_dep2str(pool, pid));
1348 continue; /* wrong provides name */
1349 if (pool->disttype == DISTTYPE_DEB)
1350 continue; /* unversioned provides can never match versioned deps */
1354 prd = GETRELDEP(pool, pid);
1355 if (prd->name != name)
1356 continue; /* wrong provides name */
1358 eqmagic = rpmeqmagic_init(pool, flags, evr);
1359 if (eqmagic > 0 && prd->flags == REL_EQ && !ISRELDEP(prd->evr) &&
1360 rpmeqmagic_cantmatch(pool, prd->flags, prd->evr, eqmagic))
1362 /* right package, both deps are rels. check flags/evr */
1363 if (!pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1366 queue_push(&plist, p);
1372 /* no provides - check nevr */
1373 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1374 queue_push(&plist, p);
1377 /* solvable p provides name in some rels */
1379 eqmagic = rpmeqmagic_init(pool, flags, evr);
1380 pidp = s->repo->idarraydata + s->provides;
1381 while ((pid = *pidp++) != 0)
1386 continue; /* wrong provides name */
1387 if (pool->disttype == DISTTYPE_DEB)
1388 continue; /* unversioned provides can never match versioned deps */
1391 prd = GETRELDEP(pool, pid);
1392 if (prd->name != name)
1393 continue; /* wrong provides name */
1394 /* right package, both deps are rels. check flags/evr */
1395 if (eqmagic > 0 && prd->flags == REL_EQ && !ISRELDEP(prd->evr) &&
1396 rpmeqmagic_cantmatch(pool, prd->flags, prd->evr, eqmagic))
1398 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1399 break; /* matches */
1402 continue; /* none of the providers matched */
1403 queue_push(&plist, p);
1405 /* make our system solvable provide all unknown rpmlib() stuff */
1406 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1407 queue_push(&plist, SYSTEMSOLVABLE);
1409 /* add providers to whatprovides */
1411 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1413 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1416 return pool->whatprovides_rel[d];
1420 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1422 int nrels = pool->nrels;
1426 if (!pool->whatprovides_rel)
1428 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1430 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1432 if (ns && rd->name != ns)
1434 if (evr && rd->evr != evr)
1436 if (pool->whatprovides_rel[d])
1437 pool_set_whatprovides(pool, MAKERELDEP(d), 0);
1441 /* intersect dependencies in keyname with dep, return list of matching packages */
1443 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1450 if (keyname == SOLVABLE_NAME)
1453 FOR_PROVIDES(p, pp, dep)
1454 if (pool_match_dep(pool, p, dep))
1459 FOR_POOL_SOLVABLES(p)
1461 Solvable *s = pool->solvables + p;
1462 if (s->repo->disabled)
1464 if (s->repo != pool->installed && !pool_installable(pool, s))
1468 solvable_lookup_deparray(s, keyname, &qq, marker);
1469 for (i = 0; i < qq.count; i++)
1470 if (pool_match_dep(pool, qq.elements[i], dep))
1479 /* check if keyname contains dep, return list of matching packages */
1481 pool_whatcontainsdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1491 FOR_POOL_SOLVABLES(p)
1493 Solvable *s = pool->solvables + p;
1494 if (s->repo->disabled)
1496 if (s->repo != pool->installed && !pool_installable(pool, s))
1500 solvable_lookup_deparray(s, keyname, &qq, marker);
1501 for (i = 0; i < qq.count; i++)
1502 if (qq.elements[i] == dep)
1511 /* intersect dependencies in keyname with all provides of solvable solvid,
1512 * return list of matching packages */
1513 /* this currently only works for installable packages */
1515 pool_whatmatchessolvable(Pool *pool, Id keyname, Id solvid, Queue *q, int marker)
1519 Map missc; /* cache for misses */
1524 reloff = pool->ss.nstrings;
1525 map_init(&missc, reloff + pool->nrels);
1526 FOR_POOL_SOLVABLES(p)
1528 Solvable *s = pool->solvables + p;
1530 continue; /* filter out self-matches */
1531 if (s->repo->disabled)
1533 if (s->repo != pool->installed && !pool_installable(pool, s))
1535 if (solvable_matchessolvable_int(s, keyname, marker, solvid, 0, &qq, &missc, reloff))
1542 /*************************************************************************/
1545 pool_debug(Pool *pool, int type, const char *format, ...)
1550 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1552 if ((pool->debugmask & type) == 0)
1555 va_start(args, format);
1556 if (!pool->debugcallback)
1558 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1559 vprintf(format, args);
1561 vfprintf(stderr, format, args);
1565 vsnprintf(buf, sizeof(buf), format, args);
1567 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1571 pool_error(Pool *pool, int ret, const char *format, ...)
1578 va_start(args, format);
1581 pool->errstra = 1024;
1582 pool->errstr = solv_malloc(pool->errstra);
1590 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1592 if (l >= 0 && l + 1 > pool->errstra)
1594 pool->errstra = l + 256;
1595 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1596 va_start(args, format);
1597 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1601 strcpy(pool->errstr, "unknown error");
1602 if (pool->debugmask & SOLV_ERROR)
1603 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1608 pool_errstr(Pool *pool)
1610 return pool->errstr ? pool->errstr : "no error";
1614 pool_setdebuglevel(Pool *pool, int level)
1616 int mask = SOLV_DEBUG_RESULT;
1618 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1620 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1622 mask |= SOLV_DEBUG_PROPAGATE;
1624 mask |= SOLV_DEBUG_RULE_CREATION | SOLV_DEBUG_WATCHES;
1625 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1626 pool->debugmask = mask;
1629 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct s_Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1631 pool->debugcallback = debugcallback;
1632 pool->debugcallbackdata = debugcallbackdata;
1635 void pool_setdebugmask(Pool *pool, int mask)
1637 pool->debugmask = mask;
1640 void pool_setloadcallback(Pool *pool, int (*cb)(struct s_Pool *, struct s_Repodata *, void *), void *loadcbdata)
1642 pool->loadcallback = cb;
1643 pool->loadcallbackdata = loadcbdata;
1646 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct s_Pool *, void *, Id, Id), void *nscbdata)
1648 pool->nscallback = cb;
1649 pool->nscallbackdata = nscbdata;
1653 pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct s_Repodata *data, struct s_Repokey *key, struct s_KeyValue *kv), void *cbdata)
1657 if (pool->solvables[p].repo)
1658 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1661 /* FIXME: obey callback return value! */
1662 for (p = 1; p < pool->nsolvables; p++)
1663 if (pool->solvables[p].repo)
1664 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1668 pool_clear_pos(Pool *pool)
1670 memset(&pool->pos, 0, sizeof(pool->pos));
1674 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1678 pool->languagecache = solv_free(pool->languagecache);
1679 pool->languagecacheother = 0;
1680 for (i = 0; i < pool->nlanguages; i++)
1681 free((char *)pool->languages[i]);
1682 pool->languages = solv_free((void *)pool->languages);
1683 pool->nlanguages = nlanguages;
1686 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1687 for (i = 0; i < pool->nlanguages; i++)
1688 pool->languages[i] = solv_strdup(languages[i]);
1692 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1698 if (!lang || !*lang)
1700 n = pool_id2str(pool, id);
1701 l = strlen(n) + strlen(lang) + 2;
1702 if (l > sizeof(buf))
1703 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1706 sprintf(p, "%s:%s", n, lang);
1707 id = pool_str2id(pool, p, create);
1714 pool_alloctmpspace(Pool *pool, int len)
1716 int n = pool->tmpspace.n;
1719 if (len > pool->tmpspace.len[n])
1721 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1722 pool->tmpspace.len[n] = len + 32;
1724 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1725 return pool->tmpspace.buf[n];
1729 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1734 n = oldn = pool->tmpspace.n;
1738 n = POOL_TMPSPACEBUF - 1;
1741 if (pool->tmpspace.buf[n] != space)
1743 if (len > pool->tmpspace.len[n])
1745 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1746 pool->tmpspace.len[n] = len + 32;
1748 return pool->tmpspace.buf[n];
1755 pool_freetmpspace(Pool *pool, const char *space)
1757 int n = pool->tmpspace.n;
1760 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1761 if (pool->tmpspace.buf[n] == space)
1762 pool->tmpspace.n = n;
1766 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1770 l1 = str1 ? strlen(str1) : 0;
1771 l2 = str2 ? strlen(str2) : 0;
1772 l3 = str3 ? strlen(str3) : 0;
1773 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1794 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1799 l1 = str1 ? strlen(str1) : 0;
1800 l2 = str2 ? strlen(str2) : 0;
1801 l3 = str3 ? strlen(str3) : 0;
1802 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1806 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1829 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1834 s = pool_alloctmpspace(pool, 2 * len + 1);
1835 solv_bin2hex(buf, len, s);
1840 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1842 if (entry == SOLVID_POS && pool->pos.repo)
1843 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1846 return solvable_lookup_str(pool->solvables + entry, keyname);
1850 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1852 if (entry == SOLVID_POS && pool->pos.repo)
1853 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1856 return solvable_lookup_id(pool->solvables + entry, keyname);
1860 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
1862 if (entry == SOLVID_POS && pool->pos.repo)
1863 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
1866 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1870 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1872 if (entry == SOLVID_POS && pool->pos.repo)
1873 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1876 return solvable_lookup_void(pool->solvables + entry, keyname);
1879 const unsigned char *
1880 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1882 if (entry == SOLVID_POS && pool->pos.repo)
1883 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
1886 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1890 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1892 if (entry == SOLVID_POS && pool->pos.repo)
1893 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
1896 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1900 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
1902 if (entry == SOLVID_POS && pool->pos.repo)
1903 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
1906 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
1910 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
1915 if (entry != SOLVID_POS)
1917 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
1918 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
1919 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
1920 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
1925 pool_set_whatprovides(Pool *pool, Id id, Id providers)
1927 int d, nrels = pool->nrels;
1935 pool->whatprovides_rel[d] = providers;
1940 pool->whatprovides[id] = providers;
1941 if (id < pool->whatprovidesauxoff)
1942 pool->whatprovidesaux[id] = 0; /* sorry */
1945 if (!pool->whatprovides_rel)
1947 /* clear cache of all rels that use it */
1949 for (rd = pool->rels + d; d < nrels; d++, rd++)
1951 if (rd->name == id || rd->evr == id ||
1952 (m.size && ISRELDEP(rd->name) && MAPTST(&m, GETRELID(rd->name))) ||
1953 (m.size && ISRELDEP(rd->evr) && MAPTST(&m, GETRELID(rd->evr))))
1955 pool->whatprovides_rel[d] = 0; /* clear cache */
1957 map_init(&m, nrels);
1965 add_new_provider(Pool *pool, Id id, Id p)
1970 /* find whatprovides entry */
1971 while (ISRELDEP(id))
1973 Reldep *rd = GETRELDEP(pool, id);
1977 /* add new provider to existing list keeping it sorted */
1979 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
1983 queue_free(&q); /* already have it */
1991 queue_push(&q, *pp);
1995 pool_set_whatprovides(pool, id, pool_queuetowhatprovides(pool, &q));
2000 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2002 int hadhashes = pool->relhashtbl ? 1 : 0;
2008 if (!conflicts->count)
2010 for (i = 0; i < conflicts->count; i += 6)
2012 fn = conflicts->elements[i];
2013 p = conflicts->elements[i + 1];
2014 md5 = conflicts->elements[i + 2];
2015 q = conflicts->elements[i + 4];
2016 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2017 s = pool->solvables + p;
2020 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2021 if (pool->whatprovides)
2022 add_new_provider(pool, id, p);
2023 s = pool->solvables + q;
2026 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2029 pool_freeidhashes(pool);
2033 pool_prepend_rootdir(Pool *pool, const char *path)
2038 return solv_strdup(path);
2039 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2043 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2049 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2053 pool_set_rootdir(Pool *pool, const char *rootdir)
2055 solv_free(pool->rootdir);
2056 pool->rootdir = solv_strdup(rootdir);
2060 pool_get_rootdir(Pool *pool)
2062 return pool->rootdir;
2065 /* only used in libzypp */
2067 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2069 pool->custom_vendorcheck = vendorcheck;