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.
24 #include "poolid_private.h"
30 #define SOLVABLE_BLOCK 255
32 #define KNOWNID_INITIALIZE
34 #undef KNOWNID_INITIALIZE
43 pool = (Pool *)solv_calloc(1, sizeof(*pool));
45 stringpool_init (&pool->ss, initpool_data);
47 /* alloc space for RelDep 0 */
48 pool->rels = solv_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
50 memset(pool->rels, 0, sizeof(Reldep));
52 /* alloc space for Solvable 0 and system solvable */
53 pool->solvables = solv_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
55 memset(pool->solvables, 0, 2 * sizeof(Solvable));
57 queue_init(&pool->vendormap);
60 pool->disttype = DISTTYPE_DEB;
61 pool->noarchid = ARCH_ALL;
62 #elif defined(ARCHLINUX)
63 pool->disttype = DISTTYPE_ARCH;
64 pool->noarchid = ARCH_ANY;
66 pool->disttype = DISTTYPE_HAIKU;
67 pool->noarchid = ARCH_ANY;
68 pool->obsoleteusesprovides = 1;
70 pool->disttype = DISTTYPE_RPM;
71 pool->noarchid = ARCH_NOARCH;
74 /* initialize the system solvable */
75 s = pool->solvables + SYSTEMSOLVABLE;
76 s->name = SYSTEM_SYSTEM;
77 s->arch = pool->noarchid;
80 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
82 pool->obsoleteusescolors = 1;
85 pool->forbidselfconflicts = 1;
86 pool->obsoleteusesprovides = 1;
87 pool->implicitobsoleteusesprovides = 1;
88 pool->havedistepoch = 1;
94 /* free all the resources of our pool */
100 pool_freewhatprovides(pool);
101 pool_freeidhashes(pool);
102 pool_freeallrepos(pool, 1);
103 solv_free(pool->id2arch);
104 solv_free(pool->id2color);
105 solv_free(pool->solvables);
106 stringpool_free(&pool->ss);
107 solv_free(pool->rels);
108 pool_setvendorclasses(pool, 0);
109 queue_free(&pool->vendormap);
110 queue_free(&pool->pooljobs);
111 for (i = 0; i < POOL_TMPSPACEBUF; i++)
112 solv_free(pool->tmpspace.buf[i]);
113 for (i = 0; i < pool->nlanguages; i++)
114 free((char *)pool->languages[i]);
115 solv_free(pool->languages);
116 solv_free(pool->languagecache);
117 solv_free(pool->errstr);
118 solv_free(pool->rootdir);
123 pool_freeallrepos(Pool *pool, int reuseids)
127 pool_freewhatprovides(pool);
128 for (i = 1; i < pool->nrepos; i++)
130 repo_freedata(pool->repos[i]);
131 pool->repos = solv_free(pool->repos);
134 /* the first two solvables don't belong to a repo */
135 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
138 #ifdef MULTI_SEMANTICS
140 pool_setdisttype(Pool *pool, int disttype)
142 pool->disttype = disttype;
143 if (disttype == DISTTYPE_RPM)
144 pool->noarchid = ARCH_NOARCH;
145 if (disttype == DISTTYPE_DEB)
146 pool->noarchid = ARCH_ALL;
147 if (disttype == DISTTYPE_ARCH)
148 pool->noarchid = ARCH_ANY;
149 if (disttype == DISTTYPE_HAIKU)
150 pool->noarchid = ARCH_ANY;
151 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
156 pool_get_flag(Pool *pool, int flag)
160 case POOL_FLAG_PROMOTEEPOCH:
161 return pool->promoteepoch;
162 case POOL_FLAG_FORBIDSELFCONFLICTS:
163 return pool->forbidselfconflicts;
164 case POOL_FLAG_OBSOLETEUSESPROVIDES:
165 return pool->obsoleteusesprovides;
166 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
167 return pool->implicitobsoleteusesprovides;
168 case POOL_FLAG_OBSOLETEUSESCOLORS:
169 return pool->obsoleteusescolors;
170 case POOL_FLAG_NOINSTALLEDOBSOLETES:
171 return pool->noinstalledobsoletes;
172 case POOL_FLAG_HAVEDISTEPOCH:
173 return pool->havedistepoch;
181 pool_set_flag(Pool *pool, int flag, int value)
183 int old = pool_get_flag(pool, flag);
186 case POOL_FLAG_PROMOTEEPOCH:
187 pool->promoteepoch = value;
189 case POOL_FLAG_FORBIDSELFCONFLICTS:
190 pool->forbidselfconflicts = value;
192 case POOL_FLAG_OBSOLETEUSESPROVIDES:
193 pool->obsoleteusesprovides = value;
195 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
196 pool->implicitobsoleteusesprovides = value;
198 case POOL_FLAG_OBSOLETEUSESCOLORS:
199 pool->obsoleteusescolors = value;
201 case POOL_FLAG_NOINSTALLEDOBSOLETES:
202 pool->noinstalledobsoletes = value;
204 case POOL_FLAG_HAVEDISTEPOCH:
205 pool->havedistepoch = value;
215 pool_add_solvable(Pool *pool)
217 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
218 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
219 return pool->nsolvables++;
223 pool_add_solvable_block(Pool *pool, int count)
225 Id nsolvables = pool->nsolvables;
228 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
229 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
230 pool->nsolvables += count;
235 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
239 if (reuseids && start + count == pool->nsolvables)
241 /* might want to shrink solvable array */
242 pool->nsolvables = start;
245 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
250 pool_set_installed(Pool *pool, Repo *installed)
252 if (pool->installed == installed)
254 pool->installed = installed;
255 pool_freewhatprovides(pool);
259 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
264 oa = pool->whatprovides[*(Id *)ap];
265 ob = pool->whatprovides[*(Id *)bp];
267 return *(Id *)ap - *(Id *)bp;
268 da = pool->whatprovidesdata + oa;
269 db = pool->whatprovidesdata + ob;
271 if ((r = (*da++ - *db++)) != 0)
275 return *(Id *)ap - *(Id *)bp;
279 * pool_shrink_whatprovides - unify whatprovides data
281 * whatprovides_rel must be empty for this to work!
285 pool_shrink_whatprovides(Pool *pool)
289 Id lastid, *last, *dp, *lp;
293 if (pool->ss.nstrings < 3)
295 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
296 for (i = id = 0; id < pool->ss.nstrings; id++)
297 if (pool->whatprovides[id] >= 4)
300 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
303 for (i = 0; i < n; i++)
306 o = pool->whatprovides[id];
307 dp = pool->whatprovidesdata + o;
321 pool->whatprovides[id] = -lastid;
325 last = pool->whatprovidesdata + o;
329 dp = pool->whatprovidesdata + 4;
330 for (id = 1; id < pool->ss.nstrings; id++)
332 o = pool->whatprovides[id];
340 pool->whatprovides[id] = pool->whatprovides[i];
345 lp = pool->whatprovidesdata + o;
348 pool->whatprovides[id] = dp - pool->whatprovidesdata;
349 while ((*dp++ = *lp++) != 0)
352 o = dp - pool->whatprovidesdata;
353 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
354 if (pool->whatprovidesdataoff == o)
356 r = pool->whatprovidesdataoff - o;
357 pool->whatprovidesdataoff = o;
358 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
359 if (r > pool->whatprovidesdataleft)
360 r = pool->whatprovidesdataleft;
361 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
366 * pool_createwhatprovides()
368 * create hashes over pool of solvables to ease provide lookups
372 pool_createwhatprovides(Pool *pool)
374 int i, num, np, extra;
379 Offset *whatprovides;
380 Id *whatprovidesdata, *d;
381 Repo *installed = pool->installed;
384 now = solv_timems(0);
385 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
386 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
387 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);
388 if (pool->ss.stringhashmask || pool->relhashmask)
389 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)));
391 pool_freeidhashes(pool); /* XXX: should not be here! */
392 pool_freewhatprovides(pool);
393 num = pool->ss.nstrings;
394 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
395 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
397 /* count providers for each name */
398 for (i = pool->nsolvables - 1; i > 0; i--)
401 s = pool->solvables + i;
402 if (!s->provides || !s->repo || s->repo->disabled)
404 /* we always need the installed solvable in the whatprovides data,
405 otherwise obsoletes/conflicts on them won't work */
406 if (s->repo != installed && !pool_installable(pool, s))
408 pp = s->repo->idarraydata + s->provides;
409 while ((id = *pp++) != 0)
413 Reldep *rd = GETRELDEP(pool, id);
416 whatprovides[id]++; /* inc count of providers */
420 off = 4; /* first entry is undef, second is empty list, third is system solvable */
421 np = 0; /* number of names provided */
422 for (i = 0, idp = whatprovides; i < num; i++, idp++)
425 if (!n) /* no providers */
427 off += n; /* make space for all providers */
428 *idp = off++; /* now idp points to terminating zero */
429 np++; /* inc # of provider 'slots' for stats */
432 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
434 /* reserve some space for relation data */
435 extra = 2 * pool->nrels;
439 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
441 /* alloc space for all providers + extra */
442 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
443 whatprovidesdata[2] = SYSTEMSOLVABLE;
445 /* now fill data for all provides */
446 for (i = pool->nsolvables - 1; i > 0; i--)
449 s = pool->solvables + i;
450 if (!s->provides || !s->repo || s->repo->disabled)
452 if (s->repo != installed && !pool_installable(pool, s))
455 /* for all provides of this solvable */
456 pp = s->repo->idarraydata + s->provides;
457 while ((id = *pp++) != 0)
461 Reldep *rd = GETRELDEP(pool, id);
464 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
465 if (*d != i) /* don't add same solvable twice */
472 pool->whatprovidesdata = whatprovidesdata;
473 pool->whatprovidesdataoff = off;
474 pool->whatprovidesdataleft = extra;
475 pool_shrink_whatprovides(pool);
476 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)));
477 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
481 * free all of our whatprovides data
482 * be careful, everything internalized with pool_queuetowhatprovides is
486 pool_freewhatprovides(Pool *pool)
488 pool->whatprovides = solv_free(pool->whatprovides);
489 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
490 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
491 pool->whatprovidesdataoff = 0;
492 pool->whatprovidesdataleft = 0;
496 /******************************************************************************/
499 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
501 * used for whatprovides, jobs, learnt rules, selections
502 * input: q: queue of Ids
503 * returns: Offset into whatprovidesdata
507 pool_queuetowhatprovides(Pool *pool, Queue *q)
510 int count = q->count;
512 if (count == 0) /* queue empty -> 1 */
514 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
517 /* extend whatprovidesdata if needed, +1 for 0-termination */
518 if (pool->whatprovidesdataleft < count + 1)
520 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
521 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
522 pool->whatprovidesdataleft = count + 4096;
525 /* copy queue to next free slot */
526 off = pool->whatprovidesdataoff;
527 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
529 /* adapt count and 0-terminate */
530 pool->whatprovidesdataoff += count;
531 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
532 pool->whatprovidesdataleft -= count + 1;
538 /*************************************************************************/
540 #if defined(MULTI_SEMANTICS)
541 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
542 #elif defined(DEBIAN)
543 # define EVRCMP_DEPCMP EVRCMP_COMPARE
545 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
548 /* check if a package's nevr matches a dependency */
551 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
553 Reldep *rd = GETRELDEP(pool, d);
556 int flags = rd->flags;
565 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
568 return pool_match_nevr(pool, s, name);
570 if (pool_match_nevr(pool, s, name))
572 return pool_match_nevr(pool, s, evr);
575 if (!pool_match_nevr(pool, s, name))
577 return pool_match_nevr(pool, s, evr);
582 if (!pool_match_nevr(pool, s, name))
585 return (flags & REL_EQ) ? 1 : 0;
590 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
595 return (flags & REL_LT) ? 1 : 0;
597 return (flags & REL_EQ) ? 1 : 0;
599 return (flags & REL_GT) ? 1 : 0;
601 return (flags & REL_EQ) ? 1 : 0;
608 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
609 /* forward declaration */
610 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
613 /* match (flags, evr) against provider (pflags, pevr) */
615 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
617 if (!pflags || !flags || pflags >= 8 || flags >= 8)
619 if (flags == 7 || pflags == 7)
620 return 1; /* rel provides every version */
621 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
622 return 1; /* both rels show in the same direction */
624 return (flags & pflags & REL_EQ) ? 1 : 0;
625 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
628 Reldep *rd = GETRELDEP(pool, pevr);
629 if (rd->flags == REL_COMPAT)
630 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
633 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
636 return (pflags & REL_EQ) ? 1 : 0;
638 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
640 return (flags & pflags & REL_EQ) ? 1 : 0;
642 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
644 return (flags & REL_EQ) ? 1 : 0;
651 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
653 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
655 /* range->name is the actual version, range->evr the backwards compatibility
656 version. If flags are '>=' or '>', we match the compatibility version
657 as well, otherwise only the actual version. */
658 if (!(flags & REL_GT) || (flags & REL_LT))
659 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
660 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
661 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
665 /* match two dependencies (d1 = provider) */
668 pool_match_dep(Pool *pool, Id d1, Id d2)
678 rd2 = GETRELDEP(pool, d2);
679 return pool_match_dep(pool, d1, rd2->name);
681 rd1 = GETRELDEP(pool, d1);
684 return pool_match_dep(pool, rd1->name, d2);
686 rd2 = GETRELDEP(pool, d2);
687 /* first match name */
688 if (!pool_match_dep(pool, rd1->name, rd2->name))
690 /* name matches, check flags and evr */
691 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
697 * add packages fulfilling the relation to whatprovides array
698 * no exact providers, do range match
703 pool_addrelproviders(Pool *pool, Id d)
705 Reldep *rd = GETRELDEP(pool, d);
711 int flags = rd->flags;
716 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
720 /* special relation */
728 wp = pool_whatprovides(pool, name);
729 pp2 = pool_whatprovides_ptr(pool, evr);
730 pp = pool->whatprovidesdata + wp;
731 while ((p = *pp++) != 0)
733 for (pp3 = pp2; *pp3; pp3++)
737 queue_push(&plist, p); /* found it */
743 wp = pool_whatprovides(pool, name);
744 pp = pool->whatprovidesdata + wp;
746 wp = pool_whatprovides(pool, evr);
750 while ((p = *pp++) != 0)
751 queue_push(&plist, p);
753 pp = pool_whatprovides_ptr(pool, evr);
754 while ((p = *pp++) != 0)
755 queue_pushunique(&plist, p);
756 if (plist.count != cnt)
761 if (name == NAMESPACE_OTHERPROVIDERS)
763 wp = pool_whatprovides(pool, evr);
766 if (pool->nscallback)
768 /* ask callback which packages provide the dependency
770 * 1: the system (aka SYSTEMSOLVABLE)
771 * >1: set of packages, stored as offset on whatprovidesdata
773 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
777 queue_push(&plist, SYSTEMSOLVABLE);
781 /* small hack: make it possible to match <pkg>.src
782 * we have to iterate over the solvables as src packages do not
783 * provide anything, thus they are not indexed in our
784 * whatprovides hash */
785 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
788 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
792 if (s->arch != evr && s->arch != ARCH_NOSRC)
794 if (pool_disabled_solvable(pool, s))
796 if (pool_match_nevr(pool, s, name))
797 queue_push(&plist, p);
801 wp = pool_whatprovides(pool, name);
802 pp = pool->whatprovidesdata + wp;
803 while ((p = *pp++) != 0)
805 Solvable *s = pool->solvables + p;
807 queue_push(&plist, p);
812 case REL_FILECONFLICT:
813 pp = pool_whatprovides_ptr(pool, name);
814 while ((p = *pp++) != 0)
816 Id origd = MAKERELDEP(d);
817 Solvable *s = pool->solvables + p;
820 pidp = s->repo->idarraydata + s->provides;
821 while ((pid = *pidp++) != 0)
825 queue_push(&plist, p);
833 /* we can reuse an existing entry */
835 pool->whatprovides_rel[d] = wp;
841 /* simple version comparison relation */
843 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
845 pp = pool_whatprovides_ptr(pool, name);
846 while (ISRELDEP(name))
848 rd = GETRELDEP(pool, name);
851 while ((p = *pp++) != 0)
853 Solvable *s = pool->solvables + p;
856 /* no provides - check nevr */
857 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
858 queue_push(&plist, p);
861 /* solvable p provides name in some rels */
862 pidp = s->repo->idarraydata + s->provides;
863 while ((pid = *pidp++) != 0)
868 continue; /* wrong provides name */
869 if (pool->disttype == DISTTYPE_DEB)
870 continue; /* unversioned provides can never match versioned deps */
873 prd = GETRELDEP(pool, pid);
874 if (prd->name != name)
875 continue; /* wrong provides name */
876 /* right package, both deps are rels. check flags/evr */
877 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
881 continue; /* none of the providers matched */
882 queue_push(&plist, p);
884 /* make our system solvable provide all unknown rpmlib() stuff */
885 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
886 queue_push(&plist, SYSTEMSOLVABLE);
888 /* add providers to whatprovides */
890 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
892 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
895 return pool->whatprovides_rel[d];
898 /*************************************************************************/
901 pool_debug(Pool *pool, int type, const char *format, ...)
906 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
908 if ((pool->debugmask & type) == 0)
911 va_start(args, format);
912 if (!pool->debugcallback)
914 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
915 vprintf(format, args);
917 vfprintf(stderr, format, args);
920 vsnprintf(buf, sizeof(buf), format, args);
922 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
926 pool_error(Pool *pool, int ret, const char *format, ...)
930 va_start(args, format);
933 pool->errstra = 1024;
934 pool->errstr = solv_malloc(pool->errstra);
942 l = vsnprintf(pool->errstr, pool->errstra, format, args);
944 if (l >= 0 && l + 1 > pool->errstra)
946 pool->errstra = l + 256;
947 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
948 va_start(args, format);
949 l = vsnprintf(pool->errstr, pool->errstra, format, args);
953 strcpy(pool->errstr, "unknown error");
954 if (pool->debugmask & SOLV_ERROR)
955 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
960 pool_errstr(Pool *pool)
962 return pool->errstr ? pool->errstr : "no error";
966 pool_setdebuglevel(Pool *pool, int level)
968 int mask = SOLV_DEBUG_RESULT;
970 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
972 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
974 mask |= SOLV_DEBUG_PROPAGATE;
976 mask |= SOLV_DEBUG_RULE_CREATION;
977 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
978 pool->debugmask = mask;
981 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
983 pool->debugcallback = debugcallback;
984 pool->debugcallbackdata = debugcallbackdata;
987 void pool_setdebugmask(Pool *pool, int mask)
989 pool->debugmask = mask;
992 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
994 pool->loadcallback = cb;
995 pool->loadcallbackdata = loadcbdata;
998 /*************************************************************************/
1000 struct searchfiles {
1008 #define SEARCHFILES_BLOCK 127
1011 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1015 struct searchfiles *csf;
1017 while ((dep = *ida++) != 0)
1020 while (ISRELDEP(dep))
1023 sid = pool->ss.nstrings + GETRELID(dep);
1024 if (MAPTST(&csf->seen, sid))
1029 MAPSET(&csf->seen, sid);
1030 rd = GETRELDEP(pool, dep);
1033 else if (rd->flags == REL_NAMESPACE)
1035 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1038 if (!csf || MAPTST(&csf->seen, sid))
1043 MAPSET(&csf->seen, sid);
1047 else if (rd->flags == REL_FILECONFLICT)
1057 pool_addfileprovides_dep(pool, ids, csf, isf);
1063 if (MAPTST(&csf->seen, dep))
1065 MAPSET(&csf->seen, dep);
1066 s = pool_id2str(pool, dep);
1069 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1070 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1071 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1072 csf->ids[csf->nfiles] = dep;
1073 sr = strrchr(s, '/');
1074 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1075 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1077 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1078 csf->dirs[csf->nfiles][sr - s] = 0;
1083 struct addfileprovides_cbdata {
1097 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1099 struct addfileprovides_cbdata *cbd = cbdata;
1102 if (!cbd->useddirs.size)
1104 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1105 for (i = 0; i < cbd->nfiles; i++)
1108 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1113 did = repodata_str2dir(data, cbd->dirs[i], 0);
1116 MAPSET(&cbd->useddirs, did);
1118 repodata_free_dircache(data);
1120 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1122 for (i = 0; i < cbd->nfiles; i++)
1124 if (cbd->dids[i] != value->id)
1126 if (!strcmp(cbd->names[i], value->str))
1129 if (i == cbd->nfiles)
1131 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1136 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1141 Queue fileprovidesq;
1142 int i, j, repoid, repodataid;
1143 int provstart, provend;
1145 int ndone, incomplete;
1150 cbd->nfiles = sf->nfiles;
1152 cbd->dirs = sf->dirs;
1153 cbd->names = sf->names;
1154 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1155 map_init(&cbd->providedids, pool->ss.nstrings);
1158 repo = repoonly ? repoonly : pool->repos[repoid];
1159 map_init(&donemap, pool->nsolvables);
1160 queue_init(&fileprovidesq);
1161 provstart = provend = 0;
1164 if (!repo || repo->disabled)
1166 if (repoonly || ++repoid == pool->nrepos)
1168 repo = pool->repos[repoid];
1172 FOR_REPODATAS(repo, repodataid, data)
1174 if (ndone >= repo->nsolvables)
1177 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1179 map_empty(&cbd->providedids);
1180 for (i = 0; i < fileprovidesq.count; i++)
1181 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1182 provstart = data->start;
1183 provend = data->end;
1184 for (i = 0; i < cbd->nfiles; i++)
1185 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1187 if (i == cbd->nfiles)
1189 /* great! no need to search files */
1190 for (p = data->start; p < data->end; p++)
1191 if (pool->solvables[p].repo == repo)
1193 if (MAPTST(&donemap, p))
1195 MAPSET(&donemap, p);
1202 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1205 if (data->start < provstart || data->end > provend)
1207 map_empty(&cbd->providedids);
1208 provstart = provend = 0;
1211 /* check if the data is incomplete */
1213 if (data->state == REPODATA_AVAILABLE)
1215 for (j = 1; j < data->nkeys; j++)
1216 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1218 if (j < data->nkeys)
1221 for (i = 0; i < cbd->nfiles; i++)
1222 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1223 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1225 for (i = 0; i < cbd->nfiles; i++)
1226 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1228 if (i < cbd->nfiles)
1234 map_init(&cbd->useddirs, 0);
1235 for (p = data->start; p < data->end; p++)
1236 if (pool->solvables[p].repo == repo)
1238 if (MAPTST(&donemap, p))
1240 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1243 MAPSET(&donemap, p);
1247 map_free(&cbd->useddirs);
1250 if (repoonly || ++repoid == pool->nrepos)
1252 repo = pool->repos[repoid];
1255 queue_free(&fileprovidesq);
1256 map_free(&cbd->providedids);
1260 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1263 Repo *installed, *repo;
1264 struct searchfiles sf, isf, *isfp;
1265 struct addfileprovides_cbdata cbd;
1269 installed = pool->installed;
1270 now = solv_timems(0);
1271 memset(&sf, 0, sizeof(sf));
1272 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1273 memset(&isf, 0, sizeof(isf));
1274 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1279 queue_empty(idqinst);
1280 isfp = installed ? &isf : 0;
1281 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1287 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1289 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1291 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1293 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1295 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1297 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1299 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1302 map_free(&isf.seen);
1303 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1308 for (i = 0; i < sf.nfiles; i++)
1309 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1311 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1313 for (i = 0; i < sf.nfiles; i++)
1314 queue_push(idq, sf.ids[i]);
1316 for (i = 0; i < sf.nfiles; i++)
1317 queue_push(idqinst, sf.ids[i]);
1319 for (i = 0; i < sf.nfiles; i++)
1321 solv_free(sf.dirs[i]);
1322 solv_free(sf.names[i]);
1325 solv_free(sf.names);
1330 for (i = 0; i < isf.nfiles; i++)
1331 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1334 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1335 if (installed && idqinst)
1336 for (i = 0; i < isf.nfiles; i++)
1337 queue_pushunique(idqinst, isf.ids[i]);
1339 for (i = 0; i < isf.nfiles; i++)
1341 solv_free(isf.dirs[i]);
1342 solv_free(isf.names[i]);
1344 solv_free(isf.dirs);
1345 solv_free(isf.names);
1347 solv_free(cbd.dids);
1348 pool_freewhatprovides(pool); /* as we have added provides */
1349 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1353 pool_addfileprovides(Pool *pool)
1355 pool_addfileprovides_queue(pool, 0, 0);
1359 pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata)
1363 if (pool->solvables[p].repo)
1364 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1367 /* FIXME: obey callback return value! */
1368 for (p = 1; p < pool->nsolvables; p++)
1369 if (pool->solvables[p].repo)
1370 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1374 pool_clear_pos(Pool *pool)
1376 memset(&pool->pos, 0, sizeof(pool->pos));
1381 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1385 pool->languagecache = solv_free(pool->languagecache);
1386 pool->languagecacheother = 0;
1387 if (pool->nlanguages)
1389 for (i = 0; i < pool->nlanguages; i++)
1390 free((char *)pool->languages[i]);
1391 free(pool->languages);
1393 pool->nlanguages = nlanguages;
1396 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1397 for (i = 0; i < pool->nlanguages; i++)
1398 pool->languages[i] = solv_strdup(languages[i]);
1402 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1408 if (!lang || !*lang)
1410 n = pool_id2str(pool, id);
1411 l = strlen(n) + strlen(lang) + 2;
1412 if (l > sizeof(buf))
1413 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1416 sprintf(p, "%s:%s", n, lang);
1417 id = pool_str2id(pool, p, create);
1424 pool_alloctmpspace(Pool *pool, int len)
1426 int n = pool->tmpspace.n;
1429 if (len > pool->tmpspace.len[n])
1431 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1432 pool->tmpspace.len[n] = len + 32;
1434 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1435 return pool->tmpspace.buf[n];
1439 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1444 n = oldn = pool->tmpspace.n;
1448 n = POOL_TMPSPACEBUF - 1;
1451 if (pool->tmpspace.buf[n] != space)
1453 if (len > pool->tmpspace.len[n])
1455 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1456 pool->tmpspace.len[n] = len + 32;
1458 return pool->tmpspace.buf[n];
1465 pool_freetmpspace(Pool *pool, const char *space)
1467 int n = pool->tmpspace.n;
1470 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1471 if (pool->tmpspace.buf[n] == space)
1472 pool->tmpspace.n = n;
1476 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1480 l1 = str1 ? strlen(str1) : 0;
1481 l2 = str2 ? strlen(str2) : 0;
1482 l3 = str3 ? strlen(str3) : 0;
1483 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1504 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1509 l1 = str1 ? strlen(str1) : 0;
1510 l2 = str2 ? strlen(str2) : 0;
1511 l3 = str3 ? strlen(str3) : 0;
1512 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1516 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1539 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1544 s = pool_alloctmpspace(pool, 2 * len + 1);
1545 solv_bin2hex(buf, len, s);
1549 /*******************************************************************/
1561 struct mptree *mptree;
1572 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1574 struct ducbdata *cbd = cbdata;
1577 if (data != cbd->olddata)
1579 Id dn, mp, comp, *dirmap, *dirs;
1581 const char *compstr;
1582 struct mptree *mptree;
1584 /* create map from dir to mptree */
1585 cbd->dirmap = solv_free(cbd->dirmap);
1587 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1588 mptree = cbd->mptree;
1590 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1604 if (!mptree[mp].child)
1609 if (data->localpool)
1610 compstr = stringpool_id2str(&data->spool, comp);
1612 compstr = pool_id2str(data->repo->pool, comp);
1613 compl = strlen(compstr);
1614 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1615 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1617 dirmap[dn] = i ? i : -mp;
1619 /* change dirmap to point to mountpoint instead of mptree */
1620 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1623 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1625 cbd->dirmap = dirmap;
1626 cbd->nmap = data->dirpool.ndirs;
1627 cbd->olddata = data;
1630 if (value->id < 0 || value->id >= cbd->nmap)
1632 mp = cbd->dirmap[value->id];
1635 if (cbd->addsub > 0)
1637 cbd->mps[mp].kbytes += value->num;
1638 cbd->mps[mp].files += value->num2;
1642 cbd->mps[mp].kbytes -= value->num;
1643 cbd->mps[mp].files -= value->num2;
1649 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1652 if (mptree[pos].mountpoint == -1)
1653 mptree[pos].mountpoint = mountpoint;
1655 mountpoint = mptree[pos].mountpoint;
1656 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1657 propagate_mountpoints(mptree, i, mountpoint);
1660 #define MPTREE_BLOCK 15
1663 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1666 const char *path, *compstr;
1667 struct mptree *mptree;
1671 struct ducbdata cbd;
1675 Repo *oldinstalled = pool->installed;
1677 memset(&ignoredu, 0, sizeof(ignoredu));
1684 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1687 mptree[0].sibling = 0;
1688 mptree[0].child = 0;
1690 mptree[0].compl = 0;
1691 mptree[0].mountpoint = -1;
1694 /* create component tree */
1695 for (mp = 0; mp < nmps; mp++)
1700 path = mps[mp].path;
1705 if ((p = strchr(path, '/')) == 0)
1708 compl = strlen(compstr);
1719 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1720 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1724 /* create new node */
1725 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1727 mptree[i].sibling = mptree[pos].child;
1728 mptree[i].child = 0;
1729 mptree[i].comp = compstr;
1730 mptree[i].compl = compl;
1731 mptree[i].mountpoint = -1;
1732 mptree[pos].child = i;
1736 mptree[pos].mountpoint = mp;
1739 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1742 for (i = 0; i < nmptree; i++)
1744 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1745 printf("#%d child: %d\n", i, mptree[i].child);
1746 printf("#%d comp: %s\n", i, mptree[i].comp);
1747 printf("#%d compl: %d\n", i, mptree[i].compl);
1748 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1752 cbd.mptree = mptree;
1754 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1756 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1758 if (!MAPTST(installedmap, sp))
1761 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1762 if (!cbd.hasdu && oldinstalled)
1765 /* no du data available, ignore data of all installed solvables we obsolete */
1767 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1770 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1771 while ((obs = *obsp++) != 0)
1772 FOR_PROVIDES(op, opp, obs)
1773 if (op >= oldinstalled->start && op < oldinstalled->end)
1774 MAPSET(&ignoredu, op - oldinstalled->start);
1776 FOR_PROVIDES(op, opp, s->name)
1777 if (pool->solvables[op].name == s->name)
1778 if (op >= oldinstalled->start && op < oldinstalled->end)
1779 MAPSET(&ignoredu, op - oldinstalled->start);
1785 /* assumes we allways have du data for installed solvables */
1786 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1788 if (MAPTST(installedmap, sp))
1790 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1792 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1796 map_free(&ignoredu);
1797 solv_free(cbd.dirmap);
1802 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1807 Repo *oldinstalled = pool->installed;
1809 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1811 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1813 if (!MAPTST(installedmap, sp))
1815 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1819 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1821 if (MAPTST(installedmap, sp))
1823 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1831 * 2: conflicts with installed
1832 * 8: interesting (only true if installed)
1836 static inline Id dep2name(Pool *pool, Id dep)
1838 while (ISRELDEP(dep))
1840 Reldep *rd = rd = GETRELDEP(pool, dep);
1846 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1849 Solvable *sn = pool->solvables + n;
1851 FOR_PROVIDES(p, pp, sn->name)
1853 Solvable *s = pool->solvables + p;
1854 if (s->name != sn->name || s->arch != sn->arch)
1856 if ((map[p] & 9) != 9)
1858 if (pool_match_nevr(pool, pool->solvables + p, con))
1860 return 1; /* found installed package that doesn't conflict */
1865 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
1869 FOR_PROVIDES(p, pp, dep)
1871 if (p == SYSTEMSOLVABLE)
1872 return 1; /* always boring, as never constraining */
1873 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1875 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
1876 if (providedbyinstalled_multiversion(pool, map, p, dep))
1878 if ((map[p] & 9) == 9)
1886 * pool_trivial_installable - calculate if a set of solvables is
1887 * trivial installable without any other installs/deinstalls of
1888 * packages not belonging to the set.
1890 * the state is returned in the result queue:
1891 * 1: solvable is installable without any other package changes
1892 * 0: solvable is not installable
1893 * -1: solvable is installable, but doesn't constrain any installed packages
1897 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
1900 Id p, *dp, con, *conp, req, *reqp;
1904 map = solv_calloc(pool->nsolvables, 1);
1905 for (p = 1; p < pool->nsolvables; p++)
1907 if (!MAPTST(installedmap, p))
1910 s = pool->solvables + p;
1913 conp = s->repo->idarraydata + s->conflicts;
1914 while ((con = *conp++) != 0)
1916 dp = pool_whatprovides_ptr(pool, con);
1918 map[p] |= 2; /* XXX: self conflict ? */
1921 for (i = 0; i < pkgs->count; i++)
1922 map[pkgs->elements[i]] = 16;
1924 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1926 if (i == pkgs->count)
1928 p = pkgs->elements[i];
1929 if ((map[p] & 16) == 0)
1931 if ((map[p] & 2) != 0)
1936 s = pool->solvables + p;
1940 reqp = s->repo->idarraydata + s->requires;
1941 while ((req = *reqp++) != 0)
1943 if (req == SOLVABLE_PREREQMARKER)
1945 r = providedbyinstalled(pool, map, req, 0, 0);
1948 /* decided and miss */
1954 break; /* undecided */
1955 m |= r; /* 1 | 9 | 17 */
1964 int ispatch = 0; /* see solver.c patch handling */
1966 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1968 conp = s->repo->idarraydata + s->conflicts;
1969 while ((con = *conp++) != 0)
1971 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
1977 if ((m == 1 || m == 17) && ISRELDEP(con))
1979 con = dep2name(pool, con);
1980 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
1985 continue; /* found a conflict */
1988 if (s->repo && s->repo != oldinstalled)
1990 Id p2, obs, *obsp, *pp;
1994 obsp = s->repo->idarraydata + s->obsoletes;
1995 while ((obs = *obsp++) != 0)
1997 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2006 FOR_PROVIDES(p2, pp, s->name)
2008 s2 = pool->solvables + p2;
2009 if (s2->name == s->name && (map[p2] & 1) != 0)
2026 queue_init_clone(res, pkgs);
2027 for (i = 0; i < pkgs->count; i++)
2029 m = map[pkgs->elements[i]];
2036 res->elements[i] = r;
2042 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2044 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2048 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2050 if (entry == SOLVID_POS && pool->pos.repo)
2051 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2054 return solvable_lookup_str(pool->solvables + entry, keyname);
2058 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2060 if (entry == SOLVID_POS && pool->pos.repo)
2062 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2063 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2064 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2068 return solvable_lookup_id(pool->solvables + entry, keyname);
2072 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2074 if (entry == SOLVID_POS && pool->pos.repo)
2076 unsigned long long value;
2077 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2083 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2087 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2089 if (entry == SOLVID_POS && pool->pos.repo)
2090 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2093 return solvable_lookup_void(pool->solvables + entry, keyname);
2096 const unsigned char *
2097 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2099 if (entry == SOLVID_POS && pool->pos.repo)
2100 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2103 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2107 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2109 if (entry == SOLVID_POS && pool->pos.repo)
2111 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2112 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2116 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2120 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2125 if (entry != SOLVID_POS)
2127 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2128 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2129 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2130 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2135 add_new_provider(Pool *pool, Id id, Id p)
2140 while (ISRELDEP(id))
2142 Reldep *rd = GETRELDEP(pool, id);
2147 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2159 queue_push(&q, *pp);
2163 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2168 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2170 int hadhashes = pool->relhashtbl ? 1 : 0;
2176 if (!conflicts->count)
2178 for (i = 0; i < conflicts->count; i += 6)
2180 fn = conflicts->elements[i];
2181 p = conflicts->elements[i + 1];
2182 md5 = conflicts->elements[i + 2];
2183 q = conflicts->elements[i + 4];
2184 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2185 s = pool->solvables + p;
2188 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2189 if (pool->whatprovides)
2190 add_new_provider(pool, fn, p);
2191 if (pool->whatprovides_rel)
2192 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2193 s = pool->solvables + q;
2196 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2199 pool_freeidhashes(pool);
2203 pool_prepend_rootdir(Pool *pool, const char *path)
2208 return solv_strdup(path);
2209 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2213 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2219 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2223 pool_set_rootdir(Pool *pool, const char *rootdir)
2225 solv_free(pool->rootdir);
2226 pool->rootdir = solv_strdup(rootdir);
2230 pool_get_rootdir(Pool *pool)
2232 return pool->rootdir;
2235 /* only used in libzypp */
2237 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2239 pool->custom_vendorcheck = vendorcheck;