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);
58 queue_init(&pool->pooljobs);
59 queue_init(&pool->lazywhatprovidesq);
62 pool->disttype = DISTTYPE_DEB;
63 pool->noarchid = ARCH_ALL;
64 #elif defined(ARCHLINUX)
65 pool->disttype = DISTTYPE_ARCH;
66 pool->noarchid = ARCH_ANY;
68 pool->disttype = DISTTYPE_HAIKU;
69 pool->noarchid = ARCH_ANY;
70 pool->obsoleteusesprovides = 1;
72 pool->disttype = DISTTYPE_RPM;
73 pool->noarchid = ARCH_NOARCH;
76 /* initialize the system solvable */
77 s = pool->solvables + SYSTEMSOLVABLE;
78 s->name = SYSTEM_SYSTEM;
79 s->arch = pool->noarchid;
82 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
84 pool->obsoleteusescolors = 1;
87 pool->noobsoletesmultiversion = 1;
88 pool->forbidselfconflicts = 1;
89 pool->obsoleteusesprovides = 1;
90 pool->implicitobsoleteusesprovides = 1;
91 pool->havedistepoch = 1;
97 /* free all the resources of our pool */
103 pool_freewhatprovides(pool);
104 pool_freeidhashes(pool);
105 pool_freeallrepos(pool, 1);
106 solv_free(pool->id2arch);
107 solv_free(pool->id2color);
108 solv_free(pool->solvables);
109 stringpool_free(&pool->ss);
110 solv_free(pool->rels);
111 pool_setvendorclasses(pool, 0);
112 queue_free(&pool->vendormap);
113 queue_free(&pool->pooljobs);
114 queue_free(&pool->lazywhatprovidesq);
115 for (i = 0; i < POOL_TMPSPACEBUF; i++)
116 solv_free(pool->tmpspace.buf[i]);
117 for (i = 0; i < pool->nlanguages; i++)
118 free((char *)pool->languages[i]);
119 solv_free(pool->languages);
120 solv_free(pool->languagecache);
121 solv_free(pool->errstr);
122 solv_free(pool->rootdir);
127 pool_freeallrepos(Pool *pool, int reuseids)
131 pool_freewhatprovides(pool);
132 for (i = 1; i < pool->nrepos; i++)
134 repo_freedata(pool->repos[i]);
135 pool->repos = solv_free(pool->repos);
138 /* the first two solvables don't belong to a repo */
139 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
142 #ifdef MULTI_SEMANTICS
144 pool_setdisttype(Pool *pool, int disttype)
146 pool->disttype = disttype;
147 if (disttype == DISTTYPE_RPM)
148 pool->noarchid = ARCH_NOARCH;
149 if (disttype == DISTTYPE_DEB)
150 pool->noarchid = ARCH_ALL;
151 if (disttype == DISTTYPE_ARCH)
152 pool->noarchid = ARCH_ANY;
153 if (disttype == DISTTYPE_HAIKU)
154 pool->noarchid = ARCH_ANY;
155 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
160 pool_get_flag(Pool *pool, int flag)
164 case POOL_FLAG_PROMOTEEPOCH:
165 return pool->promoteepoch;
166 case POOL_FLAG_FORBIDSELFCONFLICTS:
167 return pool->forbidselfconflicts;
168 case POOL_FLAG_OBSOLETEUSESPROVIDES:
169 return pool->obsoleteusesprovides;
170 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
171 return pool->implicitobsoleteusesprovides;
172 case POOL_FLAG_OBSOLETEUSESCOLORS:
173 return pool->obsoleteusescolors;
174 case POOL_FLAG_NOINSTALLEDOBSOLETES:
175 return pool->noinstalledobsoletes;
176 case POOL_FLAG_HAVEDISTEPOCH:
177 return pool->havedistepoch;
178 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
179 return pool->noobsoletesmultiversion;
180 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
181 return pool->addfileprovidesfiltered;
189 pool_set_flag(Pool *pool, int flag, int value)
191 int old = pool_get_flag(pool, flag);
194 case POOL_FLAG_PROMOTEEPOCH:
195 pool->promoteepoch = value;
197 case POOL_FLAG_FORBIDSELFCONFLICTS:
198 pool->forbidselfconflicts = value;
200 case POOL_FLAG_OBSOLETEUSESPROVIDES:
201 pool->obsoleteusesprovides = value;
203 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
204 pool->implicitobsoleteusesprovides = value;
206 case POOL_FLAG_OBSOLETEUSESCOLORS:
207 pool->obsoleteusescolors = value;
209 case POOL_FLAG_NOINSTALLEDOBSOLETES:
210 pool->noinstalledobsoletes = value;
212 case POOL_FLAG_HAVEDISTEPOCH:
213 pool->havedistepoch = value;
215 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
216 pool->noobsoletesmultiversion = value;
218 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
219 pool->addfileprovidesfiltered = value;
229 pool_add_solvable(Pool *pool)
231 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
232 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
233 return pool->nsolvables++;
237 pool_add_solvable_block(Pool *pool, int count)
239 Id nsolvables = pool->nsolvables;
242 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
243 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
244 pool->nsolvables += count;
249 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
253 if (reuseids && start + count == pool->nsolvables)
255 /* might want to shrink solvable array */
256 pool->nsolvables = start;
259 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
264 pool_set_installed(Pool *pool, Repo *installed)
266 if (pool->installed == installed)
268 pool->installed = installed;
269 pool_freewhatprovides(pool);
273 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
278 oa = pool->whatprovides[*(Id *)ap];
279 ob = pool->whatprovides[*(Id *)bp];
281 return *(Id *)ap - *(Id *)bp;
282 da = pool->whatprovidesdata + oa;
283 db = pool->whatprovidesdata + ob;
285 if ((r = (*da++ - *db++)) != 0)
289 return *(Id *)ap - *(Id *)bp;
293 * pool_shrink_whatprovides - unify whatprovides data
295 * whatprovides_rel must be empty for this to work!
299 pool_shrink_whatprovides(Pool *pool)
303 Id lastid, *last, *dp, *lp;
307 if (pool->ss.nstrings < 3)
309 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
310 for (i = id = 0; id < pool->ss.nstrings; id++)
311 if (pool->whatprovides[id] >= 4)
314 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
317 for (i = 0; i < n; i++)
320 o = pool->whatprovides[id];
321 dp = pool->whatprovidesdata + o;
335 pool->whatprovides[id] = -lastid;
339 last = pool->whatprovidesdata + o;
343 dp = pool->whatprovidesdata + 4;
344 for (id = 1; id < pool->ss.nstrings; id++)
346 o = pool->whatprovides[id];
354 pool->whatprovides[id] = pool->whatprovides[i];
359 lp = pool->whatprovidesdata + o;
362 pool->whatprovides[id] = dp - pool->whatprovidesdata;
363 while ((*dp++ = *lp++) != 0)
366 o = dp - pool->whatprovidesdata;
367 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
368 if (pool->whatprovidesdataoff == o)
370 r = pool->whatprovidesdataoff - o;
371 pool->whatprovidesdataoff = o;
372 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
373 if (r > pool->whatprovidesdataleft)
374 r = pool->whatprovidesdataleft;
375 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
380 * pool_createwhatprovides()
382 * create hashes over pool of solvables to ease provide lookups
386 pool_createwhatprovides(Pool *pool)
388 int i, num, np, extra;
393 Offset *whatprovides;
394 Id *whatprovidesdata, *d;
395 Repo *installed = pool->installed;
398 now = solv_timems(0);
399 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
400 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
401 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);
402 if (pool->ss.stringhashmask || pool->relhashmask)
403 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)));
405 pool_freeidhashes(pool); /* XXX: should not be here! */
406 pool_freewhatprovides(pool);
407 num = pool->ss.nstrings;
408 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
409 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
411 /* count providers for each name */
412 for (i = pool->nsolvables - 1; i > 0; i--)
415 s = pool->solvables + i;
416 if (!s->provides || !s->repo || s->repo->disabled)
418 /* we always need the installed solvable in the whatprovides data,
419 otherwise obsoletes/conflicts on them won't work */
420 if (s->repo != installed && !pool_installable(pool, s))
422 pp = s->repo->idarraydata + s->provides;
423 while ((id = *pp++) != 0)
427 Reldep *rd = GETRELDEP(pool, id);
430 whatprovides[id]++; /* inc count of providers */
434 off = 4; /* first entry is undef, second is empty list, third is system solvable */
435 np = 0; /* number of names provided */
436 for (i = 0, idp = whatprovides; i < num; i++, idp++)
439 if (!n) /* no providers */
441 *idp = 1; /* offset for empty list */
444 off += n; /* make space for all providers */
445 *idp = off++; /* now idp points to terminating zero */
446 np++; /* inc # of provider 'slots' for stats */
449 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
451 /* reserve some space for relation data */
452 extra = 2 * pool->nrels;
456 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
458 /* alloc space for all providers + extra */
459 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
460 whatprovidesdata[2] = SYSTEMSOLVABLE;
462 /* now fill data for all provides */
463 for (i = pool->nsolvables - 1; i > 0; i--)
466 s = pool->solvables + i;
467 if (!s->provides || !s->repo || s->repo->disabled)
469 if (s->repo != installed && !pool_installable(pool, s))
472 /* for all provides of this solvable */
473 pp = s->repo->idarraydata + s->provides;
474 while ((id = *pp++) != 0)
478 Reldep *rd = GETRELDEP(pool, id);
481 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
482 if (*d != i) /* don't add same solvable twice */
489 pool->whatprovidesdata = whatprovidesdata;
490 pool->whatprovidesdataoff = off;
491 pool->whatprovidesdataleft = extra;
492 pool_shrink_whatprovides(pool);
493 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)));
495 queue_empty(&pool->lazywhatprovidesq);
496 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
498 if (!pool->addedfileprovides)
499 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
500 /* lazyly add file provides */
501 for (i = 1; i < num; i++)
503 const char *str = pool->ss.stringspace + pool->ss.strings[i];
506 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
508 /* setup lazy adding, but remember old value */
509 if (pool->whatprovides[i] > 1)
510 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
511 pool->whatprovides[i] = 0;
513 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
516 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
520 * free all of our whatprovides data
521 * be careful, everything internalized with pool_queuetowhatprovides is
525 pool_freewhatprovides(Pool *pool)
527 pool->whatprovides = solv_free(pool->whatprovides);
528 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
529 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
530 pool->whatprovidesdataoff = 0;
531 pool->whatprovidesdataleft = 0;
535 /******************************************************************************/
538 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
540 * used for whatprovides, jobs, learnt rules, selections
541 * input: q: queue of Ids
542 * returns: Offset into whatprovidesdata
546 pool_queuetowhatprovides(Pool *pool, Queue *q)
549 int count = q->count;
551 if (count == 0) /* queue empty -> 1 */
553 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
556 /* extend whatprovidesdata if needed, +1 for 0-termination */
557 if (pool->whatprovidesdataleft < count + 1)
559 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
560 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
561 pool->whatprovidesdataleft = count + 4096;
564 /* copy queue to next free slot */
565 off = pool->whatprovidesdataoff;
566 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
568 /* adapt count and 0-terminate */
569 pool->whatprovidesdataoff += count;
570 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
571 pool->whatprovidesdataleft -= count + 1;
577 /*************************************************************************/
579 #if defined(MULTI_SEMANTICS)
580 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
581 #elif defined(DEBIAN)
582 # define EVRCMP_DEPCMP EVRCMP_COMPARE
584 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
587 /* check if a package's nevr matches a dependency */
590 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
592 Reldep *rd = GETRELDEP(pool, d);
595 int flags = rd->flags;
604 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
607 return pool_match_nevr(pool, s, name);
609 if (pool_match_nevr(pool, s, name))
611 return pool_match_nevr(pool, s, evr);
614 if (!pool_match_nevr(pool, s, name))
616 return pool_match_nevr(pool, s, evr);
621 if (!pool_match_nevr(pool, s, name))
624 return (flags & REL_EQ) ? 1 : 0;
629 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
634 return (flags & REL_LT) ? 1 : 0;
636 return (flags & REL_EQ) ? 1 : 0;
638 return (flags & REL_GT) ? 1 : 0;
640 return (flags & REL_EQ) ? 1 : 0;
647 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
648 /* forward declaration */
649 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
652 /* match (flags, evr) against provider (pflags, pevr) */
654 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
656 if (!pflags || !flags || pflags >= 8 || flags >= 8)
658 if (flags == 7 || pflags == 7)
659 return 1; /* rel provides every version */
660 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
661 return 1; /* both rels show in the same direction */
663 return (flags & pflags & REL_EQ) ? 1 : 0;
664 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
667 Reldep *rd = GETRELDEP(pool, pevr);
668 if (rd->flags == REL_COMPAT)
669 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
672 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
675 return (pflags & REL_EQ) ? 1 : 0;
677 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
679 return (flags & pflags & REL_EQ) ? 1 : 0;
681 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
683 return (flags & REL_EQ) ? 1 : 0;
690 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
692 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
694 /* range->name is the actual version, range->evr the backwards compatibility
695 version. If flags are '>=' or '>', we match the compatibility version
696 as well, otherwise only the actual version. */
697 if (!(flags & REL_GT) || (flags & REL_LT))
698 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
699 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
700 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
704 /* match two dependencies (d1 = provider) */
707 pool_match_dep(Pool *pool, Id d1, Id d2)
717 rd2 = GETRELDEP(pool, d2);
718 return pool_match_dep(pool, d1, rd2->name);
720 rd1 = GETRELDEP(pool, d1);
723 return pool_match_dep(pool, rd1->name, d2);
725 rd2 = GETRELDEP(pool, d2);
726 /* first match name */
727 if (!pool_match_dep(pool, rd1->name, rd2->name))
729 /* name matches, check flags and evr */
730 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
734 pool_searchlazywhatprovidesq(Pool *pool, Id d)
737 int end = pool->lazywhatprovidesq.count;
741 elements = pool->lazywhatprovidesq.elements;
742 while (end - start > 16)
744 int mid = (start + end) / 2 & ~1;
745 if (elements[mid] == d)
746 return elements[mid + 1];
747 if (elements[mid] < d)
752 for (; start < end; start += 2)
753 if (elements[start] == d)
754 return elements[start + 1];
761 * lazy populating of the whatprovides array, non relation case
764 pool_addstdproviders(Pool *pool, Id d)
772 if (pool->addedfileprovides == 2)
774 pool->whatprovides[d] = 1;
777 str = pool->ss.stringspace + pool->ss.strings[d];
780 pool->whatprovides[d] = 1;
783 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
784 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES|SEARCH_COMPLETE_FILELIST);
785 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
787 Solvable *s = pool->solvables + di.solvid;
788 /* XXX: maybe should add a provides dependency to the solvables
789 * OTOH this is only needed for rel deps that filter the provides,
790 * and those should not use filelist entries */
791 if (s->repo->disabled)
793 if (s->repo != pool->installed && !pool_installable(pool, s))
795 queue_push(&q, di.solvid);
797 dataiterator_free(&di);
798 oldoffset = pool_searchlazywhatprovidesq(pool, d);
800 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
805 Id *oo = pool->whatprovidesdata + oldoffset;
807 /* unify both queues. easy, as we know both are sorted */
808 for (i = 0; i < q.count; i++)
810 if (*oo > q.elements[i])
812 if (*oo < q.elements[i])
813 queue_insert(&q, i, *oo);
819 queue_push(&q, *oo++);
820 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
822 /* end result has same size as oldoffset -> no new entries */
824 pool->whatprovides[d] = oldoffset;
828 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
831 return pool->whatprovides[d];
838 * add packages fulfilling the relation to whatprovides array
842 pool_addrelproviders(Pool *pool, Id d)
853 return pool_addstdproviders(pool, d);
854 rd = GETRELDEP(pool, d);
859 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
863 /* special relation */
871 wp = pool_whatprovides(pool, name);
872 pp2 = pool_whatprovides_ptr(pool, evr);
873 pp = pool->whatprovidesdata + wp;
874 while ((p = *pp++) != 0)
876 for (pp3 = pp2; *pp3; pp3++)
880 queue_push(&plist, p); /* found it */
886 wp = pool_whatprovides(pool, name);
887 pp = pool->whatprovidesdata + wp;
889 wp = pool_whatprovides(pool, evr);
893 while ((p = *pp++) != 0)
894 queue_push(&plist, p);
896 pp = pool_whatprovides_ptr(pool, evr);
897 while ((p = *pp++) != 0)
898 queue_pushunique(&plist, p);
899 if (plist.count != cnt)
904 if (name == NAMESPACE_OTHERPROVIDERS)
906 wp = pool_whatprovides(pool, evr);
909 if (pool->nscallback)
911 /* ask callback which packages provide the dependency
913 * 1: the system (aka SYSTEMSOLVABLE)
914 * >1: set of packages, stored as offset on whatprovidesdata
916 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
920 queue_push(&plist, SYSTEMSOLVABLE);
924 /* small hack: make it possible to match <pkg>.src
925 * we have to iterate over the solvables as src packages do not
926 * provide anything, thus they are not indexed in our
927 * whatprovides hash */
928 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
931 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
935 if (s->arch != evr && s->arch != ARCH_NOSRC)
937 if (pool_disabled_solvable(pool, s))
939 if (pool_match_nevr(pool, s, name))
940 queue_push(&plist, p);
944 wp = pool_whatprovides(pool, name);
945 pp = pool->whatprovidesdata + wp;
946 while ((p = *pp++) != 0)
948 Solvable *s = pool->solvables + p;
950 queue_push(&plist, p);
955 case REL_FILECONFLICT:
956 pp = pool_whatprovides_ptr(pool, name);
957 while ((p = *pp++) != 0)
959 Id origd = MAKERELDEP(d);
960 Solvable *s = pool->solvables + p;
963 pidp = s->repo->idarraydata + s->provides;
964 while ((pid = *pidp++) != 0)
968 queue_push(&plist, p);
976 /* we can reuse an existing entry */
978 pool->whatprovides_rel[d] = wp;
984 /* simple version comparison relation */
986 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
988 pp = pool_whatprovides_ptr(pool, name);
989 while (ISRELDEP(name))
991 rd = GETRELDEP(pool, name);
994 while ((p = *pp++) != 0)
996 Solvable *s = pool->solvables + p;
999 /* no provides - check nevr */
1000 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1001 queue_push(&plist, p);
1004 /* solvable p provides name in some rels */
1005 pidp = s->repo->idarraydata + s->provides;
1006 while ((pid = *pidp++) != 0)
1011 continue; /* wrong provides name */
1012 if (pool->disttype == DISTTYPE_DEB)
1013 continue; /* unversioned provides can never match versioned deps */
1016 prd = GETRELDEP(pool, pid);
1017 if (prd->name != name)
1018 continue; /* wrong provides name */
1019 /* right package, both deps are rels. check flags/evr */
1020 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1021 break; /* matches */
1024 continue; /* none of the providers matched */
1025 queue_push(&plist, p);
1027 /* make our system solvable provide all unknown rpmlib() stuff */
1028 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1029 queue_push(&plist, SYSTEMSOLVABLE);
1031 /* add providers to whatprovides */
1033 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1035 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1038 return pool->whatprovides_rel[d];
1042 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1044 int nrels = pool->nrels;
1048 if (!pool->whatprovides_rel)
1050 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1052 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1054 if (ns && rd->name != ns)
1056 if (evr && rd->evr != evr)
1058 pool->whatprovides_rel[d] = 0;
1062 /*************************************************************************/
1065 pool_debug(Pool *pool, int type, const char *format, ...)
1070 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1072 if ((pool->debugmask & type) == 0)
1075 va_start(args, format);
1076 if (!pool->debugcallback)
1078 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1079 vprintf(format, args);
1081 vfprintf(stderr, format, args);
1084 vsnprintf(buf, sizeof(buf), format, args);
1086 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1090 pool_error(Pool *pool, int ret, const char *format, ...)
1094 va_start(args, format);
1097 pool->errstra = 1024;
1098 pool->errstr = solv_malloc(pool->errstra);
1106 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1108 if (l >= 0 && l + 1 > pool->errstra)
1110 pool->errstra = l + 256;
1111 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1112 va_start(args, format);
1113 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1117 strcpy(pool->errstr, "unknown error");
1118 if (pool->debugmask & SOLV_ERROR)
1119 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1124 pool_errstr(Pool *pool)
1126 return pool->errstr ? pool->errstr : "no error";
1130 pool_setdebuglevel(Pool *pool, int level)
1132 int mask = SOLV_DEBUG_RESULT;
1134 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1136 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1138 mask |= SOLV_DEBUG_PROPAGATE;
1140 mask |= SOLV_DEBUG_RULE_CREATION;
1141 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1142 pool->debugmask = mask;
1145 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1147 pool->debugcallback = debugcallback;
1148 pool->debugcallbackdata = debugcallbackdata;
1151 void pool_setdebugmask(Pool *pool, int mask)
1153 pool->debugmask = mask;
1156 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
1158 pool->loadcallback = cb;
1159 pool->loadcallbackdata = loadcbdata;
1162 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct _Pool *, void *, Id, Id), void *nscbdata)
1164 pool->nscallback = cb;
1165 pool->nscallbackdata = nscbdata;
1168 /*************************************************************************/
1170 struct searchfiles {
1178 #define SEARCHFILES_BLOCK 127
1181 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1185 struct searchfiles *csf;
1187 while ((dep = *ida++) != 0)
1190 while (ISRELDEP(dep))
1193 sid = pool->ss.nstrings + GETRELID(dep);
1194 if (MAPTST(&csf->seen, sid))
1199 MAPSET(&csf->seen, sid);
1200 rd = GETRELDEP(pool, dep);
1203 else if (rd->flags == REL_NAMESPACE)
1205 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1208 if (!csf || MAPTST(&csf->seen, sid))
1213 MAPSET(&csf->seen, sid);
1217 else if (rd->flags == REL_FILECONFLICT)
1227 pool_addfileprovides_dep(pool, ids, csf, isf);
1233 if (MAPTST(&csf->seen, dep))
1235 MAPSET(&csf->seen, dep);
1236 s = pool_id2str(pool, dep);
1239 if (csf != isf && pool->addedfileprovides == 1 && !repodata_filelistfilter_matches(0, s))
1240 continue; /* skip non-standard locations csf == isf: installed case */
1241 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1242 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1243 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1244 csf->ids[csf->nfiles] = dep;
1245 sr = strrchr(s, '/');
1246 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1247 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1249 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1250 csf->dirs[csf->nfiles][sr - s] = 0;
1255 struct addfileprovides_cbdata {
1269 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1271 struct addfileprovides_cbdata *cbd = cbdata;
1274 if (!cbd->useddirs.size)
1276 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1277 for (i = 0; i < cbd->nfiles; i++)
1280 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1285 did = repodata_str2dir(data, cbd->dirs[i], 0);
1288 MAPSET(&cbd->useddirs, did);
1290 repodata_free_dircache(data);
1292 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1294 for (i = 0; i < cbd->nfiles; i++)
1296 if (cbd->dids[i] != value->id)
1298 if (!strcmp(cbd->names[i], value->str))
1301 if (i == cbd->nfiles)
1303 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1308 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1313 Queue fileprovidesq;
1314 int i, j, repoid, repodataid;
1315 int provstart, provend;
1317 int ndone, incomplete;
1322 cbd->nfiles = sf->nfiles;
1324 cbd->dirs = sf->dirs;
1325 cbd->names = sf->names;
1326 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1327 map_init(&cbd->providedids, pool->ss.nstrings);
1330 repo = repoonly ? repoonly : pool->repos[repoid];
1331 map_init(&donemap, pool->nsolvables);
1332 queue_init(&fileprovidesq);
1333 provstart = provend = 0;
1336 if (!repo || repo->disabled)
1338 if (repoonly || ++repoid == pool->nrepos)
1340 repo = pool->repos[repoid];
1344 FOR_REPODATAS(repo, repodataid, data)
1346 if (ndone >= repo->nsolvables)
1349 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1351 map_empty(&cbd->providedids);
1352 for (i = 0; i < fileprovidesq.count; i++)
1353 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1354 provstart = data->start;
1355 provend = data->end;
1356 for (i = 0; i < cbd->nfiles; i++)
1357 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1359 if (i == cbd->nfiles)
1361 /* great! no need to search files */
1362 for (p = data->start; p < data->end; p++)
1363 if (pool->solvables[p].repo == repo)
1365 if (MAPTST(&donemap, p))
1367 MAPSET(&donemap, p);
1374 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1377 if (data->start < provstart || data->end > provend)
1379 map_empty(&cbd->providedids);
1380 provstart = provend = 0;
1383 /* check if the data is incomplete */
1385 if (data->state == REPODATA_AVAILABLE)
1387 for (j = 1; j < data->nkeys; j++)
1388 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1390 if (j < data->nkeys)
1393 for (i = 0; i < cbd->nfiles; i++)
1394 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1395 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1397 for (i = 0; i < cbd->nfiles; i++)
1398 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1400 if (i < cbd->nfiles)
1406 map_init(&cbd->useddirs, 0);
1407 for (p = data->start; p < data->end; p++)
1408 if (pool->solvables[p].repo == repo)
1410 if (MAPTST(&donemap, p))
1412 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1415 MAPSET(&donemap, p);
1419 map_free(&cbd->useddirs);
1422 if (repoonly || ++repoid == pool->nrepos)
1424 repo = pool->repos[repoid];
1427 queue_free(&fileprovidesq);
1428 map_free(&cbd->providedids);
1432 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1435 Repo *installed, *repo;
1436 struct searchfiles sf, isf, *isfp;
1437 struct addfileprovides_cbdata cbd;
1441 installed = pool->installed;
1442 now = solv_timems(0);
1443 memset(&sf, 0, sizeof(sf));
1444 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1445 memset(&isf, 0, sizeof(isf));
1446 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1447 pool->addedfileprovides = pool->addfileprovidesfiltered ? 1 : 2;
1452 queue_empty(idqinst);
1453 isfp = installed ? &isf : 0;
1454 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1460 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1462 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1464 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1466 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1468 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1470 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1472 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1475 map_free(&isf.seen);
1476 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1481 for (i = 0; i < sf.nfiles; i++)
1482 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1484 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1486 for (i = 0; i < sf.nfiles; i++)
1487 queue_push(idq, sf.ids[i]);
1489 for (i = 0; i < sf.nfiles; i++)
1490 queue_push(idqinst, sf.ids[i]);
1492 for (i = 0; i < sf.nfiles; i++)
1494 solv_free(sf.dirs[i]);
1495 solv_free(sf.names[i]);
1498 solv_free(sf.names);
1503 for (i = 0; i < isf.nfiles; i++)
1504 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1507 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1508 if (installed && idqinst)
1509 for (i = 0; i < isf.nfiles; i++)
1510 queue_pushunique(idqinst, isf.ids[i]);
1512 for (i = 0; i < isf.nfiles; i++)
1514 solv_free(isf.dirs[i]);
1515 solv_free(isf.names[i]);
1517 solv_free(isf.dirs);
1518 solv_free(isf.names);
1520 solv_free(cbd.dids);
1521 pool_freewhatprovides(pool); /* as we have added provides */
1522 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1526 pool_addfileprovides(Pool *pool)
1528 pool_addfileprovides_queue(pool, 0, 0);
1532 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)
1536 if (pool->solvables[p].repo)
1537 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1540 /* FIXME: obey callback return value! */
1541 for (p = 1; p < pool->nsolvables; p++)
1542 if (pool->solvables[p].repo)
1543 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1547 pool_clear_pos(Pool *pool)
1549 memset(&pool->pos, 0, sizeof(pool->pos));
1554 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1558 pool->languagecache = solv_free(pool->languagecache);
1559 pool->languagecacheother = 0;
1560 if (pool->nlanguages)
1562 for (i = 0; i < pool->nlanguages; i++)
1563 free((char *)pool->languages[i]);
1564 free(pool->languages);
1566 pool->nlanguages = nlanguages;
1569 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1570 for (i = 0; i < pool->nlanguages; i++)
1571 pool->languages[i] = solv_strdup(languages[i]);
1575 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1581 if (!lang || !*lang)
1583 n = pool_id2str(pool, id);
1584 l = strlen(n) + strlen(lang) + 2;
1585 if (l > sizeof(buf))
1586 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1589 sprintf(p, "%s:%s", n, lang);
1590 id = pool_str2id(pool, p, create);
1597 pool_alloctmpspace(Pool *pool, int len)
1599 int n = pool->tmpspace.n;
1602 if (len > pool->tmpspace.len[n])
1604 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1605 pool->tmpspace.len[n] = len + 32;
1607 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1608 return pool->tmpspace.buf[n];
1612 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1617 n = oldn = pool->tmpspace.n;
1621 n = POOL_TMPSPACEBUF - 1;
1624 if (pool->tmpspace.buf[n] != space)
1626 if (len > pool->tmpspace.len[n])
1628 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1629 pool->tmpspace.len[n] = len + 32;
1631 return pool->tmpspace.buf[n];
1638 pool_freetmpspace(Pool *pool, const char *space)
1640 int n = pool->tmpspace.n;
1643 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1644 if (pool->tmpspace.buf[n] == space)
1645 pool->tmpspace.n = n;
1649 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1653 l1 = str1 ? strlen(str1) : 0;
1654 l2 = str2 ? strlen(str2) : 0;
1655 l3 = str3 ? strlen(str3) : 0;
1656 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1677 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1682 l1 = str1 ? strlen(str1) : 0;
1683 l2 = str2 ? strlen(str2) : 0;
1684 l3 = str3 ? strlen(str3) : 0;
1685 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1689 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1712 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1717 s = pool_alloctmpspace(pool, 2 * len + 1);
1718 solv_bin2hex(buf, len, s);
1722 /*******************************************************************/
1734 struct mptree *mptree;
1745 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1747 struct ducbdata *cbd = cbdata;
1750 if (data != cbd->olddata)
1752 Id dn, mp, comp, *dirmap, *dirs;
1754 const char *compstr;
1755 struct mptree *mptree;
1757 /* create map from dir to mptree */
1758 cbd->dirmap = solv_free(cbd->dirmap);
1760 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1761 mptree = cbd->mptree;
1763 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1777 if (!mptree[mp].child)
1782 if (data->localpool)
1783 compstr = stringpool_id2str(&data->spool, comp);
1785 compstr = pool_id2str(data->repo->pool, comp);
1786 compl = strlen(compstr);
1787 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1788 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1790 dirmap[dn] = i ? i : -mp;
1792 /* change dirmap to point to mountpoint instead of mptree */
1793 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1796 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1798 cbd->dirmap = dirmap;
1799 cbd->nmap = data->dirpool.ndirs;
1800 cbd->olddata = data;
1803 if (value->id < 0 || value->id >= cbd->nmap)
1805 mp = cbd->dirmap[value->id];
1808 if (cbd->addsub > 0)
1810 cbd->mps[mp].kbytes += value->num;
1811 cbd->mps[mp].files += value->num2;
1815 cbd->mps[mp].kbytes -= value->num;
1816 cbd->mps[mp].files -= value->num2;
1822 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1825 if (mptree[pos].mountpoint == -1)
1826 mptree[pos].mountpoint = mountpoint;
1828 mountpoint = mptree[pos].mountpoint;
1829 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1830 propagate_mountpoints(mptree, i, mountpoint);
1833 #define MPTREE_BLOCK 15
1836 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1839 const char *path, *compstr;
1840 struct mptree *mptree;
1844 struct ducbdata cbd;
1848 Repo *oldinstalled = pool->installed;
1850 memset(&ignoredu, 0, sizeof(ignoredu));
1857 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1860 mptree[0].sibling = 0;
1861 mptree[0].child = 0;
1863 mptree[0].compl = 0;
1864 mptree[0].mountpoint = -1;
1867 /* create component tree */
1868 for (mp = 0; mp < nmps; mp++)
1873 path = mps[mp].path;
1878 if ((p = strchr(path, '/')) == 0)
1881 compl = strlen(compstr);
1892 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1893 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1897 /* create new node */
1898 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1900 mptree[i].sibling = mptree[pos].child;
1901 mptree[i].child = 0;
1902 mptree[i].comp = compstr;
1903 mptree[i].compl = compl;
1904 mptree[i].mountpoint = -1;
1905 mptree[pos].child = i;
1909 mptree[pos].mountpoint = mp;
1912 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1915 for (i = 0; i < nmptree; i++)
1917 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1918 printf("#%d child: %d\n", i, mptree[i].child);
1919 printf("#%d comp: %s\n", i, mptree[i].comp);
1920 printf("#%d compl: %d\n", i, mptree[i].compl);
1921 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1925 cbd.mptree = mptree;
1927 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1929 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1931 if (!MAPTST(installedmap, sp))
1934 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1935 if (!cbd.hasdu && oldinstalled)
1938 /* no du data available, ignore data of all installed solvables we obsolete */
1940 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1943 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1944 while ((obs = *obsp++) != 0)
1945 FOR_PROVIDES(op, opp, obs)
1946 if (op >= oldinstalled->start && op < oldinstalled->end)
1947 MAPSET(&ignoredu, op - oldinstalled->start);
1949 FOR_PROVIDES(op, opp, s->name)
1950 if (pool->solvables[op].name == s->name)
1951 if (op >= oldinstalled->start && op < oldinstalled->end)
1952 MAPSET(&ignoredu, op - oldinstalled->start);
1958 /* assumes we allways have du data for installed solvables */
1959 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1961 if (MAPTST(installedmap, sp))
1963 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1965 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1969 map_free(&ignoredu);
1970 solv_free(cbd.dirmap);
1975 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1980 Repo *oldinstalled = pool->installed;
1982 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1984 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1986 if (!MAPTST(installedmap, sp))
1988 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
1992 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1994 if (MAPTST(installedmap, sp))
1996 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2004 * 2: conflicts with installed
2005 * 8: interesting (only true if installed)
2009 static inline Id dep2name(Pool *pool, Id dep)
2011 while (ISRELDEP(dep))
2013 Reldep *rd = rd = GETRELDEP(pool, dep);
2019 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
2022 Solvable *sn = pool->solvables + n;
2024 FOR_PROVIDES(p, pp, sn->name)
2026 Solvable *s = pool->solvables + p;
2027 if (s->name != sn->name || s->arch != sn->arch)
2029 if ((map[p] & 9) != 9)
2031 if (pool_match_nevr(pool, pool->solvables + p, con))
2033 return 1; /* found installed package that doesn't conflict */
2038 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
2042 FOR_PROVIDES(p, pp, dep)
2044 if (p == SYSTEMSOLVABLE)
2045 return 1; /* always boring, as never constraining */
2046 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
2048 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
2049 if (providedbyinstalled_multiversion(pool, map, p, dep))
2051 if ((map[p] & 9) == 9)
2059 * pool_trivial_installable - calculate if a set of solvables is
2060 * trivial installable without any other installs/deinstalls of
2061 * packages not belonging to the set.
2063 * the state is returned in the result queue:
2064 * 1: solvable is installable without any other package changes
2065 * 0: solvable is not installable
2066 * -1: solvable is installable, but doesn't constrain any installed packages
2070 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
2073 Id p, *dp, con, *conp, req, *reqp;
2077 map = solv_calloc(pool->nsolvables, 1);
2078 for (p = 1; p < pool->nsolvables; p++)
2080 if (!MAPTST(installedmap, p))
2083 s = pool->solvables + p;
2086 conp = s->repo->idarraydata + s->conflicts;
2087 while ((con = *conp++) != 0)
2089 dp = pool_whatprovides_ptr(pool, con);
2091 map[p] |= 2; /* XXX: self conflict ? */
2094 for (i = 0; i < pkgs->count; i++)
2095 map[pkgs->elements[i]] = 16;
2097 for (i = 0, did = 0; did < pkgs->count; i++, did++)
2099 if (i == pkgs->count)
2101 p = pkgs->elements[i];
2102 if ((map[p] & 16) == 0)
2104 if ((map[p] & 2) != 0)
2109 s = pool->solvables + p;
2113 reqp = s->repo->idarraydata + s->requires;
2114 while ((req = *reqp++) != 0)
2116 if (req == SOLVABLE_PREREQMARKER)
2118 r = providedbyinstalled(pool, map, req, 0, 0);
2121 /* decided and miss */
2127 break; /* undecided */
2128 m |= r; /* 1 | 9 | 17 */
2137 int ispatch = 0; /* see solver.c patch handling */
2139 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
2141 conp = s->repo->idarraydata + s->conflicts;
2142 while ((con = *conp++) != 0)
2144 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2150 if ((m == 1 || m == 17) && ISRELDEP(con))
2152 con = dep2name(pool, con);
2153 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2158 continue; /* found a conflict */
2161 if (s->repo && s->repo != oldinstalled)
2163 Id p2, obs, *obsp, *pp;
2167 obsp = s->repo->idarraydata + s->obsoletes;
2168 while ((obs = *obsp++) != 0)
2170 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2179 FOR_PROVIDES(p2, pp, s->name)
2181 s2 = pool->solvables + p2;
2182 if (s2->name == s->name && (map[p2] & 1) != 0)
2199 queue_init_clone(res, pkgs);
2200 for (i = 0; i < pkgs->count; i++)
2202 m = map[pkgs->elements[i]];
2209 res->elements[i] = r;
2215 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2217 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2221 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2223 if (entry == SOLVID_POS && pool->pos.repo)
2224 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2227 return solvable_lookup_str(pool->solvables + entry, keyname);
2231 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2233 if (entry == SOLVID_POS && pool->pos.repo)
2234 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2237 return solvable_lookup_id(pool->solvables + entry, keyname);
2241 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2243 if (entry == SOLVID_POS && pool->pos.repo)
2244 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
2247 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2251 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2253 if (entry == SOLVID_POS && pool->pos.repo)
2254 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2257 return solvable_lookup_void(pool->solvables + entry, keyname);
2260 const unsigned char *
2261 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2263 if (entry == SOLVID_POS && pool->pos.repo)
2264 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2267 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2271 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2273 if (entry == SOLVID_POS && pool->pos.repo)
2274 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2277 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2281 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
2283 if (entry == SOLVID_POS && pool->pos.repo)
2284 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
2287 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
2291 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2296 if (entry != SOLVID_POS)
2298 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2299 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2300 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2301 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2306 add_new_provider(Pool *pool, Id id, Id p)
2311 while (ISRELDEP(id))
2313 Reldep *rd = GETRELDEP(pool, id);
2318 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2330 queue_push(&q, *pp);
2334 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2339 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2341 int hadhashes = pool->relhashtbl ? 1 : 0;
2347 if (!conflicts->count)
2349 for (i = 0; i < conflicts->count; i += 6)
2351 fn = conflicts->elements[i];
2352 p = conflicts->elements[i + 1];
2353 md5 = conflicts->elements[i + 2];
2354 q = conflicts->elements[i + 4];
2355 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2356 s = pool->solvables + p;
2359 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2360 if (pool->whatprovides)
2361 add_new_provider(pool, fn, p);
2362 if (pool->whatprovides_rel)
2363 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2364 s = pool->solvables + q;
2367 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2370 pool_freeidhashes(pool);
2374 pool_prepend_rootdir(Pool *pool, const char *path)
2379 return solv_strdup(path);
2380 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2384 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2390 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2394 pool_set_rootdir(Pool *pool, const char *rootdir)
2396 solv_free(pool->rootdir);
2397 pool->rootdir = solv_strdup(rootdir);
2401 pool_get_rootdir(Pool *pool)
2403 return pool->rootdir;
2406 /* only used in libzypp */
2408 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2410 pool->custom_vendorcheck = vendorcheck;