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
149 Offset freshens; // current freshens vector
152 int epoch; // epoch (as offset into evrspace)
153 int version; // version (as offset into evrspace)
154 int release; // release (as offset into evrspace)
155 char *evrspace; // buffer for evr
156 int aevrspace; // actual buffer space
157 int levrspace; // actual evr length
160 struct stateswitch *swtab[NUMSTATES];
161 enum state sbtab[NUMSTATES];
165 /*------------------------------------------------------------------*/
168 // create Id from epoch:version-release
171 evr2id(Pool *pool, Parsedata *pd, const char *e, const char *v, const char *r)
176 // treat explitcit 0 as NULL
177 if (e && !strcmp(e, "0"))
183 // scan version for ":"
184 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++) // skip leading digits
186 // if version contains ":", set epoch to "0"
187 if (v2 > v && *v2 == ':')
191 // compute length of Id string
194 l += strlen(e) + 1; // e:
198 l += strlen(r) + 1; // -r
200 // extend content if not sufficient
201 if (l > pd->acontent)
203 pd->content = (char *)realloc(pd->content, l + 256);
204 pd->acontent = l + 256;
207 // copy e-v-r to content
227 // if nothing inserted, return Id 0
231 fprintf(stderr, "evr: %s\n", pd->content);
234 return str2id(pool, pd->content, 1);
238 // create e:v-r from attributes
239 // atts is array of name,value pairs, NULL at end
240 // even index into atts is name
241 // odd index is value
244 evr_atts2id(Pool *pool, Parsedata *pd, const char **atts)
246 const char *e, *v, *r;
248 for (; *atts; atts += 2)
250 if (!strcmp(*atts, "epoch"))
252 else if (!strcmp(*atts, "version"))
254 else if (!strcmp(*atts, "release"))
257 return evr2id(pool, pd, e, v, r);
260 /*------------------------------------------------------------------*/
261 /* rel operator handling */
268 static struct flagtab flagtab[] = {
271 { ">=", REL_GT|REL_EQ },
273 { "!=", REL_GT|REL_LT },
274 { "<=", REL_LT|REL_EQ },
275 { "(any)", REL_LT|REL_EQ|REL_GT },
279 { "ge", REL_GT|REL_EQ },
281 { "ne", REL_GT|REL_LT },
282 { "le", REL_LT|REL_EQ },
283 { "gte", REL_GT|REL_EQ },
284 { "lte", REL_LT|REL_EQ },
287 { "GE", REL_GT|REL_EQ },
289 { "NE", REL_GT|REL_LT },
290 { "LE", REL_LT|REL_EQ }
294 * process new dependency from parser
295 * olddeps = already collected deps, this defines the 'kind' of dep
296 * atts = array of name,value attributes of dep
297 * isreq == 1 if its a requires
301 adddep(Pool *pool, Parsedata *pd, unsigned int olddeps, const char **atts, int isreq)
304 const char *n, *f, *k;
308 marker = isreq ? -SOLVABLE_PREREQMARKER : 0;
310 /* loop over name,value pairs */
311 for (a = atts; *a; a += 2)
313 if (!strcmp(*a, "name"))
315 if (!strcmp(*a, "kind"))
317 else if (!strcmp(*a, "op"))
319 else if (isreq && !strcmp(*a, "pre") && a[1][0] == '1')
320 marker = SOLVABLE_PREREQMARKER;
322 if (!n) /* quit if no name found */
326 if (k && !strcmp(k, "package"))
327 k = NULL; /* package is default */
329 if (k) /* if kind!=package, intern <kind>:<name> */
331 int l = strlen(k) + 1 + strlen(n) + 1;
332 if (l > pd->acontent) /* extend buffer if needed */
334 pd->content = (char *)realloc(pd->content, l + 256);
335 pd->acontent = l + 256;
337 sprintf(pd->content, "%s:%s", k, n);
338 name = str2id(pool, pd->content, 1);
342 name = str2id(pool, n, 1); /* package: just intern <name> */
345 if (f) /* operator ? */
348 Id evr = evr_atts2id(pool, pd, atts);
349 /* parser operator to flags */
351 for (flags = 0; flags < sizeof(flagtab)/sizeof(*flagtab); flags++)
352 if (!strcmp(f, flagtab[flags].from))
354 flags = flagtab[flags].to;
360 id = rel2id(pool, name, evr, flags, 1);
363 id = name; /* no operator */
365 /* add new dependency to repo */
366 return repo_addid_dep(pd->repo, olddeps, id, marker);
370 /*----------------------------------------------------------------*/
379 startElement(void *userData, const char *name, const char **atts)
381 Parsedata *pd = (Parsedata *)userData;
382 struct stateswitch *sw;
383 Pool *pool = pd->pool;
384 Solvable *s = pd->solvable;
386 if (pd->depth != pd->statedepth)
392 /* ignore deps element */
393 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
398 /* find node name in stateswitch */
399 if (!pd->swtab[pd->state])
401 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
403 if (!strcmp(sw->ename, name))
407 /* check if we're at the right level */
408 if (sw->from != pd->state)
411 fprintf(stderr, "into unknown: %s\n", name);
419 pd->docontent = sw->docontent;
420 pd->statedepth = pd->depth;
422 // start with empty content
423 // (will collect data until end element
431 if (pd->kind) /* if kind is set (non package) */
433 strcpy(pd->content, pd->kind);
434 pd->lcontent = strlen(pd->content);
435 pd->content[pd->lcontent++] = ':'; /* prefix name with '<kind>:' */
436 pd->content[pd->lcontent] = 0;
440 case STATE_PACKAGE: /* solvable name */
441 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
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 */
460 fprintf(stderr, "package #%d\n", s - pool->solvables);
471 case STATE_PROVIDES: /* start of provides */
474 case STATE_PROVIDESENTRY: /* entry within provides */
475 s->provides = adddep(pool, pd, s->provides, atts, 0);
480 case STATE_REQUIRESENTRY:
481 s->requires = adddep(pool, pd, s->requires, atts, 1);
483 case STATE_OBSOLETES:
486 case STATE_OBSOLETESENTRY:
487 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
489 case STATE_CONFLICTS:
492 case STATE_CONFLICTSENTRY:
493 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
495 case STATE_RECOMMENDS:
498 case STATE_RECOMMENDSENTRY:
499 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
501 case STATE_SUPPLEMENTS:
504 case STATE_SUPPLEMENTSENTRY:
505 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
510 case STATE_SUGGESTSENTRY:
511 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
516 case STATE_ENHANCESENTRY:
517 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
522 case STATE_FRESHENSENTRY:
523 pd->freshens = adddep(pool, pd, pd->freshens, atts, 0);
530 static const char* findKernelFlavor(Parsedata *pd, Solvable *s)
532 Pool *pool = pd->pool;
538 for (pidp = pd->repo->idarraydata + s->provides; pidp && (pid = *pidp++) != 0; )
544 continue; /* wrong provides name */
545 prd = GETRELDEP(pool, pid);
546 depname = id2str(pool, prd->name);
547 if (!strncmp(depname, "kernel-", strlen("kernel-")))
549 return depname + strlen("kernel-");
557 for (pidp = pd->repo->idarraydata + s->requires ; pidp && (pid = *pidp++) != 0; )
559 const char *depname = 0;
563 depname = id2str(pool, pid);
567 Reldep *prd = GETRELDEP(pool, pid);
568 depname = id2str(pool, prd->name);
570 if (!strncmp(depname, "kernel-", strlen("kernel-")))
572 return depname + strlen("kernel-");
584 * create Solvable from collected data
588 endElement(void *userData, const char *name)
590 Parsedata *pd = (Parsedata *)userData;
591 Pool *pool = pd->pool;
592 Solvable *s = pd->solvable;
596 if (pd->depth != pd->statedepth)
599 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
603 /* ignore deps element */
604 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
612 case STATE_PACKAGE: /* package complete */
613 if (!s->arch) /* default to "noarch" */
614 s->arch = ARCH_NOARCH;
616 if (!s->evr && pd->version) /* set solvable evr */
617 s->evr = evr2id(pool, pd,
618 pd->epoch ? pd->evrspace + pd->epoch : 0,
619 pd->version ? pd->evrspace + pd->version : 0,
620 pd->release ? pd->evrspace + pd->release : 0);
621 /* ensure self-provides */
622 if (s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
623 s->provides = repo_addid_dep(pd->repo, s->provides, rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
624 s->supplements = repo_fix_supplements(pd->repo, s->provides, s->supplements, pd->freshens);
625 s->conflicts = repo_fix_conflicts(pd->repo, s->conflicts);
628 /* see bugzilla bnc#190163 */
629 const char *flavor = findKernelFlavor(pd, s);
632 char *cflavor = strdup(flavor); /* make pointer safe */
637 /* this is either a kernel package or a kmp */
640 Offset prov = s->provides;
642 while ((pid = pd->repo->idarraydata[prov++]) != 0)
644 const char *depname = 0;
649 prd = GETRELDEP(pool, pid);
650 depname = id2str(pool, prd->name);
654 depname = id2str(pool, pid);
658 if (!strncmp(depname, "kernel(", strlen("kernel(")) && !strchr(depname, ':'))
661 strcpy(newdep, "kernel(");
662 strncat(newdep, cflavor, sizeof(newdep) - 1);
663 strncat(newdep, ":", sizeof(newdep) - 1);
664 strncat(newdep, depname + strlen("kernel("), sizeof(newdep) - 1);
665 pid = str2id(pool, newdep, 1);
667 pid = rel2id(pool, pid, prd->evr, prd->flags, 1);
670 npr = repo_addid_dep(pd->repo, npr, pid, 0);
678 Offset reqs = s->requires;
680 while ((pid = pd->repo->idarraydata[reqs++]) != 0)
682 const char *depname = 0;
687 prd = GETRELDEP(pool, pid);
688 depname = id2str(pool, prd->name);
692 depname = id2str(pool, pid);
695 if (!strncmp(depname, "kernel(", strlen("kernel(")) && !strchr(depname, ':'))
698 strcpy(newdep, "kernel(");
699 strncat(newdep, cflavor, sizeof(newdep) - 1);
700 strncat(newdep, ":", sizeof(newdep) - 1);
701 strncat(newdep, depname + strlen("kernel("), sizeof(newdep) - 1);
702 pid = str2id(pool, newdep, 1);
704 pid = rel2id(pool, pid, prd->evr, prd->flags, 1);
706 npr = repo_addid_dep(pd->repo, npr, pid, 0);
715 s->name = str2id(pool, pd->content, 1);
718 s->vendor = str2id(pool, pd->content, 1);
720 case STATE_BUILDTIME:
721 t = atoi (pd->content);
723 repodata_set_num(pd->data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
725 case STATE_UPDATE: /* new version, keeping all other metadata */
726 evr = evr2id(pool, pd,
727 pd->epoch ? pd->evrspace + pd->epoch : 0,
728 pd->version ? pd->evrspace + pd->version : 0,
729 pd->release ? pd->evrspace + pd->release : 0);
734 /* use highest evr */
735 if (!s->evr || evrcmp(pool, s->evr, evr, EVRCMP_MATCH_RELEASE) <= 0)
744 /* ensure buffer space */
745 if (pd->lcontent + 1 + pd->levrspace > pd->aevrspace)
747 pd->evrspace = (char *)realloc(pd->evrspace, pd->lcontent + 1 + pd->levrspace + 256);
748 pd->aevrspace = pd->lcontent + 1 + pd->levrspace + 256;
750 memcpy(pd->evrspace + pd->levrspace, pd->content, pd->lcontent + 1);
751 if (pd->state == STATE_EPOCH || pd->state == STATE_PEPOCH)
752 pd->epoch = pd->levrspace;
753 else if (pd->state == STATE_VERSION || pd->state == STATE_PVERSION)
754 pd->version = pd->levrspace;
756 pd->release = pd->levrspace;
757 pd->levrspace += pd->lcontent + 1;
761 s->arch = str2id(pool, pd->content, 1);
766 pd->state = pd->sbtab[pd->state];
768 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
779 characterData(void *userData, const XML_Char *s, int len)
781 Parsedata *pd = (Parsedata *)userData;
785 // check if current nodes content is interesting
789 // adapt content buffer
790 l = pd->lcontent + len + 1;
791 if (l > pd->acontent)
793 pd->content = (char *)realloc(pd->content, l + 256);
794 pd->acontent = l + 256;
796 // append new content to buffer
797 c = pd->content + pd->lcontent;
804 /*-------------------------------------------------------------------*/
806 #define BUFF_SIZE 8192
809 * read 'helix' type xml from fp
810 * add packages to pool/repo
815 repo_add_helix(Repo *repo, FILE *fp, int flags)
817 Pool *pool = repo->pool;
822 struct stateswitch *sw;
824 if (!(flags & REPO_REUSE_REPODATA))
825 data = repo_add_repodata(repo, 0);
827 data = repo_last_repodata(repo);
829 /* prepare parsedata */
830 memset(&pd, 0, sizeof(pd));
831 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
833 if (!pd.swtab[sw->from])
834 pd.swtab[sw->from] = sw;
835 pd.sbtab[sw->to] = sw->from;
841 pd.content = (char *)malloc(256); /* must hold all solvable kinds! */
845 pd.evrspace = (char *)malloc(256);
852 XML_Parser parser = XML_ParserCreate(NULL);
853 XML_SetUserData(parser, &pd); /* make parserdata available to XML callbacks */
854 XML_SetElementHandler(parser, startElement, endElement);
855 XML_SetCharacterDataHandler(parser, characterData);
857 // read/parse XML file
860 l = fread(buf, 1, sizeof(buf), fp);
861 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
863 fprintf(stderr, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
869 XML_ParserFree(parser);
873 if (!(flags & REPO_NO_INTERNALIZE))
874 repodata_internalize(data);