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.
22 #include "poolvendor.h"
25 #include "poolid_private.h"
31 #define SOLVABLE_BLOCK 255
33 #undef LIBSOLV_KNOWNID_H
34 #define KNOWNID_INITIALIZE
36 #undef KNOWNID_INITIALIZE
45 pool = (Pool *)solv_calloc(1, sizeof(*pool));
47 stringpool_init (&pool->ss, initpool_data);
49 /* alloc space for RelDep 0 */
50 pool->rels = solv_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
52 memset(pool->rels, 0, sizeof(Reldep));
54 /* alloc space for Solvable 0 and system solvable */
55 pool->solvables = solv_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
57 memset(pool->solvables, 0, 2 * sizeof(Solvable));
59 queue_init(&pool->vendormap);
60 queue_init(&pool->pooljobs);
61 queue_init(&pool->lazywhatprovidesq);
64 pool->disttype = DISTTYPE_DEB;
65 pool->noarchid = ARCH_ALL;
66 #elif defined(ARCHLINUX)
67 pool->disttype = DISTTYPE_ARCH;
68 pool->noarchid = ARCH_ANY;
70 pool->disttype = DISTTYPE_HAIKU;
71 pool->noarchid = ARCH_ANY;
72 pool->obsoleteusesprovides = 1;
74 pool->disttype = DISTTYPE_RPM;
75 pool->noarchid = ARCH_NOARCH;
78 /* initialize the system solvable */
79 s = pool->solvables + SYSTEMSOLVABLE;
80 s->name = SYSTEM_SYSTEM;
81 s->arch = pool->noarchid;
84 pool->debugmask = SOLV_DEBUG_RESULT; /* FIXME */
86 pool->implicitobsoleteusescolors = 1;
89 pool->noobsoletesmultiversion = 1;
90 pool->forbidselfconflicts = 1;
91 pool->obsoleteusesprovides = 1;
92 pool->implicitobsoleteusesprovides = 1;
93 pool->havedistepoch = 1;
99 /* free all the resources of our pool */
101 pool_free(Pool *pool)
105 pool_freewhatprovides(pool);
106 pool_freeidhashes(pool);
107 pool_freeallrepos(pool, 1);
108 solv_free(pool->id2arch);
109 solv_free(pool->id2color);
110 solv_free(pool->solvables);
111 stringpool_free(&pool->ss);
112 solv_free(pool->rels);
113 pool_setvendorclasses(pool, 0);
114 queue_free(&pool->vendormap);
115 queue_free(&pool->pooljobs);
116 queue_free(&pool->lazywhatprovidesq);
117 for (i = 0; i < POOL_TMPSPACEBUF; i++)
118 solv_free(pool->tmpspace.buf[i]);
119 for (i = 0; i < pool->nlanguages; i++)
120 free((char *)pool->languages[i]);
121 solv_free(pool->languages);
122 solv_free(pool->languagecache);
123 solv_free(pool->errstr);
124 solv_free(pool->rootdir);
129 pool_freeallrepos(Pool *pool, int reuseids)
133 pool_freewhatprovides(pool);
134 for (i = 1; i < pool->nrepos; i++)
136 repo_freedata(pool->repos[i]);
137 pool->repos = solv_free(pool->repos);
140 /* the first two solvables don't belong to a repo */
141 pool_free_solvable_block(pool, 2, pool->nsolvables - 2, reuseids);
144 #ifdef MULTI_SEMANTICS
146 pool_setdisttype(Pool *pool, int disttype)
148 pool->disttype = disttype;
149 if (disttype == DISTTYPE_RPM)
150 pool->noarchid = ARCH_NOARCH;
151 if (disttype == DISTTYPE_DEB)
152 pool->noarchid = ARCH_ALL;
153 if (disttype == DISTTYPE_ARCH)
154 pool->noarchid = ARCH_ANY;
155 if (disttype == DISTTYPE_HAIKU)
156 pool->noarchid = ARCH_ANY;
157 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
162 pool_get_flag(Pool *pool, int flag)
166 case POOL_FLAG_PROMOTEEPOCH:
167 return pool->promoteepoch;
168 case POOL_FLAG_FORBIDSELFCONFLICTS:
169 return pool->forbidselfconflicts;
170 case POOL_FLAG_OBSOLETEUSESPROVIDES:
171 return pool->obsoleteusesprovides;
172 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
173 return pool->implicitobsoleteusesprovides;
174 case POOL_FLAG_OBSOLETEUSESCOLORS:
175 return pool->obsoleteusescolors;
176 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
177 return pool->implicitobsoleteusescolors;
178 case POOL_FLAG_NOINSTALLEDOBSOLETES:
179 return pool->noinstalledobsoletes;
180 case POOL_FLAG_HAVEDISTEPOCH:
181 return pool->havedistepoch;
182 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
183 return pool->noobsoletesmultiversion;
184 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
185 return pool->addfileprovidesfiltered;
193 pool_set_flag(Pool *pool, int flag, int value)
195 int old = pool_get_flag(pool, flag);
198 case POOL_FLAG_PROMOTEEPOCH:
199 pool->promoteepoch = value;
201 case POOL_FLAG_FORBIDSELFCONFLICTS:
202 pool->forbidselfconflicts = value;
204 case POOL_FLAG_OBSOLETEUSESPROVIDES:
205 pool->obsoleteusesprovides = value;
207 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
208 pool->implicitobsoleteusesprovides = value;
210 case POOL_FLAG_OBSOLETEUSESCOLORS:
211 pool->obsoleteusescolors = value;
213 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
214 pool->implicitobsoleteusescolors = value;
216 case POOL_FLAG_NOINSTALLEDOBSOLETES:
217 pool->noinstalledobsoletes = value;
219 case POOL_FLAG_HAVEDISTEPOCH:
220 pool->havedistepoch = value;
222 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
223 pool->noobsoletesmultiversion = value;
225 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
226 pool->addfileprovidesfiltered = value;
236 pool_add_solvable(Pool *pool)
238 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
239 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
240 return pool->nsolvables++;
244 pool_add_solvable_block(Pool *pool, int count)
246 Id nsolvables = pool->nsolvables;
249 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
250 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
251 pool->nsolvables += count;
256 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
260 if (reuseids && start + count == pool->nsolvables)
262 /* might want to shrink solvable array */
263 pool->nsolvables = start;
266 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
271 pool_set_installed(Pool *pool, Repo *installed)
273 if (pool->installed == installed)
275 pool->installed = installed;
276 pool_freewhatprovides(pool);
280 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
285 oa = pool->whatprovides[*(Id *)ap];
286 ob = pool->whatprovides[*(Id *)bp];
288 return *(Id *)ap - *(Id *)bp;
289 da = pool->whatprovidesdata + oa;
290 db = pool->whatprovidesdata + ob;
292 if ((r = (*da++ - *db++)) != 0)
296 return *(Id *)ap - *(Id *)bp;
300 * pool_shrink_whatprovides - unify whatprovides data
302 * whatprovides_rel must be empty for this to work!
306 pool_shrink_whatprovides(Pool *pool)
310 Id lastid, *last, *dp, *lp;
314 if (pool->ss.nstrings < 3)
316 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
317 for (i = id = 0; id < pool->ss.nstrings; id++)
318 if (pool->whatprovides[id] >= 4)
321 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
324 for (i = 0; i < n; i++)
327 o = pool->whatprovides[id];
328 dp = pool->whatprovidesdata + o;
342 pool->whatprovides[id] = -lastid;
346 last = pool->whatprovidesdata + o;
350 dp = pool->whatprovidesdata + 4;
351 for (id = 1; id < pool->ss.nstrings; id++)
353 o = pool->whatprovides[id];
361 pool->whatprovides[id] = pool->whatprovides[i];
366 lp = pool->whatprovidesdata + o;
369 pool->whatprovides[id] = dp - pool->whatprovidesdata;
370 while ((*dp++ = *lp++) != 0)
373 o = dp - pool->whatprovidesdata;
374 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
375 if (pool->whatprovidesdataoff == o)
377 r = pool->whatprovidesdataoff - o;
378 pool->whatprovidesdataoff = o;
379 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
380 if (r > pool->whatprovidesdataleft)
381 r = pool->whatprovidesdataleft;
382 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
387 * pool_createwhatprovides()
389 * create hashes over pool of solvables to ease provide lookups
393 pool_createwhatprovides(Pool *pool)
395 int i, num, np, extra;
400 Offset *whatprovides;
401 Id *whatprovidesdata, *d;
402 Repo *installed = pool->installed;
405 now = solv_timems(0);
406 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
407 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
408 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);
409 if (pool->ss.stringhashmask || pool->relhashmask)
410 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)));
412 pool_freeidhashes(pool); /* XXX: should not be here! */
413 pool_freewhatprovides(pool);
414 num = pool->ss.nstrings;
415 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
416 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
418 /* count providers for each name */
419 for (i = pool->nsolvables - 1; i > 0; i--)
422 s = pool->solvables + i;
423 if (!s->provides || !s->repo || s->repo->disabled)
425 /* we always need the installed solvable in the whatprovides data,
426 otherwise obsoletes/conflicts on them won't work */
427 if (s->repo != installed && !pool_installable(pool, s))
429 pp = s->repo->idarraydata + s->provides;
430 while ((id = *pp++) != 0)
434 Reldep *rd = GETRELDEP(pool, id);
437 whatprovides[id]++; /* inc count of providers */
441 off = 4; /* first entry is undef, second is empty list, third is system solvable */
442 np = 0; /* number of names provided */
443 for (i = 0, idp = whatprovides; i < num; i++, idp++)
446 if (!n) /* no providers */
448 *idp = 1; /* offset for empty list */
451 off += n; /* make space for all providers */
452 *idp = off++; /* now idp points to terminating zero */
453 np++; /* inc # of provider 'slots' for stats */
456 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
458 /* reserve some space for relation data */
459 extra = 2 * pool->nrels;
463 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
465 /* alloc space for all providers + extra */
466 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
467 whatprovidesdata[2] = SYSTEMSOLVABLE;
469 /* now fill data for all provides */
470 for (i = pool->nsolvables - 1; i > 0; i--)
473 s = pool->solvables + i;
474 if (!s->provides || !s->repo || s->repo->disabled)
476 if (s->repo != installed && !pool_installable(pool, s))
479 /* for all provides of this solvable */
480 pp = s->repo->idarraydata + s->provides;
481 while ((id = *pp++) != 0)
485 Reldep *rd = GETRELDEP(pool, id);
488 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
489 if (*d != i) /* don't add same solvable twice */
496 pool->whatprovidesdata = whatprovidesdata;
497 pool->whatprovidesdataoff = off;
498 pool->whatprovidesdataleft = extra;
499 pool_shrink_whatprovides(pool);
500 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)));
502 queue_empty(&pool->lazywhatprovidesq);
503 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
505 if (!pool->addedfileprovides)
506 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
507 /* lazyly add file provides */
508 for (i = 1; i < num; i++)
510 const char *str = pool->ss.stringspace + pool->ss.strings[i];
513 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
515 /* setup lazy adding, but remember old value */
516 if (pool->whatprovides[i] > 1)
517 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
518 pool->whatprovides[i] = 0;
520 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
523 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
527 * free all of our whatprovides data
528 * be careful, everything internalized with pool_queuetowhatprovides is
532 pool_freewhatprovides(Pool *pool)
534 pool->whatprovides = solv_free(pool->whatprovides);
535 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
536 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
537 pool->whatprovidesdataoff = 0;
538 pool->whatprovidesdataleft = 0;
542 /******************************************************************************/
545 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
547 * used for whatprovides, jobs, learnt rules, selections
548 * input: q: queue of Ids
549 * returns: Offset into whatprovidesdata
553 pool_queuetowhatprovides(Pool *pool, Queue *q)
556 int count = q->count;
558 if (count == 0) /* queue empty -> 1 */
560 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
563 /* extend whatprovidesdata if needed, +1 for 0-termination */
564 if (pool->whatprovidesdataleft < count + 1)
566 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
567 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
568 pool->whatprovidesdataleft = count + 4096;
571 /* copy queue to next free slot */
572 off = pool->whatprovidesdataoff;
573 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
575 /* adapt count and 0-terminate */
576 pool->whatprovidesdataoff += count;
577 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
578 pool->whatprovidesdataleft -= count + 1;
584 /*************************************************************************/
586 #if defined(MULTI_SEMANTICS)
587 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
588 #elif defined(DEBIAN)
589 # define EVRCMP_DEPCMP EVRCMP_COMPARE
591 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
594 /* check if a package's nevr matches a dependency */
595 /* semi-private, called from public pool_match_nevr */
598 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
600 Reldep *rd = GETRELDEP(pool, d);
603 int flags = rd->flags;
612 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
615 return pool_match_nevr(pool, s, name);
617 if (pool_match_nevr(pool, s, name))
619 return pool_match_nevr(pool, s, evr);
622 if (!pool_match_nevr(pool, s, name))
624 return pool_match_nevr(pool, s, evr);
628 /* XXX : need to check for Multi-Arch: allowed! */
629 return pool_match_nevr(pool, s, name);
634 if (!pool_match_nevr(pool, s, name))
637 return (flags & REL_EQ) ? 1 : 0;
642 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
647 return (flags & REL_LT) ? 1 : 0;
649 return (flags & REL_EQ) ? 1 : 0;
651 return (flags & REL_GT) ? 1 : 0;
653 return (flags & REL_EQ) ? 1 : 0;
660 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
661 /* forward declaration */
662 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
665 /* match (flags, evr) against provider (pflags, pevr) */
667 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
669 if (!pflags || !flags || pflags >= 8 || flags >= 8)
671 if (flags == 7 || pflags == 7)
672 return 1; /* rel provides every version */
673 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
674 return 1; /* both rels show in the same direction */
676 return (flags & pflags & REL_EQ) ? 1 : 0;
677 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
680 Reldep *rd = GETRELDEP(pool, pevr);
681 if (rd->flags == REL_COMPAT)
682 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
685 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
688 return (pflags & REL_EQ) ? 1 : 0;
690 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
692 return (flags & pflags & REL_EQ) ? 1 : 0;
694 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
696 return (flags & REL_EQ) ? 1 : 0;
703 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
705 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
707 /* range->name is the actual version, range->evr the backwards compatibility
708 version. If flags are '>=' or '>', we match the compatibility version
709 as well, otherwise only the actual version. */
710 if (!(flags & REL_GT) || (flags & REL_LT))
711 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
712 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
713 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
717 /* public (i.e. not inlined) version of pool_match_flags_evr */
719 pool_intersect_evrs(Pool *pool, int pflags, Id pevr, int flags, int evr)
721 return pool_match_flags_evr(pool, pflags, pevr, flags, evr);
724 /* match two dependencies (d1 = provider) */
727 pool_match_dep(Pool *pool, Id d1, Id d2)
737 rd2 = GETRELDEP(pool, d2);
738 return pool_match_dep(pool, d1, rd2->name);
740 rd1 = GETRELDEP(pool, d1);
743 return pool_match_dep(pool, rd1->name, d2);
745 rd2 = GETRELDEP(pool, d2);
746 /* first match name */
747 if (!pool_match_dep(pool, rd1->name, rd2->name))
749 /* name matches, check flags and evr */
750 return pool_intersect_evrs(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
754 pool_searchlazywhatprovidesq(Pool *pool, Id d)
757 int end = pool->lazywhatprovidesq.count;
761 elements = pool->lazywhatprovidesq.elements;
762 while (end - start > 16)
764 int mid = (start + end) / 2 & ~1;
765 if (elements[mid] == d)
766 return elements[mid + 1];
767 if (elements[mid] < d)
772 for (; start < end; start += 2)
773 if (elements[start] == d)
774 return elements[start + 1];
781 * lazy populating of the whatprovides array, non relation case
784 pool_addstdproviders(Pool *pool, Id d)
792 if (pool->addedfileprovides == 2)
794 pool->whatprovides[d] = 1;
797 str = pool->ss.stringspace + pool->ss.strings[d];
800 pool->whatprovides[d] = 1;
803 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
804 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES|SEARCH_COMPLETE_FILELIST);
805 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
807 Solvable *s = pool->solvables + di.solvid;
808 /* XXX: maybe should add a provides dependency to the solvables
809 * OTOH this is only needed for rel deps that filter the provides,
810 * and those should not use filelist entries */
811 if (s->repo->disabled)
813 if (s->repo != pool->installed && !pool_installable(pool, s))
815 queue_push(&q, di.solvid);
817 dataiterator_free(&di);
818 oldoffset = pool_searchlazywhatprovidesq(pool, d);
820 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
825 Id *oo = pool->whatprovidesdata + oldoffset;
827 /* unify both queues. easy, as we know both are sorted */
828 for (i = 0; i < q.count; i++)
830 if (*oo > q.elements[i])
832 if (*oo < q.elements[i])
833 queue_insert(&q, i, *oo);
839 queue_push(&q, *oo++);
840 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
842 /* end result has same size as oldoffset -> no new entries */
844 pool->whatprovides[d] = oldoffset;
848 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
851 return pool->whatprovides[d];
856 pool_is_kind(Pool *pool, Id name, Id kind)
861 n = pool_id2str(pool, name);
864 const char *kn = pool_id2str(pool, kind);
865 int knl = strlen(kn);
866 return !strncmp(n, kn, knl) && n[knl] == ':' ? 1 : 0;
872 while(*n >= 'a' && *n <= 'z')
874 return *n == ':' ? 0 : 1;
881 * add packages fulfilling the relation to whatprovides array
885 pool_addrelproviders(Pool *pool, Id d)
896 return pool_addstdproviders(pool, d);
897 rd = GETRELDEP(pool, d);
902 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
906 /* special relation */
914 wp = pool_whatprovides(pool, name);
915 pp2 = pool_whatprovides_ptr(pool, evr);
916 pp = pool->whatprovidesdata + wp;
917 while ((p = *pp++) != 0)
919 for (pp3 = pp2; *pp3; pp3++)
923 queue_push(&plist, p); /* found it */
929 wp = pool_whatprovides(pool, name);
930 pp = pool->whatprovidesdata + wp;
932 wp = pool_whatprovides(pool, evr);
936 while ((p = *pp++) != 0)
937 queue_push(&plist, p);
939 pp = pool_whatprovides_ptr(pool, evr);
940 while ((p = *pp++) != 0)
941 queue_pushunique(&plist, p);
942 if (plist.count != cnt)
947 if (name == NAMESPACE_OTHERPROVIDERS)
949 wp = pool_whatprovides(pool, evr);
952 if (pool->nscallback)
954 /* ask callback which packages provide the dependency
956 * 1: the system (aka SYSTEMSOLVABLE)
957 * >1: set of packages, stored as offset on whatprovidesdata
959 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
963 queue_push(&plist, SYSTEMSOLVABLE);
967 /* small hack: make it possible to match <pkg>.src
968 * we have to iterate over the solvables as src packages do not
969 * provide anything, thus they are not indexed in our
970 * whatprovides hash */
971 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
974 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
978 if (s->arch != evr && s->arch != ARCH_NOSRC)
980 if (pool_disabled_solvable(pool, s))
982 if (!name || pool_match_nevr(pool, s, name))
983 queue_push(&plist, p);
989 FOR_POOL_SOLVABLES(p)
991 Solvable *s = pool->solvables + p;
992 if (s->repo != pool->installed && !pool_installable(pool, s))
995 queue_push(&plist, p);
999 wp = pool_whatprovides(pool, name);
1000 pp = pool->whatprovidesdata + wp;
1001 while ((p = *pp++) != 0)
1003 Solvable *s = pool->solvables + p;
1005 queue_push(&plist, p);
1011 if (evr != ARCH_ANY)
1013 /* XXX : need to check for Multi-Arch: allowed! */
1014 wp = pool_whatprovides(pool, name);
1017 /* package kind filtering */
1020 FOR_POOL_SOLVABLES(p)
1022 Solvable *s = pool->solvables + p;
1023 if (s->repo != pool->installed && !pool_installable(pool, s))
1025 if (pool_is_kind(pool, s->name, evr))
1026 queue_push(&plist, p);
1030 wp = pool_whatprovides(pool, name);
1031 pp = pool->whatprovidesdata + wp;
1032 while ((p = *pp++) != 0)
1034 Solvable *s = pool->solvables + p;
1035 if (pool_is_kind(pool, s->name, evr))
1036 queue_push(&plist, p);
1041 case REL_FILECONFLICT:
1042 pp = pool_whatprovides_ptr(pool, name);
1043 while ((p = *pp++) != 0)
1045 Id origd = MAKERELDEP(d);
1046 Solvable *s = pool->solvables + p;
1049 pidp = s->repo->idarraydata + s->provides;
1050 while ((pid = *pidp++) != 0)
1054 queue_push(&plist, p);
1062 /* we can reuse an existing entry */
1064 pool->whatprovides_rel[d] = wp;
1070 /* simple version comparison relation */
1072 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1074 pp = pool_whatprovides_ptr(pool, name);
1075 while (ISRELDEP(name))
1077 rd = GETRELDEP(pool, name);
1080 while ((p = *pp++) != 0)
1082 Solvable *s = pool->solvables + p;
1085 /* no provides - check nevr */
1086 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1087 queue_push(&plist, p);
1090 /* solvable p provides name in some rels */
1091 pidp = s->repo->idarraydata + s->provides;
1092 while ((pid = *pidp++) != 0)
1097 continue; /* wrong provides name */
1098 if (pool->disttype == DISTTYPE_DEB)
1099 continue; /* unversioned provides can never match versioned deps */
1102 prd = GETRELDEP(pool, pid);
1103 if (prd->name != name)
1104 continue; /* wrong provides name */
1105 /* right package, both deps are rels. check flags/evr */
1106 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1107 break; /* matches */
1110 continue; /* none of the providers matched */
1111 queue_push(&plist, p);
1113 /* make our system solvable provide all unknown rpmlib() stuff */
1114 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1115 queue_push(&plist, SYSTEMSOLVABLE);
1117 /* add providers to whatprovides */
1119 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1121 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1124 return pool->whatprovides_rel[d];
1128 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1130 int nrels = pool->nrels;
1134 if (!pool->whatprovides_rel)
1136 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1138 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1140 if (ns && rd->name != ns)
1142 if (evr && rd->evr != evr)
1144 pool->whatprovides_rel[d] = 0;
1148 /* intersect dependencies in keyname with dep, return list of matching packages */
1150 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1155 FOR_POOL_SOLVABLES(p)
1157 Solvable *s = pool->solvables + p;
1158 if (s->repo->disabled)
1160 if (s->repo != pool->installed && !pool_installable(pool, s))
1162 if (solvable_matchesdep(s, keyname, dep, marker))
1167 /*************************************************************************/
1170 pool_debug(Pool *pool, int type, const char *format, ...)
1175 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1177 if ((pool->debugmask & type) == 0)
1180 va_start(args, format);
1181 if (!pool->debugcallback)
1183 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1184 vprintf(format, args);
1186 vfprintf(stderr, format, args);
1189 vsnprintf(buf, sizeof(buf), format, args);
1191 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1195 pool_error(Pool *pool, int ret, const char *format, ...)
1199 va_start(args, format);
1202 pool->errstra = 1024;
1203 pool->errstr = solv_malloc(pool->errstra);
1211 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1213 if (l >= 0 && l + 1 > pool->errstra)
1215 pool->errstra = l + 256;
1216 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1217 va_start(args, format);
1218 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1222 strcpy(pool->errstr, "unknown error");
1223 if (pool->debugmask & SOLV_ERROR)
1224 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1229 pool_errstr(Pool *pool)
1231 return pool->errstr ? pool->errstr : "no error";
1235 pool_setdebuglevel(Pool *pool, int level)
1237 int mask = SOLV_DEBUG_RESULT;
1239 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1241 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1243 mask |= SOLV_DEBUG_PROPAGATE;
1245 mask |= SOLV_DEBUG_RULE_CREATION;
1246 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1247 pool->debugmask = mask;
1250 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1252 pool->debugcallback = debugcallback;
1253 pool->debugcallbackdata = debugcallbackdata;
1256 void pool_setdebugmask(Pool *pool, int mask)
1258 pool->debugmask = mask;
1261 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
1263 pool->loadcallback = cb;
1264 pool->loadcallbackdata = loadcbdata;
1267 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct _Pool *, void *, Id, Id), void *nscbdata)
1269 pool->nscallback = cb;
1270 pool->nscallbackdata = nscbdata;
1273 /*************************************************************************/
1275 struct searchfiles {
1283 #define SEARCHFILES_BLOCK 127
1286 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1290 struct searchfiles *csf;
1292 while ((dep = *ida++) != 0)
1295 while (ISRELDEP(dep))
1298 sid = pool->ss.nstrings + GETRELID(dep);
1299 if (MAPTST(&csf->seen, sid))
1304 MAPSET(&csf->seen, sid);
1305 rd = GETRELDEP(pool, dep);
1308 else if (rd->flags == REL_NAMESPACE)
1310 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1313 if (!csf || MAPTST(&csf->seen, sid))
1318 MAPSET(&csf->seen, sid);
1322 else if (rd->flags == REL_FILECONFLICT)
1332 pool_addfileprovides_dep(pool, ids, csf, isf);
1338 if (MAPTST(&csf->seen, dep))
1340 MAPSET(&csf->seen, dep);
1341 s = pool_id2str(pool, dep);
1344 if (csf != isf && pool->addedfileprovides == 1 && !repodata_filelistfilter_matches(0, s))
1345 continue; /* skip non-standard locations csf == isf: installed case */
1346 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1347 csf->dirs = solv_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1348 csf->names = solv_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
1349 csf->ids[csf->nfiles] = dep;
1350 sr = strrchr(s, '/');
1351 csf->names[csf->nfiles] = solv_strdup(sr + 1);
1352 csf->dirs[csf->nfiles] = solv_malloc(sr - s + 1);
1354 strncpy(csf->dirs[csf->nfiles], s, sr - s);
1355 csf->dirs[csf->nfiles][sr - s] = 0;
1360 struct addfileprovides_cbdata {
1374 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1376 struct addfileprovides_cbdata *cbd = cbdata;
1379 if (!cbd->useddirs.size)
1381 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1382 for (i = 0; i < cbd->nfiles; i++)
1385 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1390 did = repodata_str2dir(data, cbd->dirs[i], 0);
1393 MAPSET(&cbd->useddirs, did);
1395 repodata_free_dircache(data);
1397 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1399 for (i = 0; i < cbd->nfiles; i++)
1401 if (cbd->dids[i] != value->id)
1403 if (!strcmp(cbd->names[i], value->str))
1406 if (i == cbd->nfiles)
1408 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1413 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1418 Queue fileprovidesq;
1419 int i, j, repoid, repodataid;
1420 int provstart, provend;
1422 int ndone, incomplete;
1427 cbd->nfiles = sf->nfiles;
1429 cbd->dirs = sf->dirs;
1430 cbd->names = sf->names;
1431 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1432 map_init(&cbd->providedids, pool->ss.nstrings);
1435 repo = repoonly ? repoonly : pool->repos[repoid];
1436 map_init(&donemap, pool->nsolvables);
1437 queue_init(&fileprovidesq);
1438 provstart = provend = 0;
1441 if (!repo || repo->disabled)
1443 if (repoonly || ++repoid == pool->nrepos)
1445 repo = pool->repos[repoid];
1449 FOR_REPODATAS(repo, repodataid, data)
1451 if (ndone >= repo->nsolvables)
1454 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1456 map_empty(&cbd->providedids);
1457 for (i = 0; i < fileprovidesq.count; i++)
1458 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1459 provstart = data->start;
1460 provend = data->end;
1461 for (i = 0; i < cbd->nfiles; i++)
1462 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1464 if (i == cbd->nfiles)
1466 /* great! no need to search files */
1467 for (p = data->start; p < data->end; p++)
1468 if (pool->solvables[p].repo == repo)
1470 if (MAPTST(&donemap, p))
1472 MAPSET(&donemap, p);
1479 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1482 if (data->start < provstart || data->end > provend)
1484 map_empty(&cbd->providedids);
1485 provstart = provend = 0;
1488 /* check if the data is incomplete */
1490 if (data->state == REPODATA_AVAILABLE)
1492 for (j = 1; j < data->nkeys; j++)
1493 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1495 if (j < data->nkeys)
1498 for (i = 0; i < cbd->nfiles; i++)
1499 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1500 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1502 for (i = 0; i < cbd->nfiles; i++)
1503 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1505 if (i < cbd->nfiles)
1511 map_init(&cbd->useddirs, 0);
1512 for (p = data->start; p < data->end; p++)
1513 if (pool->solvables[p].repo == repo)
1515 if (MAPTST(&donemap, p))
1517 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1520 MAPSET(&donemap, p);
1524 map_free(&cbd->useddirs);
1527 if (repoonly || ++repoid == pool->nrepos)
1529 repo = pool->repos[repoid];
1532 queue_free(&fileprovidesq);
1533 map_free(&cbd->providedids);
1537 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1540 Repo *installed, *repo;
1541 struct searchfiles sf, isf, *isfp;
1542 struct addfileprovides_cbdata cbd;
1546 installed = pool->installed;
1547 now = solv_timems(0);
1548 memset(&sf, 0, sizeof(sf));
1549 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1550 memset(&isf, 0, sizeof(isf));
1551 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1552 pool->addedfileprovides = pool->addfileprovidesfiltered ? 1 : 2;
1557 queue_empty(idqinst);
1558 isfp = installed ? &isf : 0;
1559 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1565 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1567 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1569 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1571 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1573 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1575 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1577 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1580 map_free(&isf.seen);
1581 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1586 for (i = 0; i < sf.nfiles; i++)
1587 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1589 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1591 for (i = 0; i < sf.nfiles; i++)
1592 queue_push(idq, sf.ids[i]);
1594 for (i = 0; i < sf.nfiles; i++)
1595 queue_push(idqinst, sf.ids[i]);
1597 for (i = 0; i < sf.nfiles; i++)
1599 solv_free(sf.dirs[i]);
1600 solv_free(sf.names[i]);
1603 solv_free(sf.names);
1608 for (i = 0; i < isf.nfiles; i++)
1609 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1612 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1613 if (installed && idqinst)
1614 for (i = 0; i < isf.nfiles; i++)
1615 queue_pushunique(idqinst, isf.ids[i]);
1617 for (i = 0; i < isf.nfiles; i++)
1619 solv_free(isf.dirs[i]);
1620 solv_free(isf.names[i]);
1622 solv_free(isf.dirs);
1623 solv_free(isf.names);
1625 solv_free(cbd.dids);
1626 pool_freewhatprovides(pool); /* as we have added provides */
1627 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1631 pool_addfileprovides(Pool *pool)
1633 pool_addfileprovides_queue(pool, 0, 0);
1637 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)
1641 if (pool->solvables[p].repo)
1642 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1645 /* FIXME: obey callback return value! */
1646 for (p = 1; p < pool->nsolvables; p++)
1647 if (pool->solvables[p].repo)
1648 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1652 pool_clear_pos(Pool *pool)
1654 memset(&pool->pos, 0, sizeof(pool->pos));
1659 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1663 pool->languagecache = solv_free(pool->languagecache);
1664 pool->languagecacheother = 0;
1665 for (i = 0; i < pool->nlanguages; i++)
1666 free((char *)pool->languages[i]);
1667 pool->languages = solv_free(pool->languages);
1668 pool->nlanguages = nlanguages;
1671 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1672 for (i = 0; i < pool->nlanguages; i++)
1673 pool->languages[i] = solv_strdup(languages[i]);
1677 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1683 if (!lang || !*lang)
1685 n = pool_id2str(pool, id);
1686 l = strlen(n) + strlen(lang) + 2;
1687 if (l > sizeof(buf))
1688 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1691 sprintf(p, "%s:%s", n, lang);
1692 id = pool_str2id(pool, p, create);
1699 pool_alloctmpspace(Pool *pool, int len)
1701 int n = pool->tmpspace.n;
1704 if (len > pool->tmpspace.len[n])
1706 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1707 pool->tmpspace.len[n] = len + 32;
1709 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1710 return pool->tmpspace.buf[n];
1714 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1719 n = oldn = pool->tmpspace.n;
1723 n = POOL_TMPSPACEBUF - 1;
1726 if (pool->tmpspace.buf[n] != space)
1728 if (len > pool->tmpspace.len[n])
1730 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1731 pool->tmpspace.len[n] = len + 32;
1733 return pool->tmpspace.buf[n];
1740 pool_freetmpspace(Pool *pool, const char *space)
1742 int n = pool->tmpspace.n;
1745 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1746 if (pool->tmpspace.buf[n] == space)
1747 pool->tmpspace.n = n;
1751 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1755 l1 = str1 ? strlen(str1) : 0;
1756 l2 = str2 ? strlen(str2) : 0;
1757 l3 = str3 ? strlen(str3) : 0;
1758 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1779 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1784 l1 = str1 ? strlen(str1) : 0;
1785 l2 = str2 ? strlen(str2) : 0;
1786 l3 = str3 ? strlen(str3) : 0;
1787 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1791 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1814 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1819 s = pool_alloctmpspace(pool, 2 * len + 1);
1820 solv_bin2hex(buf, len, s);
1824 /*******************************************************************/
1836 struct mptree *mptree;
1847 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1849 struct ducbdata *cbd = cbdata;
1852 if (data != cbd->olddata)
1854 Id dn, mp, comp, *dirmap, *dirs;
1856 const char *compstr;
1857 struct mptree *mptree;
1859 /* create map from dir to mptree */
1860 cbd->dirmap = solv_free(cbd->dirmap);
1862 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1863 mptree = cbd->mptree;
1865 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1879 if (!mptree[mp].child)
1884 if (data->localpool)
1885 compstr = stringpool_id2str(&data->spool, comp);
1887 compstr = pool_id2str(data->repo->pool, comp);
1888 compl = strlen(compstr);
1889 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1890 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1892 dirmap[dn] = i ? i : -mp;
1894 /* change dirmap to point to mountpoint instead of mptree */
1895 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1898 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1900 cbd->dirmap = dirmap;
1901 cbd->nmap = data->dirpool.ndirs;
1902 cbd->olddata = data;
1905 if (value->id < 0 || value->id >= cbd->nmap)
1907 mp = cbd->dirmap[value->id];
1910 if (cbd->addsub > 0)
1912 cbd->mps[mp].kbytes += value->num;
1913 cbd->mps[mp].files += value->num2;
1917 cbd->mps[mp].kbytes -= value->num;
1918 cbd->mps[mp].files -= value->num2;
1924 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1927 if (mptree[pos].mountpoint == -1)
1928 mptree[pos].mountpoint = mountpoint;
1930 mountpoint = mptree[pos].mountpoint;
1931 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1932 propagate_mountpoints(mptree, i, mountpoint);
1935 #define MPTREE_BLOCK 15
1937 static struct mptree *
1938 create_mptree(DUChanges *mps, int nmps)
1941 struct mptree *mptree;
1944 const char *p, *path, *compstr;
1946 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1949 mptree[0].sibling = 0;
1950 mptree[0].child = 0;
1952 mptree[0].compl = 0;
1953 mptree[0].mountpoint = -1;
1956 /* create component tree */
1957 for (mp = 0; mp < nmps; mp++)
1962 path = mps[mp].path;
1967 if ((p = strchr(path, '/')) == 0)
1970 compl = strlen(compstr);
1981 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1982 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1986 /* create new node */
1987 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1989 mptree[i].sibling = mptree[pos].child;
1990 mptree[i].child = 0;
1991 mptree[i].comp = compstr;
1992 mptree[i].compl = compl;
1993 mptree[i].mountpoint = -1;
1994 mptree[pos].child = i;
1998 mptree[pos].mountpoint = mp;
2001 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
2004 for (i = 0; i < nmptree; i++)
2006 printf("#%d sibling: %d\n", i, mptree[i].sibling);
2007 printf("#%d child: %d\n", i, mptree[i].child);
2008 printf("#%d comp: %s\n", i, mptree[i].comp);
2009 printf("#%d compl: %d\n", i, mptree[i].compl);
2010 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
2018 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
2020 struct mptree *mptree;
2021 struct ducbdata cbd;
2025 Repo *oldinstalled = pool->installed;
2027 map_init(&ignoredu, 0);
2028 mptree = create_mptree(mps, nmps);
2034 cbd.mptree = mptree;
2036 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2038 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2040 if (!MAPTST(installedmap, sp))
2043 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2044 if (!cbd.hasdu && oldinstalled)
2047 /* no du data available, ignore data of all installed solvables we obsolete */
2049 map_grow(&ignoredu, oldinstalled->end - oldinstalled->start);
2052 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2053 while ((obs = *obsp++) != 0)
2054 FOR_PROVIDES(op, opp, obs)
2055 if (op >= oldinstalled->start && op < oldinstalled->end)
2056 MAPSET(&ignoredu, op - oldinstalled->start);
2058 FOR_PROVIDES(op, opp, s->name)
2059 if (pool->solvables[op].name == s->name)
2060 if (op >= oldinstalled->start && op < oldinstalled->end)
2061 MAPSET(&ignoredu, op - oldinstalled->start);
2067 /* assumes we allways have du data for installed solvables */
2068 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2070 if (MAPTST(installedmap, sp))
2072 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
2074 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2077 map_free(&ignoredu);
2078 solv_free(cbd.dirmap);
2083 pool_calc_installsizechange(Pool *pool, Map *installedmap)
2088 Repo *oldinstalled = pool->installed;
2090 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2092 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2094 if (!MAPTST(installedmap, sp))
2096 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2100 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2102 if (MAPTST(installedmap, sp))
2104 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2112 * 2: conflicts with installed
2113 * 8: interesting (only true if installed)
2117 static inline Id dep2name(Pool *pool, Id dep)
2119 while (ISRELDEP(dep))
2121 Reldep *rd = GETRELDEP(pool, dep);
2127 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
2130 Solvable *sn = pool->solvables + n;
2132 FOR_PROVIDES(p, pp, sn->name)
2134 Solvable *s = pool->solvables + p;
2135 if (s->name != sn->name || s->arch != sn->arch)
2137 if ((map[p] & 9) != 9)
2139 if (pool_match_nevr(pool, pool->solvables + p, con))
2141 return 1; /* found installed package that doesn't conflict */
2146 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
2150 FOR_PROVIDES(p, pp, dep)
2152 if (p == SYSTEMSOLVABLE)
2153 return 1; /* always boring, as never constraining */
2154 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
2156 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
2157 if (providedbyinstalled_multiversion(pool, map, p, dep))
2159 if ((map[p] & 9) == 9)
2167 * pool_trivial_installable - calculate if a set of solvables is
2168 * trivial installable without any other installs/deinstalls of
2169 * packages not belonging to the set.
2171 * the state is returned in the result queue:
2172 * 1: solvable is installable without any other package changes
2173 * 0: solvable is not installable
2174 * -1: solvable is installable, but doesn't constrain any installed packages
2178 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
2181 Id p, *dp, con, *conp, req, *reqp;
2185 map = solv_calloc(pool->nsolvables, 1);
2186 for (p = 1; p < pool->nsolvables; p++)
2188 if (!MAPTST(installedmap, p))
2191 s = pool->solvables + p;
2194 conp = s->repo->idarraydata + s->conflicts;
2195 while ((con = *conp++) != 0)
2197 dp = pool_whatprovides_ptr(pool, con);
2199 map[p] |= 2; /* XXX: self conflict ? */
2202 for (i = 0; i < pkgs->count; i++)
2203 map[pkgs->elements[i]] = 16;
2205 for (i = 0, did = 0; did < pkgs->count; i++, did++)
2207 if (i == pkgs->count)
2209 p = pkgs->elements[i];
2210 if ((map[p] & 16) == 0)
2212 if ((map[p] & 2) != 0)
2217 s = pool->solvables + p;
2221 reqp = s->repo->idarraydata + s->requires;
2222 while ((req = *reqp++) != 0)
2224 if (req == SOLVABLE_PREREQMARKER)
2226 r = providedbyinstalled(pool, map, req, 0, 0);
2229 /* decided and miss */
2235 break; /* undecided */
2236 m |= r; /* 1 | 9 | 17 */
2245 int ispatch = 0; /* see solver.c patch handling */
2247 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
2249 conp = s->repo->idarraydata + s->conflicts;
2250 while ((con = *conp++) != 0)
2252 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2258 if ((m == 1 || m == 17) && ISRELDEP(con))
2260 con = dep2name(pool, con);
2261 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2266 continue; /* found a conflict */
2269 if (s->repo && s->repo != oldinstalled)
2271 Id p2, obs, *obsp, *pp;
2275 obsp = s->repo->idarraydata + s->obsoletes;
2276 while ((obs = *obsp++) != 0)
2278 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2287 FOR_PROVIDES(p2, pp, s->name)
2289 s2 = pool->solvables + p2;
2290 if (s2->name == s->name && (map[p2] & 1) != 0)
2307 queue_init_clone(res, pkgs);
2308 for (i = 0; i < pkgs->count; i++)
2310 m = map[pkgs->elements[i]];
2317 res->elements[i] = r;
2323 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2325 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2329 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2331 if (entry == SOLVID_POS && pool->pos.repo)
2332 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2335 return solvable_lookup_str(pool->solvables + entry, keyname);
2339 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2341 if (entry == SOLVID_POS && pool->pos.repo)
2342 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2345 return solvable_lookup_id(pool->solvables + entry, keyname);
2349 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2351 if (entry == SOLVID_POS && pool->pos.repo)
2352 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
2355 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2359 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2361 if (entry == SOLVID_POS && pool->pos.repo)
2362 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2365 return solvable_lookup_void(pool->solvables + entry, keyname);
2368 const unsigned char *
2369 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2371 if (entry == SOLVID_POS && pool->pos.repo)
2372 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2375 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2379 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2381 if (entry == SOLVID_POS && pool->pos.repo)
2382 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2385 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2389 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
2391 if (entry == SOLVID_POS && pool->pos.repo)
2392 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
2395 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
2399 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2404 if (entry != SOLVID_POS)
2406 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2407 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2408 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2409 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2414 add_new_provider(Pool *pool, Id id, Id p)
2419 while (ISRELDEP(id))
2421 Reldep *rd = GETRELDEP(pool, id);
2426 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2438 queue_push(&q, *pp);
2442 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2447 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2449 int hadhashes = pool->relhashtbl ? 1 : 0;
2455 if (!conflicts->count)
2457 for (i = 0; i < conflicts->count; i += 6)
2459 fn = conflicts->elements[i];
2460 p = conflicts->elements[i + 1];
2461 md5 = conflicts->elements[i + 2];
2462 q = conflicts->elements[i + 4];
2463 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2464 s = pool->solvables + p;
2467 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2468 if (pool->whatprovides)
2469 add_new_provider(pool, fn, p);
2470 if (pool->whatprovides_rel)
2471 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2472 s = pool->solvables + q;
2475 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2478 pool_freeidhashes(pool);
2482 pool_prepend_rootdir(Pool *pool, const char *path)
2487 return solv_strdup(path);
2488 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2492 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2498 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2502 pool_set_rootdir(Pool *pool, const char *rootdir)
2504 solv_free(pool->rootdir);
2505 pool->rootdir = solv_strdup(rootdir);
2509 pool_get_rootdir(Pool *pool)
2511 return pool->rootdir;
2514 /* only used in libzypp */
2516 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2518 pool->custom_vendorcheck = vendorcheck;