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] >= 4)
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 + 4;
323 for (id = 1; id < pool->ss.nstrings; id++)
325 o = pool->whatprovides[id];
333 pool->whatprovides[id] = pool->whatprovides[i];
338 lp = pool->whatprovidesdata + o;
341 pool->whatprovides[id] = dp - pool->whatprovidesdata;
342 while ((*dp++ = *lp++) != 0)
345 o = dp - pool->whatprovidesdata;
346 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
347 if (pool->whatprovidesdataoff == o)
349 r = pool->whatprovidesdataoff - o;
350 pool->whatprovidesdataoff = o;
351 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
352 if (r > pool->whatprovidesdataleft)
353 r = pool->whatprovidesdataleft;
354 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
359 * pool_createwhatprovides()
361 * create hashes over pool of solvables to ease provide lookups
365 pool_createwhatprovides(Pool *pool)
367 int i, num, np, extra;
372 Offset *whatprovides;
373 Id *whatprovidesdata, *d;
374 Repo *installed = pool->installed;
377 now = solv_timems(0);
378 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
379 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
380 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);
381 if (pool->ss.stringhashmask || pool->relhashmask)
382 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)));
384 pool_freeidhashes(pool); /* XXX: should not be here! */
385 pool_freewhatprovides(pool);
386 num = pool->ss.nstrings;
387 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
388 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
390 /* count providers for each name */
391 for (i = pool->nsolvables - 1; i > 0; i--)
394 s = pool->solvables + i;
395 if (!s->provides || !s->repo || s->repo->disabled)
397 /* we always need the installed solvable in the whatprovides data,
398 otherwise obsoletes/conflicts on them won't work */
399 if (s->repo != installed && !pool_installable(pool, s))
401 pp = s->repo->idarraydata + s->provides;
402 while ((id = *pp++) != 0)
406 Reldep *rd = GETRELDEP(pool, id);
409 whatprovides[id]++; /* inc count of providers */
413 off = 4; /* first entry is undef, second is empty list, third is system solvable */
414 np = 0; /* number of names provided */
415 for (i = 0, idp = whatprovides; i < num; i++, idp++)
418 if (!n) /* no providers */
420 off += n; /* make space for all providers */
421 *idp = off++; /* now idp points to terminating zero */
422 np++; /* inc # of provider 'slots' for stats */
425 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
427 /* reserve some space for relation data */
428 extra = 2 * pool->nrels;
432 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
434 /* alloc space for all providers + extra */
435 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
436 whatprovidesdata[2] = SYSTEMSOLVABLE;
438 /* now fill data for all provides */
439 for (i = pool->nsolvables - 1; i > 0; i--)
442 s = pool->solvables + i;
443 if (!s->provides || !s->repo || s->repo->disabled)
445 if (s->repo != installed && !pool_installable(pool, s))
448 /* for all provides of this solvable */
449 pp = s->repo->idarraydata + s->provides;
450 while ((id = *pp++) != 0)
454 Reldep *rd = GETRELDEP(pool, id);
457 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
458 if (*d != i) /* don't add same solvable twice */
465 pool->whatprovidesdata = whatprovidesdata;
466 pool->whatprovidesdataoff = off;
467 pool->whatprovidesdataleft = extra;
468 pool_shrink_whatprovides(pool);
469 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)));
470 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
474 * free all of our whatprovides data
475 * be careful, everything internalized with pool_queuetowhatprovides is
479 pool_freewhatprovides(Pool *pool)
481 pool->whatprovides = solv_free(pool->whatprovides);
482 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
483 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
484 pool->whatprovidesdataoff = 0;
485 pool->whatprovidesdataleft = 0;
489 /******************************************************************************/
492 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
494 * used for whatprovides, jobs, learnt rules, selections
495 * input: q: queue of Ids
496 * returns: Offset into whatprovidesdata
500 pool_queuetowhatprovides(Pool *pool, Queue *q)
503 int count = q->count;
505 if (count == 0) /* queue empty -> 1 */
507 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
510 /* extend whatprovidesdata if needed, +1 for 0-termination */
511 if (pool->whatprovidesdataleft < count + 1)
513 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
514 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
515 pool->whatprovidesdataleft = count + 4096;
518 /* copy queue to next free slot */
519 off = pool->whatprovidesdataoff;
520 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
522 /* adapt count and 0-terminate */
523 pool->whatprovidesdataoff += count;
524 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
525 pool->whatprovidesdataleft -= count + 1;
531 /*************************************************************************/
533 #if defined(MULTI_SEMANTICS)
534 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
535 #elif defined(DEBIAN)
536 # define EVRCMP_DEPCMP EVRCMP_COMPARE
538 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
541 /* check if a package's nevr matches a dependency */
544 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
546 Reldep *rd = GETRELDEP(pool, d);
549 int flags = rd->flags;
558 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
561 return pool_match_nevr(pool, s, name);
563 if (pool_match_nevr(pool, s, name))
565 return pool_match_nevr(pool, s, evr);
568 if (!pool_match_nevr(pool, s, name))
570 return pool_match_nevr(pool, s, evr);
575 if (!pool_match_nevr(pool, s, name))
578 return (flags & REL_EQ) ? 1 : 0;
583 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
588 return (flags & REL_LT) ? 1 : 0;
590 return (flags & REL_EQ) ? 1 : 0;
592 return (flags & REL_GT) ? 1 : 0;
594 return (flags & REL_EQ) ? 1 : 0;
601 /* match (flags, evr) against provider (pflags, pevr) */
603 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
605 if (!pflags || !flags || pflags >= 8 || flags >= 8)
607 if (flags == 7 || pflags == 7)
608 return 1; /* rel provides every version */
609 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
610 return 1; /* both rels show in the same direction */
612 return (flags & pflags & REL_EQ) ? 1 : 0;
613 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
616 return (pflags & REL_EQ) ? 1 : 0;
618 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
620 return (flags & pflags & REL_EQ) ? 1 : 0;
622 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
624 return (flags & REL_EQ) ? 1 : 0;
631 /* match two dependencies (d1 = provider) */
634 pool_match_dep(Pool *pool, Id d1, Id d2)
644 rd2 = GETRELDEP(pool, d2);
645 return pool_match_dep(pool, d1, rd2->name);
647 rd1 = GETRELDEP(pool, d1);
650 return pool_match_dep(pool, rd1->name, d2);
652 rd2 = GETRELDEP(pool, d2);
653 /* first match name */
654 if (!pool_match_dep(pool, rd1->name, rd2->name))
656 /* name matches, check flags and evr */
657 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
663 * add packages fulfilling the relation to whatprovides array
664 * no exact providers, do range match
669 pool_addrelproviders(Pool *pool, Id d)
671 Reldep *rd = GETRELDEP(pool, d);
677 int flags = rd->flags;
682 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
686 /* special relation */
694 wp = pool_whatprovides(pool, name);
695 pp2 = pool_whatprovides_ptr(pool, evr);
696 pp = pool->whatprovidesdata + wp;
697 while ((p = *pp++) != 0)
699 for (pp3 = pp2; *pp3; pp3++)
703 queue_push(&plist, p); /* found it */
709 wp = pool_whatprovides(pool, name);
710 pp = pool->whatprovidesdata + wp;
712 wp = pool_whatprovides(pool, evr);
716 while ((p = *pp++) != 0)
717 queue_push(&plist, p);
719 pp = pool_whatprovides_ptr(pool, evr);
720 while ((p = *pp++) != 0)
721 queue_pushunique(&plist, p);
722 if (plist.count != cnt)
727 if (name == NAMESPACE_OTHERPROVIDERS)
729 wp = pool_whatprovides(pool, evr);
732 if (pool->nscallback)
734 /* ask callback which packages provide the dependency
736 * 1: the system (aka SYSTEMSOLVABLE)
737 * >1: set of packages, stored as offset on whatprovidesdata
739 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
743 queue_push(&plist, SYSTEMSOLVABLE);
747 /* small hack: make it possible to match <pkg>.src
748 * we have to iterate over the solvables as src packages do not
749 * provide anything, thus they are not indexed in our
750 * whatprovides hash */
751 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
754 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
758 if (s->arch != evr && s->arch != ARCH_NOSRC)
760 if (pool_match_nevr(pool, s, name))
761 queue_push(&plist, p);
765 wp = pool_whatprovides(pool, name);
766 pp = pool->whatprovidesdata + wp;
767 while ((p = *pp++) != 0)
769 Solvable *s = pool->solvables + p;
771 queue_push(&plist, p);
776 case REL_FILECONFLICT:
777 pp = pool_whatprovides_ptr(pool, name);
778 while ((p = *pp++) != 0)
780 Id origd = MAKERELDEP(d);
781 Solvable *s = pool->solvables + p;
784 pidp = s->repo->idarraydata + s->provides;
785 while ((pid = *pidp++) != 0)
789 queue_push(&plist, p);
797 /* we can reuse an existing entry */
799 pool->whatprovides_rel[d] = wp;
805 /* simple version comparison relation */
807 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
809 pp = pool_whatprovides_ptr(pool, name);
810 while (ISRELDEP(name))
812 rd = GETRELDEP(pool, name);
815 while ((p = *pp++) != 0)
817 Solvable *s = pool->solvables + p;
820 /* no provides - check nevr */
821 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
822 queue_push(&plist, p);
825 /* solvable p provides name in some rels */
826 pidp = s->repo->idarraydata + s->provides;
827 while ((pid = *pidp++) != 0)
832 continue; /* wrong provides name */
833 if (pool->disttype == DISTTYPE_DEB)
834 continue; /* unversioned provides can never match versioned deps */
837 prd = GETRELDEP(pool, pid);
838 if (prd->name != name)
839 continue; /* wrong provides name */
840 /* right package, both deps are rels. check flags/evr */
841 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
845 continue; /* none of the providers matched */
846 queue_push(&plist, p);
848 /* make our system solvable provide all unknown rpmlib() stuff */
849 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
850 queue_push(&plist, SYSTEMSOLVABLE);
852 /* add providers to whatprovides */
854 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
856 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
859 return pool->whatprovides_rel[d];
862 /*************************************************************************/
865 pool_debug(Pool *pool, int type, const char *format, ...)
870 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
872 if ((pool->debugmask & type) == 0)
875 va_start(args, format);
876 if (!pool->debugcallback)
878 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
879 vprintf(format, args);
881 vfprintf(stderr, format, args);
884 vsnprintf(buf, sizeof(buf), format, args);
886 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
890 pool_error(Pool *pool, int ret, const char *format, ...)
894 va_start(args, format);
897 pool->errstra = 1024;
898 pool->errstr = solv_malloc(pool->errstra);
906 l = vsnprintf(pool->errstr, pool->errstra, format, args);
908 if (l >= 0 && l + 1 > pool->errstra)
910 pool->errstra = l + 256;
911 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
912 va_start(args, format);
913 l = vsnprintf(pool->errstr, pool->errstra, format, args);
917 strcpy(pool->errstr, "unknown error");
918 if (pool->debugmask & SOLV_ERROR)
919 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
924 pool_errstr(Pool *pool)
926 return pool->errstr ? pool->errstr : "no error";
930 pool_setdebuglevel(Pool *pool, int level)
932 int mask = SOLV_DEBUG_RESULT;
934 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
936 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
938 mask |= SOLV_DEBUG_PROPAGATE;
940 mask |= SOLV_DEBUG_RULE_CREATION;
941 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
942 pool->debugmask = mask;
945 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
947 pool->debugcallback = debugcallback;
948 pool->debugcallbackdata = debugcallbackdata;
951 void pool_setdebugmask(Pool *pool, int mask)
953 pool->debugmask = mask;
956 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
958 pool->loadcallback = cb;
959 pool->loadcallbackdata = loadcbdata;
962 /*************************************************************************/
972 #define SEARCHFILES_BLOCK 127
975 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
979 struct searchfiles *csf;
981 while ((dep = *ida++) != 0)
984 while (ISRELDEP(dep))
987 sid = pool->ss.nstrings + GETRELID(dep);
988 if (MAPTST(&csf->seen, sid))
993 MAPSET(&csf->seen, sid);
994 rd = GETRELDEP(pool, dep);
997 else if (rd->flags == REL_NAMESPACE)
999 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1002 if (!csf || MAPTST(&csf->seen, sid))
1007 MAPSET(&csf->seen, sid);
1011 else if (rd->flags == REL_FILECONFLICT)
1021 pool_addfileprovides_dep(pool, ids, csf, isf);
1027 if (MAPTST(&csf->seen, dep))
1029 MAPSET(&csf->seen, dep);
1030 s = pool_id2str(pool, dep);
1033 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1034 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1035 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1036 csf->ids[csf->nfiles] = dep;
1037 sr = strrchr(s, '/');
1038 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1039 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1041 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1042 csf->dirs[csf->nfiles][sr - s] = 0;
1047 struct addfileprovides_cbdata {
1061 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1063 struct addfileprovides_cbdata *cbd = cbdata;
1066 if (!cbd->useddirs.size)
1068 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1069 for (i = 0; i < cbd->nfiles; i++)
1072 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1077 did = repodata_str2dir(data, cbd->dirs[i], 0);
1080 MAPSET(&cbd->useddirs, did);
1082 repodata_free_dircache(data);
1084 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1086 for (i = 0; i < cbd->nfiles; i++)
1088 if (cbd->dids[i] != value->id)
1090 if (!strcmp(cbd->names[i], value->str))
1093 if (i == cbd->nfiles)
1095 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1100 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1105 Queue fileprovidesq;
1106 int i, j, repoid, repodataid;
1107 int provstart, provend;
1109 int ndone, incomplete;
1114 cbd->nfiles = sf->nfiles;
1116 cbd->dirs = sf->dirs;
1117 cbd->names = sf->names;
1118 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1119 map_init(&cbd->providedids, pool->ss.nstrings);
1122 repo = repoonly ? repoonly : pool->repos[repoid];
1123 map_init(&donemap, pool->nsolvables);
1124 queue_init(&fileprovidesq);
1125 provstart = provend = 0;
1128 if (!repo || repo->disabled)
1130 if (repoonly || ++repoid == pool->nrepos)
1132 repo = pool->repos[repoid];
1136 FOR_REPODATAS(repo, repodataid, data)
1138 if (ndone >= repo->nsolvables)
1141 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1143 map_empty(&cbd->providedids);
1144 for (i = 0; i < fileprovidesq.count; i++)
1145 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1146 provstart = data->start;
1147 provend = data->end;
1148 for (i = 0; i < cbd->nfiles; i++)
1149 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1151 if (i == cbd->nfiles)
1153 /* great! no need to search files */
1154 for (p = data->start; p < data->end; p++)
1155 if (pool->solvables[p].repo == repo)
1157 if (MAPTST(&donemap, p))
1159 MAPSET(&donemap, p);
1166 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1169 if (data->start < provstart || data->end > provend)
1171 map_empty(&cbd->providedids);
1172 provstart = provend = 0;
1175 /* check if the data is incomplete */
1177 if (data->state == REPODATA_AVAILABLE)
1179 for (j = 1; j < data->nkeys; j++)
1180 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1182 if (j < data->nkeys)
1185 for (i = 0; i < cbd->nfiles; i++)
1186 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1187 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1189 for (i = 0; i < cbd->nfiles; i++)
1190 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1192 if (i < cbd->nfiles)
1198 map_init(&cbd->useddirs, 0);
1199 for (p = data->start; p < data->end; p++)
1200 if (pool->solvables[p].repo == repo)
1202 if (MAPTST(&donemap, p))
1204 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1207 MAPSET(&donemap, p);
1211 map_free(&cbd->useddirs);
1214 if (repoonly || ++repoid == pool->nrepos)
1216 repo = pool->repos[repoid];
1219 queue_free(&fileprovidesq);
1220 map_free(&cbd->providedids);
1224 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1227 Repo *installed, *repo;
1228 struct searchfiles sf, isf, *isfp;
1229 struct addfileprovides_cbdata cbd;
1233 installed = pool->installed;
1234 now = solv_timems(0);
1235 memset(&sf, 0, sizeof(sf));
1236 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1237 memset(&isf, 0, sizeof(isf));
1238 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1243 queue_empty(idqinst);
1244 isfp = installed ? &isf : 0;
1245 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1251 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1253 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1255 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1257 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1259 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1261 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1263 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1266 map_free(&isf.seen);
1267 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1272 for (i = 0; i < sf.nfiles; i++)
1273 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1275 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1277 for (i = 0; i < sf.nfiles; i++)
1278 queue_push(idq, sf.ids[i]);
1280 for (i = 0; i < sf.nfiles; i++)
1281 queue_push(idqinst, sf.ids[i]);
1283 for (i = 0; i < sf.nfiles; i++)
1285 solv_free(sf.dirs[i]);
1286 solv_free(sf.names[i]);
1289 solv_free(sf.names);
1294 for (i = 0; i < isf.nfiles; i++)
1295 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1298 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1299 if (installed && idqinst)
1300 for (i = 0; i < isf.nfiles; i++)
1301 queue_pushunique(idqinst, isf.ids[i]);
1303 for (i = 0; i < isf.nfiles; i++)
1305 solv_free(isf.dirs[i]);
1306 solv_free(isf.names[i]);
1308 solv_free(isf.dirs);
1309 solv_free(isf.names);
1311 solv_free(cbd.dids);
1312 pool_freewhatprovides(pool); /* as we have added provides */
1313 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1317 pool_addfileprovides(Pool *pool)
1319 pool_addfileprovides_queue(pool, 0, 0);
1323 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)
1327 if (pool->solvables[p].repo)
1328 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1331 /* FIXME: obey callback return value! */
1332 for (p = 1; p < pool->nsolvables; p++)
1333 if (pool->solvables[p].repo)
1334 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1338 pool_clear_pos(Pool *pool)
1340 memset(&pool->pos, 0, sizeof(pool->pos));
1345 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1349 pool->languagecache = solv_free(pool->languagecache);
1350 pool->languagecacheother = 0;
1351 if (pool->nlanguages)
1353 for (i = 0; i < pool->nlanguages; i++)
1354 free((char *)pool->languages[i]);
1355 free(pool->languages);
1357 pool->nlanguages = nlanguages;
1360 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1361 for (i = 0; i < pool->nlanguages; i++)
1362 pool->languages[i] = solv_strdup(languages[i]);
1366 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1372 if (!lang || !*lang)
1374 n = pool_id2str(pool, id);
1375 l = strlen(n) + strlen(lang) + 2;
1376 if (l > sizeof(buf))
1377 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1380 sprintf(p, "%s:%s", n, lang);
1381 id = pool_str2id(pool, p, create);
1388 pool_alloctmpspace(Pool *pool, int len)
1390 int n = pool->tmpspace.n;
1393 if (len > pool->tmpspace.len[n])
1395 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1396 pool->tmpspace.len[n] = len + 32;
1398 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1399 return pool->tmpspace.buf[n];
1403 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1408 n = oldn = pool->tmpspace.n;
1412 n = POOL_TMPSPACEBUF - 1;
1415 if (pool->tmpspace.buf[n] != space)
1417 if (len > pool->tmpspace.len[n])
1419 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1420 pool->tmpspace.len[n] = len + 32;
1422 return pool->tmpspace.buf[n];
1429 pool_freetmpspace(Pool *pool, const char *space)
1431 int n = pool->tmpspace.n;
1434 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1435 if (pool->tmpspace.buf[n] == space)
1436 pool->tmpspace.n = n;
1440 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1444 l1 = str1 ? strlen(str1) : 0;
1445 l2 = str2 ? strlen(str2) : 0;
1446 l3 = str3 ? strlen(str3) : 0;
1447 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1468 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1473 l1 = str1 ? strlen(str1) : 0;
1474 l2 = str2 ? strlen(str2) : 0;
1475 l3 = str3 ? strlen(str3) : 0;
1476 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1480 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1503 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1508 s = pool_alloctmpspace(pool, 2 * len + 1);
1509 solv_bin2hex(buf, len, s);
1513 /*******************************************************************/
1525 struct mptree *mptree;
1536 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1538 struct ducbdata *cbd = cbdata;
1541 if (data != cbd->olddata)
1543 Id dn, mp, comp, *dirmap, *dirs;
1545 const char *compstr;
1546 struct mptree *mptree;
1548 /* create map from dir to mptree */
1549 cbd->dirmap = solv_free(cbd->dirmap);
1551 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1552 mptree = cbd->mptree;
1554 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1568 if (!mptree[mp].child)
1573 if (data->localpool)
1574 compstr = stringpool_id2str(&data->spool, comp);
1576 compstr = pool_id2str(data->repo->pool, comp);
1577 compl = strlen(compstr);
1578 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1579 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1581 dirmap[dn] = i ? i : -mp;
1583 /* change dirmap to point to mountpoint instead of mptree */
1584 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1587 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1589 cbd->dirmap = dirmap;
1590 cbd->nmap = data->dirpool.ndirs;
1591 cbd->olddata = data;
1594 if (value->id < 0 || value->id >= cbd->nmap)
1596 mp = cbd->dirmap[value->id];
1599 if (cbd->addsub > 0)
1601 cbd->mps[mp].kbytes += value->num;
1602 cbd->mps[mp].files += value->num2;
1606 cbd->mps[mp].kbytes -= value->num;
1607 cbd->mps[mp].files -= value->num2;
1613 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1616 if (mptree[pos].mountpoint == -1)
1617 mptree[pos].mountpoint = mountpoint;
1619 mountpoint = mptree[pos].mountpoint;
1620 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1621 propagate_mountpoints(mptree, i, mountpoint);
1624 #define MPTREE_BLOCK 15
1627 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1630 const char *path, *compstr;
1631 struct mptree *mptree;
1635 struct ducbdata cbd;
1639 Repo *oldinstalled = pool->installed;
1641 memset(&ignoredu, 0, sizeof(ignoredu));
1648 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1651 mptree[0].sibling = 0;
1652 mptree[0].child = 0;
1654 mptree[0].compl = 0;
1655 mptree[0].mountpoint = -1;
1658 /* create component tree */
1659 for (mp = 0; mp < nmps; mp++)
1664 path = mps[mp].path;
1669 if ((p = strchr(path, '/')) == 0)
1672 compl = strlen(compstr);
1683 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1684 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1688 /* create new node */
1689 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1691 mptree[i].sibling = mptree[pos].child;
1692 mptree[i].child = 0;
1693 mptree[i].comp = compstr;
1694 mptree[i].compl = compl;
1695 mptree[i].mountpoint = -1;
1696 mptree[pos].child = i;
1700 mptree[pos].mountpoint = mp;
1703 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1706 for (i = 0; i < nmptree; i++)
1708 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1709 printf("#%d child: %d\n", i, mptree[i].child);
1710 printf("#%d comp: %s\n", i, mptree[i].comp);
1711 printf("#%d compl: %d\n", i, mptree[i].compl);
1712 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1716 cbd.mptree = mptree;
1718 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1720 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1722 if (!MAPTST(installedmap, sp))
1725 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1726 if (!cbd.hasdu && oldinstalled)
1729 /* no du data available, ignore data of all installed solvables we obsolete */
1731 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1734 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1735 while ((obs = *obsp++) != 0)
1736 FOR_PROVIDES(op, opp, obs)
1737 if (op >= oldinstalled->start && op < oldinstalled->end)
1738 MAPSET(&ignoredu, op - oldinstalled->start);
1740 FOR_PROVIDES(op, opp, s->name)
1741 if (pool->solvables[op].name == s->name)
1742 if (op >= oldinstalled->start && op < oldinstalled->end)
1743 MAPSET(&ignoredu, op - oldinstalled->start);
1749 /* assumes we allways have du data for installed solvables */
1750 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1752 if (MAPTST(installedmap, sp))
1754 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1756 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1760 map_free(&ignoredu);
1761 solv_free(cbd.dirmap);
1766 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1771 Repo *oldinstalled = pool->installed;
1773 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1775 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1777 if (!MAPTST(installedmap, sp))
1779 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1783 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1785 if (MAPTST(installedmap, sp))
1787 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1795 * 2: conflicts with installed
1796 * 8: interesting (only true if installed)
1800 static inline Id dep2name(Pool *pool, Id dep)
1802 while (ISRELDEP(dep))
1804 Reldep *rd = rd = GETRELDEP(pool, dep);
1810 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1813 Solvable *sn = pool->solvables + n;
1815 FOR_PROVIDES(p, pp, sn->name)
1817 Solvable *s = pool->solvables + p;
1818 if (s->name != sn->name || s->arch != sn->arch)
1820 if ((map[p] & 9) != 9)
1822 if (pool_match_nevr(pool, pool->solvables + p, con))
1824 return 1; /* found installed package that doesn't conflict */
1829 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1833 FOR_PROVIDES(p, pp, dep)
1835 if (p == SYSTEMSOLVABLE)
1836 return 1; /* always boring, as never constraining */
1837 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1839 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1840 if (providedbyinstalled_multiversion(pool, map, p, dep))
1842 if ((map[p] & 9) == 9)
1850 * pool_trivial_installable - calculate if a set of solvables is
1851 * trivial installable without any other installs/deinstalls of
1852 * packages not belonging to the set.
1854 * the state is returned in the result queue:
1855 * 1: solvable is installable without any other package changes
1856 * 0: solvable is not installable
1857 * -1: solvable is installable, but doesn't constrain any installed packages
1861 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1864 Id p, *dp, con, *conp, req, *reqp;
1868 map = solv_calloc(pool->nsolvables, 1);
1869 for (p = 1; p < pool->nsolvables; p++)
1871 if (!MAPTST(installedmap, p))
1874 s = pool->solvables + p;
1877 conp = s->repo->idarraydata + s->conflicts;
1878 while ((con = *conp++) != 0)
1880 dp = pool_whatprovides_ptr(pool, con);
1882 map[p] |= 2; /* XXX: self conflict ? */
1885 for (i = 0; i < pkgs->count; i++)
1886 map[pkgs->elements[i]] = 16;
1888 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1890 if (i == pkgs->count)
1892 p = pkgs->elements[i];
1893 if ((map[p] & 16) == 0)
1895 if ((map[p] & 2) != 0)
1900 s = pool->solvables + p;
1904 reqp = s->repo->idarraydata + s->requires;
1905 while ((req = *reqp++) != 0)
1907 if (req == SOLVABLE_PREREQMARKER)
1909 r = providedbyinstalled(pool, map, req, 0, 0);
1912 /* decided and miss */
1916 m |= r; /* 1 | 9 | 16 | 17 */
1925 int ispatch = 0; /* see solver.c patch handling */
1927 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1929 conp = s->repo->idarraydata + s->conflicts;
1930 while ((con = *conp++) != 0)
1932 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1937 if ((m == 1 || m == 17) && ISRELDEP(con))
1939 con = dep2name(pool, con);
1940 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1945 continue; /* found a conflict */
1948 if (s->repo && s->repo != oldinstalled)
1950 Id p2, obs, *obsp, *pp;
1954 obsp = s->repo->idarraydata + s->obsoletes;
1955 while ((obs = *obsp++) != 0)
1957 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1966 FOR_PROVIDES(p2, pp, s->name)
1968 s2 = pool->solvables + p2;
1969 if (s2->name == s->name && (map[p2] & 1) != 0)
1986 queue_init_clone(res, pkgs);
1987 for (i = 0; i < pkgs->count; i++)
1989 m = map[pkgs->elements[i]];
1996 res->elements[i] = r;
2002 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2004 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
2008 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2010 if (entry == SOLVID_POS && pool->pos.repo)
2011 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2014 return solvable_lookup_str(pool->solvables + entry, keyname);
2018 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2020 if (entry == SOLVID_POS && pool->pos.repo)
2022 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2023 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2024 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2028 return solvable_lookup_id(pool->solvables + entry, keyname);
2032 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2034 if (entry == SOLVID_POS && pool->pos.repo)
2036 unsigned long long value;
2037 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2043 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2047 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2049 if (entry == SOLVID_POS && pool->pos.repo)
2050 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2053 return solvable_lookup_void(pool->solvables + entry, keyname);
2056 const unsigned char *
2057 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2059 if (entry == SOLVID_POS && pool->pos.repo)
2060 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2063 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2067 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2069 if (entry == SOLVID_POS && pool->pos.repo)
2071 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2072 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2076 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2080 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2085 if (entry != SOLVID_POS)
2087 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2088 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2089 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2090 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2095 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2097 int hadhashes = pool->relhashtbl ? 1 : 0;
2103 if (!conflicts->count)
2105 pool_freewhatprovides(pool);
2106 for (i = 0; i < conflicts->count; i += 5)
2108 fn = conflicts->elements[i];
2109 p = conflicts->elements[i + 1];
2110 md5 = conflicts->elements[i + 2];
2111 q = conflicts->elements[i + 3];
2112 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2113 s = pool->solvables + p;
2116 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2117 s = pool->solvables + q;
2120 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2123 pool_freeidhashes(pool);
2127 pool_prepend_rootdir(Pool *pool, const char *path)
2132 return solv_strdup(path);
2133 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2137 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2143 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2147 pool_set_rootdir(Pool *pool, const char *rootdir)
2149 solv_free(pool->rootdir);
2150 pool->rootdir = solv_strdup(rootdir);
2154 pool_get_rootdir(Pool *pool)
2156 return pool->rootdir;