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 for (i = 0; i < POOL_TMPSPACEBUF; i++)
107 solv_free(pool->tmpspace.buf[i]);
108 for (i = 0; i < pool->nlanguages; i++)
109 free((char *)pool->languages[i]);
110 solv_free(pool->languages);
111 solv_free(pool->languagecache);
112 solv_free(pool->errstr);
113 solv_free(pool->rootdir);
118 pool_freeallrepos(Pool *pool, int reuseids)
122 pool_freewhatprovides(pool);
123 for (i = 1; i < pool->nrepos; i++)
125 repo_freedata(pool->repos[i]);
126 pool->repos = solv_free(pool->repos);
129 /* the first two solvables don't belong to a repo */
130 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
133 #ifdef MULTI_SEMANTICS
135 pool_setdisttype(Pool *pool, int disttype)
137 pool->disttype = disttype;
138 if (disttype == DISTTYPE_RPM)
139 pool->noarchid = ARCH_NOARCH;
140 if (disttype == DISTTYPE_DEB)
141 pool->noarchid = ARCH_ALL;
142 if (disttype == DISTTYPE_ARCH)
143 pool->noarchid = ARCH_ANY;
144 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
149 pool_get_flag(Pool *pool, int flag)
153 case POOL_FLAG_PROMOTEEPOCH:
154 return pool->promoteepoch;
155 case POOL_FLAG_FORBIDSELFCONFLICTS:
156 return pool->forbidselfconflicts;
157 case POOL_FLAG_OBSOLETEUSESPROVIDES:
158 return pool->obsoleteusesprovides;
159 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
160 return pool->implicitobsoleteusesprovides;
161 case POOL_FLAG_OBSOLETEUSESCOLORS:
162 return pool->obsoleteusescolors;
163 case POOL_FLAG_NOINSTALLEDOBSOLETES:
164 return pool->noinstalledobsoletes;
165 case POOL_FLAG_HAVEDISTEPOCH:
166 return pool->havedistepoch;
174 pool_set_flag(Pool *pool, int flag, int value)
176 int old = pool_get_flag(pool, flag);
179 case POOL_FLAG_PROMOTEEPOCH:
180 pool->promoteepoch = value;
182 case POOL_FLAG_FORBIDSELFCONFLICTS:
183 pool->forbidselfconflicts = value;
185 case POOL_FLAG_OBSOLETEUSESPROVIDES:
186 pool->obsoleteusesprovides = value;
188 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
189 pool->implicitobsoleteusesprovides = value;
191 case POOL_FLAG_OBSOLETEUSESCOLORS:
192 pool->obsoleteusescolors = value;
194 case POOL_FLAG_NOINSTALLEDOBSOLETES:
195 pool->noinstalledobsoletes = value;
197 case POOL_FLAG_HAVEDISTEPOCH:
198 pool->havedistepoch = value;
208 pool_add_solvable(Pool *pool)
210 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
211 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
212 return pool->nsolvables++;
216 pool_add_solvable_block(Pool *pool, int count)
218 Id nsolvables = pool->nsolvables;
221 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
222 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
223 pool->nsolvables += count;
228 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
232 if (reuseids && start + count == pool->nsolvables)
234 /* might want to shrink solvable array */
235 pool->nsolvables = start;
238 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
243 pool_set_installed(Pool *pool, Repo *installed)
245 if (pool->installed == installed)
247 pool->installed = installed;
248 pool_freewhatprovides(pool);
252 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
257 oa = pool->whatprovides[*(Id *)ap];
258 ob = pool->whatprovides[*(Id *)bp];
260 return *(Id *)ap - *(Id *)bp;
261 da = pool->whatprovidesdata + oa;
262 db = pool->whatprovidesdata + ob;
264 if ((r = (*da++ - *db++)) != 0)
268 return *(Id *)ap - *(Id *)bp;
272 * pool_shrink_whatprovides - unify whatprovides data
274 * whatprovides_rel must be empty for this to work!
278 pool_shrink_whatprovides(Pool *pool)
282 Id lastid, *last, *dp, *lp;
286 if (pool->ss.nstrings < 3)
288 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
289 for (i = id = 0; id < pool->ss.nstrings; id++)
290 if (pool->whatprovides[id] && pool->whatprovides[id] != 1)
293 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
296 for (i = 0; i < n; i++)
299 o = pool->whatprovides[id];
300 dp = pool->whatprovidesdata + o;
314 pool->whatprovides[id] = -lastid;
318 last = pool->whatprovidesdata + o;
322 dp = pool->whatprovidesdata + 2;
323 for (id = 1; id < pool->ss.nstrings; id++)
325 o = pool->whatprovides[id];
326 if (o == 0 || o == 1)
333 pool->whatprovides[id] = pool->whatprovides[i];
336 lp = pool->whatprovidesdata + o;
339 pool->whatprovides[id] = dp - pool->whatprovidesdata;
340 while ((*dp++ = *lp++) != 0)
343 o = dp - pool->whatprovidesdata;
344 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
345 if (pool->whatprovidesdataoff == o)
347 r = pool->whatprovidesdataoff - o;
348 pool->whatprovidesdataoff = o;
349 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
350 if (r > pool->whatprovidesdataleft)
351 r = pool->whatprovidesdataleft;
352 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
357 * pool_createwhatprovides()
359 * create hashes over pool of solvables to ease provide lookups
363 pool_createwhatprovides(Pool *pool)
365 int i, num, np, extra;
370 Offset *whatprovides;
371 Id *whatprovidesdata, *d;
372 Repo *installed = pool->installed;
375 now = solv_timems(0);
376 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
377 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
378 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);
379 if (pool->ss.stringhashmask || pool->relhashmask)
380 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)));
382 pool_freeidhashes(pool); /* XXX: should not be here! */
383 pool_freewhatprovides(pool);
384 num = pool->ss.nstrings;
385 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
386 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
388 /* count providers for each name */
389 for (i = pool->nsolvables - 1; i > 0; i--)
392 s = pool->solvables + i;
393 if (!s->provides || !s->repo || s->repo->disabled)
395 /* we always need the installed solvable in the whatprovides data,
396 otherwise obsoletes/conflicts on them won't work */
397 if (s->repo != installed && !pool_installable(pool, s))
399 pp = s->repo->idarraydata + s->provides;
400 while ((id = *pp++) != 0)
404 Reldep *rd = GETRELDEP(pool, id);
407 whatprovides[id]++; /* inc count of providers */
411 off = 2; /* first entry is undef, second is empty list */
412 np = 0; /* number of names provided */
413 for (i = 0, idp = whatprovides; i < num; i++, idp++)
416 if (!n) /* no providers */
418 off += n; /* make space for all providers */
419 *idp = off++; /* now idp points to terminating zero */
420 np++; /* inc # of provider 'slots' for stats */
423 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
425 /* reserve some space for relation data */
426 extra = 2 * pool->nrels;
430 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
432 /* alloc space for all providers + extra */
433 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
435 /* now fill data for all provides */
436 for (i = pool->nsolvables - 1; i > 0; i--)
439 s = pool->solvables + i;
440 if (!s->provides || !s->repo || s->repo->disabled)
442 if (s->repo != installed && !pool_installable(pool, s))
445 /* for all provides of this solvable */
446 pp = s->repo->idarraydata + s->provides;
447 while ((id = *pp++) != 0)
451 Reldep *rd = GETRELDEP(pool, id);
454 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
455 if (*d != i) /* don't add same solvable twice */
462 pool->whatprovidesdata = whatprovidesdata;
463 pool->whatprovidesdataoff = off;
464 pool->whatprovidesdataleft = extra;
465 pool_shrink_whatprovides(pool);
466 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)));
467 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
471 * free all of our whatprovides data
472 * be careful, everything internalized with pool_queuetowhatprovides is
476 pool_freewhatprovides(Pool *pool)
478 pool->whatprovides = solv_free(pool->whatprovides);
479 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
480 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
481 pool->whatprovidesdataoff = 0;
482 pool->whatprovidesdataleft = 0;
486 /******************************************************************************/
489 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
491 * on-demand filling of provider information
492 * move queue data into whatprovidesdata
494 * returns: Offset into whatprovides
498 pool_queuetowhatprovides(Pool *pool, Queue *q)
501 int count = q->count;
503 if (count == 0) /* queue empty -> 1 */
506 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
507 if (pool->whatprovidesdataleft < count + 1)
509 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
510 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
511 pool->whatprovidesdataleft = count + 4096;
514 /* copy queue to next free slot */
515 off = pool->whatprovidesdataoff;
516 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
518 /* adapt count and ID_NULL-terminate */
519 pool->whatprovidesdataoff += count;
520 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
521 pool->whatprovidesdataleft -= count + 1;
527 /*************************************************************************/
529 #if defined(MULTI_SEMANTICS)
530 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
531 #elif defined(DEBIAN)
532 # define EVRCMP_DEPCMP EVRCMP_COMPARE
534 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
537 /* check if a package's nevr matches a dependency */
540 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
542 Reldep *rd = GETRELDEP(pool, d);
545 int flags = rd->flags;
554 return pool_match_nevr(pool, s, name);
556 if (pool_match_nevr(pool, s, name))
558 return pool_match_nevr(pool, s, evr);
561 if (!pool_match_nevr(pool, s, name))
563 return pool_match_nevr(pool, s, evr);
568 if (!pool_match_nevr(pool, s, name))
571 return (flags & REL_EQ) ? 1 : 0;
576 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
581 return (flags & REL_LT) ? 1 : 0;
583 return (flags & REL_EQ) ? 1 : 0;
585 return (flags & REL_GT) ? 1 : 0;
587 return (flags & REL_EQ) ? 1 : 0;
594 /* match (flags, evr) against provider (pflags, pevr) */
596 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
598 if (!pflags || !flags || pflags >= 8 || flags >= 8)
600 if (flags == 7 || pflags == 7)
601 return 1; /* rel provides every version */
602 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
603 return 1; /* both rels show in the same direction */
605 return (flags & pflags & REL_EQ) ? 1 : 0;
606 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
609 return (pflags & REL_EQ) ? 1 : 0;
611 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
613 return (flags & pflags & REL_EQ) ? 1 : 0;
615 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
617 return (flags & REL_EQ) ? 1 : 0;
624 /* match two dependencies (d1 = provider) */
627 pool_match_dep(Pool *pool, Id d1, Id d2)
637 rd2 = GETRELDEP(pool, d2);
638 return pool_match_dep(pool, d1, rd2->name);
640 rd1 = GETRELDEP(pool, d1);
643 return pool_match_dep(pool, rd1->name, d2);
645 rd2 = GETRELDEP(pool, d2);
646 /* first match name */
647 if (!pool_match_dep(pool, rd1->name, rd2->name))
649 /* name matches, check flags and evr */
650 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
656 * add packages fulfilling the relation to whatprovides array
657 * no exact providers, do range match
662 pool_addrelproviders(Pool *pool, Id d)
664 Reldep *rd = GETRELDEP(pool, d);
670 int flags = rd->flags;
675 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
679 /* special relation */
687 wp = pool_whatprovides(pool, name);
688 pp2 = pool_whatprovides_ptr(pool, evr);
689 pp = pool->whatprovidesdata + wp;
690 while ((p = *pp++) != 0)
692 for (pp3 = pp2; *pp3; pp3++)
696 queue_push(&plist, p); /* found it */
702 wp = pool_whatprovides(pool, name);
703 pp = pool->whatprovidesdata + wp;
705 wp = pool_whatprovides(pool, evr);
709 while ((p = *pp++) != 0)
710 queue_push(&plist, p);
712 pp = pool_whatprovides_ptr(pool, evr);
713 while ((p = *pp++) != 0)
714 queue_pushunique(&plist, p);
715 if (plist.count != cnt)
720 if (name == NAMESPACE_OTHERPROVIDERS)
722 wp = pool_whatprovides(pool, evr);
725 if (pool->nscallback)
727 /* ask callback which packages provide the dependency
729 * 1: the system (aka SYSTEMSOLVABLE)
730 * >1: set of packages, stored as offset on whatprovidesdata
732 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
736 queue_push(&plist, SYSTEMSOLVABLE);
740 /* small hack: make it possible to match <pkg>.src
741 * we have to iterate over the solvables as src packages do not
742 * provide anything, thus they are not indexed in our
743 * whatprovides hash */
747 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
749 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
751 if (pool_match_nevr(pool, s, name))
752 queue_push(&plist, p);
756 wp = pool_whatprovides(pool, name);
757 pp = pool->whatprovidesdata + wp;
758 while ((p = *pp++) != 0)
760 Solvable *s = pool->solvables + p;
762 queue_push(&plist, p);
767 case REL_FILECONFLICT:
768 pp = pool_whatprovides_ptr(pool, name);
769 while ((p = *pp++) != 0)
771 Id origd = MAKERELDEP(d);
772 Solvable *s = pool->solvables + p;
775 pidp = s->repo->idarraydata + s->provides;
776 while ((pid = *pidp++) != 0)
780 queue_push(&plist, p);
788 /* we can reuse an existing entry */
790 pool->whatprovides_rel[d] = wp;
796 /* simple version comparison relation */
798 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
800 pp = pool_whatprovides_ptr(pool, name);
801 while (ISRELDEP(name))
803 rd = GETRELDEP(pool, name);
806 while ((p = *pp++) != 0)
808 Solvable *s = pool->solvables + p;
811 /* no provides - check nevr */
812 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
813 queue_push(&plist, p);
816 /* solvable p provides name in some rels */
817 pidp = s->repo->idarraydata + s->provides;
818 while ((pid = *pidp++) != 0)
823 continue; /* wrong provides name */
824 if (pool->disttype == DISTTYPE_DEB)
825 continue; /* unversioned provides can never match versioned deps */
828 prd = GETRELDEP(pool, pid);
829 if (prd->name != name)
830 continue; /* wrong provides name */
831 /* right package, both deps are rels. check flags/evr */
832 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
836 continue; /* none of the providers matched */
837 queue_push(&plist, p);
839 /* make our system solvable provide all unknown rpmlib() stuff */
840 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
841 queue_push(&plist, SYSTEMSOLVABLE);
843 /* add providers to whatprovides */
845 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
847 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
850 return pool->whatprovides_rel[d];
853 /*************************************************************************/
856 pool_debug(Pool *pool, int type, const char *format, ...)
861 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
863 if ((pool->debugmask & type) == 0)
866 va_start(args, format);
867 if (!pool->debugcallback)
869 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
870 vprintf(format, args);
872 vfprintf(stderr, format, args);
875 vsnprintf(buf, sizeof(buf), format, args);
877 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
881 pool_error(Pool *pool, int ret, const char *format, ...)
885 va_start(args, format);
888 pool->errstra = 1024;
889 pool->errstr = solv_malloc(pool->errstra);
897 l = vsnprintf(pool->errstr, pool->errstra, format, args);
899 if (l >= 0 && l + 1 > pool->errstra)
901 pool->errstra = l + 256;
902 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
903 va_start(args, format);
904 l = vsnprintf(pool->errstr, pool->errstra, format, args);
908 strcpy(pool->errstr, "unknown error");
909 if (pool->debugmask & SOLV_ERROR)
910 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
915 pool_errstr(Pool *pool)
917 return pool->errstr ? pool->errstr : "no error";
921 pool_setdebuglevel(Pool *pool, int level)
923 int mask = SOLV_DEBUG_RESULT;
925 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
927 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
929 mask |= SOLV_DEBUG_PROPAGATE;
931 mask |= SOLV_DEBUG_RULE_CREATION;
932 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
933 pool->debugmask = mask;
936 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
938 pool->debugcallback = debugcallback;
939 pool->debugcallbackdata = debugcallbackdata;
942 void pool_setdebugmask(Pool *pool, int mask)
944 pool->debugmask = mask;
947 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
949 pool->loadcallback = cb;
950 pool->loadcallbackdata = loadcbdata;
953 /*************************************************************************/
963 #define SEARCHFILES_BLOCK 127
966 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
970 struct searchfiles *csf;
972 while ((dep = *ida++) != 0)
975 while (ISRELDEP(dep))
978 sid = pool->ss.nstrings + GETRELID(dep);
979 if (MAPTST(&csf->seen, sid))
984 MAPSET(&csf->seen, sid);
985 rd = GETRELDEP(pool, dep);
988 else if (rd->flags == REL_NAMESPACE)
990 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
993 if (!csf || MAPTST(&csf->seen, sid))
998 MAPSET(&csf->seen, sid);
1002 else if (rd->flags == REL_FILECONFLICT)
1012 pool_addfileprovides_dep(pool, ids, csf, isf);
1018 if (MAPTST(&csf->seen, dep))
1020 MAPSET(&csf->seen, dep);
1021 s = pool_id2str(pool, dep);
1024 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1025 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1026 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1027 csf->ids[csf->nfiles] = dep;
1028 sr = strrchr(s, '/');
1029 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1030 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1032 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1033 csf->dirs[csf->nfiles][sr - s] = 0;
1038 struct addfileprovides_cbdata {
1052 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1054 struct addfileprovides_cbdata *cbd = cbdata;
1057 if (!cbd->useddirs.size)
1059 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1060 for (i = 0; i < cbd->nfiles; i++)
1063 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1068 did = repodata_str2dir(data, cbd->dirs[i], 0);
1071 MAPSET(&cbd->useddirs, did);
1073 repodata_free_dircache(data);
1075 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1077 for (i = 0; i < cbd->nfiles; i++)
1079 if (cbd->dids[i] != value->id)
1081 if (!strcmp(cbd->names[i], value->str))
1084 if (i == cbd->nfiles)
1086 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1091 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1096 Queue fileprovidesq;
1097 int i, j, repoid, repodataid;
1098 int provstart, provend;
1100 int ndone, incomplete;
1105 cbd->nfiles = sf->nfiles;
1107 cbd->dirs = sf->dirs;
1108 cbd->names = sf->names;
1109 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1110 map_init(&cbd->providedids, pool->ss.nstrings);
1113 repo = repoonly ? repoonly : pool->repos[repoid];
1114 map_init(&donemap, pool->nsolvables);
1115 queue_init(&fileprovidesq);
1116 provstart = provend = 0;
1119 if (!repo || repo->disabled)
1121 if (repoonly || ++repoid == pool->nrepos)
1123 repo = pool->repos[repoid];
1127 FOR_REPODATAS(repo, repodataid, data)
1129 if (ndone >= repo->nsolvables)
1132 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1134 map_empty(&cbd->providedids);
1135 for (i = 0; i < fileprovidesq.count; i++)
1136 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1137 provstart = data->start;
1138 provend = data->end;
1139 for (i = 0; i < cbd->nfiles; i++)
1140 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1142 if (i == cbd->nfiles)
1144 /* great! no need to search files */
1145 for (p = data->start; p < data->end; p++)
1146 if (pool->solvables[p].repo == repo)
1148 if (MAPTST(&donemap, p))
1150 MAPSET(&donemap, p);
1157 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1160 if (data->start < provstart || data->end > provend)
1162 map_empty(&cbd->providedids);
1163 provstart = provend = 0;
1166 /* check if the data is incomplete */
1168 if (data->state == REPODATA_AVAILABLE)
1170 for (j = 1; j < data->nkeys; j++)
1171 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1173 if (j < data->nkeys)
1176 for (i = 0; i < cbd->nfiles; i++)
1177 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1178 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1180 for (i = 0; i < cbd->nfiles; i++)
1181 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1183 if (i < cbd->nfiles)
1189 map_init(&cbd->useddirs, 0);
1190 for (p = data->start; p < data->end; p++)
1191 if (pool->solvables[p].repo == repo)
1193 if (MAPTST(&donemap, p))
1195 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1198 MAPSET(&donemap, p);
1202 map_free(&cbd->useddirs);
1205 if (repoonly || ++repoid == pool->nrepos)
1207 repo = pool->repos[repoid];
1210 queue_free(&fileprovidesq);
1211 map_free(&cbd->providedids);
1215 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1218 Repo *installed, *repo;
1219 struct searchfiles sf, isf, *isfp;
1220 struct addfileprovides_cbdata cbd;
1224 installed = pool->installed;
1225 now = solv_timems(0);
1226 memset(&sf, 0, sizeof(sf));
1227 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1228 memset(&isf, 0, sizeof(isf));
1229 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1234 queue_empty(idqinst);
1235 isfp = installed ? &isf : 0;
1236 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1242 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1244 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1246 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1248 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1250 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1252 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1254 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1257 map_free(&isf.seen);
1258 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1263 for (i = 0; i < sf.nfiles; i++)
1264 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1266 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1268 for (i = 0; i < sf.nfiles; i++)
1269 queue_push(idq, sf.ids[i]);
1271 for (i = 0; i < sf.nfiles; i++)
1272 queue_push(idqinst, sf.ids[i]);
1274 for (i = 0; i < sf.nfiles; i++)
1276 solv_free(sf.dirs[i]);
1277 solv_free(sf.names[i]);
1280 solv_free(sf.names);
1285 for (i = 0; i < isf.nfiles; i++)
1286 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1289 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1290 if (installed && idqinst)
1291 for (i = 0; i < isf.nfiles; i++)
1292 queue_pushunique(idqinst, isf.ids[i]);
1294 for (i = 0; i < isf.nfiles; i++)
1296 solv_free(isf.dirs[i]);
1297 solv_free(isf.names[i]);
1299 solv_free(isf.dirs);
1300 solv_free(isf.names);
1302 solv_free(cbd.dids);
1303 pool_freewhatprovides(pool); /* as we have added provides */
1304 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1308 pool_addfileprovides(Pool *pool)
1310 pool_addfileprovides_queue(pool, 0, 0);
1314 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)
1318 if (pool->solvables[p].repo)
1319 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1322 /* FIXME: obey callback return value! */
1323 for (p = 1; p < pool->nsolvables; p++)
1324 if (pool->solvables[p].repo)
1325 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1329 pool_clear_pos(Pool *pool)
1331 memset(&pool->pos, 0, sizeof(pool->pos));
1336 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1340 pool->languagecache = solv_free(pool->languagecache);
1341 pool->languagecacheother = 0;
1342 if (pool->nlanguages)
1344 for (i = 0; i < pool->nlanguages; i++)
1345 free((char *)pool->languages[i]);
1346 free(pool->languages);
1348 pool->nlanguages = nlanguages;
1351 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1352 for (i = 0; i < pool->nlanguages; i++)
1353 pool->languages[i] = solv_strdup(languages[i]);
1357 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1363 if (!lang || !*lang)
1365 n = pool_id2str(pool, id);
1366 l = strlen(n) + strlen(lang) + 2;
1367 if (l > sizeof(buf))
1368 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1371 sprintf(p, "%s:%s", n, lang);
1372 id = pool_str2id(pool, p, create);
1379 pool_alloctmpspace(Pool *pool, int len)
1381 int n = pool->tmpspace.n;
1384 if (len > pool->tmpspace.len[n])
1386 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1387 pool->tmpspace.len[n] = len + 32;
1389 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1390 return pool->tmpspace.buf[n];
1394 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1399 n = oldn = pool->tmpspace.n;
1403 n = POOL_TMPSPACEBUF - 1;
1406 if (pool->tmpspace.buf[n] != space)
1408 if (len > pool->tmpspace.len[n])
1410 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1411 pool->tmpspace.len[n] = len + 32;
1413 return pool->tmpspace.buf[n];
1420 pool_freetmpspace(Pool *pool, const char *space)
1422 int n = pool->tmpspace.n;
1425 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1426 if (pool->tmpspace.buf[n] == space)
1427 pool->tmpspace.n = n;
1431 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1435 l1 = str1 ? strlen(str1) : 0;
1436 l2 = str2 ? strlen(str2) : 0;
1437 l3 = str3 ? strlen(str3) : 0;
1438 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1459 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1464 l1 = str1 ? strlen(str1) : 0;
1465 l2 = str2 ? strlen(str2) : 0;
1466 l3 = str3 ? strlen(str3) : 0;
1467 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1471 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1494 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1499 s = pool_alloctmpspace(pool, 2 * len + 1);
1500 solv_bin2hex(buf, len, s);
1504 /*******************************************************************/
1516 struct mptree *mptree;
1527 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1529 struct ducbdata *cbd = cbdata;
1532 if (data != cbd->olddata)
1534 Id dn, mp, comp, *dirmap, *dirs;
1536 const char *compstr;
1537 struct mptree *mptree;
1539 /* create map from dir to mptree */
1540 cbd->dirmap = solv_free(cbd->dirmap);
1542 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1543 mptree = cbd->mptree;
1545 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1559 if (!mptree[mp].child)
1564 if (data->localpool)
1565 compstr = stringpool_id2str(&data->spool, comp);
1567 compstr = pool_id2str(data->repo->pool, comp);
1568 compl = strlen(compstr);
1569 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1570 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1572 dirmap[dn] = i ? i : -mp;
1574 /* change dirmap to point to mountpoint instead of mptree */
1575 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1578 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1580 cbd->dirmap = dirmap;
1581 cbd->nmap = data->dirpool.ndirs;
1582 cbd->olddata = data;
1585 if (value->id < 0 || value->id >= cbd->nmap)
1587 mp = cbd->dirmap[value->id];
1590 if (cbd->addsub > 0)
1592 cbd->mps[mp].kbytes += value->num;
1593 cbd->mps[mp].files += value->num2;
1597 cbd->mps[mp].kbytes -= value->num;
1598 cbd->mps[mp].files -= value->num2;
1604 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1607 if (mptree[pos].mountpoint == -1)
1608 mptree[pos].mountpoint = mountpoint;
1610 mountpoint = mptree[pos].mountpoint;
1611 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1612 propagate_mountpoints(mptree, i, mountpoint);
1615 #define MPTREE_BLOCK 15
1618 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1621 const char *path, *compstr;
1622 struct mptree *mptree;
1626 struct ducbdata cbd;
1630 Repo *oldinstalled = pool->installed;
1632 memset(&ignoredu, 0, sizeof(ignoredu));
1639 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1642 mptree[0].sibling = 0;
1643 mptree[0].child = 0;
1645 mptree[0].compl = 0;
1646 mptree[0].mountpoint = -1;
1649 /* create component tree */
1650 for (mp = 0; mp < nmps; mp++)
1655 path = mps[mp].path;
1660 if ((p = strchr(path, '/')) == 0)
1663 compl = strlen(compstr);
1674 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1675 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1679 /* create new node */
1680 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1682 mptree[i].sibling = mptree[pos].child;
1683 mptree[i].child = 0;
1684 mptree[i].comp = compstr;
1685 mptree[i].compl = compl;
1686 mptree[i].mountpoint = -1;
1687 mptree[pos].child = i;
1691 mptree[pos].mountpoint = mp;
1694 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1697 for (i = 0; i < nmptree; i++)
1699 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1700 printf("#%d child: %d\n", i, mptree[i].child);
1701 printf("#%d comp: %s\n", i, mptree[i].comp);
1702 printf("#%d compl: %d\n", i, mptree[i].compl);
1703 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1707 cbd.mptree = mptree;
1709 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1711 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1713 if (!MAPTST(installedmap, sp))
1716 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1717 if (!cbd.hasdu && oldinstalled)
1720 /* no du data available, ignore data of all installed solvables we obsolete */
1722 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1725 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1726 while ((obs = *obsp++) != 0)
1727 FOR_PROVIDES(op, opp, obs)
1728 if (op >= oldinstalled->start && op < oldinstalled->end)
1729 MAPSET(&ignoredu, op - oldinstalled->start);
1731 FOR_PROVIDES(op, opp, s->name)
1732 if (pool->solvables[op].name == s->name)
1733 if (op >= oldinstalled->start && op < oldinstalled->end)
1734 MAPSET(&ignoredu, op - oldinstalled->start);
1740 /* assumes we allways have du data for installed solvables */
1741 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1743 if (MAPTST(installedmap, sp))
1745 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1747 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1751 map_free(&ignoredu);
1752 solv_free(cbd.dirmap);
1757 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1762 Repo *oldinstalled = pool->installed;
1764 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1766 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1768 if (!MAPTST(installedmap, sp))
1770 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1774 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1776 if (MAPTST(installedmap, sp))
1778 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1786 * 2: conflicts with installed
1787 * 8: interesting (only true if installed)
1791 static inline Id dep2name(Pool *pool, Id dep)
1793 while (ISRELDEP(dep))
1795 Reldep *rd = rd = GETRELDEP(pool, dep);
1801 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1804 Solvable *sn = pool->solvables + n;
1806 FOR_PROVIDES(p, pp, sn->name)
1808 Solvable *s = pool->solvables + p;
1809 if (s->name != sn->name || s->arch != sn->arch)
1811 if ((map[p] & 9) != 9)
1813 if (pool_match_nevr(pool, pool->solvables + p, con))
1815 return 1; /* found installed package that doesn't conflict */
1820 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1824 FOR_PROVIDES(p, pp, dep)
1826 if (p == SYSTEMSOLVABLE)
1827 return 1; /* always boring, as never constraining */
1828 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1830 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1831 if (providedbyinstalled_multiversion(pool, map, p, dep))
1833 if ((map[p] & 9) == 9)
1841 * pool_trivial_installable - calculate if a set of solvables is
1842 * trivial installable without any other installs/deinstalls of
1843 * packages not belonging to the set.
1845 * the state is returned in the result queue:
1846 * 1: solvable is installable without any other package changes
1847 * 0: solvable is not installable
1848 * -1: solvable is installable, but doesn't constrain any installed packages
1852 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1855 Id p, *dp, con, *conp, req, *reqp;
1859 map = solv_calloc(pool->nsolvables, 1);
1860 for (p = 1; p < pool->nsolvables; p++)
1862 if (!MAPTST(installedmap, p))
1865 s = pool->solvables + p;
1868 conp = s->repo->idarraydata + s->conflicts;
1869 while ((con = *conp++) != 0)
1871 dp = pool_whatprovides_ptr(pool, con);
1873 map[p] |= 2; /* XXX: self conflict ? */
1876 for (i = 0; i < pkgs->count; i++)
1877 map[pkgs->elements[i]] = 16;
1879 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1881 if (i == pkgs->count)
1883 p = pkgs->elements[i];
1884 if ((map[p] & 16) == 0)
1886 if ((map[p] & 2) != 0)
1891 s = pool->solvables + p;
1895 reqp = s->repo->idarraydata + s->requires;
1896 while ((req = *reqp++) != 0)
1898 if (req == SOLVABLE_PREREQMARKER)
1900 r = providedbyinstalled(pool, map, req, 0, 0);
1903 /* decided and miss */
1907 m |= r; /* 1 | 9 | 16 | 17 */
1916 int ispatch = 0; /* see solver.c patch handling */
1918 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1920 conp = s->repo->idarraydata + s->conflicts;
1921 while ((con = *conp++) != 0)
1923 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1928 if ((m == 1 || m == 17) && ISRELDEP(con))
1930 con = dep2name(pool, con);
1931 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1936 continue; /* found a conflict */
1939 if (s->repo && s->repo != oldinstalled)
1941 Id p2, obs, *obsp, *pp;
1945 obsp = s->repo->idarraydata + s->obsoletes;
1946 while ((obs = *obsp++) != 0)
1948 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1957 FOR_PROVIDES(p2, pp, s->name)
1959 s2 = pool->solvables + p2;
1960 if (s2->name == s->name && (map[p2] & 1) != 0)
1977 queue_init_clone(res, pkgs);
1978 for (i = 0; i < pkgs->count; i++)
1980 m = map[pkgs->elements[i]];
1987 res->elements[i] = r;
1993 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1995 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1999 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2001 if (entry == SOLVID_POS && pool->pos.repo)
2002 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2005 return solvable_lookup_str(pool->solvables + entry, keyname);
2009 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2011 if (entry == SOLVID_POS && pool->pos.repo)
2013 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2014 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2015 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2019 return solvable_lookup_id(pool->solvables + entry, keyname);
2023 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2025 if (entry == SOLVID_POS && pool->pos.repo)
2027 unsigned long long value;
2028 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2034 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2038 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2040 if (entry == SOLVID_POS && pool->pos.repo)
2041 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2044 return solvable_lookup_void(pool->solvables + entry, keyname);
2047 const unsigned char *
2048 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2050 if (entry == SOLVID_POS && pool->pos.repo)
2051 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2054 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2058 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2060 if (entry == SOLVID_POS && pool->pos.repo)
2062 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2063 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2067 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2071 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2073 int hadhashes = pool->relhashtbl ? 1 : 0;
2079 if (!conflicts->count)
2081 pool_freewhatprovides(pool);
2082 for (i = 0; i < conflicts->count; i += 5)
2084 fn = conflicts->elements[i];
2085 p = conflicts->elements[i + 1];
2086 md5 = conflicts->elements[i + 2];
2087 q = conflicts->elements[i + 3];
2088 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2089 s = pool->solvables + p;
2092 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2093 s = pool->solvables + q;
2096 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2099 pool_freeidhashes(pool);
2103 pool_prepend_rootdir(Pool *pool, const char *path)
2108 return solv_strdup(path);
2109 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2113 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2119 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2123 pool_set_rootdir(Pool *pool, const char *rootdir)
2125 solv_free(pool->rootdir);
2126 pool->rootdir = solv_strdup(rootdir);
2130 pool_get_rootdir(Pool *pool)
2132 return pool->rootdir;