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;
205 case POOL_FLAG_WHATPROVIDESWITHDISABLED:
206 return pool->whatprovideswithdisabled;
214 pool_set_flag(Pool *pool, int flag, int value)
216 int old = pool_get_flag(pool, flag);
219 case POOL_FLAG_PROMOTEEPOCH:
220 pool->promoteepoch = value;
222 case POOL_FLAG_FORBIDSELFCONFLICTS:
223 pool->forbidselfconflicts = value;
225 case POOL_FLAG_OBSOLETEUSESPROVIDES:
226 pool->obsoleteusesprovides = value;
228 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
229 pool->implicitobsoleteusesprovides = value;
231 case POOL_FLAG_OBSOLETEUSESCOLORS:
232 pool->obsoleteusescolors = value;
234 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
235 pool->implicitobsoleteusescolors = value;
237 case POOL_FLAG_NOINSTALLEDOBSOLETES:
238 pool->noinstalledobsoletes = value;
240 case POOL_FLAG_HAVEDISTEPOCH:
241 pool->havedistepoch = value;
243 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
244 pool->noobsoletesmultiversion = value;
246 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
247 pool->addfileprovidesfiltered = value;
249 case POOL_FLAG_NOWHATPROVIDESAUX:
250 pool->nowhatprovidesaux = value;
252 case POOL_FLAG_WHATPROVIDESWITHDISABLED:
253 pool->whatprovideswithdisabled = value;
263 pool_add_solvable(Pool *pool)
265 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
266 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
267 return pool->nsolvables++;
271 pool_add_solvable_block(Pool *pool, int count)
273 Id nsolvables = pool->nsolvables;
276 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
277 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
278 pool->nsolvables += count;
283 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
287 if (reuseids && start + count == pool->nsolvables)
289 /* might want to shrink solvable array */
290 pool->nsolvables = start;
293 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
298 pool_set_installed(Pool *pool, Repo *installed)
300 if (pool->installed == installed)
302 pool->installed = installed;
303 pool_freewhatprovides(pool);
307 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
312 oa = pool->whatprovides[*(Id *)ap];
313 ob = pool->whatprovides[*(Id *)bp];
315 return *(Id *)ap - *(Id *)bp;
316 da = pool->whatprovidesdata + oa;
317 db = pool->whatprovidesdata + ob;
319 if ((r = (*da++ - *db++)) != 0)
323 return *(Id *)ap - *(Id *)bp;
327 * pool_shrink_whatprovides - unify whatprovides data
329 * whatprovides_rel must be empty for this to work!
333 pool_shrink_whatprovides(Pool *pool)
337 Id lastid, *last, *dp, *lp;
341 if (pool->ss.nstrings < 3)
343 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
344 for (i = id = 0; id < pool->ss.nstrings; id++)
345 if (pool->whatprovides[id] >= 4)
348 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
351 for (i = 0; i < n; i++)
354 o = pool->whatprovides[id];
355 dp = pool->whatprovidesdata + o;
369 pool->whatprovides[id] = -lastid;
373 last = pool->whatprovidesdata + o;
377 dp = pool->whatprovidesdata + 4;
378 for (id = 1; id < pool->ss.nstrings; id++)
380 o = pool->whatprovides[id];
388 pool->whatprovides[id] = pool->whatprovides[i];
393 lp = pool->whatprovidesdata + o;
396 pool->whatprovides[id] = dp - pool->whatprovidesdata;
397 while ((*dp++ = *lp++) != 0)
400 o = dp - pool->whatprovidesdata;
401 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
402 if (pool->whatprovidesdataoff == o)
404 r = pool->whatprovidesdataoff - o;
405 pool->whatprovidesdataoff = o;
406 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
407 if (r > pool->whatprovidesdataleft)
408 r = pool->whatprovidesdataleft;
409 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
412 /* this gets rid of all the zeros in the aux */
414 pool_shrink_whatprovidesaux(Pool *pool)
416 int num = pool->whatprovidesauxoff;
419 Id *op, *wp = pool->whatprovidesauxdata + 1;
422 for (i = 0; i < num; i++)
424 Offset o = pool->whatprovidesaux[i];
427 op = pool->whatprovidesauxdata + o;
428 pool->whatprovidesaux[i] = wp - pool->whatprovidesauxdata;
431 while ((id = *op++) != 0)
434 newoff = wp - pool->whatprovidesauxdata;
435 pool->whatprovidesauxdata = solv_realloc(pool->whatprovidesauxdata, newoff * sizeof(Id));
436 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesauxdata from %d to %d\n", pool->whatprovidesauxdataoff, newoff);
437 pool->whatprovidesauxdataoff = newoff;
442 * pool_createwhatprovides()
444 * create hashes over pool of solvables to ease provide lookups
448 pool_createwhatprovides(Pool *pool)
450 int i, num, np, extra;
455 Offset *whatprovides;
456 Id *whatprovidesdata, *dp, *whatprovidesauxdata;
457 Offset *whatprovidesaux;
460 now = solv_timems(0);
461 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
462 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
463 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);
464 if (pool->ss.stringhashmask || pool->relhashmask)
465 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)));
467 pool_freeidhashes(pool); /* XXX: should not be here! */
468 pool_freewhatprovides(pool);
469 num = pool->ss.nstrings;
470 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
471 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
473 /* count providers for each name */
474 for (i = pool->nsolvables - 1; i > 0; i--)
477 s = pool->solvables + i;
478 if (!s->provides || !s->repo || s->repo->disabled)
480 if (!pool_installable_whatprovides(pool, s))
482 pp = s->repo->idarraydata + s->provides;
483 while ((id = *pp++) != 0)
487 Reldep *rd = GETRELDEP(pool, id);
490 whatprovides[id]++; /* inc count of providers */
494 off = 4; /* first entry is undef, second is empty list, third is system solvable */
495 np = 0; /* number of names provided */
496 for (i = 0, idp = whatprovides; i < num; i++, idp++)
499 if (!n) /* no providers */
501 *idp = 1; /* offset for empty list */
504 off += n; /* make space for all providers */
505 *idp = off++; /* now idp points to terminating zero */
506 np++; /* inc # of provider 'slots' for stats */
509 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
511 /* reserve some space for relation data */
512 extra = 2 * pool->nrels;
516 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
518 /* alloc space for all providers + extra */
519 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
520 whatprovidesdata[2] = SYSTEMSOLVABLE;
522 /* alloc aux vector */
523 whatprovidesauxdata = 0;
524 if (!pool->nowhatprovidesaux)
526 pool->whatprovidesaux = whatprovidesaux = solv_calloc(num, sizeof(Offset));
527 pool->whatprovidesauxoff = num;
528 pool->whatprovidesauxdataoff = off;
529 pool->whatprovidesauxdata = whatprovidesauxdata = solv_calloc(pool->whatprovidesauxdataoff, sizeof(Id));
532 /* now fill data for all provides */
533 for (i = pool->nsolvables - 1; i > 0; i--)
536 s = pool->solvables + i;
537 if (!s->provides || !s->repo || s->repo->disabled)
539 if (!pool_installable_whatprovides(pool, s))
541 /* for all provides of this solvable */
542 pp = s->repo->idarraydata + s->provides;
543 while ((id = *pp++) != 0)
548 Reldep *rd = GETRELDEP(pool, id);
551 dp = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
552 if (*dp != i) /* don't add same solvable twice */
559 if (whatprovidesauxdata)
560 whatprovidesauxdata[whatprovides[id]] = auxid;
563 if (pool->whatprovidesaux)
564 memcpy(pool->whatprovidesaux, pool->whatprovides, num * sizeof(Id));
565 pool->whatprovidesdata = whatprovidesdata;
566 pool->whatprovidesdataoff = off;
567 pool->whatprovidesdataleft = extra;
568 pool_shrink_whatprovides(pool);
569 if (pool->whatprovidesaux)
570 pool_shrink_whatprovidesaux(pool);
571 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)));
572 if (pool->whatprovidesaux)
573 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)));
575 queue_empty(&pool->lazywhatprovidesq);
576 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
578 if (!pool->addedfileprovides)
579 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
580 /* lazyly add file provides */
581 for (i = 1; i < num; i++)
583 const char *str = pool->ss.stringspace + pool->ss.strings[i];
586 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
588 /* setup lazy adding, but remember old value */
589 if (pool->whatprovides[i] > 1)
590 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
591 pool->whatprovides[i] = 0;
592 if (pool->whatprovidesaux)
593 pool->whatprovidesaux[i] = 0; /* sorry */
595 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
598 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
602 * free all of our whatprovides data
603 * be careful, everything internalized with pool_queuetowhatprovides is
607 pool_freewhatprovides(Pool *pool)
609 pool->whatprovides = solv_free(pool->whatprovides);
610 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
611 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
612 pool->whatprovidesdataoff = 0;
613 pool->whatprovidesdataleft = 0;
614 pool->whatprovidesaux = solv_free(pool->whatprovidesaux);
615 pool->whatprovidesauxdata = solv_free(pool->whatprovidesauxdata);
616 pool->whatprovidesauxoff = 0;
617 pool->whatprovidesauxdataoff = 0;
621 /******************************************************************************/
624 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
626 * used for whatprovides, jobs, learnt rules, selections
627 * input: q: queue of Ids
628 * returns: Offset into whatprovidesdata
633 pool_ids2whatprovides(Pool *pool, Id *ids, int count)
637 if (count == 0) /* queue empty -> 1 */
639 if (count == 1 && *ids == SYSTEMSOLVABLE)
642 /* extend whatprovidesdata if needed, +1 for 0-termination */
643 if (pool->whatprovidesdataleft < count + 1)
645 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
646 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
647 pool->whatprovidesdataleft = count + 4096;
650 /* copy queue to next free slot */
651 off = pool->whatprovidesdataoff;
652 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, ids, count * sizeof(Id));
654 /* adapt count and 0-terminate */
655 pool->whatprovidesdataoff += count;
656 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
657 pool->whatprovidesdataleft -= count + 1;
663 pool_queuetowhatprovides(Pool *pool, Queue *q)
665 int count = q->count;
666 if (count == 0) /* queue empty -> 1 */
668 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
670 return pool_ids2whatprovides(pool, q->elements, count);
674 /*************************************************************************/
676 #if defined(MULTI_SEMANTICS)
677 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
678 #elif defined(DEBIAN)
679 # define EVRCMP_DEPCMP EVRCMP_COMPARE
681 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
684 /* check if a package's nevr matches a dependency */
685 /* semi-private, called from public pool_match_nevr */
688 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
690 Reldep *rd = GETRELDEP(pool, d);
693 int flags = rd->flags;
702 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
705 return pool_match_nevr(pool, s, name);
707 if (pool_match_nevr(pool, s, name))
709 return pool_match_nevr(pool, s, evr);
712 if (!pool_match_nevr(pool, s, name))
714 return pool_match_nevr(pool, s, evr);
716 if (!pool_match_nevr(pool, s, name))
718 return !pool_match_nevr(pool, s, evr);
722 /* XXX : need to check for Multi-Arch: allowed! */
723 return pool_match_nevr(pool, s, name);
728 if (!pool_match_nevr(pool, s, name))
731 return (flags & REL_EQ) ? 1 : 0;
736 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
741 return (flags & REL_LT) ? 1 : 0;
743 return (flags & REL_EQ) ? 1 : 0;
745 return (flags & REL_GT) ? 1 : 0;
747 return (flags & REL_EQ) ? 1 : 0;
754 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
755 /* forward declaration */
756 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
759 /* match (flags, evr) against provider (pflags, pevr) */
761 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
763 if (!pflags || !flags || pflags >= 8 || flags >= 8)
765 if (flags == 7 || pflags == 7)
766 return 1; /* rel provides every version */
767 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
768 return 1; /* both rels show in the same direction */
770 return (flags & pflags & REL_EQ) ? 1 : 0;
771 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
774 Reldep *rd = GETRELDEP(pool, pevr);
775 if (rd->flags == REL_COMPAT)
776 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
779 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
782 return (pflags & REL_EQ) ? 1 : 0;
784 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
786 return (flags & pflags & REL_EQ) ? 1 : 0;
788 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
790 return (flags & REL_EQ) ? 1 : 0;
797 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
799 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
801 /* range->name is the actual version, range->evr the backwards compatibility
802 version. If flags are '>=' or '>', we match the compatibility version
803 as well, otherwise only the actual version. */
804 if (!(flags & REL_GT) || (flags & REL_LT))
805 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
806 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
807 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
811 /* public (i.e. not inlined) version of pool_match_flags_evr */
813 pool_intersect_evrs(Pool *pool, int pflags, Id pevr, int flags, Id evr)
815 return pool_match_flags_evr(pool, pflags, pevr, flags, evr);
820 is_interval_dep(Pool *pool, Id d1, Id d2)
823 if (!ISRELDEP(d1) || !ISRELDEP(d2))
825 rd1 = GETRELDEP(pool, d1);
826 rd2 = GETRELDEP(pool, d2);
827 if (rd1->name != rd2->name || rd1->flags >= 8 || rd2->flags >= 8)
829 if (((rd1->flags ^ rd2->flags) & (REL_LT|REL_GT)) != (REL_LT|REL_GT))
835 /* match two dependencies (d1 = provider) */
838 pool_match_dep(Pool *pool, Id d1, Id d2)
847 /* we use potentially matches for complex deps */
848 rd1 = GETRELDEP(pool, d1);
849 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)
851 if (rd1->flags == REL_WITH && is_interval_dep(pool, rd1->name, rd1->evr))
852 return pool_match_dep(pool, rd1->name, d2) && pool_match_dep(pool, rd1->evr, d2);
853 if (pool_match_dep(pool, rd1->name, d2))
855 if ((rd1->flags == REL_COND || rd1->flags == REL_UNLESS) && ISRELDEP(rd1->evr))
857 rd1 = GETRELDEP(pool, rd1->evr);
858 if (rd1->flags != REL_ELSE)
861 if (rd1->flags != REL_COND && rd1->flags != REL_UNLESS && rd1->flags != REL_WITHOUT && pool_match_dep(pool, rd1->evr, d2))
868 /* we use potentially matches for complex deps */
869 rd2 = GETRELDEP(pool, d2);
870 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)
872 if (rd2->flags == REL_WITH && is_interval_dep(pool, rd2->name, rd2->evr))
873 return pool_match_dep(pool, d1, rd2->name) && pool_match_dep(pool, d1, rd2->evr);
874 if (pool_match_dep(pool, d1, rd2->name))
876 if ((rd2->flags == REL_COND || rd2->flags == REL_UNLESS) && ISRELDEP(rd2->evr))
878 rd2 = GETRELDEP(pool, rd2->evr);
879 if (rd2->flags != REL_ELSE)
882 if (rd2->flags != REL_COND && rd2->flags != REL_UNLESS && rd2->flags != REL_WITHOUT && pool_match_dep(pool, d1, rd2->evr))
890 return 0; /* cannot match as d1 != d2 */
891 rd2 = GETRELDEP(pool, d2);
892 return pool_match_dep(pool, d1, rd2->name);
894 rd1 = GETRELDEP(pool, d1);
897 return pool_match_dep(pool, rd1->name, d2);
899 rd2 = GETRELDEP(pool, d2);
900 /* first match name */
901 if (!pool_match_dep(pool, rd1->name, rd2->name))
903 /* name matches, check flags and evr */
904 return pool_intersect_evrs(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
908 pool_searchlazywhatprovidesq(Pool *pool, Id d)
911 int end = pool->lazywhatprovidesq.count;
915 elements = pool->lazywhatprovidesq.elements;
916 while (end - start > 16)
918 int mid = (start + end) / 2 & ~1;
919 if (elements[mid] == d)
920 return elements[mid + 1];
921 if (elements[mid] < d)
926 for (; start < end; start += 2)
927 if (elements[start] == d)
928 return elements[start + 1];
935 * lazy populating of the whatprovides array, non relation case
938 pool_addstdproviders(Pool *pool, Id d)
946 if (pool->addedfileprovides == 2)
948 pool->whatprovides[d] = 1;
951 str = pool->ss.stringspace + pool->ss.strings[d];
954 pool->whatprovides[d] = 1;
957 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
958 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES);
959 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
961 Solvable *s = pool->solvables + di.solvid;
962 /* XXX: maybe should add a provides dependency to the solvables
963 * OTOH this is only needed for rel deps that filter the provides,
964 * and those should not use filelist entries */
965 if (s->repo->disabled)
967 if (!pool_installable_whatprovides(pool, s))
969 queue_push(&q, di.solvid);
971 dataiterator_free(&di);
972 oldoffset = pool_searchlazywhatprovidesq(pool, d);
974 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
979 Id *oo = pool->whatprovidesdata + oldoffset;
981 /* unify both queues. easy, as we know both are sorted */
982 for (i = 0; i < q.count; i++)
984 if (*oo > q.elements[i])
986 if (*oo < q.elements[i])
987 queue_insert(&q, i, *oo);
993 queue_push(&q, *oo++);
994 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
996 /* end result has same size as oldoffset -> no new entries */
998 pool->whatprovides[d] = oldoffset;
1002 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
1005 return pool->whatprovides[d];
1010 pool_is_kind(Pool *pool, Id name, Id kind)
1015 n = pool_id2str(pool, name);
1018 const char *kn = pool_id2str(pool, kind);
1019 int knl = strlen(kn);
1020 return !strncmp(n, kn, knl) && n[knl] == ':' ? 1 : 0;
1026 while(*n >= 'a' && *n <= 'z')
1028 return *n == ':' ? 0 : 1;
1035 * some dependencies are of the from "foo = md5sum", like the
1036 * buildid provides. There's not much we can do to speed up
1037 * getting the providers, because rpm's complex evr comparison
1038 * rules get in the way. But we can use the first character(s)
1039 * of the md5sum to do a simple pre-check.
1042 rpmeqmagic(Pool *pool, Id evr)
1044 const char *s = pool_id2str(pool, evr);
1047 while (*s == '0' && s[1] >= '0' && s[1] <= '9')
1049 /* ignore epoch 0 */
1050 if (*s == '0' && s[1] == ':')
1053 while (*s == '0' && s[1] >= '0' && s[1] <= '9')
1057 if (*s >= '0' && *s <= '9')
1059 if (s[1] >= '0' && s[1] <= '9')
1060 return *s + (s[1] << 8);
1063 if ((*s >= 'a' && *s <= 'z') || (*s >= 'A' && *s <= 'Z'))
1065 if ((s[1] >= 'a' && s[1] <= 'z') || (s[1] >= 'A' && s[1] <= 'Z'))
1066 return *s + (s[1] << 8);
1073 rpmeqmagic_init(Pool *pool, int flags, Id evr)
1075 if (flags != REL_EQ || pool->disttype != DISTTYPE_RPM || pool->promoteepoch || ISRELDEP(evr))
1078 return rpmeqmagic(pool, evr);
1082 rpmeqmagic_cantmatch(Pool *pool, int flags, Id evr, int eqmagic)
1084 int peqmagic = rpmeqmagic(pool, evr);
1085 if (peqmagic > 0 && peqmagic != eqmagic)
1093 * add packages fulfilling the relation to whatprovides array
1095 * some words about REL_AND and REL_IF: we assume the best case
1096 * here, so that you get a "potential" result if you ask for a match.
1097 * E.g. if you ask for "whatrequires A" and package X contains
1098 * "Requires: A & B", you'll get "X" as an answer.
1101 pool_addrelproviders(Pool *pool, Id d)
1107 Id name, evr, flags;
1112 return pool_addstdproviders(pool, d);
1113 rd = GETRELDEP(pool, d);
1118 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
1122 /* special relation */
1129 wp = pool_whatprovides(pool, name);
1130 pp2 = pool_whatprovides_ptr(pool, evr);
1131 pp = pool->whatprovidesdata + wp;
1132 while ((p = *pp++) != 0)
1134 for (pp3 = pp2; *pp3; pp3++)
1138 queue_push(&plist, p); /* found it */
1144 wp = pool_whatprovides(pool, name);
1145 pp2 = pool_whatprovides_ptr(pool, evr);
1146 pp = pool->whatprovidesdata + wp;
1147 while ((p = *pp++) != 0)
1149 for (pp3 = pp2; *pp3; pp3++)
1153 queue_push(&plist, p); /* use it */
1162 if (flags == REL_COND || flags == REL_UNLESS)
1166 Reldep *rd2 = GETRELDEP(pool, evr);
1167 evr = rd2->flags == REL_ELSE ? rd2->evr : 0;
1170 evr = 0; /* assume cond is true */
1172 wp = pool_whatprovides(pool, name);
1173 if (!pool->whatprovidesdata[wp])
1174 wp = evr ? pool_whatprovides(pool, evr) : 1;
1178 pp2 = pool_whatprovides_ptr(pool, evr);
1179 pp = pool->whatprovidesdata + wp;
1183 queue_push(&plist, *pp++);
1188 queue_push(&plist, *pp2++);
1192 queue_push(&plist, *pp++);
1194 queue_push(&plist, *pp2++);
1195 /* if the number of elements did not change, we can reuse wp */
1196 if (pp - (pool->whatprovidesdata + wp) != plist.count)
1202 if (name == NAMESPACE_OTHERPROVIDERS)
1204 wp = pool_whatprovides(pool, evr);
1207 if (pool->nscallback)
1209 /* ask callback which packages provide the dependency
1211 * 1: the system (aka SYSTEMSOLVABLE)
1212 * >1: set of packages, stored as offset on whatprovidesdata
1214 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
1218 queue_push(&plist, SYSTEMSOLVABLE);
1222 /* small hack: make it possible to match <pkg>.src
1223 * we have to iterate over the solvables as src packages do not
1224 * provide anything, thus they are not indexed in our
1225 * whatprovides hash */
1226 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
1229 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
1233 if (s->arch != evr && s->arch != ARCH_NOSRC)
1235 if (pool_disabled_solvable(pool, s))
1237 if (!name || pool_match_nevr(pool, s, name))
1238 queue_push(&plist, p);
1244 FOR_POOL_SOLVABLES(p)
1246 Solvable *s = pool->solvables + p;
1247 if (!pool_installable_whatprovides(pool, s))
1250 queue_push(&plist, p);
1254 wp = pool_whatprovides(pool, name);
1255 pp = pool->whatprovidesdata + wp;
1256 while ((p = *pp++) != 0)
1258 Solvable *s = pool->solvables + p;
1260 queue_push(&plist, p);
1266 if (evr != ARCH_ANY)
1268 /* XXX : need to check for Multi-Arch: allowed! */
1269 wp = pool_whatprovides(pool, name);
1272 /* package kind filtering */
1275 FOR_POOL_SOLVABLES(p)
1277 Solvable *s = pool->solvables + p;
1278 if (s->repo != pool->installed && !pool_installable(pool, s))
1280 if (pool_is_kind(pool, s->name, evr))
1281 queue_push(&plist, p);
1285 wp = pool_whatprovides(pool, name);
1286 pp = pool->whatprovidesdata + wp;
1287 while ((p = *pp++) != 0)
1289 Solvable *s = pool->solvables + p;
1290 if (pool_is_kind(pool, s->name, evr))
1291 queue_push(&plist, p);
1296 case REL_FILECONFLICT:
1297 pp = pool_whatprovides_ptr(pool, name);
1298 while ((p = *pp++) != 0)
1300 Id origd = MAKERELDEP(d);
1301 Solvable *s = pool->solvables + p;
1304 pidp = s->repo->idarraydata + s->provides;
1305 while ((pid = *pidp++) != 0)
1309 queue_push(&plist, p);
1314 wp = pool_addrelproviders_conda(pool, name, evr, &plist);
1322 /* we can reuse an existing entry */
1324 pool->whatprovides_rel[d] = wp;
1332 /* simple version comparison relation */
1334 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1336 pp = pool_whatprovides_ptr(pool, name);
1337 if (!ISRELDEP(name) && (Offset)name < pool->whatprovidesauxoff)
1338 ppaux = pool->whatprovidesaux[name] ? pool->whatprovidesauxdata + pool->whatprovidesaux[name] : 0;
1339 while (ISRELDEP(name))
1341 rd = GETRELDEP(pool, name);
1344 while ((p = *pp++) != 0)
1346 Solvable *s = pool->solvables + p;
1350 if (pid && pid != 1)
1353 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: aux hit %d %s\n", p, pool_dep2str(pool, pid));
1358 continue; /* wrong provides name */
1359 if (pool->disttype == DISTTYPE_DEB)
1360 continue; /* unversioned provides can never match versioned deps */
1364 prd = GETRELDEP(pool, pid);
1365 if (prd->name != name)
1366 continue; /* wrong provides name */
1368 eqmagic = rpmeqmagic_init(pool, flags, evr);
1369 if (eqmagic > 0 && prd->flags == REL_EQ && !ISRELDEP(prd->evr) &&
1370 rpmeqmagic_cantmatch(pool, prd->flags, prd->evr, eqmagic))
1372 /* right package, both deps are rels. check flags/evr */
1373 if (!pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1376 queue_push(&plist, p);
1380 if (!s->provides || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
1382 /* no provides or src rpm - check nevr */
1383 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1384 queue_push(&plist, p);
1387 /* solvable p provides name in some rels */
1389 eqmagic = rpmeqmagic_init(pool, flags, evr);
1390 pidp = s->repo->idarraydata + s->provides;
1391 while ((pid = *pidp++) != 0)
1396 continue; /* wrong provides name */
1397 if (pool->disttype == DISTTYPE_DEB)
1398 continue; /* unversioned provides can never match versioned deps */
1401 prd = GETRELDEP(pool, pid);
1402 if (prd->name != name)
1403 continue; /* wrong provides name */
1404 /* right package, both deps are rels. check flags/evr */
1405 if (eqmagic > 0 && prd->flags == REL_EQ && !ISRELDEP(prd->evr) &&
1406 rpmeqmagic_cantmatch(pool, prd->flags, prd->evr, eqmagic))
1408 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1409 break; /* matches */
1412 continue; /* none of the providers matched */
1413 queue_push(&plist, p);
1415 /* make our system solvable provide all unknown rpmlib() stuff */
1416 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1417 queue_push(&plist, SYSTEMSOLVABLE);
1419 /* add providers to whatprovides */
1421 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1423 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1426 return pool->whatprovides_rel[d];
1430 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1432 int nrels = pool->nrels;
1436 if (!pool->whatprovides_rel)
1438 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1440 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1442 if (ns && rd->name != ns)
1444 if (evr && rd->evr != evr)
1446 if (pool->whatprovides_rel[d])
1447 pool_set_whatprovides(pool, MAKERELDEP(d), 0);
1451 /* intersect dependencies in keyname with dep, return list of matching packages */
1453 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1460 if (keyname == SOLVABLE_NAME)
1463 FOR_PROVIDES(p, pp, dep)
1464 if (pool_match_nevr(pool, pool->solvables + p, dep))
1469 FOR_POOL_SOLVABLES(p)
1471 Solvable *s = pool->solvables + p;
1472 if (s->repo->disabled)
1474 if (s->repo != pool->installed && !pool_installable(pool, s))
1478 solvable_lookup_deparray(s, keyname, &qq, marker);
1479 for (i = 0; i < qq.count; i++)
1480 if (pool_match_dep(pool, qq.elements[i], dep))
1489 /* check if keyname contains dep, return list of matching packages */
1491 pool_whatcontainsdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1501 FOR_POOL_SOLVABLES(p)
1503 Solvable *s = pool->solvables + p;
1504 if (s->repo->disabled)
1506 if (s->repo != pool->installed && !pool_installable(pool, s))
1510 solvable_lookup_deparray(s, keyname, &qq, marker);
1511 for (i = 0; i < qq.count; i++)
1512 if (qq.elements[i] == dep)
1521 /* intersect dependencies in keyname with all provides of solvable solvid,
1522 * return list of matching packages */
1523 /* this currently only works for installable packages */
1525 pool_whatmatchessolvable(Pool *pool, Id keyname, Id solvid, Queue *q, int marker)
1529 Map missc; /* cache for misses */
1534 reloff = pool->ss.nstrings;
1535 map_init(&missc, reloff + pool->nrels);
1536 FOR_POOL_SOLVABLES(p)
1538 Solvable *s = pool->solvables + p;
1540 continue; /* filter out self-matches */
1541 if (s->repo->disabled)
1543 if (s->repo != pool->installed && !pool_installable(pool, s))
1545 if (solvable_matchessolvable_int(s, keyname, marker, solvid, 0, &qq, &missc, reloff, 0))
1552 /*************************************************************************/
1555 pool_debug(Pool *pool, int type, const char *format, ...)
1560 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1562 if ((pool->debugmask & type) == 0)
1565 va_start(args, format);
1566 if (!pool->debugcallback)
1568 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1569 vprintf(format, args);
1571 vfprintf(stderr, format, args);
1575 vsnprintf(buf, sizeof(buf), format, args);
1577 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1581 pool_error(Pool *pool, int ret, const char *format, ...)
1588 va_start(args, format);
1591 pool->errstra = 1024;
1592 pool->errstr = solv_malloc(pool->errstra);
1600 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1602 if (l >= 0 && l + 1 > pool->errstra)
1604 pool->errstra = l + 256;
1605 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1606 va_start(args, format);
1607 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1611 strcpy(pool->errstr, "unknown error");
1612 if (pool->debugmask & SOLV_ERROR)
1613 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1618 pool_errstr(Pool *pool)
1620 return pool->errstr ? pool->errstr : "no error";
1624 pool_setdebuglevel(Pool *pool, int level)
1626 int mask = SOLV_DEBUG_RESULT;
1628 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1630 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1632 mask |= SOLV_DEBUG_PROPAGATE;
1634 mask |= SOLV_DEBUG_RULE_CREATION | SOLV_DEBUG_WATCHES;
1635 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1636 pool->debugmask = mask;
1639 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct s_Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1641 pool->debugcallback = debugcallback;
1642 pool->debugcallbackdata = debugcallbackdata;
1645 void pool_setdebugmask(Pool *pool, int mask)
1647 pool->debugmask = mask;
1650 void pool_setloadcallback(Pool *pool, int (*cb)(struct s_Pool *, struct s_Repodata *, void *), void *loadcbdata)
1652 pool->loadcallback = cb;
1653 pool->loadcallbackdata = loadcbdata;
1656 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct s_Pool *, void *, Id, Id), void *nscbdata)
1658 pool->nscallback = cb;
1659 pool->nscallbackdata = nscbdata;
1663 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)
1667 if (pool->solvables[p].repo)
1668 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1671 /* FIXME: obey callback return value! */
1672 for (p = 1; p < pool->nsolvables; p++)
1673 if (pool->solvables[p].repo)
1674 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1678 pool_clear_pos(Pool *pool)
1680 memset(&pool->pos, 0, sizeof(pool->pos));
1684 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1688 pool->languagecache = solv_free(pool->languagecache);
1689 pool->languagecacheother = 0;
1690 for (i = 0; i < pool->nlanguages; i++)
1691 free((char *)pool->languages[i]);
1692 pool->languages = solv_free((void *)pool->languages);
1693 pool->nlanguages = nlanguages;
1696 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1697 for (i = 0; i < pool->nlanguages; i++)
1698 pool->languages[i] = solv_strdup(languages[i]);
1702 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1708 if (!lang || !*lang)
1710 n = pool_id2str(pool, id);
1711 l = strlen(n) + strlen(lang) + 2;
1712 if (l > sizeof(buf))
1713 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1716 sprintf(p, "%s:%s", n, lang);
1717 id = pool_str2id(pool, p, create);
1724 pool_alloctmpspace(Pool *pool, int len)
1726 int n = pool->tmpspace.n;
1729 if (len > pool->tmpspace.len[n])
1731 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1732 pool->tmpspace.len[n] = len + 32;
1734 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1735 return pool->tmpspace.buf[n];
1739 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1744 n = oldn = pool->tmpspace.n;
1748 n = POOL_TMPSPACEBUF - 1;
1751 if (pool->tmpspace.buf[n] != space)
1753 if (len > pool->tmpspace.len[n])
1755 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1756 pool->tmpspace.len[n] = len + 32;
1758 return pool->tmpspace.buf[n];
1765 pool_freetmpspace(Pool *pool, const char *space)
1767 int n = pool->tmpspace.n;
1770 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1771 if (pool->tmpspace.buf[n] == space)
1772 pool->tmpspace.n = n;
1776 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1780 l1 = str1 ? strlen(str1) : 0;
1781 l2 = str2 ? strlen(str2) : 0;
1782 l3 = str3 ? strlen(str3) : 0;
1783 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1804 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1809 l1 = str1 ? strlen(str1) : 0;
1810 l2 = str2 ? strlen(str2) : 0;
1811 l3 = str3 ? strlen(str3) : 0;
1812 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1816 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1839 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1844 s = pool_alloctmpspace(pool, 2 * len + 1);
1845 solv_bin2hex(buf, len, s);
1850 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1852 if (entry == SOLVID_POS && pool->pos.repo)
1853 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1856 return solvable_lookup_str(pool->solvables + entry, keyname);
1860 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1862 if (entry == SOLVID_POS && pool->pos.repo)
1863 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1866 return solvable_lookup_id(pool->solvables + entry, keyname);
1870 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
1872 if (entry == SOLVID_POS && pool->pos.repo)
1873 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
1876 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1880 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1882 if (entry == SOLVID_POS && pool->pos.repo)
1883 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
1886 return solvable_lookup_void(pool->solvables + entry, keyname);
1889 const unsigned char *
1890 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1892 if (entry == SOLVID_POS && pool->pos.repo)
1893 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
1896 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1900 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1902 if (entry == SOLVID_POS && pool->pos.repo)
1903 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
1906 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1910 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
1912 if (entry == SOLVID_POS && pool->pos.repo)
1913 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
1916 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
1920 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
1925 if (entry != SOLVID_POS)
1927 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
1928 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
1929 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
1930 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
1935 pool_set_whatprovides(Pool *pool, Id id, Id providers)
1937 int d, nrels = pool->nrels;
1945 pool->whatprovides_rel[d] = providers;
1950 pool->whatprovides[id] = providers;
1951 if ((Offset)id < pool->whatprovidesauxoff)
1952 pool->whatprovidesaux[id] = 0; /* sorry */
1955 if (!pool->whatprovides_rel)
1957 /* clear cache of all rels that use it */
1959 for (rd = pool->rels + d; d < nrels; d++, rd++)
1961 if (rd->name == id || rd->evr == id ||
1962 (m.size && ISRELDEP(rd->name) && MAPTST(&m, GETRELID(rd->name))) ||
1963 (m.size && ISRELDEP(rd->evr) && MAPTST(&m, GETRELID(rd->evr))))
1965 pool->whatprovides_rel[d] = 0; /* clear cache */
1967 map_init(&m, nrels);
1975 add_new_provider(Pool *pool, Id id, Id p)
1980 /* find whatprovides entry */
1981 while (ISRELDEP(id))
1983 Reldep *rd = GETRELDEP(pool, id);
1987 /* add new provider to existing list keeping it sorted */
1989 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
1993 queue_free(&q); /* already have it */
2001 queue_push(&q, *pp);
2005 pool_set_whatprovides(pool, id, pool_queuetowhatprovides(pool, &q));
2010 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2012 int hadhashes = pool->relhashtbl ? 1 : 0;
2018 if (!conflicts->count)
2020 for (i = 0; i < conflicts->count; i += 6)
2022 fn = conflicts->elements[i];
2023 p = conflicts->elements[i + 1];
2024 md5 = conflicts->elements[i + 2];
2025 q = conflicts->elements[i + 4];
2026 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2027 s = pool->solvables + p;
2030 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2031 if (pool->whatprovides)
2032 add_new_provider(pool, id, p);
2033 s = pool->solvables + q;
2036 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2039 pool_freeidhashes(pool);
2043 pool_prepend_rootdir(Pool *pool, const char *path)
2048 return solv_strdup(path);
2049 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2053 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2059 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2063 pool_set_rootdir(Pool *pool, const char *rootdir)
2065 solv_free(pool->rootdir);
2066 pool->rootdir = solv_strdup(rootdir);
2070 pool_get_rootdir(Pool *pool)
2072 return pool->rootdir;
2075 /* only used in libzypp */
2077 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2079 pool->custom_vendorcheck = vendorcheck;
2082 int (*pool_get_custom_vendorcheck(Pool *pool))(Pool *, Solvable *, Solvable *)
2084 return pool->custom_vendorcheck;