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((void *)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);
145 pool_setdisttype(Pool *pool, int disttype)
147 #ifdef MULTI_SEMANTICS
148 int olddisttype = pool->disttype;
152 pool->noarchid = ARCH_NOARCH;
155 pool->noarchid = ARCH_ALL;
159 pool->noarchid = ARCH_ANY;
164 pool->disttype = disttype;
165 pool->solvables[SYSTEMSOLVABLE].arch = pool->noarchid;
168 return pool->disttype == disttype ? disttype : -1;
173 pool_get_flag(Pool *pool, int flag)
177 case POOL_FLAG_PROMOTEEPOCH:
178 return pool->promoteepoch;
179 case POOL_FLAG_FORBIDSELFCONFLICTS:
180 return pool->forbidselfconflicts;
181 case POOL_FLAG_OBSOLETEUSESPROVIDES:
182 return pool->obsoleteusesprovides;
183 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
184 return pool->implicitobsoleteusesprovides;
185 case POOL_FLAG_OBSOLETEUSESCOLORS:
186 return pool->obsoleteusescolors;
187 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
188 return pool->implicitobsoleteusescolors;
189 case POOL_FLAG_NOINSTALLEDOBSOLETES:
190 return pool->noinstalledobsoletes;
191 case POOL_FLAG_HAVEDISTEPOCH:
192 return pool->havedistepoch;
193 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
194 return pool->noobsoletesmultiversion;
195 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
196 return pool->addfileprovidesfiltered;
204 pool_set_flag(Pool *pool, int flag, int value)
206 int old = pool_get_flag(pool, flag);
209 case POOL_FLAG_PROMOTEEPOCH:
210 pool->promoteepoch = value;
212 case POOL_FLAG_FORBIDSELFCONFLICTS:
213 pool->forbidselfconflicts = value;
215 case POOL_FLAG_OBSOLETEUSESPROVIDES:
216 pool->obsoleteusesprovides = value;
218 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
219 pool->implicitobsoleteusesprovides = value;
221 case POOL_FLAG_OBSOLETEUSESCOLORS:
222 pool->obsoleteusescolors = value;
224 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
225 pool->implicitobsoleteusescolors = value;
227 case POOL_FLAG_NOINSTALLEDOBSOLETES:
228 pool->noinstalledobsoletes = value;
230 case POOL_FLAG_HAVEDISTEPOCH:
231 pool->havedistepoch = value;
233 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
234 pool->noobsoletesmultiversion = value;
236 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
237 pool->addfileprovidesfiltered = value;
247 pool_add_solvable(Pool *pool)
249 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
250 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
251 return pool->nsolvables++;
255 pool_add_solvable_block(Pool *pool, int count)
257 Id nsolvables = pool->nsolvables;
260 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
261 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
262 pool->nsolvables += count;
267 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
271 if (reuseids && start + count == pool->nsolvables)
273 /* might want to shrink solvable array */
274 pool->nsolvables = start;
277 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
282 pool_set_installed(Pool *pool, Repo *installed)
284 if (pool->installed == installed)
286 pool->installed = installed;
287 pool_freewhatprovides(pool);
291 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
296 oa = pool->whatprovides[*(Id *)ap];
297 ob = pool->whatprovides[*(Id *)bp];
299 return *(Id *)ap - *(Id *)bp;
300 da = pool->whatprovidesdata + oa;
301 db = pool->whatprovidesdata + ob;
303 if ((r = (*da++ - *db++)) != 0)
307 return *(Id *)ap - *(Id *)bp;
311 * pool_shrink_whatprovides - unify whatprovides data
313 * whatprovides_rel must be empty for this to work!
317 pool_shrink_whatprovides(Pool *pool)
321 Id lastid, *last, *dp, *lp;
325 if (pool->ss.nstrings < 3)
327 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
328 for (i = id = 0; id < pool->ss.nstrings; id++)
329 if (pool->whatprovides[id] >= 4)
332 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
335 for (i = 0; i < n; i++)
338 o = pool->whatprovides[id];
339 dp = pool->whatprovidesdata + o;
353 pool->whatprovides[id] = -lastid;
357 last = pool->whatprovidesdata + o;
361 dp = pool->whatprovidesdata + 4;
362 for (id = 1; id < pool->ss.nstrings; id++)
364 o = pool->whatprovides[id];
372 pool->whatprovides[id] = pool->whatprovides[i];
377 lp = pool->whatprovidesdata + o;
380 pool->whatprovides[id] = dp - pool->whatprovidesdata;
381 while ((*dp++ = *lp++) != 0)
384 o = dp - pool->whatprovidesdata;
385 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
386 if (pool->whatprovidesdataoff == o)
388 r = pool->whatprovidesdataoff - o;
389 pool->whatprovidesdataoff = o;
390 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
391 if (r > pool->whatprovidesdataleft)
392 r = pool->whatprovidesdataleft;
393 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
398 * pool_createwhatprovides()
400 * create hashes over pool of solvables to ease provide lookups
404 pool_createwhatprovides(Pool *pool)
406 int i, num, np, extra;
411 Offset *whatprovides;
412 Id *whatprovidesdata, *d;
413 Repo *installed = pool->installed;
416 now = solv_timems(0);
417 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
418 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
419 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);
420 if (pool->ss.stringhashmask || pool->relhashmask)
421 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)));
423 pool_freeidhashes(pool); /* XXX: should not be here! */
424 pool_freewhatprovides(pool);
425 num = pool->ss.nstrings;
426 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
427 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
429 /* count providers for each name */
430 for (i = pool->nsolvables - 1; i > 0; i--)
433 s = pool->solvables + i;
434 if (!s->provides || !s->repo || s->repo->disabled)
436 /* we always need the installed solvable in the whatprovides data,
437 otherwise obsoletes/conflicts on them won't work */
438 if (s->repo != installed && !pool_installable(pool, s))
440 pp = s->repo->idarraydata + s->provides;
441 while ((id = *pp++) != 0)
445 Reldep *rd = GETRELDEP(pool, id);
448 whatprovides[id]++; /* inc count of providers */
452 off = 4; /* first entry is undef, second is empty list, third is system solvable */
453 np = 0; /* number of names provided */
454 for (i = 0, idp = whatprovides; i < num; i++, idp++)
457 if (!n) /* no providers */
459 *idp = 1; /* offset for empty list */
462 off += n; /* make space for all providers */
463 *idp = off++; /* now idp points to terminating zero */
464 np++; /* inc # of provider 'slots' for stats */
467 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
469 /* reserve some space for relation data */
470 extra = 2 * pool->nrels;
474 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
476 /* alloc space for all providers + extra */
477 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
478 whatprovidesdata[2] = SYSTEMSOLVABLE;
480 /* now fill data for all provides */
481 for (i = pool->nsolvables - 1; i > 0; i--)
484 s = pool->solvables + i;
485 if (!s->provides || !s->repo || s->repo->disabled)
487 if (s->repo != installed && !pool_installable(pool, s))
490 /* for all provides of this solvable */
491 pp = s->repo->idarraydata + s->provides;
492 while ((id = *pp++) != 0)
496 Reldep *rd = GETRELDEP(pool, id);
499 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
500 if (*d != i) /* don't add same solvable twice */
507 pool->whatprovidesdata = whatprovidesdata;
508 pool->whatprovidesdataoff = off;
509 pool->whatprovidesdataleft = extra;
510 pool_shrink_whatprovides(pool);
511 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)));
513 queue_empty(&pool->lazywhatprovidesq);
514 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
516 if (!pool->addedfileprovides)
517 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
518 /* lazyly add file provides */
519 for (i = 1; i < num; i++)
521 const char *str = pool->ss.stringspace + pool->ss.strings[i];
524 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
526 /* setup lazy adding, but remember old value */
527 if (pool->whatprovides[i] > 1)
528 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
529 pool->whatprovides[i] = 0;
531 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
534 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
538 * free all of our whatprovides data
539 * be careful, everything internalized with pool_queuetowhatprovides is
543 pool_freewhatprovides(Pool *pool)
545 pool->whatprovides = solv_free(pool->whatprovides);
546 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
547 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
548 pool->whatprovidesdataoff = 0;
549 pool->whatprovidesdataleft = 0;
553 /******************************************************************************/
556 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
558 * used for whatprovides, jobs, learnt rules, selections
559 * input: q: queue of Ids
560 * returns: Offset into whatprovidesdata
564 pool_queuetowhatprovides(Pool *pool, Queue *q)
567 int count = q->count;
569 if (count == 0) /* queue empty -> 1 */
571 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
574 /* extend whatprovidesdata if needed, +1 for 0-termination */
575 if (pool->whatprovidesdataleft < count + 1)
577 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
578 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
579 pool->whatprovidesdataleft = count + 4096;
582 /* copy queue to next free slot */
583 off = pool->whatprovidesdataoff;
584 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
586 /* adapt count and 0-terminate */
587 pool->whatprovidesdataoff += count;
588 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
589 pool->whatprovidesdataleft -= count + 1;
595 /*************************************************************************/
597 #if defined(MULTI_SEMANTICS)
598 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
599 #elif defined(DEBIAN)
600 # define EVRCMP_DEPCMP EVRCMP_COMPARE
602 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
605 /* check if a package's nevr matches a dependency */
606 /* semi-private, called from public pool_match_nevr */
609 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
611 Reldep *rd = GETRELDEP(pool, d);
614 int flags = rd->flags;
623 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
626 return pool_match_nevr(pool, s, name);
628 if (pool_match_nevr(pool, s, name))
630 return pool_match_nevr(pool, s, evr);
633 if (!pool_match_nevr(pool, s, name))
635 return pool_match_nevr(pool, s, evr);
639 /* XXX : need to check for Multi-Arch: allowed! */
640 return pool_match_nevr(pool, s, name);
645 if (!pool_match_nevr(pool, s, name))
648 return (flags & REL_EQ) ? 1 : 0;
653 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
658 return (flags & REL_LT) ? 1 : 0;
660 return (flags & REL_EQ) ? 1 : 0;
662 return (flags & REL_GT) ? 1 : 0;
664 return (flags & REL_EQ) ? 1 : 0;
671 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
672 /* forward declaration */
673 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
676 /* match (flags, evr) against provider (pflags, pevr) */
678 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
680 if (!pflags || !flags || pflags >= 8 || flags >= 8)
682 if (flags == 7 || pflags == 7)
683 return 1; /* rel provides every version */
684 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
685 return 1; /* both rels show in the same direction */
687 return (flags & pflags & REL_EQ) ? 1 : 0;
688 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
691 Reldep *rd = GETRELDEP(pool, pevr);
692 if (rd->flags == REL_COMPAT)
693 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
696 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
699 return (pflags & REL_EQ) ? 1 : 0;
701 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
703 return (flags & pflags & REL_EQ) ? 1 : 0;
705 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
707 return (flags & REL_EQ) ? 1 : 0;
714 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
716 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
718 /* range->name is the actual version, range->evr the backwards compatibility
719 version. If flags are '>=' or '>', we match the compatibility version
720 as well, otherwise only the actual version. */
721 if (!(flags & REL_GT) || (flags & REL_LT))
722 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
723 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
724 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
728 /* public (i.e. not inlined) version of pool_match_flags_evr */
730 pool_intersect_evrs(Pool *pool, int pflags, Id pevr, int flags, int evr)
732 return pool_match_flags_evr(pool, pflags, pevr, flags, evr);
735 /* match two dependencies (d1 = provider) */
738 pool_match_dep(Pool *pool, Id d1, Id d2)
748 rd2 = GETRELDEP(pool, d2);
749 return pool_match_dep(pool, d1, rd2->name);
751 rd1 = GETRELDEP(pool, d1);
754 return pool_match_dep(pool, rd1->name, d2);
756 rd2 = GETRELDEP(pool, d2);
757 /* first match name */
758 if (!pool_match_dep(pool, rd1->name, rd2->name))
760 /* name matches, check flags and evr */
761 return pool_intersect_evrs(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
765 pool_searchlazywhatprovidesq(Pool *pool, Id d)
768 int end = pool->lazywhatprovidesq.count;
772 elements = pool->lazywhatprovidesq.elements;
773 while (end - start > 16)
775 int mid = (start + end) / 2 & ~1;
776 if (elements[mid] == d)
777 return elements[mid + 1];
778 if (elements[mid] < d)
783 for (; start < end; start += 2)
784 if (elements[start] == d)
785 return elements[start + 1];
792 * lazy populating of the whatprovides array, non relation case
795 pool_addstdproviders(Pool *pool, Id d)
803 if (pool->addedfileprovides == 2)
805 pool->whatprovides[d] = 1;
808 str = pool->ss.stringspace + pool->ss.strings[d];
811 pool->whatprovides[d] = 1;
814 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
815 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES|SEARCH_COMPLETE_FILELIST);
816 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
818 Solvable *s = pool->solvables + di.solvid;
819 /* XXX: maybe should add a provides dependency to the solvables
820 * OTOH this is only needed for rel deps that filter the provides,
821 * and those should not use filelist entries */
822 if (s->repo->disabled)
824 if (s->repo != pool->installed && !pool_installable(pool, s))
826 queue_push(&q, di.solvid);
828 dataiterator_free(&di);
829 oldoffset = pool_searchlazywhatprovidesq(pool, d);
831 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
836 Id *oo = pool->whatprovidesdata + oldoffset;
838 /* unify both queues. easy, as we know both are sorted */
839 for (i = 0; i < q.count; i++)
841 if (*oo > q.elements[i])
843 if (*oo < q.elements[i])
844 queue_insert(&q, i, *oo);
850 queue_push(&q, *oo++);
851 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
853 /* end result has same size as oldoffset -> no new entries */
855 pool->whatprovides[d] = oldoffset;
859 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
862 return pool->whatprovides[d];
867 pool_is_kind(Pool *pool, Id name, Id kind)
872 n = pool_id2str(pool, name);
875 const char *kn = pool_id2str(pool, kind);
876 int knl = strlen(kn);
877 return !strncmp(n, kn, knl) && n[knl] == ':' ? 1 : 0;
883 while(*n >= 'a' && *n <= 'z')
885 return *n == ':' ? 0 : 1;
892 * add packages fulfilling the relation to whatprovides array
894 * some words about REL_AND and REL_IF: we assume the best case
895 * here, so that you get a "potential" result if you ask for a match.
896 * E.g. if you ask for "whatrequires A" and package X contains
897 * "Requires: A & B", you'll get "X" as an answer.
900 pool_addrelproviders(Pool *pool, Id d)
911 return pool_addstdproviders(pool, d);
912 rd = GETRELDEP(pool, d);
917 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
921 /* special relation */
928 wp = pool_whatprovides(pool, name);
929 pp2 = pool_whatprovides_ptr(pool, evr);
930 pp = pool->whatprovidesdata + wp;
931 while ((p = *pp++) != 0)
933 for (pp3 = pp2; *pp3; pp3++)
937 queue_push(&plist, p); /* found it */
945 wp = pool_whatprovides(pool, name);
946 if (!pool->whatprovidesdata[wp])
947 wp = pool_whatprovides(pool, evr);
951 pp2 = pool_whatprovides_ptr(pool, evr);
952 pp = pool->whatprovidesdata + wp;
956 queue_push(&plist, *pp++);
961 queue_push(&plist, *pp2++);
965 queue_push(&plist, *pp++);
967 queue_push(&plist, *pp2++);
968 /* if the number of elements did not change, we can reuse wp */
969 if (pp - (pool->whatprovidesdata + wp) != plist.count)
975 /* assume the condition is true */
976 wp = pool_whatprovides(pool, name);
980 if (name == NAMESPACE_OTHERPROVIDERS)
982 wp = pool_whatprovides(pool, evr);
985 if (pool->nscallback)
987 /* ask callback which packages provide the dependency
989 * 1: the system (aka SYSTEMSOLVABLE)
990 * >1: set of packages, stored as offset on whatprovidesdata
992 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
996 queue_push(&plist, SYSTEMSOLVABLE);
1000 /* small hack: make it possible to match <pkg>.src
1001 * we have to iterate over the solvables as src packages do not
1002 * provide anything, thus they are not indexed in our
1003 * whatprovides hash */
1004 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
1007 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
1011 if (s->arch != evr && s->arch != ARCH_NOSRC)
1013 if (pool_disabled_solvable(pool, s))
1015 if (!name || pool_match_nevr(pool, s, name))
1016 queue_push(&plist, p);
1022 FOR_POOL_SOLVABLES(p)
1024 Solvable *s = pool->solvables + p;
1025 if (s->repo != pool->installed && !pool_installable(pool, s))
1028 queue_push(&plist, p);
1032 wp = pool_whatprovides(pool, name);
1033 pp = pool->whatprovidesdata + wp;
1034 while ((p = *pp++) != 0)
1036 Solvable *s = pool->solvables + p;
1038 queue_push(&plist, p);
1044 if (evr != ARCH_ANY)
1046 /* XXX : need to check for Multi-Arch: allowed! */
1047 wp = pool_whatprovides(pool, name);
1050 /* package kind filtering */
1053 FOR_POOL_SOLVABLES(p)
1055 Solvable *s = pool->solvables + p;
1056 if (s->repo != pool->installed && !pool_installable(pool, s))
1058 if (pool_is_kind(pool, s->name, evr))
1059 queue_push(&plist, p);
1063 wp = pool_whatprovides(pool, name);
1064 pp = pool->whatprovidesdata + wp;
1065 while ((p = *pp++) != 0)
1067 Solvable *s = pool->solvables + p;
1068 if (pool_is_kind(pool, s->name, evr))
1069 queue_push(&plist, p);
1074 case REL_FILECONFLICT:
1075 pp = pool_whatprovides_ptr(pool, name);
1076 while ((p = *pp++) != 0)
1078 Id origd = MAKERELDEP(d);
1079 Solvable *s = pool->solvables + p;
1082 pidp = s->repo->idarraydata + s->provides;
1083 while ((pid = *pidp++) != 0)
1087 queue_push(&plist, p);
1095 /* we can reuse an existing entry */
1097 pool->whatprovides_rel[d] = wp;
1103 /* simple version comparison relation */
1105 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1107 pp = pool_whatprovides_ptr(pool, name);
1108 while (ISRELDEP(name))
1110 rd = GETRELDEP(pool, name);
1113 while ((p = *pp++) != 0)
1115 Solvable *s = pool->solvables + p;
1118 /* no provides - check nevr */
1119 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1120 queue_push(&plist, p);
1123 /* solvable p provides name in some rels */
1124 pidp = s->repo->idarraydata + s->provides;
1125 while ((pid = *pidp++) != 0)
1130 continue; /* wrong provides name */
1131 if (pool->disttype == DISTTYPE_DEB)
1132 continue; /* unversioned provides can never match versioned deps */
1135 prd = GETRELDEP(pool, pid);
1136 if (prd->name != name)
1137 continue; /* wrong provides name */
1138 /* right package, both deps are rels. check flags/evr */
1139 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1140 break; /* matches */
1143 continue; /* none of the providers matched */
1144 queue_push(&plist, p);
1146 /* make our system solvable provide all unknown rpmlib() stuff */
1147 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1148 queue_push(&plist, SYSTEMSOLVABLE);
1150 /* add providers to whatprovides */
1152 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1154 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1157 return pool->whatprovides_rel[d];
1161 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1163 int nrels = pool->nrels;
1167 if (!pool->whatprovides_rel)
1169 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1171 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1173 if (ns && rd->name != ns)
1175 if (evr && rd->evr != evr)
1177 pool->whatprovides_rel[d] = 0;
1181 /* intersect dependencies in keyname with dep, return list of matching packages */
1183 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1188 FOR_POOL_SOLVABLES(p)
1190 Solvable *s = pool->solvables + p;
1191 if (s->repo->disabled)
1193 if (s->repo != pool->installed && !pool_installable(pool, s))
1195 if (solvable_matchesdep(s, keyname, dep, marker))
1200 /*************************************************************************/
1203 pool_debug(Pool *pool, int type, const char *format, ...)
1208 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1210 if ((pool->debugmask & type) == 0)
1213 va_start(args, format);
1214 if (!pool->debugcallback)
1216 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1217 vprintf(format, args);
1219 vfprintf(stderr, format, args);
1222 vsnprintf(buf, sizeof(buf), format, args);
1224 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1228 pool_error(Pool *pool, int ret, const char *format, ...)
1232 va_start(args, format);
1235 pool->errstra = 1024;
1236 pool->errstr = solv_malloc(pool->errstra);
1244 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1246 if (l >= 0 && l + 1 > pool->errstra)
1248 pool->errstra = l + 256;
1249 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1250 va_start(args, format);
1251 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1255 strcpy(pool->errstr, "unknown error");
1256 if (pool->debugmask & SOLV_ERROR)
1257 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1262 pool_errstr(Pool *pool)
1264 return pool->errstr ? pool->errstr : "no error";
1268 pool_setdebuglevel(Pool *pool, int level)
1270 int mask = SOLV_DEBUG_RESULT;
1272 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1274 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1276 mask |= SOLV_DEBUG_PROPAGATE;
1278 mask |= SOLV_DEBUG_RULE_CREATION;
1279 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1280 pool->debugmask = mask;
1283 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1285 pool->debugcallback = debugcallback;
1286 pool->debugcallbackdata = debugcallbackdata;
1289 void pool_setdebugmask(Pool *pool, int mask)
1291 pool->debugmask = mask;
1294 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
1296 pool->loadcallback = cb;
1297 pool->loadcallbackdata = loadcbdata;
1300 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct _Pool *, void *, Id, Id), void *nscbdata)
1302 pool->nscallback = cb;
1303 pool->nscallbackdata = nscbdata;
1306 /*************************************************************************/
1308 struct searchfiles {
1314 #define SEARCHFILES_BLOCK 127
1317 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1321 struct searchfiles *csf;
1323 while ((dep = *ida++) != 0)
1326 while (ISRELDEP(dep))
1329 sid = pool->ss.nstrings + GETRELID(dep);
1330 if (MAPTST(&csf->seen, sid))
1335 MAPSET(&csf->seen, sid);
1336 rd = GETRELDEP(pool, dep);
1339 else if (rd->flags == REL_NAMESPACE)
1341 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
1344 if (!csf || MAPTST(&csf->seen, sid))
1349 MAPSET(&csf->seen, sid);
1353 else if (rd->flags == REL_FILECONFLICT)
1363 pool_addfileprovides_dep(pool, ids, csf, isf);
1369 if (MAPTST(&csf->seen, dep))
1371 MAPSET(&csf->seen, dep);
1372 s = pool_id2str(pool, dep);
1375 if (csf != isf && pool->addedfileprovides == 1 && !repodata_filelistfilter_matches(0, s))
1376 continue; /* skip non-standard locations csf == isf: installed case */
1377 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1378 csf->ids[csf->nfiles++] = dep;
1382 struct addfileprovides_cbdata {
1396 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1398 struct addfileprovides_cbdata *cbd = cbdata;
1401 if (!cbd->useddirs.size)
1403 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1406 cbd->dirs = solv_malloc2(cbd->nfiles, sizeof(char *));
1407 cbd->names = solv_malloc2(cbd->nfiles, sizeof(char *));
1408 for (i = 0; i < cbd->nfiles; i++)
1410 char *s = solv_strdup(pool_id2str(data->repo->pool, cbd->ids[i]));
1412 s = strrchr(s, '/');
1414 cbd->names[i] = s + 1;
1417 for (i = 0; i < cbd->nfiles; i++)
1420 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1425 did = repodata_str2dir(data, cbd->dirs[i], 0);
1428 MAPSET(&cbd->useddirs, did);
1430 repodata_free_dircache(data);
1432 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1434 for (i = 0; i < cbd->nfiles; i++)
1435 if (cbd->dids[i] == value->id && !strcmp(cbd->names[i], value->str))
1436 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1441 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1446 Queue fileprovidesq;
1447 int i, j, repoid, repodataid;
1448 int provstart, provend;
1450 int ndone, incomplete;
1455 cbd->nfiles = sf->nfiles;
1459 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1460 map_init(&cbd->providedids, pool->ss.nstrings);
1463 repo = repoonly ? repoonly : pool->repos[repoid];
1464 map_init(&donemap, pool->nsolvables);
1465 queue_init(&fileprovidesq);
1466 provstart = provend = 0;
1469 if (!repo || repo->disabled)
1471 if (repoonly || ++repoid == pool->nrepos)
1473 repo = pool->repos[repoid];
1477 FOR_REPODATAS(repo, repodataid, data)
1479 if (ndone >= repo->nsolvables)
1482 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1484 map_empty(&cbd->providedids);
1485 for (i = 0; i < fileprovidesq.count; i++)
1486 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1487 provstart = data->start;
1488 provend = data->end;
1489 for (i = 0; i < cbd->nfiles; i++)
1490 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1492 if (i == cbd->nfiles)
1494 /* great! no need to search files */
1495 for (p = data->start; p < data->end; p++)
1496 if (pool->solvables[p].repo == repo)
1498 if (MAPTST(&donemap, p))
1500 MAPSET(&donemap, p);
1507 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1510 if (data->start < provstart || data->end > provend)
1512 map_empty(&cbd->providedids);
1513 provstart = provend = 0;
1516 /* check if the data is incomplete */
1518 if (data->state == REPODATA_AVAILABLE)
1520 for (j = 1; j < data->nkeys; j++)
1521 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1523 if (j < data->nkeys)
1526 for (i = 0; i < cbd->nfiles; i++)
1527 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1528 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1530 for (i = 0; i < cbd->nfiles; i++)
1531 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1533 if (i < cbd->nfiles)
1539 map_init(&cbd->useddirs, 0);
1540 for (p = data->start; p < data->end; p++)
1541 if (pool->solvables[p].repo == repo)
1543 if (MAPTST(&donemap, p))
1545 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1548 MAPSET(&donemap, p);
1552 map_free(&cbd->useddirs);
1555 if (repoonly || ++repoid == pool->nrepos)
1557 repo = pool->repos[repoid];
1560 queue_free(&fileprovidesq);
1561 map_free(&cbd->providedids);
1564 for (i = 0; i < cbd->nfiles; i++)
1565 solv_free(cbd->dirs[i]);
1566 cbd->dirs = solv_free(cbd->dirs);
1567 cbd->names = solv_free(cbd->names);
1572 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1575 Repo *installed, *repo;
1576 struct searchfiles sf, isf, *isfp;
1577 struct addfileprovides_cbdata cbd;
1581 installed = pool->installed;
1582 now = solv_timems(0);
1583 memset(&sf, 0, sizeof(sf));
1584 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1585 memset(&isf, 0, sizeof(isf));
1586 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1587 pool->addedfileprovides = pool->addfileprovidesfiltered ? 1 : 2;
1592 queue_empty(idqinst);
1593 isfp = installed ? &isf : 0;
1594 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1600 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1602 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1604 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1606 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1608 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1610 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1612 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1615 map_free(&isf.seen);
1616 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1621 for (i = 0; i < sf.nfiles; i++)
1622 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1624 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1626 for (i = 0; i < sf.nfiles; i++)
1627 queue_push(idq, sf.ids[i]);
1629 for (i = 0; i < sf.nfiles; i++)
1630 queue_push(idqinst, sf.ids[i]);
1636 for (i = 0; i < isf.nfiles; i++)
1637 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1640 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1641 if (installed && idqinst)
1642 for (i = 0; i < isf.nfiles; i++)
1643 queue_pushunique(idqinst, isf.ids[i]);
1646 solv_free(cbd.dids);
1647 pool_freewhatprovides(pool); /* as we have added provides */
1648 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1652 pool_addfileprovides(Pool *pool)
1654 pool_addfileprovides_queue(pool, 0, 0);
1658 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)
1662 if (pool->solvables[p].repo)
1663 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1666 /* FIXME: obey callback return value! */
1667 for (p = 1; p < pool->nsolvables; p++)
1668 if (pool->solvables[p].repo)
1669 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1673 pool_clear_pos(Pool *pool)
1675 memset(&pool->pos, 0, sizeof(pool->pos));
1680 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1684 pool->languagecache = solv_free(pool->languagecache);
1685 pool->languagecacheother = 0;
1686 for (i = 0; i < pool->nlanguages; i++)
1687 free((char *)pool->languages[i]);
1688 pool->languages = solv_free((void *)pool->languages);
1689 pool->nlanguages = nlanguages;
1692 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1693 for (i = 0; i < pool->nlanguages; i++)
1694 pool->languages[i] = solv_strdup(languages[i]);
1698 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1704 if (!lang || !*lang)
1706 n = pool_id2str(pool, id);
1707 l = strlen(n) + strlen(lang) + 2;
1708 if (l > sizeof(buf))
1709 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1712 sprintf(p, "%s:%s", n, lang);
1713 id = pool_str2id(pool, p, create);
1720 pool_alloctmpspace(Pool *pool, int len)
1722 int n = pool->tmpspace.n;
1725 if (len > pool->tmpspace.len[n])
1727 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1728 pool->tmpspace.len[n] = len + 32;
1730 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1731 return pool->tmpspace.buf[n];
1735 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1740 n = oldn = pool->tmpspace.n;
1744 n = POOL_TMPSPACEBUF - 1;
1747 if (pool->tmpspace.buf[n] != space)
1749 if (len > pool->tmpspace.len[n])
1751 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1752 pool->tmpspace.len[n] = len + 32;
1754 return pool->tmpspace.buf[n];
1761 pool_freetmpspace(Pool *pool, const char *space)
1763 int n = pool->tmpspace.n;
1766 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1767 if (pool->tmpspace.buf[n] == space)
1768 pool->tmpspace.n = n;
1772 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1776 l1 = str1 ? strlen(str1) : 0;
1777 l2 = str2 ? strlen(str2) : 0;
1778 l3 = str3 ? strlen(str3) : 0;
1779 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1800 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1805 l1 = str1 ? strlen(str1) : 0;
1806 l2 = str2 ? strlen(str2) : 0;
1807 l3 = str3 ? strlen(str3) : 0;
1808 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1812 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1835 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1840 s = pool_alloctmpspace(pool, 2 * len + 1);
1841 solv_bin2hex(buf, len, s);
1845 /*******************************************************************/
1857 struct mptree *mptree;
1868 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1870 struct ducbdata *cbd = cbdata;
1873 if (data != cbd->olddata)
1875 Id dn, mp, comp, *dirmap, *dirs;
1877 const char *compstr;
1878 struct mptree *mptree;
1880 /* create map from dir to mptree */
1881 cbd->dirmap = solv_free(cbd->dirmap);
1883 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1884 mptree = cbd->mptree;
1886 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1900 if (!mptree[mp].child)
1905 if (data->localpool)
1906 compstr = stringpool_id2str(&data->spool, comp);
1908 compstr = pool_id2str(data->repo->pool, comp);
1909 compl = strlen(compstr);
1910 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1911 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1913 dirmap[dn] = i ? i : -mp;
1915 /* change dirmap to point to mountpoint instead of mptree */
1916 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1919 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1921 cbd->dirmap = dirmap;
1922 cbd->nmap = data->dirpool.ndirs;
1923 cbd->olddata = data;
1926 if (value->id < 0 || value->id >= cbd->nmap)
1928 mp = cbd->dirmap[value->id];
1931 if (cbd->addsub > 0)
1933 cbd->mps[mp].kbytes += value->num;
1934 cbd->mps[mp].files += value->num2;
1936 else if (!(cbd->mps[mp].flags & DUCHANGES_ONLYADD))
1938 cbd->mps[mp].kbytes -= value->num;
1939 cbd->mps[mp].files -= value->num2;
1945 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1948 if (mptree[pos].mountpoint == -1)
1949 mptree[pos].mountpoint = mountpoint;
1951 mountpoint = mptree[pos].mountpoint;
1952 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1953 propagate_mountpoints(mptree, i, mountpoint);
1956 #define MPTREE_BLOCK 15
1958 static struct mptree *
1959 create_mptree(DUChanges *mps, int nmps)
1962 struct mptree *mptree;
1965 const char *p, *path, *compstr;
1967 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1970 mptree[0].sibling = 0;
1971 mptree[0].child = 0;
1973 mptree[0].compl = 0;
1974 mptree[0].mountpoint = -1;
1977 /* create component tree */
1978 for (mp = 0; mp < nmps; mp++)
1983 path = mps[mp].path;
1988 if ((p = strchr(path, '/')) == 0)
1991 compl = strlen(compstr);
2002 for (i = mptree[pos].child; i; i = mptree[i].sibling)
2003 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
2007 /* create new node */
2008 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
2010 mptree[i].sibling = mptree[pos].child;
2011 mptree[i].child = 0;
2012 mptree[i].comp = compstr;
2013 mptree[i].compl = compl;
2014 mptree[i].mountpoint = -1;
2015 mptree[pos].child = i;
2019 mptree[pos].mountpoint = mp;
2022 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
2025 for (i = 0; i < nmptree; i++)
2027 printf("#%d sibling: %d\n", i, mptree[i].sibling);
2028 printf("#%d child: %d\n", i, mptree[i].child);
2029 printf("#%d comp: %s\n", i, mptree[i].comp);
2030 printf("#%d compl: %d\n", i, mptree[i].compl);
2031 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
2039 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
2041 struct mptree *mptree;
2042 struct ducbdata cbd;
2046 Repo *oldinstalled = pool->installed;
2047 int haveonlyadd = 0;
2049 map_init(&ignoredu, 0);
2050 mptree = create_mptree(mps, nmps);
2052 for (i = 0; i < nmps; i++)
2053 if ((mps[i].flags & DUCHANGES_ONLYADD) != 0)
2059 cbd.mptree = mptree;
2061 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2063 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2065 if (!MAPTST(installedmap, sp))
2068 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2069 if (!cbd.hasdu && oldinstalled)
2073 /* no du data available, ignore data of all installed solvables we obsolete */
2075 map_grow(&ignoredu, oldinstalled->end - oldinstalled->start);
2076 FOR_PROVIDES(op, opp, s->name)
2078 Solvable *s2 = pool->solvables + op;
2079 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2081 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2083 if (op >= oldinstalled->start && op < oldinstalled->end)
2085 MAPSET(&ignoredu, op - oldinstalled->start);
2086 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2088 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2090 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2098 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2099 while ((obs = *obsp++) != 0)
2100 FOR_PROVIDES(op, opp, obs)
2102 Solvable *s2 = pool->solvables + op;
2103 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, s2, obs))
2105 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2107 if (op >= oldinstalled->start && op < oldinstalled->end)
2109 MAPSET(&ignoredu, op - oldinstalled->start);
2110 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2112 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2114 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2126 /* assumes we allways have du data for installed solvables */
2127 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2129 if (MAPTST(installedmap, sp))
2131 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
2133 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2136 map_free(&ignoredu);
2137 solv_free(cbd.dirmap);
2142 pool_calc_installsizechange(Pool *pool, Map *installedmap)
2147 Repo *oldinstalled = pool->installed;
2149 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2151 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2153 if (!MAPTST(installedmap, sp))
2155 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2159 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2161 if (MAPTST(installedmap, sp))
2163 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2171 * 2: conflicts with installed
2172 * 8: interesting (only true if installed)
2176 static inline Id dep2name(Pool *pool, Id dep)
2178 while (ISRELDEP(dep))
2180 Reldep *rd = GETRELDEP(pool, dep);
2186 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
2189 Solvable *sn = pool->solvables + n;
2191 FOR_PROVIDES(p, pp, sn->name)
2193 Solvable *s = pool->solvables + p;
2194 if (s->name != sn->name || s->arch != sn->arch)
2196 if ((map[p] & 9) != 9)
2198 if (pool_match_nevr(pool, pool->solvables + p, con))
2200 return 1; /* found installed package that doesn't conflict */
2205 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
2209 FOR_PROVIDES(p, pp, dep)
2211 if (p == SYSTEMSOLVABLE)
2212 return 1; /* always boring, as never constraining */
2213 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
2215 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
2216 if (providedbyinstalled_multiversion(pool, map, p, dep))
2218 if ((map[p] & 9) == 9)
2226 * pool_trivial_installable - calculate if a set of solvables is
2227 * trivial installable without any other installs/deinstalls of
2228 * packages not belonging to the set.
2230 * the state is returned in the result queue:
2231 * 1: solvable is installable without any other package changes
2232 * 0: solvable is not installable
2233 * -1: solvable is installable, but doesn't constrain any installed packages
2237 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
2240 Id p, *dp, con, *conp, req, *reqp;
2244 map = solv_calloc(pool->nsolvables, 1);
2245 for (p = 1; p < pool->nsolvables; p++)
2247 if (!MAPTST(installedmap, p))
2250 s = pool->solvables + p;
2253 conp = s->repo->idarraydata + s->conflicts;
2254 while ((con = *conp++) != 0)
2256 dp = pool_whatprovides_ptr(pool, con);
2258 map[p] |= 2; /* XXX: self conflict ? */
2261 for (i = 0; i < pkgs->count; i++)
2262 map[pkgs->elements[i]] = 16;
2264 for (i = 0, did = 0; did < pkgs->count; i++, did++)
2266 if (i == pkgs->count)
2268 p = pkgs->elements[i];
2269 if ((map[p] & 16) == 0)
2271 if ((map[p] & 2) != 0)
2276 s = pool->solvables + p;
2280 reqp = s->repo->idarraydata + s->requires;
2281 while ((req = *reqp++) != 0)
2283 if (req == SOLVABLE_PREREQMARKER)
2285 r = providedbyinstalled(pool, map, req, 0, 0);
2288 /* decided and miss */
2294 break; /* undecided */
2295 m |= r; /* 1 | 9 | 17 */
2304 int ispatch = 0; /* see solver.c patch handling */
2306 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
2308 conp = s->repo->idarraydata + s->conflicts;
2309 while ((con = *conp++) != 0)
2311 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2317 if ((m == 1 || m == 17) && ISRELDEP(con))
2319 con = dep2name(pool, con);
2320 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2325 continue; /* found a conflict */
2328 if (s->repo && s->repo != oldinstalled)
2330 Id p2, obs, *obsp, *pp;
2334 obsp = s->repo->idarraydata + s->obsoletes;
2335 while ((obs = *obsp++) != 0)
2337 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2346 FOR_PROVIDES(p2, pp, s->name)
2348 s2 = pool->solvables + p2;
2349 if (s2->name == s->name && (map[p2] & 1) != 0)
2366 queue_init_clone(res, pkgs);
2367 for (i = 0; i < pkgs->count; i++)
2369 m = map[pkgs->elements[i]];
2376 res->elements[i] = r;
2382 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2384 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2388 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2390 if (entry == SOLVID_POS && pool->pos.repo)
2391 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2394 return solvable_lookup_str(pool->solvables + entry, keyname);
2398 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2400 if (entry == SOLVID_POS && pool->pos.repo)
2401 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2404 return solvable_lookup_id(pool->solvables + entry, keyname);
2408 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2410 if (entry == SOLVID_POS && pool->pos.repo)
2411 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
2414 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2418 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2420 if (entry == SOLVID_POS && pool->pos.repo)
2421 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2424 return solvable_lookup_void(pool->solvables + entry, keyname);
2427 const unsigned char *
2428 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2430 if (entry == SOLVID_POS && pool->pos.repo)
2431 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2434 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2438 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2440 if (entry == SOLVID_POS && pool->pos.repo)
2441 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2444 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2448 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
2450 if (entry == SOLVID_POS && pool->pos.repo)
2451 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
2454 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
2458 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2463 if (entry != SOLVID_POS)
2465 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2466 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2467 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2468 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2473 add_new_provider(Pool *pool, Id id, Id p)
2478 while (ISRELDEP(id))
2480 Reldep *rd = GETRELDEP(pool, id);
2485 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2497 queue_push(&q, *pp);
2501 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2506 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2508 int hadhashes = pool->relhashtbl ? 1 : 0;
2514 if (!conflicts->count)
2516 for (i = 0; i < conflicts->count; i += 6)
2518 fn = conflicts->elements[i];
2519 p = conflicts->elements[i + 1];
2520 md5 = conflicts->elements[i + 2];
2521 q = conflicts->elements[i + 4];
2522 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2523 s = pool->solvables + p;
2526 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2527 if (pool->whatprovides)
2528 add_new_provider(pool, fn, p);
2529 if (pool->whatprovides_rel)
2530 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2531 s = pool->solvables + q;
2534 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2537 pool_freeidhashes(pool);
2541 pool_prepend_rootdir(Pool *pool, const char *path)
2546 return solv_strdup(path);
2547 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2551 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2557 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2561 pool_set_rootdir(Pool *pool, const char *rootdir)
2563 solv_free(pool->rootdir);
2564 pool->rootdir = solv_strdup(rootdir);
2568 pool_get_rootdir(Pool *pool)
2570 return pool->rootdir;
2573 /* only used in libzypp */
2575 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2577 pool->custom_vendorcheck = vendorcheck;