2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
11 * Parse 'helix' XML representation
16 #include <sys/types.h>
24 #include "repo_helix.h"
28 /* XML parser states */
53 STATE_RECOMMENDSENTRY,
55 STATE_SUPPLEMENTSENTRY,
84 static struct stateswitch stateswitches[] = {
85 { STATE_START, "channel", STATE_CHANNEL, 0 },
86 { STATE_CHANNEL, "subchannel", STATE_SUBCHANNEL, 0 },
87 { STATE_SUBCHANNEL, "package", STATE_PACKAGE, 0 },
88 { STATE_SUBCHANNEL, "selection", STATE_PACKAGE, 0 },
89 { STATE_SUBCHANNEL, "pattern", STATE_PACKAGE, 0 },
90 { STATE_SUBCHANNEL, "atom", STATE_PACKAGE, 0 },
91 { STATE_SUBCHANNEL, "patch", STATE_PACKAGE, 0 },
92 { STATE_SUBCHANNEL, "product", STATE_PACKAGE, 0 },
93 { STATE_PACKAGE, "name", STATE_NAME, 1 },
94 { STATE_PACKAGE, "vendor", STATE_VENDOR, 1 },
95 { STATE_PACKAGE, "buildtime", STATE_BUILDTIME, 1 },
96 { STATE_PACKAGE, "epoch", STATE_PEPOCH, 1 },
97 { STATE_PACKAGE, "version", STATE_PVERSION, 1 },
98 { STATE_PACKAGE, "release", STATE_PRELEASE, 1 },
99 { STATE_PACKAGE, "arch", STATE_PARCH, 1 },
100 { STATE_PACKAGE, "history", STATE_HISTORY, 0 },
101 { STATE_PACKAGE, "provides", STATE_PROVIDES, 0 },
102 { STATE_PACKAGE, "requires", STATE_REQUIRES, 0 },
103 { STATE_PACKAGE, "obsoletes", STATE_OBSOLETES , 0 },
104 { STATE_PACKAGE, "conflicts", STATE_CONFLICTS , 0 },
105 { STATE_PACKAGE, "recommends" , STATE_RECOMMENDS , 0 },
106 { STATE_PACKAGE, "supplements", STATE_SUPPLEMENTS, 0 },
107 { STATE_PACKAGE, "suggests", STATE_SUGGESTS, 0 },
108 { STATE_PACKAGE, "enhances", STATE_ENHANCES, 0 },
109 { STATE_PACKAGE, "freshens", STATE_FRESHENS, 0 },
111 { STATE_HISTORY, "update", STATE_UPDATE, 0 },
112 { STATE_UPDATE, "epoch", STATE_EPOCH, 1 },
113 { STATE_UPDATE, "version", STATE_VERSION, 1 },
114 { STATE_UPDATE, "release", STATE_RELEASE, 1 },
115 { STATE_UPDATE, "arch", STATE_ARCH, 1 },
117 { STATE_PROVIDES, "dep", STATE_PROVIDESENTRY, 0 },
118 { STATE_REQUIRES, "dep", STATE_REQUIRESENTRY, 0 },
119 { STATE_OBSOLETES, "dep", STATE_OBSOLETESENTRY, 0 },
120 { STATE_CONFLICTS, "dep", STATE_CONFLICTSENTRY, 0 },
121 { STATE_RECOMMENDS, "dep", STATE_RECOMMENDSENTRY, 0 },
122 { STATE_SUPPLEMENTS, "dep", STATE_SUPPLEMENTSENTRY, 0 },
123 { STATE_SUGGESTS, "dep", STATE_SUGGESTSENTRY, 0 },
124 { STATE_ENHANCES, "dep", STATE_ENHANCESENTRY, 0 },
125 { STATE_FRESHENS, "dep", STATE_FRESHENSENTRY, 0 },
134 typedef struct _parsedata {
137 enum state state; // current state
139 char *content; // buffer for content of node
140 int lcontent; // actual length of current content
141 int acontent; // actual buffer size
142 int docontent; // handle content
145 Pool *pool; // current pool
146 Repo *repo; // current repo
147 Repodata *data; // current repo data
148 Solvable *solvable; // current solvable
151 int epoch; // epoch (as offset into evrspace)
152 int version; // version (as offset into evrspace)
153 int release; // release (as offset into evrspace)
154 char *evrspace; // buffer for evr
155 int aevrspace; // actual buffer space
156 int levrspace; // actual evr length
159 struct stateswitch *swtab[NUMSTATES];
160 enum state sbtab[NUMSTATES];
164 /*------------------------------------------------------------------*/
167 // create Id from epoch:version-release
170 evr2id(Pool *pool, Parsedata *pd, const char *e, const char *v, const char *r)
175 // treat explitcit 0 as NULL
176 if (e && !strcmp(e, "0"))
182 // scan version for ":"
183 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++) // skip leading digits
185 // if version contains ":", set epoch to "0"
186 if (v2 > v && *v2 == ':')
190 // compute length of Id string
193 l += strlen(e) + 1; // e:
197 l += strlen(r) + 1; // -r
199 // extend content if not sufficient
200 if (l > pd->acontent)
202 pd->content = (char *)realloc(pd->content, l + 256);
203 pd->acontent = l + 256;
206 // copy e-v-r to content
226 // if nothing inserted, return Id 0
230 fprintf(stderr, "evr: %s\n", pd->content);
233 return str2id(pool, pd->content, 1);
237 // create e:v-r from attributes
238 // atts is array of name,value pairs, NULL at end
239 // even index into atts is name
240 // odd index is value
243 evr_atts2id(Pool *pool, Parsedata *pd, const char **atts)
245 const char *e, *v, *r;
247 for (; *atts; atts += 2)
249 if (!strcmp(*atts, "epoch"))
251 else if (!strcmp(*atts, "version"))
253 else if (!strcmp(*atts, "release"))
256 return evr2id(pool, pd, e, v, r);
259 /*------------------------------------------------------------------*/
260 /* rel operator handling */
267 static struct flagtab flagtab[] = {
270 { ">=", REL_GT|REL_EQ },
272 { "!=", REL_GT|REL_LT },
273 { "<=", REL_LT|REL_EQ },
274 { "(any)", REL_LT|REL_EQ|REL_GT },
278 { "ge", REL_GT|REL_EQ },
280 { "ne", REL_GT|REL_LT },
281 { "le", REL_LT|REL_EQ },
282 { "gte", REL_GT|REL_EQ },
283 { "lte", REL_LT|REL_EQ },
286 { "GE", REL_GT|REL_EQ },
288 { "NE", REL_GT|REL_LT },
289 { "LE", REL_LT|REL_EQ }
293 * process new dependency from parser
294 * olddeps = already collected deps, this defines the 'kind' of dep
295 * atts = array of name,value attributes of dep
296 * isreq == 1 if its a requires
300 adddep(Pool *pool, Parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
303 const char *n, *f, *k;
307 marker = isreq ? -SOLVABLE_PREREQMARKER : 0;
309 /* loop over name,value pairs */
310 for (a = atts; *a; a += 2)
312 if (!strcmp(*a, "name"))
314 if (!strcmp(*a, "kind"))
316 else if (!strcmp(*a, "op"))
318 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
319 marker = SOLVABLE_PREREQMARKER;
321 if (!n) /* quit if no name found */
325 if (k && !strcmp(k, "package"))
326 k = NULL; /* package is default */
328 if (k) /* if kind!=package, intern <kind>:<name> */
330 int l = strlen(k) + 1 + strlen(n) + 1;
331 if (l > pd->acontent) /* extend buffer if needed */
333 pd->content = (char *)realloc(pd->content, l + 256);
334 pd->acontent = l + 256;
336 sprintf(pd->content, "%s:%s", k, n);
337 name = str2id(pool, pd->content, 1);
341 name = str2id(pool, n, 1); /* package: just intern <name> */
344 if (f) /* operator ? */
347 Id evr = evr_atts2id(pool, pd, atts);
348 /* parser operator to flags */
350 for (flags = 0; flags < sizeof(flagtab)/sizeof(*flagtab); flags++)
351 if (!strcmp(f, flagtab[flags].from))
353 flags = flagtab[flags].to;
359 id = rel2id(pool, name, evr, flags, 1);
362 id = name; /* no operator */
364 /* add new dependency to repo */
365 return repo_addid_dep(pd->repo, olddeps, id, marker);
369 /*----------------------------------------------------------------*/
378 startElement(void *userData, const char *name, const char **atts)
380 Parsedata *pd = (Parsedata *)userData;
381 struct stateswitch *sw;
382 Pool *pool = pd->pool;
383 Solvable *s = pd->solvable;
385 if (pd->depth != pd->statedepth)
391 /* ignore deps element */
392 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
397 /* find node name in stateswitch */
398 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
400 if (!strcmp(sw->ename, name))
404 /* check if we're at the right level */
405 if (sw->from != pd->state)
408 fprintf(stderr, "into unknown: %s\n", name);
416 pd->docontent = sw->docontent;
417 pd->statedepth = pd->depth;
419 // start with empty content
420 // (will collect data until end element
428 if (pd->kind) /* if kind is set (non package) */
430 strcpy(pd->content, pd->kind);
431 pd->lcontent = strlen(pd->content);
432 pd->content[pd->lcontent++] = ':'; /* prefix name with '<kind>:' */
433 pd->content[pd->lcontent] = 0;
437 case STATE_PACKAGE: /* solvable name */
438 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
440 repodata_extend(pd->data, pd->solvable - pool->solvables);
442 if (!strcmp(name, "selection"))
443 pd->kind = "selection";
444 else if (!strcmp(name, "pattern"))
445 pd->kind = "pattern";
446 else if (!strcmp(name, "atom"))
448 else if (!strcmp(name, "product"))
449 pd->kind = "product";
450 else if (!strcmp(name, "patch"))
453 pd->kind = NULL; /* default is package */
459 fprintf(stderr, "package #%d\n", s - pool->solvables);
470 case STATE_PROVIDES: /* start of provides */
473 case STATE_PROVIDESENTRY: /* entry within provides */
474 s->provides = adddep(pool, pd, s->provides, atts, 0);
479 case STATE_REQUIRESENTRY:
480 s->requires = adddep(pool, pd, s->requires, atts, 1);
482 case STATE_OBSOLETES:
485 case STATE_OBSOLETESENTRY:
486 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
488 case STATE_CONFLICTS:
491 case STATE_CONFLICTSENTRY:
492 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
494 case STATE_RECOMMENDS:
497 case STATE_RECOMMENDSENTRY:
498 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
500 case STATE_SUPPLEMENTS:
503 case STATE_SUPPLEMENTSENTRY:
504 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
509 case STATE_SUGGESTSENTRY:
510 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
515 case STATE_ENHANCESENTRY:
516 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
521 case STATE_FRESHENSENTRY:
522 s->freshens = adddep(pool, pd, s->freshens, atts, 0);
529 static const char* findKernelFlavor(Parsedata *pd, Solvable *s)
531 Pool *pool = pd->pool;
537 for (pidp = pd->repo->idarraydata + s->provides; pidp && (pid = *pidp++) != 0; )
543 continue; /* wrong provides name */
544 prd = GETRELDEP(pool, pid);
545 depname = id2str(pool, prd->name);
546 if (!strncmp(depname, "kernel-", strlen("kernel-")))
548 return depname + strlen("kernel-");
556 for (pidp = pd->repo->idarraydata + s->requires ; pidp && (pid = *pidp++) != 0; )
558 const char *depname = 0;
562 depname = id2str(pool, pid);
566 Reldep *prd = GETRELDEP(pool, pid);
567 depname = id2str(pool, prd->name);
569 if (!strncmp(depname, "kernel-", strlen("kernel-")))
571 return depname + strlen("kernel-");
583 * create Solvable from collected data
587 endElement(void *userData, const char *name)
589 Parsedata *pd = (Parsedata *)userData;
590 Pool *pool = pd->pool;
591 Solvable *s = pd->solvable;
595 if (pd->depth != pd->statedepth)
598 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
602 /* ignore deps element */
603 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
611 case STATE_PACKAGE: /* package complete */
612 if (!s->arch) /* default to "noarch" */
613 s->arch = ARCH_NOARCH;
615 if (!s->evr && pd->version) /* set solvable evr */
616 s->evr = evr2id(pool, pd,
617 pd->epoch ? pd->evrspace + pd->epoch : 0,
618 pd->version ? pd->evrspace + pd->version : 0,
619 pd->release ? pd->evrspace + pd->release : 0);
620 /* ensure self-provides */
621 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
622 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
623 s->supplements = repo_fix_legacy(pd->repo, s->provides, s->supplements);
625 const char *flavor = findKernelFlavor(pd, s);
628 char *cflavor = strdup(flavor); /* make pointer safe */
633 /* this is either a kernel package or a kmp */
636 Offset prov = s->provides;
638 while ((pid = pd->repo->idarraydata[prov++]) != 0)
640 const char *depname = 0;
645 prd = GETRELDEP(pool, pid);
646 depname = id2str(pool, prd->name);
650 depname = id2str(pool, pid);
654 if (!strncmp(depname, "kernel(", strlen("kernel(")) && !strchr(depname, ':'))
657 strcpy(newdep, "kernel(");
658 strncat(newdep, cflavor, sizeof(newdep) - 1);
659 strncat(newdep, ":", sizeof(newdep) - 1);
660 strncat(newdep, depname + strlen("kernel("), sizeof(newdep) - 1);
661 pid = str2id(pool, newdep, 1);
663 pid = rel2id(pool, pid, prd->evr, prd->flags, 1);
666 npr = repo_addid_dep(pd->repo, npr, pid, 0);
674 Offset reqs = s->requires;
676 while ((pid = pd->repo->idarraydata[reqs++]) != 0)
678 const char *depname = 0;
683 prd = GETRELDEP(pool, pid);
684 depname = id2str(pool, prd->name);
688 depname = id2str(pool, pid);
691 if (!strncmp(depname, "kernel(", strlen("kernel(")) && !strchr(depname, ':'))
694 strcpy(newdep, "kernel(");
695 strncat(newdep, cflavor, sizeof(newdep) - 1);
696 strncat(newdep, ":", sizeof(newdep) - 1);
697 strncat(newdep, depname + strlen("kernel("), sizeof(newdep) - 1);
698 pid = str2id(pool, newdep, 1);
700 pid = rel2id(pool, pid, prd->evr, prd->flags, 1);
702 npr = repo_addid_dep(pd->repo, npr, pid, 0);
711 s->name = str2id(pool, pd->content, 1);
714 s->vendor = str2id(pool, pd->content, 1);
716 case STATE_BUILDTIME:
717 t = atoi (pd->content);
719 repodata_set_num(pd->data, (s - pool->solvables) - pd->repo->start, SOLVABLE_BUILDTIME, t);
721 case STATE_UPDATE: /* new version, keeping all other metadata */
722 evr = evr2id(pool, pd,
723 pd->epoch ? pd->evrspace + pd->epoch : 0,
724 pd->version ? pd->evrspace + pd->version : 0,
725 pd->release ? pd->evrspace + pd->release : 0);
730 /* use highest evr */
731 if (!s->evr || evrcmp(pool, s->evr, evr, EVRCMP_MATCH_RELEASE) <= 0)
740 /* ensure buffer space */
741 if (pd->lcontent + 1 + pd->levrspace > pd->aevrspace)
743 pd->evrspace = (char *)realloc(pd->evrspace, pd->lcontent + 1 + pd->levrspace + 256);
744 pd->aevrspace = pd->lcontent + 1 + pd->levrspace + 256;
746 memcpy(pd->evrspace + pd->levrspace, pd->content, pd->lcontent + 1);
747 if (pd->state == STATE_EPOCH || pd->state == STATE_PEPOCH)
748 pd->epoch = pd->levrspace;
749 else if (pd->state == STATE_VERSION || pd->state == STATE_PVERSION)
750 pd->version = pd->levrspace;
752 pd->release = pd->levrspace;
753 pd->levrspace += pd->lcontent + 1;
757 s->arch = str2id(pool, pd->content, 1);
762 pd->state = pd->sbtab[pd->state];
764 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
775 characterData(void *userData, const XML_Char *s, int len)
777 Parsedata *pd = (Parsedata *)userData;
781 // check if current nodes content is interesting
785 // adapt content buffer
786 l = pd->lcontent + len + 1;
787 if (l > pd->acontent)
789 pd->content = (char *)realloc(pd->content, l + 256);
790 pd->acontent = l + 256;
792 // append new content to buffer
793 c = pd->content + pd->lcontent;
800 /*-------------------------------------------------------------------*/
802 #define BUFF_SIZE 8192
805 * read 'helix' type xml from fp
806 * add packages to pool/repo
811 repo_add_helix(Repo *repo, FILE *fp)
813 Pool *pool = repo->pool;
818 struct stateswitch *sw;
821 /* use last repodata */
822 data = repo->repodata + repo->nrepodata - 1;
824 data = repo_add_repodata(repo, 0);
826 /* prepare parsedata */
827 memset(&pd, 0, sizeof(pd));
828 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
830 if (!pd.swtab[sw->from])
831 pd.swtab[sw->from] = sw;
832 pd.sbtab[sw->to] = sw->from;
838 pd.content = (char *)malloc(256); /* must hold all solvable kinds! */
842 pd.evrspace = (char *)malloc(256);
849 XML_Parser parser = XML_ParserCreate(NULL);
850 XML_SetUserData(parser, &pd); /* make parserdata available to XML callbacks */
851 XML_SetElementHandler(parser, startElement, endElement);
852 XML_SetCharacterDataHandler(parser, characterData);
854 // read/parse XML file
857 l = fread(buf, 1, sizeof(buf), fp);
858 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
860 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
866 XML_ParserFree(parser);
869 repodata_internalize(pd.data);