]> git.saurik.com Git - bison.git/blame - src/vcg.c
* po/sv.po: New.
[bison.git] / src / vcg.c
CommitLineData
ce4d5ce0
AD
1/* VCG description handler for Bison.
2 Copyright 2001 Free Software Foundation, Inc.
3
4 This file is part of Bison, the GNU Compiler Compiler.
5
6 Bison is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
9 any later version.
10
11 Bison is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with Bison; see the file COPYING. If not, write to
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
20
21#include "system.h"
22#include "vcg.h"
23#include "vcg_defaults.h"
08a946e0
AD
24#include "quotearg.h"
25
26/* Return an unambiguous printable representated, allocated in slot 0,
27 for NAME, suitable for C strings. */
28static char const *
29quote (char const *name)
30{
31 return quotearg_n_style (0, c_quoting_style, name);
32}
33
ce4d5ce0
AD
34
35/* Initialize a graph with the default values. */
36void
37new_graph (graph_t *g)
38{
39 g->title = G_TITLE;
40 g->label = G_LABEL;
3e3da797 41
ce4d5ce0
AD
42 g->infos[0] = G_INFOS1;
43 g->infos[1] = G_INFOS2;
44 g->infos[2] = G_INFOS3;
3e3da797 45
ce4d5ce0
AD
46 g->color = G_COLOR;
47 g->textcolor = G_TEXTCOLOR;
48 g->bordercolor = G_BORDERCOLOR;
3e3da797 49
ce4d5ce0
AD
50 g->width = G_WIDTH;
51 g->height = G_HEIGHT;
52 g->borderwidth = G_BORDERWIDTH;
53 g->x = G_X;
54 g->y = G_Y;
55 g->folding = G_FOLDING;
56 g->shrink = G_SHRINK;
57 g->stretch = G_STRETCH;
58
59 g->textmode = G_TEXTMODE;
60 g->shape = G_SHAPE;
3e3da797 61
342b8b6e
AD
62 g->vertical_order = G_VERTICAL_ORDER;
63 g->horizontal_order = G_HORIZONTAL_ORDER;
64
ce4d5ce0
AD
65 g->xmax = G_XMAX; /* Not output. */
66 g->ymax = G_YMAX; /* Not output. */
3e3da797 67
ce4d5ce0
AD
68 g->xbase = G_XBASE;
69 g->ybase = G_YBASE;
70
71 g->xspace = G_XSPACE;
72 g->yspace = G_YSPACE;
73 g->xlspace = G_XLSPACE; /* Not output. */
3e3da797 74
ce4d5ce0
AD
75 g->xraster = G_XRASTER;
76 g->yraster = G_YRASTER;
77 g->xlraster = G_XLRASTER;
78
79 g->hidden = G_HIDDEN; /* No default value. */
80
81 g->classname = G_CLASSNAME; /* No class name association. */
3e3da797 82
ce4d5ce0
AD
83 g->layoutalgorithm = G_LAYOUTALGORITHM;
84 g->layout_downfactor = G_LAYOUT_DOWNFACTOR;
85 g->layout_upfactor = G_LAYOUT_UPFACTOR;
86 g->layout_nearfactor = G_LAYOUT_NEARFACTOR;
87 g->layout_splinefactor = G_LAYOUT_SPLINEFACTOR;
3e3da797 88
ce4d5ce0
AD
89 g->late_edge_labels = G_LATE_EDGE_LABELS;
90 g->display_edge_labels = G_DISPLAY_EDGE_LABELS;
91 g->dirty_edge_labels = G_DIRTY_EDGE_LABELS;
92 g->finetuning = G_FINETUNING;
93 g->ignore_singles = G_IGNORE_SINGLES;
94 g->straight_phase = G_STRAIGHT_PHASE;
95 g->priority_phase = G_PRIORITY_PHASE;
96 g->manhattan_edges = G_MANHATTAN_EDGES;
97 g->smanhattan_edges = G_SMANHATTAN_EDGES;
98 g->near_edges = G_NEAR_EDGES;
3e3da797 99
ce4d5ce0
AD
100 g->orientation = G_ORIENTATION;
101 g->node_alignement = G_NODE_ALIGNEMENT;
102 g->port_sharing = G_PORT_SHARING;
103 g->arrow_mode = G_ARROW_MODE;
104 g->treefactor = G_TREEFACTOR;
105 g->spreadlevel = G_SPREADLEVEL;
106 g->crossing_weight = G_CROSSING_WEIGHT;
107 g->crossing_phase2 = G_CROSSING_PHASE2;
108 g->crossing_optimization = G_CROSSING_OPTIMIZATION;
109 g->view = G_VIEW;
110
111 g->edges = G_EDGES;
112 g->nodes = G_NODES;
113 g->splines = G_SPLINES;
114
115 g->bmax = G_BMAX;
116 g->cmin = G_CMIN;
117 g->cmax = G_CMAX;
118 g->pmin = G_PMIN;
119 g->pmax = G_PMAX;
120 g->rmin = G_RMIN;
121 g->rmax = G_RMAX;
122 g->smax = G_SMAX;
3e3da797 123
ce4d5ce0
AD
124 g->node_list = G_NODE_LIST;
125 g->edge_list = G_EDGE_LIST;
3e3da797 126
ce4d5ce0
AD
127 new_edge(&g->edge);
128 new_node(&g->node);
129}
130
131/* Initialize a node with the defalut values. */
132void
133new_node (node_t *node)
134{
135 node->title = N_TITLE;
136 node->label = N_LABEL;
3e3da797 137
ce4d5ce0
AD
138 node->locx = N_LOCX; /* Default unspcified. */
139 node->locy = N_LOCY; /* Default unspcified. */
3e3da797 140
ce4d5ce0
AD
141 node->vertical_order = N_VERTICAL_ORDER; /* Default unspcified. */
142 node->horizontal_order = N_HORIZONTAL_ORDER; /* Default unspcified. */
3e3da797 143
ce4d5ce0
AD
144 node->width = N_WIDTH; /* We assume that we can't define it now. */
145 node->height = N_HEIGHT; /* Also. */
3e3da797 146
ce4d5ce0
AD
147 node->shrink = N_SHRINK;
148 node->stretch = N_STRETCH;
3e3da797 149
ce4d5ce0 150 node->folding = N_FOLDING; /* No explicit default value. */
3e3da797 151
ce4d5ce0
AD
152 node->shape = N_SHAPE;
153 node->textmode = N_TEXTMODE;
154 node->borderwidth = N_BORDERWIDTH;
3e3da797 155
ce4d5ce0
AD
156 node->color = N_COLOR;
157 node->textcolor = N_TEXTCOLOR;
158 node->bordercolor = N_BORDERCOLOR;
3e3da797 159
ce4d5ce0
AD
160 node->infos[0] = N_INFOS1;
161 node->infos[1] = N_INFOS2;
162 node->infos[2] = N_INFOS3;
3e3da797 163
ce4d5ce0
AD
164 node->next = N_NEXT;
165}
166
167/* Initialize a edge with the defalut values. */
168void
169new_edge (edge_t *edge)
170{
171 edge->type = E_EDGE_TYPE;
172
173 edge->sourcename = E_SOURCENAME;
174 edge->targetname = E_TARGETNAME;
175 edge->label = E_LABEL;
176
177 edge->linestyle = E_LINESTYLE;
178 edge->thickness = E_THICKNESS;
179
180 edge->class = E_CLASS;
181
182 edge->color = E_COLOR;
183 edge->textcolor = E_TEXTCOLOR;
184 edge->arrowcolor = E_ARROWCOLOR;
185 edge->backarrowcolor = E_BACKARROWCOLOR;
186
187 edge->arrowsize = E_ARROWSIZE;
188 edge->backarrowsize = E_BACKARROWSIZE;
189 edge->arrowstyle = E_ARROWSTYLE;
190
191 edge->backarrowstyle = E_BACKARROWSTYLE;
192
193 edge->priority = E_PRIORITY;
194
195 edge->anchor = E_ANCHOR;
196
197 edge->horizontal_order = E_HORIZONTAL_ORDER;
198
199 edge->next = E_NEXT;
200}
201
202/*----------------------------------------------.
203| Get functions. |
204| Return string corresponding to an enum value. |
205`----------------------------------------------*/
206
207static const char *
208get_color_str (enum color_e c)
209{
210 switch (c)
211 {
3e3da797
AD
212 case white: return "white";
213 case blue: return "blue";
214 case red: return "red";
215 case green: return "green";
216 case yellow: return "yellow";
217 case magenta: return "magenta";
218 case cyan: return "cyan";
219 case darkgrey: return "darkgrey";
220 case darkblue: return "darkblue";
221 case darkred: return "darkred";
222 case darkgreen: return "darkgreen";
223 case darkyellow: return "darkyellow";
224 case darkmagenta: return "darkmagenta";
225 case darkcyan: return "darkcyan";
226 case gold: return "gold";
227 case lightgrey: return "lightgrey";
228 case lightblue: return "lightblue";
229 case lightred: return "lightred";
230 case lightgreen: return "lightgreen";
231 case lightyellow: return "lightyellow";
232 case lightmagenta: return "lightmagenta";
233 case lightcyan: return "lightcyan";
234 case lilac: return "lilac";
235 case turquoise: return "turquoise";
236 case aquamarine: return "aquamarine";
237 case khaki: return "khaki";
238 case purple: return "purple";
239 case yellowgreen: return "yellowgreen";
240 case pink: return "pink";
241 case orange: return "orange";
242 case orchid: return "orchid";
243 case black: return "black";
ce4d5ce0 244 default:
342b8b6e 245 assert (!"Not a default color.");
ce4d5ce0
AD
246 }
247 return NULL;
248}
249
250static const char *
251get_textmode_str (enum textmode_e t)
252{
253 switch (t)
254 {
3e3da797
AD
255 case centered: return "center";
256 case left_justify: return "left_justify";
257 case right_justify: return "right_justify";
ce4d5ce0 258 default:
342b8b6e 259 assert (!"Not a text mode.");
ce4d5ce0
AD
260 }
261 return NULL;
262}
263
264static const char *
265get_shape_str (enum shape_e s)
266{
267 switch (s)
268 {
3e3da797
AD
269 case box: return "box";
270 case rhomb: return "rhomb";
271 case ellipse: return "ellipse";
272 case triangle: return "triangle";
ce4d5ce0 273 default:
342b8b6e 274 assert (!"Not a shape.");
ce4d5ce0
AD
275 }
276 return NULL;
277}
278
279static const char *
280get_layoutalgorithm_str (enum layoutalgorithm_e l)
281{
282 switch (l)
283 {
3e3da797
AD
284 case normal: return "normal";
285 case maxdepth: return "maxdepth";
286 case mindepth: return "mindepth";
287 case maxdepthslow: return "maxdepthslow";
288 case mindepthslow: return "mindepthslow";
289 case maxdegree: return "maxdegree";
290 case mindegree: return "mindegree";
291 case maxindegree: return "maxindegree";
292 case minindegree: return "minindegree";
293 case maxoutdegree: return "maxoutdegree";
294 case minoutdegree: return "minoutdegree";
295 case minbackward: return "minbackward";
296 case dfs: return "dfs";
297 case tree: return "tree";
298 default:
342b8b6e 299 assert (!"Not a layout algorithm.");
ce4d5ce0
AD
300 }
301 return NULL;
302}
303
304static const char *
342b8b6e 305get_decision_str (enum decision_e d)
ce4d5ce0
AD
306{
307 switch (d)
308 {
3e3da797
AD
309 case no: return "no";
310 case yes: return "yes";
ce4d5ce0 311 default:
342b8b6e 312 assert (!"Either yes nor no.");
ce4d5ce0
AD
313 }
314 return NULL;
315}
316
317static const char *
318get_orientation_str (enum orientation_e o)
319{
320 switch (o)
321 {
3e3da797
AD
322 case top_to_bottom: return "top_to_bottom";
323 case bottom_to_top: return "bottom_to_top";
324 case left_to_right: return "left_to_right";
325 case right_to_left: return "right_to_left";
ce4d5ce0 326 default:
342b8b6e 327 assert (!"Not an orientation.");
ce4d5ce0
AD
328 }
329 return NULL;
330}
331
332static const char *
333get_node_alignement_str (enum alignement_e a)
334{
335 switch (a)
336 {
3e3da797
AD
337 case center: return "center";
338 case top: return "top";
339 case bottom: return "bottom";
ce4d5ce0 340 default:
342b8b6e 341 assert (!"Not an alignement.");
ce4d5ce0
AD
342 }
343 return NULL;
344}
345
346static const char *
347get_arrow_mode_str (enum arrow_mode_e a)
348{
349 switch (a)
350 {
3e3da797
AD
351 case fixed: return "fixed";
352 case free_a: return "free";
ce4d5ce0 353 default:
342b8b6e 354 assert (!"Not an arrow mode.");
ce4d5ce0
AD
355 }
356 return NULL;
357}
358
359static const char *
360get_crossing_type_str (enum crossing_type_e c)
361{
362 switch (c)
363 {
3e3da797
AD
364 case bary: return "bary";
365 case median: return "median";
366 case barymedian: return "barymedian";
367 case medianbary: return "medianbary";
ce4d5ce0 368 default:
342b8b6e 369 assert (!"Not a crossing type.");
3e3da797 370 }
ce4d5ce0
AD
371 return NULL;
372}
373
374static const char *
375get_view_str (enum view_e v)
376{
377 switch (v)
378 {
3e3da797
AD
379 case normal_view: return "normal_view";
380 case cfish: return "cfish";
381 case pfish: return "pfish";
382 case fcfish: return "fcfish";
383 case fpfish: return "fpfish";
ce4d5ce0 384 default:
342b8b6e 385 assert (!"Not a view.");
ce4d5ce0
AD
386 }
387 return NULL;
388}
389
390static const char *
391get_linestyle_str (enum linestyle_e l)
392{
393 switch (l)
394 {
3e3da797
AD
395 case continuous: return "continuous";
396 case dashed: return "dashed";
397 case dotted: return "dotted";
398 case invisible: return "invisible";
ce4d5ce0 399 default:
342b8b6e 400 assert (!"Not a line style.");
3e3da797 401 }
ce4d5ce0
AD
402 return NULL;
403}
404
405static const char *
406get_arrowstyle_str (enum arrowstyle_e a)
407{
408 switch (a)
409 {
3e3da797
AD
410 case solid: return "solid";
411 case line: return "line";
412 case none: return "none";
ce4d5ce0 413 default:
342b8b6e 414 assert (!"Not an arrow style.");
ce4d5ce0
AD
415 }
416 return NULL;
417}
418
419/*----------------------------.
420| Add functions. |
421| Edge and Nodes int a graph. |
422`----------------------------*/
423
424void
425add_node (graph_t *graph, node_t *node)
426{
427 node->next = graph->node_list;
428 graph->node_list = node;
429}
430
431void
432add_edge (graph_t *graph, edge_t *edge)
433{
434 edge->next = graph->edge_list;
435 graph->edge_list = edge;
436}
437
342b8b6e
AD
438void
439add_classname (graph_t *g, int val, const char *name)
440{
441 struct classname_s *classname;
08a946e0 442
342b8b6e
AD
443 classname = XMALLOC (struct classname_s, 1);
444 classname->no = val;
445 classname->name = name;
446 classname->next = g->classname;
447 g->classname = classname;
448}
449
450void
451add_infoname (graph_t *g, int integer, const char *string)
452{
453 struct infoname_s *infoname;
08a946e0 454
342b8b6e
AD
455 infoname = XMALLOC (struct infoname_s, 1);
456 infoname->integer = integer;
457 infoname->string = string;
458 infoname->next = g->infoname;
459 g->infoname = infoname;
460}
461
462/* Build a colorentry struct and add it to the list. */
463void
08a946e0 464add_colorentry (graph_t *g, int color_idx, int red_cp,
342b8b6e
AD
465 int green_cp, int blue_cp)
466{
467 struct colorentry_s *ce;
08a946e0 468
342b8b6e
AD
469 ce = XMALLOC (struct colorentry_s, 1);
470 ce->color_index = color_idx;
471 ce->red_cp = red_cp;
472 ce->green_cp = green_cp;
473 ce->blue_cp = blue_cp;
474 ce->next = g->colorentry;
475 g->colorentry = ce;
476}
477
ce4d5ce0
AD
478/*-------------------------------------.
479| Open and close functions (formatted) |
480`-------------------------------------*/
481
482void
342b8b6e 483open_edge(edge_t *edge, FILE *fout)
ce4d5ce0
AD
484{
485 switch (edge->type)
486 {
487 case normal_edge:
342b8b6e 488 fputs ("\tedge: {\n", fout);
ce4d5ce0
AD
489 break;
490 case back_edge:
342b8b6e 491 fputs ("\tbackedge: {\n", fout);
ce4d5ce0
AD
492 break;
493 case near_edge:
342b8b6e 494 fputs ("\tnearedge: {\n", fout);
ce4d5ce0
AD
495 break;
496 case bent_near_edge:
342b8b6e 497 fputs ("\tbentnearedge: {\n", fout);
3e3da797 498 break;
ce4d5ce0 499 default:
342b8b6e 500 fputs ("\tedge: {\n", fout);
3e3da797 501 }
ce4d5ce0
AD
502}
503
504void
342b8b6e 505close_edge(FILE *fout)
ce4d5ce0 506{
342b8b6e 507 fputs ("\t}\n", fout);
ce4d5ce0
AD
508}
509
510void
342b8b6e 511open_node(FILE *fout)
ce4d5ce0 512{
342b8b6e 513 fputs ("\tnode: {\n", fout);
ce4d5ce0
AD
514}
515
516void
342b8b6e 517close_node(FILE *fout)
3e3da797 518{
342b8b6e 519 fputs ("\t}\n", fout);
ce4d5ce0
AD
520}
521
522void
342b8b6e 523open_graph(FILE *fout)
ce4d5ce0 524{
342b8b6e 525 fputs ("graph: {\n", fout);
ce4d5ce0
AD
526}
527
528void
342b8b6e 529close_graph(graph_t *graph, FILE *fout)
ce4d5ce0 530{
342b8b6e 531 fputc ('\n', fout);
ce4d5ce0 532
342b8b6e 533 /* FIXME: Unallocate nodes and edges if required. */
ce4d5ce0
AD
534 {
535 node_t *node;
3e3da797 536
ce4d5ce0
AD
537 for (node = graph->node_list; node; node = node->next)
538 {
342b8b6e
AD
539 open_node (fout);
540 output_node (node, fout);
541 close_node (fout);
ce4d5ce0
AD
542 }
543 }
3e3da797 544
342b8b6e 545 fputc ('\n', fout);
3e3da797 546
ce4d5ce0
AD
547 {
548 edge_t *edge;
3e3da797 549
ce4d5ce0 550 for (edge = graph->edge_list; edge; edge = edge->next)
3e3da797 551 {
342b8b6e
AD
552 open_edge (edge, fout);
553 output_edge (edge, fout);
554 close_edge (fout);
ce4d5ce0
AD
555 }
556 }
3e3da797 557
342b8b6e 558 fputs ("}\n", fout);
3e3da797
AD
559}
560
ce4d5ce0 561/*-------------------------------------------.
342b8b6e 562| Output functions (formatted) in file FOUT |
ce4d5ce0
AD
563`-------------------------------------------*/
564
565void
342b8b6e 566output_node (node_t *node, FILE *fout)
ce4d5ce0
AD
567{
568 if (node->title != N_TITLE)
08a946e0 569 fprintf (fout, "\t\ttitle:\t%s\n", quote (node->title));
ce4d5ce0 570 if (node->label != N_LABEL)
08a946e0 571 fprintf (fout, "\t\tlabel:\t%s\n", quote (node->label));
ce4d5ce0
AD
572
573 if ((node->locx != N_LOCX) && (node->locy != N_LOCY))
342b8b6e 574 fprintf (fout, "\t\tloc { x: %d y: %d }\t\n", node->locx, node->locy);
3e3da797 575
ce4d5ce0 576 if (node->vertical_order != N_VERTICAL_ORDER)
342b8b6e 577 fprintf (fout, "\t\tvertical_order:\t%d\n", node->vertical_order);
ce4d5ce0 578 if (node->horizontal_order != N_HORIZONTAL_ORDER)
342b8b6e 579 fprintf (fout, "\t\thorizontal_order:\t%d\n", node->horizontal_order);
3e3da797 580
ce4d5ce0 581 if (node->width != N_WIDTH)
342b8b6e 582 fprintf (fout, "\t\twidth:\t%d\n", node->width);
ce4d5ce0 583 if (node->height != N_HEIGHT)
342b8b6e 584 fprintf (fout, "\t\theight:\t%d\n", node->height);
3e3da797 585
ce4d5ce0 586 if (node->shrink != N_SHRINK)
342b8b6e 587 fprintf (fout, "\t\tshrink:\t%d\n", node->shrink);
ce4d5ce0 588 if (node->stretch != N_STRETCH)
342b8b6e 589 fprintf (fout, "\t\tstretch:\t%d\n", node->stretch);
3e3da797 590
ce4d5ce0 591 if (node->folding != N_FOLDING)
342b8b6e 592 fprintf (fout, "\t\tfolding:\t%d\n", node->folding);
3e3da797 593
ce4d5ce0 594 if (node->textmode != N_TEXTMODE)
342b8b6e
AD
595 fprintf (fout, "\t\ttextmode:\t%s\n",
596 get_textmode_str (node->textmode));
3e3da797 597
ce4d5ce0 598 if (node->shape != N_SHAPE)
342b8b6e 599 fprintf (fout, "\t\tshape:\t%s\n", get_shape_str (node->shape));
3e3da797 600
ce4d5ce0 601 if (node->borderwidth != N_BORDERWIDTH)
342b8b6e 602 fprintf (fout, "\t\tborderwidth:\t%d\n", node->borderwidth);
3e3da797 603
ce4d5ce0 604 if (node->color != N_COLOR)
342b8b6e 605 fprintf (fout, "\t\tcolor:\t%s\n", get_color_str (node->color));
ce4d5ce0 606 if (node->textcolor != N_TEXTCOLOR)
342b8b6e
AD
607 fprintf (fout, "\t\ttextcolor:\t%s\n",
608 get_color_str (node->textcolor));
ce4d5ce0 609 if (node->bordercolor != N_BORDERCOLOR)
342b8b6e
AD
610 fprintf (fout, "\t\tbordercolor:\t%s\n",
611 get_color_str (node->bordercolor));
3e3da797 612
08a946e0
AD
613 {
614 int i;
615 for (i = 0; i < 3; ++i)
616 if (node->infos[i])
617 fprintf (fout, "\t\tinfo%d:\t%s\n",
618 i, quote (node->infos[i]));
619 }
ce4d5ce0
AD
620}
621
622void
342b8b6e 623output_edge (edge_t *edge, FILE *fout)
ce4d5ce0 624{
600cad3b
MA
625 /* FIXME: SOURCENAME and TARGETNAME are mandatory
626 so it has to be fatal not to give these informations. */
ce4d5ce0 627 if (edge->sourcename != E_SOURCENAME)
08a946e0 628 fprintf (fout, "\t\tsourcename:\t%s\n", quote (edge->sourcename));
ce4d5ce0 629 if (edge->targetname != E_TARGETNAME)
08a946e0 630 fprintf (fout, "\t\ttargetname:\t%s\n", quote (edge->targetname));
3e3da797 631
ce4d5ce0 632 if (edge->label != E_LABEL)
08a946e0 633 fprintf (fout, "\t\tlabel:\t%s\n", quote (edge->label));
ce4d5ce0
AD
634
635 if (edge->linestyle != E_LINESTYLE)
08a946e0
AD
636 fprintf (fout, "\t\tlinestyle:\t%s\n",
637 quote (get_linestyle_str(edge->linestyle)));
3e3da797 638
ce4d5ce0 639 if (edge->thickness != E_THICKNESS)
342b8b6e 640 fprintf (fout, "\t\tthickness:\t%d\n", edge->thickness);
ce4d5ce0 641 if (edge->class != E_CLASS)
342b8b6e 642 fprintf (fout, "\t\tclass:\t%d\n", edge->class);
ce4d5ce0
AD
643
644 if (edge->color != E_COLOR)
342b8b6e 645 fprintf (fout, "\t\tcolor:\t%s\n", get_color_str (edge->color));
ce4d5ce0 646 if (edge->color != E_TEXTCOLOR)
342b8b6e
AD
647 fprintf (fout, "\t\ttextcolor:\t%s\n",
648 get_color_str (edge->textcolor));
ce4d5ce0 649 if (edge->arrowcolor != E_ARROWCOLOR)
342b8b6e
AD
650 fprintf (fout, "\t\tarrowcolor:\t%s\n",
651 get_color_str (edge->arrowcolor));
ce4d5ce0 652 if (edge->backarrowcolor != E_BACKARROWCOLOR)
342b8b6e
AD
653 fprintf (fout, "\t\tbackarrowcolor:\t%s\n",
654 get_color_str (edge->backarrowcolor));
ce4d5ce0
AD
655
656 if (edge->arrowsize != E_ARROWSIZE)
342b8b6e 657 fprintf (fout, "\t\tarrowsize:\t%d\n", edge->arrowsize);
ce4d5ce0 658 if (edge->backarrowsize != E_BACKARROWSIZE)
342b8b6e 659 fprintf (fout, "\t\tbackarrowsize:\t%d\n", edge->backarrowsize);
3e3da797 660
ce4d5ce0 661 if (edge->arrowstyle != E_ARROWSTYLE)
342b8b6e
AD
662 fprintf (fout, "\t\tarrowstyle:\t%s\n",
663 get_arrowstyle_str(edge->arrowstyle));
ce4d5ce0 664 if (edge->backarrowstyle != E_BACKARROWSTYLE)
342b8b6e
AD
665 fprintf (fout, "\t\tbackarrowstyle:\t%s\n",
666 get_arrowstyle_str(edge->backarrowstyle));
3e3da797 667
ce4d5ce0 668 if (edge->priority != E_PRIORITY)
342b8b6e 669 fprintf (fout, "\t\tpriority:\t%d\n", edge->priority);
ce4d5ce0 670 if (edge->anchor != E_ANCHOR)
342b8b6e 671 fprintf (fout, "\t\tanchor:\t%d\n", edge->anchor);
ce4d5ce0 672 if (edge->horizontal_order != E_HORIZONTAL_ORDER)
342b8b6e 673 fprintf (fout, "\t\thorizontal_order:\t%d\n", edge->horizontal_order);
ce4d5ce0
AD
674}
675
676void
342b8b6e 677output_graph (graph_t *graph, FILE *fout)
ce4d5ce0
AD
678{
679 if (graph->title)
08a946e0 680 fprintf (fout, "\ttitle:\t%s\n", quote (graph->title));
ce4d5ce0 681 if (graph->label)
08a946e0 682 fprintf (fout, "\tlabel:\t%s\n", quote (graph->label));
3e3da797 683
08a946e0
AD
684 {
685 int i;
686 for (i = 0; i < 3; ++i)
687 if (graph->infos[i])
688 fprintf (fout, "\tinfo%d:\t%s\n", i, quote (graph->infos[i]));
689 }
3e3da797 690
ce4d5ce0 691 if (graph->color != G_COLOR)
342b8b6e 692 fprintf (fout, "\tcolor:\t%s\n", get_color_str (graph->color));
ce4d5ce0 693 if (graph->textcolor != G_TEXTCOLOR)
342b8b6e 694 fprintf (fout, "\ttextcolor:\t%s\n", get_color_str (graph->textcolor));
ce4d5ce0 695 if (graph->bordercolor != G_BORDERCOLOR)
342b8b6e
AD
696 fprintf (fout, "\tbordercolor:\t%s\n",
697 get_color_str (graph->bordercolor));
3e3da797 698
ce4d5ce0 699 if (graph->width != G_WIDTH)
342b8b6e 700 fprintf (fout, "\twidth:\t%d\n", graph->width);
ce4d5ce0 701 if (graph->height != G_HEIGHT)
342b8b6e 702 fprintf (fout, "\theight:\t%d\n", graph->height);
ce4d5ce0 703 if (graph->borderwidth != G_BORDERWIDTH)
342b8b6e 704 fprintf (fout, "\tborderwidth:\t%d\n", graph->borderwidth);
3e3da797 705
ce4d5ce0 706 if (graph->x != G_X)
342b8b6e 707 fprintf (fout, "\tx:\t%d\n", graph->x);
ce4d5ce0 708 if (graph->y != G_Y)
342b8b6e 709 fprintf (fout, "\ty:\t%d\n", graph->y);
ce4d5ce0
AD
710
711 if (graph->folding != G_FOLDING)
342b8b6e 712 fprintf (fout, "\tfolding:\t%d\n", graph->folding);
ce4d5ce0
AD
713
714 if (graph->shrink != G_SHRINK)
342b8b6e 715 fprintf (fout, "\tshrink:\t%d\n", graph->shrink);
ce4d5ce0 716 if (graph->stretch != G_STRETCH)
342b8b6e 717 fprintf (fout, "\tstretch:\t%d\n", graph->stretch);
3e3da797 718
ce4d5ce0 719 if (graph->textmode != G_TEXTMODE)
342b8b6e
AD
720 fprintf (fout, "\ttextmode:\t%s\n",
721 get_textmode_str (graph->textmode));
3e3da797 722
ce4d5ce0 723 if (graph->shape != G_SHAPE)
342b8b6e 724 fprintf (fout, "\tshape:\t%s\n", get_shape_str (graph->shape));
08a946e0 725
342b8b6e 726 if (graph->vertical_order != G_VERTICAL_ORDER)
08a946e0 727 fprintf (fout, "\tvertical_order:\t%d\n", graph->vertical_order);
342b8b6e 728 if (graph->horizontal_order != G_HORIZONTAL_ORDER)
08a946e0 729 fprintf (fout, "\thorizontal_order:\t%d\n", graph->horizontal_order);
3e3da797 730
ce4d5ce0 731 if (graph->xmax != G_XMAX)
342b8b6e 732 fprintf (fout, "\txmax:\t%d\n", graph->xmax);
ce4d5ce0 733 if (graph->ymax != G_YMAX)
342b8b6e 734 fprintf (fout, "\tymax:\t%d\n", graph->ymax);
3e3da797 735
ce4d5ce0 736 if (graph->xbase != G_XBASE)
342b8b6e 737 fprintf (fout, "\txbase:\t%d\n", graph->xbase);
ce4d5ce0 738 if (graph->ybase != G_YBASE)
342b8b6e 739 fprintf (fout, "\tybase:\t%d\n", graph->ybase);
ce4d5ce0
AD
740
741 if (graph->xspace != G_XSPACE)
342b8b6e 742 fprintf (fout, "\txspace:\t%d\n", graph->xspace);
ce4d5ce0 743 if (graph->yspace != G_YSPACE)
342b8b6e 744 fprintf (fout, "\tyspace:\t%d\n", graph->yspace);
ce4d5ce0 745 if (graph->xlspace != G_XLSPACE)
342b8b6e 746 fprintf (fout, "\txlspace:\t%d\n", graph->xlspace);
3e3da797 747
ce4d5ce0 748 if (graph->xraster != G_XRASTER)
342b8b6e 749 fprintf (fout, "\txraster:\t%d\n", graph->xraster);
ce4d5ce0 750 if (graph->yraster != G_YRASTER)
342b8b6e 751 fprintf (fout, "\tyraster:\t%d\n", graph->yraster);
ce4d5ce0 752 if (graph->xlraster != G_XLRASTER)
342b8b6e 753 fprintf (fout, "\txlraster:\t%d\n", graph->xlraster);
ce4d5ce0
AD
754
755 if (graph->hidden != G_HIDDEN)
342b8b6e 756 fprintf (fout, "\thidden:\t%d\n", graph->hidden);
08a946e0
AD
757
758 /* FIXME: Unallocate struct list if required.
342b8b6e 759 Maybe with a little function. */
ce4d5ce0
AD
760 if (graph->classname != G_CLASSNAME)
761 {
762 struct classname_s *ite;
3e3da797 763
ce4d5ce0 764 for (ite = graph->classname; ite; ite = ite->next)
342b8b6e
AD
765 fprintf (fout, "\tclassname %d :\t%s\n", ite->no, ite->name);
766 }
767
768 if (graph->infoname != G_INFONAME)
769 {
770 struct infoname_s *ite;
771
772 for (ite = graph->infoname; ite; ite = ite->next)
773 fprintf (fout, "\tinfoname %d :\t%s\n", ite->integer, ite->string);
774 }
775
776 if (graph->colorentry != G_COLORENTRY)
777 {
778 struct colorentry_s *ite;
08a946e0 779
342b8b6e 780 for (ite = graph->colorentry; ite; ite = ite->next)
08a946e0
AD
781 {
782 fprintf (fout, "\tcolorentry %d :\t%d %d %d\n",
783 ite->color_index,
342b8b6e
AD
784 ite->red_cp,
785 ite->green_cp,
786 ite->blue_cp);
08a946e0 787 }
ce4d5ce0 788 }
3e3da797 789
ce4d5ce0 790 if (graph->layoutalgorithm != G_LAYOUTALGORITHM)
342b8b6e
AD
791 fprintf (fout, "\tlayoutalgorithm:\t%s\n",
792 get_layoutalgorithm_str(graph->layoutalgorithm));
3e3da797 793
ce4d5ce0 794 if (graph->layout_downfactor != G_LAYOUT_DOWNFACTOR)
342b8b6e 795 fprintf (fout, "\tlayout_downfactor:\t%d\n", graph->layout_downfactor);
ce4d5ce0 796 if (graph->layout_upfactor != G_LAYOUT_UPFACTOR)
342b8b6e 797 fprintf (fout, "\tlayout_upfactor:\t%d\n", graph->layout_upfactor);
ce4d5ce0 798 if (graph->layout_nearfactor != G_LAYOUT_NEARFACTOR)
342b8b6e 799 fprintf (fout, "\tlayout_nearfactor:\t%d\n", graph->layout_nearfactor);
ce4d5ce0 800 if (graph->layout_splinefactor != G_LAYOUT_SPLINEFACTOR)
342b8b6e
AD
801 fprintf (fout, "\tlayout_splinefactor:\t%d\n",
802 graph->layout_splinefactor);
3e3da797 803
ce4d5ce0 804 if (graph->late_edge_labels != G_LATE_EDGE_LABELS)
342b8b6e
AD
805 fprintf (fout, "\tlate_edge_labels:\t%s\n",
806 get_decision_str(graph->late_edge_labels));
ce4d5ce0 807 if (graph->display_edge_labels != G_DISPLAY_EDGE_LABELS)
342b8b6e
AD
808 fprintf (fout, "\tdisplay_edge_labels:\t%s\n",
809 get_decision_str(graph->display_edge_labels));
ce4d5ce0 810 if (graph->dirty_edge_labels != G_DIRTY_EDGE_LABELS)
342b8b6e
AD
811 fprintf (fout, "\tdirty_edge_labels:\t%s\n",
812 get_decision_str(graph->dirty_edge_labels));
ce4d5ce0 813 if (graph->finetuning != G_FINETUNING)
342b8b6e
AD
814 fprintf (fout, "\tfinetuning:\t%s\n",
815 get_decision_str(graph->finetuning));
ce4d5ce0 816 if (graph->ignore_singles != G_IGNORE_SINGLES)
342b8b6e
AD
817 fprintf (fout, "\tignore_singles:\t%s\n",
818 get_decision_str(graph->ignore_singles));
ce4d5ce0 819 if (graph->straight_phase != G_STRAIGHT_PHASE)
342b8b6e
AD
820 fprintf (fout, "\tstraight_phase:\t%s\n",
821 get_decision_str(graph->straight_phase));
ce4d5ce0 822 if (graph->priority_phase != G_PRIORITY_PHASE)
342b8b6e
AD
823 fprintf (fout, "\tpriority_phase:\t%s\n",
824 get_decision_str(graph->priority_phase));
ce4d5ce0 825 if (graph->manhattan_edges != G_MANHATTAN_EDGES)
342b8b6e
AD
826 fprintf (fout,
827 "\tmanhattan_edges:\t%s\n",
828 get_decision_str(graph->manhattan_edges));
ce4d5ce0 829 if (graph->smanhattan_edges != G_SMANHATTAN_EDGES)
342b8b6e
AD
830 fprintf (fout,
831 "\tsmanhattan_edges:\t%s\n",
832 get_decision_str(graph->smanhattan_edges));
ce4d5ce0 833 if (graph->near_edges != G_NEAR_EDGES)
342b8b6e
AD
834 fprintf (fout, "\tnear_edges:\t%s\n",
835 get_decision_str(graph->near_edges));
3e3da797 836
ce4d5ce0 837 if (graph->orientation != G_ORIENTATION)
342b8b6e
AD
838 fprintf (fout, "\torientation:\t%s\n",
839 get_orientation_str(graph->orientation));
3e3da797 840
ce4d5ce0 841 if (graph->node_alignement != G_NODE_ALIGNEMENT)
342b8b6e
AD
842 fprintf (fout, "\tnode_alignement:\t%s\n",
843 get_node_alignement_str(graph->node_alignement));
3e3da797 844
ce4d5ce0 845 if (graph->port_sharing != G_PORT_SHARING)
342b8b6e
AD
846 fprintf (fout, "\tport_sharing:\t%s\n",
847 get_decision_str(graph->port_sharing));
3e3da797 848
ce4d5ce0 849 if (graph->arrow_mode != G_ARROW_MODE)
342b8b6e
AD
850 fprintf (fout, "\tarrow_mode:\t%s\n",
851 get_arrow_mode_str(graph->arrow_mode));
3e3da797 852
ce4d5ce0 853 if (graph->treefactor != G_TREEFACTOR)
342b8b6e 854 fprintf (fout, "\ttreefactor:\t%f\n", graph->treefactor);
ce4d5ce0 855 if (graph->spreadlevel != G_SPREADLEVEL)
342b8b6e 856 fprintf (fout, "\tspreadlevel:\t%d\n", graph->spreadlevel);
3e3da797 857
ce4d5ce0 858 if (graph->crossing_weight != G_CROSSING_WEIGHT)
342b8b6e
AD
859 fprintf (fout, "\tcrossing_weight:\t%s\n",
860 get_crossing_type_str(graph->crossing_weight));
ce4d5ce0 861 if (graph->crossing_phase2 != G_CROSSING_PHASE2)
342b8b6e
AD
862 fprintf (fout, "\tcrossing_phase2:\t%s\n",
863 get_decision_str(graph->crossing_phase2));
ce4d5ce0 864 if (graph->crossing_optimization != G_CROSSING_OPTIMIZATION)
342b8b6e
AD
865 fprintf (fout, "\tcrossing_optimization:\t%s\n",
866 get_decision_str(graph->crossing_optimization));
3e3da797 867
ce4d5ce0 868 if (graph->view != G_VIEW)
342b8b6e 869 fprintf (fout, "\tview:\t%s\n", get_view_str(graph->view));
3e3da797 870
ce4d5ce0 871 if (graph->edges != G_EDGES)
342b8b6e 872 fprintf (fout, "\tedges:\t%s\n", get_decision_str(graph->edges));
3e3da797 873
ce4d5ce0 874 if (graph->nodes != G_NODES)
342b8b6e 875 fprintf (fout,"\tnodes:\t%s\n", get_decision_str(graph->nodes));
3e3da797 876
ce4d5ce0 877 if (graph->splines != G_SPLINES)
342b8b6e 878 fprintf (fout, "\tsplines:\t%s\n", get_decision_str(graph->splines));
3e3da797 879
ce4d5ce0 880 if (graph->bmax != G_BMAX)
342b8b6e 881 fprintf (fout, "\tbmax:\t%d\n", graph->bmax);
ce4d5ce0 882 if (graph->cmin != G_CMIN)
342b8b6e 883 fprintf (fout, "\tcmin:\t%d\n", graph->cmin);
ce4d5ce0 884 if (graph->cmax != G_CMAX)
342b8b6e 885 fprintf (fout, "\tcmax:\t%d\n", graph->cmax);
ce4d5ce0 886 if (graph->pmin != G_PMIN)
342b8b6e 887 fprintf (fout, "\tpmin:\t%d\n", graph->pmin);
ce4d5ce0 888 if (graph->pmax != G_PMAX)
342b8b6e 889 fprintf (fout, "\tpmax:\t%d\n", graph->pmax);
ce4d5ce0 890 if (graph->rmin != G_RMIN)
342b8b6e 891 fprintf (fout, "\trmin:\t%d\n", graph->rmin);
ce4d5ce0 892 if (graph->rmax != G_RMAX)
342b8b6e 893 fprintf (fout, "\trmax:\t%d\n", graph->rmax);
ce4d5ce0 894 if (graph->smax != G_SMAX)
342b8b6e 895 fprintf (fout, "\tsmax:\t%d\n", graph->smax);
ce4d5ce0 896}