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;
197 case POOL_FLAG_NOWHATPROVIDESAUX:
198 return pool->nowhatprovidesaux;
206 pool_set_flag(Pool *pool, int flag, int value)
208 int old = pool_get_flag(pool, flag);
211 case POOL_FLAG_PROMOTEEPOCH:
212 pool->promoteepoch = value;
214 case POOL_FLAG_FORBIDSELFCONFLICTS:
215 pool->forbidselfconflicts = value;
217 case POOL_FLAG_OBSOLETEUSESPROVIDES:
218 pool->obsoleteusesprovides = value;
220 case POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES:
221 pool->implicitobsoleteusesprovides = value;
223 case POOL_FLAG_OBSOLETEUSESCOLORS:
224 pool->obsoleteusescolors = value;
226 case POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS:
227 pool->implicitobsoleteusescolors = value;
229 case POOL_FLAG_NOINSTALLEDOBSOLETES:
230 pool->noinstalledobsoletes = value;
232 case POOL_FLAG_HAVEDISTEPOCH:
233 pool->havedistepoch = value;
235 case POOL_FLAG_NOOBSOLETESMULTIVERSION:
236 pool->noobsoletesmultiversion = value;
238 case POOL_FLAG_ADDFILEPROVIDESFILTERED:
239 pool->addfileprovidesfiltered = value;
241 case POOL_FLAG_NOWHATPROVIDESAUX:
242 pool->nowhatprovidesaux = value;
252 pool_add_solvable(Pool *pool)
254 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
255 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
256 return pool->nsolvables++;
260 pool_add_solvable_block(Pool *pool, int count)
262 Id nsolvables = pool->nsolvables;
265 pool->solvables = solv_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
266 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
267 pool->nsolvables += count;
272 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
276 if (reuseids && start + count == pool->nsolvables)
278 /* might want to shrink solvable array */
279 pool->nsolvables = start;
282 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
287 pool_set_installed(Pool *pool, Repo *installed)
289 if (pool->installed == installed)
291 pool->installed = installed;
292 pool_freewhatprovides(pool);
296 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
301 oa = pool->whatprovides[*(Id *)ap];
302 ob = pool->whatprovides[*(Id *)bp];
304 return *(Id *)ap - *(Id *)bp;
305 da = pool->whatprovidesdata + oa;
306 db = pool->whatprovidesdata + ob;
308 if ((r = (*da++ - *db++)) != 0)
312 return *(Id *)ap - *(Id *)bp;
316 * pool_shrink_whatprovides - unify whatprovides data
318 * whatprovides_rel must be empty for this to work!
322 pool_shrink_whatprovides(Pool *pool)
326 Id lastid, *last, *dp, *lp;
330 if (pool->ss.nstrings < 3)
332 sorted = solv_malloc2(pool->ss.nstrings, sizeof(Id));
333 for (i = id = 0; id < pool->ss.nstrings; id++)
334 if (pool->whatprovides[id] >= 4)
337 solv_sort(sorted, n, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
340 for (i = 0; i < n; i++)
343 o = pool->whatprovides[id];
344 dp = pool->whatprovidesdata + o;
358 pool->whatprovides[id] = -lastid;
362 last = pool->whatprovidesdata + o;
366 dp = pool->whatprovidesdata + 4;
367 for (id = 1; id < pool->ss.nstrings; id++)
369 o = pool->whatprovides[id];
377 pool->whatprovides[id] = pool->whatprovides[i];
382 lp = pool->whatprovidesdata + o;
385 pool->whatprovides[id] = dp - pool->whatprovidesdata;
386 while ((*dp++ = *lp++) != 0)
389 o = dp - pool->whatprovidesdata;
390 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
391 if (pool->whatprovidesdataoff == o)
393 r = pool->whatprovidesdataoff - o;
394 pool->whatprovidesdataoff = o;
395 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
396 if (r > pool->whatprovidesdataleft)
397 r = pool->whatprovidesdataleft;
398 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
401 /* this gets rid of all the zeros in the aux */
403 pool_shrink_whatprovidesaux(Pool *pool)
405 int num = pool->whatprovidesauxoff;
408 Id *op, *wp = pool->whatprovidesauxdata + 1;
411 for (i = 0; i < num; i++)
413 Offset o = pool->whatprovidesaux[i];
416 op = pool->whatprovidesauxdata + o;
417 pool->whatprovidesaux[i] = wp - pool->whatprovidesauxdata;
420 while ((id = *op++) != 0)
423 newoff = wp - pool->whatprovidesauxdata;
424 pool->whatprovidesauxdata = solv_realloc(pool->whatprovidesauxdata, newoff * sizeof(Id));
425 POOL_DEBUG(SOLV_DEBUG_STATS, "shrunk whatprovidesauxdata from %d to %d\n", pool->whatprovidesauxdataoff, newoff);
426 pool->whatprovidesauxdataoff = newoff;
431 * pool_createwhatprovides()
433 * create hashes over pool of solvables to ease provide lookups
437 pool_createwhatprovides(Pool *pool)
439 int i, num, np, extra;
444 Offset *whatprovides;
445 Id *whatprovidesdata, *dp, *whatprovidesauxdata;
446 Offset *whatprovidesaux;
447 Repo *installed = pool->installed;
450 now = solv_timems(0);
451 POOL_DEBUG(SOLV_DEBUG_STATS, "number of solvables: %d, memory used: %d K\n", pool->nsolvables, pool->nsolvables * (int)sizeof(Solvable) / 1024);
452 POOL_DEBUG(SOLV_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
453 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);
454 if (pool->ss.stringhashmask || pool->relhashmask)
455 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)));
457 pool_freeidhashes(pool); /* XXX: should not be here! */
458 pool_freewhatprovides(pool);
459 num = pool->ss.nstrings;
460 pool->whatprovides = whatprovides = solv_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
461 pool->whatprovides_rel = solv_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
463 /* count providers for each name */
464 for (i = pool->nsolvables - 1; i > 0; i--)
467 s = pool->solvables + i;
468 if (!s->provides || !s->repo || s->repo->disabled)
470 /* we always need the installed solvable in the whatprovides data,
471 otherwise obsoletes/conflicts on them won't work */
472 if (s->repo != installed && !pool_installable(pool, s))
474 pp = s->repo->idarraydata + s->provides;
475 while ((id = *pp++) != 0)
479 Reldep *rd = GETRELDEP(pool, id);
482 whatprovides[id]++; /* inc count of providers */
486 off = 4; /* first entry is undef, second is empty list, third is system solvable */
487 np = 0; /* number of names provided */
488 for (i = 0, idp = whatprovides; i < num; i++, idp++)
491 if (!n) /* no providers */
493 *idp = 1; /* offset for empty list */
496 off += n; /* make space for all providers */
497 *idp = off++; /* now idp points to terminating zero */
498 np++; /* inc # of provider 'slots' for stats */
501 POOL_DEBUG(SOLV_DEBUG_STATS, "provide ids: %d\n", np);
503 /* reserve some space for relation data */
504 extra = 2 * pool->nrels;
508 POOL_DEBUG(SOLV_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
510 /* alloc space for all providers + extra */
511 whatprovidesdata = solv_calloc(off + extra, sizeof(Id));
512 whatprovidesdata[2] = SYSTEMSOLVABLE;
514 /* alloc aux vector */
515 whatprovidesauxdata = 0;
516 if (!pool->nowhatprovidesaux)
518 pool->whatprovidesaux = whatprovidesaux = solv_calloc(num, sizeof(Offset));
519 pool->whatprovidesauxoff = num;
520 pool->whatprovidesauxdataoff = off;
521 pool->whatprovidesauxdata = whatprovidesauxdata = solv_calloc(pool->whatprovidesauxdataoff, sizeof(Id));
524 /* now fill data for all provides */
525 for (i = pool->nsolvables - 1; i > 0; i--)
528 s = pool->solvables + i;
529 if (!s->provides || !s->repo || s->repo->disabled)
531 if (s->repo != installed && !pool_installable(pool, s))
534 /* for all provides of this solvable */
535 pp = s->repo->idarraydata + s->provides;
536 while ((id = *pp++) != 0)
541 Reldep *rd = GETRELDEP(pool, id);
544 dp = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
545 if (*dp != i) /* don't add same solvable twice */
552 if (whatprovidesauxdata)
553 whatprovidesauxdata[whatprovides[id]] = auxid;
556 if (pool->whatprovidesaux)
557 memcpy(pool->whatprovidesaux, pool->whatprovides, num * sizeof(Id));
558 pool->whatprovidesdata = whatprovidesdata;
559 pool->whatprovidesdataoff = off;
560 pool->whatprovidesdataleft = extra;
561 pool_shrink_whatprovides(pool);
562 if (pool->whatprovidesaux)
563 pool_shrink_whatprovidesaux(pool);
564 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)));
565 if (pool->whatprovidesaux)
566 POOL_DEBUG(SOLV_DEBUG_STATS, "whatprovidesaux memory used: %d K id array, %d K data\n", pool->whatprovidesauxoff / (int)(1024/sizeof(Id)), pool->whatprovidesauxdataoff / (int)(1024/sizeof(Id)));
568 queue_empty(&pool->lazywhatprovidesq);
569 if ((!pool->addedfileprovides && pool->disttype == DISTTYPE_RPM) || pool->addedfileprovides == 1)
571 if (!pool->addedfileprovides)
572 POOL_DEBUG(SOLV_DEBUG_STATS, "WARNING: pool_addfileprovides was not called, this may result in slow operation\n");
573 /* lazyly add file provides */
574 for (i = 1; i < num; i++)
576 const char *str = pool->ss.stringspace + pool->ss.strings[i];
579 if (pool->addedfileprovides == 1 && repodata_filelistfilter_matches(0, str))
581 /* setup lazy adding, but remember old value */
582 if (pool->whatprovides[i] > 1)
583 queue_push2(&pool->lazywhatprovidesq, i, pool->whatprovides[i]);
584 pool->whatprovides[i] = 0;
585 if (pool->whatprovidesaux)
586 pool->whatprovidesaux[i] = 0; /* sorry */
588 POOL_DEBUG(SOLV_DEBUG_STATS, "lazywhatprovidesq size: %d entries\n", pool->lazywhatprovidesq.count / 2);
591 POOL_DEBUG(SOLV_DEBUG_STATS, "createwhatprovides took %d ms\n", solv_timems(now));
595 * free all of our whatprovides data
596 * be careful, everything internalized with pool_queuetowhatprovides is
600 pool_freewhatprovides(Pool *pool)
602 pool->whatprovides = solv_free(pool->whatprovides);
603 pool->whatprovides_rel = solv_free(pool->whatprovides_rel);
604 pool->whatprovidesdata = solv_free(pool->whatprovidesdata);
605 pool->whatprovidesdataoff = 0;
606 pool->whatprovidesdataleft = 0;
607 pool->whatprovidesaux = solv_free(pool->whatprovidesaux);
608 pool->whatprovidesauxdata = solv_free(pool->whatprovidesauxdata);
609 pool->whatprovidesauxoff = 0;
610 pool->whatprovidesauxdataoff = 0;
614 /******************************************************************************/
617 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
619 * used for whatprovides, jobs, learnt rules, selections
620 * input: q: queue of Ids
621 * returns: Offset into whatprovidesdata
626 pool_ids2whatprovides(Pool *pool, Id *ids, int count)
630 if (count == 0) /* queue empty -> 1 */
632 if (count == 1 && *ids == SYSTEMSOLVABLE)
635 /* extend whatprovidesdata if needed, +1 for 0-termination */
636 if (pool->whatprovidesdataleft < count + 1)
638 POOL_DEBUG(SOLV_DEBUG_STATS, "growing provides hash data...\n");
639 pool->whatprovidesdata = solv_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
640 pool->whatprovidesdataleft = count + 4096;
643 /* copy queue to next free slot */
644 off = pool->whatprovidesdataoff;
645 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, ids, count * sizeof(Id));
647 /* adapt count and 0-terminate */
648 pool->whatprovidesdataoff += count;
649 pool->whatprovidesdata[pool->whatprovidesdataoff++] = 0;
650 pool->whatprovidesdataleft -= count + 1;
656 pool_queuetowhatprovides(Pool *pool, Queue *q)
658 int count = q->count;
659 if (count == 0) /* queue empty -> 1 */
661 if (count == 1 && q->elements[0] == SYSTEMSOLVABLE)
663 return pool_ids2whatprovides(pool, q->elements, count);
667 /*************************************************************************/
669 #if defined(MULTI_SEMANTICS)
670 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
671 #elif defined(DEBIAN)
672 # define EVRCMP_DEPCMP EVRCMP_COMPARE
674 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
677 /* check if a package's nevr matches a dependency */
678 /* semi-private, called from public pool_match_nevr */
681 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
683 Reldep *rd = GETRELDEP(pool, d);
686 int flags = rd->flags;
695 if (evr != ARCH_SRC || s->arch != ARCH_NOSRC)
698 return pool_match_nevr(pool, s, name);
700 if (pool_match_nevr(pool, s, name))
702 return pool_match_nevr(pool, s, evr);
705 if (!pool_match_nevr(pool, s, name))
707 return pool_match_nevr(pool, s, evr);
711 /* XXX : need to check for Multi-Arch: allowed! */
712 return pool_match_nevr(pool, s, name);
717 if (!pool_match_nevr(pool, s, name))
720 return (flags & REL_EQ) ? 1 : 0;
725 switch (pool_evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP))
730 return (flags & REL_LT) ? 1 : 0;
732 return (flags & REL_EQ) ? 1 : 0;
734 return (flags & REL_GT) ? 1 : 0;
736 return (flags & REL_EQ) ? 1 : 0;
743 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
744 /* forward declaration */
745 static int pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr);
748 /* match (flags, evr) against provider (pflags, pevr) */
750 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
752 if (!pflags || !flags || pflags >= 8 || flags >= 8)
754 if (flags == 7 || pflags == 7)
755 return 1; /* rel provides every version */
756 if ((pflags & flags & (REL_LT | REL_GT)) != 0)
757 return 1; /* both rels show in the same direction */
759 return (flags & pflags & REL_EQ) ? 1 : 0;
760 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
763 Reldep *rd = GETRELDEP(pool, pevr);
764 if (rd->flags == REL_COMPAT)
765 return pool_match_flags_evr_rel_compat(pool, rd, flags, evr);
768 switch (pool_evrcmp(pool, pevr, evr, EVRCMP_DEPCMP))
771 return (pflags & REL_EQ) ? 1 : 0;
773 return (flags & REL_LT) || (pflags & REL_GT) ? 1 : 0;
775 return (flags & pflags & REL_EQ) ? 1 : 0;
777 return (flags & REL_GT) || (pflags & REL_LT) ? 1 : 0;
779 return (flags & REL_EQ) ? 1 : 0;
786 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
788 pool_match_flags_evr_rel_compat(Pool *pool, Reldep *range, int flags, int evr)
790 /* range->name is the actual version, range->evr the backwards compatibility
791 version. If flags are '>=' or '>', we match the compatibility version
792 as well, otherwise only the actual version. */
793 if (!(flags & REL_GT) || (flags & REL_LT))
794 return pool_match_flags_evr(pool, REL_EQ, range->name, flags, evr);
795 return pool_match_flags_evr(pool, REL_LT | REL_EQ, range->name, flags, evr) &&
796 pool_match_flags_evr(pool, REL_GT | REL_EQ, range->evr, REL_EQ, evr);
800 /* public (i.e. not inlined) version of pool_match_flags_evr */
802 pool_intersect_evrs(Pool *pool, int pflags, Id pevr, int flags, int evr)
804 return pool_match_flags_evr(pool, pflags, pevr, flags, evr);
807 /* match two dependencies (d1 = provider) */
810 pool_match_dep(Pool *pool, Id d1, Id d2)
820 rd2 = GETRELDEP(pool, d2);
821 return pool_match_dep(pool, d1, rd2->name);
823 rd1 = GETRELDEP(pool, d1);
826 return pool_match_dep(pool, rd1->name, d2);
828 rd2 = GETRELDEP(pool, d2);
829 /* first match name */
830 if (!pool_match_dep(pool, rd1->name, rd2->name))
832 /* name matches, check flags and evr */
833 return pool_intersect_evrs(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
837 pool_searchlazywhatprovidesq(Pool *pool, Id d)
840 int end = pool->lazywhatprovidesq.count;
844 elements = pool->lazywhatprovidesq.elements;
845 while (end - start > 16)
847 int mid = (start + end) / 2 & ~1;
848 if (elements[mid] == d)
849 return elements[mid + 1];
850 if (elements[mid] < d)
855 for (; start < end; start += 2)
856 if (elements[start] == d)
857 return elements[start + 1];
864 * lazy populating of the whatprovides array, non relation case
867 pool_addstdproviders(Pool *pool, Id d)
875 if (pool->addedfileprovides == 2)
877 pool->whatprovides[d] = 1;
880 str = pool->ss.stringspace + pool->ss.strings[d];
883 pool->whatprovides[d] = 1;
886 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
887 dataiterator_init(&di, pool, 0, 0, SOLVABLE_FILELIST, str, SEARCH_STRING|SEARCH_FILES|SEARCH_COMPLETE_FILELIST);
888 for (; dataiterator_step(&di); dataiterator_skip_solvable(&di))
890 Solvable *s = pool->solvables + di.solvid;
891 /* XXX: maybe should add a provides dependency to the solvables
892 * OTOH this is only needed for rel deps that filter the provides,
893 * and those should not use filelist entries */
894 if (s->repo->disabled)
896 if (s->repo != pool->installed && !pool_installable(pool, s))
898 queue_push(&q, di.solvid);
900 dataiterator_free(&di);
901 oldoffset = pool_searchlazywhatprovidesq(pool, d);
903 pool->whatprovides[d] = oldoffset ? oldoffset : 1;
908 Id *oo = pool->whatprovidesdata + oldoffset;
910 /* unify both queues. easy, as we know both are sorted */
911 for (i = 0; i < q.count; i++)
913 if (*oo > q.elements[i])
915 if (*oo < q.elements[i])
916 queue_insert(&q, i, *oo);
922 queue_push(&q, *oo++);
923 if (q.count == oo - (pool->whatprovidesdata + oldoffset))
925 /* end result has same size as oldoffset -> no new entries */
927 pool->whatprovides[d] = oldoffset;
931 pool->whatprovides[d] = pool_queuetowhatprovides(pool, &q);
934 return pool->whatprovides[d];
939 pool_is_kind(Pool *pool, Id name, Id kind)
944 n = pool_id2str(pool, name);
947 const char *kn = pool_id2str(pool, kind);
948 int knl = strlen(kn);
949 return !strncmp(n, kn, knl) && n[knl] == ':' ? 1 : 0;
955 while(*n >= 'a' && *n <= 'z')
957 return *n == ':' ? 0 : 1;
964 * add packages fulfilling the relation to whatprovides array
966 * some words about REL_AND and REL_IF: we assume the best case
967 * here, so that you get a "potential" result if you ask for a match.
968 * E.g. if you ask for "whatrequires A" and package X contains
969 * "Requires: A & B", you'll get "X" as an answer.
972 pool_addrelproviders(Pool *pool, Id d)
983 return pool_addstdproviders(pool, d);
984 rd = GETRELDEP(pool, d);
989 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
993 /* special relation */
1000 wp = pool_whatprovides(pool, name);
1001 pp2 = pool_whatprovides_ptr(pool, evr);
1002 pp = pool->whatprovidesdata + wp;
1003 while ((p = *pp++) != 0)
1005 for (pp3 = pp2; *pp3; pp3++)
1009 queue_push(&plist, p); /* found it */
1018 if (flags == REL_COND)
1022 Reldep *rd2 = GETRELDEP(pool, evr);
1023 evr = rd2->flags == REL_ELSE ? rd2->evr : 0;
1026 evr = 0; /* assume cond is true */
1028 wp = pool_whatprovides(pool, name);
1029 if (!pool->whatprovidesdata[wp])
1030 wp = evr ? pool_whatprovides(pool, evr) : 1;
1034 pp2 = pool_whatprovides_ptr(pool, evr);
1035 pp = pool->whatprovidesdata + wp;
1039 queue_push(&plist, *pp++);
1044 queue_push(&plist, *pp2++);
1048 queue_push(&plist, *pp++);
1050 queue_push(&plist, *pp2++);
1051 /* if the number of elements did not change, we can reuse wp */
1052 if (pp - (pool->whatprovidesdata + wp) != plist.count)
1058 if (name == NAMESPACE_OTHERPROVIDERS)
1060 wp = pool_whatprovides(pool, evr);
1063 if (pool->nscallback)
1065 /* ask callback which packages provide the dependency
1067 * 1: the system (aka SYSTEMSOLVABLE)
1068 * >1: set of packages, stored as offset on whatprovidesdata
1070 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
1074 queue_push(&plist, SYSTEMSOLVABLE);
1078 /* small hack: make it possible to match <pkg>.src
1079 * we have to iterate over the solvables as src packages do not
1080 * provide anything, thus they are not indexed in our
1081 * whatprovides hash */
1082 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
1085 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
1089 if (s->arch != evr && s->arch != ARCH_NOSRC)
1091 if (pool_disabled_solvable(pool, s))
1093 if (!name || pool_match_nevr(pool, s, name))
1094 queue_push(&plist, p);
1100 FOR_POOL_SOLVABLES(p)
1102 Solvable *s = pool->solvables + p;
1103 if (s->repo != pool->installed && !pool_installable(pool, s))
1106 queue_push(&plist, p);
1110 wp = pool_whatprovides(pool, name);
1111 pp = pool->whatprovidesdata + wp;
1112 while ((p = *pp++) != 0)
1114 Solvable *s = pool->solvables + p;
1116 queue_push(&plist, p);
1122 if (evr != ARCH_ANY)
1124 /* XXX : need to check for Multi-Arch: allowed! */
1125 wp = pool_whatprovides(pool, name);
1128 /* package kind filtering */
1131 FOR_POOL_SOLVABLES(p)
1133 Solvable *s = pool->solvables + p;
1134 if (s->repo != pool->installed && !pool_installable(pool, s))
1136 if (pool_is_kind(pool, s->name, evr))
1137 queue_push(&plist, p);
1141 wp = pool_whatprovides(pool, name);
1142 pp = pool->whatprovidesdata + wp;
1143 while ((p = *pp++) != 0)
1145 Solvable *s = pool->solvables + p;
1146 if (pool_is_kind(pool, s->name, evr))
1147 queue_push(&plist, p);
1152 case REL_FILECONFLICT:
1153 pp = pool_whatprovides_ptr(pool, name);
1154 while ((p = *pp++) != 0)
1156 Id origd = MAKERELDEP(d);
1157 Solvable *s = pool->solvables + p;
1160 pidp = s->repo->idarraydata + s->provides;
1161 while ((pid = *pidp++) != 0)
1165 queue_push(&plist, p);
1173 /* we can reuse an existing entry */
1175 pool->whatprovides_rel[d] = wp;
1182 /* simple version comparison relation */
1184 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1186 pp = pool_whatprovides_ptr(pool, name);
1187 if (!ISRELDEP(name) && name < pool->whatprovidesauxoff)
1188 ppaux = pool->whatprovidesaux[name] ? pool->whatprovidesauxdata + pool->whatprovidesaux[name] : 0;
1189 while (ISRELDEP(name))
1191 rd = GETRELDEP(pool, name);
1194 while ((p = *pp++) != 0)
1196 Solvable *s = pool->solvables + p;
1200 if (pid && pid != 1)
1203 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: aux hit %d %s\n", p, pool_dep2str(pool, pid));
1208 continue; /* wrong provides name */
1209 if (pool->disttype == DISTTYPE_DEB)
1210 continue; /* unversioned provides can never match versioned deps */
1214 prd = GETRELDEP(pool, pid);
1215 if (prd->name != name)
1216 continue; /* wrong provides name */
1217 /* right package, both deps are rels. check flags/evr */
1218 if (!pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1221 queue_push(&plist, p);
1227 /* no provides - check nevr */
1228 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1229 queue_push(&plist, p);
1232 /* solvable p provides name in some rels */
1233 pidp = s->repo->idarraydata + s->provides;
1234 while ((pid = *pidp++) != 0)
1239 continue; /* wrong provides name */
1240 if (pool->disttype == DISTTYPE_DEB)
1241 continue; /* unversioned provides can never match versioned deps */
1244 prd = GETRELDEP(pool, pid);
1245 if (prd->name != name)
1246 continue; /* wrong provides name */
1247 /* right package, both deps are rels. check flags/evr */
1248 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1249 break; /* matches */
1252 continue; /* none of the providers matched */
1253 queue_push(&plist, p);
1255 /* make our system solvable provide all unknown rpmlib() stuff */
1256 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1257 queue_push(&plist, SYSTEMSOLVABLE);
1259 /* add providers to whatprovides */
1261 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1263 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1266 return pool->whatprovides_rel[d];
1270 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1272 int nrels = pool->nrels;
1276 if (!pool->whatprovides_rel)
1278 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1280 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1282 if (ns && rd->name != ns)
1284 if (evr && rd->evr != evr)
1286 pool->whatprovides_rel[d] = 0;
1290 /* intersect dependencies in keyname with dep, return list of matching packages */
1292 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1297 FOR_POOL_SOLVABLES(p)
1299 Solvable *s = pool->solvables + p;
1300 if (s->repo->disabled)
1302 if (s->repo != pool->installed && !pool_installable(pool, s))
1304 if (solvable_matchesdep(s, keyname, dep, marker))
1309 /*************************************************************************/
1312 pool_debug(Pool *pool, int type, const char *format, ...)
1317 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1319 if ((pool->debugmask & type) == 0)
1322 va_start(args, format);
1323 if (!pool->debugcallback)
1325 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1326 vprintf(format, args);
1328 vfprintf(stderr, format, args);
1331 vsnprintf(buf, sizeof(buf), format, args);
1333 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1337 pool_error(Pool *pool, int ret, const char *format, ...)
1341 va_start(args, format);
1344 pool->errstra = 1024;
1345 pool->errstr = solv_malloc(pool->errstra);
1353 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1355 if (l >= 0 && l + 1 > pool->errstra)
1357 pool->errstra = l + 256;
1358 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1359 va_start(args, format);
1360 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1364 strcpy(pool->errstr, "unknown error");
1365 if (pool->debugmask & SOLV_ERROR)
1366 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1371 pool_errstr(Pool *pool)
1373 return pool->errstr ? pool->errstr : "no error";
1377 pool_setdebuglevel(Pool *pool, int level)
1379 int mask = SOLV_DEBUG_RESULT;
1381 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1383 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1385 mask |= SOLV_DEBUG_PROPAGATE;
1387 mask |= SOLV_DEBUG_RULE_CREATION;
1388 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1389 pool->debugmask = mask;
1392 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1394 pool->debugcallback = debugcallback;
1395 pool->debugcallbackdata = debugcallbackdata;
1398 void pool_setdebugmask(Pool *pool, int mask)
1400 pool->debugmask = mask;
1403 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
1405 pool->loadcallback = cb;
1406 pool->loadcallbackdata = loadcbdata;
1409 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct _Pool *, void *, Id, Id), void *nscbdata)
1411 pool->nscallback = cb;
1412 pool->nscallbackdata = nscbdata;
1415 /*************************************************************************/
1417 struct searchfiles {
1423 #define SEARCHFILES_BLOCK 127
1426 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1430 struct searchfiles *csf;
1432 while ((dep = *ida++) != 0)
1435 while (ISRELDEP(dep))
1438 sid = pool->ss.nstrings + GETRELID(dep);
1439 if (MAPTST(&csf->seen, sid))
1444 MAPSET(&csf->seen, sid);
1445 rd = GETRELDEP(pool, dep);
1448 else if (rd->flags == REL_NAMESPACE)
1450 if (rd->name == NAMESPACE_SPLITPROVIDES)
1453 if (!csf || MAPTST(&csf->seen, sid))
1458 MAPSET(&csf->seen, sid);
1462 else if (rd->flags == REL_FILECONFLICT)
1472 pool_addfileprovides_dep(pool, ids, csf, isf);
1478 if (MAPTST(&csf->seen, dep))
1480 MAPSET(&csf->seen, dep);
1481 s = pool_id2str(pool, dep);
1484 if (csf != isf && pool->addedfileprovides == 1 && !repodata_filelistfilter_matches(0, s))
1485 continue; /* skip non-standard locations csf == isf: installed case */
1486 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1487 csf->ids[csf->nfiles++] = dep;
1491 struct addfileprovides_cbdata {
1505 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1507 struct addfileprovides_cbdata *cbd = cbdata;
1510 if (!cbd->useddirs.size)
1512 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1515 cbd->dirs = solv_malloc2(cbd->nfiles, sizeof(char *));
1516 cbd->names = solv_malloc2(cbd->nfiles, sizeof(char *));
1517 for (i = 0; i < cbd->nfiles; i++)
1519 char *s = solv_strdup(pool_id2str(data->repo->pool, cbd->ids[i]));
1521 s = strrchr(s, '/');
1523 cbd->names[i] = s + 1;
1526 for (i = 0; i < cbd->nfiles; i++)
1529 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1534 did = repodata_str2dir(data, cbd->dirs[i], 0);
1537 MAPSET(&cbd->useddirs, did);
1539 repodata_free_dircache(data);
1541 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1543 for (i = 0; i < cbd->nfiles; i++)
1544 if (cbd->dids[i] == value->id && !strcmp(cbd->names[i], value->str))
1545 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1550 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1555 Queue fileprovidesq;
1556 int i, j, repoid, repodataid;
1557 int provstart, provend;
1559 int ndone, incomplete;
1564 cbd->nfiles = sf->nfiles;
1568 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1569 map_init(&cbd->providedids, pool->ss.nstrings);
1572 repo = repoonly ? repoonly : pool->repos[repoid];
1573 map_init(&donemap, pool->nsolvables);
1574 queue_init(&fileprovidesq);
1575 provstart = provend = 0;
1578 if (!repo || repo->disabled)
1580 if (repoonly || ++repoid == pool->nrepos)
1582 repo = pool->repos[repoid];
1586 FOR_REPODATAS(repo, repodataid, data)
1588 if (ndone >= repo->nsolvables)
1591 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1593 map_empty(&cbd->providedids);
1594 for (i = 0; i < fileprovidesq.count; i++)
1595 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1596 provstart = data->start;
1597 provend = data->end;
1598 for (i = 0; i < cbd->nfiles; i++)
1599 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1601 if (i == cbd->nfiles)
1603 /* great! no need to search files */
1604 for (p = data->start; p < data->end; p++)
1605 if (pool->solvables[p].repo == repo)
1607 if (MAPTST(&donemap, p))
1609 MAPSET(&donemap, p);
1616 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1619 if (data->start < provstart || data->end > provend)
1621 map_empty(&cbd->providedids);
1622 provstart = provend = 0;
1625 /* check if the data is incomplete */
1627 if (data->state == REPODATA_AVAILABLE)
1629 for (j = 1; j < data->nkeys; j++)
1630 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1632 if (j < data->nkeys)
1635 for (i = 0; i < cbd->nfiles; i++)
1636 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1637 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1639 for (i = 0; i < cbd->nfiles; i++)
1640 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1642 if (i < cbd->nfiles)
1648 map_init(&cbd->useddirs, 0);
1649 for (p = data->start; p < data->end; p++)
1650 if (pool->solvables[p].repo == repo)
1652 if (MAPTST(&donemap, p))
1654 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1657 MAPSET(&donemap, p);
1661 map_free(&cbd->useddirs);
1664 if (repoonly || ++repoid == pool->nrepos)
1666 repo = pool->repos[repoid];
1669 queue_free(&fileprovidesq);
1670 map_free(&cbd->providedids);
1673 for (i = 0; i < cbd->nfiles; i++)
1674 solv_free(cbd->dirs[i]);
1675 cbd->dirs = solv_free(cbd->dirs);
1676 cbd->names = solv_free(cbd->names);
1681 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1684 Repo *installed, *repo;
1685 struct searchfiles sf, isf, *isfp;
1686 struct addfileprovides_cbdata cbd;
1690 installed = pool->installed;
1691 now = solv_timems(0);
1692 memset(&sf, 0, sizeof(sf));
1693 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1694 memset(&isf, 0, sizeof(isf));
1695 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1696 pool->addedfileprovides = pool->addfileprovidesfiltered ? 1 : 2;
1701 queue_empty(idqinst);
1702 isfp = installed ? &isf : 0;
1703 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1709 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1711 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1713 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1715 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1717 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1719 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1721 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1724 map_free(&isf.seen);
1725 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1730 for (i = 0; i < sf.nfiles; i++)
1731 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1733 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1735 for (i = 0; i < sf.nfiles; i++)
1736 queue_push(idq, sf.ids[i]);
1738 for (i = 0; i < sf.nfiles; i++)
1739 queue_push(idqinst, sf.ids[i]);
1745 for (i = 0; i < isf.nfiles; i++)
1746 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1749 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1750 if (installed && idqinst)
1751 for (i = 0; i < isf.nfiles; i++)
1752 queue_pushunique(idqinst, isf.ids[i]);
1755 solv_free(cbd.dids);
1756 pool_freewhatprovides(pool); /* as we have added provides */
1757 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1761 pool_addfileprovides(Pool *pool)
1763 pool_addfileprovides_queue(pool, 0, 0);
1767 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)
1771 if (pool->solvables[p].repo)
1772 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1775 /* FIXME: obey callback return value! */
1776 for (p = 1; p < pool->nsolvables; p++)
1777 if (pool->solvables[p].repo)
1778 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1782 pool_clear_pos(Pool *pool)
1784 memset(&pool->pos, 0, sizeof(pool->pos));
1789 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1793 pool->languagecache = solv_free(pool->languagecache);
1794 pool->languagecacheother = 0;
1795 for (i = 0; i < pool->nlanguages; i++)
1796 free((char *)pool->languages[i]);
1797 pool->languages = solv_free((void *)pool->languages);
1798 pool->nlanguages = nlanguages;
1801 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1802 for (i = 0; i < pool->nlanguages; i++)
1803 pool->languages[i] = solv_strdup(languages[i]);
1807 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1813 if (!lang || !*lang)
1815 n = pool_id2str(pool, id);
1816 l = strlen(n) + strlen(lang) + 2;
1817 if (l > sizeof(buf))
1818 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1821 sprintf(p, "%s:%s", n, lang);
1822 id = pool_str2id(pool, p, create);
1829 pool_alloctmpspace(Pool *pool, int len)
1831 int n = pool->tmpspace.n;
1834 if (len > pool->tmpspace.len[n])
1836 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1837 pool->tmpspace.len[n] = len + 32;
1839 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1840 return pool->tmpspace.buf[n];
1844 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1849 n = oldn = pool->tmpspace.n;
1853 n = POOL_TMPSPACEBUF - 1;
1856 if (pool->tmpspace.buf[n] != space)
1858 if (len > pool->tmpspace.len[n])
1860 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1861 pool->tmpspace.len[n] = len + 32;
1863 return pool->tmpspace.buf[n];
1870 pool_freetmpspace(Pool *pool, const char *space)
1872 int n = pool->tmpspace.n;
1875 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1876 if (pool->tmpspace.buf[n] == space)
1877 pool->tmpspace.n = n;
1881 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1885 l1 = str1 ? strlen(str1) : 0;
1886 l2 = str2 ? strlen(str2) : 0;
1887 l3 = str3 ? strlen(str3) : 0;
1888 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1909 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1914 l1 = str1 ? strlen(str1) : 0;
1915 l2 = str2 ? strlen(str2) : 0;
1916 l3 = str3 ? strlen(str3) : 0;
1917 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1921 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1944 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1949 s = pool_alloctmpspace(pool, 2 * len + 1);
1950 solv_bin2hex(buf, len, s);
1954 /*******************************************************************/
1966 struct mptree *mptree;
1977 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1979 struct ducbdata *cbd = cbdata;
1982 if (data != cbd->olddata)
1984 Id dn, mp, comp, *dirmap, *dirs;
1986 const char *compstr;
1987 struct mptree *mptree;
1989 /* create map from dir to mptree */
1990 cbd->dirmap = solv_free(cbd->dirmap);
1992 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1993 mptree = cbd->mptree;
1995 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
2009 if (!mptree[mp].child)
2014 if (data->localpool)
2015 compstr = stringpool_id2str(&data->spool, comp);
2017 compstr = pool_id2str(data->repo->pool, comp);
2018 compl = strlen(compstr);
2019 for (i = mptree[mp].child; i; i = mptree[i].sibling)
2020 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
2022 dirmap[dn] = i ? i : -mp;
2024 /* change dirmap to point to mountpoint instead of mptree */
2025 for (dn = 0; dn < data->dirpool.ndirs; dn++)
2028 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
2030 cbd->dirmap = dirmap;
2031 cbd->nmap = data->dirpool.ndirs;
2032 cbd->olddata = data;
2035 if (value->id < 0 || value->id >= cbd->nmap)
2037 mp = cbd->dirmap[value->id];
2040 if (cbd->addsub > 0)
2042 cbd->mps[mp].kbytes += value->num;
2043 cbd->mps[mp].files += value->num2;
2045 else if (!(cbd->mps[mp].flags & DUCHANGES_ONLYADD))
2047 cbd->mps[mp].kbytes -= value->num;
2048 cbd->mps[mp].files -= value->num2;
2054 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
2057 if (mptree[pos].mountpoint == -1)
2058 mptree[pos].mountpoint = mountpoint;
2060 mountpoint = mptree[pos].mountpoint;
2061 for (i = mptree[pos].child; i; i = mptree[i].sibling)
2062 propagate_mountpoints(mptree, i, mountpoint);
2065 #define MPTREE_BLOCK 15
2067 static struct mptree *
2068 create_mptree(DUChanges *mps, int nmps)
2071 struct mptree *mptree;
2074 const char *p, *path, *compstr;
2076 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
2079 mptree[0].sibling = 0;
2080 mptree[0].child = 0;
2082 mptree[0].compl = 0;
2083 mptree[0].mountpoint = -1;
2086 /* create component tree */
2087 for (mp = 0; mp < nmps; mp++)
2092 path = mps[mp].path;
2097 if ((p = strchr(path, '/')) == 0)
2100 compl = strlen(compstr);
2111 for (i = mptree[pos].child; i; i = mptree[i].sibling)
2112 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
2116 /* create new node */
2117 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
2119 mptree[i].sibling = mptree[pos].child;
2120 mptree[i].child = 0;
2121 mptree[i].comp = compstr;
2122 mptree[i].compl = compl;
2123 mptree[i].mountpoint = -1;
2124 mptree[pos].child = i;
2128 mptree[pos].mountpoint = mp;
2131 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
2134 for (i = 0; i < nmptree; i++)
2136 printf("#%d sibling: %d\n", i, mptree[i].sibling);
2137 printf("#%d child: %d\n", i, mptree[i].child);
2138 printf("#%d comp: %s\n", i, mptree[i].comp);
2139 printf("#%d compl: %d\n", i, mptree[i].compl);
2140 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
2148 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
2150 struct mptree *mptree;
2151 struct ducbdata cbd;
2155 Repo *oldinstalled = pool->installed;
2156 int haveonlyadd = 0;
2158 map_init(&ignoredu, 0);
2159 mptree = create_mptree(mps, nmps);
2161 for (i = 0; i < nmps; i++)
2162 if ((mps[i].flags & DUCHANGES_ONLYADD) != 0)
2168 cbd.mptree = mptree;
2170 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2172 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2174 if (!MAPTST(installedmap, sp))
2177 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2178 if (!cbd.hasdu && oldinstalled)
2182 /* no du data available, ignore data of all installed solvables we obsolete */
2184 map_grow(&ignoredu, oldinstalled->end - oldinstalled->start);
2185 FOR_PROVIDES(op, opp, s->name)
2187 Solvable *s2 = pool->solvables + op;
2188 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2190 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2192 if (op >= oldinstalled->start && op < oldinstalled->end)
2194 MAPSET(&ignoredu, op - oldinstalled->start);
2195 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2197 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2199 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2207 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2208 while ((obs = *obsp++) != 0)
2209 FOR_PROVIDES(op, opp, obs)
2211 Solvable *s2 = pool->solvables + op;
2212 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, s2, obs))
2214 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2216 if (op >= oldinstalled->start && op < oldinstalled->end)
2218 MAPSET(&ignoredu, op - oldinstalled->start);
2219 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2221 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2223 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2235 /* assumes we allways have du data for installed solvables */
2236 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2238 if (MAPTST(installedmap, sp))
2240 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
2242 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2245 map_free(&ignoredu);
2246 solv_free(cbd.dirmap);
2251 pool_calc_installsizechange(Pool *pool, Map *installedmap)
2256 Repo *oldinstalled = pool->installed;
2258 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2260 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2262 if (!MAPTST(installedmap, sp))
2264 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2268 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2270 if (MAPTST(installedmap, sp))
2272 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2280 * 2: conflicts with installed
2281 * 8: interesting (only true if installed)
2285 static inline Id dep2name(Pool *pool, Id dep)
2287 while (ISRELDEP(dep))
2289 Reldep *rd = GETRELDEP(pool, dep);
2295 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
2298 Solvable *sn = pool->solvables + n;
2300 FOR_PROVIDES(p, pp, sn->name)
2302 Solvable *s = pool->solvables + p;
2303 if (s->name != sn->name || s->arch != sn->arch)
2305 if ((map[p] & 9) != 9)
2307 if (pool_match_nevr(pool, pool->solvables + p, con))
2309 return 1; /* found installed package that doesn't conflict */
2314 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
2318 FOR_PROVIDES(p, pp, dep)
2320 if (p == SYSTEMSOLVABLE)
2321 return 1; /* always boring, as never constraining */
2322 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
2324 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
2325 if (providedbyinstalled_multiversion(pool, map, p, dep))
2327 if ((map[p] & 9) == 9)
2335 * pool_trivial_installable - calculate if a set of solvables is
2336 * trivial installable without any other installs/deinstalls of
2337 * packages not belonging to the set.
2339 * the state is returned in the result queue:
2340 * 1: solvable is installable without any other package changes
2341 * 0: solvable is not installable
2342 * -1: solvable is installable, but doesn't constrain any installed packages
2346 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
2349 Id p, *dp, con, *conp, req, *reqp;
2353 map = solv_calloc(pool->nsolvables, 1);
2354 for (p = 1; p < pool->nsolvables; p++)
2356 if (!MAPTST(installedmap, p))
2359 s = pool->solvables + p;
2362 conp = s->repo->idarraydata + s->conflicts;
2363 while ((con = *conp++) != 0)
2365 dp = pool_whatprovides_ptr(pool, con);
2367 map[p] |= 2; /* XXX: self conflict ? */
2370 for (i = 0; i < pkgs->count; i++)
2371 map[pkgs->elements[i]] = 16;
2373 for (i = 0, did = 0; did < pkgs->count; i++, did++)
2375 if (i == pkgs->count)
2377 p = pkgs->elements[i];
2378 if ((map[p] & 16) == 0)
2380 if ((map[p] & 2) != 0)
2385 s = pool->solvables + p;
2389 reqp = s->repo->idarraydata + s->requires;
2390 while ((req = *reqp++) != 0)
2392 if (req == SOLVABLE_PREREQMARKER)
2394 r = providedbyinstalled(pool, map, req, 0, 0);
2397 /* decided and miss */
2403 break; /* undecided */
2404 m |= r; /* 1 | 9 | 17 */
2413 int ispatch = 0; /* see solver.c patch handling */
2415 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
2417 conp = s->repo->idarraydata + s->conflicts;
2418 while ((con = *conp++) != 0)
2420 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2426 if ((m == 1 || m == 17) && ISRELDEP(con))
2428 con = dep2name(pool, con);
2429 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2434 continue; /* found a conflict */
2437 if (s->repo && s->repo != oldinstalled)
2439 Id p2, obs, *obsp, *pp;
2443 obsp = s->repo->idarraydata + s->obsoletes;
2444 while ((obs = *obsp++) != 0)
2446 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2455 FOR_PROVIDES(p2, pp, s->name)
2457 s2 = pool->solvables + p2;
2458 if (s2->name == s->name && (map[p2] & 1) != 0)
2475 queue_init_clone(res, pkgs);
2476 for (i = 0; i < pkgs->count; i++)
2478 m = map[pkgs->elements[i]];
2485 res->elements[i] = r;
2491 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2493 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2497 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2499 if (entry == SOLVID_POS && pool->pos.repo)
2500 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2503 return solvable_lookup_str(pool->solvables + entry, keyname);
2507 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2509 if (entry == SOLVID_POS && pool->pos.repo)
2510 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2513 return solvable_lookup_id(pool->solvables + entry, keyname);
2517 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2519 if (entry == SOLVID_POS && pool->pos.repo)
2520 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
2523 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2527 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2529 if (entry == SOLVID_POS && pool->pos.repo)
2530 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2533 return solvable_lookup_void(pool->solvables + entry, keyname);
2536 const unsigned char *
2537 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2539 if (entry == SOLVID_POS && pool->pos.repo)
2540 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2543 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2547 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2549 if (entry == SOLVID_POS && pool->pos.repo)
2550 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2553 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2557 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
2559 if (entry == SOLVID_POS && pool->pos.repo)
2560 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
2563 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
2567 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2572 if (entry != SOLVID_POS)
2574 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2575 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2576 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2577 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2582 add_new_provider(Pool *pool, Id id, Id p)
2587 while (ISRELDEP(id))
2589 Reldep *rd = GETRELDEP(pool, id);
2594 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2606 queue_push(&q, *pp);
2610 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2611 if (id < pool->whatprovidesauxoff)
2612 pool->whatprovidesaux[id] = 0; /* sorry */
2617 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2619 int hadhashes = pool->relhashtbl ? 1 : 0;
2625 if (!conflicts->count)
2627 for (i = 0; i < conflicts->count; i += 6)
2629 fn = conflicts->elements[i];
2630 p = conflicts->elements[i + 1];
2631 md5 = conflicts->elements[i + 2];
2632 q = conflicts->elements[i + 4];
2633 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2634 s = pool->solvables + p;
2637 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2638 if (pool->whatprovides)
2639 add_new_provider(pool, fn, p);
2640 if (pool->whatprovides_rel)
2641 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2642 s = pool->solvables + q;
2645 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2648 pool_freeidhashes(pool);
2652 pool_prepend_rootdir(Pool *pool, const char *path)
2657 return solv_strdup(path);
2658 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2662 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2668 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2672 pool_set_rootdir(Pool *pool, const char *rootdir)
2674 solv_free(pool->rootdir);
2675 pool->rootdir = solv_strdup(rootdir);
2679 pool_get_rootdir(Pool *pool)
2681 return pool->rootdir;
2684 /* only used in libzypp */
2686 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2688 pool->custom_vendorcheck = vendorcheck;