2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
18 #include "repo_patchxml.h"
19 #include "repo_rpmmd.h"
38 STATE_RECOMMENDSENTRY,
40 STATE_SUPPLEMENTSENTRY,
58 static struct stateswitch stateswitches[] = {
59 { STATE_START, "patch", STATE_PATCH, 0 },
60 { STATE_START, "package", STATE_ATOM, 0 },
61 { STATE_START, "patches", STATE_START, 0},
62 { STATE_PATCH, "yum:name", STATE_NAME, 1 },
63 { STATE_PATCH, "yum:arch", STATE_ARCH, 1 },
64 { STATE_PATCH, "yum:version", STATE_VERSION, 0 },
65 { STATE_PATCH, "name", STATE_NAME, 1 },
66 { STATE_PATCH, "arch", STATE_ARCH, 1 },
67 { STATE_PATCH, "version", STATE_VERSION, 0 },
68 { STATE_PATCH, "rpm:requires", STATE_REQUIRES, 0 },
69 { STATE_PATCH, "rpm:provides", STATE_PROVIDES, 0 },
70 { STATE_PATCH, "rpm:requires", STATE_REQUIRES, 0 },
71 { STATE_PATCH, "rpm:obsoletes", STATE_OBSOLETES , 0 },
72 { STATE_PATCH, "rpm:conflicts", STATE_CONFLICTS , 0 },
73 { STATE_PATCH, "rpm:recommends" , STATE_RECOMMENDS , 0 },
74 { STATE_PATCH, "rpm:supplements", STATE_SUPPLEMENTS, 0 },
75 { STATE_PATCH, "rpm:suggests", STATE_SUGGESTS, 0 },
76 { STATE_PATCH, "rpm:enhances", STATE_ENHANCES, 0 },
77 { STATE_PATCH, "rpm:freshens", STATE_FRESHENS, 0 },
78 { STATE_PATCH, "suse:freshens", STATE_FRESHENS, 0 },
79 { STATE_PATCH, "atoms", STATE_START, 0 },
80 { STATE_PROVIDES, "rpm:entry", STATE_PROVIDESENTRY, 0 },
81 { STATE_REQUIRES, "rpm:entry", STATE_REQUIRESENTRY, 0 },
82 { STATE_OBSOLETES, "rpm:entry", STATE_OBSOLETESENTRY, 0 },
83 { STATE_CONFLICTS, "rpm:entry", STATE_CONFLICTSENTRY, 0 },
84 { STATE_RECOMMENDS, "rpm:entry", STATE_RECOMMENDSENTRY, 0 },
85 { STATE_SUPPLEMENTS, "rpm:entry", STATE_SUPPLEMENTSENTRY, 0 },
86 { STATE_SUGGESTS, "rpm:entry", STATE_SUGGESTSENTRY, 0 },
87 { STATE_ENHANCES, "rpm:entry", STATE_ENHANCESENTRY, 0 },
88 { STATE_FRESHENS, "rpm:entry", STATE_FRESHENSENTRY, 0 },
89 { STATE_FRESHENS, "suse:entry", STATE_FRESHENSENTRY, 0 },
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 marker = isreq ? -SOLVABLE_PREREQMARKER : 0;
193 for (a = atts; *a; a += 2)
195 if (!strcmp(*a, "name"))
197 else if (!strcmp(*a, "flags"))
199 else if (!strcmp(*a, "kind"))
201 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
202 marker = SOLVABLE_PREREQMARKER;
206 if (k && !strcmp(k, "package"))
210 int l = strlen(k) + 1 + strlen(n) + 1;
211 if (l > pd->acontent)
213 pd->content = realloc(pd->content, l + 256);
214 pd->acontent = l + 256;
216 sprintf(pd->content, "%s:%s", k, n);
217 name = str2id(pool, pd->content, 1);
220 name = str2id(pool, (char *)n, 1);
223 Id evr = makeevr_atts(pool, pd, atts);
225 for (flags = 0; flags < 6; flags++)
226 if (!strcmp(f, flagtab[flags]))
228 flags = flags < 6 ? flags + 1 : 0;
229 id = rel2id(pool, name, evr, flags, 1);
234 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
236 return repo_addid_dep(pd->repo, olddeps, id, marker);
241 startElement(void *userData, const char *name, const char **atts)
243 struct parsedata *pd = userData;
244 Pool *pool = pd->pool;
245 Solvable *s = pd->solvable;
246 struct stateswitch *sw;
248 if (pd->depth != pd->statedepth)
254 if (pd->state == STATE_PATCH && !strcmp(name, "format"))
258 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
259 if (!strcmp(sw->ename, name))
261 if (sw->from != pd->state)
264 fprintf(stderr, "into unknown: %s\n", name);
269 pd->docontent = sw->docontent;
270 pd->statedepth = pd->depth;
278 strcpy(pd->content, pd->kind);
279 pd->lcontent = strlen(pd->content);
280 pd->content[pd->lcontent++] = ':';
281 pd->content[pd->lcontent] = 0;
286 if (pd->state == STATE_ATOM)
288 /* HACK: close patch */
289 if (pd->kind && !strcmp(pd->kind, "patch"))
292 s->arch = ARCH_NOARCH;
293 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
296 pd->state = STATE_PATCH;
301 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
303 fprintf(stderr, "package #%d\n", pd->solvable - pool->solvables);
307 s->evr = makeevr_atts(pool, pd, atts);
312 case STATE_PROVIDESENTRY:
313 s->provides = adddep(pool, pd, s->provides, atts, 0);
318 case STATE_REQUIRESENTRY:
319 s->requires = adddep(pool, pd, s->requires, atts, 1);
321 case STATE_OBSOLETES:
324 case STATE_OBSOLETESENTRY:
325 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
327 case STATE_CONFLICTS:
330 case STATE_CONFLICTSENTRY:
331 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
333 case STATE_RECOMMENDS:
336 case STATE_RECOMMENDSENTRY:
337 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
339 case STATE_SUPPLEMENTS:
342 case STATE_SUPPLEMENTSENTRY:
343 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
348 case STATE_SUGGESTSENTRY:
349 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
354 case STATE_ENHANCESENTRY:
355 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
360 case STATE_FRESHENSENTRY:
361 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
369 endElement(void *userData, const char *name)
371 struct parsedata *pd = userData;
372 Pool *pool = pd->pool;
373 Solvable *s = pd->solvable;
375 if (pd->depth != pd->statedepth)
378 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
382 if (pd->state == STATE_PATCH && !strcmp(name, "format"))
390 if (!strcmp(name, "patch") && strcmp(pd->kind, "patch"))
391 break; /* already closed */
393 s->arch = ARCH_NOARCH;
394 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
395 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
396 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
399 s->name = str2id(pool, pd->content, 1);
402 s->arch = str2id(pool, pd->content, 1);
407 pd->state = pd->sbtab[pd->state];
409 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
413 characterData(void *userData, const XML_Char *s, int len)
415 struct parsedata *pd = userData;
421 l = pd->lcontent + len + 1;
422 if (l > pd->acontent)
424 pd->content = realloc(pd->content, l + 256);
425 pd->acontent = l + 256;
427 c = pd->content + pd->lcontent;
435 #define BUFF_SIZE 8192
438 repo_add_patchxml(Repo *repo, FILE *fp)
440 Pool *pool = repo->pool;
444 struct stateswitch *sw;
446 memset(&pd, 0, sizeof(pd));
447 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
449 if (!pd.swtab[sw->from])
450 pd.swtab[sw->from] = sw;
451 pd.sbtab[sw->to] = sw->from;
455 pd.content = malloc(256);
458 XML_Parser parser = XML_ParserCreate(NULL);
459 XML_SetUserData(parser, &pd);
460 XML_SetElementHandler(parser, startElement, endElement);
461 XML_SetCharacterDataHandler(parser, characterData);
464 l = fread(buf, 1, sizeof(buf), fp);
465 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
467 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
473 XML_ParserFree(parser);