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;
77 /* free all the resources of our pool */
83 pool_freewhatprovides(pool);
84 pool_freeidhashes(pool);
85 repo_freeallrepos(pool, 1);
86 sat_free(pool->id2arch);
87 sat_free(pool->solvables);
88 stringpool_free(&pool->ss);
90 queue_free(&pool->vendormap);
91 for (i = 0; i < POOL_TMPSPACEBUF; i++)
92 sat_free(pool->tmpspacebuf[i]);
93 for (i = 0; i < pool->nlanguages; i++)
94 free((char *)pool->languages[i]);
95 sat_free(pool->languages);
96 sat_free(pool->languagecache);
100 #ifdef MULTI_SEMANTICS
102 pool_setdisttype(Pool *pool, int disttype)
104 pool->disttype = disttype;
109 pool_add_solvable(Pool *pool)
111 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
112 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
113 return pool->nsolvables++;
117 pool_add_solvable_block(Pool *pool, int count)
119 Id nsolvables = pool->nsolvables;
122 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
123 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
124 pool->nsolvables += count;
129 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
133 if (reuseids && start + count == pool->nsolvables)
135 /* might want to shrink solvable array */
136 pool->nsolvables = start;
139 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
144 pool_set_installed(Pool *pool, Repo *installed)
146 if (pool->installed == installed)
148 pool->installed = installed;
149 pool_freewhatprovides(pool);
153 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
158 oa = pool->whatprovides[*(Id *)ap];
159 ob = pool->whatprovides[*(Id *)bp];
161 return *(Id *)ap - *(Id *)bp;
166 da = pool->whatprovidesdata + oa;
167 db = pool->whatprovidesdata + ob;
169 if ((r = (*da++ - *db++)) != 0)
173 return *(Id *)ap - *(Id *)bp;
177 * pool_shrink_whatprovides - unify whatprovides data
179 * whatprovides_rel must be empty for this to work!
183 pool_shrink_whatprovides(Pool *pool)
187 Id lastid, *last, *dp, *lp;
191 if (pool->ss.nstrings < 3)
193 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
194 for (id = 0; id < pool->ss.nstrings; id++)
196 sat_sort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
199 for (i = 1; i < pool->ss.nstrings; i++)
202 o = pool->whatprovides[id];
203 if (o == 0 || o == 1)
205 dp = pool->whatprovidesdata + o;
219 pool->whatprovides[id] = -lastid;
223 last = pool->whatprovidesdata + o;
227 dp = pool->whatprovidesdata + 2;
228 for (id = 1; id < pool->ss.nstrings; id++)
230 o = pool->whatprovides[id];
231 if (o == 0 || o == 1)
238 pool->whatprovides[id] = pool->whatprovides[i];
241 lp = pool->whatprovidesdata + o;
244 pool->whatprovides[id] = dp - pool->whatprovidesdata;
245 while ((*dp++ = *lp++) != 0)
248 o = dp - pool->whatprovidesdata;
249 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
250 if (pool->whatprovidesdataoff == o)
252 r = pool->whatprovidesdataoff - o;
253 pool->whatprovidesdataoff = o;
254 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
255 if (r > pool->whatprovidesdataleft)
256 r = pool->whatprovidesdataleft;
257 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
262 * pool_createwhatprovides()
264 * create hashes over pool of solvables to ease provide lookups
268 pool_createwhatprovides(Pool *pool)
270 int i, num, np, extra;
275 Offset *whatprovides;
276 Id *whatprovidesdata, *d;
277 Repo *installed = pool->installed;
281 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
282 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
284 pool_freeidhashes(pool); /* XXX: should not be here! */
285 pool_freewhatprovides(pool);
286 num = pool->ss.nstrings;
287 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
288 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
290 /* count providers for each name */
291 for (i = pool->nsolvables - 1; i > 0; i--)
294 s = pool->solvables + i;
295 if (!s->provides || !s->repo || s->repo->disabled)
297 /* we always need the installed solvable in the whatprovides data,
298 otherwise obsoletes/conflicts on them won't work */
299 if (s->repo != installed && !pool_installable(pool, s))
301 pp = s->repo->idarraydata + s->provides;
302 while ((id = *pp++) != 0)
306 Reldep *rd = GETRELDEP(pool, id);
309 whatprovides[id]++; /* inc count of providers */
313 off = 2; /* first entry is undef, second is empty list */
314 np = 0; /* number of names provided */
315 for (i = 0, idp = whatprovides; i < num; i++, idp++)
318 if (!n) /* no providers */
320 off += n; /* make space for all providers */
321 *idp = off++; /* now idp points to terminating zero */
322 np++; /* inc # of provider 'slots' for stats */
325 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
327 /* reserve some space for relation data */
328 extra = 2 * pool->nrels;
332 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
334 /* alloc space for all providers + extra */
335 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
337 /* now fill data for all provides */
338 for (i = pool->nsolvables - 1; i > 0; i--)
341 s = pool->solvables + i;
342 if (!s->provides || !s->repo || s->repo->disabled)
344 if (s->repo != installed && !pool_installable(pool, s))
347 /* for all provides of this solvable */
348 pp = s->repo->idarraydata + s->provides;
349 while ((id = *pp++) != 0)
353 Reldep *rd = GETRELDEP(pool, id);
356 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
357 if (*d != i) /* don't add same solvable twice */
364 pool->whatprovidesdata = whatprovidesdata;
365 pool->whatprovidesdataoff = off;
366 pool->whatprovidesdataleft = extra;
367 pool_shrink_whatprovides(pool);
368 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)));
369 POOL_DEBUG(SAT_DEBUG_STATS, "createwhatprovides took %d ms\n", sat_timems(now));
373 * free all of our whatprovides data
374 * be careful, everything internalized with pool_queuetowhatprovides is
378 pool_freewhatprovides(Pool *pool)
380 pool->whatprovides = sat_free(pool->whatprovides);
381 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
382 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
383 pool->whatprovidesdataoff = 0;
384 pool->whatprovidesdataleft = 0;
388 /******************************************************************************/
391 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
393 * on-demand filling of provider information
394 * move queue data into whatprovidesdata
396 * returns: Offset into whatprovides
400 pool_queuetowhatprovides(Pool *pool, Queue *q)
403 int count = q->count;
405 if (count == 0) /* queue empty -> 1 */
408 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
409 if (pool->whatprovidesdataleft < count + 1)
411 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
412 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
413 pool->whatprovidesdataleft = count + 4096;
416 /* copy queue to next free slot */
417 off = pool->whatprovidesdataoff;
418 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
420 /* adapt count and ID_NULL-terminate */
421 pool->whatprovidesdataoff += count;
422 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
423 pool->whatprovidesdataleft -= count + 1;
429 /*************************************************************************/
431 #if defined(MULTI_SEMANTICS)
432 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
433 #elif defined(DEBIAN_SEMANTICS)
434 # define EVRCMP_DEPCMP EVRCMP_COMPARE
436 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
439 /* check if a package's nevr matches a dependency */
442 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
444 Reldep *rd = GETRELDEP(pool, d);
447 int flags = rd->flags;
456 return pool_match_nevr(pool, s, name);
458 if (pool_match_nevr(pool, s, name))
460 return pool_match_nevr(pool, s, evr);
463 if (!pool_match_nevr(pool, s, name))
465 return pool_match_nevr(pool, s, evr);
470 if (!pool_match_nevr(pool, s, name))
473 return flags & 2 ? 1 : 0;
478 if (flags != 2 && flags != 5)
480 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP)))) != 0)
485 /* match (flags, evr) against provider (pflags, pevr) */
487 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
489 if (!pflags || !flags || pflags >= 8 || flags >= 8)
491 if (flags == 7 || pflags == 7)
492 return 1; /* rel provides every version */
493 if ((pflags & flags & 5) != 0)
494 return 1; /* both rels show in the same direction */
497 if ((pflags & flags & 2) != 0)
498 return 1; /* both have '=', match */
502 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
503 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_DEPCMP)))) != 0)
509 /* match two dependencies (d1 = provider) */
512 pool_match_dep(Pool *pool, Id d1, Id d2)
522 rd2 = GETRELDEP(pool, d2);
523 return pool_match_dep(pool, d1, rd2->name);
525 rd1 = GETRELDEP(pool, d1);
528 return pool_match_dep(pool, rd1->name, d2);
530 rd2 = GETRELDEP(pool, d2);
531 /* first match name */
532 if (!pool_match_dep(pool, rd1->name, rd2->name))
534 /* name matches, check flags and evr */
535 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
541 * add packages fulfilling the relation to whatprovides array
542 * no exact providers, do range match
547 pool_addrelproviders(Pool *pool, Id d)
549 Reldep *rd = GETRELDEP(pool, d);
555 int flags = rd->flags;
557 Id p, wp, *pp, *pp2, *pp3;
560 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
565 pp = pool_whatprovides_ptr(pool, name);
566 pp2 = pool_whatprovides_ptr(pool, evr);
567 while ((p = *pp++) != 0)
569 for (pp3 = pp2; *pp3;)
572 queue_push(&plist, p);
578 pp = pool_whatprovides_ptr(pool, name);
579 while ((p = *pp++) != 0)
580 queue_push(&plist, p);
581 pp = pool_whatprovides_ptr(pool, evr);
582 while ((p = *pp++) != 0)
583 queue_pushunique(&plist, p);
586 if (name == NAMESPACE_OTHERPROVIDERS)
588 wp = pool_whatprovides(pool, evr);
589 pool->whatprovides_rel[d] = wp;
592 if (pool->nscallback)
594 /* ask callback which packages provide the dependency
596 * 1: the system (aka SYSTEMSOLVABLE)
597 * >1: a set of packages, stored as offset on whatprovidesdata
599 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
603 pool->whatprovides_rel[d] = p;
607 queue_push(&plist, SYSTEMSOLVABLE);
611 /* small hack: make it possible to match <pkg>.src
612 * we have to iterate over the solvables as src packages do not
613 * provide anything, thus they are not indexed in our
614 * whatprovides hash */
618 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
620 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
622 if (pool_match_nevr(pool, s, name))
623 queue_push(&plist, p);
627 wp = pool_whatprovides(pool, name);
628 pp = pool->whatprovidesdata + wp;
629 while ((p = *pp++) != 0)
631 Solvable *s = pool->solvables + p;
633 queue_push(&plist, p);
639 /* all solvables match, no need to create a new list */
640 pool->whatprovides_rel[d] = wp;
644 case REL_FILECONFLICT:
645 pp = pool_whatprovides_ptr(pool, name);
646 while ((p = *pp++) != 0)
648 Id origd = MAKERELDEP(d);
649 Solvable *s = pool->solvables + p;
652 pidp = s->repo->idarraydata + s->provides;
653 while ((pid = *pidp++) != 0)
657 queue_push(&plist, p);
664 /* convert to whatprovides id */
666 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
668 if (flags && flags < 8)
670 pp = pool_whatprovides_ptr(pool, name);
671 while (ISRELDEP(name))
673 rd = GETRELDEP(pool, name);
676 while ((p = *pp++) != 0)
678 Solvable *s = pool->solvables + p;
680 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, s->name));
684 /* no provides - check nevr */
685 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
686 queue_push(&plist, p);
689 /* solvable p provides name in some rels */
690 pidp = s->repo->idarraydata + s->provides;
691 while ((pid = *pidp++) != 0)
695 #if defined(MULTI_SEMANTICS)
696 if (pool->disttype == DISTTYPE_DEB)
700 #elif defined(DEBIAN_SEMANTICS)
701 continue; /* unversioned provides can
702 * never match versioned deps */
704 break; /* yes, provides all versions */
708 continue; /* wrong provides name */
709 prd = GETRELDEP(pool, pid);
710 if (prd->name != name)
711 continue; /* wrong provides name */
712 /* right package, both deps are rels. check flags/evr */
713 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
717 continue; /* none of the providers matched */
718 queue_push(&plist, p);
720 /* make our system solvable provide all unknown rpmlib() stuff */
721 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
722 queue_push(&plist, SYSTEMSOLVABLE);
724 /* add providers to whatprovides */
726 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
728 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
731 return pool->whatprovides_rel[d];
734 /*************************************************************************/
737 pool_debug(Pool *pool, int type, const char *format, ...)
742 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
744 if ((pool->debugmask & type) == 0)
747 va_start(args, format);
748 if (!pool->debugcallback)
750 if ((type & (SAT_FATAL|SAT_ERROR)) == 0 && !(pool->debugmask & SAT_DEBUG_TO_STDERR))
751 vprintf(format, args);
753 vfprintf(stderr, format, args);
756 vsnprintf(buf, sizeof(buf), format, args);
757 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
761 pool_setdebuglevel(Pool *pool, int level)
763 int mask = SAT_DEBUG_RESULT;
765 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE|SAT_DEBUG_SOLVER|SAT_DEBUG_TRANSACTION;
767 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
769 mask |= SAT_DEBUG_PROPAGATE;
771 mask |= SAT_DEBUG_RULE_CREATION;
773 mask |= SAT_DEBUG_SCHUBI;
774 mask |= pool->debugmask & SAT_DEBUG_TO_STDERR; /* keep bit */
775 pool->debugmask = mask;
778 /*************************************************************************/
788 #define SEARCHFILES_BLOCK 127
791 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
795 struct searchfiles *csf;
797 while ((dep = *ida++) != 0)
800 while (ISRELDEP(dep))
803 sid = pool->ss.nstrings + GETRELID(dep);
804 if (MAPTST(&csf->seen, sid))
809 MAPSET(&csf->seen, sid);
810 rd = GETRELDEP(pool, dep);
813 else if (rd->flags == REL_NAMESPACE)
815 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
818 if (!csf || MAPTST(&csf->seen, sid))
823 MAPSET(&csf->seen, sid);
827 else if (rd->flags == REL_FILECONFLICT)
837 pool_addfileprovides_dep(pool, ids, csf, isf);
843 if (MAPTST(&csf->seen, dep))
845 MAPSET(&csf->seen, dep);
846 s = id2str(pool, dep);
849 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
850 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
851 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
852 csf->ids[csf->nfiles] = dep;
853 sr = strrchr(s, '/');
854 csf->names[csf->nfiles] = strdup(sr + 1);
855 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
857 strncpy(csf->dirs[csf->nfiles], s, sr - s);
858 csf->dirs[csf->nfiles][sr - s] = 0;
863 struct addfileprovides_cbdata {
877 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
879 struct addfileprovides_cbdata *cbd = cbdata;
882 if (!cbd->useddirs.size)
884 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
885 for (i = 0; i < cbd->nfiles; i++)
888 if (MAPTST(&cbd->providedids, cbd->ids[i]))
893 did = repodata_str2dir(data, cbd->dirs[i], 0);
896 MAPSET(&cbd->useddirs, did);
899 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
901 for (i = 0; i < cbd->nfiles; i++)
903 if (cbd->dids[i] != value->id)
905 if (!strcmp(cbd->names[i], value->str))
908 if (i == cbd->nfiles)
910 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
915 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
921 int i, j, repoid, repodataid;
922 int provstart, provend;
924 int ndone, incomplete;
929 cbd->nfiles = sf->nfiles;
931 cbd->dirs = sf->dirs;
932 cbd->names = sf->names;
933 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
934 map_init(&cbd->providedids, pool->ss.nstrings);
937 repo = repoonly ? repoonly : pool->repos[0];
938 map_init(&donemap, pool->nsolvables);
939 queue_init(&fileprovidesq);
940 provstart = provend = 0;
945 if (repoonly || ++repoid == pool->nrepos)
947 repo = pool->repos[repoid];
951 for (data = repo->repodata, repodataid = 0; repodataid < repo->nrepodata; repodataid++, data++)
953 if (ndone >= repo->nsolvables)
956 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
958 map_empty(&cbd->providedids);
959 for (i = 0; i < fileprovidesq.count; i++)
960 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
961 provstart = data->start;
963 for (i = 0; i < cbd->nfiles; i++)
964 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
966 if (i == cbd->nfiles)
968 /* great! no need to search files */
969 for (p = data->start; p < data->end; p++)
970 if (pool->solvables[p].repo == repo)
972 if (MAPTST(&donemap, p))
981 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
984 if (data->start < provstart || data->end > provend)
986 map_empty(&cbd->providedids);
987 provstart = provend = 0;
990 /* check if the data is incomplete */
992 if (data->state == REPODATA_AVAILABLE)
994 for (j = 1; j < data->nkeys; j++)
995 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1000 for (i = 0; i < cbd->nfiles; i++)
1001 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1002 printf("need complete filelist because of %s\n", id2str(pool, cbd->ids[i]));
1004 for (i = 0; i < cbd->nfiles; i++)
1005 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1007 if (i < cbd->nfiles)
1013 map_init(&cbd->useddirs, 0);
1014 for (p = data->start; p < data->end; p++)
1015 if (pool->solvables[p].repo == repo)
1017 if (MAPTST(&donemap, p))
1019 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1022 MAPSET(&donemap, p);
1026 map_free(&cbd->useddirs);
1029 if (repoonly || ++repoid == pool->nrepos)
1031 repo = pool->repos[repoid];
1034 queue_free(&fileprovidesq);
1035 map_free(&cbd->providedids);
1039 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
1043 struct searchfiles sf, isf, *isfp;
1044 struct addfileprovides_cbdata cbd;
1048 now = sat_timems(0);
1049 memset(&sf, 0, sizeof(sf));
1050 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1051 memset(&isf, 0, sizeof(isf));
1052 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1054 isfp = installed ? &isf : 0;
1055 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1061 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1063 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1065 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1067 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1069 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1071 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1073 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1076 map_free(&isf.seen);
1077 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1084 for (i = 0; i < sf.nfiles; i++)
1085 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
1087 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1090 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1091 sf.ids[sf.nfiles] = 0;
1096 for (i = 0; i < sf.nfiles; i++)
1098 sat_free(sf.dirs[i]);
1099 sat_free(sf.names[i]);
1107 for (i = 0; i < isf.nfiles; i++)
1108 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
1111 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1113 for (i = 0; i < isf.nfiles; i++)
1115 sat_free(isf.dirs[i]);
1116 sat_free(isf.names[i]);
1119 sat_free(isf.names);
1122 pool_freewhatprovides(pool); /* as we have added provides */
1123 POOL_DEBUG(SAT_DEBUG_STATS, "addfileprovides took %d ms\n", sat_timems(now));
1127 pool_addfileprovides(Pool *pool)
1129 pool_addfileprovides_ids(pool, pool->installed, 0);
1133 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)
1137 if (pool->solvables[p].repo)
1138 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1141 /* FIXME: obey callback return value! */
1142 for (p = 1; p < pool->nsolvables; p++)
1143 if (pool->solvables[p].repo)
1144 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1148 pool_clear_pos(Pool *pool)
1150 memset(&pool->pos, 0, sizeof(pool->pos));
1155 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1159 pool->languagecache = sat_free(pool->languagecache);
1160 pool->languagecacheother = 0;
1161 if (pool->nlanguages)
1163 for (i = 0; i < pool->nlanguages; i++)
1164 free((char *)pool->languages[i]);
1165 free(pool->languages);
1167 pool->nlanguages = nlanguages;
1170 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1171 for (i = 0; i < pool->nlanguages; i++)
1172 pool->languages[i] = strdup(languages[i]);
1176 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1184 n = id2str(pool, id);
1185 l = strlen(n) + strlen(lang) + 2;
1186 if (l > sizeof(buf))
1187 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1190 sprintf(p, "%s:%s", n, lang);
1191 id = str2id(pool, p, create);
1198 pool_alloctmpspace(Pool *pool, int len)
1200 int n = pool->tmpspacen;
1203 if (len > pool->tmpspacelen[n])
1205 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1206 pool->tmpspacelen[n] = len + 32;
1208 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1209 return pool->tmpspacebuf[n];
1213 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1217 l1 = str1 ? strlen(str1) : 0;
1218 l2 = str2 ? strlen(str2) : 0;
1219 l3 = str3 ? strlen(str3) : 0;
1220 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1241 /*******************************************************************/
1253 struct mptree *mptree;
1264 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1266 struct ducbdata *cbd = cbdata;
1269 if (data != cbd->olddata)
1271 Id dn, mp, comp, *dirmap, *dirs;
1273 const char *compstr;
1274 struct mptree *mptree;
1276 /* create map from dir to mptree */
1277 cbd->dirmap = sat_free(cbd->dirmap);
1279 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1280 mptree = cbd->mptree;
1282 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1296 if (!mptree[mp].child)
1301 if (data->localpool)
1302 compstr = stringpool_id2str(&data->spool, comp);
1304 compstr = id2str(data->repo->pool, comp);
1305 compl = strlen(compstr);
1306 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1307 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1309 dirmap[dn] = i ? i : -mp;
1311 /* change dirmap to point to mountpoint instead of mptree */
1312 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1315 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1317 cbd->dirmap = dirmap;
1318 cbd->nmap = data->dirpool.ndirs;
1319 cbd->olddata = data;
1322 if (value->id < 0 || value->id >= cbd->nmap)
1324 mp = cbd->dirmap[value->id];
1327 if (cbd->addsub > 0)
1329 cbd->mps[mp].kbytes += value->num;
1330 cbd->mps[mp].files += value->num2;
1334 cbd->mps[mp].kbytes -= value->num;
1335 cbd->mps[mp].files -= value->num2;
1341 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1344 if (mptree[pos].mountpoint == -1)
1345 mptree[pos].mountpoint = mountpoint;
1347 mountpoint = mptree[pos].mountpoint;
1348 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1349 propagate_mountpoints(mptree, i, mountpoint);
1352 #define MPTREE_BLOCK 15
1355 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1358 const char *path, *compstr;
1359 struct mptree *mptree;
1363 struct ducbdata cbd;
1367 Repo *oldinstalled = pool->installed;
1369 memset(&ignoredu, 0, sizeof(ignoredu));
1376 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1379 mptree[0].sibling = 0;
1380 mptree[0].child = 0;
1382 mptree[0].compl = 0;
1383 mptree[0].mountpoint = -1;
1386 /* create component tree */
1387 for (mp = 0; mp < nmps; mp++)
1392 path = mps[mp].path;
1397 if ((p = strchr(path, '/')) == 0)
1400 compl = strlen(compstr);
1411 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1412 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1416 /* create new node */
1417 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1419 mptree[i].sibling = mptree[pos].child;
1420 mptree[i].child = 0;
1421 mptree[i].comp = compstr;
1422 mptree[i].compl = compl;
1423 mptree[i].mountpoint = -1;
1424 mptree[pos].child = i;
1428 mptree[pos].mountpoint = mp;
1431 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1434 for (i = 0; i < nmptree; i++)
1436 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1437 printf("#%d child: %d\n", i, mptree[i].child);
1438 printf("#%d comp: %s\n", i, mptree[i].comp);
1439 printf("#%d compl: %d\n", i, mptree[i].compl);
1440 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1444 cbd.mptree = mptree;
1446 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1448 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1450 if (!MAPTST(installedmap, sp))
1453 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1454 if (!cbd.hasdu && oldinstalled)
1457 /* no du data available, ignore data of all installed solvables we obsolete */
1459 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1462 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1463 while ((obs = *obsp++) != 0)
1464 FOR_PROVIDES(op, opp, obs)
1465 if (op >= oldinstalled->start && op < oldinstalled->end)
1466 MAPSET(&ignoredu, op - oldinstalled->start);
1468 FOR_PROVIDES(op, opp, s->name)
1469 if (pool->solvables[op].name == s->name)
1470 if (op >= oldinstalled->start && op < oldinstalled->end)
1471 MAPSET(&ignoredu, op - oldinstalled->start);
1477 /* assumes we allways have du data for installed solvables */
1478 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1480 if (MAPTST(installedmap, sp))
1482 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1484 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1488 map_free(&ignoredu);
1489 sat_free(cbd.dirmap);
1494 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1499 Repo *oldinstalled = pool->installed;
1501 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1503 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1505 if (!MAPTST(installedmap, sp))
1507 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1511 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1513 if (MAPTST(installedmap, sp))
1515 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1523 * 2: conflicts with installed
1524 * 8: interesting (only true if installed)
1528 static inline Id dep2name(Pool *pool, Id dep)
1530 while (ISRELDEP(dep))
1532 Reldep *rd = rd = GETRELDEP(pool, dep);
1538 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1541 Solvable *sn = pool->solvables + n;
1543 FOR_PROVIDES(p, pp, sn->name)
1545 Solvable *s = pool->solvables + p;
1546 if (s->name != sn->name || s->arch != sn->arch)
1548 if ((map[p] & 9) != 9)
1550 if (pool_match_nevr(pool, pool->solvables + p, con))
1552 return 1; /* found installed package that doesn't conflict */
1557 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1561 FOR_PROVIDES(p, pp, dep)
1563 if (p == SYSTEMSOLVABLE)
1564 return 1; /* always boring, as never constraining */
1565 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1567 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1568 if (providedbyinstalled_multiversion(pool, map, p, dep))
1570 if ((map[p] & 9) == 9)
1578 * pool_trivial_installable - calculate if a set of solvables is
1579 * trivial installable without any other installs/deinstalls of
1580 * packages not belonging to the set.
1582 * the state is returned in the result queue:
1583 * 1: solvable is installable without any other package changes
1584 * 0: solvable is not installable
1585 * -1: solvable is installable, but doesn't constrain any installed packages
1589 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1592 Id p, *dp, con, *conp, req, *reqp;
1596 map = sat_calloc(pool->nsolvables, 1);
1597 for (p = 1; p < pool->nsolvables; p++)
1599 if (!MAPTST(installedmap, p))
1602 s = pool->solvables + p;
1605 conp = s->repo->idarraydata + s->conflicts;
1606 while ((con = *conp++) != 0)
1608 dp = pool_whatprovides_ptr(pool, con);
1610 map[p] |= 2; /* XXX: self conflict ? */
1613 for (i = 0; i < pkgs->count; i++)
1614 map[pkgs->elements[i]] = 16;
1616 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1618 if (i == pkgs->count)
1620 p = pkgs->elements[i];
1621 if ((map[p] & 16) == 0)
1623 if ((map[p] & 2) != 0)
1628 s = pool->solvables + p;
1632 reqp = s->repo->idarraydata + s->requires;
1633 while ((req = *reqp++) != 0)
1635 if (req == SOLVABLE_PREREQMARKER)
1637 r = providedbyinstalled(pool, map, req, 0, 0);
1640 /* decided and miss */
1644 m |= r; /* 1 | 9 | 16 | 17 */
1653 int ispatch = 0; /* see solver.c patch handling */
1655 if (!strncmp("patch:", id2str(pool, s->name), 6))
1657 conp = s->repo->idarraydata + s->conflicts;
1658 while ((con = *conp++) != 0)
1660 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1665 if ((m == 1 || m == 17) && ISRELDEP(con))
1667 con = dep2name(pool, con);
1668 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1673 continue; /* found a conflict */
1676 if (s->repo && s->repo != oldinstalled)
1678 Id p2, obs, *obsp, *pp;
1682 obsp = s->repo->idarraydata + s->obsoletes;
1683 while ((obs = *obsp++) != 0)
1685 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1694 FOR_PROVIDES(p2, pp, s->name)
1696 s2 = pool->solvables + p2;
1697 if (s2->name == s->name && (map[p2] & 1) != 0)
1714 queue_init_clone(res, pkgs);
1715 for (i = 0; i < pkgs->count; i++)
1717 m = map[pkgs->elements[i]];
1724 res->elements[i] = r;
1730 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1732 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1736 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1738 if (entry == SOLVID_POS && pool->pos.repo)
1739 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1742 return solvable_lookup_str(pool->solvables + entry, keyname);
1746 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1748 if (entry == SOLVID_POS && pool->pos.repo)
1750 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1751 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1752 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1756 return solvable_lookup_id(pool->solvables + entry, keyname);
1760 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1762 if (entry == SOLVID_POS && pool->pos.repo)
1765 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1771 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1775 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1777 if (entry == SOLVID_POS && pool->pos.repo)
1778 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1781 return solvable_lookup_void(pool->solvables + entry, keyname);
1784 const unsigned char *
1785 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1787 if (entry == SOLVID_POS && pool->pos.repo)
1788 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1791 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1795 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1797 if (entry == SOLVID_POS && pool->pos.repo)
1799 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1800 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
1804 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1808 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
1810 int hadhashes = pool->relhashtbl ? 1 : 0;
1816 if (!conflicts->count)
1818 pool_freewhatprovides(pool);
1819 for (i = 0; i < conflicts->count; i += 5)
1821 fn = conflicts->elements[i];
1822 p = conflicts->elements[i + 1];
1823 md5 = conflicts->elements[i + 2];
1824 q = conflicts->elements[i + 3];
1825 id = rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
1826 s = pool->solvables + p;
1829 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
1830 s = pool->solvables + q;
1833 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1836 pool_freeidhashes(pool);