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);
126 static Pool *pool_shrink_whatprovides_sortcmp_data;
129 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp)
132 Pool *pool = pool_shrink_whatprovides_sortcmp_data;
134 oa = pool->whatprovides[*(Id *)ap];
135 ob = pool->whatprovides[*(Id *)bp];
137 return *(Id *)ap - *(Id *)bp;
142 da = pool->whatprovidesdata + oa;
143 db = pool->whatprovidesdata + ob;
145 if ((r = (*da++ - *db++)) != 0)
149 return *(Id *)ap - *(Id *)bp;
153 * pool_shrink_whatprovides - unify whatprovides data
155 * whatprovides_rel must be empty for this to work!
159 pool_shrink_whatprovides(Pool *pool)
163 Id lastid, *last, *dp, *lp;
167 if (pool->ss.nstrings < 3)
169 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
170 for (id = 0; id < pool->ss.nstrings; id++)
172 pool_shrink_whatprovides_sortcmp_data = pool;
173 qsort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp);
176 for (i = 1; i < pool->ss.nstrings; i++)
179 o = pool->whatprovides[id];
180 if (o == 0 || o == 1)
182 dp = pool->whatprovidesdata + o;
196 pool->whatprovides[id] = -lastid;
200 last = pool->whatprovidesdata + o;
204 dp = pool->whatprovidesdata + 2;
205 for (id = 1; id < pool->ss.nstrings; id++)
207 o = pool->whatprovides[id];
208 if (o == 0 || o == 1)
215 pool->whatprovides[id] = pool->whatprovides[i];
218 lp = pool->whatprovidesdata + o;
221 pool->whatprovides[id] = dp - pool->whatprovidesdata;
222 while ((*dp++ = *lp++) != 0)
225 o = dp - pool->whatprovidesdata;
226 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
227 if (pool->whatprovidesdataoff == o)
229 r = pool->whatprovidesdataoff - o;
230 pool->whatprovidesdataoff = o;
231 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
232 if (r > pool->whatprovidesdataleft)
233 r = pool->whatprovidesdataleft;
234 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
239 * pool_createwhatprovides()
241 * create hashes over pool of solvables to ease provide lookups
245 pool_createwhatprovides(Pool *pool)
247 int i, num, np, extra;
252 Offset *whatprovides;
253 Id *whatprovidesdata, *d;
255 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
256 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
258 pool_freeidhashes(pool); /* XXX: should not be here! */
259 pool_freewhatprovides(pool);
260 num = pool->ss.nstrings;
261 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
262 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
264 /* count providers for each name */
265 for (i = 1; i < pool->nsolvables; i++)
268 s = pool->solvables + i;
271 if (!pool_installable(pool, s))
273 pp = s->repo->idarraydata + s->provides;
274 while ((id = *pp++) != ID_NULL)
278 Reldep *rd = GETRELDEP(pool, id);
281 whatprovides[id]++; /* inc count of providers */
285 off = 2; /* first entry is undef, second is empty list */
287 np = 0; /* number of names provided */
288 for (i = 0; i < num; i++, idp++)
291 if (!n) /* no providers */
293 *idp = off; /* move from counts to offsets into whatprovidesdata */
294 off += n + 1; /* make space for all providers + terminating ID_NULL */
295 np++; /* inc # of provider 'slots' */
298 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
300 /* reserve some space for relation data */
301 extra = 2 * pool->nrels;
305 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
307 /* alloc space for all providers + extra */
308 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
310 /* now fill data for all provides */
311 for (i = 1; i < pool->nsolvables; i++)
314 s = pool->solvables + i;
317 if (!pool_installable(pool, s))
320 /* for all provides of this solvable */
321 pp = s->repo->idarraydata + s->provides;
322 while ((id = *pp++) != 0)
326 Reldep *rd = GETRELDEP(pool, id);
329 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
333 while (*d) /* find free slot */
335 if (d[-1] == i) /* solvable already tacked at end ? */
336 continue; /* Y: skip, on to next provides */
338 *d = i; /* put solvable Id into data */
341 pool->whatprovidesdata = whatprovidesdata;
342 pool->whatprovidesdataoff = off;
343 pool->whatprovidesdataleft = extra;
344 pool_shrink_whatprovides(pool);
348 * free all of our whatprovides data
349 * be careful, everything internalized with pool_queuetowhatprovides is gone, too
352 pool_freewhatprovides(Pool *pool)
354 pool->whatprovides = sat_free(pool->whatprovides);
355 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
356 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
357 pool->whatprovidesdataoff = 0;
358 pool->whatprovidesdataleft = 0;
362 /******************************************************************************/
365 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
367 * on-demand filling of provider information
368 * move queue data into whatprovidesdata
370 * returns: Offset into whatprovides
374 pool_queuetowhatprovides(Pool *pool, Queue *q)
377 int count = q->count;
379 if (count == 0) /* queue empty -> 1 */
382 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
383 if (pool->whatprovidesdataleft < count + 1)
385 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
386 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
387 pool->whatprovidesdataleft = count + 4096;
390 /* copy queue to next free slot */
391 off = pool->whatprovidesdataoff;
392 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
394 /* adapt count and ID_NULL-terminate */
395 pool->whatprovidesdataoff += count;
396 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
397 pool->whatprovidesdataleft -= count + 1;
403 /*************************************************************************/
405 /* check if a package's nevr matches a dependency */
408 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
410 Reldep *rd = GETRELDEP(pool, d);
413 int flags = rd->flags;
422 return pool_match_nevr(pool, s, name);
424 if (pool_match_nevr(pool, s, name))
426 return pool_match_nevr(pool, s, evr);
429 if (!pool_match_nevr(pool, s, name))
431 return pool_match_nevr(pool, s, evr);
436 if (!pool_match_nevr(pool, s, name))
439 return flags & 2 ? 1 : 0;
444 if (flags != 2 && flags != 5)
446 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
454 * add packages fulfilling the relation to whatprovides array
455 * no exact providers, do range match
460 pool_addrelproviders(Pool *pool, Id d)
462 Reldep *rd = GETRELDEP(pool, d);
468 int flags = rd->flags;
470 Id p, *pp, *pp2, *pp3;
473 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
478 pp = pool_whatprovides(pool, name);
479 pp2 = pool_whatprovides(pool, evr);
480 while ((p = *pp++) != 0)
482 for (pp3 = pp2; *pp3;)
485 queue_push(&plist, p);
491 pp = pool_whatprovides(pool, name);
492 while ((p = *pp++) != 0)
493 queue_push(&plist, p);
494 pp = pool_whatprovides(pool, evr);
495 while ((p = *pp++) != 0)
496 queue_pushunique(&plist, p);
499 if (name == NAMESPACE_OTHERPROVIDERS)
501 pp = pool_whatprovides(pool, evr);
502 pool->whatprovides_rel[d] = pp - pool->whatprovidesdata;
505 if (pool->nscallback)
507 /* ask callback which packages provide the dependency
509 * 1: the system (aka SYSTEMSOLVABLE)
510 * >1: a set of packages, stored as offset on whatprovidesdata
512 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
516 pool->whatprovides_rel[d] = p;
517 return pool->whatprovidesdata + p;
520 queue_push(&plist, SYSTEMSOLVABLE);
524 /* small hack: make it possible to match <pkg>.src
525 * we have to iterate over the solvables as src packages do not
526 * provide anything, thus they are not indexed in our
527 * whatprovides hash */
531 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
533 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
535 if (pool_match_nevr(pool, s, name))
536 queue_push(&plist, p);
540 pp = pp2 = pool_whatprovides(pool, name);
541 while ((p = *pp++) != 0)
543 Solvable *s = pool->solvables + p;
545 queue_push(&plist, p);
556 /* convert to whatprovides id */
558 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
560 if (flags && flags < 8)
562 pp = pool_whatprovides(pool, name);
563 while (ISRELDEP(name))
565 rd = GETRELDEP(pool, name);
568 while ((p = *pp++) != 0)
570 Solvable *s = pool->solvables + p;
572 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, s->name));
576 /* no provides - check nevr */
577 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
578 queue_push(&plist, p);
581 /* solvable p provides name in some rels */
582 pidp = s->repo->idarraydata + s->provides;
583 while ((pid = *pidp++) != 0)
590 #ifdef DEBIAN_SEMANTICS
591 continue; /* unversioned provides can
592 * never match versioned deps */
594 break; /* yes, provides all versions */
598 continue; /* wrong provides name */
599 prd = GETRELDEP(pool, pid);
600 if (prd->name != name)
601 continue; /* wrong provides name */
602 /* right package, both deps are rels */
606 if (flags == 7 || pflags == 7)
607 break; /* included */
608 if ((pflags & flags & 5) != 0)
609 break; /* same direction, match */
613 if ((pflags & flags & 2) != 0)
614 break; /* both have =, match */
618 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
619 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
624 continue; /* no rel match */
625 queue_push(&plist, p);
627 /* make our system solvable provide all unknown rpmlib() stuff */
628 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
629 queue_push(&plist, SYSTEMSOLVABLE);
631 /* add providers to whatprovides */
633 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
635 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
638 return pool->whatprovidesdata + pool->whatprovides_rel[d];
641 /*************************************************************************/
644 pool_debug(Pool *pool, int type, const char *format, ...)
649 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
651 if ((pool->debugmask & type) == 0)
654 va_start(args, format);
655 if (!pool->debugcallback)
657 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
658 vprintf(format, args);
660 vfprintf(stderr, format, args);
663 vsnprintf(buf, sizeof(buf), format, args);
664 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
668 pool_setdebuglevel(Pool *pool, int level)
670 int mask = SAT_DEBUG_RESULT;
672 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
674 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
676 mask |= SAT_DEBUG_PROPAGATE;
678 mask |= SAT_DEBUG_RULE_CREATION;
680 mask |= SAT_DEBUG_SCHUBI;
681 pool->debugmask = mask;
684 /*************************************************************************/
694 #define SEARCHFILES_BLOCK 127
697 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
701 struct searchfiles *csf;
703 while ((dep = *ida++) != 0)
706 while (ISRELDEP(dep))
709 sid = pool->ss.nstrings + GETRELID(dep);
710 if (MAPTST(&csf->seen, sid))
715 MAPSET(&csf->seen, sid);
716 rd = GETRELDEP(pool, dep);
719 else if (rd->flags == REL_NAMESPACE)
721 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
724 if (!csf || MAPTST(&csf->seen, sid))
729 MAPSET(&csf->seen, sid);
738 pool_addfileprovides_dep(pool, ids, csf, isf);
744 if (MAPTST(&csf->seen, dep))
746 MAPSET(&csf->seen, dep);
747 s = id2str(pool, dep);
750 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
751 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
752 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
753 csf->ids[csf->nfiles] = dep;
754 sr = strrchr(s, '/');
755 csf->names[csf->nfiles] = strdup(sr + 1);
756 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
758 strncpy(csf->dirs[csf->nfiles], s, sr - s);
759 csf->dirs[csf->nfiles][sr - s] = 0;
764 struct addfileprovides_cbdata {
776 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
778 struct addfileprovides_cbdata *cbd = cbdata;
781 if (data != cbd->olddata)
783 map_free(&cbd->useddirs);
784 map_init(&cbd->useddirs, data->dirpool.ndirs);
785 for (i = 0; i < cbd->nfiles; i++)
787 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
790 MAPSET(&cbd->useddirs, did);
794 if (!MAPTST(&cbd->useddirs, value->id))
796 for (i = 0; i < cbd->nfiles; i++)
798 if (cbd->dids[i] != value->id)
800 if (!strcmp(cbd->names[i], value->str))
803 if (i == cbd->nfiles)
805 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
811 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
813 Id p, start, end, *idp;
815 Repodata *data = 0, *nextdata;
817 int dataincludes = 0;
821 cbd->nfiles = sf->nfiles;
823 cbd->dirs = sf->dirs;
824 cbd->names = sf->names;
826 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
829 start = repoonly->start;
834 start = 2; /* skip system solvable */
835 end = pool->nsolvables;
837 for (p = start, s = pool->solvables + p; p < end; p++, s++)
839 if (!s->repo || (repoonly && s->repo != repoonly))
841 if (s->repo != oldrepo || (data && p >= data->end))
849 for (i = 0, data = s->repo->repodata; i < s->repo->nrepodata; i++, data++)
851 if (!data->addedfileprovides || p >= data->end)
853 if (!nextdata || nextdata->start > data->start)
855 if (p >= data->start)
858 if (i == s->repo->nrepodata)
862 map_init(&providedids, pool->ss.nstrings);
863 for (idp = data->addedfileprovides; *idp; idp++)
864 MAPSET(&providedids, *idp);
865 for (i = 0; i < cbd->nfiles; i++)
866 if (!MAPTST(&providedids, cbd->ids[i]))
870 map_free(&providedids);
871 dataincludes = i == cbd->nfiles;
875 if (data && p >= data->start && dataincludes)
877 repo_search(s->repo, p, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, cbd);
882 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
886 struct searchfiles sf, isf, *isfp;
887 struct addfileprovides_cbdata cbd;
890 memset(&sf, 0, sizeof(sf));
891 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
892 memset(&isf, 0, sizeof(isf));
893 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
895 isfp = installed ? &isf : 0;
896 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
902 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
904 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
906 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
908 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
910 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
912 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
914 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
918 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
919 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
921 map_init(&cbd.useddirs, 1);
927 for (i = 0; i < sf.nfiles; i++)
928 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
930 pool_addfileprovides_search(pool, &cbd, &sf, 0);
933 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
934 sf.ids[sf.nfiles] = 0;
939 for (i = 0; i < sf.nfiles; i++)
941 sat_free(sf.dirs[i]);
942 sat_free(sf.names[i]);
950 for (i = 0; i < isf.nfiles; i++)
951 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
954 pool_addfileprovides_search(pool, &cbd, &isf, installed);
956 for (i = 0; i < isf.nfiles; i++)
958 sat_free(isf.dirs[i]);
959 sat_free(isf.names[i]);
964 map_free(&cbd.useddirs);
966 pool_freewhatprovides(pool); /* as we have added provides */
970 pool_addfileprovides(Pool *pool, Repo *installed)
972 pool_addfileprovides_ids(pool, installed, 0);
976 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)
980 if (pool->solvables[p].repo)
981 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
984 /* FIXME: obey callback return value! */
985 for (p = 1; p < pool->nsolvables; p++)
986 if (pool->solvables[p].repo)
987 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
992 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
996 pool->languagecache = sat_free(pool->languagecache);
997 pool->languagecacheother = 0;
998 if (pool->nlanguages)
1000 for (i = 0; i < pool->nlanguages; i++)
1001 free((char *)pool->languages[i]);
1002 free(pool->languages);
1004 pool->nlanguages = nlanguages;
1007 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1008 for (i = 0; i < pool->nlanguages; i++)
1009 pool->languages[i] = strdup(languages[i]);
1013 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1021 n = id2str(pool, id);
1022 l = strlen(n) + strlen(lang) + 2;
1023 if (l > sizeof(buf))
1024 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1027 sprintf(p, "%s:%s", n, lang);
1028 id = str2id(pool, p, create);
1035 pool_alloctmpspace(Pool *pool, int len)
1037 int n = pool->tmpspacen;
1040 if (len > pool->tmpspacelen[n])
1042 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1043 pool->tmpspacelen[n] = len + 32;
1045 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1046 return pool->tmpspacebuf[n];
1049 /*******************************************************************/
1061 struct mptree *mptree;
1072 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1074 struct ducbdata *cbd = cbdata;
1077 if (data != cbd->olddata)
1079 Id dn, mp, comp, *dirmap, *dirs;
1081 const char *compstr;
1082 struct mptree *mptree;
1084 /* create map from dir to mptree */
1085 cbd->dirmap = sat_free(cbd->dirmap);
1087 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1088 mptree = cbd->mptree;
1090 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1104 if (!mptree[mp].child)
1109 if (data->localpool)
1110 compstr = stringpool_id2str(&data->spool, comp);
1112 compstr = id2str(data->repo->pool, comp);
1113 compl = strlen(compstr);
1114 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1115 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1117 dirmap[dn] = i ? i : -mp;
1119 /* change dirmap to point to mountpoint instead of mptree */
1120 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1123 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1125 cbd->dirmap = dirmap;
1126 cbd->nmap = data->dirpool.ndirs;
1127 cbd->olddata = data;
1130 if (value->id < 0 || value->id >= cbd->nmap)
1132 mp = cbd->dirmap[value->id];
1135 if (cbd->addsub > 0)
1137 cbd->mps[mp].kbytes += value->num;
1138 cbd->mps[mp].files += value->num2;
1142 cbd->mps[mp].kbytes -= value->num;
1143 cbd->mps[mp].files -= value->num2;
1149 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1152 if (mptree[pos].mountpoint == -1)
1153 mptree[pos].mountpoint = mountpoint;
1155 mountpoint = mptree[pos].mountpoint;
1156 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1157 propagate_mountpoints(mptree, i, mountpoint);
1160 #define MPTREE_BLOCK 15
1163 pool_calc_duchanges(Pool *pool, Repo *oldinstalled, Map *installedmap, DUChanges *mps, int nmps)
1166 const char *path, *compstr;
1167 struct mptree *mptree;
1171 struct ducbdata cbd;
1176 memset(&ignoredu, 0, sizeof(ignoredu));
1183 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1186 mptree[0].sibling = 0;
1187 mptree[0].child = 0;
1189 mptree[0].compl = 0;
1190 mptree[0].mountpoint = -1;
1193 /* create component tree */
1194 for (mp = 0; mp < nmps; mp++)
1199 path = mps[mp].path;
1204 if ((p = strchr(path, '/')) == 0)
1207 compl = strlen(compstr);
1218 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1219 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1223 /* create new node */
1224 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1226 mptree[i].sibling = mptree[pos].child;
1227 mptree[i].child = 0;
1228 mptree[i].comp = compstr;
1229 mptree[i].compl = compl;
1230 mptree[i].mountpoint = -1;
1231 mptree[pos].child = i;
1235 mptree[pos].mountpoint = mp;
1238 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1241 for (i = 0; i < nmptree; i++)
1243 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1244 printf("#%d child: %d\n", i, mptree[i].child);
1245 printf("#%d comp: %s\n", i, mptree[i].comp);
1246 printf("#%d compl: %d\n", i, mptree[i].compl);
1247 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1251 cbd.mptree = mptree;
1253 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1255 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1257 if (!MAPTST(installedmap, sp))
1260 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1261 if (!cbd.hasdu && oldinstalled)
1264 /* no du data available, ignore data of all installed solvables we obsolete */
1266 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1269 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1270 while ((obs = *obsp++) != 0)
1271 FOR_PROVIDES(op, opp, obs)
1272 if (op >= oldinstalled->start && op < oldinstalled->end)
1273 MAPSET(&ignoredu, op - oldinstalled->start);
1275 FOR_PROVIDES(op, opp, s->name)
1276 if (pool->solvables[op].name == s->name)
1277 if (op >= oldinstalled->start && op < oldinstalled->end)
1278 MAPSET(&ignoredu, op - oldinstalled->start);
1284 /* assumes we allways have du data for installed solvables */
1285 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1287 if (MAPTST(installedmap, sp))
1289 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1291 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1295 map_free(&ignoredu);
1296 sat_free(cbd.dirmap);
1301 pool_calc_installsizechange(Pool *pool, Repo *oldinstalled, Map *installedmap)
1307 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1309 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1311 if (!MAPTST(installedmap, sp))
1313 change += repo_lookup_num(s, SOLVABLE_INSTALLSIZE);
1317 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1319 if (MAPTST(installedmap, sp))
1321 change -= repo_lookup_num(s, SOLVABLE_INSTALLSIZE);
1329 * 2: conflicts with installed
1330 * 8: interesting (only true if installed)
1334 static inline Id dep2name(Pool *pool, Id dep)
1336 while (ISRELDEP(dep))
1338 Reldep *rd = rd = GETRELDEP(pool, dep);
1344 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep)
1348 FOR_PROVIDES(p, pp, dep)
1350 if (p == SYSTEMSOLVABLE)
1351 return 1; /* always boring, as never constraining */
1352 if ((map[p] & 9) == 9)
1360 * pool_trivial_installable - calculate if a set of solvables is
1361 * trivial installable without any other installs/deinstalls of
1362 * packages not belonging to the set.
1364 * the state is returned in the result queue:
1365 * 1: solvable is installable without any other package changes
1366 * 0: solvable is not installable
1367 * -1: solvable is installable, but doesn't constrain any installed packages
1371 pool_trivial_installable(Pool *pool, Repo *oldinstalled, Map *installedmap, Queue *pkgs, Queue *res)
1374 Id p, *dp, con, *conp, req, *reqp;
1378 map = sat_calloc(pool->nsolvables, 1);
1379 for (p = 1; p < pool->nsolvables; p++)
1381 if (!MAPTST(installedmap, p))
1384 s = pool->solvables + p;
1387 conp = s->repo->idarraydata + s->conflicts;
1388 while ((con = *conp++) != 0)
1390 dp = pool_whatprovides(pool, con);
1392 map[p] |= 2; /* XXX: self conflict ? */
1395 for (i = 0; i < pkgs->count; i++)
1396 map[pkgs->elements[i]] = 16;
1398 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1400 if (i == pkgs->count)
1402 p = pkgs->elements[i];
1403 if ((map[p] & 16) == 0)
1405 if ((map[p] & 2) != 0)
1410 s = pool->solvables + p;
1414 reqp = s->repo->idarraydata + s->requires;
1415 while ((req = *reqp++) != 0)
1417 if (req == SOLVABLE_PREREQMARKER)
1419 r = providedbyinstalled(pool, map, req);
1422 /* decided and miss */
1426 m |= r; /* 1 | 9 | 16 | 17 */
1435 conp = s->repo->idarraydata + s->conflicts;
1436 while ((con = *conp++) != 0)
1438 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1443 if ((m == 1 || m == 17) && ISRELDEP(con))
1445 con = dep2name(pool, con);
1446 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1451 continue; /* found a conflict */
1454 if (s->repo && s->repo != oldinstalled)
1456 Id p2, obs, *obsp, *pp;
1460 obsp = s->repo->idarraydata + s->obsoletes;
1461 while ((obs = *obsp++) != 0)
1463 if ((providedbyinstalled(pool, map, obs) & 1) != 0)
1472 FOR_PROVIDES(p2, pp, s->name)
1474 s2 = pool->solvables + p2;
1475 if (s2->name == s->name && (map[p2] & 1) != 0)
1492 queue_clone(res, pkgs);
1493 for (i = 0; i < pkgs->count; i++)
1495 m = map[pkgs->elements[i]];
1502 res->elements[i] = r;