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 solvable_lookup_str(Solvable *s, Id keyname)
39 return id2str(pool, s->name);
41 return id2str(pool, s->arch);
43 return id2str(pool, s->evr);
45 return id2str(pool, s->vendor);
47 n = s - pool->solvables;
48 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
50 if (n < data->start || n >= data->end)
52 for (j = 1; j < data->nkeys; j++)
54 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))
56 str = repodata_lookup_str(data, n - data->start, j);
66 solvable_lookup_str_lang(Solvable *s, Id keyname)
74 return repo_lookup_str(s, keyname);
76 if (!pool->nlanguages)
77 return repo_lookup_str(s, keyname);
78 cols = pool->nlanguages + 1;
79 if (!pool->languagecache)
81 pool->languagecache = sat_calloc(cols * ID_NUM_INTERNAL, sizeof(Id));
82 pool->languagecacheother = 0;
84 if (keyname >= ID_NUM_INTERNAL)
86 row = pool->languagecache + ID_NUM_INTERNAL * cols;
87 for (i = 0; i < pool->languagecacheother; i++, row += cols)
90 if (i >= pool->languagecacheother)
92 pool->languagecache = sat_realloc2(pool->languagecache, pool->languagecacheother + 1, cols * sizeof(Id));
93 pool->languagecacheother++;
94 row = pool->languagecache + cols * (ID_NUM_INTERNAL + pool->languagecacheother++);
98 row = pool->languagecache + keyname * cols;
99 row++; /* skip keyname */
100 for (i = 0; i < pool->nlanguages; i++, row++)
107 kn = id2str(pool, keyname);
108 p = sat_malloc(strlen(kn) + strlen(pool->languages[i]) + 2);
109 sprintf(p, "%s:%s", kn, pool->languages[i]);
110 *row = str2id(pool, p, 1);
113 str = repo_lookup_str(s, *row);
117 return repo_lookup_str(s, keyname);
121 solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound)
123 Repo *repo = s->repo;
131 if (keyname == RPM_RPMDBID)
134 return repo->rpmdbid[(s - pool->solvables) - repo->start];
137 n = s - pool->solvables;
138 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
140 if (n < data->start || n >= data->end)
142 for (j = 1; j < data->nkeys; j++)
144 if (data->keys[j].name == keyname
145 && (data->keys[j].type == REPOKEY_TYPE_U32
146 || data->keys[j].type == REPOKEY_TYPE_NUM
147 || data->keys[j].type == REPOKEY_TYPE_CONSTANT))
150 if (repodata_lookup_num(data, n - data->start, j, &value))
159 solvable_lookup_void(Solvable *s, Id keyname)
161 Repo *repo = s->repo;
169 n = s - pool->solvables;
170 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
172 if (n < data->start || n >= data->end)
174 for (j = 1; j < data->nkeys; j++)
176 if (data->keys[j].name == keyname
177 && (data->keys[j].type == REPOKEY_TYPE_VOID))
179 if (repodata_lookup_void(data, n - data->start, j))
188 solvable_get_location(Solvable *s, unsigned int *medianrp)
193 const char *mediadir, *mediafile;
198 pool = s->repo->pool;
199 *medianrp = solvable_lookup_num(s, SOLVABLE_MEDIANR, 1);
200 if (solvable_lookup_void(s, SOLVABLE_MEDIADIR))
201 mediadir = id2str(pool, s->arch);
203 mediadir = solvable_lookup_str(s, SOLVABLE_MEDIADIR);
205 l = strlen(mediadir) + 1;
206 if (solvable_lookup_void(s, SOLVABLE_MEDIAFILE))
208 const char *name, *evr, *arch;
209 name = id2str(pool, s->name);
210 evr = id2str(pool, s->evr);
211 arch = id2str(pool, s->arch);
212 /* name-evr.arch.rpm */
213 loc = sat_malloc(l + strlen(name) + strlen(evr) + strlen(arch) + 7);
215 sprintf(loc, "%s/%s-%s.%s.rpm", mediadir, name, evr, arch);
217 sprintf(loc, "%s-%s.%s.rpm", name, evr, arch);
221 mediafile = solvable_lookup_str(s, SOLVABLE_MEDIAFILE);
224 loc = sat_malloc(l + strlen(mediafile) + 1);
226 sprintf(loc, "%s/%s", mediadir, mediafile);
228 strcpy(loc, mediafile);