2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
13 static int with_attr = 0;
16 #include "repo_solv.h"
19 dump_repodata (Repo *repo)
23 if (repo->nrepodata == 0)
25 printf("repo refers to %d subfiles:\n", repo->nrepodata);
26 for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
29 printf("%s has %d keys, %d schemata\n", data->location ? data->location : "**EMBED**", data->nkeys, data->nschemata);
30 for (j = 1; j < data->nkeys; j++)
31 printf(" %s (type %s size %d storage %d)\n", id2str(repo->pool, data->keys[j].name), id2str(repo->pool, data->keys[j].type), data->keys[j].size, data->keys[j].storage);
33 printf(" localpool has %d strings, size is %d\n", data->spool.nstrings, data->spool.sstrings);
34 if (data->dirpool.ndirs)
35 printf(" localpool has %d directories\n", data->dirpool.ndirs);
36 if (data->addedfileprovides)
38 printf(" added file provides:\n");
39 for (j = 0; data->addedfileprovides[j]; j++)
40 printf(" %s\n", id2str(repo->pool, data->addedfileprovides[j]));
48 printids(Repo *repo, char *kind, Offset ido)
50 Pool *pool = repo->pool;
54 printf("%s:\n", kind);
55 ids = repo->idarraydata + ido;
56 while((id = *ids++) != 0)
57 printf(" %s\n", dep2str(pool, id));
61 dump_attr(Repo *repo, Repodata *data, Repokey *key, KeyValue *kv)
65 keyname = id2str(repo->pool, key->name);
69 if (data && data->localpool)
70 kv->str = stringpool_id2str(&data->spool, kv->id);
72 kv->str = id2str(repo->pool, kv->id);
73 printf("%s: %s\n", keyname, kv->str);
75 case REPOKEY_TYPE_CONSTANTID:
76 printf("%s: %s\n", keyname, dep2str(repo->pool, kv->id));
78 case REPOKEY_TYPE_IDARRAY:
79 if (data && data->localpool)
80 printf("%s: %s\n", keyname, stringpool_id2str(&data->spool, kv->id));
82 printf("%s: %s\n", keyname, dep2str(repo->pool, kv->id));
84 case REPOKEY_TYPE_STR:
85 printf("%s: %s\n", keyname, kv->str);
87 case REPOKEY_TYPE_MD5:
88 case REPOKEY_TYPE_SHA1:
89 case REPOKEY_TYPE_SHA256:
90 printf("%s: %s\n", keyname, repodata_chk2str(data, key->type, (unsigned char *)kv->str));
92 case REPOKEY_TYPE_VOID:
93 printf("%s: (void)\n", keyname);
95 case REPOKEY_TYPE_U32:
96 case REPOKEY_TYPE_NUM:
97 case REPOKEY_TYPE_CONSTANT:
98 printf("%s: %d\n", keyname, kv->num);
100 case REPOKEY_TYPE_DIRNUMNUMARRAY:
101 printf("%s: %s %d %d\n", keyname, repodata_dir2str(data, kv->id, 0), kv->num, kv->num2);
103 case REPOKEY_TYPE_DIRSTRARRAY:
104 printf("%s: %s\n", keyname, repodata_dir2str(data, kv->id, kv->str));
106 case REPOKEY_TYPE_COUNTED:
107 printf("%s: %s\n", keyname, kv->eof == 0 ? "open" : kv->eof == 1 ? "next" : "close");
110 printf("%s: ?\n", keyname);
117 dump_repoattrs_cb(void *vcbdata, Solvable *s, Repodata *data, Repokey *key, KeyValue *kv)
119 return dump_attr(s->repo, data, key, kv);
123 * dump all attributes for Id <p>
127 dump_repoattrs(Repo *repo, Id p)
130 repo_search(repo, p, 0, 0, SEARCH_NO_STORAGE_SOLVABLE, dump_repoattrs_cb, 0);
133 dataiterator_init(&di, repo, p, 0, 0, SEARCH_NO_STORAGE_SOLVABLE);
134 while (dataiterator_step(&di))
135 dump_attr(repo, di.data, di.key, &di.kv);
141 dump_some_attrs(Repo *repo, Solvable *s)
143 const char *summary = 0;
144 unsigned int medianr = -1, downloadsize = -1;
145 unsigned int time = -1;
146 summary = repo_lookup_str(s, SOLVABLE_SUMMARY);
147 medianr = repo_lookup_num(s, SOLVABLE_MEDIANR);
148 downloadsize = repo_lookup_num (s, SOLVABLE_DOWNLOADSIZE);
149 time = repo_lookup_num(s, SOLVABLE_BUILDTIME);
150 printf (" XXX %d %d %u %s\n", medianr, downloadsize, time, summary);
156 loadcallback (Pool *pool, Repodata *data, void *vdata)
159 if (data->location && with_attr)
161 fprintf (stderr, "Loading SOLV file %s\n", data->location);
162 fp = fopen (data->location, "r");
164 perror(data->location);
171 usage( const char *err )
174 fprintf (stderr, "\n** Error:\n %s\n", err);
175 fprintf( stderr, "\nUsage:\n"
176 "dumpsolv [-a] [<solvfile>]\n"
177 " -a read attributes.\n"
184 tryme (Repo *repo, Id p, Id keyname, const char *match, int flags)
187 dataiterator_init(&di, repo, p, keyname, match, flags);
188 while (dataiterator_step(&di))
190 switch (di.key->type)
192 case REPOKEY_TYPE_ID:
193 case REPOKEY_TYPE_IDARRAY:
194 if (di.data && di.data->localpool)
195 di.kv.str = stringpool_id2str(&di.data->spool, di.kv.id);
197 di.kv.str = id2str(repo->pool, di.kv.id);
199 case REPOKEY_TYPE_STR:
200 case REPOKEY_TYPE_DIRSTRARRAY:
205 fprintf (stdout, "found: %d:%s %d %s %d %d %d\n",
207 id2str(repo->pool, di.key->name),
209 di.kv.str, di.kv.num, di.kv.num2, di.kv.eof);
214 int main(int argc, char **argv)
221 pool = pool_create();
222 pool_setdebuglevel(pool, 1);
223 pool_setloadcallback(pool, loadcallback, 0);
229 const char *s = argv[0];
234 case 'h': usage(NULL); break;
235 case 'a': with_attr = 1; break;
240 if (freopen (argv[0], "r", stdin) == 0)
245 repo = repo_create(pool, argv[0]);
246 if (repo_add_solv(repo, stdin))
247 printf("could not read repository\n");
254 repo = repo_create(pool, argc != 1 ? argv[1] : "<stdin>");
255 if (repo_add_solv(repo, stdin))
256 printf("could not read repository\n");
258 printf("pool contains %d strings, %d rels, string size is %d\n", pool->ss.nstrings, pool->nrels, pool->ss.sstrings);
259 for (j = 0; 1 && j < pool->nrepos; j++)
261 repo = pool->repos[j];
263 printf("repo %d contains %d solvables %d non-solvables\n", j, repo->nsolvables, repo->nextra);
264 printf("repo start: %d end: %d\n", repo->start, repo->end);
265 for (i = repo->start, n = 1; i < repo->end; i++)
267 s = pool->solvables + i;
271 printf("solvable %d (%d):\n", n, i);
272 if (s->name || s->evr || s->arch)
273 printf("name: %s %s %s\n", id2str(pool, s->name), id2str(pool, s->evr), id2str(pool, s->arch));
275 printf("vendor: %s\n", id2str(pool, s->vendor));
276 printids(repo, "provides", s->provides);
277 printids(repo, "obsoletes", s->obsoletes);
278 printids(repo, "conflicts", s->conflicts);
279 printids(repo, "requires", s->requires);
280 printids(repo, "recommends", s->recommends);
281 printids(repo, "suggests", s->suggests);
282 printids(repo, "supplements", s->supplements);
283 printids(repo, "enhances", s->enhances);
284 printids(repo, "freshens", s->freshens);
286 printf("rpmdbid: %u\n", repo->rpmdbid[i - repo->start]);
288 dump_attrs (repo, n - 1);
290 dump_repoattrs(repo, i);
292 dump_some_attrs(repo, s);
296 for (i = 0; i < repo->nextra; i++)
298 printf("\nextra %d:\n", i);
300 dataiterator_init(&di, repo, -1 - i, 0, 0, SEARCH_EXTRA | SEARCH_NO_STORAGE_SOLVABLE);
301 while (dataiterator_step(&di))
302 dump_attr(repo, di.data, di.key, &di.kv);
305 tryme(repo, 0, SOLVABLE_MEDIANR, 0, 0);
307 tryme(repo, 0, 0, 0, 0);
309 tryme(repo, 0, 0, "*y*e*", SEARCH_GLOB);
313 printf ("\nSearchresults:\n");
315 dataiterator_init(&di, pool->repos[0], 0, 0, "3", SEARCH_EXTRA | SEARCH_SUBSTRING | SEARCH_ALL_REPOS);
317 while (dataiterator_step(&di))
319 printf("%d:", di.solvid);
320 dump_attr(repo, di.data, di.key, &di.kv);
321 /*if (di.solvid == 4 && count++ == 0)
322 dataiterator_jump_to_solvable(&di, pool->solvables + 3);*/
323 //dataiterator_skip_attribute(&di);
324 //dataiterator_skip_solvable(&di);
325 //dataiterator_skip_repo(&di);