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 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 */
1017 wp = pool_whatprovides(pool, name);
1018 if (!pool->whatprovidesdata[wp])
1019 wp = pool_whatprovides(pool, evr);
1023 pp2 = pool_whatprovides_ptr(pool, evr);
1024 pp = pool->whatprovidesdata + wp;
1028 queue_push(&plist, *pp++);
1033 queue_push(&plist, *pp2++);
1037 queue_push(&plist, *pp++);
1039 queue_push(&plist, *pp2++);
1040 /* if the number of elements did not change, we can reuse wp */
1041 if (pp - (pool->whatprovidesdata + wp) != plist.count)
1047 /* assume the condition is true */
1048 wp = pool_whatprovides(pool, name);
1052 if (name == NAMESPACE_OTHERPROVIDERS)
1054 wp = pool_whatprovides(pool, evr);
1057 if (pool->nscallback)
1059 /* ask callback which packages provide the dependency
1061 * 1: the system (aka SYSTEMSOLVABLE)
1062 * >1: set of packages, stored as offset on whatprovidesdata
1064 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
1068 queue_push(&plist, SYSTEMSOLVABLE);
1072 /* small hack: make it possible to match <pkg>.src
1073 * we have to iterate over the solvables as src packages do not
1074 * provide anything, thus they are not indexed in our
1075 * whatprovides hash */
1076 if (evr == ARCH_SRC || evr == ARCH_NOSRC)
1079 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
1083 if (s->arch != evr && s->arch != ARCH_NOSRC)
1085 if (pool_disabled_solvable(pool, s))
1087 if (!name || pool_match_nevr(pool, s, name))
1088 queue_push(&plist, p);
1094 FOR_POOL_SOLVABLES(p)
1096 Solvable *s = pool->solvables + p;
1097 if (s->repo != pool->installed && !pool_installable(pool, s))
1100 queue_push(&plist, p);
1104 wp = pool_whatprovides(pool, name);
1105 pp = pool->whatprovidesdata + wp;
1106 while ((p = *pp++) != 0)
1108 Solvable *s = pool->solvables + p;
1110 queue_push(&plist, p);
1116 if (evr != ARCH_ANY)
1118 /* XXX : need to check for Multi-Arch: allowed! */
1119 wp = pool_whatprovides(pool, name);
1122 /* package kind filtering */
1125 FOR_POOL_SOLVABLES(p)
1127 Solvable *s = pool->solvables + p;
1128 if (s->repo != pool->installed && !pool_installable(pool, s))
1130 if (pool_is_kind(pool, s->name, evr))
1131 queue_push(&plist, p);
1135 wp = pool_whatprovides(pool, name);
1136 pp = pool->whatprovidesdata + wp;
1137 while ((p = *pp++) != 0)
1139 Solvable *s = pool->solvables + p;
1140 if (pool_is_kind(pool, s->name, evr))
1141 queue_push(&plist, p);
1146 case REL_FILECONFLICT:
1147 pp = pool_whatprovides_ptr(pool, name);
1148 while ((p = *pp++) != 0)
1150 Id origd = MAKERELDEP(d);
1151 Solvable *s = pool->solvables + p;
1154 pidp = s->repo->idarraydata + s->provides;
1155 while ((pid = *pidp++) != 0)
1159 queue_push(&plist, p);
1167 /* we can reuse an existing entry */
1169 pool->whatprovides_rel[d] = wp;
1176 /* simple version comparison relation */
1178 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: what provides %s?\n", pool_dep2str(pool, name));
1180 pp = pool_whatprovides_ptr(pool, name);
1181 if (!ISRELDEP(name) && name < pool->whatprovidesauxoff)
1182 ppaux = pool->whatprovidesaux[name] ? pool->whatprovidesauxdata + pool->whatprovidesaux[name] : 0;
1183 while (ISRELDEP(name))
1185 rd = GETRELDEP(pool, name);
1188 while ((p = *pp++) != 0)
1190 Solvable *s = pool->solvables + p;
1194 if (pid && pid != 1)
1197 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: aux hit %d %s\n", p, pool_dep2str(pool, pid));
1202 continue; /* wrong provides name */
1203 if (pool->disttype == DISTTYPE_DEB)
1204 continue; /* unversioned provides can never match versioned deps */
1208 prd = GETRELDEP(pool, pid);
1209 if (prd->name != name)
1210 continue; /* wrong provides name */
1211 /* right package, both deps are rels. check flags/evr */
1212 if (!pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1215 queue_push(&plist, p);
1221 /* no provides - check nevr */
1222 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
1223 queue_push(&plist, p);
1226 /* solvable p provides name in some rels */
1227 pidp = s->repo->idarraydata + s->provides;
1228 while ((pid = *pidp++) != 0)
1233 continue; /* wrong provides name */
1234 if (pool->disttype == DISTTYPE_DEB)
1235 continue; /* unversioned provides can never match versioned deps */
1238 prd = GETRELDEP(pool, pid);
1239 if (prd->name != name)
1240 continue; /* wrong provides name */
1241 /* right package, both deps are rels. check flags/evr */
1242 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
1243 break; /* matches */
1246 continue; /* none of the providers matched */
1247 queue_push(&plist, p);
1249 /* make our system solvable provide all unknown rpmlib() stuff */
1250 if (plist.count == 0 && !strncmp(pool_id2str(pool, name), "rpmlib(", 7))
1251 queue_push(&plist, SYSTEMSOLVABLE);
1253 /* add providers to whatprovides */
1255 POOL_DEBUG(SOLV_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
1257 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
1260 return pool->whatprovides_rel[d];
1264 pool_flush_namespaceproviders(Pool *pool, Id ns, Id evr)
1266 int nrels = pool->nrels;
1270 if (!pool->whatprovides_rel)
1272 for (d = 1, rd = pool->rels + d; d < nrels; d++, rd++)
1274 if (rd->flags != REL_NAMESPACE || rd->name == NAMESPACE_OTHERPROVIDERS)
1276 if (ns && rd->name != ns)
1278 if (evr && rd->evr != evr)
1280 pool->whatprovides_rel[d] = 0;
1284 /* intersect dependencies in keyname with dep, return list of matching packages */
1286 pool_whatmatchesdep(Pool *pool, Id keyname, Id dep, Queue *q, int marker)
1291 FOR_POOL_SOLVABLES(p)
1293 Solvable *s = pool->solvables + p;
1294 if (s->repo->disabled)
1296 if (s->repo != pool->installed && !pool_installable(pool, s))
1298 if (solvable_matchesdep(s, keyname, dep, marker))
1303 /*************************************************************************/
1306 pool_debug(Pool *pool, int type, const char *format, ...)
1311 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0)
1313 if ((pool->debugmask & type) == 0)
1316 va_start(args, format);
1317 if (!pool->debugcallback)
1319 if ((type & (SOLV_FATAL|SOLV_ERROR)) == 0 && !(pool->debugmask & SOLV_DEBUG_TO_STDERR))
1320 vprintf(format, args);
1322 vfprintf(stderr, format, args);
1325 vsnprintf(buf, sizeof(buf), format, args);
1327 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
1331 pool_error(Pool *pool, int ret, const char *format, ...)
1335 va_start(args, format);
1338 pool->errstra = 1024;
1339 pool->errstr = solv_malloc(pool->errstra);
1347 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1349 if (l >= 0 && l + 1 > pool->errstra)
1351 pool->errstra = l + 256;
1352 pool->errstr = solv_realloc(pool->errstr, pool->errstra);
1353 va_start(args, format);
1354 l = vsnprintf(pool->errstr, pool->errstra, format, args);
1358 strcpy(pool->errstr, "unknown error");
1359 if (pool->debugmask & SOLV_ERROR)
1360 pool_debug(pool, SOLV_ERROR, "%s\n", pool->errstr);
1365 pool_errstr(Pool *pool)
1367 return pool->errstr ? pool->errstr : "no error";
1371 pool_setdebuglevel(Pool *pool, int level)
1373 int mask = SOLV_DEBUG_RESULT;
1375 mask |= SOLV_DEBUG_STATS|SOLV_DEBUG_ANALYZE|SOLV_DEBUG_UNSOLVABLE|SOLV_DEBUG_SOLVER|SOLV_DEBUG_TRANSACTION|SOLV_ERROR;
1377 mask |= SOLV_DEBUG_JOB|SOLV_DEBUG_SOLUTIONS|SOLV_DEBUG_POLICY;
1379 mask |= SOLV_DEBUG_PROPAGATE;
1381 mask |= SOLV_DEBUG_RULE_CREATION;
1382 mask |= pool->debugmask & SOLV_DEBUG_TO_STDERR; /* keep bit */
1383 pool->debugmask = mask;
1386 void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
1388 pool->debugcallback = debugcallback;
1389 pool->debugcallbackdata = debugcallbackdata;
1392 void pool_setdebugmask(Pool *pool, int mask)
1394 pool->debugmask = mask;
1397 void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
1399 pool->loadcallback = cb;
1400 pool->loadcallbackdata = loadcbdata;
1403 void pool_setnamespacecallback(Pool *pool, Id (*cb)(struct _Pool *, void *, Id, Id), void *nscbdata)
1405 pool->nscallback = cb;
1406 pool->nscallbackdata = nscbdata;
1409 /*************************************************************************/
1411 struct searchfiles {
1417 #define SEARCHFILES_BLOCK 127
1420 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
1424 struct searchfiles *csf;
1426 while ((dep = *ida++) != 0)
1429 while (ISRELDEP(dep))
1432 sid = pool->ss.nstrings + GETRELID(dep);
1433 if (MAPTST(&csf->seen, sid))
1438 MAPSET(&csf->seen, sid);
1439 rd = GETRELDEP(pool, dep);
1442 else if (rd->flags == REL_NAMESPACE)
1444 if (rd->name == NAMESPACE_SPLITPROVIDES)
1447 if (!csf || MAPTST(&csf->seen, sid))
1452 MAPSET(&csf->seen, sid);
1456 else if (rd->flags == REL_FILECONFLICT)
1466 pool_addfileprovides_dep(pool, ids, csf, isf);
1472 if (MAPTST(&csf->seen, dep))
1474 MAPSET(&csf->seen, dep);
1475 s = pool_id2str(pool, dep);
1478 if (csf != isf && pool->addedfileprovides == 1 && !repodata_filelistfilter_matches(0, s))
1479 continue; /* skip non-standard locations csf == isf: installed case */
1480 csf->ids = solv_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1481 csf->ids[csf->nfiles++] = dep;
1485 struct addfileprovides_cbdata {
1499 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1501 struct addfileprovides_cbdata *cbd = cbdata;
1504 if (!cbd->useddirs.size)
1506 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
1509 cbd->dirs = solv_malloc2(cbd->nfiles, sizeof(char *));
1510 cbd->names = solv_malloc2(cbd->nfiles, sizeof(char *));
1511 for (i = 0; i < cbd->nfiles; i++)
1513 char *s = solv_strdup(pool_id2str(data->repo->pool, cbd->ids[i]));
1515 s = strrchr(s, '/');
1517 cbd->names[i] = s + 1;
1520 for (i = 0; i < cbd->nfiles; i++)
1523 if (MAPTST(&cbd->providedids, cbd->ids[i]))
1528 did = repodata_str2dir(data, cbd->dirs[i], 0);
1531 MAPSET(&cbd->useddirs, did);
1533 repodata_free_dircache(data);
1535 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
1537 for (i = 0; i < cbd->nfiles; i++)
1538 if (cbd->dids[i] == value->id && !strcmp(cbd->names[i], value->str))
1539 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
1544 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
1549 Queue fileprovidesq;
1550 int i, j, repoid, repodataid;
1551 int provstart, provend;
1553 int ndone, incomplete;
1558 cbd->nfiles = sf->nfiles;
1562 cbd->dids = solv_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
1563 map_init(&cbd->providedids, pool->ss.nstrings);
1566 repo = repoonly ? repoonly : pool->repos[repoid];
1567 map_init(&donemap, pool->nsolvables);
1568 queue_init(&fileprovidesq);
1569 provstart = provend = 0;
1572 if (!repo || repo->disabled)
1574 if (repoonly || ++repoid == pool->nrepos)
1576 repo = pool->repos[repoid];
1580 FOR_REPODATAS(repo, repodataid, data)
1582 if (ndone >= repo->nsolvables)
1585 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
1587 map_empty(&cbd->providedids);
1588 for (i = 0; i < fileprovidesq.count; i++)
1589 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
1590 provstart = data->start;
1591 provend = data->end;
1592 for (i = 0; i < cbd->nfiles; i++)
1593 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
1595 if (i == cbd->nfiles)
1597 /* great! no need to search files */
1598 for (p = data->start; p < data->end; p++)
1599 if (pool->solvables[p].repo == repo)
1601 if (MAPTST(&donemap, p))
1603 MAPSET(&donemap, p);
1610 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1613 if (data->start < provstart || data->end > provend)
1615 map_empty(&cbd->providedids);
1616 provstart = provend = 0;
1619 /* check if the data is incomplete */
1621 if (data->state == REPODATA_AVAILABLE)
1623 for (j = 1; j < data->nkeys; j++)
1624 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1626 if (j < data->nkeys)
1629 for (i = 0; i < cbd->nfiles; i++)
1630 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1631 printf("need complete filelist because of %s\n", pool_id2str(pool, cbd->ids[i]));
1633 for (i = 0; i < cbd->nfiles; i++)
1634 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, pool_id2str(pool, cbd->ids[i])))
1636 if (i < cbd->nfiles)
1642 map_init(&cbd->useddirs, 0);
1643 for (p = data->start; p < data->end; p++)
1644 if (pool->solvables[p].repo == repo)
1646 if (MAPTST(&donemap, p))
1648 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1651 MAPSET(&donemap, p);
1655 map_free(&cbd->useddirs);
1658 if (repoonly || ++repoid == pool->nrepos)
1660 repo = pool->repos[repoid];
1663 queue_free(&fileprovidesq);
1664 map_free(&cbd->providedids);
1667 for (i = 0; i < cbd->nfiles; i++)
1668 solv_free(cbd->dirs[i]);
1669 cbd->dirs = solv_free(cbd->dirs);
1670 cbd->names = solv_free(cbd->names);
1675 pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
1678 Repo *installed, *repo;
1679 struct searchfiles sf, isf, *isfp;
1680 struct addfileprovides_cbdata cbd;
1684 installed = pool->installed;
1685 now = solv_timems(0);
1686 memset(&sf, 0, sizeof(sf));
1687 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1688 memset(&isf, 0, sizeof(isf));
1689 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1690 pool->addedfileprovides = pool->addfileprovidesfiltered ? 1 : 2;
1695 queue_empty(idqinst);
1696 isfp = installed ? &isf : 0;
1697 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1703 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1705 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1707 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1709 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1711 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1713 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1715 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1718 map_free(&isf.seen);
1719 POOL_DEBUG(SOLV_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1724 for (i = 0; i < sf.nfiles; i++)
1725 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in filelist\n", pool_id2str(pool, sf.ids[i]));
1727 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1729 for (i = 0; i < sf.nfiles; i++)
1730 queue_push(idq, sf.ids[i]);
1732 for (i = 0; i < sf.nfiles; i++)
1733 queue_push(idqinst, sf.ids[i]);
1739 for (i = 0; i < isf.nfiles; i++)
1740 POOL_DEBUG(SOLV_DEBUG_STATS, "looking up %s in installed filelist\n", pool_id2str(pool, isf.ids[i]));
1743 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1744 if (installed && idqinst)
1745 for (i = 0; i < isf.nfiles; i++)
1746 queue_pushunique(idqinst, isf.ids[i]);
1749 solv_free(cbd.dids);
1750 pool_freewhatprovides(pool); /* as we have added provides */
1751 POOL_DEBUG(SOLV_DEBUG_STATS, "addfileprovides took %d ms\n", solv_timems(now));
1755 pool_addfileprovides(Pool *pool)
1757 pool_addfileprovides_queue(pool, 0, 0);
1761 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)
1765 if (pool->solvables[p].repo)
1766 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1769 /* FIXME: obey callback return value! */
1770 for (p = 1; p < pool->nsolvables; p++)
1771 if (pool->solvables[p].repo)
1772 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1776 pool_clear_pos(Pool *pool)
1778 memset(&pool->pos, 0, sizeof(pool->pos));
1783 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1787 pool->languagecache = solv_free(pool->languagecache);
1788 pool->languagecacheother = 0;
1789 for (i = 0; i < pool->nlanguages; i++)
1790 free((char *)pool->languages[i]);
1791 pool->languages = solv_free((void *)pool->languages);
1792 pool->nlanguages = nlanguages;
1795 pool->languages = solv_calloc(nlanguages, sizeof(const char **));
1796 for (i = 0; i < pool->nlanguages; i++)
1797 pool->languages[i] = solv_strdup(languages[i]);
1801 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1807 if (!lang || !*lang)
1809 n = pool_id2str(pool, id);
1810 l = strlen(n) + strlen(lang) + 2;
1811 if (l > sizeof(buf))
1812 p = solv_malloc(strlen(n) + strlen(lang) + 2);
1815 sprintf(p, "%s:%s", n, lang);
1816 id = pool_str2id(pool, p, create);
1823 pool_alloctmpspace(Pool *pool, int len)
1825 int n = pool->tmpspace.n;
1828 if (len > pool->tmpspace.len[n])
1830 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1831 pool->tmpspace.len[n] = len + 32;
1833 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1834 return pool->tmpspace.buf[n];
1838 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1843 n = oldn = pool->tmpspace.n;
1847 n = POOL_TMPSPACEBUF - 1;
1850 if (pool->tmpspace.buf[n] != space)
1852 if (len > pool->tmpspace.len[n])
1854 pool->tmpspace.buf[n] = solv_realloc(pool->tmpspace.buf[n], len + 32);
1855 pool->tmpspace.len[n] = len + 32;
1857 return pool->tmpspace.buf[n];
1864 pool_freetmpspace(Pool *pool, const char *space)
1866 int n = pool->tmpspace.n;
1869 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1870 if (pool->tmpspace.buf[n] == space)
1871 pool->tmpspace.n = n;
1875 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1879 l1 = str1 ? strlen(str1) : 0;
1880 l2 = str2 ? strlen(str2) : 0;
1881 l3 = str3 ? strlen(str3) : 0;
1882 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1903 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1908 l1 = str1 ? strlen(str1) : 0;
1909 l2 = str2 ? strlen(str2) : 0;
1910 l3 = str3 ? strlen(str3) : 0;
1911 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1915 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1938 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1943 s = pool_alloctmpspace(pool, 2 * len + 1);
1944 solv_bin2hex(buf, len, s);
1948 /*******************************************************************/
1960 struct mptree *mptree;
1971 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1973 struct ducbdata *cbd = cbdata;
1976 if (data != cbd->olddata)
1978 Id dn, mp, comp, *dirmap, *dirs;
1980 const char *compstr;
1981 struct mptree *mptree;
1983 /* create map from dir to mptree */
1984 cbd->dirmap = solv_free(cbd->dirmap);
1986 dirmap = solv_calloc(data->dirpool.ndirs, sizeof(Id));
1987 mptree = cbd->mptree;
1989 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
2003 if (!mptree[mp].child)
2008 if (data->localpool)
2009 compstr = stringpool_id2str(&data->spool, comp);
2011 compstr = pool_id2str(data->repo->pool, comp);
2012 compl = strlen(compstr);
2013 for (i = mptree[mp].child; i; i = mptree[i].sibling)
2014 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
2016 dirmap[dn] = i ? i : -mp;
2018 /* change dirmap to point to mountpoint instead of mptree */
2019 for (dn = 0; dn < data->dirpool.ndirs; dn++)
2022 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
2024 cbd->dirmap = dirmap;
2025 cbd->nmap = data->dirpool.ndirs;
2026 cbd->olddata = data;
2029 if (value->id < 0 || value->id >= cbd->nmap)
2031 mp = cbd->dirmap[value->id];
2034 if (cbd->addsub > 0)
2036 cbd->mps[mp].kbytes += value->num;
2037 cbd->mps[mp].files += value->num2;
2039 else if (!(cbd->mps[mp].flags & DUCHANGES_ONLYADD))
2041 cbd->mps[mp].kbytes -= value->num;
2042 cbd->mps[mp].files -= value->num2;
2048 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
2051 if (mptree[pos].mountpoint == -1)
2052 mptree[pos].mountpoint = mountpoint;
2054 mountpoint = mptree[pos].mountpoint;
2055 for (i = mptree[pos].child; i; i = mptree[i].sibling)
2056 propagate_mountpoints(mptree, i, mountpoint);
2059 #define MPTREE_BLOCK 15
2061 static struct mptree *
2062 create_mptree(DUChanges *mps, int nmps)
2065 struct mptree *mptree;
2068 const char *p, *path, *compstr;
2070 mptree = solv_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
2073 mptree[0].sibling = 0;
2074 mptree[0].child = 0;
2076 mptree[0].compl = 0;
2077 mptree[0].mountpoint = -1;
2080 /* create component tree */
2081 for (mp = 0; mp < nmps; mp++)
2086 path = mps[mp].path;
2091 if ((p = strchr(path, '/')) == 0)
2094 compl = strlen(compstr);
2105 for (i = mptree[pos].child; i; i = mptree[i].sibling)
2106 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
2110 /* create new node */
2111 mptree = solv_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
2113 mptree[i].sibling = mptree[pos].child;
2114 mptree[i].child = 0;
2115 mptree[i].comp = compstr;
2116 mptree[i].compl = compl;
2117 mptree[i].mountpoint = -1;
2118 mptree[pos].child = i;
2122 mptree[pos].mountpoint = mp;
2125 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
2128 for (i = 0; i < nmptree; i++)
2130 printf("#%d sibling: %d\n", i, mptree[i].sibling);
2131 printf("#%d child: %d\n", i, mptree[i].child);
2132 printf("#%d comp: %s\n", i, mptree[i].comp);
2133 printf("#%d compl: %d\n", i, mptree[i].compl);
2134 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
2142 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
2144 struct mptree *mptree;
2145 struct ducbdata cbd;
2149 Repo *oldinstalled = pool->installed;
2150 int haveonlyadd = 0;
2152 map_init(&ignoredu, 0);
2153 mptree = create_mptree(mps, nmps);
2155 for (i = 0; i < nmps; i++)
2156 if ((mps[i].flags & DUCHANGES_ONLYADD) != 0)
2162 cbd.mptree = mptree;
2164 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2166 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2168 if (!MAPTST(installedmap, sp))
2171 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2172 if (!cbd.hasdu && oldinstalled)
2176 /* no du data available, ignore data of all installed solvables we obsolete */
2178 map_grow(&ignoredu, oldinstalled->end - oldinstalled->start);
2179 FOR_PROVIDES(op, opp, s->name)
2181 Solvable *s2 = pool->solvables + op;
2182 if (!pool->implicitobsoleteusesprovides && s->name != s2->name)
2184 if (pool->implicitobsoleteusescolors && !pool_colormatch(pool, s, s2))
2186 if (op >= oldinstalled->start && op < oldinstalled->end)
2188 MAPSET(&ignoredu, op - oldinstalled->start);
2189 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2191 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2193 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2201 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
2202 while ((obs = *obsp++) != 0)
2203 FOR_PROVIDES(op, opp, obs)
2205 Solvable *s2 = pool->solvables + op;
2206 if (!pool->obsoleteusesprovides && !pool_match_nevr(pool, s2, obs))
2208 if (pool->obsoleteusescolors && !pool_colormatch(pool, s, s2))
2210 if (op >= oldinstalled->start && op < oldinstalled->end)
2212 MAPSET(&ignoredu, op - oldinstalled->start);
2213 if (haveonlyadd && pool->solvables[op].repo == oldinstalled && !didonlyadd)
2215 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2217 repo_search(oldinstalled, op, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2229 /* assumes we allways have du data for installed solvables */
2230 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2232 if (MAPTST(installedmap, sp))
2234 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
2236 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
2239 map_free(&ignoredu);
2240 solv_free(cbd.dirmap);
2245 pool_calc_installsizechange(Pool *pool, Map *installedmap)
2250 Repo *oldinstalled = pool->installed;
2252 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
2254 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
2256 if (!MAPTST(installedmap, sp))
2258 change += solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2262 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
2264 if (MAPTST(installedmap, sp))
2266 change -= solvable_lookup_sizek(s, SOLVABLE_INSTALLSIZE, 0);
2274 * 2: conflicts with installed
2275 * 8: interesting (only true if installed)
2279 static inline Id dep2name(Pool *pool, Id dep)
2281 while (ISRELDEP(dep))
2283 Reldep *rd = GETRELDEP(pool, dep);
2289 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
2292 Solvable *sn = pool->solvables + n;
2294 FOR_PROVIDES(p, pp, sn->name)
2296 Solvable *s = pool->solvables + p;
2297 if (s->name != sn->name || s->arch != sn->arch)
2299 if ((map[p] & 9) != 9)
2301 if (pool_match_nevr(pool, pool->solvables + p, con))
2303 return 1; /* found installed package that doesn't conflict */
2308 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *multiversionmap)
2312 FOR_PROVIDES(p, pp, dep)
2314 if (p == SYSTEMSOLVABLE)
2315 return 1; /* always boring, as never constraining */
2316 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
2318 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
2319 if (providedbyinstalled_multiversion(pool, map, p, dep))
2321 if ((map[p] & 9) == 9)
2329 * pool_trivial_installable - calculate if a set of solvables is
2330 * trivial installable without any other installs/deinstalls of
2331 * packages not belonging to the set.
2333 * the state is returned in the result queue:
2334 * 1: solvable is installable without any other package changes
2335 * 0: solvable is not installable
2336 * -1: solvable is installable, but doesn't constrain any installed packages
2340 pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
2343 Id p, *dp, con, *conp, req, *reqp;
2347 map = solv_calloc(pool->nsolvables, 1);
2348 for (p = 1; p < pool->nsolvables; p++)
2350 if (!MAPTST(installedmap, p))
2353 s = pool->solvables + p;
2356 conp = s->repo->idarraydata + s->conflicts;
2357 while ((con = *conp++) != 0)
2359 dp = pool_whatprovides_ptr(pool, con);
2361 map[p] |= 2; /* XXX: self conflict ? */
2364 for (i = 0; i < pkgs->count; i++)
2365 map[pkgs->elements[i]] = 16;
2367 for (i = 0, did = 0; did < pkgs->count; i++, did++)
2369 if (i == pkgs->count)
2371 p = pkgs->elements[i];
2372 if ((map[p] & 16) == 0)
2374 if ((map[p] & 2) != 0)
2379 s = pool->solvables + p;
2383 reqp = s->repo->idarraydata + s->requires;
2384 while ((req = *reqp++) != 0)
2386 if (req == SOLVABLE_PREREQMARKER)
2388 r = providedbyinstalled(pool, map, req, 0, 0);
2391 /* decided and miss */
2397 break; /* undecided */
2398 m |= r; /* 1 | 9 | 17 */
2407 int ispatch = 0; /* see solver.c patch handling */
2409 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
2411 conp = s->repo->idarraydata + s->conflicts;
2412 while ((con = *conp++) != 0)
2414 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2420 if ((m == 1 || m == 17) && ISRELDEP(con))
2422 con = dep2name(pool, con);
2423 if ((providedbyinstalled(pool, map, con, ispatch, multiversionmap) & 1) != 0)
2428 continue; /* found a conflict */
2431 if (s->repo && s->repo != oldinstalled)
2433 Id p2, obs, *obsp, *pp;
2437 obsp = s->repo->idarraydata + s->obsoletes;
2438 while ((obs = *obsp++) != 0)
2440 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
2449 FOR_PROVIDES(p2, pp, s->name)
2451 s2 = pool->solvables + p2;
2452 if (s2->name == s->name && (map[p2] & 1) != 0)
2469 queue_init_clone(res, pkgs);
2470 for (i = 0; i < pkgs->count; i++)
2472 m = map[pkgs->elements[i]];
2479 res->elements[i] = r;
2485 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
2487 pool_trivial_installable_multiversionmap(pool, installedmap, pkgs, res, 0);
2491 pool_lookup_str(Pool *pool, Id entry, Id keyname)
2493 if (entry == SOLVID_POS && pool->pos.repo)
2494 return repo_lookup_str(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2497 return solvable_lookup_str(pool->solvables + entry, keyname);
2501 pool_lookup_id(Pool *pool, Id entry, Id keyname)
2503 if (entry == SOLVID_POS && pool->pos.repo)
2504 return repo_lookup_id(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2507 return solvable_lookup_id(pool->solvables + entry, keyname);
2511 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned long long notfound)
2513 if (entry == SOLVID_POS && pool->pos.repo)
2514 return repo_lookup_num(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, notfound);
2517 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
2521 pool_lookup_void(Pool *pool, Id entry, Id keyname)
2523 if (entry == SOLVID_POS && pool->pos.repo)
2524 return repo_lookup_void(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname);
2527 return solvable_lookup_void(pool->solvables + entry, keyname);
2530 const unsigned char *
2531 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2533 if (entry == SOLVID_POS && pool->pos.repo)
2534 return repo_lookup_bin_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2537 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
2541 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
2543 if (entry == SOLVID_POS && pool->pos.repo)
2544 return repo_lookup_checksum(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, typep);
2547 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
2551 pool_lookup_idarray(Pool *pool, Id entry, Id keyname, Queue *q)
2553 if (entry == SOLVID_POS && pool->pos.repo)
2554 return repo_lookup_idarray(pool->pos.repo, pool->pos.repodataid ? entry : pool->pos.solvid, keyname, q);
2557 return solvable_lookup_idarray(pool->solvables + entry, keyname, q);
2561 pool_lookup_deltalocation(Pool *pool, Id entry, unsigned int *medianrp)
2566 if (entry != SOLVID_POS)
2568 loc = pool_lookup_str(pool, entry, DELTA_LOCATION_DIR);
2569 loc = pool_tmpjoin(pool, loc, loc ? "/" : 0, pool_lookup_str(pool, entry, DELTA_LOCATION_NAME));
2570 loc = pool_tmpappend(pool, loc, "-", pool_lookup_str(pool, entry, DELTA_LOCATION_EVR));
2571 loc = pool_tmpappend(pool, loc, ".", pool_lookup_str(pool, entry, DELTA_LOCATION_SUFFIX));
2576 add_new_provider(Pool *pool, Id id, Id p)
2581 while (ISRELDEP(id))
2583 Reldep *rd = GETRELDEP(pool, id);
2588 for (pp = pool->whatprovidesdata + pool->whatprovides[id]; *pp; pp++)
2600 queue_push(&q, *pp);
2604 pool->whatprovides[id] = pool_queuetowhatprovides(pool, &q);
2605 if (id < pool->whatprovidesauxoff)
2606 pool->whatprovidesaux[id] = 0; /* sorry */
2611 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
2613 int hadhashes = pool->relhashtbl ? 1 : 0;
2619 if (!conflicts->count)
2621 for (i = 0; i < conflicts->count; i += 6)
2623 fn = conflicts->elements[i];
2624 p = conflicts->elements[i + 1];
2625 md5 = conflicts->elements[i + 2];
2626 q = conflicts->elements[i + 4];
2627 id = pool_rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
2628 s = pool->solvables + p;
2631 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
2632 if (pool->whatprovides)
2633 add_new_provider(pool, fn, p);
2634 if (pool->whatprovides_rel)
2635 pool->whatprovides_rel[GETRELID(id)] = 0; /* clear cache */
2636 s = pool->solvables + q;
2639 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2642 pool_freeidhashes(pool);
2646 pool_prepend_rootdir(Pool *pool, const char *path)
2651 return solv_strdup(path);
2652 return solv_dupjoin(pool->rootdir, "/", *path == '/' ? path + 1 : path);
2656 pool_prepend_rootdir_tmp(Pool *pool, const char *path)
2662 return pool_tmpjoin(pool, pool->rootdir, "/", *path == '/' ? path + 1 : path);
2666 pool_set_rootdir(Pool *pool, const char *rootdir)
2668 solv_free(pool->rootdir);
2669 pool->rootdir = solv_strdup(rootdir);
2673 pool_get_rootdir(Pool *pool)
2675 return pool->rootdir;
2678 /* only used in libzypp */
2680 pool_set_custom_vendorcheck(Pool *pool, int (*vendorcheck)(Pool *, Solvable *, Solvable *))
2682 pool->custom_vendorcheck = vendorcheck;