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 it's 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, "selection", STATE_PACKAGE, 0 },
98 { STATE_SUBCHANNEL, "pattern", STATE_PACKAGE, 0 },
99 { STATE_SUBCHANNEL, "atom", STATE_PACKAGE, 0 },
100 { STATE_SUBCHANNEL, "patch", STATE_PACKAGE, 0 },
101 { STATE_SUBCHANNEL, "product", STATE_PACKAGE, 0 },
102 { STATE_PACKAGE, "name", STATE_NAME, 1 },
103 { STATE_PACKAGE, "vendor", STATE_VENDOR, 1 },
104 { STATE_PACKAGE, "buildtime", STATE_BUILDTIME, 1 },
105 { STATE_PACKAGE, "epoch", STATE_PEPOCH, 1 },
106 { STATE_PACKAGE, "version", STATE_PVERSION, 1 },
107 { STATE_PACKAGE, "release", STATE_PRELEASE, 1 },
108 { STATE_PACKAGE, "arch", STATE_PARCH, 1 },
109 { STATE_PACKAGE, "history", STATE_HISTORY, 0 },
110 { STATE_PACKAGE, "provides", STATE_PROVIDES, 0 },
111 { STATE_PACKAGE, "requires", STATE_REQUIRES, 0 },
112 { STATE_PACKAGE, "prerequires", STATE_PREREQUIRES, 0 },
113 { STATE_PACKAGE, "obsoletes", STATE_OBSOLETES , 0 },
114 { STATE_PACKAGE, "conflicts", STATE_CONFLICTS , 0 },
115 { STATE_PACKAGE, "recommends" , STATE_RECOMMENDS , 0 },
116 { STATE_PACKAGE, "supplements", STATE_SUPPLEMENTS, 0 },
117 { STATE_PACKAGE, "suggests", STATE_SUGGESTS, 0 },
118 { STATE_PACKAGE, "enhances", STATE_ENHANCES, 0 },
119 { STATE_PACKAGE, "freshens", STATE_FRESHENS, 0 },
121 { STATE_HISTORY, "update", STATE_UPDATE, 0 },
122 { STATE_UPDATE, "epoch", STATE_EPOCH, 1 },
123 { STATE_UPDATE, "version", STATE_VERSION, 1 },
124 { STATE_UPDATE, "release", STATE_RELEASE, 1 },
125 { STATE_UPDATE, "arch", STATE_ARCH, 1 },
127 { STATE_PROVIDES, "dep", STATE_PROVIDESENTRY, 0 },
128 { STATE_REQUIRES, "dep", STATE_REQUIRESENTRY, 0 },
129 { STATE_PREREQUIRES, "dep", STATE_PREREQUIRESENTRY, 0 },
130 { STATE_OBSOLETES, "dep", STATE_OBSOLETESENTRY, 0 },
131 { STATE_CONFLICTS, "dep", STATE_CONFLICTSENTRY, 0 },
132 { STATE_RECOMMENDS, "dep", STATE_RECOMMENDSENTRY, 0 },
133 { STATE_SUPPLEMENTS, "dep", STATE_SUPPLEMENTSENTRY, 0 },
134 { STATE_SUGGESTS, "dep", STATE_SUGGESTSENTRY, 0 },
135 { STATE_ENHANCES, "dep", STATE_ENHANCESENTRY, 0 },
136 { STATE_FRESHENS, "dep", STATE_FRESHENSENTRY, 0 },
145 typedef struct _parsedata {
148 enum state state; // current state
150 char *content; // buffer for content of node
151 int lcontent; // actual length of current content
152 int acontent; // actual buffer size
153 int docontent; // handle content
156 Pool *pool; // current pool
157 Repo *repo; // current repo
158 Repodata *data; // current repo data
159 Solvable *solvable; // current solvable
160 Offset freshens; // current freshens vector
163 int epoch; // epoch (as offset into evrspace)
164 int version; // version (as offset into evrspace)
165 int release; // release (as offset into evrspace)
166 char *evrspace; // buffer for evr
167 int aevrspace; // actual buffer space
168 int levrspace; // actual evr length
171 struct stateswitch *swtab[NUMSTATES];
172 enum state sbtab[NUMSTATES];
176 /*------------------------------------------------------------------*/
179 // create Id from epoch:version-release
182 evr2id(Pool *pool, Parsedata *pd, const char *e, const char *v, const char *r)
187 // treat explitcit 0 as NULL
188 if (e && !strcmp(e, "0"))
194 // scan version for ":"
195 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++) // skip leading digits
197 // if version contains ":", set epoch to "0"
198 if (v2 > v && *v2 == ':')
202 // compute length of Id string
205 l += strlen(e) + 1; // e:
209 l += strlen(r) + 1; // -r
211 // extend content if not sufficient
212 if (l > pd->acontent)
214 pd->content = (char *)realloc(pd->content, l + 256);
215 pd->acontent = l + 256;
218 // copy e-v-r to content
238 // if nothing inserted, return Id 0
242 fprintf(stderr, "evr: %s\n", pd->content);
245 return pool_str2id(pool, pd->content, 1);
249 // create e:v-r from attributes
250 // atts is array of name,value pairs, NULL at end
251 // even index into atts is name
252 // odd index is value
255 evr_atts2id(Pool *pool, Parsedata *pd, const char **atts)
257 const char *e, *v, *r;
259 for (; *atts; atts += 2)
261 if (!strcmp(*atts, "epoch"))
263 else if (!strcmp(*atts, "version"))
265 else if (!strcmp(*atts, "release"))
268 return evr2id(pool, pd, e, v, r);
271 /*------------------------------------------------------------------*/
272 /* rel operator handling */
279 static struct flagtab flagtab[] = {
282 { ">=", REL_GT|REL_EQ },
284 { "!=", REL_GT|REL_LT },
285 { "<=", REL_LT|REL_EQ },
286 { "(any)", REL_LT|REL_EQ|REL_GT },
290 { "ge", REL_GT|REL_EQ },
292 { "ne", REL_GT|REL_LT },
293 { "le", REL_LT|REL_EQ },
294 { "gte", REL_GT|REL_EQ },
295 { "lte", REL_LT|REL_EQ },
298 { "GE", REL_GT|REL_EQ },
300 { "NE", REL_GT|REL_LT },
301 { "LE", REL_LT|REL_EQ }
305 * process new dependency from parser
306 * olddeps = already collected deps, this defines the 'kind' of dep
307 * atts = array of name,value attributes of dep
308 * isreq == 1 if its a requires
312 adddep(Pool *pool, Parsedata *pd, unsigned int olddeps, const char **atts, Id marker)
315 const char *n, *f, *k;
320 /* loop over name,value pairs */
321 for (a = atts; *a; a += 2)
323 if (!strcmp(*a, "name"))
325 if (!strcmp(*a, "kind"))
327 else if (!strcmp(*a, "op"))
329 else if (marker && !strcmp(*a, "pre") && a[1][0] == '1')
330 marker = SOLVABLE_PREREQMARKER;
332 if (!n) /* quit if no name found */
336 if (k && !strcmp(k, "package"))
337 k = NULL; /* package is default */
339 if (k) /* if kind!=package, intern <kind>:<name> */
341 int l = strlen(k) + 1 + strlen(n) + 1;
342 if (l > pd->acontent) /* extend buffer if needed */
344 pd->content = (char *)realloc(pd->content, l + 256);
345 pd->acontent = l + 256;
347 sprintf(pd->content, "%s:%s", k, n);
348 name = pool_str2id(pool, pd->content, 1);
352 name = pool_str2id(pool, n, 1); /* package: just intern <name> */
355 if (f) /* operator ? */
358 Id evr = evr_atts2id(pool, pd, atts);
359 /* parser operator to flags */
361 for (flags = 0; flags < sizeof(flagtab)/sizeof(*flagtab); flags++)
362 if (!strcmp(f, flagtab[flags].from))
364 flags = flagtab[flags].to;
370 id = pool_rel2id(pool, name, evr, flags, 1);
373 id = name; /* no operator */
375 /* add new dependency to repo */
376 return repo_addid_dep(pd->repo, olddeps, id, marker);
380 /*----------------------------------------------------------------*/
389 startElement(void *userData, const char *name, const char **atts)
391 Parsedata *pd = (Parsedata *)userData;
392 struct stateswitch *sw;
393 Pool *pool = pd->pool;
394 Solvable *s = pd->solvable;
396 if (pd->depth != pd->statedepth)
402 /* ignore deps element */
403 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
408 /* find node name in stateswitch */
409 if (!pd->swtab[pd->state])
411 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
413 if (!strcmp(sw->ename, name))
417 /* check if we're at the right level */
418 if (sw->from != pd->state)
421 fprintf(stderr, "into unknown: %s\n", name);
429 pd->docontent = sw->docontent;
430 pd->statedepth = pd->depth;
432 // start with empty content
433 // (will collect data until end element
441 if (pd->kind) /* if kind is set (non package) */
443 strcpy(pd->content, pd->kind);
444 pd->lcontent = strlen(pd->content);
445 pd->content[pd->lcontent++] = ':'; /* prefix name with '<kind>:' */
446 pd->content[pd->lcontent] = 0;
450 case STATE_PACKAGE: /* solvable name */
451 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
452 if (!strcmp(name, "selection"))
453 pd->kind = "selection";
454 else if (!strcmp(name, "pattern"))
455 pd->kind = "pattern";
456 else if (!strcmp(name, "atom"))
458 else if (!strcmp(name, "product"))
459 pd->kind = "product";
460 else if (!strcmp(name, "patch"))
463 pd->kind = NULL; /* default is package */
470 fprintf(stderr, "package #%d\n", s - pool->solvables);
481 case STATE_PROVIDES: /* start of provides */
484 case STATE_PROVIDESENTRY: /* entry within provides */
485 s->provides = adddep(pool, pd, s->provides, atts, 0);
487 case STATE_REQUIRESENTRY:
488 s->requires = adddep(pool, pd, s->requires, atts, -SOLVABLE_PREREQMARKER);
490 case STATE_PREREQUIRESENTRY:
491 s->requires = adddep(pool, pd, s->requires, atts, SOLVABLE_PREREQMARKER);
493 case STATE_OBSOLETES:
496 case STATE_OBSOLETESENTRY:
497 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
499 case STATE_CONFLICTS:
502 case STATE_CONFLICTSENTRY:
503 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
505 case STATE_RECOMMENDS:
508 case STATE_RECOMMENDSENTRY:
509 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
511 case STATE_SUPPLEMENTS:
514 case STATE_SUPPLEMENTSENTRY:
515 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
520 case STATE_SUGGESTSENTRY:
521 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
526 case STATE_ENHANCESENTRY:
527 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
532 case STATE_FRESHENSENTRY:
533 pd->freshens = adddep(pool, pd, pd->freshens, atts, 0);
540 static const char *findKernelFlavor(Parsedata *pd, Solvable *s)
542 Pool *pool = pd->pool;
547 pidp = pd->repo->idarraydata + s->provides;
548 while ((pid = *pidp++) != 0)
554 continue; /* wrong provides name */
555 prd = GETRELDEP(pool, pid);
556 depname = pool_id2str(pool, prd->name);
557 if (!strncmp(depname, "kernel-", 7))
564 pidp = pd->repo->idarraydata + s->requires;
565 while ((pid = *pidp++) != 0)
571 depname = pool_id2str(pool, pid);
575 Reldep *prd = GETRELDEP(pool, pid);
576 depname = pool_id2str(pool, prd->name);
578 if (!strncmp(depname, "kernel-", 7))
591 * create Solvable from collected data
595 endElement(void *userData, const char *name)
597 Parsedata *pd = (Parsedata *)userData;
598 Pool *pool = pd->pool;
599 Solvable *s = pd->solvable;
604 if (pd->depth != pd->statedepth)
607 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
611 /* ignore deps element */
612 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
620 case STATE_PACKAGE: /* package complete */
621 if (!s->arch) /* default to "noarch" */
622 s->arch = ARCH_NOARCH;
624 if (!s->evr && pd->version) /* set solvable evr */
625 s->evr = evr2id(pool, pd,
626 pd->epoch ? pd->evrspace + pd->epoch : 0,
627 pd->version ? pd->evrspace + pd->version : 0,
628 pd->release ? pd->evrspace + pd->release : 0);
629 /* ensure self-provides */
630 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
631 s->provides = repo_addid_dep(pd->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
632 s->supplements = repo_fix_supplements(pd->repo, s->provides, s->supplements, pd->freshens);
633 s->conflicts = repo_fix_conflicts(pd->repo, s->conflicts);
636 /* see bugzilla bnc#190163 */
637 flavor = findKernelFlavor(pd, s);
640 char *cflavor = solv_strdup(flavor); /* make pointer safe */
645 /* this is either a kernel package or a kmp */
648 Offset prov = s->provides;
650 while ((pid = pd->repo->idarraydata[prov++]) != 0)
652 const char *depname = 0;
657 prd = GETRELDEP(pool, pid);
658 depname = pool_id2str(pool, prd->name);
662 depname = pool_id2str(pool, pid);
666 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
669 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
670 pid = pool_str2id(pool, newdep, 1);
672 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
675 npr = repo_addid_dep(pd->repo, npr, pid, 0);
683 Offset reqs = s->requires;
685 while ((pid = pd->repo->idarraydata[reqs++]) != 0)
687 const char *depname = 0;
692 prd = GETRELDEP(pool, pid);
693 depname = pool_id2str(pool, prd->name);
697 depname = pool_id2str(pool, pid);
700 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
703 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
704 pid = pool_str2id(pool, newdep, 1);
706 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
708 npr = repo_addid_dep(pd->repo, npr, pid, 0);
717 s->name = pool_str2id(pool, pd->content, 1);
720 s->vendor = pool_str2id(pool, pd->content, 1);
722 case STATE_BUILDTIME:
723 t = atoi (pd->content);
725 repodata_set_num(pd->data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
727 case STATE_UPDATE: /* new version, keeping all other metadata */
728 evr = evr2id(pool, pd,
729 pd->epoch ? pd->evrspace + pd->epoch : 0,
730 pd->version ? pd->evrspace + pd->version : 0,
731 pd->release ? pd->evrspace + pd->release : 0);
736 /* use highest evr */
737 if (!s->evr || pool_evrcmp(pool, s->evr, evr, EVRCMP_COMPARE) <= 0)
746 /* ensure buffer space */
747 if (pd->lcontent + 1 + pd->levrspace > pd->aevrspace)
749 pd->evrspace = (char *)realloc(pd->evrspace, pd->lcontent + 1 + pd->levrspace + 256);
750 pd->aevrspace = pd->lcontent + 1 + pd->levrspace + 256;
752 memcpy(pd->evrspace + pd->levrspace, pd->content, pd->lcontent + 1);
753 if (pd->state == STATE_EPOCH || pd->state == STATE_PEPOCH)
754 pd->epoch = pd->levrspace;
755 else if (pd->state == STATE_VERSION || pd->state == STATE_PVERSION)
756 pd->version = pd->levrspace;
758 pd->release = pd->levrspace;
759 pd->levrspace += pd->lcontent + 1;
763 s->arch = pool_str2id(pool, pd->content, 1);
768 pd->state = pd->sbtab[pd->state];
770 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
781 characterData(void *userData, const XML_Char *s, int len)
783 Parsedata *pd = (Parsedata *)userData;
787 // check if current nodes content is interesting
791 // adapt content buffer
792 l = pd->lcontent + len + 1;
793 if (l > pd->acontent)
795 pd->content = (char *)realloc(pd->content, l + 256);
796 pd->acontent = l + 256;
798 // append new content to buffer
799 c = pd->content + pd->lcontent;
806 /*-------------------------------------------------------------------*/
808 #define BUFF_SIZE 8192
811 * read 'helix' type xml from fp
812 * add packages to pool/repo
817 repo_add_helix(Repo *repo, FILE *fp, int flags)
819 Pool *pool = repo->pool;
824 struct stateswitch *sw;
828 now = solv_timems(0);
829 data = repo_add_repodata(repo, flags);
831 /* prepare parsedata */
832 memset(&pd, 0, sizeof(pd));
833 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
835 if (!pd.swtab[sw->from])
836 pd.swtab[sw->from] = sw;
837 pd.sbtab[sw->to] = sw->from;
843 pd.content = (char *)malloc(256); /* must hold all solvable kinds! */
847 pd.evrspace = (char *)malloc(256);
854 parser = XML_ParserCreate(NULL);
855 XML_SetUserData(parser, &pd); /* make parserdata available to XML callbacks */
856 XML_SetElementHandler(parser, startElement, endElement);
857 XML_SetCharacterDataHandler(parser, characterData);
859 // read/parse XML file
862 l = fread(buf, 1, sizeof(buf), fp);
863 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
865 pool_debug(pool, SOLV_FATAL, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
871 XML_ParserFree(parser);
875 if (!(flags & REPO_NO_INTERNALIZE))
876 repodata_internalize(data);
877 POOL_DEBUG(SOLV_DEBUG_STATS, "repo_add_helix took %d ms\n", solv_timems(now));
878 POOL_DEBUG(SOLV_DEBUG_STATS, "repo size: %d solvables\n", repo->nsolvables);
879 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)));