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_RPM;
67 pool->noarchid = ARCH_NOARCH;
70 /* initialize the system solvable */
71 s = pool->solvables + SYSTEMSOLVABLE;
72 s->name = SYSTEM_SYSTEM;
73 s->arch = pool->noarchid;
76 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
78 pool->obsoleteusescolors = 1;
81 pool->forbidselfconflicts = 1;
82 pool->obsoleteusesprovides = 1;
83 pool->implicitobsoleteusesprovides = 1;
84 pool->havedistepoch = 1;
90 /* free all the resources of our pool */
96 pool_freewhatprovides(pool);
97 pool_freeidhashes(pool);
98 pool_freeallrepos(pool, 1);
99 solv_free(pool->id2arch);
100 solv_free(pool->id2color);
101 solv_free(pool->solvables);
102 stringpool_free(&pool->ss);
103 solv_free(pool->rels);
104 pool_setvendorclasses(pool, 0);
105 queue_free(&pool->vendormap);
106 queue_free(&pool->pooljobs);
107 for (i = 0; i < POOL_TMPSPACEBUF; i++)
108 solv_free(pool->tmpspace.buf[i]);
109 for (i = 0; i < pool->nlanguages; i++)
110 free((char *)pool->languages[i]);
111 solv_free(pool->languages);
112 solv_free(pool->languagecache);
113 solv_free(pool->errstr);
114 solv_free(pool->rootdir);
119 pool_freeallrepos(Pool *pool, int reuseids)
123 pool_freewhatprovides(pool);
124 for (i = 1; i < pool->nrepos; i++)
126 repo_freedata(pool->repos[i]);
127 pool->repos = solv_free(pool->repos);
130 /* the first two solvables don't belong to a repo */
131 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
134 #ifdef MULTI_SEMANTICS
136 pool_setdisttype(Pool *pool, int disttype)
138 pool->disttype = disttype;
139 if (disttype == DISTTYPE_RPM)
140 pool->noarchid = ARCH_NOARCH;
141 if (disttype == DISTTYPE_DEB)
142 pool->noarchid = ARCH_ALL;
143 if (disttype == DISTTYPE_ARCH)
144 pool->noarchid = ARCH_ANY;
145 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
150 pool_get_flag(Pool *pool, int flag)
154 case POOL_FLAG_PROMOTEEPOCH:
155 return pool->promoteepoch;
156 case POOL_FLAG_FORBIDSELFCONFLICTS:
157 return pool->forbidselfconflicts;
158 case POOL_FLAG_OBSOLETEUSESPROVIDES:
159 return pool->obsoleteusesprovides;
160 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
161 return pool->implicitobsoleteusesprovides;
162 case POOL_FLAG_OBSOLETEUSESCOLORS:
163 return pool->obsoleteusescolors;
164 case POOL_FLAG_NOINSTALLEDOBSOLETES:
165 return pool->noinstalledobsoletes;
166 case POOL_FLAG_HAVEDISTEPOCH:
167 return pool->havedistepoch;
175 pool_set_flag(Pool *pool, int flag, int value)
177 int old = pool_get_flag(pool, flag);
180 case POOL_FLAG_PROMOTEEPOCH:
181 pool->promoteepoch = value;
183 case POOL_FLAG_FORBIDSELFCONFLICTS:
184 pool->forbidselfconflicts = value;
186 case POOL_FLAG_OBSOLETEUSESPROVIDES:
187 pool->obsoleteusesprovides = value;
189 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
190 pool->implicitobsoleteusesprovides = value;
192 case POOL_FLAG_OBSOLETEUSESCOLORS:
193 pool->obsoleteusescolors = value;
195 case POOL_FLAG_NOINSTALLEDOBSOLETES:
196 pool->noinstalledobsoletes = value;
198 case POOL_FLAG_HAVEDISTEPOCH:
199 pool->havedistepoch = value;
209 pool_add_solvable(Pool *pool)
211 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
212 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
213 return pool->nsolvables++;
217 pool_add_solvable_block(Pool *pool, int count)
219 Id nsolvables = pool->nsolvables;
222 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
223 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
224 pool->nsolvables += count;
229 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
233 if (reuseids && start + count == pool->nsolvables)
235 /* might want to shrink solvable array */
236 pool->nsolvables = start;
239 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
244 pool_set_installed(Pool *pool, Repo *installed)
246 if (pool->installed == installed)
248 pool->installed = installed;
249 pool_freewhatprovides(pool);
253 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
258 oa = pool->whatprovides[*(Id *)ap];
259 ob = pool->whatprovides[*(Id *)bp];
261 return *(Id *)ap - *(Id *)bp;
262 da = pool->whatprovidesdata + oa;
263 db = pool->whatprovidesdata + ob;
265 if ((r = (*da++ - *db++)) != 0)
269 return *(Id *)ap - *(Id *)bp;
273 * pool_shrink_whatprovides - unify whatprovides data
275 * whatprovides_rel must be empty for this to work!
279 pool_shrink_whatprovides(Pool *pool)
283 Id lastid, *last, *dp, *lp;
287 if (pool->ss.nstrings < 3)
289 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
290 for (i = id = 0; id < pool->ss.nstrings; id++)
291 if (pool->whatprovides[id] >= 4)
294 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
297 for (i = 0; i < n; i++)
300 o = pool->whatprovides[id];
301 dp = pool->whatprovidesdata + o;
315 pool->whatprovides[id] = -lastid;
319 last = pool->whatprovidesdata + o;
323 dp = pool->whatprovidesdata + 4;
324 for (id = 1; id < pool->ss.nstrings; id++)
326 o = pool->whatprovides[id];
334 pool->whatprovides[id] = pool->whatprovides[i];
339 lp = pool->whatprovidesdata + o;
342 pool->whatprovides[id] = dp - pool->whatprovidesdata;
343 while ((*dp++ = *lp++) != 0)
346 o = dp - pool->whatprovidesdata;
347 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
348 if (pool->whatprovidesdataoff == o)
350 r = pool->whatprovidesdataoff - o;
351 pool->whatprovidesdataoff = o;
352 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
353 if (r > pool->whatprovidesdataleft)
354 r = pool->whatprovidesdataleft;
355 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
360 * pool_createwhatprovides()
362 * create hashes over pool of solvables to ease provide lookups
366 pool_createwhatprovides(Pool *pool)
368 int i, num, np, extra;
373 Offset *whatprovides;
374 Id *whatprovidesdata, *d;
375 Repo *installed = pool->installed;
378 now = solv_timems(0);
379 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
380 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
381 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);
382 if (pool->ss.stringhashmask || pool->relhashmask)
383 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)));
385 pool_freeidhashes(pool); /* XXX: should not be here! */
386 pool_freewhatprovides(pool);
387 num = pool->ss.nstrings;
388 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
389 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
391 /* count providers for each name */
392 for (i = pool->nsolvables - 1; i > 0; i--)
395 s = pool->solvables + i;
396 if (!s->provides || !s->repo || s->repo->disabled)
398 /* we always need the installed solvable in the whatprovides data,
399 otherwise obsoletes/conflicts on them won't work */
400 if (s->repo != installed && !pool_installable(pool, s))
402 pp = s->repo->idarraydata + s->provides;
403 while ((id = *pp++) != 0)
407 Reldep *rd = GETRELDEP(pool, id);
410 whatprovides[id]++; /* inc count of providers */
414 off = 4; /* first entry is undef, second is empty list, third is system solvable */
415 np = 0; /* number of names provided */
416 for (i = 0, idp = whatprovides; i < num; i++, idp++)
419 if (!n) /* no providers */
421 off += n; /* make space for all providers */
422 *idp = off++; /* now idp points to terminating zero */
423 np++; /* inc # of provider 'slots' for stats */
426 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
428 /* reserve some space for relation data */
429 extra = 2 * pool->nrels;
433 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
435 /* alloc space for all providers + extra */
436 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
437 whatprovidesdata[2] = SYSTEMSOLVABLE;
439 /* now fill data for all provides */
440 for (i = pool->nsolvables - 1; i > 0; i--)
443 s = pool->solvables + i;
444 if (!s->provides || !s->repo || s->repo->disabled)
446 if (s->repo != installed && !pool_installable(pool, s))
449 /* for all provides of this solvable */
450 pp = s->repo->idarraydata + s->provides;
451 while ((id = *pp++) != 0)
455 Reldep *rd = GETRELDEP(pool, id);
458 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
459 if (*d != i) /* don't add same solvable twice */
466 pool->whatprovidesdata = whatprovidesdata;
467 pool->whatprovidesdataoff = off;
468 pool->whatprovidesdataleft = extra;
469 pool_shrink_whatprovides(pool);
470 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)));
471 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
475 * free all of our whatprovides data
476 * be careful, everything internalized with pool_queuetowhatprovides is
480 pool_freewhatprovides(Pool *pool)
482 pool->whatprovides = solv_free(pool->whatprovides);
483 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
484 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
485 pool->whatprovidesdataoff = 0;
486 pool->whatprovidesdataleft = 0;
490 /******************************************************************************/
493 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
495 * used for whatprovides, jobs, learnt rules, selections
496 * input: q: queue of Ids
497 * returns: Offset into whatprovidesdata
501 pool_queuetowhatprovides(Pool *pool, Queue *q)
504 int count = q->count;
506 if (count == 0) /* queue empty -> 1 */
508 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
511 /* extend whatprovidesdata if needed, +1 for 0-termination */
512 if (pool->whatprovidesdataleft < count + 1)
514 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
515 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
516 pool->whatprovidesdataleft = count + 4096;
519 /* copy queue to next free slot */
520 off = pool->whatprovidesdataoff;
521 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
523 /* adapt count and 0-terminate */
524 pool->whatprovidesdataoff += count;
525 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
526 pool->whatprovidesdataleft -= count + 1;
532 /*************************************************************************/
534 #if defined(MULTI_SEMANTICS)
535 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
536 #elif defined(DEBIAN)
537 # define EVRCMP_DEPCMP EVRCMP_COMPARE
539 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
542 /* check if a package's nevr matches a dependency */
545 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
547 Reldep *rd = GETRELDEP(pool, d);
550 int flags = rd->flags;
559 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
562 return pool_match_nevr(pool, s, name);
564 if (pool_match_nevr(pool, s, name))
566 return pool_match_nevr(pool, s, evr);
569 if (!pool_match_nevr(pool, s, name))
571 return pool_match_nevr(pool, s, evr);
576 if (!pool_match_nevr(pool, s, name))
579 return (flags & REL_EQ) ? 1 : 0;
584 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
589 return (flags & REL_LT) ? 1 : 0;
591 return (flags & REL_EQ) ? 1 : 0;
593 return (flags & REL_GT) ? 1 : 0;
595 return (flags & REL_EQ) ? 1 : 0;
602 /* match (flags, evr) against provider (pflags, pevr) */
604 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
606 if (!pflags || !flags || pflags >= 8 || flags >= 8)
608 if (flags == 7 || pflags == 7)
609 return 1; /* rel provides every version */
610 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
611 return 1; /* both rels show in the same direction */
613 return (flags & pflags & REL_EQ) ? 1 : 0;
616 Reldep *range = GETRELDEP(pool, pevr);
617 if (range->flags != REL_COMPAT)
618 return 0; /* unsupported */
619 /* range->name is the backwards compatibility version, range->evr the
620 actual version. If flags are '>=' or '>', we match the compatibility
621 version as well, otherwise only the actual version. */
622 if (!(flags & REL_GT) || (flags & REL_LT))
623 return pool_match_flags_evr(pool, REL_EQ, range->evr, flags, evr);
624 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->evr, flags, evr) &&
625 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->name, REL_EQ, evr);
627 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
630 return (pflags & REL_EQ) ? 1 : 0;
632 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
634 return (flags & pflags & REL_EQ) ? 1 : 0;
636 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
638 return (flags & REL_EQ) ? 1 : 0;
645 /* match two dependencies (d1 = provider) */
648 pool_match_dep(Pool *pool, Id d1, Id d2)
658 rd2 = GETRELDEP(pool, d2);
659 return pool_match_dep(pool, d1, rd2->name);
661 rd1 = GETRELDEP(pool, d1);
664 return pool_match_dep(pool, rd1->name, d2);
666 rd2 = GETRELDEP(pool, d2);
667 /* first match name */
668 if (!pool_match_dep(pool, rd1->name, rd2->name))
670 /* name matches, check flags and evr */
671 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
677 * add packages fulfilling the relation to whatprovides array
678 * no exact providers, do range match
683 pool_addrelproviders(Pool *pool, Id d)
685 Reldep *rd = GETRELDEP(pool, d);
691 int flags = rd->flags;
696 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
700 /* special relation */
708 wp = pool_whatprovides(pool, name);
709 pp2 = pool_whatprovides_ptr(pool, evr);
710 pp = pool->whatprovidesdata + wp;
711 while ((p = *pp++) != 0)
713 for (pp3 = pp2; *pp3; pp3++)
717 queue_push(&plist, p); /* found it */
723 wp = pool_whatprovides(pool, name);
724 pp = pool->whatprovidesdata + wp;
726 wp = pool_whatprovides(pool, evr);
730 while ((p = *pp++) != 0)
731 queue_push(&plist, p);
733 pp = pool_whatprovides_ptr(pool, evr);
734 while ((p = *pp++) != 0)
735 queue_pushunique(&plist, p);
736 if (plist.count != cnt)
741 if (name == NAMESPACE_OTHERPROVIDERS)
743 wp = pool_whatprovides(pool, evr);
746 if (pool->nscallback)
748 /* ask callback which packages provide the dependency
750 * 1: the system (aka SYSTEMSOLVABLE)
751 * >1: set of packages, stored as offset on whatprovidesdata
753 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
757 queue_push(&plist, SYSTEMSOLVABLE);
761 /* small hack: make it possible to match <pkg>.src
762 * we have to iterate over the solvables as src packages do not
763 * provide anything, thus they are not indexed in our
764 * whatprovides hash */
765 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
768 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
772 if (s->arch != evr && s->arch != ARCH_NOSRC)
774 if (pool_disabled_solvable(pool, s))
776 if (pool_match_nevr(pool, s, name))
777 queue_push(&plist, p);
781 wp = pool_whatprovides(pool, name);
782 pp = pool->whatprovidesdata + wp;
783 while ((p = *pp++) != 0)
785 Solvable *s = pool->solvables + p;
787 queue_push(&plist, p);
792 case REL_FILECONFLICT:
793 pp = pool_whatprovides_ptr(pool, name);
794 while ((p = *pp++) != 0)
796 Id origd = MAKERELDEP(d);
797 Solvable *s = pool->solvables + p;
800 pidp = s->repo->idarraydata + s->provides;
801 while ((pid = *pidp++) != 0)
805 queue_push(&plist, p);
813 /* we can reuse an existing entry */
815 pool->whatprovides_rel[d] = wp;
821 /* simple version comparison relation */
823 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
825 pp = pool_whatprovides_ptr(pool, name);
826 while (ISRELDEP(name))
828 rd = GETRELDEP(pool, name);
831 while ((p = *pp++) != 0)
833 Solvable *s = pool->solvables + p;
836 /* no provides - check nevr */
837 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
838 queue_push(&plist, p);
841 /* solvable p provides name in some rels */
842 pidp = s->repo->idarraydata + s->provides;
843 while ((pid = *pidp++) != 0)
848 continue; /* wrong provides name */
849 if (pool->disttype == DISTTYPE_DEB)
850 continue; /* unversioned provides can never match versioned deps */
853 prd = GETRELDEP(pool, pid);
854 if (prd->name != name)
855 continue; /* wrong provides name */
856 /* right package, both deps are rels. check flags/evr */
857 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
861 continue; /* none of the providers matched */
862 queue_push(&plist, p);
864 /* make our system solvable provide all unknown rpmlib() stuff */
865 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
866 queue_push(&plist, SYSTEMSOLVABLE);
868 /* add providers to whatprovides */
870 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
872 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
875 return pool->whatprovides_rel[d];
878 /*************************************************************************/
881 pool_debug(Pool *pool, int type, const char *format, ...)
886 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
888 if ((pool->debugmask & type) == 0)
891 va_start(args, format);
892 if (!pool->debugcallback)
894 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
895 vprintf(format, args);
897 vfprintf(stderr, format, args);
900 vsnprintf(buf, sizeof(buf), format, args);
902 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
906 pool_error(Pool *pool, int ret, const char *format, ...)
910 va_start(args, format);
913 pool->errstra = 1024;
914 pool->errstr = solv_malloc(pool->errstra);
922 l = vsnprintf(pool->errstr, pool->errstra, format, args);
924 if (l >= 0 && l + 1 > pool->errstra)
926 pool->errstra = l + 256;
927 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
928 va_start(args, format);
929 l = vsnprintf(pool->errstr, pool->errstra, format, args);
933 strcpy(pool->errstr, "unknown error");
934 if (pool->debugmask & SOLV_ERROR)
935 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
940 pool_errstr(Pool *pool)
942 return pool->errstr ? pool->errstr : "no error";
946 pool_setdebuglevel(Pool *pool, int level)
948 int mask = SOLV_DEBUG_RESULT;
950 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
952 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
954 mask |= SOLV_DEBUG_PROPAGATE;
956 mask |= SOLV_DEBUG_RULE_CREATION;
957 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
958 pool->debugmask = mask;
961 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
963 pool->debugcallback = debugcallback;
964 pool->debugcallbackdata = debugcallbackdata;
967 void pool_setdebugmask(Pool *pool, int mask)
969 pool->debugmask = mask;
972 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
974 pool->loadcallback = cb;
975 pool->loadcallbackdata = loadcbdata;
978 /*************************************************************************/
988 #define SEARCHFILES_BLOCK 127
991 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
995 struct searchfiles *csf;
997 while ((dep = *ida++) != 0)
1000 while (ISRELDEP(dep))
1003 sid = pool->ss.nstrings + GETRELID(dep);
1004 if (MAPTST(&csf->seen, sid))
1009 MAPSET(&csf->seen, sid);
1010 rd = GETRELDEP(pool, dep);
1013 else if (rd->flags == REL_NAMESPACE)
1015 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1018 if (!csf || MAPTST(&csf->seen, sid))
1023 MAPSET(&csf->seen, sid);
1027 else if (rd->flags == REL_FILECONFLICT)
1037 pool_addfileprovides_dep(pool, ids, csf, isf);
1043 if (MAPTST(&csf->seen, dep))
1045 MAPSET(&csf->seen, dep);
1046 s = pool_id2str(pool, dep);
1049 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1050 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1051 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1052 csf->ids[csf->nfiles] = dep;
1053 sr = strrchr(s, '/');
1054 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1055 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1057 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1058 csf->dirs[csf->nfiles][sr - s] = 0;
1063 struct addfileprovides_cbdata {
1077 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1079 struct addfileprovides_cbdata *cbd = cbdata;
1082 if (!cbd->useddirs.size)
1084 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1085 for (i = 0; i < cbd->nfiles; i++)
1088 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1093 did = repodata_str2dir(data, cbd->dirs[i], 0);
1096 MAPSET(&cbd->useddirs, did);
1098 repodata_free_dircache(data);
1100 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1102 for (i = 0; i < cbd->nfiles; i++)
1104 if (cbd->dids[i] != value->id)
1106 if (!strcmp(cbd->names[i], value->str))
1109 if (i == cbd->nfiles)
1111 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1116 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1121 Queue fileprovidesq;
1122 int i, j, repoid, repodataid;
1123 int provstart, provend;
1125 int ndone, incomplete;
1130 cbd->nfiles = sf->nfiles;
1132 cbd->dirs = sf->dirs;
1133 cbd->names = sf->names;
1134 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1135 map_init(&cbd->providedids, pool->ss.nstrings);
1138 repo = repoonly ? repoonly : pool->repos[repoid];
1139 map_init(&donemap, pool->nsolvables);
1140 queue_init(&fileprovidesq);
1141 provstart = provend = 0;
1144 if (!repo || repo->disabled)
1146 if (repoonly || ++repoid == pool->nrepos)
1148 repo = pool->repos[repoid];
1152 FOR_REPODATAS(repo, repodataid, data)
1154 if (ndone >= repo->nsolvables)
1157 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1159 map_empty(&cbd->providedids);
1160 for (i = 0; i < fileprovidesq.count; i++)
1161 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1162 provstart = data->start;
1163 provend = data->end;
1164 for (i = 0; i < cbd->nfiles; i++)
1165 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1167 if (i == cbd->nfiles)
1169 /* great! no need to search files */
1170 for (p = data->start; p < data->end; p++)
1171 if (pool->solvables[p].repo == repo)
1173 if (MAPTST(&donemap, p))
1175 MAPSET(&donemap, p);
1182 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1185 if (data->start < provstart || data->end > provend)
1187 map_empty(&cbd->providedids);
1188 provstart = provend = 0;
1191 /* check if the data is incomplete */
1193 if (data->state == REPODATA_AVAILABLE)
1195 for (j = 1; j < data->nkeys; j++)
1196 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1198 if (j < data->nkeys)
1201 for (i = 0; i < cbd->nfiles; i++)
1202 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1203 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1205 for (i = 0; i < cbd->nfiles; i++)
1206 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1208 if (i < cbd->nfiles)
1214 map_init(&cbd->useddirs, 0);
1215 for (p = data->start; p < data->end; p++)
1216 if (pool->solvables[p].repo == repo)
1218 if (MAPTST(&donemap, p))
1220 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1223 MAPSET(&donemap, p);
1227 map_free(&cbd->useddirs);
1230 if (repoonly || ++repoid == pool->nrepos)
1232 repo = pool->repos[repoid];
1235 queue_free(&fileprovidesq);
1236 map_free(&cbd->providedids);
1240 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1243 Repo *installed, *repo;
1244 struct searchfiles sf, isf, *isfp;
1245 struct addfileprovides_cbdata cbd;
1249 installed = pool->installed;
1250 now = solv_timems(0);
1251 memset(&sf, 0, sizeof(sf));
1252 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1253 memset(&isf, 0, sizeof(isf));
1254 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1259 queue_empty(idqinst);
1260 isfp = installed ? &isf : 0;
1261 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1267 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1269 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1271 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1273 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1275 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1277 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1279 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1282 map_free(&isf.seen);
1283 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1288 for (i = 0; i < sf.nfiles; i++)
1289 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1291 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1293 for (i = 0; i < sf.nfiles; i++)
1294 queue_push(idq, sf.ids[i]);
1296 for (i = 0; i < sf.nfiles; i++)
1297 queue_push(idqinst, sf.ids[i]);
1299 for (i = 0; i < sf.nfiles; i++)
1301 solv_free(sf.dirs[i]);
1302 solv_free(sf.names[i]);
1305 solv_free(sf.names);
1310 for (i = 0; i < isf.nfiles; i++)
1311 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1314 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1315 if (installed && idqinst)
1316 for (i = 0; i < isf.nfiles; i++)
1317 queue_pushunique(idqinst, isf.ids[i]);
1319 for (i = 0; i < isf.nfiles; i++)
1321 solv_free(isf.dirs[i]);
1322 solv_free(isf.names[i]);
1324 solv_free(isf.dirs);
1325 solv_free(isf.names);
1327 solv_free(cbd.dids);
1328 pool_freewhatprovides(pool); /* as we have added provides */
1329 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1333 pool_addfileprovides(Pool *pool)
1335 pool_addfileprovides_queue(pool, 0, 0);
1339 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)
1343 if (pool->solvables[p].repo)
1344 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1347 /* FIXME: obey callback return value! */
1348 for (p = 1; p < pool->nsolvables; p++)
1349 if (pool->solvables[p].repo)
1350 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1354 pool_clear_pos(Pool *pool)
1356 memset(&pool->pos, 0, sizeof(pool->pos));
1361 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1365 pool->languagecache = solv_free(pool->languagecache);
1366 pool->languagecacheother = 0;
1367 if (pool->nlanguages)
1369 for (i = 0; i < pool->nlanguages; i++)
1370 free((char *)pool->languages[i]);
1371 free(pool->languages);
1373 pool->nlanguages = nlanguages;
1376 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1377 for (i = 0; i < pool->nlanguages; i++)
1378 pool->languages[i] = solv_strdup(languages[i]);
1382 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1388 if (!lang || !*lang)
1390 n = pool_id2str(pool, id);
1391 l = strlen(n) + strlen(lang) + 2;
1392 if (l > sizeof(buf))
1393 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1396 sprintf(p, "%s:%s", n, lang);
1397 id = pool_str2id(pool, p, create);
1404 pool_alloctmpspace(Pool *pool, int len)
1406 int n = pool->tmpspace.n;
1409 if (len > pool->tmpspace.len[n])
1411 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1412 pool->tmpspace.len[n] = len + 32;
1414 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1415 return pool->tmpspace.buf[n];
1419 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1424 n = oldn = pool->tmpspace.n;
1428 n = POOL_TMPSPACEBUF - 1;
1431 if (pool->tmpspace.buf[n] != space)
1433 if (len > pool->tmpspace.len[n])
1435 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1436 pool->tmpspace.len[n] = len + 32;
1438 return pool->tmpspace.buf[n];
1445 pool_freetmpspace(Pool *pool, const char *space)
1447 int n = pool->tmpspace.n;
1450 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1451 if (pool->tmpspace.buf[n] == space)
1452 pool->tmpspace.n = n;
1456 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1460 l1 = str1 ? strlen(str1) : 0;
1461 l2 = str2 ? strlen(str2) : 0;
1462 l3 = str3 ? strlen(str3) : 0;
1463 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1484 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1489 l1 = str1 ? strlen(str1) : 0;
1490 l2 = str2 ? strlen(str2) : 0;
1491 l3 = str3 ? strlen(str3) : 0;
1492 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1496 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1519 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1524 s = pool_alloctmpspace(pool, 2 * len + 1);
1525 solv_bin2hex(buf, len, s);
1529 /*******************************************************************/
1541 struct mptree *mptree;
1552 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1554 struct ducbdata *cbd = cbdata;
1557 if (data != cbd->olddata)
1559 Id dn, mp, comp, *dirmap, *dirs;
1561 const char *compstr;
1562 struct mptree *mptree;
1564 /* create map from dir to mptree */
1565 cbd->dirmap = solv_free(cbd->dirmap);
1567 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1568 mptree = cbd->mptree;
1570 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1584 if (!mptree[mp].child)
1589 if (data->localpool)
1590 compstr = stringpool_id2str(&data->spool, comp);
1592 compstr = pool_id2str(data->repo->pool, comp);
1593 compl = strlen(compstr);
1594 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1595 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1597 dirmap[dn] = i ? i : -mp;
1599 /* change dirmap to point to mountpoint instead of mptree */
1600 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1603 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1605 cbd->dirmap = dirmap;
1606 cbd->nmap = data->dirpool.ndirs;
1607 cbd->olddata = data;
1610 if (value->id < 0 || value->id >= cbd->nmap)
1612 mp = cbd->dirmap[value->id];
1615 if (cbd->addsub > 0)
1617 cbd->mps[mp].kbytes += value->num;
1618 cbd->mps[mp].files += value->num2;
1622 cbd->mps[mp].kbytes -= value->num;
1623 cbd->mps[mp].files -= value->num2;
1629 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1632 if (mptree[pos].mountpoint == -1)
1633 mptree[pos].mountpoint = mountpoint;
1635 mountpoint = mptree[pos].mountpoint;
1636 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1637 propagate_mountpoints(mptree, i, mountpoint);
1640 #define MPTREE_BLOCK 15
1643 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1646 const char *path, *compstr;
1647 struct mptree *mptree;
1651 struct ducbdata cbd;
1655 Repo *oldinstalled = pool->installed;
1657 memset(&ignoredu, 0, sizeof(ignoredu));
1664 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1667 mptree[0].sibling = 0;
1668 mptree[0].child = 0;
1670 mptree[0].compl = 0;
1671 mptree[0].mountpoint = -1;
1674 /* create component tree */
1675 for (mp = 0; mp < nmps; mp++)
1680 path = mps[mp].path;
1685 if ((p = strchr(path, '/')) == 0)
1688 compl = strlen(compstr);
1699 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1700 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1704 /* create new node */
1705 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1707 mptree[i].sibling = mptree[pos].child;
1708 mptree[i].child = 0;
1709 mptree[i].comp = compstr;
1710 mptree[i].compl = compl;
1711 mptree[i].mountpoint = -1;
1712 mptree[pos].child = i;
1716 mptree[pos].mountpoint = mp;
1719 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1722 for (i = 0; i < nmptree; i++)
1724 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1725 printf("#%d child: %d\n", i, mptree[i].child);
1726 printf("#%d comp: %s\n", i, mptree[i].comp);
1727 printf("#%d compl: %d\n", i, mptree[i].compl);
1728 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1732 cbd.mptree = mptree;
1734 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1736 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1738 if (!MAPTST(installedmap, sp))
1741 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1742 if (!cbd.hasdu && oldinstalled)
1745 /* no du data available, ignore data of all installed solvables we obsolete */
1747 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1750 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1751 while ((obs = *obsp++) != 0)
1752 FOR_PROVIDES(op, opp, obs)
1753 if (op >= oldinstalled->start && op < oldinstalled->end)
1754 MAPSET(&ignoredu, op - oldinstalled->start);
1756 FOR_PROVIDES(op, opp, s->name)
1757 if (pool->solvables[op].name == s->name)
1758 if (op >= oldinstalled->start && op < oldinstalled->end)
1759 MAPSET(&ignoredu, op - oldinstalled->start);
1765 /* assumes we allways have du data for installed solvables */
1766 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1768 if (MAPTST(installedmap, sp))
1770 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1772 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1776 map_free(&ignoredu);
1777 solv_free(cbd.dirmap);
1782 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1787 Repo *oldinstalled = pool->installed;
1789 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1791 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1793 if (!MAPTST(installedmap, sp))
1795 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1799 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1801 if (MAPTST(installedmap, sp))
1803 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1811 * 2: conflicts with installed
1812 * 8: interesting (only true if installed)
1816 static inline Id dep2name(Pool *pool, Id dep)
1818 while (ISRELDEP(dep))
1820 Reldep *rd = rd = GETRELDEP(pool, dep);
1826 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1829 Solvable *sn = pool->solvables + n;
1831 FOR_PROVIDES(p, pp, sn->name)
1833 Solvable *s = pool->solvables + p;
1834 if (s->name != sn->name || s->arch != sn->arch)
1836 if ((map[p] & 9) != 9)
1838 if (pool_match_nevr(pool, pool->solvables + p, con))
1840 return 1; /* found installed package that doesn't conflict */
1845 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
1849 FOR_PROVIDES(p, pp, dep)
1851 if (p == SYSTEMSOLVABLE)
1852 return 1; /* always boring, as never constraining */
1853 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1855 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
1856 if (providedbyinstalled_multiversion(pool, map, p, dep))
1858 if ((map[p] & 9) == 9)
1866 * pool_trivial_installable - calculate if a set of solvables is
1867 * trivial installable without any other installs/deinstalls of
1868 * packages not belonging to the set.
1870 * the state is returned in the result queue:
1871 * 1: solvable is installable without any other package changes
1872 * 0: solvable is not installable
1873 * -1: solvable is installable, but doesn't constrain any installed packages
1877 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
1880 Id p, *dp, con, *conp, req, *reqp;
1884 map = solv_calloc(pool->nsolvables, 1);
1885 for (p = 1; p < pool->nsolvables; p++)
1887 if (!MAPTST(installedmap, p))
1890 s = pool->solvables + p;
1893 conp = s->repo->idarraydata + s->conflicts;
1894 while ((con = *conp++) != 0)
1896 dp = pool_whatprovides_ptr(pool, con);
1898 map[p] |= 2; /* XXX: self conflict ? */
1901 for (i = 0; i < pkgs->count; i++)
1902 map[pkgs->elements[i]] = 16;
1904 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1906 if (i == pkgs->count)
1908 p = pkgs->elements[i];
1909 if ((map[p] & 16) == 0)
1911 if ((map[p] & 2) != 0)
1916 s = pool->solvables + p;
1920 reqp = s->repo->idarraydata + s->requires;
1921 while ((req = *reqp++) != 0)
1923 if (req == SOLVABLE_PREREQMARKER)
1925 r = providedbyinstalled(pool, map, req, 0, 0);
1928 /* decided and miss */
1934 break; /* undecided */
1935 m |= r; /* 1 | 9 | 17 */
1944 int ispatch = 0; /* see solver.c patch handling */
1946 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1948 conp = s->repo->idarraydata + s->conflicts;
1949 while ((con = *conp++) != 0)
1951 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
1957 if ((m == 1 || m == 17) && ISRELDEP(con))
1959 con = dep2name(pool, con);
1960 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
1965 continue; /* found a conflict */
1968 if (s->repo && s->repo != oldinstalled)
1970 Id p2, obs, *obsp, *pp;
1974 obsp = s->repo->idarraydata + s->obsoletes;
1975 while ((obs = *obsp++) != 0)
1977 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1986 FOR_PROVIDES(p2, pp, s->name)
1988 s2 = pool->solvables + p2;
1989 if (s2->name == s->name && (map[p2] & 1) != 0)
2006 queue_init_clone(res, pkgs);
2007 for (i = 0; i < pkgs->count; i++)
2009 m = map[pkgs->elements[i]];
2016 res->elements[i] = r;
2022 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2024 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2028 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2030 if (entry == SOLVID_POS && pool->pos.repo)
2031 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2034 return solvable_lookup_str(pool->solvables + entry, keyname);
2038 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2040 if (entry == SOLVID_POS && pool->pos.repo)
2042 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2043 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2044 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2048 return solvable_lookup_id(pool->solvables + entry, keyname);
2052 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2054 if (entry == SOLVID_POS && pool->pos.repo)
2056 unsigned long long value;
2057 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2063 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2067 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2069 if (entry == SOLVID_POS && pool->pos.repo)
2070 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2073 return solvable_lookup_void(pool->solvables + entry, keyname);
2076 const unsigned char *
2077 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2079 if (entry == SOLVID_POS && pool->pos.repo)
2080 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2083 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2087 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2089 if (entry == SOLVID_POS && pool->pos.repo)
2091 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2092 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2096 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2100 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2105 if (entry != SOLVID_POS)
2107 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2108 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2109 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2110 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2115 add_new_provider(Pool *pool, Id id, Id p)
2120 while (ISRELDEP(id))
2122 Reldep *rd = GETRELDEP(pool, id);
2127 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2139 queue_push(&q, *pp);
2143 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2148 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2150 int hadhashes = pool->relhashtbl ? 1 : 0;
2156 if (!conflicts->count)
2158 for (i = 0; i < conflicts->count; i += 6)
2160 fn = conflicts->elements[i];
2161 p = conflicts->elements[i + 1];
2162 md5 = conflicts->elements[i + 2];
2163 q = conflicts->elements[i + 4];
2164 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2165 s = pool->solvables + p;
2168 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2169 if (pool->whatprovides)
2170 add_new_provider(pool, fn, p);
2171 if (pool->whatprovides_rel)
2172 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2173 s = pool->solvables + q;
2176 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2179 pool_freeidhashes(pool);
2183 pool_prepend_rootdir(Pool *pool, const char *path)
2188 return solv_strdup(path);
2189 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2193 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2199 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2203 pool_set_rootdir(Pool *pool, const char *rootdir)
2205 solv_free(pool->rootdir);
2206 pool->rootdir = solv_strdup(rootdir);
2210 pool_get_rootdir(Pool *pool)
2212 return pool->rootdir;
2215 /* only used in libzypp */
2217 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2219 pool->custom_vendorcheck = vendorcheck;