2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * The pool contains information about solvables
12 * stored optimized for memory consumption and fast retrieval.
24 #include "poolid_private.h"
30 #define SOLVABLE_BLOCK 255
32 #define KNOWNID_INITIALIZE
34 #undef KNOWNID_INITIALIZE
43 pool = (Pool *)sat_calloc(1, sizeof(*pool));
45 stringpool_init (&pool->ss, initpool_data);
47 /* alloc space for RelDep 0 */
48 pool->rels = sat_extend_resize(0, 1, sizeof(Reldep), REL_BLOCK);
50 memset(pool->rels, 0, sizeof(Reldep));
52 /* alloc space for Solvable 0 and system solvable */
53 pool->solvables = sat_extend_resize(0, 2, sizeof(Solvable), SOLVABLE_BLOCK);
55 memset(pool->solvables, 0, 2 * sizeof(Solvable));
56 s = pool->solvables + SYSTEMSOLVABLE;
57 s->name = SYSTEM_SYSTEM;
58 s->arch = ARCH_NOARCH;
61 queue_init(&pool->vendormap);
63 pool->debugmask = SAT_DEBUG_RESULT; /* FIXME */
68 /* free all the resources of our pool */
74 pool_freewhatprovides(pool);
75 pool_freeidhashes(pool);
76 repo_freeallrepos(pool, 1);
77 sat_free(pool->id2arch);
78 sat_free(pool->solvables);
79 stringpool_free(&pool->ss);
81 queue_free(&pool->vendormap);
82 for (i = 0; i < POOL_TMPSPACEBUF; i++)
83 sat_free(pool->tmpspacebuf[i]);
84 for (i = 0; i < pool->nlanguages; i++)
85 free((char *)pool->languages[i]);
86 sat_free(pool->languages);
87 sat_free(pool->languagecache);
92 pool_add_solvable(Pool *pool)
94 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
95 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
96 return pool->nsolvables++;
100 pool_add_solvable_block(Pool *pool, int count)
102 Id nsolvables = pool->nsolvables;
105 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
106 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
107 pool->nsolvables += count;
112 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
116 if (reuseids && start + count == pool->nsolvables)
118 /* might want to shrink solvable array */
119 pool->nsolvables = start;
122 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
127 pool_set_installed(Pool *pool, Repo *installed)
129 if (pool->installed == installed)
131 pool->installed = installed;
132 pool_freewhatprovides(pool);
135 static Pool *pool_shrink_whatprovides_sortcmp_data;
138 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
141 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
143 oa = pool->whatprovides[*(Id *)ap];
144 ob = pool->whatprovides[*(Id *)bp];
146 return *(Id *)ap - *(Id *)bp;
151 da = pool->whatprovidesdata + oa;
152 db = pool->whatprovidesdata + ob;
154 if ((r = (*da++ - *db++)) != 0)
158 return *(Id *)ap - *(Id *)bp;
162 * pool_shrink_whatprovides - unify whatprovides data
164 * whatprovides_rel must be empty for this to work!
168 pool_shrink_whatprovides(Pool *pool)
172 Id lastid, *last, *dp, *lp;
176 if (pool->ss.nstrings < 3)
178 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
179 for (id = 0; id < pool->ss.nstrings; id++)
181 pool_shrink_whatprovides_sortcmp_data = pool;
182 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
185 for (i = 1; i < pool->ss.nstrings; i++)
188 o = pool->whatprovides[id];
189 if (o == 0 || o == 1)
191 dp = pool->whatprovidesdata + o;
205 pool->whatprovides[id] = -lastid;
209 last = pool->whatprovidesdata + o;
213 dp = pool->whatprovidesdata + 2;
214 for (id = 1; id < pool->ss.nstrings; id++)
216 o = pool->whatprovides[id];
217 if (o == 0 || o == 1)
224 pool->whatprovides[id] = pool->whatprovides[i];
227 lp = pool->whatprovidesdata + o;
230 pool->whatprovides[id] = dp - pool->whatprovidesdata;
231 while ((*dp++ = *lp++) != 0)
234 o = dp - pool->whatprovidesdata;
235 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
236 if (pool->whatprovidesdataoff == o)
238 r = pool->whatprovidesdataoff - o;
239 pool->whatprovidesdataoff = o;
240 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
241 if (r > pool->whatprovidesdataleft)
242 r = pool->whatprovidesdataleft;
243 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
248 * pool_createwhatprovides()
250 * create hashes over pool of solvables to ease provide lookups
254 pool_createwhatprovides(Pool *pool)
256 int i, num, np, extra;
261 Offset *whatprovides;
262 Id *whatprovidesdata, *d;
263 Repo *installed = pool->installed;
265 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
266 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
268 pool_freeidhashes(pool); /* XXX: should not be here! */
269 pool_freewhatprovides(pool);
270 num = pool->ss.nstrings;
271 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
272 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
274 /* count providers for each name */
275 for (i = 1; i < pool->nsolvables; i++)
278 s = pool->solvables + i;
281 /* we always need the installed solvable in the whatprovides data,
282 otherwise obsoletes/conflicts on them won't work */
283 if (s->repo != installed && !pool_installable(pool, s))
285 pp = s->repo->idarraydata + s->provides;
286 while ((id = *pp++) != ID_NULL)
290 Reldep *rd = GETRELDEP(pool, id);
293 whatprovides[id]++; /* inc count of providers */
297 off = 2; /* first entry is undef, second is empty list */
299 np = 0; /* number of names provided */
300 for (i = 0; i < num; i++, idp++)
303 if (!n) /* no providers */
305 *idp = off; /* move from counts to offsets into whatprovidesdata */
306 off += n + 1; /* make space for all providers + terminating ID_NULL */
307 np++; /* inc # of provider 'slots' */
310 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
312 /* reserve some space for relation data */
313 extra = 2 * pool->nrels;
317 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
319 /* alloc space for all providers + extra */
320 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
322 /* now fill data for all provides */
323 for (i = 1; i < pool->nsolvables; i++)
326 s = pool->solvables + i;
329 if (s->repo != installed && !pool_installable(pool, s))
332 /* for all provides of this solvable */
333 pp = s->repo->idarraydata + s->provides;
334 while ((id = *pp++) != 0)
338 Reldep *rd = GETRELDEP(pool, id);
341 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
345 while (*d) /* find free slot */
347 if (d[-1] == i) /* solvable already tacked at end ? */
348 continue; /* Y: skip, on to next provides */
350 *d = i; /* put solvable Id into data */
353 pool->whatprovidesdata = whatprovidesdata;
354 pool->whatprovidesdataoff = off;
355 pool->whatprovidesdataleft = extra;
356 pool_shrink_whatprovides(pool);
360 * free all of our whatprovides data
361 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
364 pool_freewhatprovides(Pool *pool)
366 pool->whatprovides = sat_free(pool->whatprovides);
367 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
368 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
369 pool->whatprovidesdataoff = 0;
370 pool->whatprovidesdataleft = 0;
374 /******************************************************************************/
377 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
379 * on-demand filling of provider information
380 * move queue data into whatprovidesdata
382 * returns: Offset into whatprovides
386 pool_queuetowhatprovides(Pool *pool, Queue *q)
389 int count = q->count;
391 if (count == 0) /* queue empty -> 1 */
394 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
395 if (pool->whatprovidesdataleft < count + 1)
397 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
398 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
399 pool->whatprovidesdataleft = count + 4096;
402 /* copy queue to next free slot */
403 off = pool->whatprovidesdataoff;
404 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
406 /* adapt count and ID_NULL-terminate */
407 pool->whatprovidesdataoff += count;
408 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
409 pool->whatprovidesdataleft -= count + 1;
415 /*************************************************************************/
417 /* check if a package's nevr matches a dependency */
420 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
422 Reldep *rd = GETRELDEP(pool, d);
425 int flags = rd->flags;
434 return pool_match_nevr(pool, s, name);
436 if (pool_match_nevr(pool, s, name))
438 return pool_match_nevr(pool, s, evr);
441 if (!pool_match_nevr(pool, s, name))
443 return pool_match_nevr(pool, s, evr);
448 if (!pool_match_nevr(pool, s, name))
451 return flags & 2 ? 1 : 0;
456 if (flags != 2 && flags != 5)
458 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
466 * add packages fulfilling the relation to whatprovides array
467 * no exact providers, do range match
472 pool_addrelproviders(Pool *pool, Id d)
474 Reldep *rd = GETRELDEP(pool, d);
480 int flags = rd->flags;
482 Id p, wp, *pp, *pp2, *pp3;
485 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
490 pp = pool->whatprovidesdata + pool_whatprovides(pool, name);
491 pp2 = pool->whatprovidesdata + pool_whatprovides(pool, evr);
492 while ((p = *pp++) != 0)
494 for (pp3 = pp2; *pp3;)
497 queue_push(&plist, p);
503 pp = pool->whatprovidesdata + pool_whatprovides(pool, name);
504 while ((p = *pp++) != 0)
505 queue_push(&plist, p);
506 pp = pool->whatprovidesdata + pool_whatprovides(pool, evr);
507 while ((p = *pp++) != 0)
508 queue_pushunique(&plist, p);
511 if (name == NAMESPACE_OTHERPROVIDERS)
513 wp = pool_whatprovides(pool, evr);
514 pool->whatprovides_rel[d] = wp;
517 if (pool->nscallback)
519 /* ask callback which packages provide the dependency
521 * 1: the system (aka SYSTEMSOLVABLE)
522 * >1: a set of packages, stored as offset on whatprovidesdata
524 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
528 pool->whatprovides_rel[d] = p;
532 queue_push(&plist, SYSTEMSOLVABLE);
536 /* small hack: make it possible to match <pkg>.src
537 * we have to iterate over the solvables as src packages do not
538 * provide anything, thus they are not indexed in our
539 * whatprovides hash */
543 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
545 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
547 if (pool_match_nevr(pool, s, name))
548 queue_push(&plist, p);
552 wp = pool_whatprovides(pool, name);
553 pp = pool->whatprovidesdata + wp;
554 while ((p = *pp++) != 0)
556 Solvable *s = pool->solvables + p;
558 queue_push(&plist, p);
564 pool->whatprovides_rel[d] = wp;
572 /* convert to whatprovides id */
574 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
576 if (flags && flags < 8)
578 pp = pool->whatprovidesdata + pool_whatprovides(pool, name);
579 while (ISRELDEP(name))
581 rd = GETRELDEP(pool, name);
584 while ((p = *pp++) != 0)
586 Solvable *s = pool->solvables + p;
588 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, s->name));
592 /* no provides - check nevr */
593 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
594 queue_push(&plist, p);
597 /* solvable p provides name in some rels */
598 pidp = s->repo->idarraydata + s->provides;
599 while ((pid = *pidp++) != 0)
606 #ifdef DEBIAN_SEMANTICS
607 continue; /* unversioned provides can
608 * never match versioned deps */
610 break; /* yes, provides all versions */
614 continue; /* wrong provides name */
615 prd = GETRELDEP(pool, pid);
616 if (prd->name != name)
617 continue; /* wrong provides name */
618 /* right package, both deps are rels */
622 if (flags == 7 || pflags == 7)
623 break; /* included */
624 if ((pflags & flags & 5) != 0)
625 break; /* same direction, match */
629 if ((pflags & flags & 2) != 0)
630 break; /* both have =, match */
634 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
635 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
640 continue; /* no rel match */
641 queue_push(&plist, p);
643 /* make our system solvable provide all unknown rpmlib() stuff */
644 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
645 queue_push(&plist, SYSTEMSOLVABLE);
647 /* add providers to whatprovides */
649 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
651 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
654 return pool->whatprovides_rel[d];
657 /*************************************************************************/
660 pool_debug(Pool *pool, int type, const char *format, ...)
665 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
667 if ((pool->debugmask & type) == 0)
670 va_start(args, format);
671 if (!pool->debugcallback)
673 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
674 vprintf(format, args);
676 vfprintf(stderr, format, args);
679 vsnprintf(buf, sizeof(buf), format, args);
680 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
684 pool_setdebuglevel(Pool *pool, int level)
686 int mask = SAT_DEBUG_RESULT;
688 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
690 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
692 mask |= SAT_DEBUG_PROPAGATE;
694 mask |= SAT_DEBUG_RULE_CREATION;
696 mask |= SAT_DEBUG_SCHUBI;
697 pool->debugmask = mask;
700 /*************************************************************************/
710 #define SEARCHFILES_BLOCK 127
713 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
717 struct searchfiles *csf;
719 while ((dep = *ida++) != 0)
722 while (ISRELDEP(dep))
725 sid = pool->ss.nstrings + GETRELID(dep);
726 if (MAPTST(&csf->seen, sid))
731 MAPSET(&csf->seen, sid);
732 rd = GETRELDEP(pool, dep);
735 else if (rd->flags == REL_NAMESPACE)
737 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
740 if (!csf || MAPTST(&csf->seen, sid))
745 MAPSET(&csf->seen, sid);
754 pool_addfileprovides_dep(pool, ids, csf, isf);
760 if (MAPTST(&csf->seen, dep))
762 MAPSET(&csf->seen, dep);
763 s = id2str(pool, dep);
766 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
767 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
768 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
769 csf->ids[csf->nfiles] = dep;
770 sr = strrchr(s, '/');
771 csf->names[csf->nfiles] = strdup(sr + 1);
772 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
774 strncpy(csf->dirs[csf->nfiles], s, sr - s);
775 csf->dirs[csf->nfiles][sr - s] = 0;
780 struct addfileprovides_cbdata {
792 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
794 struct addfileprovides_cbdata *cbd = cbdata;
797 if (data != cbd->olddata)
799 map_free(&cbd->useddirs);
800 map_init(&cbd->useddirs, data->dirpool.ndirs);
801 for (i = 0; i < cbd->nfiles; i++)
803 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
806 MAPSET(&cbd->useddirs, did);
810 if (!MAPTST(&cbd->useddirs, value->id))
812 for (i = 0; i < cbd->nfiles; i++)
814 if (cbd->dids[i] != value->id)
816 if (!strcmp(cbd->names[i], value->str))
819 if (i == cbd->nfiles)
821 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
826 addfileprovides_setid_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
828 Map *provideids = cbdata;
829 if (key->type != REPOKEY_TYPE_IDARRAY)
831 MAPSET(provideids, kv->id);
832 return kv->eof ? SEARCH_NEXT_SOLVABLE : 0;
837 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
841 Repodata *data = 0, *nextdata;
843 int dataincludes = 0;
847 cbd->nfiles = sf->nfiles;
849 cbd->dirs = sf->dirs;
850 cbd->names = sf->names;
852 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
855 start = repoonly->start;
860 start = 2; /* skip system solvable */
861 end = pool->nsolvables;
863 for (p = start, s = pool->solvables + p; p < end; p++, s++)
865 if (!s->repo || (repoonly && s->repo != repoonly))
867 /* check if p is in (oldrepo,data) */
868 if (s->repo != oldrepo || (data && p >= data->end))
875 /* nope, find new repo/repodata */
876 /* if we don't find a match, set data to the next repodata */
878 for (i = 0, data = s->repo->repodata; i < s->repo->nrepodata; i++, data++)
882 if (data->state != REPODATA_AVAILABLE)
884 for (j = 1; j < data->nkeys; j++)
885 if (data->keys[j].name == REPOSITORY_ADDEDFILEPROVIDES && data->keys[j].type == REPOKEY_TYPE_IDARRAY)
887 if (j == data->nkeys)
889 /* great, this repodata contains addedfileprovides */
890 if (!nextdata || nextdata->start > data->start)
892 if (p >= data->start)
895 if (i == s->repo->nrepodata)
896 data = nextdata; /* no direct hit, use next repodata */
899 map_init(&providedids, pool->ss.nstrings);
900 repodata_search(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, 0, addfileprovides_setid_cb, &providedids);
901 for (i = 0; i < cbd->nfiles; i++)
902 if (!MAPTST(&providedids, cbd->ids[i]))
904 map_free(&providedids);
905 dataincludes = i == cbd->nfiles;
909 if (data && p >= data->start && dataincludes)
911 repo_search(s->repo, p, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, cbd);
916 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
920 struct searchfiles sf, isf, *isfp;
921 struct addfileprovides_cbdata cbd;
924 memset(&sf, 0, sizeof(sf));
925 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
926 memset(&isf, 0, sizeof(isf));
927 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
929 isfp = installed ? &isf : 0;
930 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
936 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
938 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
940 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
942 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
944 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
946 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
948 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
952 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
953 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
955 map_init(&cbd.useddirs, 1);
961 for (i = 0; i < sf.nfiles; i++)
962 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
964 pool_addfileprovides_search(pool, &cbd, &sf, 0);
967 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
968 sf.ids[sf.nfiles] = 0;
973 for (i = 0; i < sf.nfiles; i++)
975 sat_free(sf.dirs[i]);
976 sat_free(sf.names[i]);
984 for (i = 0; i < isf.nfiles; i++)
985 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
988 pool_addfileprovides_search(pool, &cbd, &isf, installed);
990 for (i = 0; i < isf.nfiles; i++)
992 sat_free(isf.dirs[i]);
993 sat_free(isf.names[i]);
998 map_free(&cbd.useddirs);
1000 pool_freewhatprovides(pool); /* as we have added provides */
1004 pool_addfileprovides(Pool *pool)
1006 pool_addfileprovides_ids(pool, pool->installed, 0);
1010 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)
1014 if (pool->solvables[p].repo)
1015 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1018 /* FIXME: obey callback return value! */
1019 for (p = 1; p < pool->nsolvables; p++)
1020 if (pool->solvables[p].repo)
1021 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1025 pool_clear_pos(Pool *pool)
1027 memset(&pool->pos, 0, sizeof(pool->pos));
1032 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1036 pool->languagecache = sat_free(pool->languagecache);
1037 pool->languagecacheother = 0;
1038 if (pool->nlanguages)
1040 for (i = 0; i < pool->nlanguages; i++)
1041 free((char *)pool->languages[i]);
1042 free(pool->languages);
1044 pool->nlanguages = nlanguages;
1047 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1048 for (i = 0; i < pool->nlanguages; i++)
1049 pool->languages[i] = strdup(languages[i]);
1053 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1061 n = id2str(pool, id);
1062 l = strlen(n) + strlen(lang) + 2;
1063 if (l > sizeof(buf))
1064 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1067 sprintf(p, "%s:%s", n, lang);
1068 id = str2id(pool, p, create);
1075 pool_alloctmpspace(Pool *pool, int len)
1077 int n = pool->tmpspacen;
1080 if (len > pool->tmpspacelen[n])
1082 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1083 pool->tmpspacelen[n] = len + 32;
1085 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1086 return pool->tmpspacebuf[n];
1089 /*******************************************************************/
1101 struct mptree *mptree;
1112 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1114 struct ducbdata *cbd = cbdata;
1117 if (data != cbd->olddata)
1119 Id dn, mp, comp, *dirmap, *dirs;
1121 const char *compstr;
1122 struct mptree *mptree;
1124 /* create map from dir to mptree */
1125 cbd->dirmap = sat_free(cbd->dirmap);
1127 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1128 mptree = cbd->mptree;
1130 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1144 if (!mptree[mp].child)
1149 if (data->localpool)
1150 compstr = stringpool_id2str(&data->spool, comp);
1152 compstr = id2str(data->repo->pool, comp);
1153 compl = strlen(compstr);
1154 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1155 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1157 dirmap[dn] = i ? i : -mp;
1159 /* change dirmap to point to mountpoint instead of mptree */
1160 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1163 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1165 cbd->dirmap = dirmap;
1166 cbd->nmap = data->dirpool.ndirs;
1167 cbd->olddata = data;
1170 if (value->id < 0 || value->id >= cbd->nmap)
1172 mp = cbd->dirmap[value->id];
1175 if (cbd->addsub > 0)
1177 cbd->mps[mp].kbytes += value->num;
1178 cbd->mps[mp].files += value->num2;
1182 cbd->mps[mp].kbytes -= value->num;
1183 cbd->mps[mp].files -= value->num2;
1189 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1192 if (mptree[pos].mountpoint == -1)
1193 mptree[pos].mountpoint = mountpoint;
1195 mountpoint = mptree[pos].mountpoint;
1196 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1197 propagate_mountpoints(mptree, i, mountpoint);
1200 #define MPTREE_BLOCK 15
1203 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1206 const char *path, *compstr;
1207 struct mptree *mptree;
1211 struct ducbdata cbd;
1215 Repo *oldinstalled = pool->installed;
1217 memset(&ignoredu, 0, sizeof(ignoredu));
1224 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1227 mptree[0].sibling = 0;
1228 mptree[0].child = 0;
1230 mptree[0].compl = 0;
1231 mptree[0].mountpoint = -1;
1234 /* create component tree */
1235 for (mp = 0; mp < nmps; mp++)
1240 path = mps[mp].path;
1245 if ((p = strchr(path, '/')) == 0)
1248 compl = strlen(compstr);
1259 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1260 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1264 /* create new node */
1265 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1267 mptree[i].sibling = mptree[pos].child;
1268 mptree[i].child = 0;
1269 mptree[i].comp = compstr;
1270 mptree[i].compl = compl;
1271 mptree[i].mountpoint = -1;
1272 mptree[pos].child = i;
1276 mptree[pos].mountpoint = mp;
1279 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1282 for (i = 0; i < nmptree; i++)
1284 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1285 printf("#%d child: %d\n", i, mptree[i].child);
1286 printf("#%d comp: %s\n", i, mptree[i].comp);
1287 printf("#%d compl: %d\n", i, mptree[i].compl);
1288 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1292 cbd.mptree = mptree;
1294 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1296 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1298 if (!MAPTST(installedmap, sp))
1301 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1302 if (!cbd.hasdu && oldinstalled)
1305 /* no du data available, ignore data of all installed solvables we obsolete */
1307 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1310 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1311 while ((obs = *obsp++) != 0)
1312 FOR_PROVIDES(op, opp, obs)
1313 if (op >= oldinstalled->start && op < oldinstalled->end)
1314 MAPSET(&ignoredu, op - oldinstalled->start);
1316 FOR_PROVIDES(op, opp, s->name)
1317 if (pool->solvables[op].name == s->name)
1318 if (op >= oldinstalled->start && op < oldinstalled->end)
1319 MAPSET(&ignoredu, op - oldinstalled->start);
1325 /* assumes we allways have du data for installed solvables */
1326 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1328 if (MAPTST(installedmap, sp))
1330 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1332 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1336 map_free(&ignoredu);
1337 sat_free(cbd.dirmap);
1342 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1347 Repo *oldinstalled = pool->installed;
1349 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1351 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1353 if (!MAPTST(installedmap, sp))
1355 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1359 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1361 if (MAPTST(installedmap, sp))
1363 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1371 * 2: conflicts with installed
1372 * 8: interesting (only true if installed)
1376 static inline Id dep2name(Pool *pool, Id dep)
1378 while (ISRELDEP(dep))
1380 Reldep *rd = rd = GETRELDEP(pool, dep);
1386 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep)
1390 FOR_PROVIDES(p, pp, dep)
1392 if (p == SYSTEMSOLVABLE)
1393 return 1; /* always boring, as never constraining */
1394 if ((map[p] & 9) == 9)
1402 * pool_trivial_installable - calculate if a set of solvables is
1403 * trivial installable without any other installs/deinstalls of
1404 * packages not belonging to the set.
1406 * the state is returned in the result queue:
1407 * 1: solvable is installable without any other package changes
1408 * 0: solvable is not installable
1409 * -1: solvable is installable, but doesn't constrain any installed packages
1413 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1416 Id p, *dp, con, *conp, req, *reqp;
1420 map = sat_calloc(pool->nsolvables, 1);
1421 for (p = 1; p < pool->nsolvables; p++)
1423 if (!MAPTST(installedmap, p))
1426 s = pool->solvables + p;
1429 conp = s->repo->idarraydata + s->conflicts;
1430 while ((con = *conp++) != 0)
1432 dp = pool->whatprovidesdata + pool_whatprovides(pool, con);
1434 map[p] |= 2; /* XXX: self conflict ? */
1437 for (i = 0; i < pkgs->count; i++)
1438 map[pkgs->elements[i]] = 16;
1440 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1442 if (i == pkgs->count)
1444 p = pkgs->elements[i];
1445 if ((map[p] & 16) == 0)
1447 if ((map[p] & 2) != 0)
1452 s = pool->solvables + p;
1456 reqp = s->repo->idarraydata + s->requires;
1457 while ((req = *reqp++) != 0)
1459 if (req == SOLVABLE_PREREQMARKER)
1461 r = providedbyinstalled(pool, map, req);
1464 /* decided and miss */
1468 m |= r; /* 1 | 9 | 16 | 17 */
1477 conp = s->repo->idarraydata + s->conflicts;
1478 while ((con = *conp++) != 0)
1480 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1485 if ((m == 1 || m == 17) && ISRELDEP(con))
1487 con = dep2name(pool, con);
1488 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1493 continue; /* found a conflict */
1496 if (s->repo && s->repo != oldinstalled)
1498 Id p2, obs, *obsp, *pp;
1502 obsp = s->repo->idarraydata + s->obsoletes;
1503 while ((obs = *obsp++) != 0)
1505 if ((providedbyinstalled(pool, map, obs) & 1) != 0)
1514 FOR_PROVIDES(p2, pp, s->name)
1516 s2 = pool->solvables + p2;
1517 if (s2->name == s->name && (map[p2] & 1) != 0)
1534 queue_clone(res, pkgs);
1535 for (i = 0; i < pkgs->count; i++)
1537 m = map[pkgs->elements[i]];
1544 res->elements[i] = r;