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 /* initialize the system solvable */
58 s = pool->solvables + SYSTEMSOLVABLE;
59 s->name = SYSTEM_SYSTEM;
60 s->arch = ARCH_NOARCH;
63 queue_init(&pool->vendormap);
65 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
67 pool->obsoleteusescolors = 1;
70 pool->disttype = DISTTYPE_DEB;
73 pool->forbidselfconflicts = 1;
74 pool->obsoleteusesprovides = 1;
75 pool->implicitobsoleteusesprovides = 1;
81 /* free all the resources of our pool */
87 pool_freewhatprovides(pool);
88 pool_freeidhashes(pool);
89 pool_freeallrepos(pool, 1);
90 solv_free(pool->id2arch);
91 solv_free(pool->id2color);
92 solv_free(pool->solvables);
93 stringpool_free(&pool->ss);
94 solv_free(pool->rels);
95 pool_setvendorclasses(pool, 0);
96 queue_free(&pool->vendormap);
97 for (i = 0; i < POOL_TMPSPACEBUF; i++)
98 solv_free(pool->tmpspace.buf[i]);
99 for (i = 0; i < pool->nlanguages; i++)
100 free((char *)pool->languages[i]);
101 solv_free(pool->languages);
102 solv_free(pool->languagecache);
107 pool_freeallrepos(Pool *pool, int reuseids)
111 pool_freewhatprovides(pool);
112 for (i = 1; i < pool->nrepos; i++)
114 repo_freedata(pool->repos[i]);
115 pool->repos = solv_free(pool->repos);
118 /* the first two solvables don't belong to a repo */
119 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
122 #ifdef MULTI_SEMANTICS
124 pool_setdisttype(Pool *pool, int disttype)
126 pool->disttype = disttype;
131 pool_get_flag(Pool *pool, int flag)
135 case POOL_FLAG_PROMOTEEPOCH:
136 return pool->promoteepoch;
137 case POOL_FLAG_FORBIDSELFCONFLICTS:
138 return pool->forbidselfconflicts;
139 case POOL_FLAG_OBSOLETEUSESPROVIDES:
140 return pool->obsoleteusesprovides;
141 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
142 return pool->implicitobsoleteusesprovides;
143 case POOL_FLAG_OBSOLETEUSESCOLORS:
144 return pool->obsoleteusescolors;
145 case POOL_FLAG_NOINSTALLEDOBSOLETES:
146 return pool->noinstalledobsoletes;
154 pool_set_flag(Pool *pool, int flag, int value)
156 int old = pool_get_flag(pool, flag);
159 case POOL_FLAG_PROMOTEEPOCH:
160 pool->promoteepoch = value;
162 case POOL_FLAG_FORBIDSELFCONFLICTS:
163 pool->forbidselfconflicts = value;
165 case POOL_FLAG_OBSOLETEUSESPROVIDES:
166 pool->obsoleteusesprovides = value;
168 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
169 pool->implicitobsoleteusesprovides = value;
171 case POOL_FLAG_OBSOLETEUSESCOLORS:
172 pool->obsoleteusescolors = value;
174 case POOL_FLAG_NOINSTALLEDOBSOLETES:
175 pool->noinstalledobsoletes = value;
185 pool_add_solvable(Pool *pool)
187 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
188 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
189 return pool->nsolvables++;
193 pool_add_solvable_block(Pool *pool, int count)
195 Id nsolvables = pool->nsolvables;
198 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
199 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
200 pool->nsolvables += count;
205 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
209 if (reuseids && start + count == pool->nsolvables)
211 /* might want to shrink solvable array */
212 pool->nsolvables = start;
215 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
220 pool_set_installed(Pool *pool, Repo *installed)
222 if (pool->installed == installed)
224 pool->installed = installed;
225 pool_freewhatprovides(pool);
229 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
234 oa = pool->whatprovides[*(Id *)ap];
235 ob = pool->whatprovides[*(Id *)bp];
237 return *(Id *)ap - *(Id *)bp;
238 da = pool->whatprovidesdata + oa;
239 db = pool->whatprovidesdata + ob;
241 if ((r = (*da++ - *db++)) != 0)
245 return *(Id *)ap - *(Id *)bp;
249 * pool_shrink_whatprovides - unify whatprovides data
251 * whatprovides_rel must be empty for this to work!
255 pool_shrink_whatprovides(Pool *pool)
259 Id lastid, *last, *dp, *lp;
263 if (pool->ss.nstrings < 3)
265 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
266 for (i = id = 0; id < pool->ss.nstrings; id++)
267 if (pool->whatprovides[id] && pool->whatprovides[id] != 1)
270 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
273 for (i = 0; i < n; i++)
276 o = pool->whatprovides[id];
277 dp = pool->whatprovidesdata + o;
291 pool->whatprovides[id] = -lastid;
295 last = pool->whatprovidesdata + o;
299 dp = pool->whatprovidesdata + 2;
300 for (id = 1; id < pool->ss.nstrings; id++)
302 o = pool->whatprovides[id];
303 if (o == 0 || o == 1)
310 pool->whatprovides[id] = pool->whatprovides[i];
313 lp = pool->whatprovidesdata + o;
316 pool->whatprovides[id] = dp - pool->whatprovidesdata;
317 while ((*dp++ = *lp++) != 0)
320 o = dp - pool->whatprovidesdata;
321 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
322 if (pool->whatprovidesdataoff == o)
324 r = pool->whatprovidesdataoff - o;
325 pool->whatprovidesdataoff = o;
326 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
327 if (r > pool->whatprovidesdataleft)
328 r = pool->whatprovidesdataleft;
329 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
334 * pool_createwhatprovides()
336 * create hashes over pool of solvables to ease provide lookups
340 pool_createwhatprovides(Pool *pool)
342 int i, num, np, extra;
347 Offset *whatprovides;
348 Id *whatprovidesdata, *d;
349 Repo *installed = pool->installed;
352 now = solv_timems(0);
353 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
354 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
356 pool_freeidhashes(pool); /* XXX: should not be here! */
357 pool_freewhatprovides(pool);
358 num = pool->ss.nstrings;
359 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
360 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
362 /* count providers for each name */
363 for (i = pool->nsolvables - 1; i > 0; i--)
366 s = pool->solvables + i;
367 if (!s->provides || !s->repo || s->repo->disabled)
369 /* we always need the installed solvable in the whatprovides data,
370 otherwise obsoletes/conflicts on them won't work */
371 if (s->repo != installed && !pool_installable(pool, s))
373 pp = s->repo->idarraydata + s->provides;
374 while ((id = *pp++) != 0)
378 Reldep *rd = GETRELDEP(pool, id);
381 whatprovides[id]++; /* inc count of providers */
385 off = 2; /* first entry is undef, second is empty list */
386 np = 0; /* number of names provided */
387 for (i = 0, idp = whatprovides; i < num; i++, idp++)
390 if (!n) /* no providers */
392 off += n; /* make space for all providers */
393 *idp = off++; /* now idp points to terminating zero */
394 np++; /* inc # of provider 'slots' for stats */
397 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
399 /* reserve some space for relation data */
400 extra = 2 * pool->nrels;
404 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
406 /* alloc space for all providers + extra */
407 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
409 /* now fill data for all provides */
410 for (i = pool->nsolvables - 1; i > 0; i--)
413 s = pool->solvables + i;
414 if (!s->provides || !s->repo || s->repo->disabled)
416 if (s->repo != installed && !pool_installable(pool, s))
419 /* for all provides of this solvable */
420 pp = s->repo->idarraydata + s->provides;
421 while ((id = *pp++) != 0)
425 Reldep *rd = GETRELDEP(pool, id);
428 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
429 if (*d != i) /* don't add same solvable twice */
436 pool->whatprovidesdata = whatprovidesdata;
437 pool->whatprovidesdataoff = off;
438 pool->whatprovidesdataleft = extra;
439 pool_shrink_whatprovides(pool);
440 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)));
441 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
445 * free all of our whatprovides data
446 * be careful, everything internalized with pool_queuetowhatprovides is
450 pool_freewhatprovides(Pool *pool)
452 pool->whatprovides = solv_free(pool->whatprovides);
453 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
454 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
455 pool->whatprovidesdataoff = 0;
456 pool->whatprovidesdataleft = 0;
460 /******************************************************************************/
463 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
465 * on-demand filling of provider information
466 * move queue data into whatprovidesdata
468 * returns: Offset into whatprovides
472 pool_queuetowhatprovides(Pool *pool, Queue *q)
475 int count = q->count;
477 if (count == 0) /* queue empty -> 1 */
480 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
481 if (pool->whatprovidesdataleft < count + 1)
483 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
484 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
485 pool->whatprovidesdataleft = count + 4096;
488 /* copy queue to next free slot */
489 off = pool->whatprovidesdataoff;
490 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
492 /* adapt count and ID_NULL-terminate */
493 pool->whatprovidesdataoff += count;
494 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
495 pool->whatprovidesdataleft -= count + 1;
501 /*************************************************************************/
503 #if defined(MULTI_SEMANTICS)
504 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
505 #elif defined(DEBIAN_SEMANTICS)
506 # define EVRCMP_DEPCMP EVRCMP_COMPARE
508 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
511 /* check if a package's nevr matches a dependency */
514 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
516 Reldep *rd = GETRELDEP(pool, d);
519 int flags = rd->flags;
528 return pool_match_nevr(pool, s, name);
530 if (pool_match_nevr(pool, s, name))
532 return pool_match_nevr(pool, s, evr);
535 if (!pool_match_nevr(pool, s, name))
537 return pool_match_nevr(pool, s, evr);
542 if (!pool_match_nevr(pool, s, name))
545 return (flags & REL_EQ) ? 1 : 0;
550 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
555 return (flags & REL_LT) ? 1 : 0;
557 return (flags & REL_EQ) ? 1 : 0;
559 return (flags & REL_GT) ? 1 : 0;
561 return (flags & REL_EQ) ? 1 : 0;
568 /* match (flags, evr) against provider (pflags, pevr) */
570 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
572 if (!pflags || !flags || pflags >= 8 || flags >= 8)
574 if (flags == 7 || pflags == 7)
575 return 1; /* rel provides every version */
576 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
577 return 1; /* both rels show in the same direction */
579 return (flags & pflags & REL_EQ) ? 1 : 0;
580 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
583 return (pflags & REL_EQ) ? 1 : 0;
585 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
587 return (flags & pflags & REL_EQ) ? 1 : 0;
589 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
591 return (flags & REL_EQ) ? 1 : 0;
598 /* match two dependencies (d1 = provider) */
601 pool_match_dep(Pool *pool, Id d1, Id d2)
611 rd2 = GETRELDEP(pool, d2);
612 return pool_match_dep(pool, d1, rd2->name);
614 rd1 = GETRELDEP(pool, d1);
617 return pool_match_dep(pool, rd1->name, d2);
619 rd2 = GETRELDEP(pool, d2);
620 /* first match name */
621 if (!pool_match_dep(pool, rd1->name, rd2->name))
623 /* name matches, check flags and evr */
624 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
630 * add packages fulfilling the relation to whatprovides array
631 * no exact providers, do range match
636 pool_addrelproviders(Pool *pool, Id d)
638 Reldep *rd = GETRELDEP(pool, d);
644 int flags = rd->flags;
649 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
653 /* special relation */
661 wp = pool_whatprovides(pool, name);
662 pp2 = pool_whatprovides_ptr(pool, evr);
663 pp = pool->whatprovidesdata + wp;
664 while ((p = *pp++) != 0)
666 for (pp3 = pp2; *pp3; pp3++)
670 queue_push(&plist, p); /* found it */
676 wp = pool_whatprovides(pool, name);
677 pp = pool->whatprovidesdata + wp;
679 wp = pool_whatprovides(pool, evr);
683 while ((p = *pp++) != 0)
684 queue_push(&plist, p);
686 pp = pool_whatprovides_ptr(pool, evr);
687 while ((p = *pp++) != 0)
688 queue_pushunique(&plist, p);
689 if (plist.count != cnt)
694 if (name == NAMESPACE_OTHERPROVIDERS)
696 wp = pool_whatprovides(pool, evr);
699 if (pool->nscallback)
701 /* ask callback which packages provide the dependency
703 * 1: the system (aka SYSTEMSOLVABLE)
704 * >1: set of packages, stored as offset on whatprovidesdata
706 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
710 queue_push(&plist, SYSTEMSOLVABLE);
714 /* small hack: make it possible to match <pkg>.src
715 * we have to iterate over the solvables as src packages do not
716 * provide anything, thus they are not indexed in our
717 * whatprovides hash */
721 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
723 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
725 if (pool_match_nevr(pool, s, name))
726 queue_push(&plist, p);
730 wp = pool_whatprovides(pool, name);
731 pp = pool->whatprovidesdata + wp;
732 while ((p = *pp++) != 0)
734 Solvable *s = pool->solvables + p;
736 queue_push(&plist, p);
741 case REL_FILECONFLICT:
742 pp = pool_whatprovides_ptr(pool, name);
743 while ((p = *pp++) != 0)
745 Id origd = MAKERELDEP(d);
746 Solvable *s = pool->solvables + p;
749 pidp = s->repo->idarraydata + s->provides;
750 while ((pid = *pidp++) != 0)
754 queue_push(&plist, p);
762 /* we can reuse an existing entry */
764 pool->whatprovides_rel[d] = wp;
770 /* simple version comparison relation */
772 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
774 pp = pool_whatprovides_ptr(pool, name);
775 while (ISRELDEP(name))
777 rd = GETRELDEP(pool, name);
780 while ((p = *pp++) != 0)
782 Solvable *s = pool->solvables + p;
785 /* no provides - check nevr */
786 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
787 queue_push(&plist, p);
790 /* solvable p provides name in some rels */
791 pidp = s->repo->idarraydata + s->provides;
792 while ((pid = *pidp++) != 0)
797 continue; /* wrong provides name */
798 if (pool->disttype == DISTTYPE_DEB)
799 continue; /* unversioned provides can never match versioned deps */
802 prd = GETRELDEP(pool, pid);
803 if (prd->name != name)
804 continue; /* wrong provides name */
805 /* right package, both deps are rels. check flags/evr */
806 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
810 continue; /* none of the providers matched */
811 queue_push(&plist, p);
813 /* make our system solvable provide all unknown rpmlib() stuff */
814 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
815 queue_push(&plist, SYSTEMSOLVABLE);
817 /* add providers to whatprovides */
819 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
821 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
824 return pool->whatprovides_rel[d];
827 /*************************************************************************/
830 pool_debug(Pool *pool, int type, const char *format, ...)
835 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
837 if ((pool->debugmask & type) == 0)
840 va_start(args, format);
841 if (!pool->debugcallback)
843 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
844 vprintf(format, args);
846 vfprintf(stderr, format, args);
849 vsnprintf(buf, sizeof(buf), format, args);
850 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
854 pool_setdebuglevel(Pool *pool, int level)
856 int mask = SOLV_DEBUG_RESULT;
858 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION;
860 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
862 mask |= SOLV_DEBUG_PROPAGATE;
864 mask |= SOLV_DEBUG_RULE_CREATION;
865 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
866 pool->debugmask = mask;
869 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
871 pool->debugcallback = debugcallback;
872 pool->debugcallbackdata = debugcallbackdata;
875 void pool_setdebugmask(Pool *pool, int mask)
877 pool->debugmask = mask;
880 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
882 pool->loadcallback = cb;
883 pool->loadcallbackdata = loadcbdata;
886 /*************************************************************************/
896 #define SEARCHFILES_BLOCK 127
899 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
903 struct searchfiles *csf;
905 while ((dep = *ida++) != 0)
908 while (ISRELDEP(dep))
911 sid = pool->ss.nstrings + GETRELID(dep);
912 if (MAPTST(&csf->seen, sid))
917 MAPSET(&csf->seen, sid);
918 rd = GETRELDEP(pool, dep);
921 else if (rd->flags == REL_NAMESPACE)
923 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
926 if (!csf || MAPTST(&csf->seen, sid))
931 MAPSET(&csf->seen, sid);
935 else if (rd->flags == REL_FILECONFLICT)
945 pool_addfileprovides_dep(pool, ids, csf, isf);
951 if (MAPTST(&csf->seen, dep))
953 MAPSET(&csf->seen, dep);
954 s = pool_id2str(pool, dep);
957 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
958 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
959 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
960 csf->ids[csf->nfiles] = dep;
961 sr = strrchr(s, '/');
962 csf->names[csf->nfiles] = solv_strdup(sr + 1);
963 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
965 strncpy(csf->dirs[csf->nfiles], s, sr - s);
966 csf->dirs[csf->nfiles][sr - s] = 0;
971 struct addfileprovides_cbdata {
985 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
987 struct addfileprovides_cbdata *cbd = cbdata;
990 if (!cbd->useddirs.size)
992 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
993 for (i = 0; i < cbd->nfiles; i++)
996 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1001 did = repodata_str2dir(data, cbd->dirs[i], 0);
1004 MAPSET(&cbd->useddirs, did);
1006 repodata_free_dircache(data);
1008 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1010 for (i = 0; i < cbd->nfiles; i++)
1012 if (cbd->dids[i] != value->id)
1014 if (!strcmp(cbd->names[i], value->str))
1017 if (i == cbd->nfiles)
1019 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1024 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1029 Queue fileprovidesq;
1030 int i, j, repoid, repodataid;
1031 int provstart, provend;
1033 int ndone, incomplete;
1038 cbd->nfiles = sf->nfiles;
1040 cbd->dirs = sf->dirs;
1041 cbd->names = sf->names;
1042 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1043 map_init(&cbd->providedids, pool->ss.nstrings);
1046 repo = repoonly ? repoonly : pool->repos[repoid];
1047 map_init(&donemap, pool->nsolvables);
1048 queue_init(&fileprovidesq);
1049 provstart = provend = 0;
1052 if (!repo || repo->disabled)
1054 if (repoonly || ++repoid == pool->nrepos)
1056 repo = pool->repos[repoid];
1060 FOR_REPODATAS(repo, repodataid, data)
1062 if (ndone >= repo->nsolvables)
1065 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1067 map_empty(&cbd->providedids);
1068 for (i = 0; i < fileprovidesq.count; i++)
1069 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1070 provstart = data->start;
1071 provend = data->end;
1072 for (i = 0; i < cbd->nfiles; i++)
1073 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1075 if (i == cbd->nfiles)
1077 /* great! no need to search files */
1078 for (p = data->start; p < data->end; p++)
1079 if (pool->solvables[p].repo == repo)
1081 if (MAPTST(&donemap, p))
1083 MAPSET(&donemap, p);
1090 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1093 if (data->start < provstart || data->end > provend)
1095 map_empty(&cbd->providedids);
1096 provstart = provend = 0;
1099 /* check if the data is incomplete */
1101 if (data->state == REPODATA_AVAILABLE)
1103 for (j = 1; j < data->nkeys; j++)
1104 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1106 if (j < data->nkeys)
1109 for (i = 0; i < cbd->nfiles; i++)
1110 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1111 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1113 for (i = 0; i < cbd->nfiles; i++)
1114 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1116 if (i < cbd->nfiles)
1122 map_init(&cbd->useddirs, 0);
1123 for (p = data->start; p < data->end; p++)
1124 if (pool->solvables[p].repo == repo)
1126 if (MAPTST(&donemap, p))
1128 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1131 MAPSET(&donemap, p);
1135 map_free(&cbd->useddirs);
1138 if (repoonly || ++repoid == pool->nrepos)
1140 repo = pool->repos[repoid];
1143 queue_free(&fileprovidesq);
1144 map_free(&cbd->providedids);
1148 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1151 Repo *installed, *repo;
1152 struct searchfiles sf, isf, *isfp;
1153 struct addfileprovides_cbdata cbd;
1157 installed = pool->installed;
1158 now = solv_timems(0);
1159 memset(&sf, 0, sizeof(sf));
1160 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1161 memset(&isf, 0, sizeof(isf));
1162 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1167 queue_empty(idqinst);
1168 isfp = installed ? &isf : 0;
1169 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1175 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1177 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1179 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1181 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1183 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1185 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1187 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1190 map_free(&isf.seen);
1191 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1196 for (i = 0; i < sf.nfiles; i++)
1197 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1199 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1201 for (i = 0; i < sf.nfiles; i++)
1202 queue_push(idq, sf.ids[i]);
1204 for (i = 0; i < sf.nfiles; i++)
1205 queue_push(idqinst, sf.ids[i]);
1207 for (i = 0; i < sf.nfiles; i++)
1209 solv_free(sf.dirs[i]);
1210 solv_free(sf.names[i]);
1213 solv_free(sf.names);
1218 for (i = 0; i < isf.nfiles; i++)
1219 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1222 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1223 if (installed && idqinst)
1224 for (i = 0; i < isf.nfiles; i++)
1225 queue_pushunique(idqinst, isf.ids[i]);
1227 for (i = 0; i < isf.nfiles; i++)
1229 solv_free(isf.dirs[i]);
1230 solv_free(isf.names[i]);
1232 solv_free(isf.dirs);
1233 solv_free(isf.names);
1235 solv_free(cbd.dids);
1236 pool_freewhatprovides(pool); /* as we have added provides */
1237 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1241 pool_addfileprovides(Pool *pool)
1243 pool_addfileprovides_queue(pool, 0, 0);
1247 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)
1251 if (pool->solvables[p].repo)
1252 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1255 /* FIXME: obey callback return value! */
1256 for (p = 1; p < pool->nsolvables; p++)
1257 if (pool->solvables[p].repo)
1258 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1262 pool_clear_pos(Pool *pool)
1264 memset(&pool->pos, 0, sizeof(pool->pos));
1269 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1273 pool->languagecache = solv_free(pool->languagecache);
1274 pool->languagecacheother = 0;
1275 if (pool->nlanguages)
1277 for (i = 0; i < pool->nlanguages; i++)
1278 free((char *)pool->languages[i]);
1279 free(pool->languages);
1281 pool->nlanguages = nlanguages;
1284 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1285 for (i = 0; i < pool->nlanguages; i++)
1286 pool->languages[i] = solv_strdup(languages[i]);
1290 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1296 if (!lang || !*lang)
1298 n = pool_id2str(pool, id);
1299 l = strlen(n) + strlen(lang) + 2;
1300 if (l > sizeof(buf))
1301 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1304 sprintf(p, "%s:%s", n, lang);
1305 id = pool_str2id(pool, p, create);
1312 pool_alloctmpspace(Pool *pool, int len)
1314 int n = pool->tmpspace.n;
1317 if (len > pool->tmpspace.len[n])
1319 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1320 pool->tmpspace.len[n] = len + 32;
1322 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1323 return pool->tmpspace.buf[n];
1327 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1332 n = oldn = pool->tmpspace.n;
1336 n = POOL_TMPSPACEBUF - 1;
1339 if (pool->tmpspace.buf[n] != space)
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 return pool->tmpspace.buf[n];
1353 pool_freetmpspace(Pool *pool, const char *space)
1355 int n = pool->tmpspace.n;
1358 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1359 if (pool->tmpspace.buf[n] == space)
1360 pool->tmpspace.n = n;
1364 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1368 l1 = str1 ? strlen(str1) : 0;
1369 l2 = str2 ? strlen(str2) : 0;
1370 l3 = str3 ? strlen(str3) : 0;
1371 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1392 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1397 l1 = str1 ? strlen(str1) : 0;
1398 l2 = str2 ? strlen(str2) : 0;
1399 l3 = str3 ? strlen(str3) : 0;
1400 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1404 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1427 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1432 s = pool_alloctmpspace(pool, 2 * len + 1);
1433 solv_bin2hex(buf, len, s);
1437 /*******************************************************************/
1449 struct mptree *mptree;
1460 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1462 struct ducbdata *cbd = cbdata;
1465 if (data != cbd->olddata)
1467 Id dn, mp, comp, *dirmap, *dirs;
1469 const char *compstr;
1470 struct mptree *mptree;
1472 /* create map from dir to mptree */
1473 cbd->dirmap = solv_free(cbd->dirmap);
1475 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1476 mptree = cbd->mptree;
1478 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1492 if (!mptree[mp].child)
1497 if (data->localpool)
1498 compstr = stringpool_id2str(&data->spool, comp);
1500 compstr = pool_id2str(data->repo->pool, comp);
1501 compl = strlen(compstr);
1502 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1503 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1505 dirmap[dn] = i ? i : -mp;
1507 /* change dirmap to point to mountpoint instead of mptree */
1508 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1511 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1513 cbd->dirmap = dirmap;
1514 cbd->nmap = data->dirpool.ndirs;
1515 cbd->olddata = data;
1518 if (value->id < 0 || value->id >= cbd->nmap)
1520 mp = cbd->dirmap[value->id];
1523 if (cbd->addsub > 0)
1525 cbd->mps[mp].kbytes += value->num;
1526 cbd->mps[mp].files += value->num2;
1530 cbd->mps[mp].kbytes -= value->num;
1531 cbd->mps[mp].files -= value->num2;
1537 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1540 if (mptree[pos].mountpoint == -1)
1541 mptree[pos].mountpoint = mountpoint;
1543 mountpoint = mptree[pos].mountpoint;
1544 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1545 propagate_mountpoints(mptree, i, mountpoint);
1548 #define MPTREE_BLOCK 15
1551 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1554 const char *path, *compstr;
1555 struct mptree *mptree;
1559 struct ducbdata cbd;
1563 Repo *oldinstalled = pool->installed;
1565 memset(&ignoredu, 0, sizeof(ignoredu));
1572 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1575 mptree[0].sibling = 0;
1576 mptree[0].child = 0;
1578 mptree[0].compl = 0;
1579 mptree[0].mountpoint = -1;
1582 /* create component tree */
1583 for (mp = 0; mp < nmps; mp++)
1588 path = mps[mp].path;
1593 if ((p = strchr(path, '/')) == 0)
1596 compl = strlen(compstr);
1607 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1608 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1612 /* create new node */
1613 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1615 mptree[i].sibling = mptree[pos].child;
1616 mptree[i].child = 0;
1617 mptree[i].comp = compstr;
1618 mptree[i].compl = compl;
1619 mptree[i].mountpoint = -1;
1620 mptree[pos].child = i;
1624 mptree[pos].mountpoint = mp;
1627 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1630 for (i = 0; i < nmptree; i++)
1632 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1633 printf("#%d child: %d\n", i, mptree[i].child);
1634 printf("#%d comp: %s\n", i, mptree[i].comp);
1635 printf("#%d compl: %d\n", i, mptree[i].compl);
1636 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1640 cbd.mptree = mptree;
1642 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1644 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1646 if (!MAPTST(installedmap, sp))
1649 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1650 if (!cbd.hasdu && oldinstalled)
1653 /* no du data available, ignore data of all installed solvables we obsolete */
1655 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1658 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1659 while ((obs = *obsp++) != 0)
1660 FOR_PROVIDES(op, opp, obs)
1661 if (op >= oldinstalled->start && op < oldinstalled->end)
1662 MAPSET(&ignoredu, op - oldinstalled->start);
1664 FOR_PROVIDES(op, opp, s->name)
1665 if (pool->solvables[op].name == s->name)
1666 if (op >= oldinstalled->start && op < oldinstalled->end)
1667 MAPSET(&ignoredu, op - oldinstalled->start);
1673 /* assumes we allways have du data for installed solvables */
1674 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1676 if (MAPTST(installedmap, sp))
1678 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1680 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1684 map_free(&ignoredu);
1685 solv_free(cbd.dirmap);
1690 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1695 Repo *oldinstalled = pool->installed;
1697 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1699 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1701 if (!MAPTST(installedmap, sp))
1703 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1707 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1709 if (MAPTST(installedmap, sp))
1711 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1719 * 2: conflicts with installed
1720 * 8: interesting (only true if installed)
1724 static inline Id dep2name(Pool *pool, Id dep)
1726 while (ISRELDEP(dep))
1728 Reldep *rd = rd = GETRELDEP(pool, dep);
1734 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1737 Solvable *sn = pool->solvables + n;
1739 FOR_PROVIDES(p, pp, sn->name)
1741 Solvable *s = pool->solvables + p;
1742 if (s->name != sn->name || s->arch != sn->arch)
1744 if ((map[p] & 9) != 9)
1746 if (pool_match_nevr(pool, pool->solvables + p, con))
1748 return 1; /* found installed package that doesn't conflict */
1753 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1757 FOR_PROVIDES(p, pp, dep)
1759 if (p == SYSTEMSOLVABLE)
1760 return 1; /* always boring, as never constraining */
1761 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1763 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1764 if (providedbyinstalled_multiversion(pool, map, p, dep))
1766 if ((map[p] & 9) == 9)
1774 * pool_trivial_installable - calculate if a set of solvables is
1775 * trivial installable without any other installs/deinstalls of
1776 * packages not belonging to the set.
1778 * the state is returned in the result queue:
1779 * 1: solvable is installable without any other package changes
1780 * 0: solvable is not installable
1781 * -1: solvable is installable, but doesn't constrain any installed packages
1785 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1788 Id p, *dp, con, *conp, req, *reqp;
1792 map = solv_calloc(pool->nsolvables, 1);
1793 for (p = 1; p < pool->nsolvables; p++)
1795 if (!MAPTST(installedmap, p))
1798 s = pool->solvables + p;
1801 conp = s->repo->idarraydata + s->conflicts;
1802 while ((con = *conp++) != 0)
1804 dp = pool_whatprovides_ptr(pool, con);
1806 map[p] |= 2; /* XXX: self conflict ? */
1809 for (i = 0; i < pkgs->count; i++)
1810 map[pkgs->elements[i]] = 16;
1812 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1814 if (i == pkgs->count)
1816 p = pkgs->elements[i];
1817 if ((map[p] & 16) == 0)
1819 if ((map[p] & 2) != 0)
1824 s = pool->solvables + p;
1828 reqp = s->repo->idarraydata + s->requires;
1829 while ((req = *reqp++) != 0)
1831 if (req == SOLVABLE_PREREQMARKER)
1833 r = providedbyinstalled(pool, map, req, 0, 0);
1836 /* decided and miss */
1840 m |= r; /* 1 | 9 | 16 | 17 */
1849 int ispatch = 0; /* see solver.c patch handling */
1851 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1853 conp = s->repo->idarraydata + s->conflicts;
1854 while ((con = *conp++) != 0)
1856 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1861 if ((m == 1 || m == 17) && ISRELDEP(con))
1863 con = dep2name(pool, con);
1864 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1869 continue; /* found a conflict */
1872 if (s->repo && s->repo != oldinstalled)
1874 Id p2, obs, *obsp, *pp;
1878 obsp = s->repo->idarraydata + s->obsoletes;
1879 while ((obs = *obsp++) != 0)
1881 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1890 FOR_PROVIDES(p2, pp, s->name)
1892 s2 = pool->solvables + p2;
1893 if (s2->name == s->name && (map[p2] & 1) != 0)
1910 queue_init_clone(res, pkgs);
1911 for (i = 0; i < pkgs->count; i++)
1913 m = map[pkgs->elements[i]];
1920 res->elements[i] = r;
1926 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1928 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1932 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1934 if (entry == SOLVID_POS && pool->pos.repo)
1935 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1938 return solvable_lookup_str(pool->solvables + entry, keyname);
1942 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1944 if (entry == SOLVID_POS && pool->pos.repo)
1946 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1947 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1948 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1952 return solvable_lookup_id(pool->solvables + entry, keyname);
1956 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1958 if (entry == SOLVID_POS && pool->pos.repo)
1961 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1967 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1971 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1973 if (entry == SOLVID_POS && pool->pos.repo)
1974 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1977 return solvable_lookup_void(pool->solvables + entry, keyname);
1980 const unsigned char *
1981 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1983 if (entry == SOLVID_POS && pool->pos.repo)
1984 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1987 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1991 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1993 if (entry == SOLVID_POS && pool->pos.repo)
1995 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1996 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2000 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2004 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2006 int hadhashes = pool->relhashtbl ? 1 : 0;
2012 if (!conflicts->count)
2014 pool_freewhatprovides(pool);
2015 for (i = 0; i < conflicts->count; i += 5)
2017 fn = conflicts->elements[i];
2018 p = conflicts->elements[i + 1];
2019 md5 = conflicts->elements[i + 2];
2020 q = conflicts->elements[i + 3];
2021 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2022 s = pool->solvables + p;
2025 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2026 s = pool->solvables + q;
2029 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2032 pool_freeidhashes(pool);