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 pool_setvendorclasses(pool, 0);
91 queue_free(&pool->vendormap);
92 for (i = 0; i < POOL_TMPSPACEBUF; i++)
93 sat_free(pool->tmpspacebuf[i]);
94 for (i = 0; i < pool->nlanguages; i++)
95 free((char *)pool->languages[i]);
96 sat_free(pool->languages);
97 sat_free(pool->languagecache);
101 #ifdef MULTI_SEMANTICS
103 pool_setdisttype(Pool *pool, int disttype)
105 pool->disttype = disttype;
110 pool_add_solvable(Pool *pool)
112 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
113 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
114 return pool->nsolvables++;
118 pool_add_solvable_block(Pool *pool, int count)
120 Id nsolvables = pool->nsolvables;
123 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
124 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
125 pool->nsolvables += count;
130 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
134 if (reuseids && start + count == pool->nsolvables)
136 /* might want to shrink solvable array */
137 pool->nsolvables = start;
140 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
145 pool_set_installed(Pool *pool, Repo *installed)
147 if (pool->installed == installed)
149 pool->installed = installed;
150 pool_freewhatprovides(pool);
154 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
159 oa = pool->whatprovides[*(Id *)ap];
160 ob = pool->whatprovides[*(Id *)bp];
162 return *(Id *)ap - *(Id *)bp;
167 da = pool->whatprovidesdata + oa;
168 db = pool->whatprovidesdata + ob;
170 if ((r = (*da++ - *db++)) != 0)
174 return *(Id *)ap - *(Id *)bp;
178 * pool_shrink_whatprovides - unify whatprovides data
180 * whatprovides_rel must be empty for this to work!
184 pool_shrink_whatprovides(Pool *pool)
188 Id lastid, *last, *dp, *lp;
192 if (pool->ss.nstrings < 3)
194 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
195 for (id = 0; id < pool->ss.nstrings; id++)
197 sat_sort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
200 for (i = 1; i < pool->ss.nstrings; i++)
203 o = pool->whatprovides[id];
204 if (o == 0 || o == 1)
206 dp = pool->whatprovidesdata + o;
220 pool->whatprovides[id] = -lastid;
224 last = pool->whatprovidesdata + o;
228 dp = pool->whatprovidesdata + 2;
229 for (id = 1; id < pool->ss.nstrings; id++)
231 o = pool->whatprovides[id];
232 if (o == 0 || o == 1)
239 pool->whatprovides[id] = pool->whatprovides[i];
242 lp = pool->whatprovidesdata + o;
245 pool->whatprovides[id] = dp - pool->whatprovidesdata;
246 while ((*dp++ = *lp++) != 0)
249 o = dp - pool->whatprovidesdata;
250 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
251 if (pool->whatprovidesdataoff == o)
253 r = pool->whatprovidesdataoff - o;
254 pool->whatprovidesdataoff = o;
255 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
256 if (r > pool->whatprovidesdataleft)
257 r = pool->whatprovidesdataleft;
258 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
263 * pool_createwhatprovides()
265 * create hashes over pool of solvables to ease provide lookups
269 pool_createwhatprovides(Pool *pool)
271 int i, num, np, extra;
276 Offset *whatprovides;
277 Id *whatprovidesdata, *d;
278 Repo *installed = pool->installed;
282 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
283 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
285 pool_freeidhashes(pool); /* XXX: should not be here! */
286 pool_freewhatprovides(pool);
287 num = pool->ss.nstrings;
288 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
289 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
291 /* count providers for each name */
292 for (i = pool->nsolvables - 1; i > 0; i--)
295 s = pool->solvables + i;
296 if (!s->provides || !s->repo || s->repo->disabled)
298 /* we always need the installed solvable in the whatprovides data,
299 otherwise obsoletes/conflicts on them won't work */
300 if (s->repo != installed && !pool_installable(pool, s))
302 pp = s->repo->idarraydata + s->provides;
303 while ((id = *pp++) != 0)
307 Reldep *rd = GETRELDEP(pool, id);
310 whatprovides[id]++; /* inc count of providers */
314 off = 2; /* first entry is undef, second is empty list */
315 np = 0; /* number of names provided */
316 for (i = 0, idp = whatprovides; i < num; i++, idp++)
319 if (!n) /* no providers */
321 off += n; /* make space for all providers */
322 *idp = off++; /* now idp points to terminating zero */
323 np++; /* inc # of provider 'slots' for stats */
326 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
328 /* reserve some space for relation data */
329 extra = 2 * pool->nrels;
333 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
335 /* alloc space for all providers + extra */
336 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
338 /* now fill data for all provides */
339 for (i = pool->nsolvables - 1; i > 0; i--)
342 s = pool->solvables + i;
343 if (!s->provides || !s->repo || s->repo->disabled)
345 if (s->repo != installed && !pool_installable(pool, s))
348 /* for all provides of this solvable */
349 pp = s->repo->idarraydata + s->provides;
350 while ((id = *pp++) != 0)
354 Reldep *rd = GETRELDEP(pool, id);
357 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
358 if (*d != i) /* don't add same solvable twice */
365 pool->whatprovidesdata = whatprovidesdata;
366 pool->whatprovidesdataoff = off;
367 pool->whatprovidesdataleft = extra;
368 pool_shrink_whatprovides(pool);
369 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)));
370 POOL_DEBUG(SAT_DEBUG_STATS, "createwhatprovides took %d ms\n", sat_timems(now));
374 * free all of our whatprovides data
375 * be careful, everything internalized with pool_queuetowhatprovides is
379 pool_freewhatprovides(Pool *pool)
381 pool->whatprovides = sat_free(pool->whatprovides);
382 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
383 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
384 pool->whatprovidesdataoff = 0;
385 pool->whatprovidesdataleft = 0;
389 /******************************************************************************/
392 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
394 * on-demand filling of provider information
395 * move queue data into whatprovidesdata
397 * returns: Offset into whatprovides
401 pool_queuetowhatprovides(Pool *pool, Queue *q)
404 int count = q->count;
406 if (count == 0) /* queue empty -> 1 */
409 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
410 if (pool->whatprovidesdataleft < count + 1)
412 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
413 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
414 pool->whatprovidesdataleft = count + 4096;
417 /* copy queue to next free slot */
418 off = pool->whatprovidesdataoff;
419 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
421 /* adapt count and ID_NULL-terminate */
422 pool->whatprovidesdataoff += count;
423 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
424 pool->whatprovidesdataleft -= count + 1;
430 /*************************************************************************/
432 #if defined(MULTI_SEMANTICS)
433 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
434 #elif defined(DEBIAN_SEMANTICS)
435 # define EVRCMP_DEPCMP EVRCMP_COMPARE
437 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
440 /* check if a package's nevr matches a dependency */
443 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
445 Reldep *rd = GETRELDEP(pool, d);
448 int flags = rd->flags;
457 return pool_match_nevr(pool, s, name);
459 if (pool_match_nevr(pool, s, name))
461 return pool_match_nevr(pool, s, evr);
464 if (!pool_match_nevr(pool, s, name))
466 return pool_match_nevr(pool, s, evr);
471 if (!pool_match_nevr(pool, s, name))
474 return flags & 2 ? 1 : 0;
479 if (flags != 2 && flags != 5)
481 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP)))) != 0)
486 /* match (flags, evr) against provider (pflags, pevr) */
488 pool_match_flags_evr(Pool *pool, int pflags, Id pevr, int flags, int evr)
490 if (!pflags || !flags || pflags >= 8 || flags >= 8)
492 if (flags == 7 || pflags == 7)
493 return 1; /* rel provides every version */
494 if ((pflags & flags & 5) != 0)
495 return 1; /* both rels show in the same direction */
498 if ((pflags & flags & 2) != 0)
499 return 1; /* both have '=', match */
503 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
504 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_DEPCMP)))) != 0)
510 /* match two dependencies (d1 = provider) */
513 pool_match_dep(Pool *pool, Id d1, Id d2)
523 rd2 = GETRELDEP(pool, d2);
524 return pool_match_dep(pool, d1, rd2->name);
526 rd1 = GETRELDEP(pool, d1);
529 return pool_match_dep(pool, rd1->name, d2);
531 rd2 = GETRELDEP(pool, d2);
532 /* first match name */
533 if (!pool_match_dep(pool, rd1->name, rd2->name))
535 /* name matches, check flags and evr */
536 return pool_match_flags_evr(pool, rd1->flags, rd1->evr, rd2->flags, rd2->evr);
542 * add packages fulfilling the relation to whatprovides array
543 * no exact providers, do range match
548 pool_addrelproviders(Pool *pool, Id d)
550 Reldep *rd = GETRELDEP(pool, d);
556 int flags = rd->flags;
561 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
565 /* special relation */
573 wp = pool_whatprovides(pool, name);
574 pp2 = pool_whatprovides_ptr(pool, evr);
575 pp = pool->whatprovidesdata + wp;
576 while ((p = *pp++) != 0)
578 for (pp3 = pp2; *pp3; pp3++)
582 queue_push(&plist, p); /* found it */
588 wp = pool_whatprovides(pool, name);
589 pp = pool->whatprovidesdata + wp;
591 wp = pool_whatprovides(pool, evr);
595 while ((p = *pp++) != 0)
596 queue_push(&plist, p);
598 pp = pool_whatprovides_ptr(pool, evr);
599 while ((p = *pp++) != 0)
600 queue_pushunique(&plist, p);
601 if (plist.count != cnt)
606 if (name == NAMESPACE_OTHERPROVIDERS)
608 wp = pool_whatprovides(pool, evr);
611 if (pool->nscallback)
613 /* ask callback which packages provide the dependency
615 * 1: the system (aka SYSTEMSOLVABLE)
616 * >1: set of packages, stored as offset on whatprovidesdata
618 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
622 queue_push(&plist, SYSTEMSOLVABLE);
626 /* small hack: make it possible to match <pkg>.src
627 * we have to iterate over the solvables as src packages do not
628 * provide anything, thus they are not indexed in our
629 * whatprovides hash */
633 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
635 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
637 if (pool_match_nevr(pool, s, name))
638 queue_push(&plist, p);
642 wp = pool_whatprovides(pool, name);
643 pp = pool->whatprovidesdata + wp;
644 while ((p = *pp++) != 0)
646 Solvable *s = pool->solvables + p;
648 queue_push(&plist, p);
653 case REL_FILECONFLICT:
654 pp = pool_whatprovides_ptr(pool, name);
655 while ((p = *pp++) != 0)
657 Id origd = MAKERELDEP(d);
658 Solvable *s = pool->solvables + p;
661 pidp = s->repo->idarraydata + s->provides;
662 while ((pid = *pidp++) != 0)
666 queue_push(&plist, p);
674 /* we can reuse an existing entry */
676 pool->whatprovides_rel[d] = wp;
682 /* simple version comparison relation */
684 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
686 pp = pool_whatprovides_ptr(pool, name);
687 while (ISRELDEP(name))
689 rd = GETRELDEP(pool, name);
692 while ((p = *pp++) != 0)
694 Solvable *s = pool->solvables + p;
697 /* no provides - check nevr */
698 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
699 queue_push(&plist, p);
702 /* solvable p provides name in some rels */
703 pidp = s->repo->idarraydata + s->provides;
704 while ((pid = *pidp++) != 0)
708 #if defined(MULTI_SEMANTICS)
709 if (pool->disttype == DISTTYPE_DEB)
713 #elif defined(DEBIAN_SEMANTICS)
714 continue; /* unversioned provides can
715 * never match versioned deps */
717 break; /* yes, provides all versions */
721 continue; /* wrong provides name */
722 prd = GETRELDEP(pool, pid);
723 if (prd->name != name)
724 continue; /* wrong provides name */
725 /* right package, both deps are rels. check flags/evr */
726 if (pool_match_flags_evr(pool, prd->flags, prd->evr, flags, evr))
730 continue; /* none of the providers matched */
731 queue_push(&plist, p);
733 /* make our system solvable provide all unknown rpmlib() stuff */
734 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
735 queue_push(&plist, SYSTEMSOLVABLE);
737 /* add providers to whatprovides */
739 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
741 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
744 return pool->whatprovides_rel[d];
747 /*************************************************************************/
750 pool_debug(Pool *pool, int type, const char *format, ...)
755 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
757 if ((pool->debugmask & type) == 0)
760 va_start(args, format);
761 if (!pool->debugcallback)
763 if ((type & (SAT_FATAL|SAT_ERROR)) == 0 && !(pool->debugmask & SAT_DEBUG_TO_STDERR))
764 vprintf(format, args);
766 vfprintf(stderr, format, args);
769 vsnprintf(buf, sizeof(buf), format, args);
770 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
774 pool_setdebuglevel(Pool *pool, int level)
776 int mask = SAT_DEBUG_RESULT;
778 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE|SAT_DEBUG_SOLVER|SAT_DEBUG_TRANSACTION;
780 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
782 mask |= SAT_DEBUG_PROPAGATE;
784 mask |= SAT_DEBUG_RULE_CREATION;
786 mask |= SAT_DEBUG_SCHUBI;
787 mask |= pool->debugmask & SAT_DEBUG_TO_STDERR; /* keep bit */
788 pool->debugmask = mask;
791 /*************************************************************************/
801 #define SEARCHFILES_BLOCK 127
804 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
808 struct searchfiles *csf;
810 while ((dep = *ida++) != 0)
813 while (ISRELDEP(dep))
816 sid = pool->ss.nstrings + GETRELID(dep);
817 if (MAPTST(&csf->seen, sid))
822 MAPSET(&csf->seen, sid);
823 rd = GETRELDEP(pool, dep);
826 else if (rd->flags == REL_NAMESPACE)
828 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
831 if (!csf || MAPTST(&csf->seen, sid))
836 MAPSET(&csf->seen, sid);
840 else if (rd->flags == REL_FILECONFLICT)
850 pool_addfileprovides_dep(pool, ids, csf, isf);
856 if (MAPTST(&csf->seen, dep))
858 MAPSET(&csf->seen, dep);
859 s = id2str(pool, dep);
862 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
863 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
864 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
865 csf->ids[csf->nfiles] = dep;
866 sr = strrchr(s, '/');
867 csf->names[csf->nfiles] = strdup(sr + 1);
868 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
870 strncpy(csf->dirs[csf->nfiles], s, sr - s);
871 csf->dirs[csf->nfiles][sr - s] = 0;
876 struct addfileprovides_cbdata {
890 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
892 struct addfileprovides_cbdata *cbd = cbdata;
895 if (!cbd->useddirs.size)
897 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
898 for (i = 0; i < cbd->nfiles; i++)
901 if (MAPTST(&cbd->providedids, cbd->ids[i]))
906 did = repodata_str2dir(data, cbd->dirs[i], 0);
909 MAPSET(&cbd->useddirs, did);
912 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
914 for (i = 0; i < cbd->nfiles; i++)
916 if (cbd->dids[i] != value->id)
918 if (!strcmp(cbd->names[i], value->str))
921 if (i == cbd->nfiles)
923 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
928 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
934 int i, j, repoid, repodataid;
935 int provstart, provend;
937 int ndone, incomplete;
942 cbd->nfiles = sf->nfiles;
944 cbd->dirs = sf->dirs;
945 cbd->names = sf->names;
946 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
947 map_init(&cbd->providedids, pool->ss.nstrings);
950 repo = repoonly ? repoonly : pool->repos[0];
951 map_init(&donemap, pool->nsolvables);
952 queue_init(&fileprovidesq);
953 provstart = provend = 0;
958 if (repoonly || ++repoid == pool->nrepos)
960 repo = pool->repos[repoid];
964 for (data = repo->repodata, repodataid = 0; repodataid < repo->nrepodata; repodataid++, data++)
966 if (ndone >= repo->nsolvables)
969 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
971 map_empty(&cbd->providedids);
972 for (i = 0; i < fileprovidesq.count; i++)
973 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
974 provstart = data->start;
976 for (i = 0; i < cbd->nfiles; i++)
977 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
979 if (i == cbd->nfiles)
981 /* great! no need to search files */
982 for (p = data->start; p < data->end; p++)
983 if (pool->solvables[p].repo == repo)
985 if (MAPTST(&donemap, p))
994 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
997 if (data->start < provstart || data->end > provend)
999 map_empty(&cbd->providedids);
1000 provstart = provend = 0;
1003 /* check if the data is incomplete */
1005 if (data->state == REPODATA_AVAILABLE)
1007 for (j = 1; j < data->nkeys; j++)
1008 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1010 if (j < data->nkeys)
1013 for (i = 0; i < cbd->nfiles; i++)
1014 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1015 printf("need complete filelist because of %s\n", id2str(pool, cbd->ids[i]));
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])))
1020 if (i < cbd->nfiles)
1026 map_init(&cbd->useddirs, 0);
1027 for (p = data->start; p < data->end; p++)
1028 if (pool->solvables[p].repo == repo)
1030 if (MAPTST(&donemap, p))
1032 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1035 MAPSET(&donemap, p);
1039 map_free(&cbd->useddirs);
1042 if (repoonly || ++repoid == pool->nrepos)
1044 repo = pool->repos[repoid];
1047 queue_free(&fileprovidesq);
1048 map_free(&cbd->providedids);
1052 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
1056 struct searchfiles sf, isf, *isfp;
1057 struct addfileprovides_cbdata cbd;
1061 now = sat_timems(0);
1062 memset(&sf, 0, sizeof(sf));
1063 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1064 memset(&isf, 0, sizeof(isf));
1065 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1067 isfp = installed ? &isf : 0;
1068 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1074 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1076 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1078 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1080 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1082 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1084 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1086 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1089 map_free(&isf.seen);
1090 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1097 for (i = 0; i < sf.nfiles; i++)
1098 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
1100 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1103 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1104 sf.ids[sf.nfiles] = 0;
1109 for (i = 0; i < sf.nfiles; i++)
1111 sat_free(sf.dirs[i]);
1112 sat_free(sf.names[i]);
1120 for (i = 0; i < isf.nfiles; i++)
1121 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
1124 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1126 for (i = 0; i < isf.nfiles; i++)
1128 sat_free(isf.dirs[i]);
1129 sat_free(isf.names[i]);
1132 sat_free(isf.names);
1135 pool_freewhatprovides(pool); /* as we have added provides */
1136 POOL_DEBUG(SAT_DEBUG_STATS, "addfileprovides took %d ms\n", sat_timems(now));
1140 pool_addfileprovides(Pool *pool)
1142 pool_addfileprovides_ids(pool, pool->installed, 0);
1146 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)
1150 if (pool->solvables[p].repo)
1151 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1154 /* FIXME: obey callback return value! */
1155 for (p = 1; p < pool->nsolvables; p++)
1156 if (pool->solvables[p].repo)
1157 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1161 pool_clear_pos(Pool *pool)
1163 memset(&pool->pos, 0, sizeof(pool->pos));
1168 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1172 pool->languagecache = sat_free(pool->languagecache);
1173 pool->languagecacheother = 0;
1174 if (pool->nlanguages)
1176 for (i = 0; i < pool->nlanguages; i++)
1177 free((char *)pool->languages[i]);
1178 free(pool->languages);
1180 pool->nlanguages = nlanguages;
1183 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1184 for (i = 0; i < pool->nlanguages; i++)
1185 pool->languages[i] = strdup(languages[i]);
1189 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1197 n = id2str(pool, id);
1198 l = strlen(n) + strlen(lang) + 2;
1199 if (l > sizeof(buf))
1200 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1203 sprintf(p, "%s:%s", n, lang);
1204 id = str2id(pool, p, create);
1211 pool_alloctmpspace(Pool *pool, int len)
1213 int n = pool->tmpspacen;
1216 if (len > pool->tmpspacelen[n])
1218 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1219 pool->tmpspacelen[n] = len + 32;
1221 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1222 return pool->tmpspacebuf[n];
1226 pool_alloctmpspace_free(Pool *pool, const char *space, int len)
1231 n = oldn = pool->tmpspacen;
1235 n = POOL_TMPSPACEBUF - 1;
1238 if (pool->tmpspacebuf[n] != space)
1240 if (len > pool->tmpspacelen[n])
1242 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1243 pool->tmpspacelen[n] = len + 32;
1245 return pool->tmpspacebuf[n];
1252 pool_freetmpspace(Pool *pool, const char *space)
1254 int n = pool->tmpspacen;
1257 n = (n + (POOL_TMPSPACEBUF - 1)) % POOL_TMPSPACEBUF;
1258 if (pool->tmpspacebuf[n] == space)
1259 pool->tmpspacen = n;
1263 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1267 l1 = str1 ? strlen(str1) : 0;
1268 l2 = str2 ? strlen(str2) : 0;
1269 l3 = str3 ? strlen(str3) : 0;
1270 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1291 pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3)
1296 l1 = str1 ? strlen(str1) : 0;
1297 l2 = str2 ? strlen(str2) : 0;
1298 l3 = str3 ? strlen(str3) : 0;
1299 str = pool_alloctmpspace_free(pool, str1, l1 + l2 + l3 + 1);
1303 str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1326 pool_bin2hex(Pool *pool, const unsigned char *buf, int len)
1331 s = pool_alloctmpspace(pool, 2 * len + 1);
1332 sat_bin2hex(buf, len, s);
1336 /*******************************************************************/
1348 struct mptree *mptree;
1359 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1361 struct ducbdata *cbd = cbdata;
1364 if (data != cbd->olddata)
1366 Id dn, mp, comp, *dirmap, *dirs;
1368 const char *compstr;
1369 struct mptree *mptree;
1371 /* create map from dir to mptree */
1372 cbd->dirmap = sat_free(cbd->dirmap);
1374 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1375 mptree = cbd->mptree;
1377 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1391 if (!mptree[mp].child)
1396 if (data->localpool)
1397 compstr = stringpool_id2str(&data->spool, comp);
1399 compstr = id2str(data->repo->pool, comp);
1400 compl = strlen(compstr);
1401 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1402 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1404 dirmap[dn] = i ? i : -mp;
1406 /* change dirmap to point to mountpoint instead of mptree */
1407 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1410 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1412 cbd->dirmap = dirmap;
1413 cbd->nmap = data->dirpool.ndirs;
1414 cbd->olddata = data;
1417 if (value->id < 0 || value->id >= cbd->nmap)
1419 mp = cbd->dirmap[value->id];
1422 if (cbd->addsub > 0)
1424 cbd->mps[mp].kbytes += value->num;
1425 cbd->mps[mp].files += value->num2;
1429 cbd->mps[mp].kbytes -= value->num;
1430 cbd->mps[mp].files -= value->num2;
1436 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1439 if (mptree[pos].mountpoint == -1)
1440 mptree[pos].mountpoint = mountpoint;
1442 mountpoint = mptree[pos].mountpoint;
1443 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1444 propagate_mountpoints(mptree, i, mountpoint);
1447 #define MPTREE_BLOCK 15
1450 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1453 const char *path, *compstr;
1454 struct mptree *mptree;
1458 struct ducbdata cbd;
1462 Repo *oldinstalled = pool->installed;
1464 memset(&ignoredu, 0, sizeof(ignoredu));
1471 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1474 mptree[0].sibling = 0;
1475 mptree[0].child = 0;
1477 mptree[0].compl = 0;
1478 mptree[0].mountpoint = -1;
1481 /* create component tree */
1482 for (mp = 0; mp < nmps; mp++)
1487 path = mps[mp].path;
1492 if ((p = strchr(path, '/')) == 0)
1495 compl = strlen(compstr);
1506 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1507 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1511 /* create new node */
1512 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1514 mptree[i].sibling = mptree[pos].child;
1515 mptree[i].child = 0;
1516 mptree[i].comp = compstr;
1517 mptree[i].compl = compl;
1518 mptree[i].mountpoint = -1;
1519 mptree[pos].child = i;
1523 mptree[pos].mountpoint = mp;
1526 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1529 for (i = 0; i < nmptree; i++)
1531 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1532 printf("#%d child: %d\n", i, mptree[i].child);
1533 printf("#%d comp: %s\n", i, mptree[i].comp);
1534 printf("#%d compl: %d\n", i, mptree[i].compl);
1535 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1539 cbd.mptree = mptree;
1541 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1543 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1545 if (!MAPTST(installedmap, sp))
1548 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1549 if (!cbd.hasdu && oldinstalled)
1552 /* no du data available, ignore data of all installed solvables we obsolete */
1554 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1557 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1558 while ((obs = *obsp++) != 0)
1559 FOR_PROVIDES(op, opp, obs)
1560 if (op >= oldinstalled->start && op < oldinstalled->end)
1561 MAPSET(&ignoredu, op - oldinstalled->start);
1563 FOR_PROVIDES(op, opp, s->name)
1564 if (pool->solvables[op].name == s->name)
1565 if (op >= oldinstalled->start && op < oldinstalled->end)
1566 MAPSET(&ignoredu, op - oldinstalled->start);
1572 /* assumes we allways have du data for installed solvables */
1573 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1575 if (MAPTST(installedmap, sp))
1577 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1579 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1583 map_free(&ignoredu);
1584 sat_free(cbd.dirmap);
1589 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1594 Repo *oldinstalled = pool->installed;
1596 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1598 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1600 if (!MAPTST(installedmap, sp))
1602 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1606 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1608 if (MAPTST(installedmap, sp))
1610 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1618 * 2: conflicts with installed
1619 * 8: interesting (only true if installed)
1623 static inline Id dep2name(Pool *pool, Id dep)
1625 while (ISRELDEP(dep))
1627 Reldep *rd = rd = GETRELDEP(pool, dep);
1633 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1636 Solvable *sn = pool->solvables + n;
1638 FOR_PROVIDES(p, pp, sn->name)
1640 Solvable *s = pool->solvables + p;
1641 if (s->name != sn->name || s->arch != sn->arch)
1643 if ((map[p] & 9) != 9)
1645 if (pool_match_nevr(pool, pool->solvables + p, con))
1647 return 1; /* found installed package that doesn't conflict */
1652 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1656 FOR_PROVIDES(p, pp, dep)
1658 if (p == SYSTEMSOLVABLE)
1659 return 1; /* always boring, as never constraining */
1660 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1662 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1663 if (providedbyinstalled_multiversion(pool, map, p, dep))
1665 if ((map[p] & 9) == 9)
1673 * pool_trivial_installable - calculate if a set of solvables is
1674 * trivial installable without any other installs/deinstalls of
1675 * packages not belonging to the set.
1677 * the state is returned in the result queue:
1678 * 1: solvable is installable without any other package changes
1679 * 0: solvable is not installable
1680 * -1: solvable is installable, but doesn't constrain any installed packages
1684 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1687 Id p, *dp, con, *conp, req, *reqp;
1691 map = sat_calloc(pool->nsolvables, 1);
1692 for (p = 1; p < pool->nsolvables; p++)
1694 if (!MAPTST(installedmap, p))
1697 s = pool->solvables + p;
1700 conp = s->repo->idarraydata + s->conflicts;
1701 while ((con = *conp++) != 0)
1703 dp = pool_whatprovides_ptr(pool, con);
1705 map[p] |= 2; /* XXX: self conflict ? */
1708 for (i = 0; i < pkgs->count; i++)
1709 map[pkgs->elements[i]] = 16;
1711 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1713 if (i == pkgs->count)
1715 p = pkgs->elements[i];
1716 if ((map[p] & 16) == 0)
1718 if ((map[p] & 2) != 0)
1723 s = pool->solvables + p;
1727 reqp = s->repo->idarraydata + s->requires;
1728 while ((req = *reqp++) != 0)
1730 if (req == SOLVABLE_PREREQMARKER)
1732 r = providedbyinstalled(pool, map, req, 0, 0);
1735 /* decided and miss */
1739 m |= r; /* 1 | 9 | 16 | 17 */
1748 int ispatch = 0; /* see solver.c patch handling */
1750 if (!strncmp("patch:", id2str(pool, s->name), 6))
1752 conp = s->repo->idarraydata + s->conflicts;
1753 while ((con = *conp++) != 0)
1755 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1760 if ((m == 1 || m == 17) && ISRELDEP(con))
1762 con = dep2name(pool, con);
1763 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1768 continue; /* found a conflict */
1771 if (s->repo && s->repo != oldinstalled)
1773 Id p2, obs, *obsp, *pp;
1777 obsp = s->repo->idarraydata + s->obsoletes;
1778 while ((obs = *obsp++) != 0)
1780 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1789 FOR_PROVIDES(p2, pp, s->name)
1791 s2 = pool->solvables + p2;
1792 if (s2->name == s->name && (map[p2] & 1) != 0)
1809 queue_init_clone(res, pkgs);
1810 for (i = 0; i < pkgs->count; i++)
1812 m = map[pkgs->elements[i]];
1819 res->elements[i] = r;
1825 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1827 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1831 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1833 if (entry == SOLVID_POS && pool->pos.repo)
1834 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1837 return solvable_lookup_str(pool->solvables + entry, keyname);
1841 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1843 if (entry == SOLVID_POS && pool->pos.repo)
1845 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1846 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1847 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1851 return solvable_lookup_id(pool->solvables + entry, keyname);
1855 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1857 if (entry == SOLVID_POS && pool->pos.repo)
1860 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1866 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1870 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1872 if (entry == SOLVID_POS && pool->pos.repo)
1873 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1876 return solvable_lookup_void(pool->solvables + entry, keyname);
1879 const unsigned char *
1880 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1882 if (entry == SOLVID_POS && pool->pos.repo)
1883 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1886 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1890 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1892 if (entry == SOLVID_POS && pool->pos.repo)
1894 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1895 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
1899 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1903 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
1905 int hadhashes = pool->relhashtbl ? 1 : 0;
1911 if (!conflicts->count)
1913 pool_freewhatprovides(pool);
1914 for (i = 0; i < conflicts->count; i += 5)
1916 fn = conflicts->elements[i];
1917 p = conflicts->elements[i + 1];
1918 md5 = conflicts->elements[i + 2];
1919 q = conflicts->elements[i + 3];
1920 id = rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
1921 s = pool->solvables + p;
1924 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
1925 s = pool->solvables + q;
1928 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1931 pool_freeidhashes(pool);