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);
117 pool_freeallrepos(Pool *pool, int reuseids)
121 pool_freewhatprovides(pool);
122 for (i = 1; i < pool->nrepos; i++)
124 repo_freedata(pool->repos[i]);
125 pool->repos = solv_free(pool->repos);
128 /* the first two solvables don't belong to a repo */
129 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
132 #ifdef MULTI_SEMANTICS
134 pool_setdisttype(Pool *pool, int disttype)
136 pool->disttype = disttype;
137 if (disttype == DISTTYPE_RPM)
138 pool->noarchid = ARCH_NOARCH;
139 if (disttype == DISTTYPE_DEB)
140 pool->noarchid = ARCH_ALL;
141 if (disttype == DISTTYPE_ARCH)
142 pool->noarchid = ARCH_ANY;
143 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
148 pool_get_flag(Pool *pool, int flag)
152 case POOL_FLAG_PROMOTEEPOCH:
153 return pool->promoteepoch;
154 case POOL_FLAG_FORBIDSELFCONFLICTS:
155 return pool->forbidselfconflicts;
156 case POOL_FLAG_OBSOLETEUSESPROVIDES:
157 return pool->obsoleteusesprovides;
158 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
159 return pool->implicitobsoleteusesprovides;
160 case POOL_FLAG_OBSOLETEUSESCOLORS:
161 return pool->obsoleteusescolors;
162 case POOL_FLAG_NOINSTALLEDOBSOLETES:
163 return pool->noinstalledobsoletes;
164 case POOL_FLAG_HAVEDISTEPOCH:
165 return pool->havedistepoch;
173 pool_set_flag(Pool *pool, int flag, int value)
175 int old = pool_get_flag(pool, flag);
178 case POOL_FLAG_PROMOTEEPOCH:
179 pool->promoteepoch = value;
181 case POOL_FLAG_FORBIDSELFCONFLICTS:
182 pool->forbidselfconflicts = value;
184 case POOL_FLAG_OBSOLETEUSESPROVIDES:
185 pool->obsoleteusesprovides = value;
187 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
188 pool->implicitobsoleteusesprovides = value;
190 case POOL_FLAG_OBSOLETEUSESCOLORS:
191 pool->obsoleteusescolors = value;
193 case POOL_FLAG_NOINSTALLEDOBSOLETES:
194 pool->noinstalledobsoletes = value;
196 case POOL_FLAG_HAVEDISTEPOCH:
197 pool->havedistepoch = value;
207 pool_add_solvable(Pool *pool)
209 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
210 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
211 return pool->nsolvables++;
215 pool_add_solvable_block(Pool *pool, int count)
217 Id nsolvables = pool->nsolvables;
220 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
221 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
222 pool->nsolvables += count;
227 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
231 if (reuseids && start + count == pool->nsolvables)
233 /* might want to shrink solvable array */
234 pool->nsolvables = start;
237 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
242 pool_set_installed(Pool *pool, Repo *installed)
244 if (pool->installed == installed)
246 pool->installed = installed;
247 pool_freewhatprovides(pool);
251 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
256 oa = pool->whatprovides[*(Id *)ap];
257 ob = pool->whatprovides[*(Id *)bp];
259 return *(Id *)ap - *(Id *)bp;
260 da = pool->whatprovidesdata + oa;
261 db = pool->whatprovidesdata + ob;
263 if ((r = (*da++ - *db++)) != 0)
267 return *(Id *)ap - *(Id *)bp;
271 * pool_shrink_whatprovides - unify whatprovides data
273 * whatprovides_rel must be empty for this to work!
277 pool_shrink_whatprovides(Pool *pool)
281 Id lastid, *last, *dp, *lp;
285 if (pool->ss.nstrings < 3)
287 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
288 for (i = id = 0; id < pool->ss.nstrings; id++)
289 if (pool->whatprovides[id] && pool->whatprovides[id] != 1)
292 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
295 for (i = 0; i < n; i++)
298 o = pool->whatprovides[id];
299 dp = pool->whatprovidesdata + o;
313 pool->whatprovides[id] = -lastid;
317 last = pool->whatprovidesdata + o;
321 dp = pool->whatprovidesdata + 2;
322 for (id = 1; id < pool->ss.nstrings; id++)
324 o = pool->whatprovides[id];
325 if (o == 0 || o == 1)
332 pool->whatprovides[id] = pool->whatprovides[i];
335 lp = pool->whatprovidesdata + o;
338 pool->whatprovides[id] = dp - pool->whatprovidesdata;
339 while ((*dp++ = *lp++) != 0)
342 o = dp - pool->whatprovidesdata;
343 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
344 if (pool->whatprovidesdataoff == o)
346 r = pool->whatprovidesdataoff - o;
347 pool->whatprovidesdataoff = o;
348 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
349 if (r > pool->whatprovidesdataleft)
350 r = pool->whatprovidesdataleft;
351 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
356 * pool_createwhatprovides()
358 * create hashes over pool of solvables to ease provide lookups
362 pool_createwhatprovides(Pool *pool)
364 int i, num, np, extra;
369 Offset *whatprovides;
370 Id *whatprovidesdata, *d;
371 Repo *installed = pool->installed;
374 now = solv_timems(0);
375 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
376 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
377 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);
378 if (pool->ss.stringhashmask || pool->relhashmask)
379 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)));
381 pool_freeidhashes(pool); /* XXX: should not be here! */
382 pool_freewhatprovides(pool);
383 num = pool->ss.nstrings;
384 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
385 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
387 /* count providers for each name */
388 for (i = pool->nsolvables - 1; i > 0; i--)
391 s = pool->solvables + i;
392 if (!s->provides || !s->repo || s->repo->disabled)
394 /* we always need the installed solvable in the whatprovides data,
395 otherwise obsoletes/conflicts on them won't work */
396 if (s->repo != installed && !pool_installable(pool, s))
398 pp = s->repo->idarraydata + s->provides;
399 while ((id = *pp++) != 0)
403 Reldep *rd = GETRELDEP(pool, id);
406 whatprovides[id]++; /* inc count of providers */
410 off = 2; /* first entry is undef, second is empty list */
411 np = 0; /* number of names provided */
412 for (i = 0, idp = whatprovides; i < num; i++, idp++)
415 if (!n) /* no providers */
417 off += n; /* make space for all providers */
418 *idp = off++; /* now idp points to terminating zero */
419 np++; /* inc # of provider 'slots' for stats */
422 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
424 /* reserve some space for relation data */
425 extra = 2 * pool->nrels;
429 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
431 /* alloc space for all providers + extra */
432 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
434 /* now fill data for all provides */
435 for (i = pool->nsolvables - 1; i > 0; i--)
438 s = pool->solvables + i;
439 if (!s->provides || !s->repo || s->repo->disabled)
441 if (s->repo != installed && !pool_installable(pool, s))
444 /* for all provides of this solvable */
445 pp = s->repo->idarraydata + s->provides;
446 while ((id = *pp++) != 0)
450 Reldep *rd = GETRELDEP(pool, id);
453 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
454 if (*d != i) /* don't add same solvable twice */
461 pool->whatprovidesdata = whatprovidesdata;
462 pool->whatprovidesdataoff = off;
463 pool->whatprovidesdataleft = extra;
464 pool_shrink_whatprovides(pool);
465 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)));
466 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
470 * free all of our whatprovides data
471 * be careful, everything internalized with pool_queuetowhatprovides is
475 pool_freewhatprovides(Pool *pool)
477 pool->whatprovides = solv_free(pool->whatprovides);
478 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
479 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
480 pool->whatprovidesdataoff = 0;
481 pool->whatprovidesdataleft = 0;
485 /******************************************************************************/
488 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
490 * on-demand filling of provider information
491 * move queue data into whatprovidesdata
493 * returns: Offset into whatprovides
497 pool_queuetowhatprovides(Pool *pool, Queue *q)
500 int count = q->count;
502 if (count == 0) /* queue empty -> 1 */
505 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
506 if (pool->whatprovidesdataleft < count + 1)
508 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
509 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
510 pool->whatprovidesdataleft = count + 4096;
513 /* copy queue to next free slot */
514 off = pool->whatprovidesdataoff;
515 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
517 /* adapt count and ID_NULL-terminate */
518 pool->whatprovidesdataoff += count;
519 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
520 pool->whatprovidesdataleft -= count + 1;
526 /*************************************************************************/
528 #if defined(MULTI_SEMANTICS)
529 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
530 #elif defined(DEBIAN)
531 # define EVRCMP_DEPCMP EVRCMP_COMPARE
533 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
536 /* check if a package's nevr matches a dependency */
539 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
541 Reldep *rd = GETRELDEP(pool, d);
544 int flags = rd->flags;
553 return pool_match_nevr(pool, s, name);
555 if (pool_match_nevr(pool, s, name))
557 return pool_match_nevr(pool, s, evr);
560 if (!pool_match_nevr(pool, s, name))
562 return pool_match_nevr(pool, s, evr);
567 if (!pool_match_nevr(pool, s, name))
570 return (flags & REL_EQ) ? 1 : 0;
575 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
580 return (flags & REL_LT) ? 1 : 0;
582 return (flags & REL_EQ) ? 1 : 0;
584 return (flags & REL_GT) ? 1 : 0;
586 return (flags & REL_EQ) ? 1 : 0;
593 /* match (flags, evr) against provider (pflags, pevr) */
595 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
597 if (!pflags || !flags || pflags >= 8 || flags >= 8)
599 if (flags == 7 || pflags == 7)
600 return 1; /* rel provides every version */
601 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
602 return 1; /* both rels show in the same direction */
604 return (flags & pflags & REL_EQ) ? 1 : 0;
605 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
608 return (pflags & REL_EQ) ? 1 : 0;
610 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
612 return (flags & pflags & REL_EQ) ? 1 : 0;
614 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
616 return (flags & REL_EQ) ? 1 : 0;
623 /* match two dependencies (d1 = provider) */
626 pool_match_dep(Pool *pool, Id d1, Id d2)
636 rd2 = GETRELDEP(pool, d2);
637 return pool_match_dep(pool, d1, rd2->name);
639 rd1 = GETRELDEP(pool, d1);
642 return pool_match_dep(pool, rd1->name, d2);
644 rd2 = GETRELDEP(pool, d2);
645 /* first match name */
646 if (!pool_match_dep(pool, rd1->name, rd2->name))
648 /* name matches, check flags and evr */
649 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
655 * add packages fulfilling the relation to whatprovides array
656 * no exact providers, do range match
661 pool_addrelproviders(Pool *pool, Id d)
663 Reldep *rd = GETRELDEP(pool, d);
669 int flags = rd->flags;
674 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
678 /* special relation */
686 wp = pool_whatprovides(pool, name);
687 pp2 = pool_whatprovides_ptr(pool, evr);
688 pp = pool->whatprovidesdata + wp;
689 while ((p = *pp++) != 0)
691 for (pp3 = pp2; *pp3; pp3++)
695 queue_push(&plist, p); /* found it */
701 wp = pool_whatprovides(pool, name);
702 pp = pool->whatprovidesdata + wp;
704 wp = pool_whatprovides(pool, evr);
708 while ((p = *pp++) != 0)
709 queue_push(&plist, p);
711 pp = pool_whatprovides_ptr(pool, evr);
712 while ((p = *pp++) != 0)
713 queue_pushunique(&plist, p);
714 if (plist.count != cnt)
719 if (name == NAMESPACE_OTHERPROVIDERS)
721 wp = pool_whatprovides(pool, evr);
724 if (pool->nscallback)
726 /* ask callback which packages provide the dependency
728 * 1: the system (aka SYSTEMSOLVABLE)
729 * >1: set of packages, stored as offset on whatprovidesdata
731 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
735 queue_push(&plist, SYSTEMSOLVABLE);
739 /* small hack: make it possible to match <pkg>.src
740 * we have to iterate over the solvables as src packages do not
741 * provide anything, thus they are not indexed in our
742 * whatprovides hash */
746 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
748 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
750 if (pool_match_nevr(pool, s, name))
751 queue_push(&plist, p);
755 wp = pool_whatprovides(pool, name);
756 pp = pool->whatprovidesdata + wp;
757 while ((p = *pp++) != 0)
759 Solvable *s = pool->solvables + p;
761 queue_push(&plist, p);
766 case REL_FILECONFLICT:
767 pp = pool_whatprovides_ptr(pool, name);
768 while ((p = *pp++) != 0)
770 Id origd = MAKERELDEP(d);
771 Solvable *s = pool->solvables + p;
774 pidp = s->repo->idarraydata + s->provides;
775 while ((pid = *pidp++) != 0)
779 queue_push(&plist, p);
787 /* we can reuse an existing entry */
789 pool->whatprovides_rel[d] = wp;
795 /* simple version comparison relation */
797 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
799 pp = pool_whatprovides_ptr(pool, name);
800 while (ISRELDEP(name))
802 rd = GETRELDEP(pool, name);
805 while ((p = *pp++) != 0)
807 Solvable *s = pool->solvables + p;
810 /* no provides - check nevr */
811 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
812 queue_push(&plist, p);
815 /* solvable p provides name in some rels */
816 pidp = s->repo->idarraydata + s->provides;
817 while ((pid = *pidp++) != 0)
822 continue; /* wrong provides name */
823 if (pool->disttype == DISTTYPE_DEB)
824 continue; /* unversioned provides can never match versioned deps */
827 prd = GETRELDEP(pool, pid);
828 if (prd->name != name)
829 continue; /* wrong provides name */
830 /* right package, both deps are rels. check flags/evr */
831 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
835 continue; /* none of the providers matched */
836 queue_push(&plist, p);
838 /* make our system solvable provide all unknown rpmlib() stuff */
839 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
840 queue_push(&plist, SYSTEMSOLVABLE);
842 /* add providers to whatprovides */
844 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
846 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
849 return pool->whatprovides_rel[d];
852 /*************************************************************************/
855 pool_debug(Pool *pool, int type, const char *format, ...)
860 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
862 if ((pool->debugmask & type) == 0)
865 va_start(args, format);
866 if (!pool->debugcallback)
868 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
869 vprintf(format, args);
871 vfprintf(stderr, format, args);
874 vsnprintf(buf, sizeof(buf), format, args);
876 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
880 pool_error(Pool *pool, int ret, const char *format, ...)
884 va_start(args, format);
887 pool->errstra = 1024;
888 pool->errstr = solv_malloc(pool->errstra);
896 l = vsnprintf(pool->errstr, pool->errstra, format, args);
898 if (l >= 0 && l + 1 > pool->errstra)
900 pool->errstra = l + 256;
901 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
902 va_start(args, format);
903 l = vsnprintf(pool->errstr, pool->errstra, format, args);
907 strcpy(pool->errstr, "unknown error");
908 if (pool->debugmask & SOLV_ERROR)
909 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
914 pool_errstr(Pool *pool)
916 return pool->errstr ? pool->errstr : "no error";
920 pool_setdebuglevel(Pool *pool, int level)
922 int mask = SOLV_DEBUG_RESULT;
924 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
926 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
928 mask |= SOLV_DEBUG_PROPAGATE;
930 mask |= SOLV_DEBUG_RULE_CREATION;
931 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
932 pool->debugmask = mask;
935 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
937 pool->debugcallback = debugcallback;
938 pool->debugcallbackdata = debugcallbackdata;
941 void pool_setdebugmask(Pool *pool, int mask)
943 pool->debugmask = mask;
946 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
948 pool->loadcallback = cb;
949 pool->loadcallbackdata = loadcbdata;
952 /*************************************************************************/
962 #define SEARCHFILES_BLOCK 127
965 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
969 struct searchfiles *csf;
971 while ((dep = *ida++) != 0)
974 while (ISRELDEP(dep))
977 sid = pool->ss.nstrings + GETRELID(dep);
978 if (MAPTST(&csf->seen, sid))
983 MAPSET(&csf->seen, sid);
984 rd = GETRELDEP(pool, dep);
987 else if (rd->flags == REL_NAMESPACE)
989 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
992 if (!csf || MAPTST(&csf->seen, sid))
997 MAPSET(&csf->seen, sid);
1001 else if (rd->flags == REL_FILECONFLICT)
1011 pool_addfileprovides_dep(pool, ids, csf, isf);
1017 if (MAPTST(&csf->seen, dep))
1019 MAPSET(&csf->seen, dep);
1020 s = pool_id2str(pool, dep);
1023 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1024 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1025 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1026 csf->ids[csf->nfiles] = dep;
1027 sr = strrchr(s, '/');
1028 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1029 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1031 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1032 csf->dirs[csf->nfiles][sr - s] = 0;
1037 struct addfileprovides_cbdata {
1051 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1053 struct addfileprovides_cbdata *cbd = cbdata;
1056 if (!cbd->useddirs.size)
1058 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1059 for (i = 0; i < cbd->nfiles; i++)
1062 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1067 did = repodata_str2dir(data, cbd->dirs[i], 0);
1070 MAPSET(&cbd->useddirs, did);
1072 repodata_free_dircache(data);
1074 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1076 for (i = 0; i < cbd->nfiles; i++)
1078 if (cbd->dids[i] != value->id)
1080 if (!strcmp(cbd->names[i], value->str))
1083 if (i == cbd->nfiles)
1085 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1090 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1095 Queue fileprovidesq;
1096 int i, j, repoid, repodataid;
1097 int provstart, provend;
1099 int ndone, incomplete;
1104 cbd->nfiles = sf->nfiles;
1106 cbd->dirs = sf->dirs;
1107 cbd->names = sf->names;
1108 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1109 map_init(&cbd->providedids, pool->ss.nstrings);
1112 repo = repoonly ? repoonly : pool->repos[repoid];
1113 map_init(&donemap, pool->nsolvables);
1114 queue_init(&fileprovidesq);
1115 provstart = provend = 0;
1118 if (!repo || repo->disabled)
1120 if (repoonly || ++repoid == pool->nrepos)
1122 repo = pool->repos[repoid];
1126 FOR_REPODATAS(repo, repodataid, data)
1128 if (ndone >= repo->nsolvables)
1131 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1133 map_empty(&cbd->providedids);
1134 for (i = 0; i < fileprovidesq.count; i++)
1135 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1136 provstart = data->start;
1137 provend = data->end;
1138 for (i = 0; i < cbd->nfiles; i++)
1139 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1141 if (i == cbd->nfiles)
1143 /* great! no need to search files */
1144 for (p = data->start; p < data->end; p++)
1145 if (pool->solvables[p].repo == repo)
1147 if (MAPTST(&donemap, p))
1149 MAPSET(&donemap, p);
1156 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1159 if (data->start < provstart || data->end > provend)
1161 map_empty(&cbd->providedids);
1162 provstart = provend = 0;
1165 /* check if the data is incomplete */
1167 if (data->state == REPODATA_AVAILABLE)
1169 for (j = 1; j < data->nkeys; j++)
1170 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1172 if (j < data->nkeys)
1175 for (i = 0; i < cbd->nfiles; i++)
1176 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1177 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1179 for (i = 0; i < cbd->nfiles; i++)
1180 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1182 if (i < cbd->nfiles)
1188 map_init(&cbd->useddirs, 0);
1189 for (p = data->start; p < data->end; p++)
1190 if (pool->solvables[p].repo == repo)
1192 if (MAPTST(&donemap, p))
1194 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1197 MAPSET(&donemap, p);
1201 map_free(&cbd->useddirs);
1204 if (repoonly || ++repoid == pool->nrepos)
1206 repo = pool->repos[repoid];
1209 queue_free(&fileprovidesq);
1210 map_free(&cbd->providedids);
1214 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1217 Repo *installed, *repo;
1218 struct searchfiles sf, isf, *isfp;
1219 struct addfileprovides_cbdata cbd;
1223 installed = pool->installed;
1224 now = solv_timems(0);
1225 memset(&sf, 0, sizeof(sf));
1226 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1227 memset(&isf, 0, sizeof(isf));
1228 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1233 queue_empty(idqinst);
1234 isfp = installed ? &isf : 0;
1235 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1241 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1243 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1245 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1247 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1249 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1251 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1253 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1256 map_free(&isf.seen);
1257 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1262 for (i = 0; i < sf.nfiles; i++)
1263 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1265 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1267 for (i = 0; i < sf.nfiles; i++)
1268 queue_push(idq, sf.ids[i]);
1270 for (i = 0; i < sf.nfiles; i++)
1271 queue_push(idqinst, sf.ids[i]);
1273 for (i = 0; i < sf.nfiles; i++)
1275 solv_free(sf.dirs[i]);
1276 solv_free(sf.names[i]);
1279 solv_free(sf.names);
1284 for (i = 0; i < isf.nfiles; i++)
1285 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1288 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1289 if (installed && idqinst)
1290 for (i = 0; i < isf.nfiles; i++)
1291 queue_pushunique(idqinst, isf.ids[i]);
1293 for (i = 0; i < isf.nfiles; i++)
1295 solv_free(isf.dirs[i]);
1296 solv_free(isf.names[i]);
1298 solv_free(isf.dirs);
1299 solv_free(isf.names);
1301 solv_free(cbd.dids);
1302 pool_freewhatprovides(pool); /* as we have added provides */
1303 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1307 pool_addfileprovides(Pool *pool)
1309 pool_addfileprovides_queue(pool, 0, 0);
1313 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)
1317 if (pool->solvables[p].repo)
1318 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1321 /* FIXME: obey callback return value! */
1322 for (p = 1; p < pool->nsolvables; p++)
1323 if (pool->solvables[p].repo)
1324 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1328 pool_clear_pos(Pool *pool)
1330 memset(&pool->pos, 0, sizeof(pool->pos));
1335 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1339 pool->languagecache = solv_free(pool->languagecache);
1340 pool->languagecacheother = 0;
1341 if (pool->nlanguages)
1343 for (i = 0; i < pool->nlanguages; i++)
1344 free((char *)pool->languages[i]);
1345 free(pool->languages);
1347 pool->nlanguages = nlanguages;
1350 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1351 for (i = 0; i < pool->nlanguages; i++)
1352 pool->languages[i] = solv_strdup(languages[i]);
1356 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1362 if (!lang || !*lang)
1364 n = pool_id2str(pool, id);
1365 l = strlen(n) + strlen(lang) + 2;
1366 if (l > sizeof(buf))
1367 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1370 sprintf(p, "%s:%s", n, lang);
1371 id = pool_str2id(pool, p, create);
1378 pool_alloctmpspace(Pool *pool, int len)
1380 int n = pool->tmpspace.n;
1383 if (len > pool->tmpspace.len[n])
1385 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1386 pool->tmpspace.len[n] = len + 32;
1388 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1389 return pool->tmpspace.buf[n];
1393 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1398 n = oldn = pool->tmpspace.n;
1402 n = POOL_TMPSPACEBUF - 1;
1405 if (pool->tmpspace.buf[n] != space)
1407 if (len > pool->tmpspace.len[n])
1409 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1410 pool->tmpspace.len[n] = len + 32;
1412 return pool->tmpspace.buf[n];
1419 pool_freetmpspace(Pool *pool, const char *space)
1421 int n = pool->tmpspace.n;
1424 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1425 if (pool->tmpspace.buf[n] == space)
1426 pool->tmpspace.n = n;
1430 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1434 l1 = str1 ? strlen(str1) : 0;
1435 l2 = str2 ? strlen(str2) : 0;
1436 l3 = str3 ? strlen(str3) : 0;
1437 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1458 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1463 l1 = str1 ? strlen(str1) : 0;
1464 l2 = str2 ? strlen(str2) : 0;
1465 l3 = str3 ? strlen(str3) : 0;
1466 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1470 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1493 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1498 s = pool_alloctmpspace(pool, 2 * len + 1);
1499 solv_bin2hex(buf, len, s);
1503 /*******************************************************************/
1515 struct mptree *mptree;
1526 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1528 struct ducbdata *cbd = cbdata;
1531 if (data != cbd->olddata)
1533 Id dn, mp, comp, *dirmap, *dirs;
1535 const char *compstr;
1536 struct mptree *mptree;
1538 /* create map from dir to mptree */
1539 cbd->dirmap = solv_free(cbd->dirmap);
1541 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1542 mptree = cbd->mptree;
1544 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1558 if (!mptree[mp].child)
1563 if (data->localpool)
1564 compstr = stringpool_id2str(&data->spool, comp);
1566 compstr = pool_id2str(data->repo->pool, comp);
1567 compl = strlen(compstr);
1568 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1569 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1571 dirmap[dn] = i ? i : -mp;
1573 /* change dirmap to point to mountpoint instead of mptree */
1574 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1577 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1579 cbd->dirmap = dirmap;
1580 cbd->nmap = data->dirpool.ndirs;
1581 cbd->olddata = data;
1584 if (value->id < 0 || value->id >= cbd->nmap)
1586 mp = cbd->dirmap[value->id];
1589 if (cbd->addsub > 0)
1591 cbd->mps[mp].kbytes += value->num;
1592 cbd->mps[mp].files += value->num2;
1596 cbd->mps[mp].kbytes -= value->num;
1597 cbd->mps[mp].files -= value->num2;
1603 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1606 if (mptree[pos].mountpoint == -1)
1607 mptree[pos].mountpoint = mountpoint;
1609 mountpoint = mptree[pos].mountpoint;
1610 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1611 propagate_mountpoints(mptree, i, mountpoint);
1614 #define MPTREE_BLOCK 15
1617 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1620 const char *path, *compstr;
1621 struct mptree *mptree;
1625 struct ducbdata cbd;
1629 Repo *oldinstalled = pool->installed;
1631 memset(&ignoredu, 0, sizeof(ignoredu));
1638 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1641 mptree[0].sibling = 0;
1642 mptree[0].child = 0;
1644 mptree[0].compl = 0;
1645 mptree[0].mountpoint = -1;
1648 /* create component tree */
1649 for (mp = 0; mp < nmps; mp++)
1654 path = mps[mp].path;
1659 if ((p = strchr(path, '/')) == 0)
1662 compl = strlen(compstr);
1673 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1674 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1678 /* create new node */
1679 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1681 mptree[i].sibling = mptree[pos].child;
1682 mptree[i].child = 0;
1683 mptree[i].comp = compstr;
1684 mptree[i].compl = compl;
1685 mptree[i].mountpoint = -1;
1686 mptree[pos].child = i;
1690 mptree[pos].mountpoint = mp;
1693 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1696 for (i = 0; i < nmptree; i++)
1698 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1699 printf("#%d child: %d\n", i, mptree[i].child);
1700 printf("#%d comp: %s\n", i, mptree[i].comp);
1701 printf("#%d compl: %d\n", i, mptree[i].compl);
1702 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1706 cbd.mptree = mptree;
1708 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1710 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1712 if (!MAPTST(installedmap, sp))
1715 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1716 if (!cbd.hasdu && oldinstalled)
1719 /* no du data available, ignore data of all installed solvables we obsolete */
1721 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1724 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1725 while ((obs = *obsp++) != 0)
1726 FOR_PROVIDES(op, opp, obs)
1727 if (op >= oldinstalled->start && op < oldinstalled->end)
1728 MAPSET(&ignoredu, op - oldinstalled->start);
1730 FOR_PROVIDES(op, opp, s->name)
1731 if (pool->solvables[op].name == s->name)
1732 if (op >= oldinstalled->start && op < oldinstalled->end)
1733 MAPSET(&ignoredu, op - oldinstalled->start);
1739 /* assumes we allways have du data for installed solvables */
1740 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1742 if (MAPTST(installedmap, sp))
1744 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1746 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1750 map_free(&ignoredu);
1751 solv_free(cbd.dirmap);
1756 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1761 Repo *oldinstalled = pool->installed;
1763 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1765 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1767 if (!MAPTST(installedmap, sp))
1769 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1773 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1775 if (MAPTST(installedmap, sp))
1777 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1785 * 2: conflicts with installed
1786 * 8: interesting (only true if installed)
1790 static inline Id dep2name(Pool *pool, Id dep)
1792 while (ISRELDEP(dep))
1794 Reldep *rd = rd = GETRELDEP(pool, dep);
1800 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1803 Solvable *sn = pool->solvables + n;
1805 FOR_PROVIDES(p, pp, sn->name)
1807 Solvable *s = pool->solvables + p;
1808 if (s->name != sn->name || s->arch != sn->arch)
1810 if ((map[p] & 9) != 9)
1812 if (pool_match_nevr(pool, pool->solvables + p, con))
1814 return 1; /* found installed package that doesn't conflict */
1819 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1823 FOR_PROVIDES(p, pp, dep)
1825 if (p == SYSTEMSOLVABLE)
1826 return 1; /* always boring, as never constraining */
1827 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1829 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1830 if (providedbyinstalled_multiversion(pool, map, p, dep))
1832 if ((map[p] & 9) == 9)
1840 * pool_trivial_installable - calculate if a set of solvables is
1841 * trivial installable without any other installs/deinstalls of
1842 * packages not belonging to the set.
1844 * the state is returned in the result queue:
1845 * 1: solvable is installable without any other package changes
1846 * 0: solvable is not installable
1847 * -1: solvable is installable, but doesn't constrain any installed packages
1851 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1854 Id p, *dp, con, *conp, req, *reqp;
1858 map = solv_calloc(pool->nsolvables, 1);
1859 for (p = 1; p < pool->nsolvables; p++)
1861 if (!MAPTST(installedmap, p))
1864 s = pool->solvables + p;
1867 conp = s->repo->idarraydata + s->conflicts;
1868 while ((con = *conp++) != 0)
1870 dp = pool_whatprovides_ptr(pool, con);
1872 map[p] |= 2; /* XXX: self conflict ? */
1875 for (i = 0; i < pkgs->count; i++)
1876 map[pkgs->elements[i]] = 16;
1878 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1880 if (i == pkgs->count)
1882 p = pkgs->elements[i];
1883 if ((map[p] & 16) == 0)
1885 if ((map[p] & 2) != 0)
1890 s = pool->solvables + p;
1894 reqp = s->repo->idarraydata + s->requires;
1895 while ((req = *reqp++) != 0)
1897 if (req == SOLVABLE_PREREQMARKER)
1899 r = providedbyinstalled(pool, map, req, 0, 0);
1902 /* decided and miss */
1906 m |= r; /* 1 | 9 | 16 | 17 */
1915 int ispatch = 0; /* see solver.c patch handling */
1917 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1919 conp = s->repo->idarraydata + s->conflicts;
1920 while ((con = *conp++) != 0)
1922 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1927 if ((m == 1 || m == 17) && ISRELDEP(con))
1929 con = dep2name(pool, con);
1930 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1935 continue; /* found a conflict */
1938 if (s->repo && s->repo != oldinstalled)
1940 Id p2, obs, *obsp, *pp;
1944 obsp = s->repo->idarraydata + s->obsoletes;
1945 while ((obs = *obsp++) != 0)
1947 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1956 FOR_PROVIDES(p2, pp, s->name)
1958 s2 = pool->solvables + p2;
1959 if (s2->name == s->name && (map[p2] & 1) != 0)
1976 queue_init_clone(res, pkgs);
1977 for (i = 0; i < pkgs->count; i++)
1979 m = map[pkgs->elements[i]];
1986 res->elements[i] = r;
1992 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1994 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1998 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2000 if (entry == SOLVID_POS && pool->pos.repo)
2001 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2004 return solvable_lookup_str(pool->solvables + entry, keyname);
2008 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2010 if (entry == SOLVID_POS && pool->pos.repo)
2012 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
2013 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
2014 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
2018 return solvable_lookup_id(pool->solvables + entry, keyname);
2022 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2024 if (entry == SOLVID_POS && pool->pos.repo)
2026 unsigned long long value;
2027 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
2033 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2037 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2039 if (entry == SOLVID_POS && pool->pos.repo)
2040 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2043 return solvable_lookup_void(pool->solvables + entry, keyname);
2046 const unsigned char *
2047 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2049 if (entry == SOLVID_POS && pool->pos.repo)
2050 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2053 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2057 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2059 if (entry == SOLVID_POS && pool->pos.repo)
2061 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2062 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2066 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2070 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2072 int hadhashes = pool->relhashtbl ? 1 : 0;
2078 if (!conflicts->count)
2080 pool_freewhatprovides(pool);
2081 for (i = 0; i < conflicts->count; i += 5)
2083 fn = conflicts->elements[i];
2084 p = conflicts->elements[i + 1];
2085 md5 = conflicts->elements[i + 2];
2086 q = conflicts->elements[i + 3];
2087 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2088 s = pool->solvables + p;
2091 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2092 s = pool->solvables + q;
2095 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2098 pool_freeidhashes(pool);