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
26 pool_solvable2str(Pool *pool, Solvable *s)
28 const char *n, *e, *a;
31 n = pool_id2str(pool, s->name);
32 e = pool_id2str(pool, s->evr);
33 /* XXX: may want to skip the epoch here */
34 a = pool_id2str(pool, s->arch);
38 if (pool->havedistepoch)
40 /* strip the distepoch from the evr */
41 const char *de = strrchr(e, '-');
42 if (de && (de = strchr(de, ':')) != 0)
45 p = pool_alloctmpspace(pool, nl + el + al + 3);
48 strncpy(p + nl + 1, e, el);
50 strcpy(p + nl + 1 + el + 1, a);
55 solvable_lookup_type(Solvable *s, Id keyname)
59 return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
63 solvable_lookup_id(Solvable *s, Id keyname)
67 return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
71 solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
78 return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
82 solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
89 return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
93 solvable_lookup_str(Solvable *s, Id keyname)
97 return repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
101 solvable_lookup_str_base(Solvable *s, Id keyname, Id basekeyname, int usebase)
104 const char *str, *basestr;
111 pool = s->repo->pool;
112 str = solvable_lookup_str(s, keyname);
113 if (str || keyname == basekeyname)
115 basestr = solvable_lookup_str(s, basekeyname);
118 /* search for a solvable with same name and same base that has the
120 if (!pool->whatprovides)
121 return usebase ? basestr : 0;
122 /* we do this in two passes, first same vendor, then all other vendors */
123 for (pass = 0; pass < 2; pass++)
125 FOR_PROVIDES(p, pp, s->name)
127 s2 = pool->solvables + p;
128 if (s2->name != s->name)
130 if ((s->vendor == s2->vendor) != (pass == 0))
132 str = solvable_lookup_str(s2, basekeyname);
133 if (!str || strcmp(str, basestr))
135 str = solvable_lookup_str(s2, keyname);
140 return usebase ? basestr : 0;
144 solvable_lookup_str_poollang(Solvable *s, Id keyname)
153 pool = s->repo->pool;
154 if (!pool->nlanguages)
155 return solvable_lookup_str(s, keyname);
156 cols = pool->nlanguages + 1;
157 if (!pool->languagecache)
159 pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
160 pool->languagecacheother = 0;
162 if (keyname >= ID_NUM_INTERNAL)
164 row = pool->languagecache + ID_NUM_INTERNAL * cols;
165 for (i = 0; i < pool->languagecacheother; i++, row += cols)
168 if (i >= pool->languagecacheother)
170 pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
171 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
176 row = pool->languagecache + keyname * cols;
177 row++; /* skip keyname */
178 for (i = 0; i < pool->nlanguages; i++, row++)
181 *row = pool_id2langid(pool, keyname, pool->languages[i], 1);
182 str = solvable_lookup_str_base(s, *row, keyname, 0);
186 return solvable_lookup_str(s, keyname);
190 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase)
194 Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
196 return solvable_lookup_str_base(s, id, keyname, usebase);
200 return solvable_lookup_str(s, keyname);
204 solvable_lookup_num(Solvable *s, Id keyname, unsigned long long notfound)
208 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
212 solvable_lookup_sizek(Solvable *s, Id keyname, unsigned int notfound)
214 unsigned long long size;
217 size = solvable_lookup_num(s, keyname, (unsigned long long)notfound << 10);
218 return (unsigned int)((size + 1023) >> 10);
222 solvable_lookup_void(Solvable *s, Id keyname)
226 return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
230 solvable_lookup_bool(Solvable *s, Id keyname)
234 /* historic nonsense: there are two ways of storing a bool, as num == 1 or void. test both. */
235 if (repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname) == REPOKEY_TYPE_VOID)
237 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
240 const unsigned char *
241 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
243 Repo *repo = s->repo;
250 return repo_lookup_bin_checksum(repo, s - repo->pool->solvables, keyname, typep);
254 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
256 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
257 return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
260 static inline const char *
261 evrid2vrstr(Pool *pool, Id evrid)
263 const char *p, *evr = pool_id2str(pool, evrid);
266 for (p = evr; *p >= '0' && *p <= '9'; p++)
268 return p != evr && *p == ':' && p[1] ? p + 1 : evr;
272 solvable_get_location(Solvable *s, unsigned int *medianrp)
277 const char *mediadir, *mediafile;
283 pool = s->repo->pool;
285 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
286 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
287 mediadir = pool_id2str(pool, s->arch);
289 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
291 l = strlen(mediadir) + 1;
292 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
294 const char *name, *evr, *arch;
295 name = pool_id2str(pool, s->name);
296 evr = evrid2vrstr(pool, s->evr);
297 arch = pool_id2str(pool, s->arch);
298 /* name-vr.arch.rpm */
299 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
301 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
303 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
307 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
310 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
312 sprintf(loc, "%s/%s", mediadir, mediafile);
314 strcpy(loc, mediafile);
320 solvable_lookup_sourcepkg(Solvable *s)
323 const char *evr, *name;
328 pool = s->repo->pool;
329 if (solvable_lookup_void(s, SOLVABLE_SOURCENAME))
330 name = pool_id2str(pool, s->name);
332 name = solvable_lookup_str(s, SOLVABLE_SOURCENAME);
335 archid = solvable_lookup_id(s, SOLVABLE_SOURCEARCH);
336 if (solvable_lookup_void(s, SOLVABLE_SOURCEEVR))
337 evr = evrid2vrstr(pool, s->evr);
339 evr = solvable_lookup_str(s, SOLVABLE_SOURCEEVR);
340 if (archid == ARCH_SRC || archid == ARCH_NOSRC)
343 str = pool_tmpjoin(pool, name, evr ? "-" : 0, evr);
344 str = pool_tmpappend(pool, str, ".", pool_id2str(pool, archid));
345 return pool_tmpappend(pool, str, ".rpm", 0);
348 return name; /* FIXME */
352 /*****************************************************************************/
354 static inline Id dep2name(Pool *pool, Id dep)
356 while (ISRELDEP(dep))
358 Reldep *rd = rd = GETRELDEP(pool, dep);
364 static int providedbyinstalled_multiversion(Pool *pool, Map *installed, Id n, Id con)
367 Solvable *sn = pool->solvables + n;
369 FOR_PROVIDES(p, pp, sn->name)
371 Solvable *s = pool->solvables + p;
372 if (s->name != sn->name || s->arch != sn->arch)
374 if (!MAPTST(installed, p))
376 if (pool_match_nevr(pool, pool->solvables + p, con))
378 return 1; /* found installed package that doesn't conflict */
383 static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep, int ispatch, Map *noobsoletesmap)
386 FOR_PROVIDES(p, pp, dep)
388 if (p == SYSTEMSOLVABLE)
390 if (ispatch && !pool_match_nevr(pool, pool->solvables + p, dep))
392 if (ispatch && noobsoletesmap && noobsoletesmap->size && MAPTST(noobsoletesmap, p) && ISRELDEP(dep))
393 if (providedbyinstalled_multiversion(pool, installed, p, dep))
395 if (MAPTST(installed, p))
402 * solvable_trivial_installable_map - anwers is a solvable is installable
403 * without any other installs/deinstalls.
404 * The packages considered to be installed are provided via the
405 * installedmap bitmap. A additional "conflictsmap" bitmap providing
406 * information about the conflicts of the installed packages can be
407 * used for extra speed up. Provide a NULL pointer if you do not
408 * have this information.
409 * Both maps can be created with pool_create_state_maps() or
410 * solver_create_state_maps().
413 * 1: solvable is installable without any other package changes
414 * 0: solvable is not installable
415 * -1: solvable is installable, but doesn't constrain any installed packages
418 solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap, Map *noobsoletesmap)
420 Pool *pool = s->repo->pool;
425 int r, interesting = 0;
427 if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
431 reqp = s->repo->idarraydata + s->requires;
432 while ((req = *reqp++) != 0)
434 if (req == SOLVABLE_PREREQMARKER)
436 r = providedbyinstalled(pool, installedmap, req, 0, 0);
447 if (!strncmp("patch:", pool_id2str(pool, s->name), 6))
449 conp = s->repo->idarraydata + s->conflicts;
450 while ((con = *conp++) != 0)
452 if (providedbyinstalled(pool, installedmap, con, ispatch, noobsoletesmap))
454 if (!interesting && ISRELDEP(con))
456 con = dep2name(pool, con);
457 if (providedbyinstalled(pool, installedmap, con, ispatch, noobsoletesmap))
467 if (s->obsoletes && s->repo != installed)
469 obsp = s->repo->idarraydata + s->obsoletes;
470 while ((obs = *obsp++) != 0)
472 if (providedbyinstalled(pool, installedmap, obs, 0, 0))
476 if (s->repo != installed)
479 FOR_PROVIDES(p, pp, s->name)
481 s2 = pool->solvables + p;
482 if (s2->repo == installed && s2->name == s->name)
492 p = s - pool->solvables;
493 for (i = 1; i < pool->nsolvables; i++)
495 if (!MAPTST(installedmap, i))
497 s2 = pool->solvables + i;
500 conp = s2->repo->idarraydata + s2->conflicts;
501 while ((con = *conp++) != 0)
503 dp = pool_whatprovides_ptr(pool, con);
510 return interesting ? 1 : -1;
514 * different interface for solvable_trivial_installable_map, where
515 * the information about the installed packages is provided
519 solvable_trivial_installable_queue(Solvable *s, Queue *installed, Map *noobsoletesmap)
521 Pool *pool = s->repo->pool;
527 map_init(&installedmap, pool->nsolvables);
528 for (i = 0; i < installed->count; i++)
530 p = installed->elements[i];
531 if (p > 0) /* makes it work with decisionq */
532 MAPSET(&installedmap, p);
534 r = solvable_trivial_installable_map(s, &installedmap, 0, noobsoletesmap);
535 map_free(&installedmap);
540 * different interface for solvable_trivial_installable_map, where
541 * the information about the installed packages is provided
542 * by a repo containing the installed solvables.
545 solvable_trivial_installable_repo(Solvable *s, Repo *installed, Map *noobsoletesmap)
547 Pool *pool = s->repo->pool;
553 map_init(&installedmap, pool->nsolvables);
554 FOR_REPO_SOLVABLES(installed, p, s2)
555 MAPSET(&installedmap, p);
556 r = solvable_trivial_installable_map(s, &installedmap, 0, noobsoletesmap);
557 map_free(&installedmap);
562 /*****************************************************************************/
565 * Create maps containing the state of each solvable. Input is a "installed" queue,
566 * it contains all solvable ids that are considered to be installed.
568 * The created maps can be used for solvable_trivial_installable_map(),
569 * pool_calc_duchanges(), pool_calc_installsizechange().
573 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
580 map_init(installedmap, pool->nsolvables);
582 map_init(conflictsmap, pool->nsolvables);
583 for (i = 0; i < installed->count; i++)
585 p = installed->elements[i];
586 if (p <= 0) /* makes it work with decisionq */
588 MAPSET(installedmap, p);
591 s = pool->solvables + p;
594 conp = s->repo->idarraydata + s->conflicts;
595 while ((con = *conp++) != 0)
597 dp = pool_whatprovides_ptr(pool, con);
599 MAPSET(conflictsmap, *dp);
604 /* Tests if two solvables have identical content. Currently
605 * both solvables need to come from the same pool
608 solvable_identical(Solvable *s1, Solvable *s2)
610 unsigned int bt1, bt2;
614 if (s1->name != s2->name)
616 if (s1->arch != s2->arch)
618 if (s1->evr != s2->evr)
620 /* map missing vendor to empty string */
621 if ((s1->vendor ? s1->vendor : 1) != (s2->vendor ? s2->vendor : 1))
624 /* looking good, try some fancier stuff */
625 /* might also look up the package checksum here */
626 bt1 = solvable_lookup_num(s1, SOLVABLE_BUILDTIME, 0);
627 bt2 = solvable_lookup_num(s2, SOLVABLE_BUILDTIME, 0);
635 /* look at requires in a last attempt to find recompiled packages */
638 for (reqp = s1->repo->idarraydata + s1->requires; *reqp; reqp++)
641 for (reqp = s2->repo->idarraydata + s2->requires; *reqp; reqp++)
649 /* return the self provide dependency of a solvable */
651 solvable_selfprovidedep(Solvable *s)
659 pool = s->repo->pool;
662 provp = s->repo->idarraydata + s->provides;
663 while ((prov = *provp++) != 0)
667 rd = GETRELDEP(pool, prov);
668 if (rd->name == s->name && rd->evr == s->evr && rd->flags == REL_EQ)
672 return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
675 /* setter functions, simply call the repo variants */
677 solvable_set_id(Solvable *s, Id keyname, Id id)
679 repo_set_id(s->repo, s - s->repo->pool->solvables, keyname, id);
683 solvable_set_num(Solvable *s, Id keyname, unsigned long long num)
685 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
689 solvable_set_str(Solvable *s, Id keyname, const char *str)
691 repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
695 solvable_set_poolstr(Solvable *s, Id keyname, const char *str)
697 repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
701 solvable_add_poolstr_array(Solvable *s, Id keyname, const char *str)
703 repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
707 solvable_add_idarray(Solvable *s, Id keyname, Id id)
709 repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
713 solvable_add_deparray(Solvable *s, Id keyname, Id dep, Id marker)
715 repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
719 solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
721 repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
725 solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
727 repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);