2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
19 #include "repo_rpmmd.h"
40 STATE_RECOMMENDSENTRY,
42 STATE_SUPPLEMENTSENTRY,
61 static struct stateswitch stateswitches[] = {
62 { STATE_START, "metadata", STATE_METADATA, 0 },
63 { STATE_METADATA, "package", STATE_PACKAGE, 0 },
64 { STATE_PACKAGE, "name", STATE_NAME, 1 },
65 { STATE_PACKAGE, "arch", STATE_ARCH, 1 },
66 { STATE_PACKAGE, "version", STATE_VERSION, 0 },
67 { STATE_PACKAGE, "format", STATE_FORMAT, 0 },
68 { STATE_FORMAT, "rpm:vendor", STATE_VENDOR, 1 },
69 { STATE_FORMAT, "rpm:provides", STATE_PROVIDES, 0 },
70 { STATE_FORMAT, "rpm:requires", STATE_REQUIRES, 0 },
71 { STATE_FORMAT, "rpm:obsoletes", STATE_OBSOLETES , 0 },
72 { STATE_FORMAT, "rpm:conflicts", STATE_CONFLICTS , 0 },
73 { STATE_FORMAT, "rpm:recommends" , STATE_RECOMMENDS , 0 },
74 { STATE_FORMAT, "rpm:supplements", STATE_SUPPLEMENTS, 0 },
75 { STATE_FORMAT, "rpm:suggests", STATE_SUGGESTS, 0 },
76 { STATE_FORMAT, "rpm:enhances", STATE_ENHANCES, 0 },
77 { STATE_FORMAT, "rpm:freshens", STATE_FRESHENS, 0 },
78 { STATE_FORMAT, "file", STATE_FILE, 1 },
79 { STATE_PROVIDES, "rpm:entry", STATE_PROVIDESENTRY, 0 },
80 { STATE_REQUIRES, "rpm:entry", STATE_REQUIRESENTRY, 0 },
81 { STATE_OBSOLETES, "rpm:entry", STATE_OBSOLETESENTRY, 0 },
82 { STATE_CONFLICTS, "rpm:entry", STATE_CONFLICTSENTRY, 0 },
83 { STATE_RECOMMENDS, "rpm:entry", STATE_RECOMMENDSENTRY, 0 },
84 { STATE_SUPPLEMENTS, "rpm:entry", STATE_SUPPLEMENTSENTRY, 0 },
85 { STATE_SUGGESTS, "rpm:entry", STATE_SUGGESTSENTRY, 0 },
86 { STATE_ENHANCES, "rpm:entry", STATE_ENHANCESENTRY, 0 },
87 { STATE_FRESHENS, "rpm:entry", STATE_FRESHENSENTRY, 0 },
103 struct stateswitch *swtab[NUMSTATES];
104 enum state sbtab[NUMSTATES];
108 makeevr_atts(Pool *pool, struct parsedata *pd, const char **atts)
110 const char *e, *v, *r, *v2;
115 for (; *atts; atts += 2)
117 if (!strcmp(*atts, "epoch"))
119 else if (!strcmp(*atts, "ver"))
121 else if (!strcmp(*atts, "rel"))
124 if (e && !strcmp(e, "0"))
128 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++)
130 if (v2 > v && *v2 == ':')
140 if (l > pd->acontent)
142 pd->content = xrealloc(pd->content, l + 256);
143 pd->acontent = l + 256;
167 fprintf(stderr, "evr: %s\n", pd->content);
169 return str2id(pool, pd->content, 1);
172 static char *flagtab[] = {
182 adddep(Pool *pool, struct parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
185 const char *n, *f, *k;
189 marker = isreq ? -SOLVABLE_PREREQMARKER : 0;
190 for (a = atts; *a; a += 2)
192 if (!strcmp(*a, "name"))
194 else if (!strcmp(*a, "flags"))
196 else if (!strcmp(*a, "kind"))
198 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
199 marker = SOLVABLE_PREREQMARKER;
203 if (k && !strcmp(k, "package"))
207 int l = strlen(k) + 1 + strlen(n) + 1;
208 if (l > pd->acontent)
210 pd->content = xrealloc(pd->content, l + 256);
211 pd->acontent = l + 256;
213 sprintf(pd->content, "%s:%s", k, n);
214 name = str2id(pool, pd->content, 1);
217 name = str2id(pool, (char *)n, 1);
220 Id evr = makeevr_atts(pool, pd, atts);
222 for (flags = 0; flags < 6; flags++)
223 if (!strcmp(f, flagtab[flags]))
225 flags = flags < 6 ? flags + 1 : 0;
226 id = rel2id(pool, name, evr, flags, 1);
231 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
233 return repo_addid_dep(pd->repo, olddeps, id, marker);
238 startElement(void *userData, const char *name, const char **atts)
240 struct parsedata *pd = userData;
241 Pool *pool = pd->pool;
242 Solvable *s = pd->solvable;
243 struct stateswitch *sw;
245 if (pd->depth != pd->statedepth)
251 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
252 if (!strcmp(sw->ename, name))
254 if (sw->from != pd->state)
257 fprintf(stderr, "into unknown: %s\n", name);
262 pd->docontent = sw->docontent;
263 pd->statedepth = pd->depth;
269 for (; *atts; atts += 2)
271 if (!strcmp(*atts, "packages"))
273 pd->numpacks = atoi(atts[1]);
274 if (pd->numpacks < 0)
277 fprintf(stderr, "numpacks: %d\n", pd->numpacks);
279 pd->solvable = pool_id2solvable(pool, repo_add_solvable_block(pd->repo, pd->numpacks));
284 if (pd->numpacks == 0)
285 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
287 fprintf(stderr, "package #%d\n", pd->solvable - pool->solvables);
291 s->evr = makeevr_atts(pool, pd, atts);
296 case STATE_PROVIDESENTRY:
297 s->provides = adddep(pool, pd, s->provides, atts, 0);
302 case STATE_REQUIRESENTRY:
303 s->requires = adddep(pool, pd, s->requires, atts, 1);
305 case STATE_OBSOLETES:
308 case STATE_OBSOLETESENTRY:
309 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
311 case STATE_CONFLICTS:
314 case STATE_CONFLICTSENTRY:
315 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
317 case STATE_RECOMMENDS:
320 case STATE_RECOMMENDSENTRY:
321 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
323 case STATE_SUPPLEMENTS:
326 case STATE_SUPPLEMENTSENTRY:
327 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
332 case STATE_SUGGESTSENTRY:
333 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
338 case STATE_ENHANCESENTRY:
339 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
344 case STATE_FRESHENSENTRY:
345 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
353 endElement(void *userData, const char *name)
355 struct parsedata *pd = userData;
356 Pool *pool = pd->pool;
357 Solvable *s = pd->solvable;
360 if (pd->depth != pd->statedepth)
363 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
372 s->arch = ARCH_NOARCH;
373 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
374 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
375 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
376 if (pd->numpacks > 0)
383 s->name = str2id(pool, pd->content, 1);
386 s->arch = str2id(pool, pd->content, 1);
389 s->vendor = str2id(pool, pd->content, 1);
392 id = str2id(pool, pd->content, 1);
393 s->provides = repo_addid(pd->repo, s->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 = xrealloc(pd->content, l + 256);
416 pd->acontent = l + 256;
418 c = pd->content + pd->lcontent;
426 #define BUFF_SIZE 8192
429 repo_add_rpmmd(Repo *repo, FILE *fp)
431 Pool *pool = repo->pool;
435 struct stateswitch *sw;
437 memset(&pd, 0, sizeof(pd));
438 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
440 if (!pd.swtab[sw->from])
441 pd.swtab[sw->from] = sw;
442 pd.sbtab[sw->to] = sw->from;
446 pd.content = malloc(256);
449 XML_Parser parser = XML_ParserCreate(NULL);
450 XML_SetUserData(parser, &pd);
451 XML_SetElementHandler(parser, startElement, endElement);
452 XML_SetCharacterDataHandler(parser, characterData);
455 l = fread(buf, 1, sizeof(buf), fp);
456 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
458 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
464 XML_ParserFree(parser);
466 repo_free_solvable_block(repo, pd.solvable - pool->solvables, pd.numpacks, 1);