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"
28 pool_solvable2str(Pool *pool, Solvable *s)
30 const char *n, *e, *a;
33 n = pool_id2str(pool, s->name);
34 e = pool_id2str(pool, s->evr);
35 /* XXX: may want to skip the epoch here */
36 a = pool_id2str(pool, s->arch);
40 if (pool->havedistepoch)
42 /* strip the distepoch from the evr */
43 const char *de = strrchr(e, '-');
44 if (de && (de = strchr(de, ':')) != 0)
47 p = pool_alloctmpspace(pool, nl + el + al + 3);
50 strncpy(p + nl + 1, e, el);
52 strcpy(p + nl + 1 + el + 1, a);
57 solvable_lookup_type(Solvable *s, Id keyname)
61 return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
65 solvable_lookup_id(Solvable *s, Id keyname)
69 return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
73 solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
80 return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
84 solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
91 return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
95 solvable_lookup_str(Solvable *s, Id keyname)
99 return repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
103 solvable_lookup_str_base(Solvable *s, Id keyname, Id basekeyname, int usebase)
106 const char *str, *basestr;
113 pool = s->repo->pool;
114 str = solvable_lookup_str(s, keyname);
115 if (str || keyname == basekeyname)
117 basestr = solvable_lookup_str(s, basekeyname);
120 /* search for a solvable with same name and same base that has the
122 if (!pool->whatprovides)
123 return usebase ? basestr : 0;
124 /* we do this in two passes, first same vendor, then all other vendors */
125 for (pass = 0; pass < 2; pass++)
127 FOR_PROVIDES(p, pp, s->name)
129 s2 = pool->solvables + p;
130 if (s2->name != s->name)
132 if ((s->vendor == s2->vendor) != (pass == 0))
134 str = solvable_lookup_str(s2, basekeyname);
135 if (!str || strcmp(str, basestr))
137 str = solvable_lookup_str(s2, keyname);
142 return usebase ? basestr : 0;
146 solvable_lookup_str_poollang(Solvable *s, Id keyname)
155 pool = s->repo->pool;
156 if (!pool->nlanguages)
157 return solvable_lookup_str(s, keyname);
158 cols = pool->nlanguages + 1;
159 if (!pool->languagecache)
161 pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
162 pool->languagecacheother = 0;
164 if (keyname >= ID_NUM_INTERNAL)
166 row = pool->languagecache + ID_NUM_INTERNAL * cols;
167 for (i = 0; i < pool->languagecacheother; i++, row += cols)
170 if (i >= pool->languagecacheother)
172 pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
173 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
178 row = pool->languagecache + keyname * cols;
179 row++; /* skip keyname */
180 for (i = 0; i < pool->nlanguages; i++, row++)
183 *row = pool_id2langid(pool, keyname, pool->languages[i], 1);
184 str = solvable_lookup_str_base(s, *row, keyname, 0);
188 return solvable_lookup_str(s, keyname);
192 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase)
196 Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
198 return solvable_lookup_str_base(s, id, keyname, usebase);
202 return solvable_lookup_str(s, keyname);
206 solvable_lookup_num(Solvable *s, Id keyname, unsigned long long notfound)
210 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
214 solvable_lookup_sizek(Solvable *s, Id keyname, unsigned int notfound)
216 unsigned long long size;
219 size = solvable_lookup_num(s, keyname, (unsigned long long)notfound << 10);
220 return (unsigned int)((size + 1023) >> 10);
224 solvable_lookup_void(Solvable *s, Id keyname)
228 return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
232 solvable_lookup_bool(Solvable *s, Id keyname)
236 /* historic nonsense: there are two ways of storing a bool, as num == 1 or void. test both. */
237 if (repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname) == REPOKEY_TYPE_VOID)
239 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
242 const unsigned char *
243 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
245 Repo *repo = s->repo;
252 return repo_lookup_bin_checksum(repo, s - repo->pool->solvables, keyname, typep);
256 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
258 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
259 return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
262 static inline const char *
263 evrid2vrstr(Pool *pool, Id evrid)
265 const char *p, *evr = pool_id2str(pool, evrid);
268 for (p = evr; *p >= '0' && *p <= '9'; p++)
270 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
274 solvable_lookup_location(Solvable *s, unsigned int *medianrp)
279 const char *mediadir, *mediafile;
285 pool = s->repo->pool;
287 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 0);
288 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
289 mediadir = pool_id2str(pool, s->arch);
291 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
293 l = strlen(mediadir) + 1;
294 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
296 const char *name, *evr, *arch;
297 name = pool_id2str(pool, s->name);
298 evr = evrid2vrstr(pool, s->evr);
299 arch = pool_id2str(pool, s->arch);
300 /* name-vr.arch.rpm */
301 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
303 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
305 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
309 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
312 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
314 sprintf(loc, "%s/%s", mediadir, mediafile);
316 strcpy(loc, mediafile);
322 solvable_get_location(Solvable *s, unsigned int *medianrp)
324 const char *loc = solvable_lookup_location(s, medianrp);
325 if (medianrp && *medianrp == 0)
326 *medianrp = 1; /* compat, to be removed */
331 solvable_lookup_sourcepkg(Solvable *s)
334 const char *evr, *name;
339 pool = s->repo->pool;
340 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
341 name = pool_id2str(pool, s->name);
343 name = solvable_lookup_str(s, SOLVABLE_SOURCENAME);
346 archid = solvable_lookup_id(s, SOLVABLE_SOURCEARCH);
347 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
348 evr = evrid2vrstr(pool, s->evr);
350 evr = solvable_lookup_str(s, SOLVABLE_SOURCEEVR);
351 if (archid == ARCH_SRC || archid == ARCH_NOSRC)
354 str = pool_tmpjoin(pool, name, evr ? "-" : 0, evr);
355 str = pool_tmpappend(pool, str, ".", pool_id2str(pool, archid));
356 return pool_tmpappend(pool, str, ".rpm", 0);
359 return name; /* FIXME */
363 /*****************************************************************************/
365 static inline Id dep2name(Pool *pool, Id dep)
367 while (ISRELDEP(dep))
369 Reldep *rd = rd = GETRELDEP(pool, dep);
375 static int providedbyinstalled_multiversion(Pool *pool, Map *installed, Id n, Id con)
378 Solvable *sn = pool->solvables + n;
380 FOR_PROVIDES(p, pp, sn->name)
382 Solvable *s = pool->solvables + p;
383 if (s->name != sn->name || s->arch != sn->arch)
385 if (!MAPTST(installed, p))
387 if (pool_match_nevr(pool, pool->solvables + p, con))
389 return 1; /* found installed package that doesn't conflict */
394 static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep, int ispatch, Map *noobsoletesmap)
397 FOR_PROVIDES(p, pp, dep)
399 if (p == SYSTEMSOLVABLE)
401 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
403 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
404 if (providedbyinstalled_multiversion(pool, installed, p, dep))
406 if (MAPTST(installed, p))
413 * solvable_trivial_installable_map - anwers is a solvable is installable
414 * without any other installs/deinstalls.
415 * The packages considered to be installed are provided via the
416 * installedmap bitmap. A additional "conflictsmap" bitmap providing
417 * information about the conflicts of the installed packages can be
418 * used for extra speed up. Provide a NULL pointer if you do not
419 * have this information.
420 * Both maps can be created with pool_create_state_maps() or
421 * solver_create_state_maps().
424 * 1: solvable is installable without any other package changes
425 * 0: solvable is not installable
426 * -1: solvable is installable, but doesn't constrain any installed packages
429 solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap, Map *noobsoletesmap)
431 Pool *pool = s->repo->pool;
436 int r, interesting = 0;
438 if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
442 reqp = s->repo->idarraydata + s->requires;
443 while ((req = *reqp++) != 0)
445 if (req == SOLVABLE_PREREQMARKER)
447 r = providedbyinstalled(pool, installedmap, req, 0, 0);
458 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
460 conp = s->repo->idarraydata + s->conflicts;
461 while ((con = *conp++) != 0)
463 if (providedbyinstalled(pool, installedmap, con, ispatch, noobsoletesmap))
465 if (ispatch && solvable_is_irrelevant_patch(s, installedmap, 0))
469 if (!interesting && ISRELDEP(con))
471 con = dep2name(pool, con);
472 if (providedbyinstalled(pool, installedmap, con, ispatch, noobsoletesmap))
476 if (ispatch && interesting && solvable_is_irrelevant_patch(s, installedmap, 0))
484 if (s->obsoletes && s->repo != installed)
486 obsp = s->repo->idarraydata + s->obsoletes;
487 while ((obs = *obsp++) != 0)
489 if (providedbyinstalled(pool, installedmap, obs, 0, 0))
493 if (s->repo != installed)
496 FOR_PROVIDES(p, pp, s->name)
498 s2 = pool->solvables + p;
499 if (s2->repo == installed && s2->name == s->name)
509 p = s - pool->solvables;
510 for (i = 1; i < pool->nsolvables; i++)
512 if (!MAPTST(installedmap, i))
514 s2 = pool->solvables + i;
517 conp = s2->repo->idarraydata + s2->conflicts;
518 while ((con = *conp++) != 0)
520 dp = pool_whatprovides_ptr(pool, con);
527 return interesting ? 1 : -1;
531 * different interface for solvable_trivial_installable_map, where
532 * the information about the installed packages is provided
536 solvable_trivial_installable_queue(Solvable *s, Queue *installed, Map *noobsoletesmap)
538 Pool *pool = s->repo->pool;
544 map_init(&installedmap, pool->nsolvables);
545 for (i = 0; i < installed->count; i++)
547 p = installed->elements[i];
548 if (p > 0) /* makes it work with decisionq */
549 MAPSET(&installedmap, p);
551 r = solvable_trivial_installable_map(s, &installedmap, 0, noobsoletesmap);
552 map_free(&installedmap);
557 * different interface for solvable_trivial_installable_map, where
558 * the information about the installed packages is provided
559 * by a repo containing the installed solvables.
562 solvable_trivial_installable_repo(Solvable *s, Repo *installed, Map *noobsoletesmap)
564 Pool *pool = s->repo->pool;
570 map_init(&installedmap, pool->nsolvables);
571 FOR_REPO_SOLVABLES(installed, p, s2)
572 MAPSET(&installedmap, p);
573 r = solvable_trivial_installable_map(s, &installedmap, 0, noobsoletesmap);
574 map_free(&installedmap);
579 /* check if this patch is relevant according to the vendor. To bad that patches
580 * don't have a vendor, so we need to do some careful repo testing. */
582 solvable_is_irrelevant_patch(Solvable *s, Map *installedmap, Solver *solv)
584 Pool *pool = s->repo->pool;
586 int hadpatchpackage = 0;
590 conp = s->repo->idarraydata + s->conflicts;
591 while ((con = *conp++) != 0)
597 rd = GETRELDEP(pool, con);
598 if (rd->flags != REL_LT)
600 FOR_PROVIDES(p, pp, con)
603 if (!MAPTST(installedmap, p))
605 si = pool->solvables + p;
606 if (!pool_match_nevr(pool, si, con))
608 FOR_PROVIDES(p2, pp2, rd->name)
610 Solvable *s2 = pool->solvables + p2;
611 if (!pool_match_nevr(pool, s2, rd->name))
613 if (pool_match_nevr(pool, s2, con))
614 continue; /* does not fulfill patch */
615 if (s2->repo == s->repo)
618 /* ok, we have a package from the patch repo that solves the conflict. check vendor */
619 if (si->vendor == s2->vendor)
621 /* FIXME: solv is only needed for the vendorchange callback */
624 if (!policy_illegal_vendorchange(solv, si, s2))
629 Id v1 = si->vendor ? si->vendor : ID_EMPTY;
630 Id v2 = s2->vendor ? s2->vendor : ID_EMPTY;
633 v1 = pool_vendor2mask(pool, v1);
634 v2 = pool_vendor2mask(pool, v2);
638 /* vendor change was illegal, ignore conflict */
643 /* if we didn't find a patchpackage don't claim that the patch is irrelevant */
644 if (!hadpatchpackage)
649 /*****************************************************************************/
652 * Create maps containing the state of each solvable. Input is a "installed" queue,
653 * it contains all solvable ids that are considered to be installed.
655 * The created maps can be used for solvable_trivial_installable_map(),
656 * pool_calc_duchanges(), pool_calc_installsizechange().
660 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
667 map_init(installedmap, pool->nsolvables);
669 map_init(conflictsmap, pool->nsolvables);
670 for (i = 0; i < installed->count; i++)
672 p = installed->elements[i];
673 if (p <= 0) /* makes it work with decisionq */
675 MAPSET(installedmap, p);
678 s = pool->solvables + p;
681 conp = s->repo->idarraydata + s->conflicts;
682 while ((con = *conp++) != 0)
684 dp = pool_whatprovides_ptr(pool, con);
686 MAPSET(conflictsmap, *dp);
691 /* Tests if two solvables have identical content. Currently
692 * both solvables need to come from the same pool
695 solvable_identical(Solvable *s1, Solvable *s2)
697 unsigned int bt1, bt2;
701 if (s1->name != s2->name)
703 if (s1->arch != s2->arch)
705 if (s1->evr != s2->evr)
707 /* map missing vendor to empty string */
708 if ((s1->vendor ? s1->vendor : 1) != (s2->vendor ? s2->vendor : 1))
711 /* looking good, try some fancier stuff */
712 /* might also look up the package checksum here */
713 bt1 = solvable_lookup_num(s1, SOLVABLE_BUILDTIME, 0);
714 bt2 = solvable_lookup_num(s2, SOLVABLE_BUILDTIME, 0);
722 /* look at requires in a last attempt to find recompiled packages */
725 for (reqp = s1->repo->idarraydata + s1->requires; *reqp; reqp++)
728 for (reqp = s2->repo->idarraydata + s2->requires; *reqp; reqp++)
736 /* return the self provide dependency of a solvable */
738 solvable_selfprovidedep(Solvable *s)
746 pool = s->repo->pool;
749 provp = s->repo->idarraydata + s->provides;
750 while ((prov = *provp++) != 0)
754 rd = GETRELDEP(pool, prov);
755 if (rd->name == s->name && rd->evr == s->evr && rd->flags == REL_EQ)
759 return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
762 /* setter functions, simply call the repo variants */
764 solvable_set_id(Solvable *s, Id keyname, Id id)
766 repo_set_id(s->repo, s - s->repo->pool->solvables, keyname, id);
770 solvable_set_num(Solvable *s, Id keyname, unsigned long long num)
772 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
776 solvable_set_str(Solvable *s, Id keyname, const char *str)
778 repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
782 solvable_set_poolstr(Solvable *s, Id keyname, const char *str)
784 repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
788 solvable_add_poolstr_array(Solvable *s, Id keyname, const char *str)
790 repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
794 solvable_add_idarray(Solvable *s, Id keyname, Id id)
796 repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
800 solvable_add_deparray(Solvable *s, Id keyname, Id dep, Id marker)
802 repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
806 solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
808 repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
812 solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
814 repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
818 solvable_unset(Solvable *s, Id keyname)
820 repo_unset(s->repo, s - s->repo->pool->solvables, keyname);