10 #include "source_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 },
81 unsigned int provides;
82 unsigned int requires;
83 unsigned int obsoletes;
84 unsigned int conflicts;
85 unsigned int recommends;
86 unsigned int supplements;
87 unsigned int enhances;
88 unsigned int suggests;
89 unsigned int freshens;
106 struct stateswitch *swtab[NUMSTATES];
107 enum state sbtab[NUMSTATES];
111 makeevr_atts(Pool *pool, struct parsedata *pd, const char **atts)
113 const char *e, *v, *r, *v2;
118 for (; *atts; atts += 2)
120 if (!strcmp(*atts, "epoch"))
122 else if (!strcmp(*atts, "ver"))
124 else if (!strcmp(*atts, "rel"))
127 if (e && !strcmp(e, "0"))
131 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++)
133 if (v2 > v && *v2 == ':')
143 if (l > pd->acontent)
145 pd->content = realloc(pd->content, l + 256);
146 pd->acontent = l + 256;
170 fprintf(stderr, "evr: %s\n", pd->content);
172 return str2id(pool, pd->content, 1);
175 static char *flagtab[] = {
185 adddep(Pool *pool, struct parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
188 const char *n, *f, *k;
192 for (a = atts; *a; a += 2)
194 if (!strcmp(*a, "name"))
196 else if (!strcmp(*a, "flags"))
198 else if (!strcmp(*a, "kind"))
200 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
205 if (k && !strcmp(k, "package"))
209 int l = strlen(k) + 1 + strlen(n) + 1;
210 if (l > pd->acontent)
212 pd->content = realloc(pd->content, l + 256);
213 pd->acontent = l + 256;
215 sprintf(pd->content, "%s:%s", k, n);
216 name = str2id(pool, pd->content, 1);
219 name = str2id(pool, (char *)n, 1);
222 Id evr = makeevr_atts(pool, pd, atts);
224 for (flags = 0; flags < 6; flags++)
225 if (!strcmp(f, flagtab[flags]))
227 flags = flags < 6 ? flags + 1 : 0;
228 id = rel2id(pool, name, evr, flags, 1);
233 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
235 return source_addid_dep(pd->source, olddeps, id, isreq);
240 startElement(void *userData, const char *name, const char **atts)
242 struct parsedata *pd = userData;
243 Pool *pool = pd->pool;
244 Solvable *s = pd->start ? pd->start + pd->pack : 0;
245 struct stateswitch *sw;
247 if (pd->depth != pd->statedepth)
253 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
254 if (!strcmp(sw->ename, name))
256 if (sw->from != pd->state)
259 fprintf(stderr, "into unknown: %s\n", name);
264 pd->docontent = sw->docontent;
265 pd->statedepth = pd->depth;
271 for (; *atts; atts += 2)
273 if (!strcmp(*atts, "packages"))
275 pd->numpacks = atoi(atts[1]);
277 fprintf(stderr, "numpacks: %d\n", pd->numpacks);
279 pool->solvables = realloc(pool->solvables, (pool->nsolvables + pd->numpacks) * sizeof(Solvable));
280 pd->start = pool->solvables + pd->source->start;
281 memset(pd->start, 0, pd->numpacks * sizeof(Solvable));
282 pd->deps = calloc(pd->numpacks, sizeof(struct deps));
287 if (pd->pack >= pd->numpacks)
289 fprintf(stderr, "repomd lied about the package number\n");
293 fprintf(stderr, "package #%d\n", pd->pack);
297 s->evr = makeevr_atts(pool, pd, atts);
300 pd->deps[pd->pack].provides = 0;
302 case STATE_PROVIDESENTRY:
303 pd->deps[pd->pack].provides = adddep(pool, pd, pd->deps[pd->pack].provides, atts, 0);
306 pd->deps[pd->pack].requires = 0;
308 case STATE_REQUIRESENTRY:
309 pd->deps[pd->pack].requires = adddep(pool, pd, pd->deps[pd->pack].requires, atts, 1);
311 case STATE_OBSOLETES:
312 pd->deps[pd->pack].obsoletes = 0;
314 case STATE_OBSOLETESENTRY:
315 pd->deps[pd->pack].obsoletes = adddep(pool, pd, pd->deps[pd->pack].obsoletes, atts, 0);
317 case STATE_CONFLICTS:
318 pd->deps[pd->pack].conflicts = 0;
320 case STATE_CONFLICTSENTRY:
321 pd->deps[pd->pack].conflicts = adddep(pool, pd, pd->deps[pd->pack].conflicts, atts, 0);
323 case STATE_RECOMMENDS:
324 pd->deps[pd->pack].recommends = 0;
326 case STATE_RECOMMENDSENTRY:
327 pd->deps[pd->pack].recommends = adddep(pool, pd, pd->deps[pd->pack].recommends, atts, 0);
329 case STATE_SUPPLEMENTS:
330 pd->deps[pd->pack].supplements= 0;
332 case STATE_SUPPLEMENTSENTRY:
333 pd->deps[pd->pack].supplements = adddep(pool, pd, pd->deps[pd->pack].supplements, atts, 0);
336 pd->deps[pd->pack].suggests = 0;
338 case STATE_SUGGESTSENTRY:
339 pd->deps[pd->pack].suggests = adddep(pool, pd, pd->deps[pd->pack].suggests, atts, 0);
342 pd->deps[pd->pack].enhances = 0;
344 case STATE_ENHANCESENTRY:
345 pd->deps[pd->pack].enhances = adddep(pool, pd, pd->deps[pd->pack].enhances, atts, 0);
348 pd->deps[pd->pack].freshens = 0;
350 case STATE_FRESHENSENTRY:
351 pd->deps[pd->pack].freshens = adddep(pool, pd, pd->deps[pd->pack].freshens, atts, 0);
359 endElement(void *userData, const char *name)
361 struct parsedata *pd = userData;
362 Pool *pool = pd->pool;
363 Solvable *s = pd->start ? pd->start + pd->pack : 0;
366 if (pd->depth != pd->statedepth)
369 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
377 s->source = pd->source;
379 s->arch = ARCH_NOARCH;
380 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
381 pd->deps[pd->pack].provides = source_addid_dep(pd->source, pd->deps[pd->pack].provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
382 pd->deps[pd->pack].supplements = source_fix_legacy(pd->source, pd->deps[pd->pack].provides, pd->deps[pd->pack].supplements);
386 s->name = str2id(pool, pd->content, 1);
389 s->arch = str2id(pool, pd->content, 1);
392 id = str2id(pool, pd->content, 1);
393 pd->deps[pd->pack].provides = source_addid(pd->source, pd->deps[pd->pack].provides, id);
398 pd->state = pd->sbtab[pd->state];
400 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
404 characterData(void *userData, const XML_Char *s, int len)
406 struct parsedata *pd = userData;
412 l = pd->lcontent + len + 1;
413 if (l > pd->acontent)
415 pd->content = realloc(pd->content, l + 256);
416 pd->acontent = l + 256;
418 c = pd->content + pd->lcontent;
426 #define BUFF_SIZE 8192
429 pool_addsource_rpmmd(Pool *pool, FILE *fp)
437 struct stateswitch *sw;
439 source = pool_addsource_empty(pool);
440 memset(&pd, 0, sizeof(pd));
441 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
443 if (!pd.swtab[sw->from])
444 pd.swtab[sw->from] = sw;
445 pd.sbtab[sw->to] = sw->from;
449 pd.content = malloc(256);
452 XML_Parser parser = XML_ParserCreate(NULL);
453 XML_SetUserData(parser, &pd);
454 XML_SetElementHandler(parser, startElement, endElement);
455 XML_SetCharacterDataHandler(parser, characterData);
458 l = fread(buf, 1, sizeof(buf), fp);
459 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
461 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
467 XML_ParserFree(parser);
469 pool->nsolvables += pd.pack;
470 source->nsolvables = pd.pack;
473 s = pool->solvables + source->start;
474 for (i = 0; i < pd.pack; i++, s++)
476 s->provides = deps[i].provides;
477 s->requires = deps[i].requires;
478 s->conflicts = deps[i].conflicts;
479 s->obsoletes = deps[i].obsoletes;
480 s->recommends = deps[i].recommends;
481 s->supplements = deps[i].supplements;
482 s->suggests = deps[i].suggests;
483 s->enhances = deps[i].enhances;
484 s->freshens = deps[i].freshens;