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
14 * A bit of history: "Helix Code" was the name of the company that
15 * wrote Red Carpet. The company was later renamed to Ximian.
16 * The Red Carpet solver was merged into the ZYPP project, the
17 * library used both by ZENworks and YaST for package management.
18 * Red Carpet came with solver testcases in its own repository
19 * format, the 'helix' format.
23 #include <sys/types.h>
31 #include "repo_helix.h"
35 /* XML parser states */
56 STATE_PREREQUIRESENTRY,
62 STATE_RECOMMENDSENTRY,
64 STATE_SUPPLEMENTSENTRY,
93 static struct stateswitch stateswitches[] = {
94 { STATE_START, "channel", STATE_CHANNEL, 0 },
95 { STATE_CHANNEL, "subchannel", STATE_SUBCHANNEL, 0 },
96 { STATE_SUBCHANNEL, "package", STATE_PACKAGE, 0 },
97 { STATE_SUBCHANNEL, "srcpackage", STATE_PACKAGE, 0 },
98 { STATE_SUBCHANNEL, "selection", STATE_PACKAGE, 0 },
99 { STATE_SUBCHANNEL, "pattern", STATE_PACKAGE, 0 },
100 { STATE_SUBCHANNEL, "atom", STATE_PACKAGE, 0 },
101 { STATE_SUBCHANNEL, "patch", STATE_PACKAGE, 0 },
102 { STATE_SUBCHANNEL, "product", STATE_PACKAGE, 0 },
103 { STATE_SUBCHANNEL, "application", STATE_PACKAGE, 0 },
104 { STATE_PACKAGE, "name", STATE_NAME, 1 },
105 { STATE_PACKAGE, "vendor", STATE_VENDOR, 1 },
106 { STATE_PACKAGE, "buildtime", STATE_BUILDTIME, 1 },
107 { STATE_PACKAGE, "epoch", STATE_PEPOCH, 1 },
108 { STATE_PACKAGE, "version", STATE_PVERSION, 1 },
109 { STATE_PACKAGE, "release", STATE_PRELEASE, 1 },
110 { STATE_PACKAGE, "arch", STATE_PARCH, 1 },
111 { STATE_PACKAGE, "history", STATE_HISTORY, 0 },
112 { STATE_PACKAGE, "provides", STATE_PROVIDES, 0 },
113 { STATE_PACKAGE, "requires", STATE_REQUIRES, 0 },
114 { STATE_PACKAGE, "prerequires", STATE_PREREQUIRES, 0 },
115 { STATE_PACKAGE, "obsoletes", STATE_OBSOLETES , 0 },
116 { STATE_PACKAGE, "conflicts", STATE_CONFLICTS , 0 },
117 { STATE_PACKAGE, "recommends" , STATE_RECOMMENDS , 0 },
118 { STATE_PACKAGE, "supplements", STATE_SUPPLEMENTS, 0 },
119 { STATE_PACKAGE, "suggests", STATE_SUGGESTS, 0 },
120 { STATE_PACKAGE, "enhances", STATE_ENHANCES, 0 },
121 { STATE_PACKAGE, "freshens", STATE_FRESHENS, 0 },
123 { STATE_HISTORY, "update", STATE_UPDATE, 0 },
124 { STATE_UPDATE, "epoch", STATE_EPOCH, 1 },
125 { STATE_UPDATE, "version", STATE_VERSION, 1 },
126 { STATE_UPDATE, "release", STATE_RELEASE, 1 },
127 { STATE_UPDATE, "arch", STATE_ARCH, 1 },
129 { STATE_PROVIDES, "dep", STATE_PROVIDESENTRY, 0 },
130 { STATE_REQUIRES, "dep", STATE_REQUIRESENTRY, 0 },
131 { STATE_PREREQUIRES, "dep", STATE_PREREQUIRESENTRY, 0 },
132 { STATE_OBSOLETES, "dep", STATE_OBSOLETESENTRY, 0 },
133 { STATE_CONFLICTS, "dep", STATE_CONFLICTSENTRY, 0 },
134 { STATE_RECOMMENDS, "dep", STATE_RECOMMENDSENTRY, 0 },
135 { STATE_SUPPLEMENTS, "dep", STATE_SUPPLEMENTSENTRY, 0 },
136 { STATE_SUGGESTS, "dep", STATE_SUGGESTSENTRY, 0 },
137 { STATE_ENHANCES, "dep", STATE_ENHANCESENTRY, 0 },
138 { STATE_FRESHENS, "dep", STATE_FRESHENSENTRY, 0 },
147 typedef struct _parsedata {
149 /* XML parser data */
151 enum state state; /* current state */
153 char *content; /* buffer for content of node */
154 int lcontent; /* actual length of current content */
155 int acontent; /* actual buffer size */
156 int docontent; /* handle content */
159 Pool *pool; /* current pool */
160 Repo *repo; /* current repo */
161 Repodata *data; /* current repo data */
162 Solvable *solvable; /* current solvable */
163 Offset freshens; /* current freshens vector */
166 int epoch; /* epoch (as offset into evrspace) */
167 int version; /* version (as offset into evrspace) */
168 int release; /* release (as offset into evrspace) */
169 char *evrspace; /* buffer for evr */
170 int aevrspace; /* actual buffer space */
171 int levrspace; /* actual evr length */
174 struct stateswitch *swtab[NUMSTATES];
175 enum state sbtab[NUMSTATES];
179 /*------------------------------------------------------------------*/
182 /* create Id from epoch:version-release */
185 evr2id(Pool *pool, Parsedata *pd, const char *e, const char *v, const char *r)
190 /* treat explitcit 0 as NULL */
191 if (e && (!*e || !strcmp(e, "0")))
197 /* scan version for ":" */
198 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++) /* skip leading digits */
200 /* if version contains ":", set epoch to "0" */
201 if (v2 > v && *v2 == ':')
205 /* compute length of Id string */
206 l = 1; /* for the \0 */
208 l += strlen(e) + 1; /* e: */
210 l += strlen(v); /* v */
212 l += strlen(r) + 1; /* -r */
214 /* extend content if not sufficient */
215 if (l > pd->acontent)
217 pd->content = (char *)realloc(pd->content, l + 256);
218 pd->acontent = l + 256;
221 /* copy e-v-r to content */
241 /* if nothing inserted, return Id 0 */
245 fprintf(stderr, "evr: %s\n", pd->content);
247 /* intern and create */
248 return pool_str2id(pool, pd->content, 1);
252 /* create e:v-r from attributes
253 * atts is array of name,value pairs, NULL at end
254 * even index into atts is name
258 evr_atts2id(Pool *pool, Parsedata *pd, const char **atts)
260 const char *e, *v, *r;
262 for (; *atts; atts += 2)
264 if (!strcmp(*atts, "epoch"))
266 else if (!strcmp(*atts, "version"))
268 else if (!strcmp(*atts, "release"))
271 return evr2id(pool, pd, e, v, r);
274 /*------------------------------------------------------------------*/
275 /* rel operator handling */
282 static struct flagtab flagtab[] = {
285 { ">=", REL_GT|REL_EQ },
287 { "!=", REL_GT|REL_LT },
288 { "<=", REL_LT|REL_EQ },
289 { "(any)", REL_LT|REL_EQ|REL_GT },
293 { "ge", REL_GT|REL_EQ },
295 { "ne", REL_GT|REL_LT },
296 { "le", REL_LT|REL_EQ },
297 { "gte", REL_GT|REL_EQ },
298 { "lte", REL_LT|REL_EQ },
301 { "GE", REL_GT|REL_EQ },
303 { "NE", REL_GT|REL_LT },
304 { "LE", REL_LT|REL_EQ }
308 * process new dependency from parser
309 * olddeps = already collected deps, this defines the 'kind' of dep
310 * atts = array of name,value attributes of dep
311 * isreq == 1 if its a requires
315 adddep(Pool *pool, Parsedata *pd, unsigned int olddeps, const char **atts, Id marker)
318 const char *n, *f, *k;
323 /* loop over name,value pairs */
324 for (a = atts; *a; a += 2)
326 if (!strcmp(*a, "name"))
328 if (!strcmp(*a, "kind"))
330 else if (!strcmp(*a, "op"))
332 else if (marker && !strcmp(*a, "pre") && a[1][0] == '1')
333 marker = SOLVABLE_PREREQMARKER;
335 if (!n) /* quit if no name found */
339 if (k && !strcmp(k, "package"))
340 k = NULL; /* package is default */
342 if (k) /* if kind!=package, intern <kind>:<name> */
344 int l = strlen(k) + 1 + strlen(n) + 1;
345 if (l > pd->acontent) /* extend buffer if needed */
347 pd->content = (char *)realloc(pd->content, l + 256);
348 pd->acontent = l + 256;
350 sprintf(pd->content, "%s:%s", k, n);
351 name = pool_str2id(pool, pd->content, 1);
355 name = pool_str2id(pool, n, 1); /* package: just intern <name> */
358 if (f) /* operator ? */
361 Id evr = evr_atts2id(pool, pd, atts);
362 /* parser operator to flags */
364 for (flags = 0; flags < sizeof(flagtab)/sizeof(*flagtab); flags++)
365 if (!strcmp(f, flagtab[flags].from))
367 flags = flagtab[flags].to;
373 id = pool_rel2id(pool, name, evr, flags, 1);
376 id = name; /* no operator */
378 /* add new dependency to repo */
379 return repo_addid_dep(pd->repo, olddeps, id, marker);
383 /*----------------------------------------------------------------*/
392 startElement(void *userData, const char *name, const char **atts)
394 Parsedata *pd = (Parsedata *)userData;
395 struct stateswitch *sw;
396 Pool *pool = pd->pool;
397 Solvable *s = pd->solvable;
399 if (pd->depth != pd->statedepth)
405 /* ignore deps element */
406 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
411 /* find node name in stateswitch */
412 if (!pd->swtab[pd->state])
414 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
416 if (!strcmp(sw->ename, name))
420 /* check if we're at the right level */
421 if (sw->from != pd->state)
424 fprintf(stderr, "into unknown: %s\n", name);
432 pd->docontent = sw->docontent;
433 pd->statedepth = pd->depth;
435 /* start with empty content */
436 /* (will collect data until end element) */
444 if (pd->kind) /* if kind is set (non package) */
446 strcpy(pd->content, pd->kind);
447 pd->lcontent = strlen(pd->content);
448 pd->content[pd->lcontent++] = ':'; /* prefix name with '<kind>:' */
449 pd->content[pd->lcontent] = 0;
453 case STATE_PACKAGE: /* solvable name */
454 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
455 if (!strcmp(name, "selection"))
456 pd->kind = "selection";
457 else if (!strcmp(name, "pattern"))
458 pd->kind = "pattern";
459 else if (!strcmp(name, "atom"))
461 else if (!strcmp(name, "product"))
462 pd->kind = "product";
463 else if (!strcmp(name, "patch"))
465 else if (!strcmp(name, "application"))
466 pd->kind = "application";
468 pd->kind = NULL; /* default is package */
475 fprintf(stderr, "package #%d\n", s - pool->solvables);
486 case STATE_PROVIDES: /* start of provides */
489 case STATE_PROVIDESENTRY: /* entry within provides */
490 s->provides = adddep(pool, pd, s->provides, atts, 0);
492 case STATE_REQUIRESENTRY:
493 s->requires = adddep(pool, pd, s->requires, atts, -SOLVABLE_PREREQMARKER);
495 case STATE_PREREQUIRESENTRY:
496 s->requires = adddep(pool, pd, s->requires, atts, SOLVABLE_PREREQMARKER);
498 case STATE_OBSOLETES:
501 case STATE_OBSOLETESENTRY:
502 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
504 case STATE_CONFLICTS:
507 case STATE_CONFLICTSENTRY:
508 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
510 case STATE_RECOMMENDS:
513 case STATE_RECOMMENDSENTRY:
514 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
516 case STATE_SUPPLEMENTS:
519 case STATE_SUPPLEMENTSENTRY:
520 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
525 case STATE_SUGGESTSENTRY:
526 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
531 case STATE_ENHANCESENTRY:
532 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
537 case STATE_FRESHENSENTRY:
538 pd->freshens = adddep(pool, pd, pd->freshens, atts, 0);
545 static const char *findKernelFlavor(Parsedata *pd, Solvable *s)
547 Pool *pool = pd->pool;
552 pidp = pd->repo->idarraydata + s->provides;
553 while ((pid = *pidp++) != 0)
559 continue; /* wrong provides name */
560 prd = GETRELDEP(pool, pid);
561 depname = pool_id2str(pool, prd->name);
562 if (!strncmp(depname, "kernel-", 7))
569 pidp = pd->repo->idarraydata + s->requires;
570 while ((pid = *pidp++) != 0)
576 depname = pool_id2str(pool, pid);
580 Reldep *prd = GETRELDEP(pool, pid);
581 depname = pool_id2str(pool, prd->name);
583 if (!strncmp(depname, "kernel-", 7))
596 * create Solvable from collected data
600 endElement(void *userData, const char *name)
602 Parsedata *pd = (Parsedata *)userData;
603 Pool *pool = pd->pool;
604 Solvable *s = pd->solvable;
609 if (pd->depth != pd->statedepth)
612 /* printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth); */
616 /* ignore deps element */
617 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
625 case STATE_PACKAGE: /* package complete */
626 if (name[0] == 's' && name[1] == 'r' && name[2] == 'c' && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
628 if (!s->arch) /* default to "noarch" */
629 s->arch = ARCH_NOARCH;
631 if (!s->evr && pd->version) /* set solvable evr */
632 s->evr = evr2id(pool, pd,
633 pd->epoch ? pd->evrspace + pd->epoch : 0,
634 pd->version ? pd->evrspace + pd->version : 0,
635 pd->release ? pd->evrspace + pd->release : 0);
636 /* ensure self-provides */
637 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
638 s->provides = repo_addid_dep(pd->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
639 s->supplements = repo_fix_supplements(pd->repo, s->provides, s->supplements, pd->freshens);
640 s->conflicts = repo_fix_conflicts(pd->repo, s->conflicts);
643 /* see bugzilla bnc#190163 */
644 flavor = findKernelFlavor(pd, s);
647 char *cflavor = solv_strdup(flavor); /* make pointer safe */
652 /* this is either a kernel package or a kmp */
655 Offset prov = s->provides;
657 while ((pid = pd->repo->idarraydata[prov++]) != 0)
659 const char *depname = 0;
664 prd = GETRELDEP(pool, pid);
665 depname = pool_id2str(pool, prd->name);
669 depname = pool_id2str(pool, pid);
673 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
676 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
677 pid = pool_str2id(pool, newdep, 1);
679 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
682 npr = repo_addid_dep(pd->repo, npr, pid, 0);
690 Offset reqs = s->requires;
692 while ((pid = pd->repo->idarraydata[reqs++]) != 0)
694 const char *depname = 0;
699 prd = GETRELDEP(pool, pid);
700 depname = pool_id2str(pool, prd->name);
704 depname = pool_id2str(pool, pid);
707 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
710 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
711 pid = pool_str2id(pool, newdep, 1);
713 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
715 npr = repo_addid_dep(pd->repo, npr, pid, 0);
724 s->name = pool_str2id(pool, pd->content, 1);
727 s->vendor = pool_str2id(pool, pd->content, 1);
729 case STATE_BUILDTIME:
730 t = atoi (pd->content);
732 repodata_set_num(pd->data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
734 case STATE_UPDATE: /* new version, keeping all other metadata */
735 evr = evr2id(pool, pd,
736 pd->epoch ? pd->evrspace + pd->epoch : 0,
737 pd->version ? pd->evrspace + pd->version : 0,
738 pd->release ? pd->evrspace + pd->release : 0);
743 /* use highest evr */
744 if (!s->evr || pool_evrcmp(pool, s->evr, evr, EVRCMP_COMPARE) <= 0)
753 /* ensure buffer space */
754 if (pd->lcontent + 1 + pd->levrspace > pd->aevrspace)
756 pd->evrspace = (char *)realloc(pd->evrspace, pd->lcontent + 1 + pd->levrspace + 256);
757 pd->aevrspace = pd->lcontent + 1 + pd->levrspace + 256;
759 memcpy(pd->evrspace + pd->levrspace, pd->content, pd->lcontent + 1);
760 if (pd->state == STATE_EPOCH || pd->state == STATE_PEPOCH)
761 pd->epoch = pd->levrspace;
762 else if (pd->state == STATE_VERSION || pd->state == STATE_PVERSION)
763 pd->version = pd->levrspace;
765 pd->release = pd->levrspace;
766 pd->levrspace += pd->lcontent + 1;
770 s->arch = pool_str2id(pool, pd->content, 1);
775 pd->state = pd->sbtab[pd->state];
777 /* printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth); */
788 characterData(void *userData, const XML_Char *s, int len)
790 Parsedata *pd = (Parsedata *)userData;
794 /* check if current nodes content is interesting */
798 /* adapt content buffer */
799 l = pd->lcontent + len + 1;
800 if (l > pd->acontent)
802 pd->content = (char *)realloc(pd->content, l + 256);
803 pd->acontent = l + 256;
805 /* append new content to buffer */
806 c = pd->content + pd->lcontent;
813 /*-------------------------------------------------------------------*/
815 #define BUFF_SIZE 8192
818 * read 'helix' type xml from fp
819 * add packages to pool/repo
824 repo_add_helix(Repo *repo, FILE *fp, int flags)
826 Pool *pool = repo->pool;
831 struct stateswitch *sw;
835 now = solv_timems(0);
836 data = repo_add_repodata(repo, flags);
838 /* prepare parsedata */
839 memset(&pd, 0, sizeof(pd));
840 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
842 if (!pd.swtab[sw->from])
843 pd.swtab[sw->from] = sw;
844 pd.sbtab[sw->to] = sw->from;
850 pd.content = (char *)malloc(256); /* must hold all solvable kinds! */
854 pd.evrspace = (char *)malloc(256);
859 /* set up XML parser */
861 parser = XML_ParserCreate(NULL);
862 XML_SetUserData(parser, &pd); /* make parserdata available to XML callbacks */
863 XML_SetElementHandler(parser, startElement, endElement);
864 XML_SetCharacterDataHandler(parser, characterData);
866 /* read/parse XML file */
869 l = fread(buf, 1, sizeof(buf), fp);
870 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
872 pd.ret = pool_error(pool, -1, "%s at line %u", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
878 XML_ParserFree(parser);
882 if (!(flags & REPO_NO_INTERNALIZE))
883 repodata_internalize(data);
884 POOL_DEBUG(SOLV_DEBUG_STATS, "repo_add_helix took %d ms\n", solv_timems(now));
885 POOL_DEBUG(SOLV_DEBUG_STATS, "repo size: %d solvables\n", repo->nsolvables);
886 POOL_DEBUG(SOLV_DEBUG_STATS, "repo memory used: %d K incore, %d K idarray\n", repodata_memused(data)/1024, repo->idarraysize / (int)(1024/sizeof(Id)));