/* VCG description handler for Bison. Copyright 2001, 2002 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. Bison is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. Bison is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #include "system.h" #include "vcg.h" #include "vcg_defaults.h" #include "quotearg.h" /* Return an unambiguous printable representated, for NAME, suitable for C strings. Use slot 2 since the user may use slots 0 and 1. */ static char const * quote (char const *name) { return quotearg_n_style (2, c_quoting_style, name); } /* Initialize a graph with the default values. */ void new_graph (graph_t *g) { g->title = G_TITLE; g->label = G_LABEL; g->infos[0] = G_INFOS1; g->infos[1] = G_INFOS2; g->infos[2] = G_INFOS3; g->color = G_COLOR; g->textcolor = G_TEXTCOLOR; g->bordercolor = G_BORDERCOLOR; g->width = G_WIDTH; g->height = G_HEIGHT; g->borderwidth = G_BORDERWIDTH; g->x = G_X; g->y = G_Y; g->folding = G_FOLDING; g->shrink = G_SHRINK; g->stretch = G_STRETCH; g->textmode = G_TEXTMODE; g->shape = G_SHAPE; g->vertical_order = G_VERTICAL_ORDER; g->horizontal_order = G_HORIZONTAL_ORDER; g->xmax = G_XMAX; /* Not output. */ g->ymax = G_YMAX; /* Not output. */ g->xbase = G_XBASE; g->ybase = G_YBASE; g->xspace = G_XSPACE; g->yspace = G_YSPACE; g->xlspace = G_XLSPACE; /* Not output. */ g->xraster = G_XRASTER; g->yraster = G_YRASTER; g->xlraster = G_XLRASTER; g->hidden = G_HIDDEN; /* No default value. */ g->classname = G_CLASSNAME; /* No class name association. */ g->layoutalgorithm = G_LAYOUTALGORITHM; g->layout_downfactor = G_LAYOUT_DOWNFACTOR; g->layout_upfactor = G_LAYOUT_UPFACTOR; g->layout_nearfactor = G_LAYOUT_NEARFACTOR; g->layout_splinefactor = G_LAYOUT_SPLINEFACTOR; g->late_edge_labels = G_LATE_EDGE_LABELS; g->display_edge_labels = G_DISPLAY_EDGE_LABELS; g->dirty_edge_labels = G_DIRTY_EDGE_LABELS; g->finetuning = G_FINETUNING; g->ignore_singles = G_IGNORE_SINGLES; g->straight_phase = G_STRAIGHT_PHASE; g->priority_phase = G_PRIORITY_PHASE; g->manhattan_edges = G_MANHATTAN_EDGES; g->smanhattan_edges = G_SMANHATTAN_EDGES; g->near_edges = G_NEAR_EDGES; g->orientation = G_ORIENTATION; g->node_alignement = G_NODE_ALIGNEMENT; g->port_sharing = G_PORT_SHARING; g->arrow_mode = G_ARROW_MODE; g->treefactor = G_TREEFACTOR; g->spreadlevel = G_SPREADLEVEL; g->crossing_weight = G_CROSSING_WEIGHT; g->crossing_phase2 = G_CROSSING_PHASE2; g->crossing_optimization = G_CROSSING_OPTIMIZATION; g->view = G_VIEW; g->edges = G_EDGES; g->nodes = G_NODES; g->splines = G_SPLINES; g->bmax = G_BMAX; g->cmin = G_CMIN; g->cmax = G_CMAX; g->pmin = G_PMIN; g->pmax = G_PMAX; g->rmin = G_RMIN; g->rmax = G_RMAX; g->smax = G_SMAX; g->node_list = G_NODE_LIST; g->edge_list = G_EDGE_LIST; new_edge(&g->edge); new_node(&g->node); } /* Initialize a node with the defalut values. */ void new_node (node_t *node) { node->title = N_TITLE; node->label = N_LABEL; node->locx = N_LOCX; /* Default unspcified. */ node->locy = N_LOCY; /* Default unspcified. */ node->vertical_order = N_VERTICAL_ORDER; /* Default unspcified. */ node->horizontal_order = N_HORIZONTAL_ORDER; /* Default unspcified. */ node->width = N_WIDTH; /* We assume that we can't define it now. */ node->height = N_HEIGHT; /* Also. */ node->shrink = N_SHRINK; node->stretch = N_STRETCH; node->folding = N_FOLDING; /* No explicit default value. */ node->shape = N_SHAPE; node->textmode = N_TEXTMODE; node->borderwidth = N_BORDERWIDTH; node->color = N_COLOR; node->textcolor = N_TEXTCOLOR; node->bordercolor = N_BORDERCOLOR; node->infos[0] = N_INFOS1; node->infos[1] = N_INFOS2; node->infos[2] = N_INFOS3; node->next = N_NEXT; } /* Initialize a edge with the defalut values. */ void new_edge (edge_t *edge) { edge->type = E_EDGE_TYPE; edge->sourcename = E_SOURCENAME; edge->targetname = E_TARGETNAME; edge->label = E_LABEL; edge->linestyle = E_LINESTYLE; edge->thickness = E_THICKNESS; edge->class = E_CLASS; edge->color = E_COLOR; edge->textcolor = E_TEXTCOLOR; edge->arrowcolor = E_ARROWCOLOR; edge->backarrowcolor = E_BACKARROWCOLOR; edge->arrowsize = E_ARROWSIZE; edge->backarrowsize = E_BACKARROWSIZE; edge->arrowstyle = E_ARROWSTYLE; edge->backarrowstyle = E_BACKARROWSTYLE; edge->priority = E_PRIORITY; edge->anchor = E_ANCHOR; edge->horizontal_order = E_HORIZONTAL_ORDER; edge->next = E_NEXT; } /*----------------------------------------------. | Get functions. | | Return string corresponding to an enum value. | `----------------------------------------------*/ static const char * get_color_str (enum color_e c) { switch (c) { case white: return "white"; case blue: return "blue"; case red: return "red"; case green: return "green"; case yellow: return "yellow"; case magenta: return "magenta"; case cyan: return "cyan"; case darkgrey: return "darkgrey"; case darkblue: return "darkblue"; case darkred: return "darkred"; case darkgreen: return "darkgreen"; case darkyellow: return "darkyellow"; case darkmagenta: return "darkmagenta"; case darkcyan: return "darkcyan"; case gold: return "gold"; case lightgrey: return "lightgrey"; case lightblue: return "lightblue"; case lightred: return "lightred"; case lightgreen: return "lightgreen"; case lightyellow: return "lightyellow"; case lightmagenta: return "lightmagenta"; case lightcyan: return "lightcyan"; case lilac: return "lilac"; case turquoise: return "turquoise"; case aquamarine: return "aquamarine"; case khaki: return "khaki"; case purple: return "purple"; case yellowgreen: return "yellowgreen"; case pink: return "pink"; case orange: return "orange"; case orchid: return "orchid"; case black: return "black"; default: #define A_known_default_color 0 assert (A_known_default_color); } return NULL; } static const char * get_textmode_str (enum textmode_e t) { switch (t) { case centered: return "center"; case left_justify: return "left_justify"; case right_justify: return "right_justify"; default: #define A_known_text_mode 0 assert (A_known_text_mode); } return NULL; } static const char * get_shape_str (enum shape_e s) { switch (s) { case box: return "box"; case rhomb: return "rhomb"; case ellipse: return "ellipse"; case triangle: return "triangle"; default: #define A_known_shape 0 assert (A_known_shape); } return NULL; } static const char * get_layoutalgorithm_str (enum layoutalgorithm_e l) { switch (l) { case normal: return "normal"; case maxdepth: return "maxdepth"; case mindepth: return "mindepth"; case maxdepthslow: return "maxdepthslow"; case mindepthslow: return "mindepthslow"; case maxdegree: return "maxdegree"; case mindegree: return "mindegree"; case maxindegree: return "maxindegree"; case minindegree: return "minindegree"; case maxoutdegree: return "maxoutdegree"; case minoutdegree: return "minoutdegree"; case minbackward: return "minbackward"; case dfs: return "dfs"; case tree: return "tree"; default: #define A_known_layout_algorithm 0 assert (A_known_layout_algorithm); } return NULL; } static const char * get_decision_str (enum decision_e d) { switch (d) { case no: return "no"; case yes: return "yes"; default: #define Either_yes_nor_no 0 assert (Either_yes_nor_no); } return NULL; } static const char * get_orientation_str (enum orientation_e o) { switch (o) { case top_to_bottom: return "top_to_bottom"; case bottom_to_top: return "bottom_to_top"; case left_to_right: return "left_to_right"; case right_to_left: return "right_to_left"; default: #define A_knownn_orientation 0 assert (A_knownn_orientation); } return NULL; } static const char * get_node_alignement_str (enum alignement_e a) { switch (a) { case center: return "center"; case top: return "top"; case bottom: return "bottom"; default: #define A_known_alignement 0 assert (A_known_alignement); } return NULL; } static const char * get_arrow_mode_str (enum arrow_mode_e a) { switch (a) { case fixed: return "fixed"; case free_a: return "free"; default: #define A_known_arrow_mode 0 assert (A_known_arrow_mode); } return NULL; } static const char * get_crossing_type_str (enum crossing_type_e c) { switch (c) { case bary: return "bary"; case median: return "median"; case barymedian: return "barymedian"; case medianbary: return "medianbary"; default: #define A_known_crossing_type 0 assert (A_known_crossing_type); } return NULL; } static const char * get_view_str (enum view_e v) { switch (v) { case normal_view: return "normal_view"; case cfish: return "cfish"; case pfish: return "pfish"; case fcfish: return "fcfish"; case fpfish: return "fpfish"; default: #define A_known_view 0 assert (A_known_view); } return NULL; } static const char * get_linestyle_str (enum linestyle_e l) { switch (l) { case continuous: return "continuous"; case dashed: return "dashed"; case dotted: return "dotted"; case invisible: return "invisible"; default: #define A_known_line_style 0 assert (A_known_line_style); } return NULL; } static const char * get_arrowstyle_str (enum arrowstyle_e a) { switch (a) { case solid: return "solid"; case line: return "line"; case none: return "none"; default: #define A_known_arrow_style 0 assert (A_known_arrow_style); } return NULL; } /*----------------------------. | Add functions. | | Edge and Nodes int a graph. | `----------------------------*/ void add_node (graph_t *graph, node_t *node) { node->next = graph->node_list; graph->node_list = node; } void add_edge (graph_t *graph, edge_t *edge) { edge->next = graph->edge_list; graph->edge_list = edge; } void add_classname (graph_t *g, int val, const char *name) { struct classname_s *classname; classname = XMALLOC (struct classname_s, 1); classname->no = val; classname->name = name; classname->next = g->classname; g->classname = classname; } void add_infoname (graph_t *g, int integer, const char *string) { struct infoname_s *infoname; infoname = XMALLOC (struct infoname_s, 1); infoname->integer = integer; infoname->string = string; infoname->next = g->infoname; g->infoname = infoname; } /* Build a colorentry struct and add it to the list. */ void add_colorentry (graph_t *g, int color_idx, int red_cp, int green_cp, int blue_cp) { struct colorentry_s *ce; ce = XMALLOC (struct colorentry_s, 1); ce->color_index = color_idx; ce->red_cp = red_cp; ce->green_cp = green_cp; ce->blue_cp = blue_cp; ce->next = g->colorentry; g->colorentry = ce; } /*-------------------------------------. | Open and close functions (formatted) | `-------------------------------------*/ void open_edge(edge_t *edge, FILE *fout) { switch (edge->type) { case normal_edge: fputs ("\tedge: {\n", fout); break; case back_edge: fputs ("\tbackedge: {\n", fout); break; case near_edge: fputs ("\tnearedge: {\n", fout); break; case bent_near_edge: fputs ("\tbentnearedge: {\n", fout); break; default: fputs ("\tedge: {\n", fout); } } void close_edge(FILE *fout) { fputs ("\t}\n", fout); } void open_node(FILE *fout) { fputs ("\tnode: {\n", fout); } void close_node(FILE *fout) { fputs ("\t}\n", fout); } void open_graph(FILE *fout) { fputs ("graph: {\n", fout); } void close_graph(graph_t *graph, FILE *fout) { fputc ('\n', fout); /* FIXME: Unallocate nodes and edges if required. */ { node_t *node; for (node = graph->node_list; node; node = node->next) { open_node (fout); output_node (node, fout); close_node (fout); } } fputc ('\n', fout); { edge_t *edge; for (edge = graph->edge_list; edge; edge = edge->next) { open_edge (edge, fout); output_edge (edge, fout); close_edge (fout); } } fputs ("}\n", fout); } /*-------------------------------------------. | Output functions (formatted) in file FOUT | `-------------------------------------------*/ void output_node (node_t *node, FILE *fout) { if (node->title != N_TITLE) fprintf (fout, "\t\ttitle:\t%s\n", quote (node->title)); if (node->label != N_LABEL) fprintf (fout, "\t\tlabel:\t%s\n", quote (node->label)); if ((node->locx != N_LOCX) && (node->locy != N_LOCY)) fprintf (fout, "\t\tloc { x: %d y: %d }\t\n", node->locx, node->locy); if (node->vertical_order != N_VERTICAL_ORDER) fprintf (fout, "\t\tvertical_order:\t%d\n", node->vertical_order); if (node->horizontal_order != N_HORIZONTAL_ORDER) fprintf (fout, "\t\thorizontal_order:\t%d\n", node->horizontal_order); if (node->width != N_WIDTH) fprintf (fout, "\t\twidth:\t%d\n", node->width); if (node->height != N_HEIGHT) fprintf (fout, "\t\theight:\t%d\n", node->height); if (node->shrink != N_SHRINK) fprintf (fout, "\t\tshrink:\t%d\n", node->shrink); if (node->stretch != N_STRETCH) fprintf (fout, "\t\tstretch:\t%d\n", node->stretch); if (node->folding != N_FOLDING) fprintf (fout, "\t\tfolding:\t%d\n", node->folding); if (node->textmode != N_TEXTMODE) fprintf (fout, "\t\ttextmode:\t%s\n", get_textmode_str (node->textmode)); if (node->shape != N_SHAPE) fprintf (fout, "\t\tshape:\t%s\n", get_shape_str (node->shape)); if (node->borderwidth != N_BORDERWIDTH) fprintf (fout, "\t\tborderwidth:\t%d\n", node->borderwidth); if (node->color != N_COLOR) fprintf (fout, "\t\tcolor:\t%s\n", get_color_str (node->color)); if (node->textcolor != N_TEXTCOLOR) fprintf (fout, "\t\ttextcolor:\t%s\n", get_color_str (node->textcolor)); if (node->bordercolor != N_BORDERCOLOR) fprintf (fout, "\t\tbordercolor:\t%s\n", get_color_str (node->bordercolor)); { int i; for (i = 0; i < 3; ++i) if (node->infos[i]) fprintf (fout, "\t\tinfo%d:\t%s\n", i, quote (node->infos[i])); } } void output_edge (edge_t *edge, FILE *fout) { /* FIXME: SOURCENAME and TARGETNAME are mandatory so it has to be fatal not to give these informations. */ if (edge->sourcename != E_SOURCENAME) fprintf (fout, "\t\tsourcename:\t%s\n", quote (edge->sourcename)); if (edge->targetname != E_TARGETNAME) fprintf (fout, "\t\ttargetname:\t%s\n", quote (edge->targetname)); if (edge->label != E_LABEL) fprintf (fout, "\t\tlabel:\t%s\n", quote (edge->label)); if (edge->linestyle != E_LINESTYLE) fprintf (fout, "\t\tlinestyle:\t%s\n", quote (get_linestyle_str(edge->linestyle))); if (edge->thickness != E_THICKNESS) fprintf (fout, "\t\tthickness:\t%d\n", edge->thickness); if (edge->class != E_CLASS) fprintf (fout, "\t\tclass:\t%d\n", edge->class); if (edge->color != E_COLOR) fprintf (fout, "\t\tcolor:\t%s\n", get_color_str (edge->color)); if (edge->color != E_TEXTCOLOR) fprintf (fout, "\t\ttextcolor:\t%s\n", get_color_str (edge->textcolor)); if (edge->arrowcolor != E_ARROWCOLOR) fprintf (fout, "\t\tarrowcolor:\t%s\n", get_color_str (edge->arrowcolor)); if (edge->backarrowcolor != E_BACKARROWCOLOR) fprintf (fout, "\t\tbackarrowcolor:\t%s\n", get_color_str (edge->backarrowcolor)); if (edge->arrowsize != E_ARROWSIZE) fprintf (fout, "\t\tarrowsize:\t%d\n", edge->arrowsize); if (edge->backarrowsize != E_BACKARROWSIZE) fprintf (fout, "\t\tbackarrowsize:\t%d\n", edge->backarrowsize); if (edge->arrowstyle != E_ARROWSTYLE) fprintf (fout, "\t\tarrowstyle:\t%s\n", get_arrowstyle_str(edge->arrowstyle)); if (edge->backarrowstyle != E_BACKARROWSTYLE) fprintf (fout, "\t\tbackarrowstyle:\t%s\n", get_arrowstyle_str(edge->backarrowstyle)); if (edge->priority != E_PRIORITY) fprintf (fout, "\t\tpriority:\t%d\n", edge->priority); if (edge->anchor != E_ANCHOR) fprintf (fout, "\t\tanchor:\t%d\n", edge->anchor); if (edge->horizontal_order != E_HORIZONTAL_ORDER) fprintf (fout, "\t\thorizontal_order:\t%d\n", edge->horizontal_order); } void output_graph (graph_t *graph, FILE *fout) { if (graph->title) fprintf (fout, "\ttitle:\t%s\n", quote (graph->title)); if (graph->label) fprintf (fout, "\tlabel:\t%s\n", quote (graph->label)); { int i; for (i = 0; i < 3; ++i) if (graph->infos[i]) fprintf (fout, "\tinfo%d:\t%s\n", i, quote (graph->infos[i])); } if (graph->color != G_COLOR) fprintf (fout, "\tcolor:\t%s\n", get_color_str (graph->color)); if (graph->textcolor != G_TEXTCOLOR) fprintf (fout, "\ttextcolor:\t%s\n", get_color_str (graph->textcolor)); if (graph->bordercolor != G_BORDERCOLOR) fprintf (fout, "\tbordercolor:\t%s\n", get_color_str (graph->bordercolor)); if (graph->width != G_WIDTH) fprintf (fout, "\twidth:\t%d\n", graph->width); if (graph->height != G_HEIGHT) fprintf (fout, "\theight:\t%d\n", graph->height); if (graph->borderwidth != G_BORDERWIDTH) fprintf (fout, "\tborderwidth:\t%d\n", graph->borderwidth); if (graph->x != G_X) fprintf (fout, "\tx:\t%d\n", graph->x); if (graph->y != G_Y) fprintf (fout, "\ty:\t%d\n", graph->y); if (graph->folding != G_FOLDING) fprintf (fout, "\tfolding:\t%d\n", graph->folding); if (graph->shrink != G_SHRINK) fprintf (fout, "\tshrink:\t%d\n", graph->shrink); if (graph->stretch != G_STRETCH) fprintf (fout, "\tstretch:\t%d\n", graph->stretch); if (graph->textmode != G_TEXTMODE) fprintf (fout, "\ttextmode:\t%s\n", get_textmode_str (graph->textmode)); if (graph->shape != G_SHAPE) fprintf (fout, "\tshape:\t%s\n", get_shape_str (graph->shape)); if (graph->vertical_order != G_VERTICAL_ORDER) fprintf (fout, "\tvertical_order:\t%d\n", graph->vertical_order); if (graph->horizontal_order != G_HORIZONTAL_ORDER) fprintf (fout, "\thorizontal_order:\t%d\n", graph->horizontal_order); if (graph->xmax != G_XMAX) fprintf (fout, "\txmax:\t%d\n", graph->xmax); if (graph->ymax != G_YMAX) fprintf (fout, "\tymax:\t%d\n", graph->ymax); if (graph->xbase != G_XBASE) fprintf (fout, "\txbase:\t%d\n", graph->xbase); if (graph->ybase != G_YBASE) fprintf (fout, "\tybase:\t%d\n", graph->ybase); if (graph->xspace != G_XSPACE) fprintf (fout, "\txspace:\t%d\n", graph->xspace); if (graph->yspace != G_YSPACE) fprintf (fout, "\tyspace:\t%d\n", graph->yspace); if (graph->xlspace != G_XLSPACE) fprintf (fout, "\txlspace:\t%d\n", graph->xlspace); if (graph->xraster != G_XRASTER) fprintf (fout, "\txraster:\t%d\n", graph->xraster); if (graph->yraster != G_YRASTER) fprintf (fout, "\tyraster:\t%d\n", graph->yraster); if (graph->xlraster != G_XLRASTER) fprintf (fout, "\txlraster:\t%d\n", graph->xlraster); if (graph->hidden != G_HIDDEN) fprintf (fout, "\thidden:\t%d\n", graph->hidden); /* FIXME: Unallocate struct list if required. Maybe with a little function. */ if (graph->classname != G_CLASSNAME) { struct classname_s *ite; for (ite = graph->classname; ite; ite = ite->next) fprintf (fout, "\tclassname %d :\t%s\n", ite->no, ite->name); } if (graph->infoname != G_INFONAME) { struct infoname_s *ite; for (ite = graph->infoname; ite; ite = ite->next) fprintf (fout, "\tinfoname %d :\t%s\n", ite->integer, ite->string); } if (graph->colorentry != G_COLORENTRY) { struct colorentry_s *ite; for (ite = graph->colorentry; ite; ite = ite->next) { fprintf (fout, "\tcolorentry %d :\t%d %d %d\n", ite->color_index, ite->red_cp, ite->green_cp, ite->blue_cp); } } if (graph->layoutalgorithm != G_LAYOUTALGORITHM) fprintf (fout, "\tlayoutalgorithm:\t%s\n", get_layoutalgorithm_str(graph->layoutalgorithm)); if (graph->layout_downfactor != G_LAYOUT_DOWNFACTOR) fprintf (fout, "\tlayout_downfactor:\t%d\n", graph->layout_downfactor); if (graph->layout_upfactor != G_LAYOUT_UPFACTOR) fprintf (fout, "\tlayout_upfactor:\t%d\n", graph->layout_upfactor); if (graph->layout_nearfactor != G_LAYOUT_NEARFACTOR) fprintf (fout, "\tlayout_nearfactor:\t%d\n", graph->layout_nearfactor); if (graph->layout_splinefactor != G_LAYOUT_SPLINEFACTOR) fprintf (fout, "\tlayout_splinefactor:\t%d\n", graph->layout_splinefactor); if (graph->late_edge_labels != G_LATE_EDGE_LABELS) fprintf (fout, "\tlate_edge_labels:\t%s\n", get_decision_str(graph->late_edge_labels)); if (graph->display_edge_labels != G_DISPLAY_EDGE_LABELS) fprintf (fout, "\tdisplay_edge_labels:\t%s\n", get_decision_str(graph->display_edge_labels)); if (graph->dirty_edge_labels != G_DIRTY_EDGE_LABELS) fprintf (fout, "\tdirty_edge_labels:\t%s\n", get_decision_str(graph->dirty_edge_labels)); if (graph->finetuning != G_FINETUNING) fprintf (fout, "\tfinetuning:\t%s\n", get_decision_str(graph->finetuning)); if (graph->ignore_singles != G_IGNORE_SINGLES) fprintf (fout, "\tignore_singles:\t%s\n", get_decision_str(graph->ignore_singles)); if (graph->straight_phase != G_STRAIGHT_PHASE) fprintf (fout, "\tstraight_phase:\t%s\n", get_decision_str(graph->straight_phase)); if (graph->priority_phase != G_PRIORITY_PHASE) fprintf (fout, "\tpriority_phase:\t%s\n", get_decision_str(graph->priority_phase)); if (graph->manhattan_edges != G_MANHATTAN_EDGES) fprintf (fout, "\tmanhattan_edges:\t%s\n", get_decision_str(graph->manhattan_edges)); if (graph->smanhattan_edges != G_SMANHATTAN_EDGES) fprintf (fout, "\tsmanhattan_edges:\t%s\n", get_decision_str(graph->smanhattan_edges)); if (graph->near_edges != G_NEAR_EDGES) fprintf (fout, "\tnear_edges:\t%s\n", get_decision_str(graph->near_edges)); if (graph->orientation != G_ORIENTATION) fprintf (fout, "\torientation:\t%s\n", get_orientation_str(graph->orientation)); if (graph->node_alignement != G_NODE_ALIGNEMENT) fprintf (fout, "\tnode_alignement:\t%s\n", get_node_alignement_str(graph->node_alignement)); if (graph->port_sharing != G_PORT_SHARING) fprintf (fout, "\tport_sharing:\t%s\n", get_decision_str(graph->port_sharing)); if (graph->arrow_mode != G_ARROW_MODE) fprintf (fout, "\tarrow_mode:\t%s\n", get_arrow_mode_str(graph->arrow_mode)); if (graph->treefactor != G_TREEFACTOR) fprintf (fout, "\ttreefactor:\t%f\n", graph->treefactor); if (graph->spreadlevel != G_SPREADLEVEL) fprintf (fout, "\tspreadlevel:\t%d\n", graph->spreadlevel); if (graph->crossing_weight != G_CROSSING_WEIGHT) fprintf (fout, "\tcrossing_weight:\t%s\n", get_crossing_type_str(graph->crossing_weight)); if (graph->crossing_phase2 != G_CROSSING_PHASE2) fprintf (fout, "\tcrossing_phase2:\t%s\n", get_decision_str(graph->crossing_phase2)); if (graph->crossing_optimization != G_CROSSING_OPTIMIZATION) fprintf (fout, "\tcrossing_optimization:\t%s\n", get_decision_str(graph->crossing_optimization)); if (graph->view != G_VIEW) fprintf (fout, "\tview:\t%s\n", get_view_str(graph->view)); if (graph->edges != G_EDGES) fprintf (fout, "\tedges:\t%s\n", get_decision_str(graph->edges)); if (graph->nodes != G_NODES) fprintf (fout,"\tnodes:\t%s\n", get_decision_str(graph->nodes)); if (graph->splines != G_SPLINES) fprintf (fout, "\tsplines:\t%s\n", get_decision_str(graph->splines)); if (graph->bmax != G_BMAX) fprintf (fout, "\tbmax:\t%d\n", graph->bmax); if (graph->cmin != G_CMIN) fprintf (fout, "\tcmin:\t%d\n", graph->cmin); if (graph->cmax != G_CMAX) fprintf (fout, "\tcmax:\t%d\n", graph->cmax); if (graph->pmin != G_PMIN) fprintf (fout, "\tpmin:\t%d\n", graph->pmin); if (graph->pmax != G_PMAX) fprintf (fout, "\tpmax:\t%d\n", graph->pmax); if (graph->rmin != G_RMIN) fprintf (fout, "\trmin:\t%d\n", graph->rmin); if (graph->rmax != G_RMAX) fprintf (fout, "\trmax:\t%d\n", graph->rmax); if (graph->smax != G_SMAX) fprintf (fout, "\tsmax:\t%d\n", graph->smax); }