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.
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 */
65 pool->obsoleteusescolors = 1;
68 pool->allowselfconflicts = 1;
69 # ifdef MULTI_SEMANTICS
70 pool->disttype = DISTTYPE_DEB;
74 pool->obsoleteusesprovides = 1;
75 pool->implicitobsoleteusesprovides = 1;
81 /* free all the resources of our pool */
87 pool_freewhatprovides(pool);
88 pool_freeidhashes(pool);
89 repo_freeallrepos(pool, 1);
90 sat_free(pool->id2arch);
91 sat_free(pool->solvables);
92 stringpool_free(&pool->ss);
94 pool_setvendorclasses(pool, 0);
95 queue_free(&pool->vendormap);
96 for (i = 0; i < POOL_TMPSPACEBUF; i++)
97 sat_free(pool->tmpspace.buf[i]);
98 for (i = 0; i < pool->nlanguages; i++)
99 free((char *)pool->languages[i]);
100 sat_free(pool->languages);
101 sat_free(pool->languagecache);
105 #ifdef MULTI_SEMANTICS
107 pool_setdisttype(Pool *pool, int disttype)
109 pool->disttype = disttype;
114 pool_add_solvable(Pool *pool)
116 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
117 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
118 return pool->nsolvables++;
122 pool_add_solvable_block(Pool *pool, int count)
124 Id nsolvables = pool->nsolvables;
127 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
128 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
129 pool->nsolvables += count;
134 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
138 if (reuseids && start + count == pool->nsolvables)
140 /* might want to shrink solvable array */
141 pool->nsolvables = start;
144 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
149 pool_set_installed(Pool *pool, Repo *installed)
151 if (pool->installed == installed)
153 pool->installed = installed;
154 pool_freewhatprovides(pool);
158 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
163 oa = pool->whatprovides[*(Id *)ap];
164 ob = pool->whatprovides[*(Id *)bp];
166 return *(Id *)ap - *(Id *)bp;
171 da = pool->whatprovidesdata + oa;
172 db = pool->whatprovidesdata + ob;
174 if ((r = (*da++ - *db++)) != 0)
178 return *(Id *)ap - *(Id *)bp;
182 * pool_shrink_whatprovides - unify whatprovides data
184 * whatprovides_rel must be empty for this to work!
188 pool_shrink_whatprovides(Pool *pool)
192 Id lastid, *last, *dp, *lp;
196 if (pool->ss.nstrings < 3)
198 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
199 for (id = 0; id < pool->ss.nstrings; id++)
201 sat_sort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
204 for (i = 1; i < pool->ss.nstrings; i++)
207 o = pool->whatprovides[id];
208 if (o == 0 || o == 1)
210 dp = pool->whatprovidesdata + o;
224 pool->whatprovides[id] = -lastid;
228 last = pool->whatprovidesdata + o;
232 dp = pool->whatprovidesdata + 2;
233 for (id = 1; id < pool->ss.nstrings; id++)
235 o = pool->whatprovides[id];
236 if (o == 0 || o == 1)
243 pool->whatprovides[id] = pool->whatprovides[i];
246 lp = pool->whatprovidesdata + o;
249 pool->whatprovides[id] = dp - pool->whatprovidesdata;
250 while ((*dp++ = *lp++) != 0)
253 o = dp - pool->whatprovidesdata;
254 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
255 if (pool->whatprovidesdataoff == o)
257 r = pool->whatprovidesdataoff - o;
258 pool->whatprovidesdataoff = o;
259 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
260 if (r > pool->whatprovidesdataleft)
261 r = pool->whatprovidesdataleft;
262 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
267 * pool_createwhatprovides()
269 * create hashes over pool of solvables to ease provide lookups
273 pool_createwhatprovides(Pool *pool)
275 int i, num, np, extra;
280 Offset *whatprovides;
281 Id *whatprovidesdata, *d;
282 Repo *installed = pool->installed;
286 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
287 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
289 pool_freeidhashes(pool); /* XXX: should not be here! */
290 pool_freewhatprovides(pool);
291 num = pool->ss.nstrings;
292 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
293 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
295 /* count providers for each name */
296 for (i = pool->nsolvables - 1; i > 0; i--)
299 s = pool->solvables + i;
300 if (!s->provides || !s->repo || s->repo->disabled)
302 /* we always need the installed solvable in the whatprovides data,
303 otherwise obsoletes/conflicts on them won't work */
304 if (s->repo != installed && !pool_installable(pool, s))
306 pp = s->repo->idarraydata + s->provides;
307 while ((id = *pp++) != 0)
311 Reldep *rd = GETRELDEP(pool, id);
314 whatprovides[id]++; /* inc count of providers */
318 off = 2; /* first entry is undef, second is empty list */
319 np = 0; /* number of names provided */
320 for (i = 0, idp = whatprovides; i < num; i++, idp++)
323 if (!n) /* no providers */
325 off += n; /* make space for all providers */
326 *idp = off++; /* now idp points to terminating zero */
327 np++; /* inc # of provider 'slots' for stats */
330 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
332 /* reserve some space for relation data */
333 extra = 2 * pool->nrels;
337 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
339 /* alloc space for all providers + extra */
340 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
342 /* now fill data for all provides */
343 for (i = pool->nsolvables - 1; i > 0; i--)
346 s = pool->solvables + i;
347 if (!s->provides || !s->repo || s->repo->disabled)
349 if (s->repo != installed && !pool_installable(pool, s))
352 /* for all provides of this solvable */
353 pp = s->repo->idarraydata + s->provides;
354 while ((id = *pp++) != 0)
358 Reldep *rd = GETRELDEP(pool, id);
361 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
362 if (*d != i) /* don't add same solvable twice */
369 pool->whatprovidesdata = whatprovidesdata;
370 pool->whatprovidesdataoff = off;
371 pool->whatprovidesdataleft = extra;
372 pool_shrink_whatprovides(pool);
373 POOL_DEBUG(SAT_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)));
374 POOL_DEBUG(SAT_DEBUG_STATS, "createwhatprovides took %d ms\n", sat_timems(now));
378 * free all of our whatprovides data
379 * be careful, everything internalized with pool_queuetowhatprovides is
383 pool_freewhatprovides(Pool *pool)
385 pool->whatprovides = sat_free(pool->whatprovides);
386 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
387 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
388 pool->whatprovidesdataoff = 0;
389 pool->whatprovidesdataleft = 0;
393 /******************************************************************************/
396 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
398 * on-demand filling of provider information
399 * move queue data into whatprovidesdata
401 * returns: Offset into whatprovides
405 pool_queuetowhatprovides(Pool *pool, Queue *q)
408 int count = q->count;
410 if (count == 0) /* queue empty -> 1 */
413 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
414 if (pool->whatprovidesdataleft < count + 1)
416 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
417 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
418 pool->whatprovidesdataleft = count + 4096;
421 /* copy queue to next free slot */
422 off = pool->whatprovidesdataoff;
423 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
425 /* adapt count and ID_NULL-terminate */
426 pool->whatprovidesdataoff += count;
427 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
428 pool->whatprovidesdataleft -= count + 1;
434 /*************************************************************************/
436 #if defined(MULTI_SEMANTICS)
437 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
438 #elif defined(DEBIAN_SEMANTICS)
439 # define EVRCMP_DEPCMP EVRCMP_COMPARE
441 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
444 /* check if a package's nevr matches a dependency */
447 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
449 Reldep *rd = GETRELDEP(pool, d);
452 int flags = rd->flags;
461 return pool_match_nevr(pool, s, name);
463 if (pool_match_nevr(pool, s, name))
465 return pool_match_nevr(pool, s, evr);
468 if (!pool_match_nevr(pool, s, name))
470 return pool_match_nevr(pool, s, evr);
475 if (!pool_match_nevr(pool, s, name))
478 return flags & 2 ? 1 : 0;
483 if (flags != 2 && flags != 5)
485 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP)))) != 0)
490 /* match (flags, evr) against provider (pflags, pevr) */
492 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
494 if (!pflags || !flags || pflags >= 8 || flags >= 8)
496 if (flags == 7 || pflags == 7)
497 return 1; /* rel provides every version */
498 if ((pflags & flags & 5) != 0)
499 return 1; /* both rels show in the same direction */
502 if ((pflags & flags & 2) != 0)
503 return 1; /* both have '=', match */
507 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
508 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_DEPCMP)))) != 0)
514 /* match two dependencies (d1 = provider) */
517 pool_match_dep(Pool *pool, Id d1, Id d2)
527 rd2 = GETRELDEP(pool, d2);
528 return pool_match_dep(pool, d1, rd2->name);
530 rd1 = GETRELDEP(pool, d1);
533 return pool_match_dep(pool, rd1->name, d2);
535 rd2 = GETRELDEP(pool, d2);
536 /* first match name */
537 if (!pool_match_dep(pool, rd1->name, rd2->name))
539 /* name matches, check flags and evr */
540 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
546 * add packages fulfilling the relation to whatprovides array
547 * no exact providers, do range match
552 pool_addrelproviders(Pool *pool, Id d)
554 Reldep *rd = GETRELDEP(pool, d);
560 int flags = rd->flags;
565 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
569 /* special relation */
577 wp = pool_whatprovides(pool, name);
578 pp2 = pool_whatprovides_ptr(pool, evr);
579 pp = pool->whatprovidesdata + wp;
580 while ((p = *pp++) != 0)
582 for (pp3 = pp2; *pp3; pp3++)
586 queue_push(&plist, p); /* found it */
592 wp = pool_whatprovides(pool, name);
593 pp = pool->whatprovidesdata + wp;
595 wp = pool_whatprovides(pool, evr);
599 while ((p = *pp++) != 0)
600 queue_push(&plist, p);
602 pp = pool_whatprovides_ptr(pool, evr);
603 while ((p = *pp++) != 0)
604 queue_pushunique(&plist, p);
605 if (plist.count != cnt)
610 if (name == NAMESPACE_OTHERPROVIDERS)
612 wp = pool_whatprovides(pool, evr);
615 if (pool->nscallback)
617 /* ask callback which packages provide the dependency
619 * 1: the system (aka SYSTEMSOLVABLE)
620 * >1: set of packages, stored as offset on whatprovidesdata
622 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
626 queue_push(&plist, SYSTEMSOLVABLE);
630 /* small hack: make it possible to match <pkg>.src
631 * we have to iterate over the solvables as src packages do not
632 * provide anything, thus they are not indexed in our
633 * whatprovides hash */
637 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
639 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
641 if (pool_match_nevr(pool, s, name))
642 queue_push(&plist, p);
646 wp = pool_whatprovides(pool, name);
647 pp = pool->whatprovidesdata + wp;
648 while ((p = *pp++) != 0)
650 Solvable *s = pool->solvables + p;
652 queue_push(&plist, p);
657 case REL_FILECONFLICT:
658 pp = pool_whatprovides_ptr(pool, name);
659 while ((p = *pp++) != 0)
661 Id origd = MAKERELDEP(d);
662 Solvable *s = pool->solvables + p;
665 pidp = s->repo->idarraydata + s->provides;
666 while ((pid = *pidp++) != 0)
670 queue_push(&plist, p);
678 /* we can reuse an existing entry */
680 pool->whatprovides_rel[d] = wp;
686 /* simple version comparison relation */
688 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
690 pp = pool_whatprovides_ptr(pool, name);
691 while (ISRELDEP(name))
693 rd = GETRELDEP(pool, name);
696 while ((p = *pp++) != 0)
698 Solvable *s = pool->solvables + p;
701 /* no provides - check nevr */
702 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
703 queue_push(&plist, p);
706 /* solvable p provides name in some rels */
707 pidp = s->repo->idarraydata + s->provides;
708 while ((pid = *pidp++) != 0)
712 #if defined(MULTI_SEMANTICS)
713 if (pool->disttype == DISTTYPE_DEB)
717 #elif defined(DEBIAN_SEMANTICS)
718 continue; /* unversioned provides can
719 * never match versioned deps */
721 break; /* yes, provides all versions */
725 continue; /* wrong provides name */
726 prd = GETRELDEP(pool, pid);
727 if (prd->name != name)
728 continue; /* wrong provides name */
729 /* right package, both deps are rels. check flags/evr */
730 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
734 continue; /* none of the providers matched */
735 queue_push(&plist, p);
737 /* make our system solvable provide all unknown rpmlib() stuff */
738 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
739 queue_push(&plist, SYSTEMSOLVABLE);
741 /* add providers to whatprovides */
743 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
745 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
748 return pool->whatprovides_rel[d];
751 /*************************************************************************/
754 pool_debug(Pool *pool, int type, const char *format, ...)
759 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
761 if ((pool->debugmask & type) == 0)
764 va_start(args, format);
765 if (!pool->debugcallback)
767 if ((type & (SAT_FATAL|SAT_ERROR)) == 0 && !(pool->debugmask & SAT_DEBUG_TO_STDERR))
768 vprintf(format, args);
770 vfprintf(stderr, format, args);
773 vsnprintf(buf, sizeof(buf), format, args);
774 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
778 pool_setdebuglevel(Pool *pool, int level)
780 int mask = SAT_DEBUG_RESULT;
782 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE|SAT_DEBUG_SOLVER|SAT_DEBUG_TRANSACTION;
784 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
786 mask |= SAT_DEBUG_PROPAGATE;
788 mask |= SAT_DEBUG_RULE_CREATION;
790 mask |= SAT_DEBUG_SCHUBI;
791 mask |= pool->debugmask & SAT_DEBUG_TO_STDERR; /* keep bit */
792 pool->debugmask = mask;
795 /*************************************************************************/
805 #define SEARCHFILES_BLOCK 127
808 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
812 struct searchfiles *csf;
814 while ((dep = *ida++) != 0)
817 while (ISRELDEP(dep))
820 sid = pool->ss.nstrings + GETRELID(dep);
821 if (MAPTST(&csf->seen, sid))
826 MAPSET(&csf->seen, sid);
827 rd = GETRELDEP(pool, dep);
830 else if (rd->flags == REL_NAMESPACE)
832 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
835 if (!csf || MAPTST(&csf->seen, sid))
840 MAPSET(&csf->seen, sid);
844 else if (rd->flags == REL_FILECONFLICT)
854 pool_addfileprovides_dep(pool, ids, csf, isf);
860 if (MAPTST(&csf->seen, dep))
862 MAPSET(&csf->seen, dep);
863 s = id2str(pool, dep);
866 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
867 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
868 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
869 csf->ids[csf->nfiles] = dep;
870 sr = strrchr(s, '/');
871 csf->names[csf->nfiles] = strdup(sr + 1);
872 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
874 strncpy(csf->dirs[csf->nfiles], s, sr - s);
875 csf->dirs[csf->nfiles][sr - s] = 0;
880 struct addfileprovides_cbdata {
894 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
896 struct addfileprovides_cbdata *cbd = cbdata;
899 if (!cbd->useddirs.size)
901 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
902 for (i = 0; i < cbd->nfiles; i++)
905 if (MAPTST(&cbd->providedids, cbd->ids[i]))
910 did = repodata_str2dir(data, cbd->dirs[i], 0);
913 MAPSET(&cbd->useddirs, did);
916 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
918 for (i = 0; i < cbd->nfiles; i++)
920 if (cbd->dids[i] != value->id)
922 if (!strcmp(cbd->names[i], value->str))
925 if (i == cbd->nfiles)
927 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
932 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
938 int i, j, repoid, repodataid;
939 int provstart, provend;
941 int ndone, incomplete;
946 cbd->nfiles = sf->nfiles;
948 cbd->dirs = sf->dirs;
949 cbd->names = sf->names;
950 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
951 map_init(&cbd->providedids, pool->ss.nstrings);
954 repo = repoonly ? repoonly : pool->repos[0];
955 map_init(&donemap, pool->nsolvables);
956 queue_init(&fileprovidesq);
957 provstart = provend = 0;
962 if (repoonly || ++repoid == pool->nrepos)
964 repo = pool->repos[repoid];
968 for (data = repo->repodata, repodataid = 0; repodataid < repo->nrepodata; repodataid++, data++)
970 if (ndone >= repo->nsolvables)
973 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
975 map_empty(&cbd->providedids);
976 for (i = 0; i < fileprovidesq.count; i++)
977 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
978 provstart = data->start;
980 for (i = 0; i < cbd->nfiles; i++)
981 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
983 if (i == cbd->nfiles)
985 /* great! no need to search files */
986 for (p = data->start; p < data->end; p++)
987 if (pool->solvables[p].repo == repo)
989 if (MAPTST(&donemap, p))
998 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
1001 if (data->start < provstart || data->end > provend)
1003 map_empty(&cbd->providedids);
1004 provstart = provend = 0;
1007 /* check if the data is incomplete */
1009 if (data->state == REPODATA_AVAILABLE)
1011 for (j = 1; j < data->nkeys; j++)
1012 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1014 if (j < data->nkeys)
1017 for (i = 0; i < cbd->nfiles; i++)
1018 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1019 printf("need complete filelist because of %s\n", id2str(pool, cbd->ids[i]));
1021 for (i = 0; i < cbd->nfiles; i++)
1022 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1024 if (i < cbd->nfiles)
1030 map_init(&cbd->useddirs, 0);
1031 for (p = data->start; p < data->end; p++)
1032 if (pool->solvables[p].repo == repo)
1034 if (MAPTST(&donemap, p))
1036 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1039 MAPSET(&donemap, p);
1043 map_free(&cbd->useddirs);
1046 if (repoonly || ++repoid == pool->nrepos)
1048 repo = pool->repos[repoid];
1051 queue_free(&fileprovidesq);
1052 map_free(&cbd->providedids);
1056 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
1060 struct searchfiles sf, isf, *isfp;
1061 struct addfileprovides_cbdata cbd;
1065 now = sat_timems(0);
1066 memset(&sf, 0, sizeof(sf));
1067 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1068 memset(&isf, 0, sizeof(isf));
1069 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1071 isfp = installed ? &isf : 0;
1072 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1078 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1080 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1082 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1084 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1086 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1088 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1090 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1093 map_free(&isf.seen);
1094 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1101 for (i = 0; i < sf.nfiles; i++)
1102 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
1104 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1107 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1108 sf.ids[sf.nfiles] = 0;
1113 for (i = 0; i < sf.nfiles; i++)
1115 sat_free(sf.dirs[i]);
1116 sat_free(sf.names[i]);
1124 for (i = 0; i < isf.nfiles; i++)
1125 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
1128 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1130 for (i = 0; i < isf.nfiles; i++)
1132 sat_free(isf.dirs[i]);
1133 sat_free(isf.names[i]);
1136 sat_free(isf.names);
1139 pool_freewhatprovides(pool); /* as we have added provides */
1140 POOL_DEBUG(SAT_DEBUG_STATS, "addfileprovides took %d ms\n", sat_timems(now));
1144 pool_addfileprovides(Pool *pool)
1146 pool_addfileprovides_ids(pool, pool->installed, 0);
1150 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)
1154 if (pool->solvables[p].repo)
1155 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1158 /* FIXME: obey callback return value! */
1159 for (p = 1; p < pool->nsolvables; p++)
1160 if (pool->solvables[p].repo)
1161 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1165 pool_clear_pos(Pool *pool)
1167 memset(&pool->pos, 0, sizeof(pool->pos));
1172 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1176 pool->languagecache = sat_free(pool->languagecache);
1177 pool->languagecacheother = 0;
1178 if (pool->nlanguages)
1180 for (i = 0; i < pool->nlanguages; i++)
1181 free((char *)pool->languages[i]);
1182 free(pool->languages);
1184 pool->nlanguages = nlanguages;
1187 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1188 for (i = 0; i < pool->nlanguages; i++)
1189 pool->languages[i] = strdup(languages[i]);
1193 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1201 n = id2str(pool, id);
1202 l = strlen(n) + strlen(lang) + 2;
1203 if (l > sizeof(buf))
1204 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1207 sprintf(p, "%s:%s", n, lang);
1208 id = str2id(pool, p, create);
1215 pool_alloctmpspace(Pool *pool, int len)
1217 int n = pool->tmpspace.n;
1220 if (len > pool->tmpspace.len[n])
1222 pool->tmpspace.buf[n] = sat_realloc(pool->tmpspace.buf[n], len + 32);
1223 pool->tmpspace.len[n] = len + 32;
1225 pool->tmpspace.n = (n + 1) % POOL_TMPSPACEBUF;
1226 return pool->tmpspace.buf[n];
1230 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1235 n = oldn = pool->tmpspace.n;
1239 n = POOL_TMPSPACEBUF - 1;
1242 if (pool->tmpspace.buf[n] != space)
1244 if (len > pool->tmpspace.len[n])
1246 pool->tmpspace.buf[n] = sat_realloc(pool->tmpspace.buf[n], len + 32);
1247 pool->tmpspace.len[n] = len + 32;
1249 return pool->tmpspace.buf[n];
1256 pool_freetmpspace(Pool *pool, const char *space)
1258 int n = pool->tmpspace.n;
1261 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1262 if (pool->tmpspace.buf[n] == space)
1263 pool->tmpspace.n = n;
1267 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1271 l1 = str1 ? strlen(str1) : 0;
1272 l2 = str2 ? strlen(str2) : 0;
1273 l3 = str3 ? strlen(str3) : 0;
1274 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1295 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1300 l1 = str1 ? strlen(str1) : 0;
1301 l2 = str2 ? strlen(str2) : 0;
1302 l3 = str3 ? strlen(str3) : 0;
1303 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1307 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1330 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1335 s = pool_alloctmpspace(pool, 2 * len + 1);
1336 sat_bin2hex(buf, len, s);
1340 /*******************************************************************/
1352 struct mptree *mptree;
1363 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1365 struct ducbdata *cbd = cbdata;
1368 if (data != cbd->olddata)
1370 Id dn, mp, comp, *dirmap, *dirs;
1372 const char *compstr;
1373 struct mptree *mptree;
1375 /* create map from dir to mptree */
1376 cbd->dirmap = sat_free(cbd->dirmap);
1378 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1379 mptree = cbd->mptree;
1381 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1395 if (!mptree[mp].child)
1400 if (data->localpool)
1401 compstr = stringpool_id2str(&data->spool, comp);
1403 compstr = id2str(data->repo->pool, comp);
1404 compl = strlen(compstr);
1405 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1406 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1408 dirmap[dn] = i ? i : -mp;
1410 /* change dirmap to point to mountpoint instead of mptree */
1411 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1414 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1416 cbd->dirmap = dirmap;
1417 cbd->nmap = data->dirpool.ndirs;
1418 cbd->olddata = data;
1421 if (value->id < 0 || value->id >= cbd->nmap)
1423 mp = cbd->dirmap[value->id];
1426 if (cbd->addsub > 0)
1428 cbd->mps[mp].kbytes += value->num;
1429 cbd->mps[mp].files += value->num2;
1433 cbd->mps[mp].kbytes -= value->num;
1434 cbd->mps[mp].files -= value->num2;
1440 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1443 if (mptree[pos].mountpoint == -1)
1444 mptree[pos].mountpoint = mountpoint;
1446 mountpoint = mptree[pos].mountpoint;
1447 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1448 propagate_mountpoints(mptree, i, mountpoint);
1451 #define MPTREE_BLOCK 15
1454 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1457 const char *path, *compstr;
1458 struct mptree *mptree;
1462 struct ducbdata cbd;
1466 Repo *oldinstalled = pool->installed;
1468 memset(&ignoredu, 0, sizeof(ignoredu));
1475 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1478 mptree[0].sibling = 0;
1479 mptree[0].child = 0;
1481 mptree[0].compl = 0;
1482 mptree[0].mountpoint = -1;
1485 /* create component tree */
1486 for (mp = 0; mp < nmps; mp++)
1491 path = mps[mp].path;
1496 if ((p = strchr(path, '/')) == 0)
1499 compl = strlen(compstr);
1510 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1511 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1515 /* create new node */
1516 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1518 mptree[i].sibling = mptree[pos].child;
1519 mptree[i].child = 0;
1520 mptree[i].comp = compstr;
1521 mptree[i].compl = compl;
1522 mptree[i].mountpoint = -1;
1523 mptree[pos].child = i;
1527 mptree[pos].mountpoint = mp;
1530 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1533 for (i = 0; i < nmptree; i++)
1535 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1536 printf("#%d child: %d\n", i, mptree[i].child);
1537 printf("#%d comp: %s\n", i, mptree[i].comp);
1538 printf("#%d compl: %d\n", i, mptree[i].compl);
1539 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1543 cbd.mptree = mptree;
1545 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1547 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1549 if (!MAPTST(installedmap, sp))
1552 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1553 if (!cbd.hasdu && oldinstalled)
1556 /* no du data available, ignore data of all installed solvables we obsolete */
1558 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1561 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1562 while ((obs = *obsp++) != 0)
1563 FOR_PROVIDES(op, opp, obs)
1564 if (op >= oldinstalled->start && op < oldinstalled->end)
1565 MAPSET(&ignoredu, op - oldinstalled->start);
1567 FOR_PROVIDES(op, opp, s->name)
1568 if (pool->solvables[op].name == s->name)
1569 if (op >= oldinstalled->start && op < oldinstalled->end)
1570 MAPSET(&ignoredu, op - oldinstalled->start);
1576 /* assumes we allways have du data for installed solvables */
1577 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1579 if (MAPTST(installedmap, sp))
1581 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1583 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1587 map_free(&ignoredu);
1588 sat_free(cbd.dirmap);
1593 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1598 Repo *oldinstalled = pool->installed;
1600 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1602 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1604 if (!MAPTST(installedmap, sp))
1606 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1610 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1612 if (MAPTST(installedmap, sp))
1614 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1622 * 2: conflicts with installed
1623 * 8: interesting (only true if installed)
1627 static inline Id dep2name(Pool *pool, Id dep)
1629 while (ISRELDEP(dep))
1631 Reldep *rd = rd = GETRELDEP(pool, dep);
1637 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1640 Solvable *sn = pool->solvables + n;
1642 FOR_PROVIDES(p, pp, sn->name)
1644 Solvable *s = pool->solvables + p;
1645 if (s->name != sn->name || s->arch != sn->arch)
1647 if ((map[p] & 9) != 9)
1649 if (pool_match_nevr(pool, pool->solvables + p, con))
1651 return 1; /* found installed package that doesn't conflict */
1656 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1660 FOR_PROVIDES(p, pp, dep)
1662 if (p == SYSTEMSOLVABLE)
1663 return 1; /* always boring, as never constraining */
1664 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1666 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1667 if (providedbyinstalled_multiversion(pool, map, p, dep))
1669 if ((map[p] & 9) == 9)
1677 * pool_trivial_installable - calculate if a set of solvables is
1678 * trivial installable without any other installs/deinstalls of
1679 * packages not belonging to the set.
1681 * the state is returned in the result queue:
1682 * 1: solvable is installable without any other package changes
1683 * 0: solvable is not installable
1684 * -1: solvable is installable, but doesn't constrain any installed packages
1688 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1691 Id p, *dp, con, *conp, req, *reqp;
1695 map = sat_calloc(pool->nsolvables, 1);
1696 for (p = 1; p < pool->nsolvables; p++)
1698 if (!MAPTST(installedmap, p))
1701 s = pool->solvables + p;
1704 conp = s->repo->idarraydata + s->conflicts;
1705 while ((con = *conp++) != 0)
1707 dp = pool_whatprovides_ptr(pool, con);
1709 map[p] |= 2; /* XXX: self conflict ? */
1712 for (i = 0; i < pkgs->count; i++)
1713 map[pkgs->elements[i]] = 16;
1715 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1717 if (i == pkgs->count)
1719 p = pkgs->elements[i];
1720 if ((map[p] & 16) == 0)
1722 if ((map[p] & 2) != 0)
1727 s = pool->solvables + p;
1731 reqp = s->repo->idarraydata + s->requires;
1732 while ((req = *reqp++) != 0)
1734 if (req == SOLVABLE_PREREQMARKER)
1736 r = providedbyinstalled(pool, map, req, 0, 0);
1739 /* decided and miss */
1743 m |= r; /* 1 | 9 | 16 | 17 */
1752 int ispatch = 0; /* see solver.c patch handling */
1754 if (!strncmp("patch:", id2str(pool, s->name), 6))
1756 conp = s->repo->idarraydata + s->conflicts;
1757 while ((con = *conp++) != 0)
1759 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1764 if ((m == 1 || m == 17) && ISRELDEP(con))
1766 con = dep2name(pool, con);
1767 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1772 continue; /* found a conflict */
1775 if (s->repo && s->repo != oldinstalled)
1777 Id p2, obs, *obsp, *pp;
1781 obsp = s->repo->idarraydata + s->obsoletes;
1782 while ((obs = *obsp++) != 0)
1784 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1793 FOR_PROVIDES(p2, pp, s->name)
1795 s2 = pool->solvables + p2;
1796 if (s2->name == s->name && (map[p2] & 1) != 0)
1813 queue_init_clone(res, pkgs);
1814 for (i = 0; i < pkgs->count; i++)
1816 m = map[pkgs->elements[i]];
1823 res->elements[i] = r;
1829 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1831 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1835 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1837 if (entry == SOLVID_POS && pool->pos.repo)
1838 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1841 return solvable_lookup_str(pool->solvables + entry, keyname);
1845 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1847 if (entry == SOLVID_POS && pool->pos.repo)
1849 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1850 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1851 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1855 return solvable_lookup_id(pool->solvables + entry, keyname);
1859 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1861 if (entry == SOLVID_POS && pool->pos.repo)
1864 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1870 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1874 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1876 if (entry == SOLVID_POS && pool->pos.repo)
1877 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1880 return solvable_lookup_void(pool->solvables + entry, keyname);
1883 const unsigned char *
1884 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1886 if (entry == SOLVID_POS && pool->pos.repo)
1887 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1890 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1894 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1896 if (entry == SOLVID_POS && pool->pos.repo)
1898 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1899 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
1903 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1907 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
1909 int hadhashes = pool->relhashtbl ? 1 : 0;
1915 if (!conflicts->count)
1917 pool_freewhatprovides(pool);
1918 for (i = 0; i < conflicts->count; i += 5)
1920 fn = conflicts->elements[i];
1921 p = conflicts->elements[i + 1];
1922 md5 = conflicts->elements[i + 2];
1923 q = conflicts->elements[i + 3];
1924 id = rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
1925 s = pool->solvables + p;
1928 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
1929 s = pool->solvables + q;
1932 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1935 pool_freeidhashes(pool);