10 #include "repo_rpmmd.h"
30 STATE_RECOMMENDSENTRY,
32 STATE_SUPPLEMENTSENTRY,
51 static struct stateswitch stateswitches[] = {
52 { STATE_START, "metadata", STATE_METADATA, 0 },
53 { STATE_METADATA, "package", STATE_PACKAGE, 0 },
54 { STATE_PACKAGE, "name", STATE_NAME, 1 },
55 { STATE_PACKAGE, "arch", STATE_ARCH, 1 },
56 { STATE_PACKAGE, "version", STATE_VERSION, 0 },
57 { STATE_PACKAGE, "format", STATE_FORMAT, 0 },
58 { STATE_FORMAT, "rpm:provides", STATE_PROVIDES, 0 },
59 { STATE_FORMAT, "rpm:requires", STATE_REQUIRES, 0 },
60 { STATE_FORMAT, "rpm:obsoletes", STATE_OBSOLETES , 0 },
61 { STATE_FORMAT, "rpm:conflicts", STATE_CONFLICTS , 0 },
62 { STATE_FORMAT, "rpm:recommends" , STATE_RECOMMENDS , 0 },
63 { STATE_FORMAT, "rpm:supplements", STATE_SUPPLEMENTS, 0 },
64 { STATE_FORMAT, "rpm:suggests", STATE_SUGGESTS, 0 },
65 { STATE_FORMAT, "rpm:enhances", STATE_ENHANCES, 0 },
66 { STATE_FORMAT, "rpm:freshens", STATE_FRESHENS, 0 },
67 { STATE_FORMAT, "file", STATE_FILE, 1 },
68 { STATE_PROVIDES, "rpm:entry", STATE_PROVIDESENTRY, 0 },
69 { STATE_REQUIRES, "rpm:entry", STATE_REQUIRESENTRY, 0 },
70 { STATE_OBSOLETES, "rpm:entry", STATE_OBSOLETESENTRY, 0 },
71 { STATE_CONFLICTS, "rpm:entry", STATE_CONFLICTSENTRY, 0 },
72 { STATE_RECOMMENDS, "rpm:entry", STATE_RECOMMENDSENTRY, 0 },
73 { STATE_SUPPLEMENTS, "rpm:entry", STATE_SUPPLEMENTSENTRY, 0 },
74 { STATE_SUGGESTS, "rpm:entry", STATE_SUGGESTSENTRY, 0 },
75 { STATE_ENHANCES, "rpm:entry", STATE_ENHANCESENTRY, 0 },
76 { STATE_FRESHENS, "rpm:entry", STATE_FRESHENSENTRY, 0 },
93 struct stateswitch *swtab[NUMSTATES];
94 enum state sbtab[NUMSTATES];
98 makeevr_atts(Pool *pool, struct parsedata *pd, const char **atts)
100 const char *e, *v, *r, *v2;
105 for (; *atts; atts += 2)
107 if (!strcmp(*atts, "epoch"))
109 else if (!strcmp(*atts, "ver"))
111 else if (!strcmp(*atts, "rel"))
114 if (e && !strcmp(e, "0"))
118 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++)
120 if (v2 > v && *v2 == ':')
130 if (l > pd->acontent)
132 pd->content = realloc(pd->content, l + 256);
133 pd->acontent = l + 256;
157 fprintf(stderr, "evr: %s\n", pd->content);
159 return str2id(pool, pd->content, 1);
162 static char *flagtab[] = {
172 adddep(Pool *pool, struct parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
175 const char *n, *f, *k;
179 for (a = atts; *a; a += 2)
181 if (!strcmp(*a, "name"))
183 else if (!strcmp(*a, "flags"))
185 else if (!strcmp(*a, "kind"))
187 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
192 if (k && !strcmp(k, "package"))
196 int l = strlen(k) + 1 + strlen(n) + 1;
197 if (l > pd->acontent)
199 pd->content = realloc(pd->content, l + 256);
200 pd->acontent = l + 256;
202 sprintf(pd->content, "%s:%s", k, n);
203 name = str2id(pool, pd->content, 1);
206 name = str2id(pool, (char *)n, 1);
209 Id evr = makeevr_atts(pool, pd, atts);
211 for (flags = 0; flags < 6; flags++)
212 if (!strcmp(f, flagtab[flags]))
214 flags = flags < 6 ? flags + 1 : 0;
215 id = rel2id(pool, name, evr, flags, 1);
220 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
222 return repo_addid_dep(pd->repo, olddeps, id, isreq);
227 startElement(void *userData, const char *name, const char **atts)
229 struct parsedata *pd = userData;
230 Pool *pool = pd->pool;
231 Solvable *s = pd->start ? pd->start + pd->pack : 0;
232 struct stateswitch *sw;
234 if (pd->depth != pd->statedepth)
240 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
241 if (!strcmp(sw->ename, name))
243 if (sw->from != pd->state)
246 fprintf(stderr, "into unknown: %s\n", name);
251 pd->docontent = sw->docontent;
252 pd->statedepth = pd->depth;
258 for (; *atts; atts += 2)
260 if (!strcmp(*atts, "packages"))
262 pd->numpacks = atoi(atts[1]);
264 fprintf(stderr, "numpacks: %d\n", pd->numpacks);
266 pool->solvables = realloc(pool->solvables, (pool->nsolvables + pd->numpacks) * sizeof(Solvable));
267 pd->start = pool->solvables + pd->repo->start;
268 memset(pd->start, 0, pd->numpacks * sizeof(Solvable));
273 if (pd->pack >= pd->numpacks)
275 fprintf(stderr, "repomd lied about the package number\n");
279 fprintf(stderr, "package #%d\n", pd->pack);
283 s->evr = makeevr_atts(pool, pd, atts);
288 case STATE_PROVIDESENTRY:
289 s->provides = adddep(pool, pd, s->provides, atts, 0);
294 case STATE_REQUIRESENTRY:
295 s->requires = adddep(pool, pd, s->requires, atts, 1);
297 case STATE_OBSOLETES:
300 case STATE_OBSOLETESENTRY:
301 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
303 case STATE_CONFLICTS:
306 case STATE_CONFLICTSENTRY:
307 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
309 case STATE_RECOMMENDS:
312 case STATE_RECOMMENDSENTRY:
313 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
315 case STATE_SUPPLEMENTS:
318 case STATE_SUPPLEMENTSENTRY:
319 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
324 case STATE_SUGGESTSENTRY:
325 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
330 case STATE_ENHANCESENTRY:
331 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
336 case STATE_FRESHENSENTRY:
337 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
345 endElement(void *userData, const char *name)
347 struct parsedata *pd = userData;
348 Pool *pool = pd->pool;
349 Solvable *s = pd->start ? pd->start + pd->pack : 0;
352 if (pd->depth != pd->statedepth)
355 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
365 s->arch = ARCH_NOARCH;
366 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
367 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
368 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
372 s->name = str2id(pool, pd->content, 1);
375 s->arch = str2id(pool, pd->content, 1);
378 id = str2id(pool, pd->content, 1);
379 s->provides = repo_addid(pd->repo, s->provides, id);
384 pd->state = pd->sbtab[pd->state];
386 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
390 characterData(void *userData, const XML_Char *s, int len)
392 struct parsedata *pd = userData;
398 l = pd->lcontent + len + 1;
399 if (l > pd->acontent)
401 pd->content = realloc(pd->content, l + 256);
402 pd->acontent = l + 256;
404 c = pd->content + pd->lcontent;
412 #define BUFF_SIZE 8192
415 pool_addrepo_rpmmd(Pool *pool, FILE *fp)
421 struct stateswitch *sw;
423 repo = pool_addrepo_empty(pool);
424 memset(&pd, 0, sizeof(pd));
425 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
427 if (!pd.swtab[sw->from])
428 pd.swtab[sw->from] = sw;
429 pd.sbtab[sw->to] = sw->from;
433 pd.content = malloc(256);
436 XML_Parser parser = XML_ParserCreate(NULL);
437 XML_SetUserData(parser, &pd);
438 XML_SetElementHandler(parser, startElement, endElement);
439 XML_SetCharacterDataHandler(parser, characterData);
442 l = fread(buf, 1, sizeof(buf), fp);
443 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
445 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
451 XML_ParserFree(parser);
453 pool->nsolvables += pd.pack;
454 repo->nsolvables = pd.pack;