35#ifndef XML_STATUS_ERROR
36#define XML_STATUS_ERROR 0
41#define GRAPHML_ID "_graphml_id"
52static char*
gname =
"";
56static void pushString(strs_t *stk,
const char *
s) {
62 strs_push_back(stk,
copy);
65static void popString(strs_t *stk) {
67 if (strs_is_empty(stk)) {
68 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
72 char *
const popped = strs_pop_back(stk);
76static char *topString(strs_t *stk) {
78 if (strs_is_empty(stk)) {
79 fprintf(stderr,
"PANIC: graphml2gv: empty element stack\n");
83 return *strs_back(stk);
86static void freeString(strs_t *stk) {
93 int closedElementType;
102static graph_stack_t Gstack;
104static userdata_t genUserdata(
char *dfltname) {
105 userdata_t user = {0};
106 user.elements = (strs_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');
128 if (graph_stack_is_empty(&Gstack)) {
133 graph_stack_push_back(&Gstack, g);
141 if (graph_stack_is_empty(&Gstack)) {
142 fprintf(stderr,
"graphml2gv: Gstack underflow in graph parser\n");
147 Agraph_t *g = graph_stack_pop_back(&Gstack);
150 if (!graph_stack_is_empty(&Gstack)) {
151 G = *graph_stack_back(&Gstack);
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);
169 E =
agedge(
G, tailNode, headNode, key, 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,
189 if (strcmp(name,
"headport") == 0) {
190 char *
const attrname = ud->edgeinverted ?
"tailport" :
"headport";
195 }
else if (strcmp(name,
"tailport") == 0) {
196 char *
const attrname = ud->edgeinverted ?
"headport" :
"tailport";
212startElementHandler(
void *userData,
const char *name,
const char **atts)
215 userdata_t *ud = userData;
218 if (strcmp(name,
"graphml") == 0) {
220 }
else if (strcmp(name,
"graph") == 0) {
221 const char *edgeMode =
"";
226 if (ud->closedElementType == TAG_GRAPH) {
228 "Warning: Node contains more than one graph.\n");
230 pos = get_xml_attr(
"id", atts);
236 pos = get_xml_attr(
"edgedefault", atts);
238 edgeMode = atts[pos];
241 if (graph_stack_is_empty(&Gstack)) {
242 if (strcmp(edgeMode,
"directed") == 0) {
244 }
else if (strcmp(edgeMode,
"undirected") == 0) {
249 "Warning: graph has no edgedefault attribute - assume directed\n");
257 if (isAnonGraph(
id)) {
258 static int anon_id = 1;
259 snprintf(buf,
sizeof(buf),
"%%%d", anon_id++);
262 subg =
agsubg(
G, (
char *)
id, 1);
266 pushString(&ud->elements,
id);
267 }
else if (strcmp(name,
"node") == 0) {
268 pos = get_xml_attr(
"id", atts);
270 const char *attrname;
271 attrname = atts[pos];
273 fprintf(stderr,
"node %s outside graph, ignored\n",attrname);
277 pushString(&ud->elements, attrname);
280 }
else if (strcmp(name,
"edge") == 0) {
281 const char *
head =
"", *tail =
"";
285 pos = get_xml_attr(
"source", atts);
288 pos = get_xml_attr(
"target", atts);
293 fprintf(stderr,
"edge source %s target %s outside graph, ignored\n",tail,
head);
295 bind_edge(tail,
head);
300 if (strcmp(tname, tail) == 0) {
301 ud->edgeinverted =
false;
302 }
else if (strcmp(tname,
head) == 0) {
303 ud->edgeinverted =
true;
306 pos = get_xml_attr(
"id", atts);
308 setEdgeAttr(
E, GRAPHML_ID, atts[pos], ud);
314 "Unknown node %s - ignoring.\n",
319static void endElementHandler(
void *userData,
const char *name)
321 userdata_t *ud = userData;
323 if (strcmp(name,
"graph") == 0) {
325 popString(&ud->elements);
326 ud->closedElementType = TAG_GRAPH;
327 }
else if (strcmp(name,
"node") == 0) {
328 char *ele_name = topString(&ud->elements);
329 if (ud->closedElementType == TAG_GRAPH) {
333 popString(&ud->elements);
334 ud->closedElementType = TAG_NODE;
335 }
else if (strcmp(name,
"edge") == 0) {
337 ud->closedElementType = TAG_EDGE;
338 ud->edgeinverted =
false;
342static Agraph_t *graphml_to_gv(
char *graphname, FILE *graphmlFile,
int *rv) {
345 userdata_t udata = genUserdata(graphname);
346 XML_Parser parser = XML_ParserCreate(
NULL);
349 XML_SetUserData(parser, &udata);
350 XML_SetElementHandler(parser, startElementHandler, endElementHandler);
354 size_t len = fread(buf, 1,
sizeof(buf), graphmlFile);
357 done =
len <
sizeof(buf);
358 assert(
len <= INT_MAX);
362 XML_ErrorString(XML_GetErrorCode(parser)),
363 XML_GetCurrentLineNumber(parser));
368 XML_ParserFree(parser);
377 static FILE *savef =
NULL;
388 if ((rv = fopen(
Files[
cnt++],
"r")) != 0)
391 fprintf(stderr,
"Can't open %s\n",
Files[
cnt - 1]);
398static const char *
use =
"Usage: %s [-gd?] [-o<file>] [<graphs>]\n\
399 -g<name> : use <name> as template for graph names\n\
400 -o<file> : output to <file> (stdout)\n\
404static void usage(
int v)
414 sp = strrchr(
path,
'/');
422static void initargs(
int argc,
char **argv)
428 while ((c = getopt(argc, argv,
":vg:o:")) != -1) {
442 fprintf(stderr,
"%s: option -%c missing argument\n",
CmdName, optopt);
449 fprintf(stderr,
"%s: option -%c unrecognized\n",
CmdName,
486 int rv = 0, gcnt = 0;
498 fprintf (stderr,
"%s: %d nodes %d edges\n",
505 graph_stack_free(&Gstack);
510 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)
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
#define DEFINE_LIST_WITH_DTOR(name, type, dtor)
#define DEFINE_LIST(name, type)
static FILE * openFile(const char *argv0, const char *name, const char *mode)