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;
30 n = pool_id2str(pool, s->name);
31 e = pool_id2str(pool, s->evr);
32 a = pool_id2str(pool, s->arch);
33 p = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
34 sprintf(p, "%s-%s.%s", n, e, a);
39 solvable_lookup_type(Solvable *s, Id keyname)
43 return repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname);
47 solvable_lookup_id(Solvable *s, Id keyname)
51 return repo_lookup_id(s->repo, s - s->repo->pool->solvables, keyname);
55 solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
62 return repo_lookup_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
66 solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
73 return repo_lookup_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);
77 solvable_lookup_str(Solvable *s, Id keyname)
81 return repo_lookup_str(s->repo, s - s->repo->pool->solvables, keyname);
85 solvable_lookup_str_base(Solvable *s, Id keyname, Id basekeyname, int usebase)
88 const char *str, *basestr;
96 str = solvable_lookup_str(s, keyname);
97 if (str || keyname == basekeyname)
99 basestr = solvable_lookup_str(s, basekeyname);
102 /* search for a solvable with same name and same base that has the
104 if (!pool->whatprovides)
105 return usebase ? basestr : 0;
106 /* we do this in two passes, first same vendor, then all other vendors */
107 for (pass = 0; pass < 2; pass++)
109 FOR_PROVIDES(p, pp, s->name)
111 s2 = pool->solvables + p;
112 if (s2->name != s->name)
114 if ((s->vendor == s2->vendor) != (pass == 0))
116 str = solvable_lookup_str(s2, basekeyname);
117 if (!str || strcmp(str, basestr))
119 str = solvable_lookup_str(s2, keyname);
124 return usebase ? basestr : 0;
128 solvable_lookup_str_poollang(Solvable *s, Id keyname)
137 pool = s->repo->pool;
138 if (!pool->nlanguages)
139 return solvable_lookup_str(s, keyname);
140 cols = pool->nlanguages + 1;
141 if (!pool->languagecache)
143 pool->languagecache = solv_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
144 pool->languagecacheother = 0;
146 if (keyname >= ID_NUM_INTERNAL)
148 row = pool->languagecache + ID_NUM_INTERNAL * cols;
149 for (i = 0; i < pool->languagecacheother; i++, row += cols)
152 if (i >= pool->languagecacheother)
154 pool->languagecache = solv_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
155 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
160 row = pool->languagecache + keyname * cols;
161 row++; /* skip keyname */
162 for (i = 0; i < pool->nlanguages; i++, row++)
165 *row = pool_id2langid(pool, keyname, pool->languages[i], 1);
166 str = solvable_lookup_str_base(s, *row, keyname, 0);
170 return solvable_lookup_str(s, keyname);
174 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang, int usebase)
178 Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
180 return solvable_lookup_str_base(s, id, keyname, usebase);
184 return solvable_lookup_str(s, keyname);
188 solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound)
192 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, notfound);
196 solvable_lookup_void(Solvable *s, Id keyname)
200 return repo_lookup_void(s->repo, s - s->repo->pool->solvables, keyname);
204 solvable_lookup_bool(Solvable *s, Id keyname)
208 /* historic nonsense: there are two ways of storing a bool, as num == 1 or void. test both. */
209 if (repo_lookup_type(s->repo, s - s->repo->pool->solvables, keyname) == REPOKEY_TYPE_VOID)
211 return repo_lookup_num(s->repo, s - s->repo->pool->solvables, keyname, 0) == 1;
214 const unsigned char *
215 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
217 Repo *repo = s->repo;
224 return repo_lookup_bin_checksum(repo, s - repo->pool->solvables, keyname, typep);
228 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
230 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
231 return chk ? pool_bin2hex(s->repo->pool, chk, solv_chksum_len(*typep)) : 0;
234 static inline const char *
235 evrid2vrstr(Pool *pool, Id evrid)
237 const char *p, *evr = pool_id2str(pool, evrid);
240 for (p = evr; *p >= '0' && *p <= '9'; p++)
242 return p != evr && *p == ':' ? p + 1 : evr;
246 solvable_get_location(Solvable *s, unsigned int *medianrp)
251 const char *mediadir, *mediafile;
257 pool = s->repo->pool;
259 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
260 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
261 mediadir = pool_id2str(pool, s->arch);
263 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
265 l = strlen(mediadir) + 1;
266 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
268 const char *name, *evr, *arch;
269 name = pool_id2str(pool, s->name);
270 evr = evrid2vrstr(pool, s->evr);
271 arch = pool_id2str(pool, s->arch);
272 /* name-vr.arch.rpm */
273 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
275 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
277 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
281 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
284 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
286 sprintf(loc, "%s/%s", mediadir, mediafile);
288 strcpy(loc, mediafile);
293 /*****************************************************************************/
295 static inline Id dep2name(Pool *pool, Id dep)
297 while (ISRELDEP(dep))
299 Reldep *rd = rd = GETRELDEP(pool, dep);
305 static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep)
308 FOR_PROVIDES(p, pp, dep)
310 if (p == SYSTEMSOLVABLE)
312 if (MAPTST(installed, p))
319 * solvable_trivial_installable_map - anwers is a solvable is installable
320 * without any other installs/deinstalls.
321 * The packages considered to be installed are provided via the
322 * installedmap bitmap. A additional "conflictsmap" bitmap providing
323 * information about the conflicts of the installed packages can be
324 * used for extra speed up. Provide a NULL pointer if you do not
325 * have this information.
326 * Both maps can be created with pool_create_state_maps() or
327 * solver_create_state_maps().
330 * 1: solvable is installable without any other package changes
331 * 0: solvable is not installable
332 * -1: solvable is installable, but doesn't constrain any installed packages
335 solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap)
337 Pool *pool = s->repo->pool;
343 int r, interesting = 0;
345 if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
349 reqp = s->repo->idarraydata + s->requires;
350 while ((req = *reqp++) != 0)
352 if (req == SOLVABLE_PREREQMARKER)
354 r = providedbyinstalled(pool, installedmap, req);
363 conp = s->repo->idarraydata + s->conflicts;
364 while ((con = *conp++) != 0)
366 if (providedbyinstalled(pool, installedmap, con))
368 if (!interesting && ISRELDEP(con))
370 con = dep2name(pool, con);
371 if (providedbyinstalled(pool, installedmap, con))
379 if (s->obsoletes && s->repo != installed)
381 obsp = s->repo->idarraydata + s->obsoletes;
382 while ((obs = *obsp++) != 0)
384 if (providedbyinstalled(pool, installedmap, obs))
388 if (s->repo != installed)
390 FOR_PROVIDES(p, pp, s->name)
392 s2 = pool->solvables + p;
393 if (s2->repo == installed && s2->name == s->name)
402 p = s - pool->solvables;
403 for (i = 1; i < pool->nsolvables; i++)
405 if (!MAPTST(installedmap, i))
407 s2 = pool->solvables + i;
410 conp = s2->repo->idarraydata + s2->conflicts;
411 while ((con = *conp++) != 0)
413 dp = pool_whatprovides_ptr(pool, con);
420 return interesting ? 1 : -1;
424 * different interface for solvable_trivial_installable_map, where
425 * the information about the installed packages is provided
429 solvable_trivial_installable_queue(Solvable *s, Queue *installed)
431 Pool *pool = s->repo->pool;
437 map_init(&installedmap, pool->nsolvables);
438 for (i = 0; i < installed->count; i++)
440 p = installed->elements[i];
441 if (p > 0) /* makes it work with decisionq */
442 MAPSET(&installedmap, p);
444 r = solvable_trivial_installable_map(s, &installedmap, 0);
445 map_free(&installedmap);
450 * different interface for solvable_trivial_installable_map, where
451 * the information about the installed packages is provided
452 * by a repo containing the installed solvables.
455 solvable_trivial_installable_repo(Solvable *s, Repo *installed)
457 Pool *pool = s->repo->pool;
463 map_init(&installedmap, pool->nsolvables);
464 FOR_REPO_SOLVABLES(installed, p, s2)
465 MAPSET(&installedmap, p);
466 r = solvable_trivial_installable_map(s, &installedmap, 0);
467 map_free(&installedmap);
472 /*****************************************************************************/
475 * Create maps containing the state of each solvable. Input is a "installed" queue,
476 * it contains all solvable ids that are considered to be installed.
478 * The created maps can be used for solvable_trivial_installable_map(),
479 * pool_calc_duchanges(), pool_calc_installsizechange().
483 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
490 map_init(installedmap, pool->nsolvables);
492 map_init(conflictsmap, pool->nsolvables);
493 for (i = 0; i < installed->count; i++)
495 p = installed->elements[i];
496 if (p <= 0) /* makes it work with decisionq */
498 MAPSET(installedmap, p);
501 s = pool->solvables + p;
504 conp = s->repo->idarraydata + s->conflicts;
505 while ((con = *conp++) != 0)
507 dp = pool_whatprovides_ptr(pool, con);
509 MAPSET(conflictsmap, *dp);
514 /* Tests if two solvables have identical content. Currently
515 * both solvables need to come from the same pool
518 solvable_identical(Solvable *s1, Solvable *s2)
520 unsigned int bt1, bt2;
524 if (s1->name != s2->name)
526 if (s1->arch != s2->arch)
528 if (s1->evr != s2->evr)
530 /* map missing vendor to empty string */
531 if ((s1->vendor ? s1->vendor : 1) != (s2->vendor ? s2->vendor : 1))
534 /* looking good, try some fancier stuff */
535 /* might also look up the package checksum here */
536 bt1 = solvable_lookup_num(s1, SOLVABLE_BUILDTIME, 0);
537 bt2 = solvable_lookup_num(s2, SOLVABLE_BUILDTIME, 0);
545 /* look at requires in a last attempt to find recompiled packages */
548 for (reqp = s1->repo->idarraydata + s1->requires; *reqp; reqp++)
551 for (reqp = s2->repo->idarraydata + s2->requires; *reqp; reqp++)
559 /* return the self provide dependency of a solvable */
561 solvable_selfprovidedep(Solvable *s)
569 pool = s->repo->pool;
572 provp = s->repo->idarraydata + s->provides;
573 while ((prov = *provp++) != 0)
577 rd = GETRELDEP(pool, prov);
578 if (rd->name == s->name && rd->evr == s->evr && rd->flags == REL_EQ)
582 return pool_rel2id(pool, s->name, s->evr, REL_EQ, 1);
585 /* setter functions, simply call the repo variants */
587 solvable_set_id(Solvable *s, Id keyname, Id id)
589 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, id);
593 solvable_set_num(Solvable *s, Id keyname, unsigned int num)
595 repo_set_num(s->repo, s - s->repo->pool->solvables, keyname, num);
599 solvable_set_str(Solvable *s, Id keyname, const char *str)
601 repo_set_str(s->repo, s - s->repo->pool->solvables, keyname, str);
605 solvable_set_poolstr(Solvable *s, Id keyname, const char *str)
607 repo_set_poolstr(s->repo, s - s->repo->pool->solvables, keyname, str);
611 solvable_add_poolstr_array(Solvable *s, Id keyname, const char *str)
613 repo_add_poolstr_array(s->repo, s - s->repo->pool->solvables, keyname, str);
617 solvable_add_idarray(Solvable *s, Id keyname, Id id)
619 repo_add_idarray(s->repo, s - s->repo->pool->solvables, keyname, id);
623 solvable_add_deparray(Solvable *s, Id keyname, Id dep, Id marker)
625 repo_add_deparray(s->repo, s - s->repo->pool->solvables, keyname, dep, marker);
629 solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
631 repo_set_idarray(s->repo, s - s->repo->pool->solvables, keyname, q);
635 solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
637 repo_set_deparray(s->repo, s - s->repo->pool->solvables, keyname, q, marker);