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 (pool->nscallback)
501 /* ask callback which packages provide the dependency
503 * 1: the system (aka SYSTEMSOLVABLE)
504 * >1: a set of packages, stored as offset on whatprovidesdata
506 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
510 pool->whatprovides_rel[d] = p;
511 return pool->whatprovidesdata + p;
514 queue_push(&plist, SYSTEMSOLVABLE);
518 /* small hack: make it possible to match <pkg>.src
519 * we have to iterate over the solvables as src packages do not
520 * provide anything, thus they are not indexed in our
521 * whatprovides hash */
525 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
527 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
529 if (pool_match_nevr(pool, s, name))
530 queue_push(&plist, p);
534 pp = pp2 = pool_whatprovides(pool, name);
535 while ((p = *pp++) != 0)
537 Solvable *s = pool->solvables + p;
539 queue_push(&plist, p);
550 /* convert to whatprovides id */
552 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
554 if (flags && flags < 8)
556 pp = pool_whatprovides(pool, name);
557 while (ISRELDEP(name))
559 rd = GETRELDEP(pool, name);
562 while ((p = *pp++) != 0)
564 Solvable *s = pool->solvables + p;
566 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, s->name));
570 /* no provides - check nevr */
571 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
572 queue_push(&plist, p);
575 /* solvable p provides name in some rels */
576 pidp = s->repo->idarraydata + s->provides;
577 while ((pid = *pidp++) != 0)
584 #ifdef DEBIAN_SEMANTICS
585 continue; /* unversioned provides can
586 * never match versioned deps */
588 break; /* yes, provides all versions */
592 continue; /* wrong provides name */
593 prd = GETRELDEP(pool, pid);
594 if (prd->name != name)
595 continue; /* wrong provides name */
596 /* right package, both deps are rels */
600 if (flags == 7 || pflags == 7)
601 break; /* included */
602 if ((pflags & flags & 5) != 0)
603 break; /* same direction, match */
607 if ((pflags & flags & 2) != 0)
608 break; /* both have =, match */
612 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
613 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_MATCH_RELEASE)))) != 0)
618 continue; /* no rel match */
619 queue_push(&plist, p);
621 /* make our system solvable provide all unknown rpmlib() stuff */
622 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
623 queue_push(&plist, SYSTEMSOLVABLE);
625 /* add providers to whatprovides */
627 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
629 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
632 return pool->whatprovidesdata + pool->whatprovides_rel[d];
635 /*************************************************************************/
638 pool_debug(Pool *pool, int type, const char *format, ...)
643 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
645 if ((pool->debugmask & type) == 0)
648 va_start(args, format);
649 if (!pool->debugcallback)
651 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
652 vprintf(format, args);
654 vfprintf(stderr, format, args);
657 vsnprintf(buf, sizeof(buf), format, args);
658 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
662 pool_setdebuglevel(Pool *pool, int level)
664 int mask = SAT_DEBUG_RESULT;
666 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE;
668 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
670 mask |= SAT_DEBUG_PROPAGATE;
672 mask |= SAT_DEBUG_RULE_CREATION;
674 mask |= SAT_DEBUG_SCHUBI;
675 pool->debugmask = mask;
678 /*************************************************************************/
688 #define SEARCHFILES_BLOCK 127
691 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
695 struct searchfiles *csf;
697 while ((dep = *ida++) != 0)
700 while (ISRELDEP(dep))
703 sid = pool->ss.nstrings + GETRELID(dep);
704 if (MAPTST(&csf->seen, sid))
709 MAPSET(&csf->seen, sid);
710 rd = GETRELDEP(pool, dep);
713 else if (rd->flags == REL_NAMESPACE)
715 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
718 if (!csf || MAPTST(&csf->seen, sid))
723 MAPSET(&csf->seen, sid);
732 pool_addfileprovides_dep(pool, ids, csf, isf);
738 if (MAPTST(&csf->seen, dep))
740 MAPSET(&csf->seen, dep);
741 s = id2str(pool, dep);
744 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
745 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
746 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
747 csf->ids[csf->nfiles] = dep;
748 sr = strrchr(s, '/');
749 csf->names[csf->nfiles] = strdup(sr + 1);
750 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
752 strncpy(csf->dirs[csf->nfiles], s, sr - s);
753 csf->dirs[csf->nfiles][sr - s] = 0;
758 struct addfileprovides_cbdata {
770 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
772 struct addfileprovides_cbdata *cbd = cbdata;
775 if (data != cbd->olddata)
777 map_free(&cbd->useddirs);
778 map_init(&cbd->useddirs, data->dirpool.ndirs);
779 for (i = 0; i < cbd->nfiles; i++)
781 Id did = repodata_str2dir(data, cbd->dirs[i], 0);
784 MAPSET(&cbd->useddirs, did);
788 if (!MAPTST(&cbd->useddirs, value->id))
790 for (i = 0; i < cbd->nfiles; i++)
792 if (cbd->dids[i] != value->id)
794 if (!strcmp(cbd->names[i], value->str))
797 if (i == cbd->nfiles)
799 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
805 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
807 Id p, start, end, *idp;
809 Repodata *data = 0, *nextdata;
811 int dataincludes = 0;
815 cbd->nfiles = sf->nfiles;
817 cbd->dirs = sf->dirs;
818 cbd->names = sf->names;
820 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
823 start = repoonly->start;
828 start = 2; /* skip system solvable */
829 end = pool->nsolvables;
831 for (p = start, s = pool->solvables + p; p < end; p++, s++)
833 if (!s->repo || (repoonly && s->repo != repoonly))
835 if (s->repo != oldrepo || (data && p >= data->end))
843 for (i = 0, data = s->repo->repodata; i < s->repo->nrepodata; i++, data++)
845 if (!data->addedfileprovides || p >= data->end)
847 if (!nextdata || nextdata->start > data->start)
849 if (p >= data->start)
852 if (i == s->repo->nrepodata)
856 map_init(&providedids, pool->ss.nstrings);
857 for (idp = data->addedfileprovides; *idp; idp++)
858 MAPSET(&providedids, *idp);
859 for (i = 0; i < cbd->nfiles; i++)
860 if (!MAPTST(&providedids, cbd->ids[i]))
864 map_free(&providedids);
865 dataincludes = i == cbd->nfiles;
869 if (data && p >= data->start && dataincludes)
871 repo_search(s->repo, p, SOLVABLE_FILELIST, 0, 0, addfileprovides_cb, cbd);
876 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
880 struct searchfiles sf, isf, *isfp;
881 struct addfileprovides_cbdata cbd;
884 memset(&sf, 0, sizeof(sf));
885 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
886 memset(&isf, 0, sizeof(isf));
887 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
889 isfp = installed ? &isf : 0;
890 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
896 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
898 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
900 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
902 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
904 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
906 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
908 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
912 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies\n", sf.nfiles);
913 POOL_DEBUG(SAT_DEBUG_STATS, "found %d installed file dependencies\n", isf.nfiles);
915 map_init(&cbd.useddirs, 1);
921 for (i = 0; i < sf.nfiles; i++)
922 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
924 pool_addfileprovides_search(pool, &cbd, &sf, 0);
927 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
928 sf.ids[sf.nfiles] = 0;
933 for (i = 0; i < sf.nfiles; i++)
935 sat_free(sf.dirs[i]);
936 sat_free(sf.names[i]);
944 for (i = 0; i < isf.nfiles; i++)
945 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
948 pool_addfileprovides_search(pool, &cbd, &isf, installed);
950 for (i = 0; i < isf.nfiles; i++)
952 sat_free(isf.dirs[i]);
953 sat_free(isf.names[i]);
958 map_free(&cbd.useddirs);
960 pool_freewhatprovides(pool); /* as we have added provides */
964 pool_addfileprovides(Pool *pool, Repo *installed)
966 pool_addfileprovides_ids(pool, installed, 0);
970 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)
974 if (pool->solvables[p].repo)
975 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
978 /* FIXME: obey callback return value! */
979 for (p = 1; p < pool->nsolvables; p++)
980 if (pool->solvables[p].repo)
981 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
986 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
990 pool->languagecache = sat_free(pool->languagecache);
991 pool->languagecacheother = 0;
992 if (pool->nlanguages)
994 for (i = 0; i < pool->nlanguages; i++)
995 free((char *)pool->languages[i]);
996 free(pool->languages);
998 pool->nlanguages = nlanguages;
1001 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1002 for (i = 0; i < pool->nlanguages; i++)
1003 pool->languages[i] = strdup(languages[i]);
1007 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1015 n = id2str(pool, id);
1016 l = strlen(n) + strlen(lang) + 2;
1017 if (l > sizeof(buf))
1018 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1021 sprintf(p, "%s:%s", n, lang);
1022 id = str2id(pool, p, create);
1029 pool_alloctmpspace(Pool *pool, int len)
1031 int n = pool->tmpspacen;
1034 if (len > pool->tmpspacelen[n])
1036 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1037 pool->tmpspacelen[n] = len + 32;
1039 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1040 return pool->tmpspacebuf[n];
1043 /*******************************************************************/
1055 struct mptree *mptree;
1066 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1068 struct ducbdata *cbd = cbdata;
1071 if (data != cbd->olddata)
1073 Id dn, mp, comp, *dirmap, *dirs;
1075 const char *compstr;
1076 struct mptree *mptree;
1078 /* create map from dir to mptree */
1079 cbd->dirmap = sat_free(cbd->dirmap);
1081 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1082 mptree = cbd->mptree;
1084 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1098 if (!mptree[mp].child)
1103 if (data->localpool)
1104 compstr = stringpool_id2str(&data->spool, comp);
1106 compstr = id2str(data->repo->pool, comp);
1107 compl = strlen(compstr);
1108 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1109 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1111 dirmap[dn] = i ? i : -mp;
1113 /* change dirmap to point to mountpoint instead of mptree */
1114 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1117 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1119 cbd->dirmap = dirmap;
1120 cbd->nmap = data->dirpool.ndirs;
1121 cbd->olddata = data;
1124 if (value->id < 0 || value->id >= cbd->nmap)
1126 mp = cbd->dirmap[value->id];
1129 if (cbd->addsub > 0)
1131 cbd->mps[mp].kbytes += value->num;
1132 cbd->mps[mp].files += value->num2;
1136 cbd->mps[mp].kbytes -= value->num;
1137 cbd->mps[mp].files -= value->num2;
1143 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1146 if (mptree[pos].mountpoint == -1)
1147 mptree[pos].mountpoint = mountpoint;
1149 mountpoint = mptree[pos].mountpoint;
1150 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1151 propagate_mountpoints(mptree, i, mountpoint);
1154 #define MPTREE_BLOCK 15
1157 pool_calc_duchanges(Pool *pool, Repo *oldinstalled, Map *installedmap, DUChanges *mps, int nmps)
1160 const char *path, *compstr;
1161 struct mptree *mptree;
1165 struct ducbdata cbd;
1170 memset(&ignoredu, 0, sizeof(ignoredu));
1177 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1180 mptree[0].sibling = 0;
1181 mptree[0].child = 0;
1183 mptree[0].compl = 0;
1184 mptree[0].mountpoint = -1;
1187 /* create component tree */
1188 for (mp = 0; mp < nmps; mp++)
1193 path = mps[mp].path;
1198 if ((p = strchr(path, '/')) == 0)
1201 compl = strlen(compstr);
1212 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1213 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1217 /* create new node */
1218 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1220 mptree[i].sibling = mptree[pos].child;
1221 mptree[i].child = 0;
1222 mptree[i].comp = compstr;
1223 mptree[i].compl = compl;
1224 mptree[i].mountpoint = -1;
1225 mptree[pos].child = i;
1229 mptree[pos].mountpoint = mp;
1232 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1235 for (i = 0; i < nmptree; i++)
1237 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1238 printf("#%d child: %d\n", i, mptree[i].child);
1239 printf("#%d comp: %s\n", i, mptree[i].comp);
1240 printf("#%d compl: %d\n", i, mptree[i].compl);
1241 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1245 cbd.mptree = mptree;
1247 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1249 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1251 if (!MAPTST(installedmap, sp))
1254 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1255 if (!cbd.hasdu && oldinstalled)
1258 /* no du data available, ignore data of all installed solvables we obsolete */
1260 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1263 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1264 while ((obs = *obsp++) != 0)
1265 FOR_PROVIDES(op, opp, obs)
1266 if (op >= oldinstalled->start && op < oldinstalled->end)
1267 MAPSET(&ignoredu, op - oldinstalled->start);
1269 FOR_PROVIDES(op, opp, s->name)
1270 if (pool->solvables[op].name == s->name)
1271 if (op >= oldinstalled->start && op < oldinstalled->end)
1272 MAPSET(&ignoredu, op - oldinstalled->start);
1278 /* assumes we allways have du data for installed solvables */
1279 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1281 if (MAPTST(installedmap, sp))
1283 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1285 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1289 map_free(&ignoredu);
1290 sat_free(cbd.dirmap);
1295 pool_calc_installsizechange(Pool *pool, Repo *oldinstalled, Map *installedmap)
1301 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1303 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1305 if (!MAPTST(installedmap, sp))
1307 change += repo_lookup_num(s, SOLVABLE_INSTALLSIZE);
1311 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1313 if (MAPTST(installedmap, sp))
1315 change -= repo_lookup_num(s, SOLVABLE_INSTALLSIZE);
1323 * 2: conflicts with installed
1324 * 8: interesting (only true if installed)
1328 static inline Id dep2name(Pool *pool, Id dep)
1330 while (ISRELDEP(dep))
1332 Reldep *rd = rd = GETRELDEP(pool, dep);
1338 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep)
1342 FOR_PROVIDES(p, pp, dep)
1344 if (p == SYSTEMSOLVABLE)
1345 return 1; /* always boring, as never constraining */
1346 if ((map[p] & 9) == 9)
1354 * pool_trivial_installable - calculate if a set of solvables is
1355 * trivial installable without any other installs/deinstalls of
1356 * packages not belonging to the set.
1358 * the state is returned in the result queue:
1359 * 1: solvable is installable without any other package changes
1360 * 0: solvable is not installable
1361 * -1: solvable is installable, but doesn't constrain any installed packages
1365 pool_trivial_installable(Pool *pool, Repo *oldinstalled, Map *installedmap, Queue *pkgs, Queue *res)
1368 Id p, *dp, con, *conp, req, *reqp;
1372 map = sat_calloc(pool->nsolvables, 1);
1373 for (p = 1; p < pool->nsolvables; p++)
1375 if (!MAPTST(installedmap, p))
1378 s = pool->solvables + p;
1381 conp = s->repo->idarraydata + s->conflicts;
1382 while ((con = *conp++) != 0)
1384 dp = pool_whatprovides(pool, con);
1386 map[p] |= 2; /* XXX: self conflict ? */
1389 for (i = 0; i < pkgs->count; i++)
1390 map[pkgs->elements[i]] = 16;
1392 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1394 if (i == pkgs->count)
1396 p = pkgs->elements[i];
1397 if ((map[p] & 16) == 0)
1399 if ((map[p] & 2) != 0)
1404 s = pool->solvables + p;
1408 reqp = s->repo->idarraydata + s->requires;
1409 while ((req = *reqp++) != 0)
1411 if (req == SOLVABLE_PREREQMARKER)
1413 r = providedbyinstalled(pool, map, req);
1416 /* decided and miss */
1420 m |= r; /* 1 | 9 | 16 | 17 */
1429 conp = s->repo->idarraydata + s->conflicts;
1430 while ((con = *conp++) != 0)
1432 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1437 if ((m == 1 || m == 17) && ISRELDEP(con))
1439 con = dep2name(pool, con);
1440 if ((providedbyinstalled(pool, map, con) & 1) != 0)
1445 continue; /* found a conflict */
1448 if (s->repo && s->repo != oldinstalled)
1450 Id p2, obs, *obsp, *pp;
1454 obsp = s->repo->idarraydata + s->obsoletes;
1455 while ((obs = *obsp++) != 0)
1457 if ((providedbyinstalled(pool, map, obs) & 1) != 0)
1466 FOR_PROVIDES(p2, pp, s->name)
1468 s2 = pool->solvables + p2;
1469 if (s2->name == s->name && (map[p2] & 1) != 0)
1486 queue_clone(res, pkgs);
1487 for (i = 0; i < pkgs->count; i++)
1489 m = map[pkgs->elements[i]];
1496 res->elements[i] = r;