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, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
354 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
355 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);
356 if (pool->ss.stringhashmask || pool->relhashmask)
357 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)));
359 pool_freeidhashes(pool); /* XXX: should not be here! */
360 pool_freewhatprovides(pool);
361 num = pool->ss.nstrings;
362 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
363 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
365 /* count providers for each name */
366 for (i = pool->nsolvables - 1; i > 0; i--)
369 s = pool->solvables + i;
370 if (!s->provides || !s->repo || s->repo->disabled)
372 /* we always need the installed solvable in the whatprovides data,
373 otherwise obsoletes/conflicts on them won't work */
374 if (s->repo != installed && !pool_installable(pool, s))
376 pp = s->repo->idarraydata + s->provides;
377 while ((id = *pp++) != 0)
381 Reldep *rd = GETRELDEP(pool, id);
384 whatprovides[id]++; /* inc count of providers */
388 off = 2; /* first entry is undef, second is empty list */
389 np = 0; /* number of names provided */
390 for (i = 0, idp = whatprovides; i < num; i++, idp++)
393 if (!n) /* no providers */
395 off += n; /* make space for all providers */
396 *idp = off++; /* now idp points to terminating zero */
397 np++; /* inc # of provider 'slots' for stats */
400 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
402 /* reserve some space for relation data */
403 extra = 2 * pool->nrels;
407 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
409 /* alloc space for all providers + extra */
410 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
412 /* now fill data for all provides */
413 for (i = pool->nsolvables - 1; i > 0; i--)
416 s = pool->solvables + i;
417 if (!s->provides || !s->repo || s->repo->disabled)
419 if (s->repo != installed && !pool_installable(pool, s))
422 /* for all provides of this solvable */
423 pp = s->repo->idarraydata + s->provides;
424 while ((id = *pp++) != 0)
428 Reldep *rd = GETRELDEP(pool, id);
431 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
432 if (*d != i) /* don't add same solvable twice */
439 pool->whatprovidesdata = whatprovidesdata;
440 pool->whatprovidesdataoff = off;
441 pool->whatprovidesdataleft = extra;
442 pool_shrink_whatprovides(pool);
443 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)));
444 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
448 * free all of our whatprovides data
449 * be careful, everything internalized with pool_queuetowhatprovides is
453 pool_freewhatprovides(Pool *pool)
455 pool->whatprovides = solv_free(pool->whatprovides);
456 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
457 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
458 pool->whatprovidesdataoff = 0;
459 pool->whatprovidesdataleft = 0;
463 /******************************************************************************/
466 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
468 * on-demand filling of provider information
469 * move queue data into whatprovidesdata
471 * returns: Offset into whatprovides
475 pool_queuetowhatprovides(Pool *pool, Queue *q)
478 int count = q->count;
480 if (count == 0) /* queue empty -> 1 */
483 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
484 if (pool->whatprovidesdataleft < count + 1)
486 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
487 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
488 pool->whatprovidesdataleft = count + 4096;
491 /* copy queue to next free slot */
492 off = pool->whatprovidesdataoff;
493 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
495 /* adapt count and ID_NULL-terminate */
496 pool->whatprovidesdataoff += count;
497 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
498 pool->whatprovidesdataleft -= count + 1;
504 /*************************************************************************/
506 #if defined(MULTI_SEMANTICS)
507 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
508 #elif defined(DEBIAN_SEMANTICS)
509 # define EVRCMP_DEPCMP EVRCMP_COMPARE
511 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
514 /* check if a package's nevr matches a dependency */
517 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
519 Reldep *rd = GETRELDEP(pool, d);
522 int flags = rd->flags;
531 return pool_match_nevr(pool, s, name);
533 if (pool_match_nevr(pool, s, name))
535 return pool_match_nevr(pool, s, evr);
538 if (!pool_match_nevr(pool, s, name))
540 return pool_match_nevr(pool, s, evr);
545 if (!pool_match_nevr(pool, s, name))
548 return (flags & REL_EQ) ? 1 : 0;
553 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
558 return (flags & REL_LT) ? 1 : 0;
560 return (flags & REL_EQ) ? 1 : 0;
562 return (flags & REL_GT) ? 1 : 0;
564 return (flags & REL_EQ) ? 1 : 0;
571 /* match (flags, evr) against provider (pflags, pevr) */
573 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
575 if (!pflags || !flags || pflags >= 8 || flags >= 8)
577 if (flags == 7 || pflags == 7)
578 return 1; /* rel provides every version */
579 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
580 return 1; /* both rels show in the same direction */
582 return (flags & pflags & REL_EQ) ? 1 : 0;
583 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
586 return (pflags & REL_EQ) ? 1 : 0;
588 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
590 return (flags & pflags & REL_EQ) ? 1 : 0;
592 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
594 return (flags & REL_EQ) ? 1 : 0;
601 /* match two dependencies (d1 = provider) */
604 pool_match_dep(Pool *pool, Id d1, Id d2)
614 rd2 = GETRELDEP(pool, d2);
615 return pool_match_dep(pool, d1, rd2->name);
617 rd1 = GETRELDEP(pool, d1);
620 return pool_match_dep(pool, rd1->name, d2);
622 rd2 = GETRELDEP(pool, d2);
623 /* first match name */
624 if (!pool_match_dep(pool, rd1->name, rd2->name))
626 /* name matches, check flags and evr */
627 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
633 * add packages fulfilling the relation to whatprovides array
634 * no exact providers, do range match
639 pool_addrelproviders(Pool *pool, Id d)
641 Reldep *rd = GETRELDEP(pool, d);
647 int flags = rd->flags;
652 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
656 /* special relation */
664 wp = pool_whatprovides(pool, name);
665 pp2 = pool_whatprovides_ptr(pool, evr);
666 pp = pool->whatprovidesdata + wp;
667 while ((p = *pp++) != 0)
669 for (pp3 = pp2; *pp3; pp3++)
673 queue_push(&plist, p); /* found it */
679 wp = pool_whatprovides(pool, name);
680 pp = pool->whatprovidesdata + wp;
682 wp = pool_whatprovides(pool, evr);
686 while ((p = *pp++) != 0)
687 queue_push(&plist, p);
689 pp = pool_whatprovides_ptr(pool, evr);
690 while ((p = *pp++) != 0)
691 queue_pushunique(&plist, p);
692 if (plist.count != cnt)
697 if (name == NAMESPACE_OTHERPROVIDERS)
699 wp = pool_whatprovides(pool, evr);
702 if (pool->nscallback)
704 /* ask callback which packages provide the dependency
706 * 1: the system (aka SYSTEMSOLVABLE)
707 * >1: set of packages, stored as offset on whatprovidesdata
709 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
713 queue_push(&plist, SYSTEMSOLVABLE);
717 /* small hack: make it possible to match <pkg>.src
718 * we have to iterate over the solvables as src packages do not
719 * provide anything, thus they are not indexed in our
720 * whatprovides hash */
724 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
726 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
728 if (pool_match_nevr(pool, s, name))
729 queue_push(&plist, p);
733 wp = pool_whatprovides(pool, name);
734 pp = pool->whatprovidesdata + wp;
735 while ((p = *pp++) != 0)
737 Solvable *s = pool->solvables + p;
739 queue_push(&plist, p);
744 case REL_FILECONFLICT:
745 pp = pool_whatprovides_ptr(pool, name);
746 while ((p = *pp++) != 0)
748 Id origd = MAKERELDEP(d);
749 Solvable *s = pool->solvables + p;
752 pidp = s->repo->idarraydata + s->provides;
753 while ((pid = *pidp++) != 0)
757 queue_push(&plist, p);
765 /* we can reuse an existing entry */
767 pool->whatprovides_rel[d] = wp;
773 /* simple version comparison relation */
775 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
777 pp = pool_whatprovides_ptr(pool, name);
778 while (ISRELDEP(name))
780 rd = GETRELDEP(pool, name);
783 while ((p = *pp++) != 0)
785 Solvable *s = pool->solvables + p;
788 /* no provides - check nevr */
789 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
790 queue_push(&plist, p);
793 /* solvable p provides name in some rels */
794 pidp = s->repo->idarraydata + s->provides;
795 while ((pid = *pidp++) != 0)
800 continue; /* wrong provides name */
801 if (pool->disttype == DISTTYPE_DEB)
802 continue; /* unversioned provides can never match versioned deps */
805 prd = GETRELDEP(pool, pid);
806 if (prd->name != name)
807 continue; /* wrong provides name */
808 /* right package, both deps are rels. check flags/evr */
809 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
813 continue; /* none of the providers matched */
814 queue_push(&plist, p);
816 /* make our system solvable provide all unknown rpmlib() stuff */
817 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
818 queue_push(&plist, SYSTEMSOLVABLE);
820 /* add providers to whatprovides */
822 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
824 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
827 return pool->whatprovides_rel[d];
830 /*************************************************************************/
833 pool_debug(Pool *pool, int type, const char *format, ...)
838 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
840 if ((pool->debugmask & type) == 0)
843 va_start(args, format);
844 if (!pool->debugcallback)
846 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
847 vprintf(format, args);
849 vfprintf(stderr, format, args);
852 vsnprintf(buf, sizeof(buf), format, args);
853 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
857 pool_setdebuglevel(Pool *pool, int level)
859 int mask = SOLV_DEBUG_RESULT;
861 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION;
863 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
865 mask |= SOLV_DEBUG_PROPAGATE;
867 mask |= SOLV_DEBUG_RULE_CREATION;
868 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
869 pool->debugmask = mask;
872 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
874 pool->debugcallback = debugcallback;
875 pool->debugcallbackdata = debugcallbackdata;
878 void pool_setdebugmask(Pool *pool, int mask)
880 pool->debugmask = mask;
883 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
885 pool->loadcallback = cb;
886 pool->loadcallbackdata = loadcbdata;
889 /*************************************************************************/
899 #define SEARCHFILES_BLOCK 127
902 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
906 struct searchfiles *csf;
908 while ((dep = *ida++) != 0)
911 while (ISRELDEP(dep))
914 sid = pool->ss.nstrings + GETRELID(dep);
915 if (MAPTST(&csf->seen, sid))
920 MAPSET(&csf->seen, sid);
921 rd = GETRELDEP(pool, dep);
924 else if (rd->flags == REL_NAMESPACE)
926 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
929 if (!csf || MAPTST(&csf->seen, sid))
934 MAPSET(&csf->seen, sid);
938 else if (rd->flags == REL_FILECONFLICT)
948 pool_addfileprovides_dep(pool, ids, csf, isf);
954 if (MAPTST(&csf->seen, dep))
956 MAPSET(&csf->seen, dep);
957 s = pool_id2str(pool, dep);
960 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
961 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
962 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
963 csf->ids[csf->nfiles] = dep;
964 sr = strrchr(s, '/');
965 csf->names[csf->nfiles] = solv_strdup(sr + 1);
966 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
968 strncpy(csf->dirs[csf->nfiles], s, sr - s);
969 csf->dirs[csf->nfiles][sr - s] = 0;
974 struct addfileprovides_cbdata {
988 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
990 struct addfileprovides_cbdata *cbd = cbdata;
993 if (!cbd->useddirs.size)
995 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
996 for (i = 0; i < cbd->nfiles; i++)
999 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1004 did = repodata_str2dir(data, cbd->dirs[i], 0);
1007 MAPSET(&cbd->useddirs, did);
1009 repodata_free_dircache(data);
1011 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1013 for (i = 0; i < cbd->nfiles; i++)
1015 if (cbd->dids[i] != value->id)
1017 if (!strcmp(cbd->names[i], value->str))
1020 if (i == cbd->nfiles)
1022 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1027 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1032 Queue fileprovidesq;
1033 int i, j, repoid, repodataid;
1034 int provstart, provend;
1036 int ndone, incomplete;
1041 cbd->nfiles = sf->nfiles;
1043 cbd->dirs = sf->dirs;
1044 cbd->names = sf->names;
1045 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1046 map_init(&cbd->providedids, pool->ss.nstrings);
1049 repo = repoonly ? repoonly : pool->repos[repoid];
1050 map_init(&donemap, pool->nsolvables);
1051 queue_init(&fileprovidesq);
1052 provstart = provend = 0;
1055 if (!repo || repo->disabled)
1057 if (repoonly || ++repoid == pool->nrepos)
1059 repo = pool->repos[repoid];
1063 FOR_REPODATAS(repo, repodataid, data)
1065 if (ndone >= repo->nsolvables)
1068 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1070 map_empty(&cbd->providedids);
1071 for (i = 0; i < fileprovidesq.count; i++)
1072 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1073 provstart = data->start;
1074 provend = data->end;
1075 for (i = 0; i < cbd->nfiles; i++)
1076 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1078 if (i == cbd->nfiles)
1080 /* great! no need to search files */
1081 for (p = data->start; p < data->end; p++)
1082 if (pool->solvables[p].repo == repo)
1084 if (MAPTST(&donemap, p))
1086 MAPSET(&donemap, p);
1093 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1096 if (data->start < provstart || data->end > provend)
1098 map_empty(&cbd->providedids);
1099 provstart = provend = 0;
1102 /* check if the data is incomplete */
1104 if (data->state == REPODATA_AVAILABLE)
1106 for (j = 1; j < data->nkeys; j++)
1107 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1109 if (j < data->nkeys)
1112 for (i = 0; i < cbd->nfiles; i++)
1113 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1114 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1116 for (i = 0; i < cbd->nfiles; i++)
1117 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1119 if (i < cbd->nfiles)
1125 map_init(&cbd->useddirs, 0);
1126 for (p = data->start; p < data->end; p++)
1127 if (pool->solvables[p].repo == repo)
1129 if (MAPTST(&donemap, p))
1131 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1134 MAPSET(&donemap, p);
1138 map_free(&cbd->useddirs);
1141 if (repoonly || ++repoid == pool->nrepos)
1143 repo = pool->repos[repoid];
1146 queue_free(&fileprovidesq);
1147 map_free(&cbd->providedids);
1151 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1154 Repo *installed, *repo;
1155 struct searchfiles sf, isf, *isfp;
1156 struct addfileprovides_cbdata cbd;
1160 installed = pool->installed;
1161 now = solv_timems(0);
1162 memset(&sf, 0, sizeof(sf));
1163 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1164 memset(&isf, 0, sizeof(isf));
1165 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1170 queue_empty(idqinst);
1171 isfp = installed ? &isf : 0;
1172 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1178 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1180 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1182 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1184 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1186 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1188 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1190 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1193 map_free(&isf.seen);
1194 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1199 for (i = 0; i < sf.nfiles; i++)
1200 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1202 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1204 for (i = 0; i < sf.nfiles; i++)
1205 queue_push(idq, sf.ids[i]);
1207 for (i = 0; i < sf.nfiles; i++)
1208 queue_push(idqinst, sf.ids[i]);
1210 for (i = 0; i < sf.nfiles; i++)
1212 solv_free(sf.dirs[i]);
1213 solv_free(sf.names[i]);
1216 solv_free(sf.names);
1221 for (i = 0; i < isf.nfiles; i++)
1222 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1225 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1226 if (installed && idqinst)
1227 for (i = 0; i < isf.nfiles; i++)
1228 queue_pushunique(idqinst, isf.ids[i]);
1230 for (i = 0; i < isf.nfiles; i++)
1232 solv_free(isf.dirs[i]);
1233 solv_free(isf.names[i]);
1235 solv_free(isf.dirs);
1236 solv_free(isf.names);
1238 solv_free(cbd.dids);
1239 pool_freewhatprovides(pool); /* as we have added provides */
1240 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1244 pool_addfileprovides(Pool *pool)
1246 pool_addfileprovides_queue(pool, 0, 0);
1250 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)
1254 if (pool->solvables[p].repo)
1255 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1258 /* FIXME: obey callback return value! */
1259 for (p = 1; p < pool->nsolvables; p++)
1260 if (pool->solvables[p].repo)
1261 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1265 pool_clear_pos(Pool *pool)
1267 memset(&pool->pos, 0, sizeof(pool->pos));
1272 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1276 pool->languagecache = solv_free(pool->languagecache);
1277 pool->languagecacheother = 0;
1278 if (pool->nlanguages)
1280 for (i = 0; i < pool->nlanguages; i++)
1281 free((char *)pool->languages[i]);
1282 free(pool->languages);
1284 pool->nlanguages = nlanguages;
1287 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1288 for (i = 0; i < pool->nlanguages; i++)
1289 pool->languages[i] = solv_strdup(languages[i]);
1293 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1299 if (!lang || !*lang)
1301 n = pool_id2str(pool, id);
1302 l = strlen(n) + strlen(lang) + 2;
1303 if (l > sizeof(buf))
1304 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1307 sprintf(p, "%s:%s", n, lang);
1308 id = pool_str2id(pool, p, create);
1315 pool_alloctmpspace(Pool *pool, int len)
1317 int n = pool->tmpspace.n;
1320 if (len > pool->tmpspace.len[n])
1322 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1323 pool->tmpspace.len[n] = len + 32;
1325 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1326 return pool->tmpspace.buf[n];
1330 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1335 n = oldn = pool->tmpspace.n;
1339 n = POOL_TMPSPACEBUF - 1;
1342 if (pool->tmpspace.buf[n] != space)
1344 if (len > pool->tmpspace.len[n])
1346 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1347 pool->tmpspace.len[n] = len + 32;
1349 return pool->tmpspace.buf[n];
1356 pool_freetmpspace(Pool *pool, const char *space)
1358 int n = pool->tmpspace.n;
1361 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1362 if (pool->tmpspace.buf[n] == space)
1363 pool->tmpspace.n = n;
1367 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1371 l1 = str1 ? strlen(str1) : 0;
1372 l2 = str2 ? strlen(str2) : 0;
1373 l3 = str3 ? strlen(str3) : 0;
1374 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1395 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1400 l1 = str1 ? strlen(str1) : 0;
1401 l2 = str2 ? strlen(str2) : 0;
1402 l3 = str3 ? strlen(str3) : 0;
1403 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1407 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1430 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1435 s = pool_alloctmpspace(pool, 2 * len + 1);
1436 solv_bin2hex(buf, len, s);
1440 /*******************************************************************/
1452 struct mptree *mptree;
1463 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1465 struct ducbdata *cbd = cbdata;
1468 if (data != cbd->olddata)
1470 Id dn, mp, comp, *dirmap, *dirs;
1472 const char *compstr;
1473 struct mptree *mptree;
1475 /* create map from dir to mptree */
1476 cbd->dirmap = solv_free(cbd->dirmap);
1478 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1479 mptree = cbd->mptree;
1481 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1495 if (!mptree[mp].child)
1500 if (data->localpool)
1501 compstr = stringpool_id2str(&data->spool, comp);
1503 compstr = pool_id2str(data->repo->pool, comp);
1504 compl = strlen(compstr);
1505 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1506 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1508 dirmap[dn] = i ? i : -mp;
1510 /* change dirmap to point to mountpoint instead of mptree */
1511 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1514 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1516 cbd->dirmap = dirmap;
1517 cbd->nmap = data->dirpool.ndirs;
1518 cbd->olddata = data;
1521 if (value->id < 0 || value->id >= cbd->nmap)
1523 mp = cbd->dirmap[value->id];
1526 if (cbd->addsub > 0)
1528 cbd->mps[mp].kbytes += value->num;
1529 cbd->mps[mp].files += value->num2;
1533 cbd->mps[mp].kbytes -= value->num;
1534 cbd->mps[mp].files -= value->num2;
1540 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1543 if (mptree[pos].mountpoint == -1)
1544 mptree[pos].mountpoint = mountpoint;
1546 mountpoint = mptree[pos].mountpoint;
1547 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1548 propagate_mountpoints(mptree, i, mountpoint);
1551 #define MPTREE_BLOCK 15
1554 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1557 const char *path, *compstr;
1558 struct mptree *mptree;
1562 struct ducbdata cbd;
1566 Repo *oldinstalled = pool->installed;
1568 memset(&ignoredu, 0, sizeof(ignoredu));
1575 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1578 mptree[0].sibling = 0;
1579 mptree[0].child = 0;
1581 mptree[0].compl = 0;
1582 mptree[0].mountpoint = -1;
1585 /* create component tree */
1586 for (mp = 0; mp < nmps; mp++)
1591 path = mps[mp].path;
1596 if ((p = strchr(path, '/')) == 0)
1599 compl = strlen(compstr);
1610 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1611 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1615 /* create new node */
1616 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1618 mptree[i].sibling = mptree[pos].child;
1619 mptree[i].child = 0;
1620 mptree[i].comp = compstr;
1621 mptree[i].compl = compl;
1622 mptree[i].mountpoint = -1;
1623 mptree[pos].child = i;
1627 mptree[pos].mountpoint = mp;
1630 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1633 for (i = 0; i < nmptree; i++)
1635 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1636 printf("#%d child: %d\n", i, mptree[i].child);
1637 printf("#%d comp: %s\n", i, mptree[i].comp);
1638 printf("#%d compl: %d\n", i, mptree[i].compl);
1639 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1643 cbd.mptree = mptree;
1645 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1647 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1649 if (!MAPTST(installedmap, sp))
1652 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1653 if (!cbd.hasdu && oldinstalled)
1656 /* no du data available, ignore data of all installed solvables we obsolete */
1658 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1661 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1662 while ((obs = *obsp++) != 0)
1663 FOR_PROVIDES(op, opp, obs)
1664 if (op >= oldinstalled->start && op < oldinstalled->end)
1665 MAPSET(&ignoredu, op - oldinstalled->start);
1667 FOR_PROVIDES(op, opp, s->name)
1668 if (pool->solvables[op].name == s->name)
1669 if (op >= oldinstalled->start && op < oldinstalled->end)
1670 MAPSET(&ignoredu, op - oldinstalled->start);
1676 /* assumes we allways have du data for installed solvables */
1677 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1679 if (MAPTST(installedmap, sp))
1681 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1683 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1687 map_free(&ignoredu);
1688 solv_free(cbd.dirmap);
1693 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1698 Repo *oldinstalled = pool->installed;
1700 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1702 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1704 if (!MAPTST(installedmap, sp))
1706 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1710 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1712 if (MAPTST(installedmap, sp))
1714 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1722 * 2: conflicts with installed
1723 * 8: interesting (only true if installed)
1727 static inline Id dep2name(Pool *pool, Id dep)
1729 while (ISRELDEP(dep))
1731 Reldep *rd = rd = GETRELDEP(pool, dep);
1737 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1740 Solvable *sn = pool->solvables + n;
1742 FOR_PROVIDES(p, pp, sn->name)
1744 Solvable *s = pool->solvables + p;
1745 if (s->name != sn->name || s->arch != sn->arch)
1747 if ((map[p] & 9) != 9)
1749 if (pool_match_nevr(pool, pool->solvables + p, con))
1751 return 1; /* found installed package that doesn't conflict */
1756 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1760 FOR_PROVIDES(p, pp, dep)
1762 if (p == SYSTEMSOLVABLE)
1763 return 1; /* always boring, as never constraining */
1764 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1766 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1767 if (providedbyinstalled_multiversion(pool, map, p, dep))
1769 if ((map[p] & 9) == 9)
1777 * pool_trivial_installable - calculate if a set of solvables is
1778 * trivial installable without any other installs/deinstalls of
1779 * packages not belonging to the set.
1781 * the state is returned in the result queue:
1782 * 1: solvable is installable without any other package changes
1783 * 0: solvable is not installable
1784 * -1: solvable is installable, but doesn't constrain any installed packages
1788 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1791 Id p, *dp, con, *conp, req, *reqp;
1795 map = solv_calloc(pool->nsolvables, 1);
1796 for (p = 1; p < pool->nsolvables; p++)
1798 if (!MAPTST(installedmap, p))
1801 s = pool->solvables + p;
1804 conp = s->repo->idarraydata + s->conflicts;
1805 while ((con = *conp++) != 0)
1807 dp = pool_whatprovides_ptr(pool, con);
1809 map[p] |= 2; /* XXX: self conflict ? */
1812 for (i = 0; i < pkgs->count; i++)
1813 map[pkgs->elements[i]] = 16;
1815 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1817 if (i == pkgs->count)
1819 p = pkgs->elements[i];
1820 if ((map[p] & 16) == 0)
1822 if ((map[p] & 2) != 0)
1827 s = pool->solvables + p;
1831 reqp = s->repo->idarraydata + s->requires;
1832 while ((req = *reqp++) != 0)
1834 if (req == SOLVABLE_PREREQMARKER)
1836 r = providedbyinstalled(pool, map, req, 0, 0);
1839 /* decided and miss */
1843 m |= r; /* 1 | 9 | 16 | 17 */
1852 int ispatch = 0; /* see solver.c patch handling */
1854 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
1856 conp = s->repo->idarraydata + s->conflicts;
1857 while ((con = *conp++) != 0)
1859 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1864 if ((m == 1 || m == 17) && ISRELDEP(con))
1866 con = dep2name(pool, con);
1867 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1872 continue; /* found a conflict */
1875 if (s->repo && s->repo != oldinstalled)
1877 Id p2, obs, *obsp, *pp;
1881 obsp = s->repo->idarraydata + s->obsoletes;
1882 while ((obs = *obsp++) != 0)
1884 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1893 FOR_PROVIDES(p2, pp, s->name)
1895 s2 = pool->solvables + p2;
1896 if (s2->name == s->name && (map[p2] & 1) != 0)
1913 queue_init_clone(res, pkgs);
1914 for (i = 0; i < pkgs->count; i++)
1916 m = map[pkgs->elements[i]];
1923 res->elements[i] = r;
1929 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1931 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1935 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1937 if (entry == SOLVID_POS && pool->pos.repo)
1938 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1941 return solvable_lookup_str(pool->solvables + entry, keyname);
1945 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1947 if (entry == SOLVID_POS && pool->pos.repo)
1949 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1950 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1951 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1955 return solvable_lookup_id(pool->solvables + entry, keyname);
1959 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1961 if (entry == SOLVID_POS && pool->pos.repo)
1964 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1970 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1974 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1976 if (entry == SOLVID_POS && pool->pos.repo)
1977 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1980 return solvable_lookup_void(pool->solvables + entry, keyname);
1983 const unsigned char *
1984 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1986 if (entry == SOLVID_POS && pool->pos.repo)
1987 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1990 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1994 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1996 if (entry == SOLVID_POS && pool->pos.repo)
1998 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1999 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
2003 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2007 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2009 int hadhashes = pool->relhashtbl ? 1 : 0;
2015 if (!conflicts->count)
2017 pool_freewhatprovides(pool);
2018 for (i = 0; i < conflicts->count; i += 5)
2020 fn = conflicts->elements[i];
2021 p = conflicts->elements[i + 1];
2022 md5 = conflicts->elements[i + 2];
2023 q = conflicts->elements[i + 3];
2024 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2025 s = pool->solvables + p;
2028 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2029 s = pool->solvables + q;
2032 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2035 pool_freeidhashes(pool);