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);
116 pool_freeallrepos(Pool *pool, int reuseids)
120 pool_freewhatprovides(pool);
121 for (i = 1; i < pool->nrepos; i++)
123 repo_freedata(pool->repos[i]);
124 pool->repos = solv_free(pool->repos);
127 /* the first two solvables don't belong to a repo */
128 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
131 #ifdef MULTI_SEMANTICS
133 pool_setdisttype(Pool *pool, int disttype)
135 pool->disttype = disttype;
136 if (disttype == DISTTYPE_RPM)
137 pool->noarchid = ARCH_NOARCH;
138 if (disttype == DISTTYPE_DEB)
139 pool->noarchid = ARCH_ALL;
140 if (disttype == DISTTYPE_ARCH)
141 pool->noarchid = ARCH_ANY;
142 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
147 pool_get_flag(Pool *pool, int flag)
151 case POOL_FLAG_PROMOTEEPOCH:
152 return pool->promoteepoch;
153 case POOL_FLAG_FORBIDSELFCONFLICTS:
154 return pool->forbidselfconflicts;
155 case POOL_FLAG_OBSOLETEUSESPROVIDES:
156 return pool->obsoleteusesprovides;
157 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
158 return pool->implicitobsoleteusesprovides;
159 case POOL_FLAG_OBSOLETEUSESCOLORS:
160 return pool->obsoleteusescolors;
161 case POOL_FLAG_NOINSTALLEDOBSOLETES:
162 return pool->noinstalledobsoletes;
163 case POOL_FLAG_HAVEDISTEPOCH:
164 return pool->havedistepoch;
172 pool_set_flag(Pool *pool, int flag, int value)
174 int old = pool_get_flag(pool, flag);
177 case POOL_FLAG_PROMOTEEPOCH:
178 pool->promoteepoch = value;
180 case POOL_FLAG_FORBIDSELFCONFLICTS:
181 pool->forbidselfconflicts = value;
183 case POOL_FLAG_OBSOLETEUSESPROVIDES:
184 pool->obsoleteusesprovides = value;
186 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
187 pool->implicitobsoleteusesprovides = value;
189 case POOL_FLAG_OBSOLETEUSESCOLORS:
190 pool->obsoleteusescolors = value;
192 case POOL_FLAG_NOINSTALLEDOBSOLETES:
193 pool->noinstalledobsoletes = value;
195 case POOL_FLAG_HAVEDISTEPOCH:
196 pool->havedistepoch = value;
206 pool_add_solvable(Pool *pool)
208 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
209 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
210 return pool->nsolvables++;
214 pool_add_solvable_block(Pool *pool, int count)
216 Id nsolvables = pool->nsolvables;
219 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
220 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
221 pool->nsolvables += count;
226 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
230 if (reuseids && start + count == pool->nsolvables)
232 /* might want to shrink solvable array */
233 pool->nsolvables = start;
236 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
241 pool_set_installed(Pool *pool, Repo *installed)
243 if (pool->installed == installed)
245 pool->installed = installed;
246 pool_freewhatprovides(pool);
250 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
255 oa = pool->whatprovides[*(Id *)ap];
256 ob = pool->whatprovides[*(Id *)bp];
258 return *(Id *)ap - *(Id *)bp;
259 da = pool->whatprovidesdata + oa;
260 db = pool->whatprovidesdata + ob;
262 if ((r = (*da++ - *db++)) != 0)
266 return *(Id *)ap - *(Id *)bp;
270 * pool_shrink_whatprovides - unify whatprovides data
272 * whatprovides_rel must be empty for this to work!
276 pool_shrink_whatprovides(Pool *pool)
280 Id lastid, *last, *dp, *lp;
284 if (pool->ss.nstrings < 3)
286 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
287 for (i = id = 0; id < pool->ss.nstrings; id++)
288 if (pool->whatprovides[id] && pool->whatprovides[id] != 1)
291 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
294 for (i = 0; i < n; i++)
297 o = pool->whatprovides[id];
298 dp = pool->whatprovidesdata + o;
312 pool->whatprovides[id] = -lastid;
316 last = pool->whatprovidesdata + o;
320 dp = pool->whatprovidesdata + 2;
321 for (id = 1; id < pool->ss.nstrings; id++)
323 o = pool->whatprovides[id];
324 if (o == 0 || o == 1)
331 pool->whatprovides[id] = pool->whatprovides[i];
334 lp = pool->whatprovidesdata + o;
337 pool->whatprovides[id] = dp - pool->whatprovidesdata;
338 while ((*dp++ = *lp++) != 0)
341 o = dp - pool->whatprovidesdata;
342 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
343 if (pool->whatprovidesdataoff == o)
345 r = pool->whatprovidesdataoff - o;
346 pool->whatprovidesdataoff = o;
347 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
348 if (r > pool->whatprovidesdataleft)
349 r = pool->whatprovidesdataleft;
350 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
355 * pool_createwhatprovides()
357 * create hashes over pool of solvables to ease provide lookups
361 pool_createwhatprovides(Pool *pool)
363 int i, num, np, extra;
368 Offset *whatprovides;
369 Id *whatprovidesdata, *d;
370 Repo *installed = pool->installed;
373 now = solv_timems(0);
374 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
375 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
376 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);
377 if (pool->ss.stringhashmask || pool->relhashmask)
378 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)));
380 pool_freeidhashes(pool); /* XXX: should not be here! */
381 pool_freewhatprovides(pool);
382 num = pool->ss.nstrings;
383 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
384 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
386 /* count providers for each name */
387 for (i = pool->nsolvables - 1; i > 0; i--)
390 s = pool->solvables + i;
391 if (!s->provides || !s->repo || s->repo->disabled)
393 /* we always need the installed solvable in the whatprovides data,
394 otherwise obsoletes/conflicts on them won't work */
395 if (s->repo != installed && !pool_installable(pool, s))
397 pp = s->repo->idarraydata + s->provides;
398 while ((id = *pp++) != 0)
402 Reldep *rd = GETRELDEP(pool, id);
405 whatprovides[id]++; /* inc count of providers */
409 off = 2; /* first entry is undef, second is empty list */
410 np = 0; /* number of names provided */
411 for (i = 0, idp = whatprovides; i < num; i++, idp++)
414 if (!n) /* no providers */
416 off += n; /* make space for all providers */
417 *idp = off++; /* now idp points to terminating zero */
418 np++; /* inc # of provider 'slots' for stats */
421 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
423 /* reserve some space for relation data */
424 extra = 2 * pool->nrels;
428 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
430 /* alloc space for all providers + extra */
431 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
433 /* now fill data for all provides */
434 for (i = pool->nsolvables - 1; i > 0; i--)
437 s = pool->solvables + i;
438 if (!s->provides || !s->repo || s->repo->disabled)
440 if (s->repo != installed && !pool_installable(pool, s))
443 /* for all provides of this solvable */
444 pp = s->repo->idarraydata + s->provides;
445 while ((id = *pp++) != 0)
449 Reldep *rd = GETRELDEP(pool, id);
452 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
453 if (*d != i) /* don't add same solvable twice */
460 pool->whatprovidesdata = whatprovidesdata;
461 pool->whatprovidesdataoff = off;
462 pool->whatprovidesdataleft = extra;
463 pool_shrink_whatprovides(pool);
464 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)));
465 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
469 * free all of our whatprovides data
470 * be careful, everything internalized with pool_queuetowhatprovides is
474 pool_freewhatprovides(Pool *pool)
476 pool->whatprovides = solv_free(pool->whatprovides);
477 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
478 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
479 pool->whatprovidesdataoff = 0;
480 pool->whatprovidesdataleft = 0;
484 /******************************************************************************/
487 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
489 * on-demand filling of provider information
490 * move queue data into whatprovidesdata
492 * returns: Offset into whatprovides
496 pool_queuetowhatprovides(Pool *pool, Queue *q)
499 int count = q->count;
501 if (count == 0) /* queue empty -> 1 */
504 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
505 if (pool->whatprovidesdataleft < count + 1)
507 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
508 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
509 pool->whatprovidesdataleft = count + 4096;
512 /* copy queue to next free slot */
513 off = pool->whatprovidesdataoff;
514 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
516 /* adapt count and ID_NULL-terminate */
517 pool->whatprovidesdataoff += count;
518 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
519 pool->whatprovidesdataleft -= count + 1;
525 /*************************************************************************/
527 #if defined(MULTI_SEMANTICS)
528 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
529 #elif defined(DEBIAN)
530 # define EVRCMP_DEPCMP EVRCMP_COMPARE
532 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
535 /* check if a package's nevr matches a dependency */
538 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
540 Reldep *rd = GETRELDEP(pool, d);
543 int flags = rd->flags;
552 return pool_match_nevr(pool, s, name);
554 if (pool_match_nevr(pool, s, name))
556 return pool_match_nevr(pool, s, evr);
559 if (!pool_match_nevr(pool, s, name))
561 return pool_match_nevr(pool, s, evr);
566 if (!pool_match_nevr(pool, s, name))
569 return (flags & REL_EQ) ? 1 : 0;
574 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
579 return (flags & REL_LT) ? 1 : 0;
581 return (flags & REL_EQ) ? 1 : 0;
583 return (flags & REL_GT) ? 1 : 0;
585 return (flags & REL_EQ) ? 1 : 0;
592 /* match (flags, evr) against provider (pflags, pevr) */
594 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
596 if (!pflags || !flags || pflags >= 8 || flags >= 8)
598 if (flags == 7 || pflags == 7)
599 return 1; /* rel provides every version */
600 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
601 return 1; /* both rels show in the same direction */
603 return (flags & pflags & REL_EQ) ? 1 : 0;
604 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
607 return (pflags & REL_EQ) ? 1 : 0;
609 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
611 return (flags & pflags & REL_EQ) ? 1 : 0;
613 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
615 return (flags & REL_EQ) ? 1 : 0;
622 /* match two dependencies (d1 = provider) */
625 pool_match_dep(Pool *pool, Id d1, Id d2)
635 rd2 = GETRELDEP(pool, d2);
636 return pool_match_dep(pool, d1, rd2->name);
638 rd1 = GETRELDEP(pool, d1);
641 return pool_match_dep(pool, rd1->name, d2);
643 rd2 = GETRELDEP(pool, d2);
644 /* first match name */
645 if (!pool_match_dep(pool, rd1->name, rd2->name))
647 /* name matches, check flags and evr */
648 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
654 * add packages fulfilling the relation to whatprovides array
655 * no exact providers, do range match
660 pool_addrelproviders(Pool *pool, Id d)
662 Reldep *rd = GETRELDEP(pool, d);
668 int flags = rd->flags;
673 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
677 /* special relation */
685 wp = pool_whatprovides(pool, name);
686 pp2 = pool_whatprovides_ptr(pool, evr);
687 pp = pool->whatprovidesdata + wp;
688 while ((p = *pp++) != 0)
690 for (pp3 = pp2; *pp3; pp3++)
694 queue_push(&plist, p); /* found it */
700 wp = pool_whatprovides(pool, name);
701 pp = pool->whatprovidesdata + wp;
703 wp = pool_whatprovides(pool, evr);
707 while ((p = *pp++) != 0)
708 queue_push(&plist, p);
710 pp = pool_whatprovides_ptr(pool, evr);
711 while ((p = *pp++) != 0)
712 queue_pushunique(&plist, p);
713 if (plist.count != cnt)
718 if (name == NAMESPACE_OTHERPROVIDERS)
720 wp = pool_whatprovides(pool, evr);
723 if (pool->nscallback)
725 /* ask callback which packages provide the dependency
727 * 1: the system (aka SYSTEMSOLVABLE)
728 * >1: set of packages, stored as offset on whatprovidesdata
730 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
734 queue_push(&plist, SYSTEMSOLVABLE);
738 /* small hack: make it possible to match <pkg>.src
739 * we have to iterate over the solvables as src packages do not
740 * provide anything, thus they are not indexed in our
741 * whatprovides hash */
745 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
747 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
749 if (pool_match_nevr(pool, s, name))
750 queue_push(&plist, p);
754 wp = pool_whatprovides(pool, name);
755 pp = pool->whatprovidesdata + wp;
756 while ((p = *pp++) != 0)
758 Solvable *s = pool->solvables + p;
760 queue_push(&plist, p);
765 case REL_FILECONFLICT:
766 pp = pool_whatprovides_ptr(pool, name);
767 while ((p = *pp++) != 0)
769 Id origd = MAKERELDEP(d);
770 Solvable *s = pool->solvables + p;
773 pidp = s->repo->idarraydata + s->provides;
774 while ((pid = *pidp++) != 0)
778 queue_push(&plist, p);
786 /* we can reuse an existing entry */
788 pool->whatprovides_rel[d] = wp;
794 /* simple version comparison relation */
796 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
798 pp = pool_whatprovides_ptr(pool, name);
799 while (ISRELDEP(name))
801 rd = GETRELDEP(pool, name);
804 while ((p = *pp++) != 0)
806 Solvable *s = pool->solvables + p;
809 /* no provides - check nevr */
810 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
811 queue_push(&plist, p);
814 /* solvable p provides name in some rels */
815 pidp = s->repo->idarraydata + s->provides;
816 while ((pid = *pidp++) != 0)
821 continue; /* wrong provides name */
822 if (pool->disttype == DISTTYPE_DEB)
823 continue; /* unversioned provides can never match versioned deps */
826 prd = GETRELDEP(pool, pid);
827 if (prd->name != name)
828 continue; /* wrong provides name */
829 /* right package, both deps are rels. check flags/evr */
830 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
834 continue; /* none of the providers matched */
835 queue_push(&plist, p);
837 /* make our system solvable provide all unknown rpmlib() stuff */
838 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
839 queue_push(&plist, SYSTEMSOLVABLE);
841 /* add providers to whatprovides */
843 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
845 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
848 return pool->whatprovides_rel[d];
851 /*************************************************************************/
854 pool_debug(Pool *pool, int type, const char *format, ...)
859 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
861 if ((pool->debugmask & type) == 0)
864 va_start(args, format);
865 if (!pool->debugcallback)
867 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
868 vprintf(format, args);
870 vfprintf(stderr, format, args);
873 vsnprintf(buf, sizeof(buf), format, args);
874 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
878 pool_setdebuglevel(Pool *pool, int level)
880 int mask = SOLV_DEBUG_RESULT;
882 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION;
884 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
886 mask |= SOLV_DEBUG_PROPAGATE;
888 mask |= SOLV_DEBUG_RULE_CREATION;
889 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
890 pool->debugmask = mask;
893 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
895 pool->debugcallback = debugcallback;
896 pool->debugcallbackdata = debugcallbackdata;
899 void pool_setdebugmask(Pool *pool, int mask)
901 pool->debugmask = mask;
904 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
906 pool->loadcallback = cb;
907 pool->loadcallbackdata = loadcbdata;
910 /*************************************************************************/
920 #define SEARCHFILES_BLOCK 127
923 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
927 struct searchfiles *csf;
929 while ((dep = *ida++) != 0)
932 while (ISRELDEP(dep))
935 sid = pool->ss.nstrings + GETRELID(dep);
936 if (MAPTST(&csf->seen, sid))
941 MAPSET(&csf->seen, sid);
942 rd = GETRELDEP(pool, dep);
945 else if (rd->flags == REL_NAMESPACE)
947 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
950 if (!csf || MAPTST(&csf->seen, sid))
955 MAPSET(&csf->seen, sid);
959 else if (rd->flags == REL_FILECONFLICT)
969 pool_addfileprovides_dep(pool, ids, csf, isf);
975 if (MAPTST(&csf->seen, dep))
977 MAPSET(&csf->seen, dep);
978 s = pool_id2str(pool, dep);
981 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
982 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
983 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
984 csf->ids[csf->nfiles] = dep;
985 sr = strrchr(s, '/');
986 csf->names[csf->nfiles] = solv_strdup(sr + 1);
987 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
989 strncpy(csf->dirs[csf->nfiles], s, sr - s);
990 csf->dirs[csf->nfiles][sr - s] = 0;
995 struct addfileprovides_cbdata {
1009 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1011 struct addfileprovides_cbdata *cbd = cbdata;
1014 if (!cbd->useddirs.size)
1016 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1017 for (i = 0; i < cbd->nfiles; i++)
1020 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1025 did = repodata_str2dir(data, cbd->dirs[i], 0);
1028 MAPSET(&cbd->useddirs, did);
1030 repodata_free_dircache(data);
1032 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1034 for (i = 0; i < cbd->nfiles; i++)
1036 if (cbd->dids[i] != value->id)
1038 if (!strcmp(cbd->names[i], value->str))
1041 if (i == cbd->nfiles)
1043 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1048 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1053 Queue fileprovidesq;
1054 int i, j, repoid, repodataid;
1055 int provstart, provend;
1057 int ndone, incomplete;
1062 cbd->nfiles = sf->nfiles;
1064 cbd->dirs = sf->dirs;
1065 cbd->names = sf->names;
1066 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1067 map_init(&cbd->providedids, pool->ss.nstrings);
1070 repo = repoonly ? repoonly : pool->repos[repoid];
1071 map_init(&donemap, pool->nsolvables);
1072 queue_init(&fileprovidesq);
1073 provstart = provend = 0;
1076 if (!repo || repo->disabled)
1078 if (repoonly || ++repoid == pool->nrepos)
1080 repo = pool->repos[repoid];
1084 FOR_REPODATAS(repo, repodataid, data)
1086 if (ndone >= repo->nsolvables)
1089 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1091 map_empty(&cbd->providedids);
1092 for (i = 0; i < fileprovidesq.count; i++)
1093 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1094 provstart = data->start;
1095 provend = data->end;
1096 for (i = 0; i < cbd->nfiles; i++)
1097 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1099 if (i == cbd->nfiles)
1101 /* great! no need to search files */
1102 for (p = data->start; p < data->end; p++)
1103 if (pool->solvables[p].repo == repo)
1105 if (MAPTST(&donemap, p))
1107 MAPSET(&donemap, p);
1114 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1117 if (data->start < provstart || data->end > provend)
1119 map_empty(&cbd->providedids);
1120 provstart = provend = 0;
1123 /* check if the data is incomplete */
1125 if (data->state == REPODATA_AVAILABLE)
1127 for (j = 1; j < data->nkeys; j++)
1128 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1130 if (j < data->nkeys)
1133 for (i = 0; i < cbd->nfiles; i++)
1134 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1135 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1137 for (i = 0; i < cbd->nfiles; i++)
1138 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1140 if (i < cbd->nfiles)
1146 map_init(&cbd->useddirs, 0);
1147 for (p = data->start; p < data->end; p++)
1148 if (pool->solvables[p].repo == repo)
1150 if (MAPTST(&donemap, p))
1152 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1155 MAPSET(&donemap, p);
1159 map_free(&cbd->useddirs);
1162 if (repoonly || ++repoid == pool->nrepos)
1164 repo = pool->repos[repoid];
1167 queue_free(&fileprovidesq);
1168 map_free(&cbd->providedids);
1172 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1175 Repo *installed, *repo;
1176 struct searchfiles sf, isf, *isfp;
1177 struct addfileprovides_cbdata cbd;
1181 installed = pool->installed;
1182 now = solv_timems(0);
1183 memset(&sf, 0, sizeof(sf));
1184 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1185 memset(&isf, 0, sizeof(isf));
1186 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1191 queue_empty(idqinst);
1192 isfp = installed ? &isf : 0;
1193 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1199 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1201 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1203 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1205 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1207 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1209 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1211 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1214 map_free(&isf.seen);
1215 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1220 for (i = 0; i < sf.nfiles; i++)
1221 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1223 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1225 for (i = 0; i < sf.nfiles; i++)
1226 queue_push(idq, sf.ids[i]);
1228 for (i = 0; i < sf.nfiles; i++)
1229 queue_push(idqinst, sf.ids[i]);
1231 for (i = 0; i < sf.nfiles; i++)
1233 solv_free(sf.dirs[i]);
1234 solv_free(sf.names[i]);
1237 solv_free(sf.names);
1242 for (i = 0; i < isf.nfiles; i++)
1243 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1246 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1247 if (installed && idqinst)
1248 for (i = 0; i < isf.nfiles; i++)
1249 queue_pushunique(idqinst, isf.ids[i]);
1251 for (i = 0; i < isf.nfiles; i++)
1253 solv_free(isf.dirs[i]);
1254 solv_free(isf.names[i]);
1256 solv_free(isf.dirs);
1257 solv_free(isf.names);
1259 solv_free(cbd.dids);
1260 pool_freewhatprovides(pool); /* as we have added provides */
1261 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1265 pool_addfileprovides(Pool *pool)
1267 pool_addfileprovides_queue(pool, 0, 0);
1271 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)
1275 if (pool->solvables[p].repo)
1276 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1279 /* FIXME: obey callback return value! */
1280 for (p = 1; p < pool->nsolvables; p++)
1281 if (pool->solvables[p].repo)
1282 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1286 pool_clear_pos(Pool *pool)
1288 memset(&pool->pos, 0, sizeof(pool->pos));
1293 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1297 pool->languagecache = solv_free(pool->languagecache);
1298 pool->languagecacheother = 0;
1299 if (pool->nlanguages)
1301 for (i = 0; i < pool->nlanguages; i++)
1302 free((char *)pool->languages[i]);
1303 free(pool->languages);
1305 pool->nlanguages = nlanguages;
1308 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1309 for (i = 0; i < pool->nlanguages; i++)
1310 pool->languages[i] = solv_strdup(languages[i]);
1314 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1320 if (!lang || !*lang)
1322 n = pool_id2str(pool, id);
1323 l = strlen(n) + strlen(lang) + 2;
1324 if (l > sizeof(buf))
1325 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1328 sprintf(p, "%s:%s", n, lang);
1329 id = pool_str2id(pool, p, create);
1336 pool_alloctmpspace(Pool *pool, int len)
1338 int n = pool->tmpspace.n;
1341 if (len > pool->tmpspace.len[n])
1343 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1344 pool->tmpspace.len[n] = len + 32;
1346 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1347 return pool->tmpspace.buf[n];
1351 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1356 n = oldn = pool->tmpspace.n;
1360 n = POOL_TMPSPACEBUF - 1;
1363 if (pool->tmpspace.buf[n] != space)
1365 if (len > pool->tmpspace.len[n])
1367 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1368 pool->tmpspace.len[n] = len + 32;
1370 return pool->tmpspace.buf[n];
1377 pool_freetmpspace(Pool *pool, const char *space)
1379 int n = pool->tmpspace.n;
1382 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1383 if (pool->tmpspace.buf[n] == space)
1384 pool->tmpspace.n = n;
1388 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1392 l1 = str1 ? strlen(str1) : 0;
1393 l2 = str2 ? strlen(str2) : 0;
1394 l3 = str3 ? strlen(str3) : 0;
1395 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1416 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1421 l1 = str1 ? strlen(str1) : 0;
1422 l2 = str2 ? strlen(str2) : 0;
1423 l3 = str3 ? strlen(str3) : 0;
1424 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1428 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1451 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1456 s = pool_alloctmpspace(pool, 2 * len + 1);
1457 solv_bin2hex(buf, len, s);
1461 /*******************************************************************/
1473 struct mptree *mptree;
1484 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1486 struct ducbdata *cbd = cbdata;
1489 if (data != cbd->olddata)
1491 Id dn, mp, comp, *dirmap, *dirs;
1493 const char *compstr;
1494 struct mptree *mptree;
1496 /* create map from dir to mptree */
1497 cbd->dirmap = solv_free(cbd->dirmap);
1499 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1500 mptree = cbd->mptree;
1502 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1516 if (!mptree[mp].child)
1521 if (data->localpool)
1522 compstr = stringpool_id2str(&data->spool, comp);
1524 compstr = pool_id2str(data->repo->pool, comp);
1525 compl = strlen(compstr);
1526 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1527 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1529 dirmap[dn] = i ? i : -mp;
1531 /* change dirmap to point to mountpoint instead of mptree */
1532 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1535 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1537 cbd->dirmap = dirmap;
1538 cbd->nmap = data->dirpool.ndirs;
1539 cbd->olddata = data;
1542 if (value->id < 0 || value->id >= cbd->nmap)
1544 mp = cbd->dirmap[value->id];
1547 if (cbd->addsub > 0)
1549 cbd->mps[mp].kbytes += value->num;
1550 cbd->mps[mp].files += value->num2;
1554 cbd->mps[mp].kbytes -= value->num;
1555 cbd->mps[mp].files -= value->num2;
1561 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1564 if (mptree[pos].mountpoint == -1)
1565 mptree[pos].mountpoint = mountpoint;
1567 mountpoint = mptree[pos].mountpoint;
1568 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1569 propagate_mountpoints(mptree, i, mountpoint);
1572 #define MPTREE_BLOCK 15
1575 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1578 const char *path, *compstr;
1579 struct mptree *mptree;
1583 struct ducbdata cbd;
1587 Repo *oldinstalled = pool->installed;
1589 memset(&ignoredu, 0, sizeof(ignoredu));
1596 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1599 mptree[0].sibling = 0;
1600 mptree[0].child = 0;
1602 mptree[0].compl = 0;
1603 mptree[0].mountpoint = -1;
1606 /* create component tree */
1607 for (mp = 0; mp < nmps; mp++)
1612 path = mps[mp].path;
1617 if ((p = strchr(path, '/')) == 0)
1620 compl = strlen(compstr);
1631 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1632 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1636 /* create new node */
1637 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1639 mptree[i].sibling = mptree[pos].child;
1640 mptree[i].child = 0;
1641 mptree[i].comp = compstr;
1642 mptree[i].compl = compl;
1643 mptree[i].mountpoint = -1;
1644 mptree[pos].child = i;
1648 mptree[pos].mountpoint = mp;
1651 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1654 for (i = 0; i < nmptree; i++)
1656 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1657 printf("#%d child: %d\n", i, mptree[i].child);
1658 printf("#%d comp: %s\n", i, mptree[i].comp);
1659 printf("#%d compl: %d\n", i, mptree[i].compl);
1660 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1664 cbd.mptree = mptree;
1666 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1668 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1670 if (!MAPTST(installedmap, sp))
1673 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1674 if (!cbd.hasdu && oldinstalled)
1677 /* no du data available, ignore data of all installed solvables we obsolete */
1679 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1682 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1683 while ((obs = *obsp++) != 0)
1684 FOR_PROVIDES(op, opp, obs)
1685 if (op >= oldinstalled->start && op < oldinstalled->end)
1686 MAPSET(&ignoredu, op - oldinstalled->start);
1688 FOR_PROVIDES(op, opp, s->name)
1689 if (pool->solvables[op].name == s->name)
1690 if (op >= oldinstalled->start && op < oldinstalled->end)
1691 MAPSET(&ignoredu, op - oldinstalled->start);
1697 /* assumes we allways have du data for installed solvables */
1698 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1700 if (MAPTST(installedmap, sp))
1702 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1704 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1708 map_free(&ignoredu);
1709 solv_free(cbd.dirmap);
1714 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1719 Repo *oldinstalled = pool->installed;
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))
1727 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1731 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1733 if (MAPTST(installedmap, sp))
1735 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1743 * 2: conflicts with installed
1744 * 8: interesting (only true if installed)
1748 static inline Id dep2name(Pool *pool, Id dep)
1750 while (ISRELDEP(dep))
1752 Reldep *rd = rd = GETRELDEP(pool, dep);
1758 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1761 Solvable *sn = pool->solvables + n;
1763 FOR_PROVIDES(p, pp, sn->name)
1765 Solvable *s = pool->solvables + p;
1766 if (s->name != sn->name || s->arch != sn->arch)
1768 if ((map[p] & 9) != 9)
1770 if (pool_match_nevr(pool, pool->solvables + p, con))
1772 return 1; /* found installed package that doesn't conflict */
1777 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1781 FOR_PROVIDES(p, pp, dep)
1783 if (p == SYSTEMSOLVABLE)
1784 return 1; /* always boring, as never constraining */
1785 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1787 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1788 if (providedbyinstalled_multiversion(pool, map, p, dep))
1790 if ((map[p] & 9) == 9)
1798 * pool_trivial_installable - calculate if a set of solvables is
1799 * trivial installable without any other installs/deinstalls of
1800 * packages not belonging to the set.
1802 * the state is returned in the result queue:
1803 * 1: solvable is installable without any other package changes
1804 * 0: solvable is not installable
1805 * -1: solvable is installable, but doesn't constrain any installed packages
1809 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1812 Id p, *dp, con, *conp, req, *reqp;
1816 map = solv_calloc(pool->nsolvables, 1);
1817 for (p = 1; p < pool->nsolvables; p++)
1819 if (!MAPTST(installedmap, p))
1822 s = pool->solvables + p;
1825 conp = s->repo->idarraydata + s->conflicts;
1826 while ((con = *conp++) != 0)
1828 dp = pool_whatprovides_ptr(pool, con);
1830 map[p] |= 2; /* XXX: self conflict ? */
1833 for (i = 0; i < pkgs->count; i++)
1834 map[pkgs->elements[i]] = 16;
1836 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1838 if (i == pkgs->count)
1840 p = pkgs->elements[i];
1841 if ((map[p] & 16) == 0)
1843 if ((map[p] & 2) != 0)
1848 s = pool->solvables + p;
1852 reqp = s->repo->idarraydata + s->requires;
1853 while ((req = *reqp++) != 0)
1855 if (req == SOLVABLE_PREREQMARKER)
1857 r = providedbyinstalled(pool, map, req, 0, 0);
1860 /* decided and miss */
1864 m |= r; /* 1 | 9 | 16 | 17 */
1873 int ispatch = 0; /* see solver.c patch handling */
1875 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1877 conp = s->repo->idarraydata + s->conflicts;
1878 while ((con = *conp++) != 0)
1880 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1885 if ((m == 1 || m == 17) && ISRELDEP(con))
1887 con = dep2name(pool, con);
1888 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1893 continue; /* found a conflict */
1896 if (s->repo && s->repo != oldinstalled)
1898 Id p2, obs, *obsp, *pp;
1902 obsp = s->repo->idarraydata + s->obsoletes;
1903 while ((obs = *obsp++) != 0)
1905 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1914 FOR_PROVIDES(p2, pp, s->name)
1916 s2 = pool->solvables + p2;
1917 if (s2->name == s->name && (map[p2] & 1) != 0)
1934 queue_init_clone(res, pkgs);
1935 for (i = 0; i < pkgs->count; i++)
1937 m = map[pkgs->elements[i]];
1944 res->elements[i] = r;
1950 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1952 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1956 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1958 if (entry == SOLVID_POS && pool->pos.repo)
1959 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1962 return solvable_lookup_str(pool->solvables + entry, keyname);
1966 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1968 if (entry == SOLVID_POS && pool->pos.repo)
1970 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1971 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1972 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1976 return solvable_lookup_id(pool->solvables + entry, keyname);
1980 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
1982 if (entry == SOLVID_POS && pool->pos.repo)
1984 unsigned long long value;
1985 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1991 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1995 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1997 if (entry == SOLVID_POS && pool->pos.repo)
1998 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
2001 return solvable_lookup_void(pool->solvables + entry, keyname);
2004 const unsigned char *
2005 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2007 if (entry == SOLVID_POS && pool->pos.repo)
2008 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2011 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2015 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2017 if (entry == SOLVID_POS && pool->pos.repo)
2019 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
2020 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2024 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2028 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2030 int hadhashes = pool->relhashtbl ? 1 : 0;
2036 if (!conflicts->count)
2038 pool_freewhatprovides(pool);
2039 for (i = 0; i < conflicts->count; i += 5)
2041 fn = conflicts->elements[i];
2042 p = conflicts->elements[i + 1];
2043 md5 = conflicts->elements[i + 2];
2044 q = conflicts->elements[i + 3];
2045 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2046 s = pool->solvables + p;
2049 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2050 s = pool->solvables + q;
2053 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2056 pool_freeidhashes(pool);