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
25 solvable2str(Pool *pool, Solvable *s)
27 const char *n, *e, *a;
29 n = id2str(pool, s->name);
30 e = id2str(pool, s->evr);
31 a = id2str(pool, s->arch);
32 p = pool_alloctmpspace(pool, strlen(n) + strlen(e) + strlen(a) + 3);
33 sprintf(p, "%s-%s.%s", n, e, a);
38 solvable_lookup_id(Solvable *s, Id keyname)
59 n = s - pool->solvables;
60 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
62 if (n < data->start || n >= data->end)
64 for (j = 1; j < data->nkeys; j++)
66 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID))
68 Id id = repodata_lookup_id(data, n - data->start, j);
72 id = repodata_globalize_id(data, id);
82 solvable_lookup_str(Solvable *s, Id keyname)
96 return id2str(pool, s->name);
98 return id2str(pool, s->arch);
100 return id2str(pool, s->evr);
101 case SOLVABLE_VENDOR:
102 return id2str(pool, s->vendor);
104 n = s - pool->solvables;
105 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
107 if (n < data->start || n >= data->end)
109 for (j = 1; j < data->nkeys; j++)
111 if (data->keys[j].name == keyname && (data->keys[j].type == REPOKEY_TYPE_ID || data->keys[j].type == REPOKEY_TYPE_CONSTANTID || data->keys[j].type == REPOKEY_TYPE_STR))
113 str = repodata_lookup_str(data, n - data->start, j);
123 solvable_lookup_str_poollang(Solvable *s, Id keyname)
131 return repo_lookup_str(s, keyname);
132 pool = s->repo->pool;
133 if (!pool->nlanguages)
134 return repo_lookup_str(s, keyname);
135 cols = pool->nlanguages + 1;
136 if (!pool->languagecache)
138 pool->languagecache = sat_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
139 pool->languagecacheother = 0;
141 if (keyname >= ID_NUM_INTERNAL)
143 row = pool->languagecache + ID_NUM_INTERNAL * cols;
144 for (i = 0; i < pool->languagecacheother; i++, row += cols)
147 if (i >= pool->languagecacheother)
149 pool->languagecache = sat_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
150 pool->languagecacheother++;
151 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
155 row = pool->languagecache + keyname * cols;
156 row++; /* skip keyname */
157 for (i = 0; i < pool->nlanguages; i++, row++)
164 kn = id2str(pool, keyname);
165 p = sat_malloc(strlen(kn) + strlen(pool->languages[i]) + 2);
166 sprintf(p, "%s:%s", kn, pool->languages[i]);
167 *row = str2id(pool, p, 1);
170 str = repo_lookup_str(s, *row);
174 return repo_lookup_str(s, keyname);
178 solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang)
183 Id id = pool_id2langid(s->repo->pool, keyname, lang, 0);
184 if (id && (str = repo_lookup_str(s, id)) != 0)
187 return repo_lookup_str(s, keyname);
191 solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound)
193 Repo *repo = s->repo;
201 if (keyname == RPM_RPMDBID)
204 return repo->rpmdbid[(s - pool->solvables) - repo->start];
207 n = s - pool->solvables;
208 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
210 if (n < data->start || n >= data->end)
212 for (j = 1; j < data->nkeys; j++)
214 if (data->keys[j].name == keyname
215 && (data->keys[j].type == REPOKEY_TYPE_U32
216 || data->keys[j].type == REPOKEY_TYPE_NUM
217 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
220 if (repodata_lookup_num(data, n - data->start, j, &value))
229 solvable_lookup_bool(Solvable *s, Id keyname)
231 return solvable_lookup_num(s, keyname, 0) ? 1 : 0;
235 solvable_lookup_void(Solvable *s, Id keyname)
237 Repo *repo = s->repo;
245 n = s - pool->solvables;
246 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
248 if (n < data->start || n >= data->end)
250 for (j = 1; j < data->nkeys; j++)
252 if (data->keys[j].name == keyname
253 && (data->keys[j].type == REPOKEY_TYPE_VOID))
255 if (repodata_lookup_void(data, n - data->start, j))
263 const unsigned char *
264 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
266 Repo *repo = s->repo;
275 n = s - pool->solvables;
276 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
278 if (n < data->start || n >= data->end)
280 for (j = 1; j < data->nkeys; j++)
282 if (data->keys[j].name == keyname
283 && (data->keys[j].type == REPOKEY_TYPE_MD5
284 || data->keys[j].type == REPOKEY_TYPE_SHA1
285 || data->keys[j].type == REPOKEY_TYPE_SHA256))
287 const unsigned char *chk = repodata_lookup_bin_checksum(data, n - data->start, j, typep);
297 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
299 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
300 /* we need the repodata just as a reference for a pool */
301 return chk ? repodata_chk2str(s->repo->repodata, *typep, chk) : 0;
305 solvable_get_location(Solvable *s, unsigned int *medianrp)
310 const char *mediadir, *mediafile;
315 pool = s->repo->pool;
316 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
317 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
318 mediadir = id2str(pool, s->arch);
320 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
322 l = strlen(mediadir) + 1;
323 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
325 const char *name, *evr, *arch;
326 name = id2str(pool, s->name);
327 evr = id2str(pool, s->evr);
328 arch = id2str(pool, s->arch);
329 /* name-evr.arch.rpm */
330 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
332 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
334 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
338 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
341 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
343 sprintf(loc, "%s/%s", mediadir, mediafile);
345 strcpy(loc, mediafile);
350 /*****************************************************************************/
352 static inline Id dep2name(Pool *pool, Id dep)
354 while (ISRELDEP(dep))
356 Reldep *rd = rd = GETRELDEP(pool, dep);
362 static inline int providedbyinstalled(Pool *pool, Map *installed, Id dep)
365 FOR_PROVIDES(p, pp, dep)
367 if (p == SYSTEMSOLVABLE)
369 if (MAPTST(installed, p))
376 * solvable_trivial_installable_map - anwers is a solvable is installable
377 * without any other installs/deinstalls.
378 * The packages considered to be installed are provided via the
379 * installedmap bitmap. A additional "conflictsmap" bitmap providing
380 * information about the conflicts of the installed packages can be
381 * used for extra speed up. Provide a NULL pointer if you do not
382 * have this information.
383 * Both maps can be created with pool_create_state_maps() or
384 * solver_create_state_maps().
387 * 1: solvable is installable without any other package changes
388 * 0: solvable is not installable
389 * -1: solvable is installable, but doesn't constrain any installed packages
392 solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap)
394 Pool *pool = s->repo->pool;
400 int r, interesting = 0;
402 if (conflictsmap && MAPTST(conflictsmap, s - pool->solvables))
406 reqp = s->repo->idarraydata + s->requires;
407 while ((req = *reqp++) != 0)
409 if (req == SOLVABLE_PREREQMARKER)
411 r = providedbyinstalled(pool, installedmap, req);
420 conp = s->repo->idarraydata + s->conflicts;
421 while ((con = *conp++) != 0)
423 if (providedbyinstalled(pool, installedmap, con))
425 if (!interesting && ISRELDEP(con))
427 con = dep2name(pool, con);
428 if (providedbyinstalled(pool, installedmap, con))
436 if (s->obsoletes && s->repo != installed)
438 obsp = s->repo->idarraydata + s->obsoletes;
439 while ((obs = *obsp++) != 0)
441 if (providedbyinstalled(pool, installedmap, obs))
445 if (s->repo != installed)
447 FOR_PROVIDES(p, pp, s->name)
449 s2 = pool->solvables + p;
450 if (s2->repo == installed && s2->name == s->name)
459 p = s - pool->solvables;
460 for (i = 1; i < pool->nsolvables; i++)
462 if (!MAPTST(installedmap, i))
464 s2 = pool->solvables + i;
467 conp = s2->repo->idarraydata + s2->conflicts;
468 while ((con = *conp++) != 0)
470 dp = pool_whatprovides(pool, con);
477 return interesting ? 1 : -1;
481 * different interface for solvable_trivial_installable_map, where
482 * the information about the installed packages is provided
486 solvable_trivial_installable_queue(Solvable *s, Queue *installed)
488 Pool *pool = s->repo->pool;
494 map_init(&installedmap, pool->nsolvables);
495 for (i = 0; i < installed->count; i++)
497 p = installed->elements[i];
498 if (p > 0) /* makes it work with decisionq */
499 MAPSET(&installedmap, p);
501 r = solvable_trivial_installable_map(s, &installedmap, 0);
502 map_free(&installedmap);
507 * different interface for solvable_trivial_installable_map, where
508 * the information about the installed packages is provided
509 * by a repo containing the installed solvables.
512 solvable_trivial_installable_repo(Solvable *s, Repo *installed)
514 Pool *pool = s->repo->pool;
520 map_init(&installedmap, pool->nsolvables);
521 FOR_REPO_SOLVABLES(installed, p, s2)
522 MAPSET(&installedmap, p);
523 r = solvable_trivial_installable_map(s, &installedmap, 0);
524 map_free(&installedmap);
529 /*****************************************************************************/
532 * Create maps containing the state of each solvable. Input is a "installed" queue,
533 * it contains all solvable ids that are considered to be installed.
535 * The created maps can be used for solvable_trivial_installable_map(),
536 * pool_calc_duchanges(), pool_calc_installsizechange().
540 pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
547 map_init(installedmap, pool->nsolvables);
549 map_init(conflictsmap, pool->nsolvables);
550 for (i = 0; i < installed->count; i++)
552 p = installed->elements[i];
553 if (p <= 0) /* makes it work with decisionq */
555 MAPSET(installedmap, p);
558 s = pool->solvables + p;
561 conp = s->repo->idarraydata + s->conflicts;
562 while ((con = *conp++) != 0)
564 dp = pool_whatprovides(pool, con);
566 MAPSET(conflictsmap, *dp);