2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
17 #include "repo_patchxml.h"
18 #include "repo_rpmmd.h"
37 STATE_RECOMMENDSENTRY,
39 STATE_SUPPLEMENTSENTRY,
49 #define PACK_BLOCK 255
59 static struct stateswitch stateswitches[] = {
60 { STATE_START, "patch", STATE_PATCH, 0 },
61 { STATE_START, "package", STATE_ATOM, 0 },
62 { STATE_START, "patches", STATE_START, 0},
63 { STATE_PATCH, "yum:name", STATE_NAME, 1 },
64 { STATE_PATCH, "yum:arch", STATE_ARCH, 1 },
65 { STATE_PATCH, "yum:version", STATE_VERSION, 0 },
66 { STATE_PATCH, "name", STATE_NAME, 1 },
67 { STATE_PATCH, "arch", STATE_ARCH, 1 },
68 { STATE_PATCH, "version", STATE_VERSION, 0 },
69 { STATE_PATCH, "rpm:requires", STATE_REQUIRES, 0 },
70 { STATE_PATCH, "rpm:provides", STATE_PROVIDES, 0 },
71 { STATE_PATCH, "rpm:requires", STATE_REQUIRES, 0 },
72 { STATE_PATCH, "rpm:obsoletes", STATE_OBSOLETES , 0 },
73 { STATE_PATCH, "rpm:conflicts", STATE_CONFLICTS , 0 },
74 { STATE_PATCH, "rpm:recommends" , STATE_RECOMMENDS , 0 },
75 { STATE_PATCH, "rpm:supplements", STATE_SUPPLEMENTS, 0 },
76 { STATE_PATCH, "rpm:suggests", STATE_SUGGESTS, 0 },
77 { STATE_PATCH, "rpm:enhances", STATE_ENHANCES, 0 },
78 { STATE_PATCH, "rpm:freshens", STATE_FRESHENS, 0 },
79 { STATE_PATCH, "suse:freshens", STATE_FRESHENS, 0 },
80 { STATE_PATCH, "atoms", STATE_START, 0 },
81 { STATE_PROVIDES, "rpm:entry", STATE_PROVIDESENTRY, 0 },
82 { STATE_REQUIRES, "rpm:entry", STATE_REQUIRESENTRY, 0 },
83 { STATE_OBSOLETES, "rpm:entry", STATE_OBSOLETESENTRY, 0 },
84 { STATE_CONFLICTS, "rpm:entry", STATE_CONFLICTSENTRY, 0 },
85 { STATE_RECOMMENDS, "rpm:entry", STATE_RECOMMENDSENTRY, 0 },
86 { STATE_SUPPLEMENTS, "rpm:entry", STATE_SUPPLEMENTSENTRY, 0 },
87 { STATE_SUGGESTS, "rpm:entry", STATE_SUGGESTSENTRY, 0 },
88 { STATE_ENHANCES, "rpm:entry", STATE_ENHANCESENTRY, 0 },
89 { STATE_FRESHENS, "rpm:entry", STATE_FRESHENSENTRY, 0 },
90 { STATE_FRESHENS, "suse:entry", STATE_FRESHENSENTRY, 0 },
108 struct stateswitch *swtab[NUMSTATES];
109 enum state sbtab[NUMSTATES];
113 makeevr_atts(Pool *pool, struct parsedata *pd, const char **atts)
115 const char *e, *v, *r, *v2;
120 for (; *atts; atts += 2)
122 if (!strcmp(*atts, "epoch"))
124 else if (!strcmp(*atts, "ver"))
126 else if (!strcmp(*atts, "rel"))
129 if (e && !strcmp(e, "0"))
133 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++)
135 if (v2 > v && *v2 == ':')
145 if (l > pd->acontent)
147 pd->content = realloc(pd->content, l + 256);
148 pd->acontent = l + 256;
172 fprintf(stderr, "evr: %s\n", pd->content);
174 return str2id(pool, pd->content, 1);
177 static char *flagtab[] = {
187 adddep(Pool *pool, struct parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
190 const char *n, *f, *k;
194 for (a = atts; *a; a += 2)
196 if (!strcmp(*a, "name"))
198 else if (!strcmp(*a, "flags"))
200 else if (!strcmp(*a, "kind"))
202 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
207 if (k && !strcmp(k, "package"))
211 int l = strlen(k) + 1 + strlen(n) + 1;
212 if (l > pd->acontent)
214 pd->content = realloc(pd->content, l + 256);
215 pd->acontent = l + 256;
217 sprintf(pd->content, "%s:%s", k, n);
218 name = str2id(pool, pd->content, 1);
221 name = str2id(pool, (char *)n, 1);
224 Id evr = makeevr_atts(pool, pd, atts);
226 for (flags = 0; flags < 6; flags++)
227 if (!strcmp(f, flagtab[flags]))
229 flags = flags < 6 ? flags + 1 : 0;
230 id = rel2id(pool, name, evr, flags, 1);
235 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
237 return repo_addid_dep(pd->repo, olddeps, id, isreq);
242 startElement(void *userData, const char *name, const char **atts)
244 struct parsedata *pd = userData;
245 Pool *pool = pd->pool;
246 Solvable *s = pd->start ? pd->start + pd->pack : 0;
247 struct stateswitch *sw;
249 if (pd->depth != pd->statedepth)
255 if (pd->state == STATE_PATCH && !strcmp(name, "format"))
259 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
260 if (!strcmp(sw->ename, name))
262 if (sw->from != pd->state)
265 fprintf(stderr, "into unknown: %s\n", name);
270 pd->docontent = sw->docontent;
271 pd->statedepth = pd->depth;
279 strcpy(pd->content, pd->kind);
280 pd->lcontent = strlen(pd->content);
281 pd->content[pd->lcontent++] = ':';
282 pd->content[pd->lcontent] = 0;
287 if (pd->state == STATE_ATOM)
289 /* HACK: close patch */
290 if (pd->kind && !strcmp(pd->kind, "patch"))
294 s->arch = ARCH_NOARCH;
295 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
299 pd->state = STATE_PATCH;
303 if ((pd->pack & PACK_BLOCK) == 0)
305 pool->solvables = realloc(pool->solvables, (pool->nsolvables + pd->pack + PACK_BLOCK + 1) * sizeof(Solvable));
306 pd->start = pool->solvables + pool->nsolvables;
307 memset(pd->start + pd->pack, 0, (PACK_BLOCK + 1) * sizeof(Solvable));
310 fprintf(stderr, "package #%d\n", pd->pack);
314 s->evr = makeevr_atts(pool, pd, atts);
319 case STATE_PROVIDESENTRY:
320 s->provides = adddep(pool, pd, s->provides, atts, 0);
325 case STATE_REQUIRESENTRY:
326 s->requires = adddep(pool, pd, s->requires, atts, 1);
328 case STATE_OBSOLETES:
331 case STATE_OBSOLETESENTRY:
332 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
334 case STATE_CONFLICTS:
337 case STATE_CONFLICTSENTRY:
338 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
340 case STATE_RECOMMENDS:
343 case STATE_RECOMMENDSENTRY:
344 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
346 case STATE_SUPPLEMENTS:
349 case STATE_SUPPLEMENTSENTRY:
350 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
355 case STATE_SUGGESTSENTRY:
356 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
361 case STATE_ENHANCESENTRY:
362 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
367 case STATE_FRESHENSENTRY:
368 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
376 endElement(void *userData, const char *name)
378 struct parsedata *pd = userData;
379 Pool *pool = pd->pool;
380 Solvable *s = pd->start ? pd->start + pd->pack : 0;
382 if (pd->depth != pd->statedepth)
385 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
389 if (pd->state == STATE_PATCH && !strcmp(name, "format"))
397 if (!strcmp(name, "patch") && strcmp(pd->kind, "patch"))
398 break; /* already closed */
401 s->arch = ARCH_NOARCH;
402 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
403 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
404 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
408 s->name = str2id(pool, pd->content, 1);
411 s->arch = str2id(pool, pd->content, 1);
416 pd->state = pd->sbtab[pd->state];
418 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
422 characterData(void *userData, const XML_Char *s, int len)
424 struct parsedata *pd = userData;
430 l = pd->lcontent + len + 1;
431 if (l > pd->acontent)
433 pd->content = realloc(pd->content, l + 256);
434 pd->acontent = l + 256;
436 c = pd->content + pd->lcontent;
444 #define BUFF_SIZE 8192
447 repo_add_patchxml(Repo *repo, FILE *fp)
449 Pool *pool = repo->pool;
453 struct stateswitch *sw;
455 if (repo->start && repo->start + repo->nsolvables != pool->nsolvables)
457 if (!repo->start || repo->start == repo->end)
458 repo->start = pool->nsolvables;
459 repo->end = pool->nsolvables;
461 memset(&pd, 0, sizeof(pd));
462 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
464 if (!pd.swtab[sw->from])
465 pd.swtab[sw->from] = sw;
466 pd.sbtab[sw->to] = sw->from;
470 pd.content = malloc(256);
473 XML_Parser parser = XML_ParserCreate(NULL);
474 XML_SetUserData(parser, &pd);
475 XML_SetElementHandler(parser, startElement, endElement);
476 XML_SetCharacterDataHandler(parser, characterData);
479 l = fread(buf, 1, sizeof(buf), fp);
480 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
482 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
488 XML_ParserFree(parser);
490 pool->nsolvables += pd.pack;
491 repo->nsolvables += pd.pack;
492 repo->end += pd.pack;