1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
|
/* $Id: postproc.c,v 1.31 2009/10/30 18:46:24 erg Exp $ $Revision: 1.31 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
#include "render.h"
static int Rankdir;
static boolean Flip;
static pointf Offset;
static void place_flip_graph_label(graph_t * g);
#define M1 \
"/pathbox {\n\
/Y exch %.5g sub def\n\
/X exch %.5g sub def\n\
/y exch %.5g sub def\n\
/x exch %.5g sub def\n\
newpath x y moveto\n\
X y lineto\n\
X Y lineto\n\
x Y lineto\n\
closepath stroke\n \
} def\n\
/dbgstart { gsave %.5g %.5g translate } def\n\
/arrowlength 10 def\n\
/arrowwidth arrowlength 2 div def\n\
/arrowhead {\n\
gsave\n\
rotate\n\
currentpoint\n\
newpath\n\
moveto\n\
arrowlength arrowwidth 2 div rlineto\n\
0 arrowwidth neg rlineto\n\
closepath fill\n\
grestore\n\
} bind def\n\
/makearrow {\n\
currentpoint exch pop sub exch currentpoint pop sub atan\n\
arrowhead\n\
} bind def\n\
/point {\
newpath\
2 0 360 arc fill\
} def\
/makevec {\n\
/Y exch def\n\
/X exch def\n\
/y exch def\n\
/x exch def\n\
newpath x y moveto\n\
X Y lineto stroke\n\
X Y moveto\n\
x y makearrow\n\
} def\n"
#define M2 \
"/pathbox {\n\
/X exch neg %.5g sub def\n\
/Y exch %.5g sub def\n\
/x exch neg %.5g sub def\n\
/y exch %.5g sub def\n\
newpath x y moveto\n\
X y lineto\n\
X Y lineto\n\
x Y lineto\n\
closepath stroke\n\
} def\n"
static pointf map_point(pointf p)
{
p = ccwrotatepf(p, Rankdir*90);
p.x -= Offset.x;
p.y -= Offset.y;
return p;
}
static void map_edge(edge_t * e)
{
int j, k;
bezier bz;
if (ED_spl(e) == NULL) {
if ((Concentrate == FALSE) || (ED_edge_type(e) != IGNORED))
agerr(AGERR, "lost %s %s edge\n",agnameof(agtail(e)),
agnameof(aghead(e)));
return;
}
for (j = 0; j < ED_spl(e)->size; j++) {
bz = ED_spl(e)->list[j];
for (k = 0; k < bz.size; k++)
bz.list[k] = map_point(bz.list[k]);
if (bz.sflag)
ED_spl(e)->list[j].sp = map_point(ED_spl(e)->list[j].sp);
if (bz.eflag)
ED_spl(e)->list[j].ep = map_point(ED_spl(e)->list[j].ep);
}
if (ED_label(e))
ED_label(e)->pos = map_point(ED_label(e)->pos);
if (ED_xlabel(e))
ED_xlabel(e)->pos = map_point(ED_xlabel(e)->pos);
/* vladimir */
if (ED_head_label(e))
ED_head_label(e)->pos = map_point(ED_head_label(e)->pos);
if (ED_tail_label(e))
ED_tail_label(e)->pos = map_point(ED_tail_label(e)->pos);
}
void translate_bb(graph_t * g, int rankdir)
{
int c;
boxf bb, new_bb;
bb = GD_bb(g);
if (rankdir == RANKDIR_LR || rankdir == RANKDIR_BT) {
new_bb.LL = map_point(pointfof(bb.LL.x, bb.UR.y));
new_bb.UR = map_point(pointfof(bb.UR.x, bb.LL.y));
} else {
new_bb.LL = map_point(pointfof(bb.LL.x, bb.LL.y));
new_bb.UR = map_point(pointfof(bb.UR.x, bb.UR.y));
}
GD_bb(g) = new_bb;
if (GD_label(g)) {
GD_label(g)->pos = map_point(GD_label(g)->pos);
}
for (c = 1; c <= GD_n_cluster(g); c++)
translate_bb(GD_clust(g)[c], rankdir);
}
/* translate_drawing:
* Translate and/or rotate nodes, spline points, and bbox info if
* necessary. Also, if Rankdir (!= RANKDIR_BT), reset ND_lw, ND_rw,
* and ND_ht to correct value.
*/
static void translate_drawing(graph_t * g)
{
node_t *v;
edge_t *e;
int shift = (Offset.x || Offset.y);
if (!shift && !Rankdir) return;
for (v = agfstnode(g); v; v = agnxtnode(g, v)) {
if (Rankdir) gv_nodesize(v, FALSE);
ND_coord(v) = map_point(ND_coord(v));
if (ND_xlabel(v))
ND_xlabel(v)->pos = map_point(ND_xlabel(v)->pos);
if (State == GVSPLINES)
for (e = agfstout(g, v); e; e = agnxtout(g, e))
map_edge(e);
}
translate_bb(g, GD_rankdir(g));
}
/* place_root_label:
* Set position of root graph label.
* Note that at this point, after translate_drawing, a
* flipped drawing has been transposed, so we don't have
* to worry about switching x and y.
*/
static void place_root_label(graph_t * g, pointf d)
{
pointf p;
if (GD_label_pos(g) & LABEL_AT_RIGHT) {
p.x = GD_bb(g).UR.x - d.x / 2;
} else if (GD_label_pos(g) & LABEL_AT_LEFT) {
p.x = GD_bb(g).LL.x + d.x / 2;
} else {
p.x = (GD_bb(g).LL.x + GD_bb(g).UR.x) / 2;
}
if (GD_label_pos(g) & LABEL_AT_TOP) {
p.y = GD_bb(g).UR.y - d.y / 2;
} else {
p.y = GD_bb(g).LL.y + d.y / 2;
}
GD_label(g)->pos = p;
GD_label(g)->set = TRUE;
}
static void
addXLabels (Agraph_t* g)
{
textlabel_t* lp;
pointf p, pp;
Agnode_t* n;
for (n = agfstnode(g); n; n = agnxtnode(g,n)) {
lp = ND_xlabel(n);
if (!lp) continue;
p = ND_coord(n);
pp.y = p.y;
pp.x += p.x + ND_rw(n) + lp->dimen.x/2.0;
lp->pos = pp;
lp->set = 1;
}
}
/* dotneato_postprocess:
* Set graph and cluster label positions.
* Add space for root graph label and translate graph accordingly.
* Set final nodesize using ns.
* Assumes the boxes of all clusters have been computed.
* When done, the bounding box of g has LL at origin.
*/
void gv_postprocess(Agraph_t *g, int addXLabelsOnly)
{
double diff;
pointf dimen = {0., 0.};
addXLabels (g);
if (addXLabelsOnly)
return;
Rankdir = GD_rankdir(g);
Flip = GD_flip(g);
if (Flip)
place_flip_graph_label(g);
else
place_graph_label(g);
if (GD_label(g) && !GD_label(g)->set) {
dimen = GD_label(g)->dimen;
PAD(dimen);
if (Flip) {
if (GD_label_pos(g) & LABEL_AT_TOP) {
GD_bb(g).UR.x += dimen.y;
} else {
GD_bb(g).LL.x -= dimen.y;
}
if (dimen.x > (GD_bb(g).UR.y - GD_bb(g).LL.y)) {
diff = dimen.x - (GD_bb(g).UR.y - GD_bb(g).LL.y);
diff = diff / 2.;
GD_bb(g).LL.y -= diff;
GD_bb(g).UR.y += diff;
}
} else {
if (GD_label_pos(g) & LABEL_AT_TOP) {
if (Rankdir == RANKDIR_TB)
GD_bb(g).UR.y += dimen.y;
else
GD_bb(g).LL.y -= dimen.y;
} else {
if (Rankdir == RANKDIR_TB)
GD_bb(g).LL.y -= dimen.y;
else
GD_bb(g).UR.y += dimen.y;
}
if (dimen.x > (GD_bb(g).UR.x - GD_bb(g).LL.x)) {
diff = dimen.x - (GD_bb(g).UR.x - GD_bb(g).LL.x);
diff = diff / 2.;
GD_bb(g).LL.x -= diff;
GD_bb(g).UR.x += diff;
}
}
}
switch (Rankdir) {
case RANKDIR_TB:
Offset = GD_bb(g).LL;
break;
case RANKDIR_LR:
Offset = pointfof(-GD_bb(g).UR.y, GD_bb(g).LL.x);
break;
case RANKDIR_BT:
Offset = pointfof(GD_bb(g).LL.x, -GD_bb(g).UR.y);
break;
case RANKDIR_RL:
Offset = pointfof(GD_bb(g).LL.y, GD_bb(g).LL.x);
break;
}
translate_drawing(g);
if (GD_label(g) && !GD_label(g)->set)
place_root_label(g, dimen);
if (Show_boxes) {
char buf[BUFSIZ];
if (Flip)
sprintf(buf, M2, Offset.x, Offset.y, Offset.x, Offset.y);
else
sprintf(buf, M1, Offset.y, Offset.x, Offset.y, Offset.x,
-Offset.x, -Offset.y);
Show_boxes[0] = strdup(buf);
}
}
void dotneato_postprocess(Agraph_t * g)
{
gv_postprocess (g, 0);
}
/* place_flip_graph_label:
* Put cluster labels recursively in the flip case.
*/
static void place_flip_graph_label(graph_t * g)
{
int c;
pointf p, d;
#ifndef WITH_CGRAPH
if ((g != g->root) && (GD_label(g)) && !GD_label(g)->set) {
#else /* WITH_CGRAPH */
if ((g != agroot(g)) && (GD_label(g)) && !GD_label(g)->set) {
#endif /* WITH_CGRAPH */
if (GD_label_pos(g) & LABEL_AT_TOP) {
d = GD_border(g)[RIGHT_IX];
p.x = GD_bb(g).UR.x - d.x / 2;
} else {
d = GD_border(g)[LEFT_IX];
p.x = GD_bb(g).LL.x + d.x / 2;
}
if (GD_label_pos(g) & LABEL_AT_RIGHT) {
p.y = GD_bb(g).LL.y + d.y / 2;
} else if (GD_label_pos(g) & LABEL_AT_LEFT) {
p.y = GD_bb(g).UR.y - d.y / 2;
} else {
p.y = (GD_bb(g).LL.y + GD_bb(g).UR.y) / 2;
}
GD_label(g)->pos = p;
GD_label(g)->set = TRUE;
}
for (c = 1; c <= GD_n_cluster(g); c++)
place_flip_graph_label(GD_clust(g)[c]);
}
/* place_graph_label:
* Put cluster labels recursively in the non-flip case.
* The adjustments to the bounding boxes should no longer
* be necessary, since we now guarantee the label fits in
* the cluster.
*/
void place_graph_label(graph_t * g)
{
int c;
pointf p, d;
#ifndef WITH_CGRAPH
if ((g != g->root) && (GD_label(g)) && !GD_label(g)->set) {
#else /* WITH_CGRAPH */
if ((g != agroot(g)) && (GD_label(g)) && !GD_label(g)->set) {
#endif /* WITH_CGRAPH */
if (GD_label_pos(g) & LABEL_AT_TOP) {
d = GD_border(g)[TOP_IX];
p.y = GD_bb(g).UR.y - d.y / 2;
} else {
d = GD_border(g)[BOTTOM_IX];
p.y = GD_bb(g).LL.y + d.y / 2;
}
if (GD_label_pos(g) & LABEL_AT_RIGHT) {
p.x = GD_bb(g).UR.x - d.x / 2;
} else if (GD_label_pos(g) & LABEL_AT_LEFT) {
p.x = GD_bb(g).LL.x + d.x / 2;
} else {
p.x = (GD_bb(g).LL.x + GD_bb(g).UR.x) / 2;
}
GD_label(g)->pos = p;
GD_label(g)->set = TRUE;
}
for (c = 1; c <= GD_n_cluster(g); c++)
place_graph_label(GD_clust(g)[c]);
}
|