2 * Copyright (c) 2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * set/retrieve data from solvables
24 #include "poolvendor.h"
26 #include "linkedpkg.h"
29 pool_solvable2str(Pool *pool, Solvable *s)
31 const char *n, *e, *a;
34 n = pool_id2str(pool, s->name);
35 e = pool_id2str(pool, s->evr);
36 /* XXX: may want to skip the epoch here */
37 a = pool_id2str(pool, s->arch);
41 if (pool->havedistepoch)
43 /* strip the distepoch from the evr */
44 const char *de = strrchr(e, '-');
45 if (de && (de = strchr(de, ':')) != 0)
48 p = pool_alloctmpspace(pool, nl + el + al + 3);
53 strncpy(p + nl, e, el);
58 p[nl + el] = pool->disttype == DISTTYPE_HAIKU ? '-' : '.';
59 strcpy(p + nl + el + 1, a);
65 solvable_lookup_type(Solvable *s, Id keyname)
69 return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
73 solvable_lookup_id(Solvable *s, Id keyname)
77 return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
81 solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
88 return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
92 solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
99 return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
103 solvable_lookup_str_joinarray(Solvable *s, Id keyname, const char *joinstr)
109 queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
110 if (solvable_lookup_idarray(s, keyname, &q) && q.count)
112 Pool *pool = s->repo->pool;
114 str = pool_tmpjoin(pool, pool_id2str(pool, q.elements[0]), 0, 0);
115 for (i = 1; i < q.count; i++)
116 str = pool_tmpappend(pool, str, joinstr, pool_id2str(pool, q.elements[i]));
123 solvable_lookup_str(Solvable *s, Id keyname)
128 str = repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
129 if (!str && (keyname == SOLVABLE_LICENSE || keyname == SOLVABLE_GROUP))
130 str = solvable_lookup_str_joinarray(s, keyname, ", ");
135 solvable_lookup_str_base(Solvable *s, Id keyname, Id basekeyname, int usebase)
138 const char *str, *basestr;
145 pool = s->repo->pool;
146 str = solvable_lookup_str(s, keyname);
147 if (str || keyname == basekeyname)
149 basestr = solvable_lookup_str(s, basekeyname);
152 /* search for a solvable with same name and same base that has the
154 if (!pool->whatprovides)
155 return usebase ? basestr : 0;
157 /* we do this in two passes, first same vendor, then all other vendors */
158 for (pass = 0; pass < 2; pass++)
160 FOR_PROVIDES(p, pp, name)
162 s2 = pool->solvables + p;
163 if (s2->name != name)
165 if ((s->vendor == s2->vendor) != (pass == 0))
167 str = solvable_lookup_str(s2, basekeyname);
168 if (!str || strcmp(str, basestr))
170 str = solvable_lookup_str(s2, keyname);
174 #ifdef ENABLE_LINKED_PKGS
175 /* autopattern translation magic */
176 if (pass && !strncmp("pattern:", pool_id2str(pool, name), 8) && (name = find_autopattern_name(pool, s)) != 0)
180 return usebase ? basestr : 0;
184 solvable_lookup_str_poollang(Solvable *s, Id keyname)
193 pool = s->repo->pool;
194 if (!pool->nlanguages)
195 return solvable_lookup_str(s, keyname);
196 cols = pool->nlanguages + 1;
197 if (!pool->languagecache)
199 pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
200 pool->languagecacheother = 0;
202 if (keyname >= ID_NUM_INTERNAL)
204 row = pool->languagecache + ID_NUM_INTERNAL * cols;
205 for (i = 0; i < pool->languagecacheother; i++, row += cols)
208 if (i >= pool->languagecacheother)
210 pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
211 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
216 row = pool->languagecache + keyname * cols;
217 row++; /* skip keyname */
218 for (i = 0; i < pool->nlanguages; i++, row++)
221 *row = pool_id2langid(pool, keyname, pool->languages[i], 1);
222 str = solvable_lookup_str_base(s, *row, keyname, 0);
226 return solvable_lookup_str(s, keyname);
230 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase)
234 Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
236 return solvable_lookup_str_base(s, id, keyname, usebase);
240 return solvable_lookup_str(s, keyname);
244 solvable_lookup_num(Solvable *s, Id keyname, unsigned long long notfound)
248 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
252 solvable_lookup_sizek(Solvable *s, Id keyname, unsigned int notfound)
254 unsigned long long size;
257 size = solvable_lookup_num(s, keyname, (unsigned long long)notfound << 10);
258 return (unsigned int)((size + 1023) >> 10);
262 solvable_lookup_void(Solvable *s, Id keyname)
266 return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
270 solvable_lookup_bool(Solvable *s, Id keyname)
274 /* historic nonsense: there are two ways of storing a bool, as num == 1 or void. test both. */
275 if (repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname) == REPOKEY_TYPE_VOID)
277 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
280 const unsigned char *
281 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
283 Repo *repo = s->repo;
290 return repo_lookup_bin_checksum(repo, s - repo->pool->solvables, keyname, typep);
294 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
296 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
297 return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
300 static inline const char *
301 evrid2vrstr(Pool *pool, Id evrid)
303 const char *p, *evr = pool_id2str(pool, evrid);
306 for (p = evr; *p >= '0' && *p <= '9'; p++)
308 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
312 solvable_lookup_location(Solvable *s, unsigned int *medianrp)
317 const char *mediadir, *mediafile;
323 pool = s->repo->pool;
325 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 0);
326 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
327 mediadir = pool_id2str(pool, s->arch);
329 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
331 l = strlen(mediadir) + 1;
332 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
334 const char *name, *evr, *arch;
335 name = pool_id2str(pool, s->name);
336 evr = evrid2vrstr(pool, s->evr);
337 arch = pool_id2str(pool, s->arch);
338 /* name-vr.arch.rpm */
339 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
341 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
343 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
347 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
350 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
352 sprintf(loc, "%s/%s", mediadir, mediafile);
354 strcpy(loc, mediafile);
360 solvable_get_location(Solvable *s, unsigned int *medianrp)
362 const char *loc = solvable_lookup_location(s, medianrp);
363 if (medianrp && *medianrp == 0)
364 *medianrp = 1; /* compat, to be removed */
369 solvable_lookup_sourcepkg(Solvable *s)
372 const char *evr, *name;
377 pool = s->repo->pool;
378 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
379 name = pool_id2str(pool, s->name);
381 name = solvable_lookup_str(s, SOLVABLE_SOURCENAME);
384 archid = solvable_lookup_id(s, SOLVABLE_SOURCEARCH);
385 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
386 evr = evrid2vrstr(pool, s->evr);
388 evr = solvable_lookup_str(s, SOLVABLE_SOURCEEVR);
389 if (archid == ARCH_SRC || archid == ARCH_NOSRC)
392 str = pool_tmpjoin(pool, name, evr ? "-" : 0, evr);
393 str = pool_tmpappend(pool, str, ".", pool_id2str(pool, archid));
394 return pool_tmpappend(pool, str, ".rpm", 0);
397 return name; /* FIXME */
401 /*****************************************************************************/
403 static inline Id dep2name(Pool *pool, Id dep)
405 while (ISRELDEP(dep))
407 Reldep *rd = GETRELDEP(pool, dep);
413 static int providedbyinstalled_multiversion(Pool *pool, Map *installed, Id n, Id con)
416 Solvable *sn = pool->solvables + n;
418 FOR_PROVIDES(p, pp, sn->name)
420 Solvable *s = pool->solvables + p;
421 if (s->name != sn->name || s->arch != sn->arch)
423 if (!MAPTST(installed, p))
425 if (pool_match_nevr(pool, pool->solvables + p, con))
427 return 1; /* found installed package that doesn't conflict */
432 static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep, int ispatch, Map *multiversionmap)
435 FOR_PROVIDES(p, pp, dep)
437 if (p == SYSTEMSOLVABLE)
439 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
441 if (ispatch && multiversionmap && multiversionmap->size && MAPTST(multiversionmap, p) && ISRELDEP(dep))
442 if (providedbyinstalled_multiversion(pool, installed, p, dep))
444 if (MAPTST(installed, p))
451 * solvable_trivial_installable_map - anwers is a solvable is installable
452 * without any other installs/deinstalls.
453 * The packages considered to be installed are provided via the
454 * installedmap bitmap. A additional "conflictsmap" bitmap providing
455 * information about the conflicts of the installed packages can be
456 * used for extra speed up. Provide a NULL pointer if you do not
457 * have this information.
458 * Both maps can be created with pool_create_state_maps() or
459 * solver_create_state_maps().
462 * 1: solvable is installable without any other package changes
463 * 0: solvable is not installable
464 * -1: solvable is installable, but doesn't constrain any installed packages
467 solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap, Map *multiversionmap)
469 Pool *pool = s->repo->pool;
474 int r, interesting = 0;
476 if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
480 reqp = s->repo->idarraydata + s->requires;
481 while ((req = *reqp++) != 0)
483 if (req == SOLVABLE_PREREQMARKER)
485 r = providedbyinstalled(pool, installedmap, req, 0, 0);
496 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
498 conp = s->repo->idarraydata + s->conflicts;
499 while ((con = *conp++) != 0)
501 if (providedbyinstalled(pool, installedmap, con, ispatch, multiversionmap))
503 if (ispatch && solvable_is_irrelevant_patch(s, installedmap))
507 if (!interesting && ISRELDEP(con))
509 con = dep2name(pool, con);
510 if (providedbyinstalled(pool, installedmap, con, ispatch, multiversionmap))
514 if (ispatch && interesting && solvable_is_irrelevant_patch(s, installedmap))
522 if (s->obsoletes && s->repo != installed)
524 obsp = s->repo->idarraydata + s->obsoletes;
525 while ((obs = *obsp++) != 0)
527 if (providedbyinstalled(pool, installedmap, obs, 0, 0))
531 if (s->repo != installed)
534 FOR_PROVIDES(p, pp, s->name)
536 s2 = pool->solvables + p;
537 if (s2->repo == installed && s2->name == s->name)
547 p = s - pool->solvables;
548 for (i = 1; i < pool->nsolvables; i++)
550 if (!MAPTST(installedmap, i))
552 s2 = pool->solvables + i;
555 conp = s2->repo->idarraydata + s2->conflicts;
556 while ((con = *conp++) != 0)
558 dp = pool_whatprovides_ptr(pool, con);
565 return interesting ? 1 : -1;
569 * different interface for solvable_trivial_installable_map, where
570 * the information about the installed packages is provided
574 solvable_trivial_installable_queue(Solvable *s, Queue *installed, Map *multiversionmap)
576 Pool *pool = s->repo->pool;
582 map_init(&installedmap, pool->nsolvables);
583 for (i = 0; i < installed->count; i++)
585 p = installed->elements[i];
586 if (p > 0) /* makes it work with decisionq */
587 MAPSET(&installedmap, p);
589 r = solvable_trivial_installable_map(s, &installedmap, 0, multiversionmap);
590 map_free(&installedmap);
595 * different interface for solvable_trivial_installable_map, where
596 * the information about the installed packages is provided
597 * by a repo containing the installed solvables.
600 solvable_trivial_installable_repo(Solvable *s, Repo *installed, Map *multiversionmap)
602 Pool *pool = s->repo->pool;
608 map_init(&installedmap, pool->nsolvables);
609 FOR_REPO_SOLVABLES(installed, p, s2)
610 MAPSET(&installedmap, p);
611 r = solvable_trivial_installable_map(s, &installedmap, 0, multiversionmap);
612 map_free(&installedmap);
616 /* FIXME: this mirrors policy_illegal_vendorchange */
618 pool_illegal_vendorchange(Pool *pool, Solvable *s1, Solvable *s2)
621 Id vendormask1, vendormask2;
623 if (pool->custom_vendorcheck)
624 return pool->custom_vendorcheck(pool, s1, s2);
625 /* treat a missing vendor as empty string */
626 v1 = s1->vendor ? s1->vendor : ID_EMPTY;
627 v2 = s2->vendor ? s2->vendor : ID_EMPTY;
630 vendormask1 = pool_vendor2mask(pool, v1);
632 return 1; /* can't match */
633 vendormask2 = pool_vendor2mask(pool, v2);
634 if ((vendormask1 & vendormask2) != 0)
636 return 1; /* no class matches */
639 /* check if this patch is relevant according to the vendor. To bad that patches
640 * don't have a vendor, so we need to do some careful repo testing. */
642 solvable_is_irrelevant_patch(Solvable *s, Map *installedmap)
644 Pool *pool = s->repo->pool;
646 int hadpatchpackage = 0;
650 conp = s->repo->idarraydata + s->conflicts;
651 while ((con = *conp++) != 0)
657 rd = GETRELDEP(pool, con);
658 if (rd->flags != REL_LT)
660 FOR_PROVIDES(p, pp, con)
663 if (!MAPTST(installedmap, p))
665 si = pool->solvables + p;
666 if (!pool_match_nevr(pool, si, con))
668 FOR_PROVIDES(p2, pp2, rd->name)
670 Solvable *s2 = pool->solvables + p2;
671 if (!pool_match_nevr(pool, s2, rd->name))
673 if (pool_match_nevr(pool, s2, con))
674 continue; /* does not fulfill patch */
675 if (s2->repo == s->repo)
678 /* ok, we have a package from the patch repo that solves the conflict. check vendor */
679 if (si->vendor == s2->vendor)
681 if (!pool_illegal_vendorchange(pool, si, s2))
683 /* vendor change was illegal, ignore conflict */
688 /* if we didn't find a patchpackage don't claim that the patch is irrelevant */
689 if (!hadpatchpackage)
694 /*****************************************************************************/
697 * Create maps containing the state of each solvable. Input is a "installed" queue,
698 * it contains all solvable ids that are considered to be installed.
700 * The created maps can be used for solvable_trivial_installable_map(),
701 * pool_calc_duchanges(), pool_calc_installsizechange().
705 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
712 map_init(installedmap, pool->nsolvables);
714 map_init(conflictsmap, pool->nsolvables);
715 for (i = 0; i < installed->count; i++)
717 p = installed->elements[i];
718 if (p <= 0) /* makes it work with decisionq */
720 MAPSET(installedmap, p);
723 s = pool->solvables + p;
726 conp = s->repo->idarraydata + s->conflicts;
727 while ((con = *conp++) != 0)
729 dp = pool_whatprovides_ptr(pool, con);
731 MAPSET(conflictsmap, *dp);
736 /* Tests if two solvables have identical content. Currently
737 * both solvables need to come from the same pool
740 solvable_identical(Solvable *s1, Solvable *s2)
742 unsigned int bt1, bt2;
746 if (s1->name != s2->name)
748 if (s1->arch != s2->arch)
750 if (s1->evr != s2->evr)
752 /* map missing vendor to empty string */
753 if ((s1->vendor ? s1->vendor : 1) != (s2->vendor ? s2->vendor : 1))
756 /* looking good, try some fancier stuff */
757 /* might also look up the package checksum here */
758 bt1 = solvable_lookup_num(s1, SOLVABLE_BUILDTIME, 0);
759 bt2 = solvable_lookup_num(s2, SOLVABLE_BUILDTIME, 0);
767 /* look at requires in a last attempt to find recompiled packages */
770 for (reqp = s1->repo->idarraydata + s1->requires; *reqp; reqp++)
773 for (reqp = s2->repo->idarraydata + s2->requires; *reqp; reqp++)
781 /* return the self provide dependency of a solvable */
783 solvable_selfprovidedep(Solvable *s)
791 pool = s->repo->pool;
794 provp = s->repo->idarraydata + s->provides;
795 while ((prov = *provp++) != 0)
799 rd = GETRELDEP(pool, prov);
800 if (rd->name == s->name && rd->evr == s->evr && rd->flags == REL_EQ)
804 return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
807 /* setter functions, simply call the repo variants */
809 solvable_set_id(Solvable *s, Id keyname, Id id)
811 repo_set_id(s->repo, s - s->repo->pool->solvables, keyname, id);
815 solvable_set_num(Solvable *s, Id keyname, unsigned long long num)
817 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
821 solvable_set_str(Solvable *s, Id keyname, const char *str)
823 repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
827 solvable_set_poolstr(Solvable *s, Id keyname, const char *str)
829 repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
833 solvable_add_poolstr_array(Solvable *s, Id keyname, const char *str)
835 repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
839 solvable_add_idarray(Solvable *s, Id keyname, Id id)
841 repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
845 solvable_add_deparray(Solvable *s, Id keyname, Id dep, Id marker)
847 repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
851 solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
853 repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
857 solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
859 repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
863 solvable_unset(Solvable *s, Id keyname)
865 repo_unset(s->repo, s - s->repo->pool->solvables, keyname);
868 /* return true if a dependency intersects dep in the keyname array */
870 solvable_matchesdep(Solvable *s, Id keyname, Id dep, int marker)
873 Pool *pool = s->repo->pool;
876 solvable_lookup_deparray(s, keyname, &q, marker);
877 for (i = 0; i < q.count; i++)
878 if (pool_match_dep(pool, q.elements[i], dep))
880 i = i == q.count ? 0 : 1;