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, "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_PACKAGE, "name", STATE_NAME, 1 },
104 { STATE_PACKAGE, "vendor", STATE_VENDOR, 1 },
105 { STATE_PACKAGE, "buildtime", STATE_BUILDTIME, 1 },
106 { STATE_PACKAGE, "epoch", STATE_PEPOCH, 1 },
107 { STATE_PACKAGE, "version", STATE_PVERSION, 1 },
108 { STATE_PACKAGE, "release", STATE_PRELEASE, 1 },
109 { STATE_PACKAGE, "arch", STATE_PARCH, 1 },
110 { STATE_PACKAGE, "history", STATE_HISTORY, 0 },
111 { STATE_PACKAGE, "provides", STATE_PROVIDES, 0 },
112 { STATE_PACKAGE, "requires", STATE_REQUIRES, 0 },
113 { STATE_PACKAGE, "prerequires", STATE_PREREQUIRES, 0 },
114 { STATE_PACKAGE, "obsoletes", STATE_OBSOLETES , 0 },
115 { STATE_PACKAGE, "conflicts", STATE_CONFLICTS , 0 },
116 { STATE_PACKAGE, "recommends" , STATE_RECOMMENDS , 0 },
117 { STATE_PACKAGE, "supplements", STATE_SUPPLEMENTS, 0 },
118 { STATE_PACKAGE, "suggests", STATE_SUGGESTS, 0 },
119 { STATE_PACKAGE, "enhances", STATE_ENHANCES, 0 },
120 { STATE_PACKAGE, "freshens", STATE_FRESHENS, 0 },
122 { STATE_HISTORY, "update", STATE_UPDATE, 0 },
123 { STATE_UPDATE, "epoch", STATE_EPOCH, 1 },
124 { STATE_UPDATE, "version", STATE_VERSION, 1 },
125 { STATE_UPDATE, "release", STATE_RELEASE, 1 },
126 { STATE_UPDATE, "arch", STATE_ARCH, 1 },
128 { STATE_PROVIDES, "dep", STATE_PROVIDESENTRY, 0 },
129 { STATE_REQUIRES, "dep", STATE_REQUIRESENTRY, 0 },
130 { STATE_PREREQUIRES, "dep", STATE_PREREQUIRESENTRY, 0 },
131 { STATE_OBSOLETES, "dep", STATE_OBSOLETESENTRY, 0 },
132 { STATE_CONFLICTS, "dep", STATE_CONFLICTSENTRY, 0 },
133 { STATE_RECOMMENDS, "dep", STATE_RECOMMENDSENTRY, 0 },
134 { STATE_SUPPLEMENTS, "dep", STATE_SUPPLEMENTSENTRY, 0 },
135 { STATE_SUGGESTS, "dep", STATE_SUGGESTSENTRY, 0 },
136 { STATE_ENHANCES, "dep", STATE_ENHANCESENTRY, 0 },
137 { STATE_FRESHENS, "dep", STATE_FRESHENSENTRY, 0 },
146 typedef struct _parsedata {
149 enum state state; // current state
151 char *content; // buffer for content of node
152 int lcontent; // actual length of current content
153 int acontent; // actual buffer size
154 int docontent; // handle content
157 Pool *pool; // current pool
158 Repo *repo; // current repo
159 Repodata *data; // current repo data
160 Solvable *solvable; // current solvable
161 Offset freshens; // current freshens vector
164 int epoch; // epoch (as offset into evrspace)
165 int version; // version (as offset into evrspace)
166 int release; // release (as offset into evrspace)
167 char *evrspace; // buffer for evr
168 int aevrspace; // actual buffer space
169 int levrspace; // actual evr length
172 struct stateswitch *swtab[NUMSTATES];
173 enum state sbtab[NUMSTATES];
177 /*------------------------------------------------------------------*/
180 // create Id from epoch:version-release
183 evr2id(Pool *pool, Parsedata *pd, const char *e, const char *v, const char *r)
188 // treat explitcit 0 as NULL
189 if (e && !strcmp(e, "0"))
195 // scan version for ":"
196 for (v2 = v; *v2 >= '0' && *v2 <= '9'; v2++) // skip leading digits
198 // if version contains ":", set epoch to "0"
199 if (v2 > v && *v2 == ':')
203 // compute length of Id string
206 l += strlen(e) + 1; // e:
210 l += strlen(r) + 1; // -r
212 // extend content if not sufficient
213 if (l > pd->acontent)
215 pd->content = (char *)realloc(pd->content, l + 256);
216 pd->acontent = l + 256;
219 // copy e-v-r to content
239 // if nothing inserted, return Id 0
243 fprintf(stderr, "evr: %s\n", pd->content);
246 return pool_str2id(pool, pd->content, 1);
250 // create e:v-r from attributes
251 // atts is array of name,value pairs, NULL at end
252 // even index into atts is name
253 // odd index is value
256 evr_atts2id(Pool *pool, Parsedata *pd, const char **atts)
258 const char *e, *v, *r;
260 for (; *atts; atts += 2)
262 if (!strcmp(*atts, "epoch"))
264 else if (!strcmp(*atts, "version"))
266 else if (!strcmp(*atts, "release"))
269 return evr2id(pool, pd, e, v, r);
272 /*------------------------------------------------------------------*/
273 /* rel operator handling */
280 static struct flagtab flagtab[] = {
283 { ">=", REL_GT|REL_EQ },
285 { "!=", REL_GT|REL_LT },
286 { "<=", REL_LT|REL_EQ },
287 { "(any)", REL_LT|REL_EQ|REL_GT },
291 { "ge", REL_GT|REL_EQ },
293 { "ne", REL_GT|REL_LT },
294 { "le", REL_LT|REL_EQ },
295 { "gte", REL_GT|REL_EQ },
296 { "lte", REL_LT|REL_EQ },
299 { "GE", REL_GT|REL_EQ },
301 { "NE", REL_GT|REL_LT },
302 { "LE", REL_LT|REL_EQ }
306 * process new dependency from parser
307 * olddeps = already collected deps, this defines the 'kind' of dep
308 * atts = array of name,value attributes of dep
309 * isreq == 1 if its a requires
313 adddep(Pool *pool, Parsedata *pd, unsigned int olddeps, const char **atts, Id marker)
316 const char *n, *f, *k;
321 /* loop over name,value pairs */
322 for (a = atts; *a; a += 2)
324 if (!strcmp(*a, "name"))
326 if (!strcmp(*a, "kind"))
328 else if (!strcmp(*a, "op"))
330 else if (marker && !strcmp(*a, "pre") && a[1][0] == '1')
331 marker = SOLVABLE_PREREQMARKER;
333 if (!n) /* quit if no name found */
337 if (k && !strcmp(k, "package"))
338 k = NULL; /* package is default */
340 if (k) /* if kind!=package, intern <kind>:<name> */
342 int l = strlen(k) + 1 + strlen(n) + 1;
343 if (l > pd->acontent) /* extend buffer if needed */
345 pd->content = (char *)realloc(pd->content, l + 256);
346 pd->acontent = l + 256;
348 sprintf(pd->content, "%s:%s", k, n);
349 name = pool_str2id(pool, pd->content, 1);
353 name = pool_str2id(pool, n, 1); /* package: just intern <name> */
356 if (f) /* operator ? */
359 Id evr = evr_atts2id(pool, pd, atts);
360 /* parser operator to flags */
362 for (flags = 0; flags < sizeof(flagtab)/sizeof(*flagtab); flags++)
363 if (!strcmp(f, flagtab[flags].from))
365 flags = flagtab[flags].to;
371 id = pool_rel2id(pool, name, evr, flags, 1);
374 id = name; /* no operator */
376 /* add new dependency to repo */
377 return repo_addid_dep(pd->repo, olddeps, id, marker);
381 /*----------------------------------------------------------------*/
390 startElement(void *userData, const char *name, const char **atts)
392 Parsedata *pd = (Parsedata *)userData;
393 struct stateswitch *sw;
394 Pool *pool = pd->pool;
395 Solvable *s = pd->solvable;
397 if (pd->depth != pd->statedepth)
403 /* ignore deps element */
404 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
409 /* find node name in stateswitch */
410 if (!pd->swtab[pd->state])
412 for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++)
414 if (!strcmp(sw->ename, name))
418 /* check if we're at the right level */
419 if (sw->from != pd->state)
422 fprintf(stderr, "into unknown: %s\n", name);
430 pd->docontent = sw->docontent;
431 pd->statedepth = pd->depth;
433 // start with empty content
434 // (will collect data until end element
442 if (pd->kind) /* if kind is set (non package) */
444 strcpy(pd->content, pd->kind);
445 pd->lcontent = strlen(pd->content);
446 pd->content[pd->lcontent++] = ':'; /* prefix name with '<kind>:' */
447 pd->content[pd->lcontent] = 0;
451 case STATE_PACKAGE: /* solvable name */
452 pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
453 if (!strcmp(name, "selection"))
454 pd->kind = "selection";
455 else if (!strcmp(name, "pattern"))
456 pd->kind = "pattern";
457 else if (!strcmp(name, "atom"))
459 else if (!strcmp(name, "product"))
460 pd->kind = "product";
461 else if (!strcmp(name, "patch"))
464 pd->kind = NULL; /* default is package */
471 fprintf(stderr, "package #%d\n", s - pool->solvables);
482 case STATE_PROVIDES: /* start of provides */
485 case STATE_PROVIDESENTRY: /* entry within provides */
486 s->provides = adddep(pool, pd, s->provides, atts, 0);
488 case STATE_REQUIRESENTRY:
489 s->requires = adddep(pool, pd, s->requires, atts, -SOLVABLE_PREREQMARKER);
491 case STATE_PREREQUIRESENTRY:
492 s->requires = adddep(pool, pd, s->requires, atts, SOLVABLE_PREREQMARKER);
494 case STATE_OBSOLETES:
497 case STATE_OBSOLETESENTRY:
498 s->obsoletes = adddep(pool, pd, s->obsoletes, atts, 0);
500 case STATE_CONFLICTS:
503 case STATE_CONFLICTSENTRY:
504 s->conflicts = adddep(pool, pd, s->conflicts, atts, 0);
506 case STATE_RECOMMENDS:
509 case STATE_RECOMMENDSENTRY:
510 s->recommends = adddep(pool, pd, s->recommends, atts, 0);
512 case STATE_SUPPLEMENTS:
515 case STATE_SUPPLEMENTSENTRY:
516 s->supplements = adddep(pool, pd, s->supplements, atts, 0);
521 case STATE_SUGGESTSENTRY:
522 s->suggests = adddep(pool, pd, s->suggests, atts, 0);
527 case STATE_ENHANCESENTRY:
528 s->enhances = adddep(pool, pd, s->enhances, atts, 0);
533 case STATE_FRESHENSENTRY:
534 pd->freshens = adddep(pool, pd, pd->freshens, atts, 0);
541 static const char *findKernelFlavor(Parsedata *pd, Solvable *s)
543 Pool *pool = pd->pool;
548 pidp = pd->repo->idarraydata + s->provides;
549 while ((pid = *pidp++) != 0)
555 continue; /* wrong provides name */
556 prd = GETRELDEP(pool, pid);
557 depname = pool_id2str(pool, prd->name);
558 if (!strncmp(depname, "kernel-", 7))
565 pidp = pd->repo->idarraydata + s->requires;
566 while ((pid = *pidp++) != 0)
572 depname = pool_id2str(pool, pid);
576 Reldep *prd = GETRELDEP(pool, pid);
577 depname = pool_id2str(pool, prd->name);
579 if (!strncmp(depname, "kernel-", 7))
592 * create Solvable from collected data
596 endElement(void *userData, const char *name)
598 Parsedata *pd = (Parsedata *)userData;
599 Pool *pool = pd->pool;
600 Solvable *s = pd->solvable;
605 if (pd->depth != pd->statedepth)
608 // printf("back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
612 /* ignore deps element */
613 if (pd->state == STATE_PACKAGE && !strcmp(name, "deps"))
621 case STATE_PACKAGE: /* package complete */
622 if (name[0] == 's' && name[1] == 'r' && name[2] == 'c' && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
624 if (!s->arch) /* default to "noarch" */
625 s->arch = ARCH_NOARCH;
627 if (!s->evr && pd->version) /* set solvable evr */
628 s->evr = evr2id(pool, pd,
629 pd->epoch ? pd->evrspace + pd->epoch : 0,
630 pd->version ? pd->evrspace + pd->version : 0,
631 pd->release ? pd->evrspace + pd->release : 0);
632 /* ensure self-provides */
633 if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
634 s->provides = repo_addid_dep(pd->repo, s->provides, pool_rel2id(pool, s->name, s->evr, REL_EQ, 1), 0);
635 s->supplements = repo_fix_supplements(pd->repo, s->provides, s->supplements, pd->freshens);
636 s->conflicts = repo_fix_conflicts(pd->repo, s->conflicts);
639 /* see bugzilla bnc#190163 */
640 flavor = findKernelFlavor(pd, s);
643 char *cflavor = solv_strdup(flavor); /* make pointer safe */
648 /* this is either a kernel package or a kmp */
651 Offset prov = s->provides;
653 while ((pid = pd->repo->idarraydata[prov++]) != 0)
655 const char *depname = 0;
660 prd = GETRELDEP(pool, pid);
661 depname = pool_id2str(pool, prd->name);
665 depname = pool_id2str(pool, pid);
669 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
672 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
673 pid = pool_str2id(pool, newdep, 1);
675 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
678 npr = repo_addid_dep(pd->repo, npr, pid, 0);
686 Offset reqs = s->requires;
688 while ((pid = pd->repo->idarraydata[reqs++]) != 0)
690 const char *depname = 0;
695 prd = GETRELDEP(pool, pid);
696 depname = pool_id2str(pool, prd->name);
700 depname = pool_id2str(pool, pid);
703 if (!strncmp(depname, "kernel(", 7) && !strchr(depname, ':'))
706 snprintf(newdep, sizeof(newdep), "kernel(%s:%s", cflavor, depname + 7);
707 pid = pool_str2id(pool, newdep, 1);
709 pid = pool_rel2id(pool, pid, prd->evr, prd->flags, 1);
711 npr = repo_addid_dep(pd->repo, npr, pid, 0);
720 s->name = pool_str2id(pool, pd->content, 1);
723 s->vendor = pool_str2id(pool, pd->content, 1);
725 case STATE_BUILDTIME:
726 t = atoi (pd->content);
728 repodata_set_num(pd->data, s - pool->solvables, SOLVABLE_BUILDTIME, t);
730 case STATE_UPDATE: /* new version, keeping all other metadata */
731 evr = evr2id(pool, pd,
732 pd->epoch ? pd->evrspace + pd->epoch : 0,
733 pd->version ? pd->evrspace + pd->version : 0,
734 pd->release ? pd->evrspace + pd->release : 0);
739 /* use highest evr */
740 if (!s->evr || pool_evrcmp(pool, s->evr, evr, EVRCMP_COMPARE) <= 0)
749 /* ensure buffer space */
750 if (pd->lcontent + 1 + pd->levrspace > pd->aevrspace)
752 pd->evrspace = (char *)realloc(pd->evrspace, pd->lcontent + 1 + pd->levrspace + 256);
753 pd->aevrspace = pd->lcontent + 1 + pd->levrspace + 256;
755 memcpy(pd->evrspace + pd->levrspace, pd->content, pd->lcontent + 1);
756 if (pd->state == STATE_EPOCH || pd->state == STATE_PEPOCH)
757 pd->epoch = pd->levrspace;
758 else if (pd->state == STATE_VERSION || pd->state == STATE_PVERSION)
759 pd->version = pd->levrspace;
761 pd->release = pd->levrspace;
762 pd->levrspace += pd->lcontent + 1;
766 s->arch = pool_str2id(pool, pd->content, 1);
771 pd->state = pd->sbtab[pd->state];
773 // printf("back from known %d %d %d\n", pd->state, pd->depth, pd->statedepth);
784 characterData(void *userData, const XML_Char *s, int len)
786 Parsedata *pd = (Parsedata *)userData;
790 // check if current nodes content is interesting
794 // adapt content buffer
795 l = pd->lcontent + len + 1;
796 if (l > pd->acontent)
798 pd->content = (char *)realloc(pd->content, l + 256);
799 pd->acontent = l + 256;
801 // append new content to buffer
802 c = pd->content + pd->lcontent;
809 /*-------------------------------------------------------------------*/
811 #define BUFF_SIZE 8192
814 * read 'helix' type xml from fp
815 * add packages to pool/repo
820 repo_add_helix(Repo *repo, FILE *fp, int flags)
822 Pool *pool = repo->pool;
827 struct stateswitch *sw;
831 now = solv_timems(0);
832 data = repo_add_repodata(repo, flags);
834 /* prepare parsedata */
835 memset(&pd, 0, sizeof(pd));
836 for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
838 if (!pd.swtab[sw->from])
839 pd.swtab[sw->from] = sw;
840 pd.sbtab[sw->to] = sw->from;
846 pd.content = (char *)malloc(256); /* must hold all solvable kinds! */
850 pd.evrspace = (char *)malloc(256);
857 parser = XML_ParserCreate(NULL);
858 XML_SetUserData(parser, &pd); /* make parserdata available to XML callbacks */
859 XML_SetElementHandler(parser, startElement, endElement);
860 XML_SetCharacterDataHandler(parser, characterData);
862 // read/parse XML file
865 l = fread(buf, 1, sizeof(buf), fp);
866 if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
868 pool_debug(pool, SOLV_FATAL, "%s at line %u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser));
874 XML_ParserFree(parser);
878 if (!(flags & REPO_NO_INTERNALIZE))
879 repodata_internalize(data);
880 POOL_DEBUG(SOLV_DEBUG_STATS, "repo_add_helix took %d ms\n", solv_timems(now));
881 POOL_DEBUG(SOLV_DEBUG_STATS, "repo size: %d solvables\n", repo->nsolvables);
882 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)));