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 */
68 /* free all the resources of our pool */
74 pool_freewhatprovides(pool);
75 pool_freeidhashes(pool);
76 repo_freeallrepos(pool, 1);
77 sat_free(pool->id2arch);
78 sat_free(pool->solvables);
79 stringpool_free(&pool->ss);
81 queue_free(&pool->vendormap);
82 for (i = 0; i < POOL_TMPSPACEBUF; i++)
83 sat_free(pool->tmpspacebuf[i]);
84 for (i = 0; i < pool->nlanguages; i++)
85 free((char *)pool->languages[i]);
86 sat_free(pool->languages);
87 sat_free(pool->languagecache);
91 #ifdef MULTI_SEMANTICS
93 pool_setdisttype(Pool *pool, int disttype)
95 pool->disttype = disttype;
100 pool_add_solvable(Pool *pool)
102 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, 1, sizeof(Solvable), SOLVABLE_BLOCK);
103 memset(pool->solvables + pool->nsolvables, 0, sizeof(Solvable));
104 return pool->nsolvables++;
108 pool_add_solvable_block(Pool *pool, int count)
110 Id nsolvables = pool->nsolvables;
113 pool->solvables = sat_extend(pool->solvables, pool->nsolvables, count, sizeof(Solvable), SOLVABLE_BLOCK);
114 memset(pool->solvables + nsolvables, 0, sizeof(Solvable) * count);
115 pool->nsolvables += count;
120 pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids)
124 if (reuseids && start + count == pool->nsolvables)
126 /* might want to shrink solvable array */
127 pool->nsolvables = start;
130 memset(pool->solvables + start, 0, sizeof(Solvable) * count);
135 pool_set_installed(Pool *pool, Repo *installed)
137 if (pool->installed == installed)
139 pool->installed = installed;
140 pool_freewhatprovides(pool);
144 pool_shrink_whatprovides_sortcmp(const void *ap, const void *bp, void *dp)
149 oa = pool->whatprovides[*(Id *)ap];
150 ob = pool->whatprovides[*(Id *)bp];
152 return *(Id *)ap - *(Id *)bp;
157 da = pool->whatprovidesdata + oa;
158 db = pool->whatprovidesdata + ob;
160 if ((r = (*da++ - *db++)) != 0)
164 return *(Id *)ap - *(Id *)bp;
168 * pool_shrink_whatprovides - unify whatprovides data
170 * whatprovides_rel must be empty for this to work!
174 pool_shrink_whatprovides(Pool *pool)
178 Id lastid, *last, *dp, *lp;
182 if (pool->ss.nstrings < 3)
184 sorted = sat_malloc2(pool->ss.nstrings, sizeof(Id));
185 for (id = 0; id < pool->ss.nstrings; id++)
187 sat_sort(sorted + 1, pool->ss.nstrings - 1, sizeof(Id), pool_shrink_whatprovides_sortcmp, pool);
190 for (i = 1; i < pool->ss.nstrings; i++)
193 o = pool->whatprovides[id];
194 if (o == 0 || o == 1)
196 dp = pool->whatprovidesdata + o;
210 pool->whatprovides[id] = -lastid;
214 last = pool->whatprovidesdata + o;
218 dp = pool->whatprovidesdata + 2;
219 for (id = 1; id < pool->ss.nstrings; id++)
221 o = pool->whatprovides[id];
222 if (o == 0 || o == 1)
229 pool->whatprovides[id] = pool->whatprovides[i];
232 lp = pool->whatprovidesdata + o;
235 pool->whatprovides[id] = dp - pool->whatprovidesdata;
236 while ((*dp++ = *lp++) != 0)
239 o = dp - pool->whatprovidesdata;
240 POOL_DEBUG(SAT_DEBUG_STATS, "shrunk whatprovidesdata from %d to %d\n", pool->whatprovidesdataoff, o);
241 if (pool->whatprovidesdataoff == o)
243 r = pool->whatprovidesdataoff - o;
244 pool->whatprovidesdataoff = o;
245 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (o + pool->whatprovidesdataleft) * sizeof(Id));
246 if (r > pool->whatprovidesdataleft)
247 r = pool->whatprovidesdataleft;
248 memset(pool->whatprovidesdata + o, 0, r * sizeof(Id));
253 * pool_createwhatprovides()
255 * create hashes over pool of solvables to ease provide lookups
259 pool_createwhatprovides(Pool *pool)
261 int i, num, np, extra;
266 Offset *whatprovides;
267 Id *whatprovidesdata, *d;
268 Repo *installed = pool->installed;
272 POOL_DEBUG(SAT_DEBUG_STATS, "number of solvables: %d\n", pool->nsolvables);
273 POOL_DEBUG(SAT_DEBUG_STATS, "number of ids: %d + %d\n", pool->ss.nstrings, pool->nrels);
275 pool_freeidhashes(pool); /* XXX: should not be here! */
276 pool_freewhatprovides(pool);
277 num = pool->ss.nstrings;
278 pool->whatprovides = whatprovides = sat_calloc_block(num, sizeof(Offset), WHATPROVIDES_BLOCK);
279 pool->whatprovides_rel = sat_calloc_block(pool->nrels, sizeof(Offset), WHATPROVIDES_BLOCK);
281 /* count providers for each name */
282 for (i = 1; i < pool->nsolvables; i++)
285 s = pool->solvables + i;
286 if (!s->provides || !s->repo || s->repo->disabled)
288 /* we always need the installed solvable in the whatprovides data,
289 otherwise obsoletes/conflicts on them won't work */
290 if (s->repo != installed && !pool_installable(pool, s))
292 pp = s->repo->idarraydata + s->provides;
293 while ((id = *pp++) != ID_NULL)
297 Reldep *rd = GETRELDEP(pool, id);
300 whatprovides[id]++; /* inc count of providers */
304 off = 2; /* first entry is undef, second is empty list */
306 np = 0; /* number of names provided */
307 for (i = 0; i < num; i++, idp++)
310 if (!n) /* no providers */
312 *idp = off; /* move from counts to offsets into whatprovidesdata */
313 off += n + 1; /* make space for all providers + terminating ID_NULL */
314 np++; /* inc # of provider 'slots' */
317 POOL_DEBUG(SAT_DEBUG_STATS, "provide ids: %d\n", np);
319 /* reserve some space for relation data */
320 extra = 2 * pool->nrels;
324 POOL_DEBUG(SAT_DEBUG_STATS, "provide space needed: %d + %d\n", off, extra);
326 /* alloc space for all providers + extra */
327 whatprovidesdata = sat_calloc(off + extra, sizeof(Id));
329 /* now fill data for all provides */
330 for (i = 1; i < pool->nsolvables; i++)
333 s = pool->solvables + i;
334 if (!s->provides || !s->repo || s->repo->disabled)
336 if (s->repo != installed && !pool_installable(pool, s))
339 /* for all provides of this solvable */
340 pp = s->repo->idarraydata + s->provides;
341 while ((id = *pp++) != 0)
345 Reldep *rd = GETRELDEP(pool, id);
348 d = whatprovidesdata + whatprovides[id]; /* offset into whatprovidesdata */
352 while (*d) /* find free slot */
354 if (d[-1] == i) /* solvable already tacked at end ? */
355 continue; /* Y: skip, on to next provides */
357 *d = i; /* put solvable Id into data */
360 pool->whatprovidesdata = whatprovidesdata;
361 pool->whatprovidesdataoff = off;
362 pool->whatprovidesdataleft = extra;
363 pool_shrink_whatprovides(pool);
364 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)));
365 POOL_DEBUG(SAT_DEBUG_STATS, "createwhatprovides took %d ms\n", sat_timems(now));
369 * free all of our whatprovides data
370 * be careful, everything internalized with pool_queuetowhatprovides is
374 pool_freewhatprovides(Pool *pool)
376 pool->whatprovides = sat_free(pool->whatprovides);
377 pool->whatprovides_rel = sat_free(pool->whatprovides_rel);
378 pool->whatprovidesdata = sat_free(pool->whatprovidesdata);
379 pool->whatprovidesdataoff = 0;
380 pool->whatprovidesdataleft = 0;
384 /******************************************************************************/
387 * pool_queuetowhatprovides - add queue contents to whatprovidesdata
389 * on-demand filling of provider information
390 * move queue data into whatprovidesdata
392 * returns: Offset into whatprovides
396 pool_queuetowhatprovides(Pool *pool, Queue *q)
399 int count = q->count;
401 if (count == 0) /* queue empty -> 1 */
404 /* extend whatprovidesdata if needed, +1 for ID_NULL-termination */
405 if (pool->whatprovidesdataleft < count + 1)
407 POOL_DEBUG(SAT_DEBUG_STATS, "growing provides hash data...\n");
408 pool->whatprovidesdata = sat_realloc(pool->whatprovidesdata, (pool->whatprovidesdataoff + count + 4096) * sizeof(Id));
409 pool->whatprovidesdataleft = count + 4096;
412 /* copy queue to next free slot */
413 off = pool->whatprovidesdataoff;
414 memcpy(pool->whatprovidesdata + pool->whatprovidesdataoff, q->elements, count * sizeof(Id));
416 /* adapt count and ID_NULL-terminate */
417 pool->whatprovidesdataoff += count;
418 pool->whatprovidesdata[pool->whatprovidesdataoff++] = ID_NULL;
419 pool->whatprovidesdataleft -= count + 1;
425 /*************************************************************************/
427 #if defined(MULTI_SEMANTICS)
428 # define EVRCMP_DEPCMP (pool->disttype == DISTTYPE_DEB ? EVRCMP_COMPARE : EVRCMP_MATCH_RELEASE)
429 #elif defined(DEBIAN_SEMANTICS)
430 # define EVRCMP_DEPCMP EVRCMP_COMPARE
432 # define EVRCMP_DEPCMP EVRCMP_MATCH_RELEASE
435 /* check if a package's nevr matches a dependency */
438 pool_match_nevr_rel(Pool *pool, Solvable *s, Id d)
440 Reldep *rd = GETRELDEP(pool, d);
443 int flags = rd->flags;
452 return pool_match_nevr(pool, s, name);
454 if (pool_match_nevr(pool, s, name))
456 return pool_match_nevr(pool, s, evr);
459 if (!pool_match_nevr(pool, s, name))
461 return pool_match_nevr(pool, s, evr);
466 if (!pool_match_nevr(pool, s, name))
469 return flags & 2 ? 1 : 0;
474 if (flags != 2 && flags != 5)
476 if ((flags & (1 << (1 + evrcmp(pool, s->evr, evr, EVRCMP_DEPCMP)))) != 0)
481 /* match two dependencies */
484 pool_match_dep(Pool *pool, Id d1, Id d2)
495 rd2 = GETRELDEP(pool, d2);
496 return pool_match_dep(pool, d1, rd2->name);
498 rd1 = GETRELDEP(pool, d1);
501 return pool_match_dep(pool, rd1->name, d2);
503 rd2 = GETRELDEP(pool, d2);
504 if (!pool_match_dep(pool, rd1->name, rd2->name))
508 if (!pflags || !flags || pflags >= 8 || flags >= 8)
510 if (flags == 7 || pflags == 7)
512 if ((pflags & flags & 5) != 0)
514 if (rd1->evr == rd2->evr)
516 if ((pflags & flags & 2) != 0)
521 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
522 if ((f & (1 << (1 + evrcmp(pool, rd1->evr, rd2->evr, EVRCMP_DEPCMP)))) != 0)
531 * add packages fulfilling the relation to whatprovides array
532 * no exact providers, do range match
537 pool_addrelproviders(Pool *pool, Id d)
539 Reldep *rd = GETRELDEP(pool, d);
545 int flags = rd->flags;
547 Id p, wp, *pp, *pp2, *pp3;
550 queue_init_buffer(&plist, buf, sizeof(buf)/sizeof(*buf));
555 pp = pool_whatprovides_ptr(pool, name);
556 pp2 = pool_whatprovides_ptr(pool, evr);
557 while ((p = *pp++) != 0)
559 for (pp3 = pp2; *pp3;)
562 queue_push(&plist, p);
568 pp = pool_whatprovides_ptr(pool, name);
569 while ((p = *pp++) != 0)
570 queue_push(&plist, p);
571 pp = pool_whatprovides_ptr(pool, evr);
572 while ((p = *pp++) != 0)
573 queue_pushunique(&plist, p);
576 if (name == NAMESPACE_OTHERPROVIDERS)
578 wp = pool_whatprovides(pool, evr);
579 pool->whatprovides_rel[d] = wp;
582 if (pool->nscallback)
584 /* ask callback which packages provide the dependency
586 * 1: the system (aka SYSTEMSOLVABLE)
587 * >1: a set of packages, stored as offset on whatprovidesdata
589 p = pool->nscallback(pool, pool->nscallbackdata, name, evr);
593 pool->whatprovides_rel[d] = p;
597 queue_push(&plist, SYSTEMSOLVABLE);
601 /* small hack: make it possible to match <pkg>.src
602 * we have to iterate over the solvables as src packages do not
603 * provide anything, thus they are not indexed in our
604 * whatprovides hash */
608 for (p = 1, s = pool->solvables + p; p < pool->nsolvables; p++, s++)
610 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
612 if (pool_match_nevr(pool, s, name))
613 queue_push(&plist, p);
617 wp = pool_whatprovides(pool, name);
618 pp = pool->whatprovidesdata + wp;
619 while ((p = *pp++) != 0)
621 Solvable *s = pool->solvables + p;
623 queue_push(&plist, p);
629 /* all solvables match, no need to create a new list */
630 pool->whatprovides_rel[d] = wp;
634 case REL_FILECONFLICT:
635 pp = pool_whatprovides_ptr(pool, name);
636 while ((p = *pp++) != 0)
638 Id origd = MAKERELDEP(d);
639 Solvable *s = pool->solvables + p;
642 pidp = s->repo->idarraydata + s->provides;
643 while ((pid = *pidp++) != 0)
647 queue_push(&plist, p);
654 /* convert to whatprovides id */
656 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: what provides %s?\n", dep2str(pool, name));
658 if (flags && flags < 8)
660 pp = pool_whatprovides_ptr(pool, name);
661 while (ISRELDEP(name))
663 rd = GETRELDEP(pool, name);
666 while ((p = *pp++) != 0)
668 Solvable *s = pool->solvables + p;
670 POOL_DEBUG(DEBUG_1, "addrelproviders: checking package %s\n", id2str(pool, s->name));
674 /* no provides - check nevr */
675 if (pool_match_nevr_rel(pool, s, MAKERELDEP(d)))
676 queue_push(&plist, p);
679 /* solvable p provides name in some rels */
680 pidp = s->repo->idarraydata + s->provides;
681 while ((pid = *pidp++) != 0)
688 #if defined(MULTI_SEMANTICS)
689 if (pool->disttype == DISTTYPE_DEB)
693 #elif defined(DEBIAN_SEMANTICS)
694 continue; /* unversioned provides can
695 * never match versioned deps */
697 break; /* yes, provides all versions */
701 continue; /* wrong provides name */
702 prd = GETRELDEP(pool, pid);
703 if (prd->name != name)
704 continue; /* wrong provides name */
705 /* right package, both deps are rels */
709 if (flags == 7 || pflags == 7)
710 break; /* included */
711 if ((pflags & flags & 5) != 0)
712 break; /* same direction, match */
716 if ((pflags & flags & 2) != 0)
717 break; /* both have =, match */
721 int f = flags == 5 ? 5 : flags == 2 ? pflags : (flags ^ 5) & (pflags | 5);
722 if ((f & (1 << (1 + evrcmp(pool, pevr, evr, EVRCMP_DEPCMP)))) != 0)
727 continue; /* no rel match */
728 queue_push(&plist, p);
730 /* make our system solvable provide all unknown rpmlib() stuff */
731 if (plist.count == 0 && !strncmp(id2str(pool, name), "rpmlib(", 7))
732 queue_push(&plist, SYSTEMSOLVABLE);
734 /* add providers to whatprovides */
736 POOL_DEBUG(SAT_DEBUG_STATS, "addrelproviders: adding %d packages to %d\n", plist.count, d);
738 pool->whatprovides_rel[d] = pool_queuetowhatprovides(pool, &plist);
741 return pool->whatprovides_rel[d];
744 /*************************************************************************/
747 pool_debug(Pool *pool, int type, const char *format, ...)
752 if ((type & (SAT_FATAL|SAT_ERROR)) == 0)
754 if ((pool->debugmask & type) == 0)
757 va_start(args, format);
758 if (!pool->debugcallback)
760 if ((type & (SAT_FATAL|SAT_ERROR)) == 0 && !(pool->debugmask & SAT_DEBUG_TO_STDERR))
761 vprintf(format, args);
763 vfprintf(stderr, format, args);
766 vsnprintf(buf, sizeof(buf), format, args);
767 pool->debugcallback(pool, pool->debugcallbackdata, type, buf);
771 pool_setdebuglevel(Pool *pool, int level)
773 int mask = SAT_DEBUG_RESULT;
775 mask |= SAT_DEBUG_STATS|SAT_DEBUG_ANALYZE|SAT_DEBUG_UNSOLVABLE|SAT_DEBUG_SOLVER|SAT_DEBUG_TRANSACTION;
777 mask |= SAT_DEBUG_JOB|SAT_DEBUG_SOLUTIONS|SAT_DEBUG_POLICY;
779 mask |= SAT_DEBUG_PROPAGATE;
781 mask |= SAT_DEBUG_RULE_CREATION;
783 mask |= SAT_DEBUG_SCHUBI;
784 mask |= pool->debugmask & SAT_DEBUG_TO_STDERR; /* keep bit */
785 pool->debugmask = mask;
788 /*************************************************************************/
798 #define SEARCHFILES_BLOCK 127
801 pool_addfileprovides_dep(Pool *pool, Id *ida, struct searchfiles *sf, struct searchfiles *isf)
805 struct searchfiles *csf;
807 while ((dep = *ida++) != 0)
810 while (ISRELDEP(dep))
813 sid = pool->ss.nstrings + GETRELID(dep);
814 if (MAPTST(&csf->seen, sid))
819 MAPSET(&csf->seen, sid);
820 rd = GETRELDEP(pool, dep);
823 else if (rd->flags == REL_NAMESPACE)
825 if (rd->name == NAMESPACE_INSTALLED || rd->name == NAMESPACE_SPLITPROVIDES)
828 if (!csf || MAPTST(&csf->seen, sid))
833 MAPSET(&csf->seen, sid);
837 else if (rd->flags == REL_FILECONFLICT)
847 pool_addfileprovides_dep(pool, ids, csf, isf);
853 if (MAPTST(&csf->seen, dep))
855 MAPSET(&csf->seen, dep);
856 s = id2str(pool, dep);
859 csf->ids = sat_extend(csf->ids, csf->nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
860 csf->dirs = sat_extend(csf->dirs, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
861 csf->names = sat_extend(csf->names, csf->nfiles, 1, sizeof(const char *), SEARCHFILES_BLOCK);
862 csf->ids[csf->nfiles] = dep;
863 sr = strrchr(s, '/');
864 csf->names[csf->nfiles] = strdup(sr + 1);
865 csf->dirs[csf->nfiles] = sat_malloc(sr - s + 1);
867 strncpy(csf->dirs[csf->nfiles], s, sr - s);
868 csf->dirs[csf->nfiles][sr - s] = 0;
873 struct addfileprovides_cbdata {
887 addfileprovides_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
889 struct addfileprovides_cbdata *cbd = cbdata;
892 if (!cbd->useddirs.size)
894 map_init(&cbd->useddirs, data->dirpool.ndirs + 1);
895 for (i = 0; i < cbd->nfiles; i++)
898 if (MAPTST(&cbd->providedids, cbd->ids[i]))
903 did = repodata_str2dir(data, cbd->dirs[i], 0);
906 MAPSET(&cbd->useddirs, did);
909 if (value->id >= data->dirpool.ndirs || !MAPTST(&cbd->useddirs, value->id))
911 for (i = 0; i < cbd->nfiles; i++)
913 if (cbd->dids[i] != value->id)
915 if (!strcmp(cbd->names[i], value->str))
918 if (i == cbd->nfiles)
920 s->provides = repo_addid_dep(s->repo, s->provides, cbd->ids[i], SOLVABLE_FILEMARKER);
925 pool_addfileprovides_search(Pool *pool, struct addfileprovides_cbdata *cbd, struct searchfiles *sf, Repo *repoonly)
931 int i, j, repoid, repodataid;
932 int provstart, provend;
934 int ndone, incomplete;
939 cbd->nfiles = sf->nfiles;
941 cbd->dirs = sf->dirs;
942 cbd->names = sf->names;
943 cbd->dids = sat_realloc2(cbd->dids, sf->nfiles, sizeof(Id));
944 map_init(&cbd->providedids, pool->ss.nstrings);
947 repo = repoonly ? repoonly : pool->repos[0];
948 map_init(&donemap, pool->nsolvables);
949 queue_init(&fileprovidesq);
950 provstart = provend = 0;
955 if (repoonly || ++repoid == pool->nrepos)
957 repo = pool->repos[repoid];
961 for (data = repo->repodata, repodataid = 0; repodataid < repo->nrepodata; repodataid++, data++)
963 if (ndone >= repo->nsolvables)
966 if (repodata_lookup_idarray(data, SOLVID_META, REPOSITORY_ADDEDFILEPROVIDES, &fileprovidesq))
968 map_empty(&cbd->providedids);
969 for (i = 0; i < fileprovidesq.count; i++)
970 MAPSET(&cbd->providedids, fileprovidesq.elements[i]);
971 provstart = data->start;
973 for (i = 0; i < cbd->nfiles; i++)
974 if (!MAPTST(&cbd->providedids, cbd->ids[i]))
976 if (i == cbd->nfiles)
978 /* great! no need to search files */
979 for (p = data->start; p < data->end; p++)
980 if (pool->solvables[p].repo == repo)
982 if (MAPTST(&donemap, p))
991 if (!repodata_has_keyname(data, SOLVABLE_FILELIST))
994 if (data->start < provstart || data->end > provend)
996 map_empty(&cbd->providedids);
997 provstart = provend = 0;
1000 /* check if the data is incomplete */
1002 if (data->state == REPODATA_AVAILABLE)
1004 for (j = 1; j < data->nkeys; j++)
1005 if (data->keys[j].name != REPOSITORY_SOLVABLES && data->keys[j].name != SOLVABLE_FILELIST)
1007 if (j < data->nkeys)
1010 for (i = 0; i < cbd->nfiles; i++)
1011 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1012 printf("need complete filelist because of %s\n", id2str(pool, cbd->ids[i]));
1014 for (i = 0; i < cbd->nfiles; i++)
1015 if (!MAPTST(&cbd->providedids, cbd->ids[i]) && !repodata_filelistfilter_matches(data, id2str(pool, cbd->ids[i])))
1017 if (i < cbd->nfiles)
1023 map_init(&cbd->useddirs, 0);
1024 for (p = data->start; p < data->end; p++)
1025 if (pool->solvables[p].repo == repo)
1027 if (MAPTST(&donemap, p))
1029 repodata_search(data, p, SOLVABLE_FILELIST, 0, addfileprovides_cb, cbd);
1032 MAPSET(&donemap, p);
1036 map_free(&cbd->useddirs);
1039 if (repoonly || ++repoid == pool->nrepos)
1041 repo = pool->repos[repoid];
1044 queue_free(&fileprovidesq);
1045 map_free(&cbd->providedids);
1049 pool_addfileprovides_ids(Pool *pool, Repo *installed, Id **idp)
1053 struct searchfiles sf, isf, *isfp;
1054 struct addfileprovides_cbdata cbd;
1058 now = sat_timems(0);
1059 memset(&sf, 0, sizeof(sf));
1060 map_init(&sf.seen, pool->ss.nstrings + pool->nrels);
1061 memset(&isf, 0, sizeof(isf));
1062 map_init(&isf.seen, pool->ss.nstrings + pool->nrels);
1064 isfp = installed ? &isf : 0;
1065 for (i = 1, s = pool->solvables + i; i < pool->nsolvables; i++, s++)
1071 pool_addfileprovides_dep(pool, repo->idarraydata + s->obsoletes, &sf, isfp);
1073 pool_addfileprovides_dep(pool, repo->idarraydata + s->conflicts, &sf, isfp);
1075 pool_addfileprovides_dep(pool, repo->idarraydata + s->requires, &sf, isfp);
1077 pool_addfileprovides_dep(pool, repo->idarraydata + s->recommends, &sf, isfp);
1079 pool_addfileprovides_dep(pool, repo->idarraydata + s->suggests, &sf, isfp);
1081 pool_addfileprovides_dep(pool, repo->idarraydata + s->supplements, &sf, isfp);
1083 pool_addfileprovides_dep(pool, repo->idarraydata + s->enhances, &sf, isfp);
1086 map_free(&isf.seen);
1087 POOL_DEBUG(SAT_DEBUG_STATS, "found %d file dependencies, %d installed file dependencies\n", sf.nfiles, isf.nfiles);
1094 for (i = 0; i < sf.nfiles; i++)
1095 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in filelist\n", id2str(pool, sf.ids[i]));
1097 pool_addfileprovides_search(pool, &cbd, &sf, 0);
1100 sf.ids = sat_extend(sf.ids, sf.nfiles, 1, sizeof(Id), SEARCHFILES_BLOCK);
1101 sf.ids[sf.nfiles] = 0;
1106 for (i = 0; i < sf.nfiles; i++)
1108 sat_free(sf.dirs[i]);
1109 sat_free(sf.names[i]);
1117 for (i = 0; i < isf.nfiles; i++)
1118 POOL_DEBUG(SAT_DEBUG_STATS, "looking up %s in installed filelist\n", id2str(pool, isf.ids[i]));
1121 pool_addfileprovides_search(pool, &cbd, &isf, installed);
1123 for (i = 0; i < isf.nfiles; i++)
1125 sat_free(isf.dirs[i]);
1126 sat_free(isf.names[i]);
1129 sat_free(isf.names);
1132 pool_freewhatprovides(pool); /* as we have added provides */
1133 POOL_DEBUG(SAT_DEBUG_STATS, "addfileprovides took %d ms\n", sat_timems(now));
1137 pool_addfileprovides(Pool *pool)
1139 pool_addfileprovides_ids(pool, pool->installed, 0);
1143 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)
1147 if (pool->solvables[p].repo)
1148 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1151 /* FIXME: obey callback return value! */
1152 for (p = 1; p < pool->nsolvables; p++)
1153 if (pool->solvables[p].repo)
1154 repo_search(pool->solvables[p].repo, p, key, match, flags, callback, cbdata);
1158 pool_clear_pos(Pool *pool)
1160 memset(&pool->pos, 0, sizeof(pool->pos));
1165 pool_set_languages(Pool *pool, const char **languages, int nlanguages)
1169 pool->languagecache = sat_free(pool->languagecache);
1170 pool->languagecacheother = 0;
1171 if (pool->nlanguages)
1173 for (i = 0; i < pool->nlanguages; i++)
1174 free((char *)pool->languages[i]);
1175 free(pool->languages);
1177 pool->nlanguages = nlanguages;
1180 pool->languages = sat_calloc(nlanguages, sizeof(const char **));
1181 for (i = 0; i < pool->nlanguages; i++)
1182 pool->languages[i] = strdup(languages[i]);
1186 pool_id2langid(Pool *pool, Id id, const char *lang, int create)
1194 n = id2str(pool, id);
1195 l = strlen(n) + strlen(lang) + 2;
1196 if (l > sizeof(buf))
1197 p = sat_malloc(strlen(n) + strlen(lang) + 2);
1200 sprintf(p, "%s:%s", n, lang);
1201 id = str2id(pool, p, create);
1208 pool_alloctmpspace(Pool *pool, int len)
1210 int n = pool->tmpspacen;
1213 if (len > pool->tmpspacelen[n])
1215 pool->tmpspacebuf[n] = sat_realloc(pool->tmpspacebuf[n], len + 32);
1216 pool->tmpspacelen[n] = len + 32;
1218 pool->tmpspacen = (n + 1) % POOL_TMPSPACEBUF;
1219 return pool->tmpspacebuf[n];
1223 pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3)
1227 l1 = str1 ? strlen(str1) : 0;
1228 l2 = str2 ? strlen(str2) : 0;
1229 l3 = str3 ? strlen(str3) : 0;
1230 s = str = pool_alloctmpspace(pool, l1 + l2 + l3 + 1);
1251 /*******************************************************************/
1263 struct mptree *mptree;
1274 solver_fill_DU_cb(void *cbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *value)
1276 struct ducbdata *cbd = cbdata;
1279 if (data != cbd->olddata)
1281 Id dn, mp, comp, *dirmap, *dirs;
1283 const char *compstr;
1284 struct mptree *mptree;
1286 /* create map from dir to mptree */
1287 cbd->dirmap = sat_free(cbd->dirmap);
1289 dirmap = sat_calloc(data->dirpool.ndirs, sizeof(Id));
1290 mptree = cbd->mptree;
1292 for (dn = 2, dirs = data->dirpool.dirs + dn; dn < data->dirpool.ndirs; dn++)
1306 if (!mptree[mp].child)
1311 if (data->localpool)
1312 compstr = stringpool_id2str(&data->spool, comp);
1314 compstr = id2str(data->repo->pool, comp);
1315 compl = strlen(compstr);
1316 for (i = mptree[mp].child; i; i = mptree[i].sibling)
1317 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1319 dirmap[dn] = i ? i : -mp;
1321 /* change dirmap to point to mountpoint instead of mptree */
1322 for (dn = 0; dn < data->dirpool.ndirs; dn++)
1325 dirmap[dn] = mptree[mp > 0 ? mp : -mp].mountpoint;
1327 cbd->dirmap = dirmap;
1328 cbd->nmap = data->dirpool.ndirs;
1329 cbd->olddata = data;
1332 if (value->id < 0 || value->id >= cbd->nmap)
1334 mp = cbd->dirmap[value->id];
1337 if (cbd->addsub > 0)
1339 cbd->mps[mp].kbytes += value->num;
1340 cbd->mps[mp].files += value->num2;
1344 cbd->mps[mp].kbytes -= value->num;
1345 cbd->mps[mp].files -= value->num2;
1351 propagate_mountpoints(struct mptree *mptree, int pos, Id mountpoint)
1354 if (mptree[pos].mountpoint == -1)
1355 mptree[pos].mountpoint = mountpoint;
1357 mountpoint = mptree[pos].mountpoint;
1358 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1359 propagate_mountpoints(mptree, i, mountpoint);
1362 #define MPTREE_BLOCK 15
1365 pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps)
1368 const char *path, *compstr;
1369 struct mptree *mptree;
1373 struct ducbdata cbd;
1377 Repo *oldinstalled = pool->installed;
1379 memset(&ignoredu, 0, sizeof(ignoredu));
1386 mptree = sat_extend_resize(0, 1, sizeof(struct mptree), MPTREE_BLOCK);
1389 mptree[0].sibling = 0;
1390 mptree[0].child = 0;
1392 mptree[0].compl = 0;
1393 mptree[0].mountpoint = -1;
1396 /* create component tree */
1397 for (mp = 0; mp < nmps; mp++)
1402 path = mps[mp].path;
1407 if ((p = strchr(path, '/')) == 0)
1410 compl = strlen(compstr);
1421 for (i = mptree[pos].child; i; i = mptree[i].sibling)
1422 if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
1426 /* create new node */
1427 mptree = sat_extend(mptree, nmptree, 1, sizeof(struct mptree), MPTREE_BLOCK);
1429 mptree[i].sibling = mptree[pos].child;
1430 mptree[i].child = 0;
1431 mptree[i].comp = compstr;
1432 mptree[i].compl = compl;
1433 mptree[i].mountpoint = -1;
1434 mptree[pos].child = i;
1438 mptree[pos].mountpoint = mp;
1441 propagate_mountpoints(mptree, 0, mptree[0].mountpoint);
1444 for (i = 0; i < nmptree; i++)
1446 printf("#%d sibling: %d\n", i, mptree[i].sibling);
1447 printf("#%d child: %d\n", i, mptree[i].child);
1448 printf("#%d comp: %s\n", i, mptree[i].comp);
1449 printf("#%d compl: %d\n", i, mptree[i].compl);
1450 printf("#%d mountpont: %d\n", i, mptree[i].mountpoint);
1454 cbd.mptree = mptree;
1456 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1458 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1460 if (!MAPTST(installedmap, sp))
1463 repo_search(s->repo, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1464 if (!cbd.hasdu && oldinstalled)
1467 /* no du data available, ignore data of all installed solvables we obsolete */
1469 map_init(&ignoredu, oldinstalled->end - oldinstalled->start);
1472 Id obs, *obsp = s->repo->idarraydata + s->obsoletes;
1473 while ((obs = *obsp++) != 0)
1474 FOR_PROVIDES(op, opp, obs)
1475 if (op >= oldinstalled->start && op < oldinstalled->end)
1476 MAPSET(&ignoredu, op - oldinstalled->start);
1478 FOR_PROVIDES(op, opp, s->name)
1479 if (pool->solvables[op].name == s->name)
1480 if (op >= oldinstalled->start && op < oldinstalled->end)
1481 MAPSET(&ignoredu, op - oldinstalled->start);
1487 /* assumes we allways have du data for installed solvables */
1488 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1490 if (MAPTST(installedmap, sp))
1492 if (ignoredu.map && MAPTST(&ignoredu, sp - oldinstalled->start))
1494 repo_search(oldinstalled, sp, SOLVABLE_DISKUSAGE, 0, 0, solver_fill_DU_cb, &cbd);
1498 map_free(&ignoredu);
1499 sat_free(cbd.dirmap);
1504 pool_calc_installsizechange(Pool *pool, Map *installedmap)
1509 Repo *oldinstalled = pool->installed;
1511 for (sp = 1, s = pool->solvables + sp; sp < pool->nsolvables; sp++, s++)
1513 if (!s->repo || (oldinstalled && s->repo == oldinstalled))
1515 if (!MAPTST(installedmap, sp))
1517 change += solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1521 FOR_REPO_SOLVABLES(oldinstalled, sp, s)
1523 if (MAPTST(installedmap, sp))
1525 change -= solvable_lookup_num(s, SOLVABLE_INSTALLSIZE, 0);
1533 * 2: conflicts with installed
1534 * 8: interesting (only true if installed)
1538 static inline Id dep2name(Pool *pool, Id dep)
1540 while (ISRELDEP(dep))
1542 Reldep *rd = rd = GETRELDEP(pool, dep);
1548 static int providedbyinstalled_multiversion(Pool *pool, unsigned char *map, Id n, Id con)
1551 Solvable *sn = pool->solvables + n;
1553 FOR_PROVIDES(p, pp, sn->name)
1555 Solvable *s = pool->solvables + p;
1556 if (s->name != sn->name || s->arch != sn->arch)
1558 if ((map[p] & 9) != 9)
1560 if (pool_match_nevr(pool, pool->solvables + p, con))
1562 return 1; /* found installed package that doesn't conflict */
1567 static inline int providedbyinstalled(Pool *pool, unsigned char *map, Id dep, int ispatch, Map *noobsoletesmap)
1571 FOR_PROVIDES(p, pp, dep)
1573 if (p == SYSTEMSOLVABLE)
1574 return 1; /* always boring, as never constraining */
1575 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
1577 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
1578 if (providedbyinstalled_multiversion(pool, map, p, dep))
1580 if ((map[p] & 9) == 9)
1588 * pool_trivial_installable - calculate if a set of solvables is
1589 * trivial installable without any other installs/deinstalls of
1590 * packages not belonging to the set.
1592 * the state is returned in the result queue:
1593 * 1: solvable is installable without any other package changes
1594 * 0: solvable is not installable
1595 * -1: solvable is installable, but doesn't constrain any installed packages
1599 pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap)
1602 Id p, *dp, con, *conp, req, *reqp;
1606 map = sat_calloc(pool->nsolvables, 1);
1607 for (p = 1; p < pool->nsolvables; p++)
1609 if (!MAPTST(installedmap, p))
1612 s = pool->solvables + p;
1615 conp = s->repo->idarraydata + s->conflicts;
1616 while ((con = *conp++) != 0)
1618 dp = pool_whatprovides_ptr(pool, con);
1620 map[p] |= 2; /* XXX: self conflict ? */
1623 for (i = 0; i < pkgs->count; i++)
1624 map[pkgs->elements[i]] = 16;
1626 for (i = 0, did = 0; did < pkgs->count; i++, did++)
1628 if (i == pkgs->count)
1630 p = pkgs->elements[i];
1631 if ((map[p] & 16) == 0)
1633 if ((map[p] & 2) != 0)
1638 s = pool->solvables + p;
1642 reqp = s->repo->idarraydata + s->requires;
1643 while ((req = *reqp++) != 0)
1645 if (req == SOLVABLE_PREREQMARKER)
1647 r = providedbyinstalled(pool, map, req, 0, 0);
1650 /* decided and miss */
1654 m |= r; /* 1 | 9 | 16 | 17 */
1663 int ispatch = 0; /* see solver.c patch handling */
1665 if (!strncmp("patch:", id2str(pool, s->name), 6))
1667 conp = s->repo->idarraydata + s->conflicts;
1668 while ((con = *conp++) != 0)
1670 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1675 if ((m == 1 || m == 17) && ISRELDEP(con))
1677 con = dep2name(pool, con);
1678 if ((providedbyinstalled(pool, map, con, ispatch, noobsoletesmap) & 1) != 0)
1683 continue; /* found a conflict */
1686 if (s->repo && s->repo != oldinstalled)
1688 Id p2, obs, *obsp, *pp;
1692 obsp = s->repo->idarraydata + s->obsoletes;
1693 while ((obs = *obsp++) != 0)
1695 if ((providedbyinstalled(pool, map, obs, 0, 0) & 1) != 0)
1704 FOR_PROVIDES(p2, pp, s->name)
1706 s2 = pool->solvables + p2;
1707 if (s2->name == s->name && (map[p2] & 1) != 0)
1724 queue_init_clone(res, pkgs);
1725 for (i = 0; i < pkgs->count; i++)
1727 m = map[pkgs->elements[i]];
1734 res->elements[i] = r;
1740 pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
1742 pool_trivial_installable_noobsoletesmap(pool, installedmap, pkgs, res, 0);
1746 pool_lookup_str(Pool *pool, Id entry, Id keyname)
1748 if (entry == SOLVID_POS && pool->pos.repo)
1749 return repodata_lookup_str(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1752 return solvable_lookup_str(pool->solvables + entry, keyname);
1756 pool_lookup_id(Pool *pool, Id entry, Id keyname)
1758 if (entry == SOLVID_POS && pool->pos.repo)
1760 Repodata *data = pool->pos.repo->repodata + pool->pos.repodataid;
1761 Id id = repodata_lookup_id(data, SOLVID_POS, keyname);
1762 return data->localpool ? repodata_globalize_id(data, id, 1) : id;
1766 return solvable_lookup_id(pool->solvables + entry, keyname);
1770 pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound)
1772 if (entry == SOLVID_POS && pool->pos.repo)
1775 if (repodata_lookup_num(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, &value))
1781 return solvable_lookup_num(pool->solvables + entry, keyname, notfound);
1785 pool_lookup_void(Pool *pool, Id entry, Id keyname)
1787 if (entry == SOLVID_POS && pool->pos.repo)
1788 return repodata_lookup_void(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname);
1791 return solvable_lookup_void(pool->solvables + entry, keyname);
1794 const unsigned char *
1795 pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1797 if (entry == SOLVID_POS && pool->pos.repo)
1798 return repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1801 return solvable_lookup_bin_checksum(pool->solvables + entry, keyname, typep);
1805 pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep)
1807 if (entry == SOLVID_POS && pool->pos.repo)
1809 const unsigned char *chk = repodata_lookup_bin_checksum(pool->pos.repo->repodata + pool->pos.repodataid, SOLVID_POS, keyname, typep);
1810 return chk ? repodata_chk2str(pool->pos.repo->repodata + pool->pos.repodataid, *typep, chk) : 0;
1814 return solvable_lookup_checksum(pool->solvables + entry, keyname, typep);
1818 pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
1820 int hadhashes = pool->relhashtbl ? 1 : 0;
1826 if (!conflicts->count)
1828 pool_freewhatprovides(pool);
1829 for (i = 0; i < conflicts->count; i += 5)
1831 fn = conflicts->elements[i];
1832 p = conflicts->elements[i + 1];
1833 md5 = conflicts->elements[i + 2];
1834 q = conflicts->elements[i + 3];
1835 id = rel2id(pool, fn, md5, REL_FILECONFLICT, 1);
1836 s = pool->solvables + p;
1839 s->provides = repo_addid_dep(s->repo, s->provides, id, SOLVABLE_FILEMARKER);
1840 s = pool->solvables + q;
1843 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1846 pool_freeidhashes(pool);