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_str(Solvable *s, Id keyname)
52 return id2str(pool, s->name);
54 return id2str(pool, s->arch);
56 return id2str(pool, s->evr);
58 return id2str(pool, s->vendor);
60 n = s - pool->solvables;
61 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
63 if (n < data->start || n >= data->end)
65 for (j = 1; j < data->nkeys; j++)
67 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))
69 str = repodata_lookup_str(data, n - data->start, j);
79 solvable_lookup_str_lang(Solvable *s, Id keyname)
87 return repo_lookup_str(s, keyname);
89 if (!pool->nlanguages)
90 return repo_lookup_str(s, keyname);
91 cols = pool->nlanguages + 1;
92 if (!pool->languagecache)
94 pool->languagecache = sat_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
95 pool->languagecacheother = 0;
97 if (keyname >= ID_NUM_INTERNAL)
99 row = pool->languagecache + ID_NUM_INTERNAL * cols;
100 for (i = 0; i < pool->languagecacheother; i++, row += cols)
103 if (i >= pool->languagecacheother)
105 pool->languagecache = sat_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
106 pool->languagecacheother++;
107 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
111 row = pool->languagecache + keyname * cols;
112 row++; /* skip keyname */
113 for (i = 0; i < pool->nlanguages; i++, row++)
120 kn = id2str(pool, keyname);
121 p = sat_malloc(strlen(kn) + strlen(pool->languages[i]) + 2);
122 sprintf(p, "%s:%s", kn, pool->languages[i]);
123 *row = str2id(pool, p, 1);
126 str = repo_lookup_str(s, *row);
130 return repo_lookup_str(s, keyname);
134 solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound)
136 Repo *repo = s->repo;
144 if (keyname == RPM_RPMDBID)
147 return repo->rpmdbid[(s - pool->solvables) - repo->start];
150 n = s - pool->solvables;
151 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
153 if (n < data->start || n >= data->end)
155 for (j = 1; j < data->nkeys; j++)
157 if (data->keys[j].name == keyname
158 && (data->keys[j].type == REPOKEY_TYPE_U32
159 || data->keys[j].type == REPOKEY_TYPE_NUM
160 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
163 if (repodata_lookup_num(data, n - data->start, j, &value))
172 solvable_lookup_void(Solvable *s, Id keyname)
174 Repo *repo = s->repo;
182 n = s - pool->solvables;
183 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
185 if (n < data->start || n >= data->end)
187 for (j = 1; j < data->nkeys; j++)
189 if (data->keys[j].name == keyname
190 && (data->keys[j].type == REPOKEY_TYPE_VOID))
192 if (repodata_lookup_void(data, n - data->start, j))
200 const unsigned char *
201 solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep)
203 Repo *repo = s->repo;
211 n = s - pool->solvables;
212 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
214 if (n < data->start || n >= data->end)
216 for (j = 1; j < data->nkeys; j++)
218 if (data->keys[j].name == keyname
219 && (data->keys[j].type == REPOKEY_TYPE_MD5
220 || data->keys[j].type == REPOKEY_TYPE_SHA1
221 || data->keys[j].type == REPOKEY_TYPE_SHA256))
223 const unsigned char *chk = repodata_lookup_bin_checksum(data, n - data->start, j, typep);
233 solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep)
235 const unsigned char *chk = solvable_lookup_bin_checksum(s, keyname, typep);
236 /* we need the repodata just as a reference for a pool */
237 return chk ? repodata_chk2str(s->repo->repodata, *typep, chk) : 0;
241 solvable_get_location(Solvable *s, unsigned int *medianrp)
246 const char *mediadir, *mediafile;
251 pool = s->repo->pool;
252 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
253 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
254 mediadir = id2str(pool, s->arch);
256 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
258 l = strlen(mediadir) + 1;
259 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
261 const char *name, *evr, *arch;
262 name = id2str(pool, s->name);
263 evr = id2str(pool, s->evr);
264 arch = id2str(pool, s->arch);
265 /* name-evr.arch.rpm */
266 loc = pool_alloctmpspace(pool, l + strlen(name) + strlen(evr) + strlen(arch) + 7);
268 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
270 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
274 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
277 loc = pool_alloctmpspace(pool, l + strlen(mediafile) + 1);
279 sprintf(loc, "%s/%s", mediadir, mediafile);
281 strcpy(loc, mediafile);