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 for (a = atts; *a; a += 2)
191 if (!strcmp(*a, "name"))
193 else if (!strcmp(*a, "flags"))
195 else if (!strcmp(*a, "kind"))
197 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
202 if (k && !strcmp(k, "package"))
206 int l = strlen(k) + 1 + strlen(n) + 1;
207 if (l > pd->acontent)
209 pd->content = xrealloc(pd->content, l + 256);
210 pd->acontent = l + 256;
212 sprintf(pd->content, "%s:%s", k, n);
213 name = str2id(pool, pd->content, 1);
216 name = str2id(pool, (char *)n, 1);
219 Id evr = makeevr_atts(pool, pd, atts);
221 for (flags = 0; flags < 6; flags++)
222 if (!strcmp(f, flagtab[flags]))
224 flags = flags < 6 ? flags + 1 : 0;
225 id = rel2id(pool, name, evr, flags, 1);
230 fprintf(stderr, "new dep %s%s%s\n", id2str(pool, d), id2rel(pool, d), id2evr(pool, d));
232 return repo_addid_dep(pd->repo, olddeps, id, isreq);
237 startElement(void *userData, const char *name, const char **atts)
239 struct parsedata *pd = userData;
240 Pool *pool = pd->pool;
241 Solvable *s = pd->solvable;
242 struct stateswitch *sw;
244 if (pd->depth != pd->statedepth)
250 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
251 if (!strcmp(sw->ename, name))
253 if (sw->from != pd->state)
256 fprintf(stderr, "into unknown: %s\n", name);
261 pd->docontent = sw->docontent;
262 pd->statedepth = pd->depth;
268 for (; *atts; atts += 2)
270 if (!strcmp(*atts, "packages"))
272 pd->numpacks = atoi(atts[1]);
273 if (pd->numpacks < 0)
276 fprintf(stderr, "numpacks: %d\n", pd->numpacks);
278 pd->solvable = pool_id2solvable(pool, repo_add_solvable_block(pd->repo, pd->numpacks));
283 if (pd->numpacks == 0)
284 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
286 fprintf(stderr, "package #%d\n", pd->solvable - pool->solvables);
290 s->evr = makeevr_atts(pool, pd, atts);
295 case STATE_PROVIDESENTRY:
296 s->provides = adddep(pool, pd, s->provides, atts, 0);
301 case STATE_REQUIRESENTRY:
302 s->requires = adddep(pool, pd, s->requires, atts, 1);
304 case STATE_OBSOLETES:
307 case STATE_OBSOLETESENTRY:
308 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
310 case STATE_CONFLICTS:
313 case STATE_CONFLICTSENTRY:
314 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
316 case STATE_RECOMMENDS:
319 case STATE_RECOMMENDSENTRY:
320 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
322 case STATE_SUPPLEMENTS:
325 case STATE_SUPPLEMENTSENTRY:
326 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
331 case STATE_SUGGESTSENTRY:
332 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
337 case STATE_ENHANCESENTRY:
338 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
343 case STATE_FRESHENSENTRY:
344 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
352 endElement(void *userData, const char *name)
354 struct parsedata *pd = userData;
355 Pool *pool = pd->pool;
356 Solvable *s = pd->solvable;
359 if (pd->depth != pd->statedepth)
362 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
371 s->arch = ARCH_NOARCH;
372 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
373 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
374 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
375 if (pd->numpacks > 0)
382 s->name = str2id(pool, pd->content, 1);
385 s->arch = str2id(pool, pd->content, 1);
388 s->vendor = str2id(pool, pd->content, 1);
391 id = str2id(pool, pd->content, 1);
392 s->provides = repo_addid(pd->repo, s->provides, id);
397 pd->state = pd->sbtab[pd->state];
399 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
403 characterData(void *userData, const XML_Char *s, int len)
405 struct parsedata *pd = userData;
411 l = pd->lcontent + len + 1;
412 if (l > pd->acontent)
414 pd->content = xrealloc(pd->content, l + 256);
415 pd->acontent = l + 256;
417 c = pd->content + pd->lcontent;
425 #define BUFF_SIZE 8192
428 repo_add_rpmmd(Repo *repo, FILE *fp)
430 Pool *pool = repo->pool;
434 struct stateswitch *sw;
436 memset(&pd, 0, sizeof(pd));
437 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
439 if (!pd.swtab[sw->from])
440 pd.swtab[sw->from] = sw;
441 pd.sbtab[sw->to] = sw->from;
445 pd.content = malloc(256);
448 XML_Parser parser = XML_ParserCreate(NULL);
449 XML_SetUserData(parser, &pd);
450 XML_SetElementHandler(parser, startElement, endElement);
451 XML_SetCharacterDataHandler(parser, characterData);
454 l = fread(buf, 1, sizeof(buf), fp);
455 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
457 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
463 XML_ParserFree(parser);
465 repo_free_solvable_block(repo, pd.solvable - pool->solvables, pd.numpacks, 1);