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;
614 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
617 return (pflags & REL_EQ) ? 1 : 0;
619 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
621 return (flags & pflags & REL_EQ) ? 1 : 0;
623 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
625 return (flags & REL_EQ) ? 1 : 0;
632 /* match two dependencies (d1 = provider) */
635 pool_match_dep(Pool *pool, Id d1, Id d2)
645 rd2 = GETRELDEP(pool, d2);
646 return pool_match_dep(pool, d1, rd2->name);
648 rd1 = GETRELDEP(pool, d1);
651 return pool_match_dep(pool, rd1->name, d2);
653 rd2 = GETRELDEP(pool, d2);
654 /* first match name */
655 if (!pool_match_dep(pool, rd1->name, rd2->name))
657 /* name matches, check flags and evr */
658 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
664 * add packages fulfilling the relation to whatprovides array
665 * no exact providers, do range match
670 pool_addrelproviders(Pool *pool, Id d)
672 Reldep *rd = GETRELDEP(pool, d);
678 int flags = rd->flags;
683 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
687 /* special relation */
695 wp = pool_whatprovides(pool, name);
696 pp2 = pool_whatprovides_ptr(pool, evr);
697 pp = pool->whatprovidesdata + wp;
698 while ((p = *pp++) != 0)
700 for (pp3 = pp2; *pp3; pp3++)
704 queue_push(&plist, p); /* found it */
710 wp = pool_whatprovides(pool, name);
711 pp = pool->whatprovidesdata + wp;
713 wp = pool_whatprovides(pool, evr);
717 while ((p = *pp++) != 0)
718 queue_push(&plist, p);
720 pp = pool_whatprovides_ptr(pool, evr);
721 while ((p = *pp++) != 0)
722 queue_pushunique(&plist, p);
723 if (plist.count != cnt)
728 if (name == NAMESPACE_OTHERPROVIDERS)
730 wp = pool_whatprovides(pool, evr);
733 if (pool->nscallback)
735 /* ask callback which packages provide the dependency
737 * 1: the system (aka SYSTEMSOLVABLE)
738 * >1: set of packages, stored as offset on whatprovidesdata
740 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
744 queue_push(&plist, SYSTEMSOLVABLE);
748 /* small hack: make it possible to match <pkg>.src
749 * we have to iterate over the solvables as src packages do not
750 * provide anything, thus they are not indexed in our
751 * whatprovides hash */
752 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
755 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
759 if (s->arch != evr && s->arch != ARCH_NOSRC)
761 if (pool_disabled_solvable(pool, s))
763 if (pool_match_nevr(pool, s, name))
764 queue_push(&plist, p);
768 wp = pool_whatprovides(pool, name);
769 pp = pool->whatprovidesdata + wp;
770 while ((p = *pp++) != 0)
772 Solvable *s = pool->solvables + p;
774 queue_push(&plist, p);
779 case REL_FILECONFLICT:
780 pp = pool_whatprovides_ptr(pool, name);
781 while ((p = *pp++) != 0)
783 Id origd = MAKERELDEP(d);
784 Solvable *s = pool->solvables + p;
787 pidp = s->repo->idarraydata + s->provides;
788 while ((pid = *pidp++) != 0)
792 queue_push(&plist, p);
800 /* we can reuse an existing entry */
802 pool->whatprovides_rel[d] = wp;
808 /* simple version comparison relation */
810 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
812 pp = pool_whatprovides_ptr(pool, name);
813 while (ISRELDEP(name))
815 rd = GETRELDEP(pool, name);
818 while ((p = *pp++) != 0)
820 Solvable *s = pool->solvables + p;
823 /* no provides - check nevr */
824 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
825 queue_push(&plist, p);
828 /* solvable p provides name in some rels */
829 pidp = s->repo->idarraydata + s->provides;
830 while ((pid = *pidp++) != 0)
835 continue; /* wrong provides name */
836 if (pool->disttype == DISTTYPE_DEB)
837 continue; /* unversioned provides can never match versioned deps */
840 prd = GETRELDEP(pool, pid);
841 if (prd->name != name)
842 continue; /* wrong provides name */
843 /* right package, both deps are rels. check flags/evr */
844 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
848 continue; /* none of the providers matched */
849 queue_push(&plist, p);
851 /* make our system solvable provide all unknown rpmlib() stuff */
852 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
853 queue_push(&plist, SYSTEMSOLVABLE);
855 /* add providers to whatprovides */
857 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
859 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
862 return pool->whatprovides_rel[d];
865 /*************************************************************************/
868 pool_debug(Pool *pool, int type, const char *format, ...)
873 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
875 if ((pool->debugmask & type) == 0)
878 va_start(args, format);
879 if (!pool->debugcallback)
881 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
882 vprintf(format, args);
884 vfprintf(stderr, format, args);
887 vsnprintf(buf, sizeof(buf), format, args);
889 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
893 pool_error(Pool *pool, int ret, const char *format, ...)
897 va_start(args, format);
900 pool->errstra = 1024;
901 pool->errstr = solv_malloc(pool->errstra);
909 l = vsnprintf(pool->errstr, pool->errstra, format, args);
911 if (l >= 0 && l + 1 > pool->errstra)
913 pool->errstra = l + 256;
914 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
915 va_start(args, format);
916 l = vsnprintf(pool->errstr, pool->errstra, format, args);
920 strcpy(pool->errstr, "unknown error");
921 if (pool->debugmask & SOLV_ERROR)
922 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
927 pool_errstr(Pool *pool)
929 return pool->errstr ? pool->errstr : "no error";
933 pool_setdebuglevel(Pool *pool, int level)
935 int mask = SOLV_DEBUG_RESULT;
937 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
939 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
941 mask |= SOLV_DEBUG_PROPAGATE;
943 mask |= SOLV_DEBUG_RULE_CREATION;
944 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
945 pool->debugmask = mask;
948 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
950 pool->debugcallback = debugcallback;
951 pool->debugcallbackdata = debugcallbackdata;
954 void pool_setdebugmask(Pool *pool, int mask)
956 pool->debugmask = mask;
959 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
961 pool->loadcallback = cb;
962 pool->loadcallbackdata = loadcbdata;
965 /*************************************************************************/
975 #define SEARCHFILES_BLOCK 127
978 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
982 struct searchfiles *csf;
984 while ((dep = *ida++) != 0)
987 while (ISRELDEP(dep))
990 sid = pool->ss.nstrings + GETRELID(dep);
991 if (MAPTST(&csf->seen, sid))
996 MAPSET(&csf->seen, sid);
997 rd = GETRELDEP(pool, dep);
1000 else if (rd->flags == REL_NAMESPACE)
1002 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1005 if (!csf || MAPTST(&csf->seen, sid))
1010 MAPSET(&csf->seen, sid);
1014 else if (rd->flags == REL_FILECONFLICT)
1024 pool_addfileprovides_dep(pool, ids, csf, isf);
1030 if (MAPTST(&csf->seen, dep))
1032 MAPSET(&csf->seen, dep);
1033 s = pool_id2str(pool, dep);
1036 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1037 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1038 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1039 csf->ids[csf->nfiles] = dep;
1040 sr = strrchr(s, '/');
1041 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1042 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1044 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1045 csf->dirs[csf->nfiles][sr - s] = 0;
1050 struct addfileprovides_cbdata {
1064 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1066 struct addfileprovides_cbdata *cbd = cbdata;
1069 if (!cbd->useddirs.size)
1071 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1072 for (i = 0; i < cbd->nfiles; i++)
1075 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1080 did = repodata_str2dir(data, cbd->dirs[i], 0);
1083 MAPSET(&cbd->useddirs, did);
1085 repodata_free_dircache(data);
1087 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1089 for (i = 0; i < cbd->nfiles; i++)
1091 if (cbd->dids[i] != value->id)
1093 if (!strcmp(cbd->names[i], value->str))
1096 if (i == cbd->nfiles)
1098 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1103 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1108 Queue fileprovidesq;
1109 int i, j, repoid, repodataid;
1110 int provstart, provend;
1112 int ndone, incomplete;
1117 cbd->nfiles = sf->nfiles;
1119 cbd->dirs = sf->dirs;
1120 cbd->names = sf->names;
1121 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1122 map_init(&cbd->providedids, pool->ss.nstrings);
1125 repo = repoonly ? repoonly : pool->repos[repoid];
1126 map_init(&donemap, pool->nsolvables);
1127 queue_init(&fileprovidesq);
1128 provstart = provend = 0;
1131 if (!repo || repo->disabled)
1133 if (repoonly || ++repoid == pool->nrepos)
1135 repo = pool->repos[repoid];
1139 FOR_REPODATAS(repo, repodataid, data)
1141 if (ndone >= repo->nsolvables)
1144 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1146 map_empty(&cbd->providedids);
1147 for (i = 0; i < fileprovidesq.count; i++)
1148 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1149 provstart = data->start;
1150 provend = data->end;
1151 for (i = 0; i < cbd->nfiles; i++)
1152 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1154 if (i == cbd->nfiles)
1156 /* great! no need to search files */
1157 for (p = data->start; p < data->end; p++)
1158 if (pool->solvables[p].repo == repo)
1160 if (MAPTST(&donemap, p))
1162 MAPSET(&donemap, p);
1169 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1172 if (data->start < provstart || data->end > provend)
1174 map_empty(&cbd->providedids);
1175 provstart = provend = 0;
1178 /* check if the data is incomplete */
1180 if (data->state == REPODATA_AVAILABLE)
1182 for (j = 1; j < data->nkeys; j++)
1183 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1185 if (j < data->nkeys)
1188 for (i = 0; i < cbd->nfiles; i++)
1189 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1190 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1192 for (i = 0; i < cbd->nfiles; i++)
1193 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1195 if (i < cbd->nfiles)
1201 map_init(&cbd->useddirs, 0);
1202 for (p = data->start; p < data->end; p++)
1203 if (pool->solvables[p].repo == repo)
1205 if (MAPTST(&donemap, p))
1207 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1210 MAPSET(&donemap, p);
1214 map_free(&cbd->useddirs);
1217 if (repoonly || ++repoid == pool->nrepos)
1219 repo = pool->repos[repoid];
1222 queue_free(&fileprovidesq);
1223 map_free(&cbd->providedids);
1227 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1230 Repo *installed, *repo;
1231 struct searchfiles sf, isf, *isfp;
1232 struct addfileprovides_cbdata cbd;
1236 installed = pool->installed;
1237 now = solv_timems(0);
1238 memset(&sf, 0, sizeof(sf));
1239 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1240 memset(&isf, 0, sizeof(isf));
1241 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1246 queue_empty(idqinst);
1247 isfp = installed ? &isf : 0;
1248 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1254 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1256 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1258 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1260 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1262 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1264 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1266 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1269 map_free(&isf.seen);
1270 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1275 for (i = 0; i < sf.nfiles; i++)
1276 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1278 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1280 for (i = 0; i < sf.nfiles; i++)
1281 queue_push(idq, sf.ids[i]);
1283 for (i = 0; i < sf.nfiles; i++)
1284 queue_push(idqinst, sf.ids[i]);
1286 for (i = 0; i < sf.nfiles; i++)
1288 solv_free(sf.dirs[i]);
1289 solv_free(sf.names[i]);
1292 solv_free(sf.names);
1297 for (i = 0; i < isf.nfiles; i++)
1298 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1301 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1302 if (installed && idqinst)
1303 for (i = 0; i < isf.nfiles; i++)
1304 queue_pushunique(idqinst, isf.ids[i]);
1306 for (i = 0; i < isf.nfiles; i++)
1308 solv_free(isf.dirs[i]);
1309 solv_free(isf.names[i]);
1311 solv_free(isf.dirs);
1312 solv_free(isf.names);
1314 solv_free(cbd.dids);
1315 pool_freewhatprovides(pool); /* as we have added provides */
1316 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1320 pool_addfileprovides(Pool *pool)
1322 pool_addfileprovides_queue(pool, 0, 0);
1326 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)
1330 if (pool->solvables[p].repo)
1331 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1334 /* FIXME: obey callback return value! */
1335 for (p = 1; p < pool->nsolvables; p++)
1336 if (pool->solvables[p].repo)
1337 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1341 pool_clear_pos(Pool *pool)
1343 memset(&pool->pos, 0, sizeof(pool->pos));
1348 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1352 pool->languagecache = solv_free(pool->languagecache);
1353 pool->languagecacheother = 0;
1354 if (pool->nlanguages)
1356 for (i = 0; i < pool->nlanguages; i++)
1357 free((char *)pool->languages[i]);
1358 free(pool->languages);
1360 pool->nlanguages = nlanguages;
1363 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1364 for (i = 0; i < pool->nlanguages; i++)
1365 pool->languages[i] = solv_strdup(languages[i]);
1369 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1375 if (!lang || !*lang)
1377 n = pool_id2str(pool, id);
1378 l = strlen(n) + strlen(lang) + 2;
1379 if (l > sizeof(buf))
1380 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1383 sprintf(p, "%s:%s", n, lang);
1384 id = pool_str2id(pool, p, create);
1391 pool_alloctmpspace(Pool *pool, int len)
1393 int n = pool->tmpspace.n;
1396 if (len > pool->tmpspace.len[n])
1398 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1399 pool->tmpspace.len[n] = len + 32;
1401 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1402 return pool->tmpspace.buf[n];
1406 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1411 n = oldn = pool->tmpspace.n;
1415 n = POOL_TMPSPACEBUF - 1;
1418 if (pool->tmpspace.buf[n] != space)
1420 if (len > pool->tmpspace.len[n])
1422 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1423 pool->tmpspace.len[n] = len + 32;
1425 return pool->tmpspace.buf[n];
1432 pool_freetmpspace(Pool *pool, const char *space)
1434 int n = pool->tmpspace.n;
1437 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1438 if (pool->tmpspace.buf[n] == space)
1439 pool->tmpspace.n = n;
1443 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1447 l1 = str1 ? strlen(str1) : 0;
1448 l2 = str2 ? strlen(str2) : 0;
1449 l3 = str3 ? strlen(str3) : 0;
1450 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1471 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1476 l1 = str1 ? strlen(str1) : 0;
1477 l2 = str2 ? strlen(str2) : 0;
1478 l3 = str3 ? strlen(str3) : 0;
1479 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1483 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1506 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1511 s = pool_alloctmpspace(pool, 2 * len + 1);
1512 solv_bin2hex(buf, len, s);
1516 /*******************************************************************/
1528 struct mptree *mptree;
1539 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1541 struct ducbdata *cbd = cbdata;
1544 if (data != cbd->olddata)
1546 Id dn, mp, comp, *dirmap, *dirs;
1548 const char *compstr;
1549 struct mptree *mptree;
1551 /* create map from dir to mptree */
1552 cbd->dirmap = solv_free(cbd->dirmap);
1554 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1555 mptree = cbd->mptree;
1557 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1571 if (!mptree[mp].child)
1576 if (data->localpool)
1577 compstr = stringpool_id2str(&data->spool, comp);
1579 compstr = pool_id2str(data->repo->pool, comp);
1580 compl = strlen(compstr);
1581 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1582 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1584 dirmap[dn] = i ? i : -mp;
1586 /* change dirmap to point to mountpoint instead of mptree */
1587 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1590 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1592 cbd->dirmap = dirmap;
1593 cbd->nmap = data->dirpool.ndirs;
1594 cbd->olddata = data;
1597 if (value->id < 0 || value->id >= cbd->nmap)
1599 mp = cbd->dirmap[value->id];
1602 if (cbd->addsub > 0)
1604 cbd->mps[mp].kbytes += value->num;
1605 cbd->mps[mp].files += value->num2;
1609 cbd->mps[mp].kbytes -= value->num;
1610 cbd->mps[mp].files -= value->num2;
1616 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1619 if (mptree[pos].mountpoint == -1)
1620 mptree[pos].mountpoint = mountpoint;
1622 mountpoint = mptree[pos].mountpoint;
1623 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1624 propagate_mountpoints(mptree, i, mountpoint);
1627 #define MPTREE_BLOCK 15
1630 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1633 const char *path, *compstr;
1634 struct mptree *mptree;
1638 struct ducbdata cbd;
1642 Repo *oldinstalled = pool->installed;
1644 memset(&ignoredu, 0, sizeof(ignoredu));
1651 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1654 mptree[0].sibling = 0;
1655 mptree[0].child = 0;
1657 mptree[0].compl = 0;
1658 mptree[0].mountpoint = -1;
1661 /* create component tree */
1662 for (mp = 0; mp < nmps; mp++)
1667 path = mps[mp].path;
1672 if ((p = strchr(path, '/')) == 0)
1675 compl = strlen(compstr);
1686 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1687 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1691 /* create new node */
1692 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1694 mptree[i].sibling = mptree[pos].child;
1695 mptree[i].child = 0;
1696 mptree[i].comp = compstr;
1697 mptree[i].compl = compl;
1698 mptree[i].mountpoint = -1;
1699 mptree[pos].child = i;
1703 mptree[pos].mountpoint = mp;
1706 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1709 for (i = 0; i < nmptree; i++)
1711 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1712 printf("#%d child: %d\n", i, mptree[i].child);
1713 printf("#%d comp: %s\n", i, mptree[i].comp);
1714 printf("#%d compl: %d\n", i, mptree[i].compl);
1715 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1719 cbd.mptree = mptree;
1721 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1723 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1725 if (!MAPTST(installedmap, sp))
1728 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1729 if (!cbd.hasdu && oldinstalled)
1732 /* no du data available, ignore data of all installed solvables we obsolete */
1734 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1737 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1738 while ((obs = *obsp++) != 0)
1739 FOR_PROVIDES(op, opp, obs)
1740 if (op >= oldinstalled->start && op < oldinstalled->end)
1741 MAPSET(&ignoredu, op - oldinstalled->start);
1743 FOR_PROVIDES(op, opp, s->name)
1744 if (pool->solvables[op].name == s->name)
1745 if (op >= oldinstalled->start && op < oldinstalled->end)
1746 MAPSET(&ignoredu, op - oldinstalled->start);
1752 /* assumes we allways have du data for installed solvables */
1753 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1755 if (MAPTST(installedmap, sp))
1757 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1759 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1763 map_free(&ignoredu);
1764 solv_free(cbd.dirmap);
1769 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1774 Repo *oldinstalled = pool->installed;
1776 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1778 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1780 if (!MAPTST(installedmap, sp))
1782 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1786 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1788 if (MAPTST(installedmap, sp))
1790 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1798 * 2: conflicts with installed
1799 * 8: interesting (only true if installed)
1803 static inline Id dep2name(Pool *pool, Id dep)
1805 while (ISRELDEP(dep))
1807 Reldep *rd = rd = GETRELDEP(pool, dep);
1813 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1816 Solvable *sn = pool->solvables + n;
1818 FOR_PROVIDES(p, pp, sn->name)
1820 Solvable *s = pool->solvables + p;
1821 if (s->name != sn->name || s->arch != sn->arch)
1823 if ((map[p] & 9) != 9)
1825 if (pool_match_nevr(pool, pool->solvables + p, con))
1827 return 1; /* found installed package that doesn't conflict */
1832 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1836 FOR_PROVIDES(p, pp, dep)
1838 if (p == SYSTEMSOLVABLE)
1839 return 1; /* always boring, as never constraining */
1840 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1842 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1843 if (providedbyinstalled_multiversion(pool, map, p, dep))
1845 if ((map[p] & 9) == 9)
1853 * pool_trivial_installable - calculate if a set of solvables is
1854 * trivial installable without any other installs/deinstalls of
1855 * packages not belonging to the set.
1857 * the state is returned in the result queue:
1858 * 1: solvable is installable without any other package changes
1859 * 0: solvable is not installable
1860 * -1: solvable is installable, but doesn't constrain any installed packages
1864 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1867 Id p, *dp, con, *conp, req, *reqp;
1871 map = solv_calloc(pool->nsolvables, 1);
1872 for (p = 1; p < pool->nsolvables; p++)
1874 if (!MAPTST(installedmap, p))
1877 s = pool->solvables + p;
1880 conp = s->repo->idarraydata + s->conflicts;
1881 while ((con = *conp++) != 0)
1883 dp = pool_whatprovides_ptr(pool, con);
1885 map[p] |= 2; /* XXX: self conflict ? */
1888 for (i = 0; i < pkgs->count; i++)
1889 map[pkgs->elements[i]] = 16;
1891 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1893 if (i == pkgs->count)
1895 p = pkgs->elements[i];
1896 if ((map[p] & 16) == 0)
1898 if ((map[p] & 2) != 0)
1903 s = pool->solvables + p;
1907 reqp = s->repo->idarraydata + s->requires;
1908 while ((req = *reqp++) != 0)
1910 if (req == SOLVABLE_PREREQMARKER)
1912 r = providedbyinstalled(pool, map, req, 0, 0);
1915 /* decided and miss */
1921 break; /* undecided */
1922 m |= r; /* 1 | 9 | 17 */
1931 int ispatch = 0; /* see solver.c patch handling */
1933 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1935 conp = s->repo->idarraydata + s->conflicts;
1936 while ((con = *conp++) != 0)
1938 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1944 if ((m == 1 || m == 17) && ISRELDEP(con))
1946 con = dep2name(pool, con);
1947 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1952 continue; /* found a conflict */
1955 if (s->repo && s->repo != oldinstalled)
1957 Id p2, obs, *obsp, *pp;
1961 obsp = s->repo->idarraydata + s->obsoletes;
1962 while ((obs = *obsp++) != 0)
1964 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1973 FOR_PROVIDES(p2, pp, s->name)
1975 s2 = pool->solvables + p2;
1976 if (s2->name == s->name && (map[p2] & 1) != 0)
1993 queue_init_clone(res, pkgs);
1994 for (i = 0; i < pkgs->count; i++)
1996 m = map[pkgs->elements[i]];
2003 res->elements[i] = r;
2009 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2011 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
2015 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2017 if (entry == SOLVID_POS && pool->pos.repo)
2018 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2021 return solvable_lookup_str(pool->solvables + entry, keyname);
2025 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2027 if (entry == SOLVID_POS && pool->pos.repo)
2029 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2030 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2031 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2035 return solvable_lookup_id(pool->solvables + entry, keyname);
2039 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2041 if (entry == SOLVID_POS && pool->pos.repo)
2043 unsigned long long value;
2044 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2050 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2054 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2056 if (entry == SOLVID_POS && pool->pos.repo)
2057 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2060 return solvable_lookup_void(pool->solvables + entry, keyname);
2063 const unsigned char *
2064 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2066 if (entry == SOLVID_POS && pool->pos.repo)
2067 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2070 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2074 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2076 if (entry == SOLVID_POS && pool->pos.repo)
2078 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2079 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2083 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2087 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2092 if (entry != SOLVID_POS)
2094 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2095 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2096 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2097 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2102 add_new_provider(Pool *pool, Id id, Id p)
2107 while (ISRELDEP(id))
2109 Reldep *rd = GETRELDEP(pool, id);
2114 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2126 queue_push(&q, *pp);
2130 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2135 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2137 int hadhashes = pool->relhashtbl ? 1 : 0;
2143 if (!conflicts->count)
2145 for (i = 0; i < conflicts->count; i += 5)
2147 fn = conflicts->elements[i];
2148 p = conflicts->elements[i + 1];
2149 md5 = conflicts->elements[i + 2];
2150 q = conflicts->elements[i + 3];
2151 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2152 s = pool->solvables + p;
2155 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2156 if (pool->whatprovides)
2157 add_new_provider(pool, fn, p);
2158 if (pool->whatprovides_rel)
2159 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2160 s = pool->solvables + q;
2163 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2166 pool_freeidhashes(pool);
2170 pool_prepend_rootdir(Pool *pool, const char *path)
2175 return solv_strdup(path);
2176 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2180 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2186 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2190 pool_set_rootdir(Pool *pool, const char *rootdir)
2192 solv_free(pool->rootdir);
2193 pool->rootdir = solv_strdup(rootdir);
2197 pool_get_rootdir(Pool *pool)
2199 return pool->rootdir;