36#ifndef XML_STATUS_ERROR
37#define XML_STATUS_ERROR 0
42#define GRAPHML_ID "_graphml_id"
53static char*
gname =
"";
55typedef LIST(
char *) strs_t;
57static void pushString(strs_t *stk,
const char *
s) {
66static void popString(strs_t *stk) {
69 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
76static char *topString(strs_t *stk) {
79 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
86static void freeString(strs_t *stk) {
93 int closedElementType;
103static userdata_t genUserdata(
char *dfltname) {
104 userdata_t user = {0};
106 user.closedElementType = TAG_NONE;
107 user.edgeinverted =
false;
108 user.gname = dfltname;
112static void freeUserdata(userdata_t ud) {
113 freeString(&ud.elements);
116static int isAnonGraph(
const char *name) {
121 return (*name ==
'\0');
141 fprintf(stderr,
"graphml2gv: Gstack underflow in graph parser\n");
156static Agnode_t *bind_node(
const char *name)
158 return agnode(
G, (
char *)name, 1);
161static Agedge_t *bind_edge(
const char *tail,
const char *
head)
166 tailNode =
agnode(
G, (
char *) tail, 1);
168 E =
agedge(
G, tailNode, headNode, key, 1);
172static int get_xml_attr(
char *attrname,
const char **atts)
175 while (atts[count] !=
NULL) {
176 if (strcmp(attrname, atts[count]) == 0) {
184static char *defval =
"";
186static void setEdgeAttr(
Agedge_t *ep,
char *name,
const char *value,
188 if (strcmp(name,
"headport") == 0) {
189 char *
const attrname = ud->edgeinverted ?
"tailport" :
"headport";
194 }
else if (strcmp(name,
"tailport") == 0) {
195 char *
const attrname = ud->edgeinverted ?
"headport" :
"tailport";
211startElementHandler(
void *userData,
const char *name,
const char **atts)
214 userdata_t *ud = userData;
217 if (strcmp(name,
"graphml") == 0) {
219 }
else if (strcmp(name,
"graph") == 0) {
220 const char *edgeMode =
"";
225 if (ud->closedElementType == TAG_GRAPH) {
227 "Warning: Node contains more than one graph.\n");
229 pos = get_xml_attr(
"id", atts);
235 pos = get_xml_attr(
"edgedefault", atts);
237 edgeMode = atts[pos];
241 if (strcmp(edgeMode,
"directed") == 0) {
243 }
else if (strcmp(edgeMode,
"undirected") == 0) {
246 GV_INFO(
"Warning: graph has no edgedefault attribute - assume directed");
253 if (isAnonGraph(
id)) {
254 static int anon_id = 1;
255 snprintf(buf,
sizeof(buf),
"%%%d", anon_id++);
258 subg =
agsubg(
G, (
char *)
id, 1);
262 pushString(&ud->elements,
id);
263 }
else if (strcmp(name,
"node") == 0) {
264 pos = get_xml_attr(
"id", atts);
266 const char *attrname;
267 attrname = atts[pos];
269 fprintf(stderr,
"node %s outside graph, ignored\n",attrname);
273 pushString(&ud->elements, attrname);
276 }
else if (strcmp(name,
"edge") == 0) {
277 const char *
head =
"", *tail =
"";
281 pos = get_xml_attr(
"source", atts);
284 pos = get_xml_attr(
"target", atts);
289 fprintf(stderr,
"edge source %s target %s outside graph, ignored\n",tail,
head);
291 bind_edge(tail,
head);
296 if (strcmp(tname, tail) == 0) {
297 ud->edgeinverted =
false;
298 }
else if (strcmp(tname,
head) == 0) {
299 ud->edgeinverted =
true;
302 pos = get_xml_attr(
"id", atts);
304 setEdgeAttr(
E, GRAPHML_ID, atts[pos], ud);
310 "Unknown node %s - ignoring.\n",
315static void endElementHandler(
void *userData,
const char *name)
317 userdata_t *ud = userData;
319 if (strcmp(name,
"graph") == 0) {
321 popString(&ud->elements);
322 ud->closedElementType = TAG_GRAPH;
323 }
else if (strcmp(name,
"node") == 0) {
324 char *ele_name = topString(&ud->elements);
325 if (ud->closedElementType == TAG_GRAPH) {
329 popString(&ud->elements);
330 ud->closedElementType = TAG_NODE;
331 }
else if (strcmp(name,
"edge") == 0) {
333 ud->closedElementType = TAG_EDGE;
334 ud->edgeinverted =
false;
338static Agraph_t *graphml_to_gv(
char *graphname, FILE *graphmlFile,
int *rv) {
341 userdata_t udata = genUserdata(graphname);
342 XML_Parser parser = XML_ParserCreate(
NULL);
345 XML_SetUserData(parser, &udata);
346 XML_SetElementHandler(parser, startElementHandler, endElementHandler);
350 size_t len = fread(buf, 1,
sizeof(buf), graphmlFile);
353 done =
len <
sizeof(buf);
354 assert(
len <= INT_MAX);
358 XML_ErrorString(XML_GetErrorCode(parser)),
359 XML_GetCurrentLineNumber(parser));
364 XML_ParserFree(parser);
373 static FILE *savef =
NULL;
384 if ((rv = fopen(
Files[
cnt++],
"r")) != 0)
387 fprintf(stderr,
"Can't open %s\n",
Files[
cnt - 1]);
394static const char *
use =
"Usage: %s [-gd?] [-o<file>] [<graphs>]\n\
395 -g<name> : use <name> as template for graph names\n\
396 -o<file> : output to <file> (stdout)\n\
400static void usage(
int v)
410 sp = strrchr(
path,
'/');
418static void initargs(
int argc,
char **argv)
424 while ((c = getopt(argc, argv,
":vg:o:")) != -1) {
438 fprintf(stderr,
"%s: option -%c missing argument\n",
CmdName, optopt);
445 fprintf(stderr,
"%s: option -%c unrecognized\n",
CmdName,
482 int rv = 0, gcnt = 0;
505 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 WUR 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)
helpers for verbose/debug printing
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_text(Agraph_t *g, int kind, char *name, const char *value)
creates or looks up text 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
type-generic dynamically expanding list
#define LIST_DROP_BACK(list)
#define LIST_POP_BACK(list)
#define LIST_IS_EMPTY(list)
#define LIST_PUSH_BACK(list, item)
static FILE * openFile(const char *argv0, const char *name, const char *mode)