34#ifndef XML_STATUS_ERROR
35#define XML_STATUS_ERROR 0
40#define GRAPHML_ID "_graphml_id"
51static char*
gname =
"";
53static void pushString(gv_stack_t *stk,
const char *
s) {
62static void popString(gv_stack_t *stk) {
65 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
73static char *topString(gv_stack_t *stk) {
76 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
83static void freeString(gv_stack_t *stk) {
94 int closedElementType;
102static gv_stack_t Gstack;
104static userdata_t genUserdata(
char *dfltname) {
105 userdata_t user = {0};
106 user.elements = (gv_stack_t){0};
107 user.closedElementType = TAG_NONE;
108 user.edgeinverted =
false;
109 user.gname = dfltname;
113static void freeUserdata(userdata_t ud) {
114 freeString(&ud.elements);
117static int isAnonGraph(
const char *name) {
122 return (*name ==
'\0');
142 fprintf(stderr,
"graphml2gv: Gstack underflow in graph parser\n");
157static Agnode_t *bind_node(
const char *name)
159 return agnode(
G, (
char *)name, 1);
162static Agedge_t *bind_edge(
const char *tail,
const char *
head)
167 tailNode =
agnode(
G, (
char *) tail, 1);
173static int get_xml_attr(
char *attrname,
const char **atts)
176 while (atts[count] !=
NULL) {
177 if (strcmp(attrname, atts[count]) == 0) {
185static char *defval =
"";
187static void setEdgeAttr(
Agedge_t *ep,
char *name,
const char *value,
192 if (strcmp(name,
"headport") == 0) {
193 if (ud->edgeinverted)
194 attrname =
"tailport";
196 attrname =
"headport";
201 }
else if (strcmp(name,
"tailport") == 0) {
202 if (ud->edgeinverted)
203 attrname =
"headport";
205 attrname =
"tailport";
221startElementHandler(
void *userData,
const char *name,
const char **atts)
224 userdata_t *ud = userData;
227 if (strcmp(name,
"graphml") == 0) {
229 }
else if (strcmp(name,
"graph") == 0) {
230 const char *edgeMode =
"";
235 if (ud->closedElementType == TAG_GRAPH) {
237 "Warning: Node contains more than one graph.\n");
239 pos = get_xml_attr(
"id", atts);
245 pos = get_xml_attr(
"edgedefault", atts);
247 edgeMode = atts[pos];
251 if (strcmp(edgeMode,
"directed") == 0) {
253 }
else if (strcmp(edgeMode,
"undirected") == 0) {
258 "Warning: graph has no edgedefault attribute - assume directed\n");
266 if (isAnonGraph(
id)) {
267 static int anon_id = 1;
268 snprintf(buf,
sizeof(buf),
"%%%d", anon_id++);
271 subg =
agsubg(
G, (
char *)
id, 1);
275 pushString(&ud->elements,
id);
276 }
else if (strcmp(name,
"node") == 0) {
277 pos = get_xml_attr(
"id", atts);
279 const char *attrname;
280 attrname = atts[pos];
282 fprintf(stderr,
"node %s outside graph, ignored\n",attrname);
286 pushString(&ud->elements, attrname);
289 }
else if (strcmp(name,
"edge") == 0) {
290 const char *
head =
"", *tail =
"";
294 pos = get_xml_attr(
"source", atts);
297 pos = get_xml_attr(
"target", atts);
302 fprintf(stderr,
"edge source %s target %s outside graph, ignored\n",tail,
head);
304 bind_edge(tail,
head);
309 if (strcmp(tname, tail) == 0) {
310 ud->edgeinverted =
false;
311 }
else if (strcmp(tname,
head) == 0) {
312 ud->edgeinverted =
true;
315 pos = get_xml_attr(
"id", atts);
317 setEdgeAttr(
E, GRAPHML_ID, atts[pos], ud);
323 "Unknown node %s - ignoring.\n",
328static void endElementHandler(
void *userData,
const char *name)
330 userdata_t *ud = userData;
332 if (strcmp(name,
"graph") == 0) {
334 popString(&ud->elements);
335 ud->closedElementType = TAG_GRAPH;
336 }
else if (strcmp(name,
"node") == 0) {
337 char *ele_name = topString(&ud->elements);
338 if (ud->closedElementType == TAG_GRAPH) {
342 popString(&ud->elements);
344 }
else if (strcmp(name,
"edge") == 0) {
346 ud->closedElementType = TAG_EDGE;
347 ud->edgeinverted =
false;
351static Agraph_t *graphml_to_gv(
char *graphname, FILE *graphmlFile,
int *rv) {
354 userdata_t udata = genUserdata(graphname);
355 XML_Parser parser = XML_ParserCreate(
NULL);
358 XML_SetUserData(parser, &udata);
359 XML_SetElementHandler(parser, startElementHandler, endElementHandler);
363 size_t len = fread(buf, 1,
sizeof(buf), graphmlFile);
366 done =
len <
sizeof(buf);
367 assert(
len <= INT_MAX);
371 XML_ErrorString(XML_GetErrorCode(parser)),
372 XML_GetCurrentLineNumber(parser));
377 XML_ParserFree(parser);
386 static FILE *savef =
NULL;
397 if ((rv = fopen(
Files[
cnt++],
"r")) != 0)
400 fprintf(stderr,
"Can't open %s\n",
Files[
cnt - 1]);
407static const char *
use =
"Usage: %s [-gd?] [-o<file>] [<graphs>]\n\
408 -g<name> : use <name> as template for graph names\n\
409 -o<file> : output to <file> (stdout)\n\
413static void usage(
int v)
423 sp = strrchr(
path,
'/');
431static void initargs(
int argc,
char **argv)
437 while ((c = getopt(argc, argv,
":vg:o:")) != -1) {
451 fprintf(stderr,
"%s: option -%c missing argument\n",
CmdName, optopt);
458 fprintf(stderr,
"%s: option -%c unrecognized\n",
CmdName,
495 int rv = 0, gcnt = 0;
507 fprintf (stderr,
"%s: %d nodes %d edges\n",
519 fputs(
"graphml2gv: not configured for conversion from GXL to GV\n", stderr);
Agobj_t * copy(Agraph_t *g, Agobj_t *obj)
static void agxbfree(agxbuf *xb)
free any malloced resources
static int agxbprint(agxbuf *xb, const char *fmt,...)
Printf-style output to an agxbuf.
static char * agxbuse(agxbuf *xb)
Memory allocation wrappers that exit on failure.
static char * gv_strdup(const char *original)
DOT-GXL converter API for gxl2gv.c and gv2gxl.c.
static void initargs(int argc, char **argv)
static char * cmdName(char *path)
static NORETURN void graphviz_exit(int status)
static double len(glCompPoint p)
static FILE * getFile(void)
static char * nameOf(agxbuf *buf, char *name, int cnt)
static int cnt(Dict_t *d, Dtlink_t **set)
int agnedges(Agraph_t *g)
int agnnodes(Agraph_t *g)
Agsym_t * agattr(Agraph_t *g, int kind, char *name, const char *value)
creates or looks up attributes of a graph
int agxset(void *obj, Agsym_t *sym, const char *value)
Agedge_t * agedge(Agraph_t *g, Agnode_t *t, Agnode_t *h, char *name, int createflag)
Agdesc_t Agundirected
undirected
int agclose(Agraph_t *g)
deletes a graph, freeing its associated storage
Agraph_t * agopen(char *name, Agdesc_t desc, Agdisc_t *disc)
creates a new graph with the given name and kind
int agwrite(Agraph_t *g, void *chan)
Return 0 on success, EOF on failure.
Agdesc_t Agdirected
directed
Agnode_t * agnode(Agraph_t *g, char *name, int createflag)
char * agnameof(void *)
returns a string descriptor for the object.
int agdelete(Agraph_t *g, void *obj)
deletes object. Equivalent to agclose, agdelnode, and agdeledge for obj being a graph,...
Agraph_t * agsubg(Agraph_t *g, char *name, int cflag)
Agraph_t * graph(char *name)
replacements for ctype.h functions
static bool gv_isdigit(int c)
static const char * usage
static FILE * openFile(const char *argv0, const char *name, const char *mode)
Implementation of a dynamically expanding stack data structure.
static void stack_push(gv_stack_t *stack, void *item)
static void * stack_pop(gv_stack_t *stack)
static void * stack_top(gv_stack_t *stack)
static void stack_reset(gv_stack_t *stack)
static bool stack_is_empty(const gv_stack_t *stack)