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 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759
|
/// @file
/// @ingroup common_render
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-v10.html
*
* Contributors: Details at https://graphviz.org
*************************************************************************/
#include <common/render.h>
#include <float.h>
#include <label/xlabels.h>
#include <stdbool.h>
#include <stddef.h>
#include <util/agxbuf.h>
#include <util/alloc.h>
#include <util/list.h>
#include <util/prisize_t.h>
#include <util/unreachable.h>
static int Rankdir;
static bool 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)
{
bezier bz;
if (ED_spl(e) == NULL) {
if (!Concentrate && ED_edge_type(e) != IGNORED)
agerrorf("lost %s %s edge\n", agnameof(agtail(e)),
agnameof(aghead(e)));
return;
}
for (size_t j = 0; j < ED_spl(e)->size; j++) {
bz = ED_spl(e)->list[j];
for (size_t 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);
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((pointf){bb.LL.x, bb.UR.y});
new_bb.UR = map_point((pointf){bb.UR.x, bb.LL.y});
} else {
new_bb.LL = map_point((pointf){bb.LL.x, bb.LL.y});
new_bb.UR = map_point((pointf){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;
bool 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;
}
/* centerPt:
* Calculate the center point of the xlabel. The returned positions for
* xlabels always correspond to the lower left corner.
*/
static pointf
centerPt (xlabel_t* xlp) {
pointf p;
p = xlp->pos;
p.x += xlp->sz.x / 2.0;
p.y += xlp->sz.y / 2.0;
return p;
}
static void printData(object_t *objs, size_t n_objs, xlabel_t *lbls,
size_t n_lbls, label_params_t *params) {
xlabel_t* xp;
fprintf (stderr, "%" PRISIZE_T " objs %" PRISIZE_T
" xlabels force=%d bb=(%.02f,%.02f) (%.02f,%.02f)\n",
n_objs, n_lbls, (int)params->force, params->bb.LL.x, params->bb.LL.y,
params->bb.UR.x, params->bb.UR.y);
if (Verbose < 2) return;
fprintf(stderr, "objects\n");
for (size_t i = 0; i < n_objs; i++) {
xp = objs->lbl;
fprintf(stderr, " [%" PRISIZE_T "] (%.02f,%.02f) (%.02f,%.02f) %p \"%s\"\n",
i, objs->pos.x, objs->pos.y, objs->sz.x, objs->sz.y, objs->lbl,
xp ? ((textlabel_t*)xp->lbl)->text : "");
objs++;
}
fprintf(stderr, "xlabels\n");
for (size_t i = 0; i < n_lbls; i++) {
fprintf(stderr, " [%" PRISIZE_T "] %p set %d (%.02f,%.02f) (%.02f,%.02f) %s\n",
i, lbls, lbls->set, lbls->pos.x, lbls->pos.y, lbls->sz.x,
lbls->sz.y, ((textlabel_t*)lbls->lbl)->text);
lbls++;
}
}
static pointf
edgeTailpoint (Agedge_t* e)
{
splines *spl;
bezier *bez;
if ((spl = getsplinepoints(e)) == NULL) {
pointf p;
p.x = p.y = 0;
return p;
}
bez = &spl->list[0];
if (bez->sflag) {
return bez->sp;
} else {
return bez->list[0];
}
}
static pointf
edgeHeadpoint (Agedge_t* e)
{
splines *spl;
bezier *bez;
if ((spl = getsplinepoints(e)) == NULL) {
pointf p;
p.x = p.y = 0;
return p;
}
bez = &spl->list[spl->size - 1];
if (bez->eflag) {
return bez->ep;
} else {
return bez->list[bez->size - 1];
}
}
/* adjustBB:
*/
static boxf
adjustBB (object_t* objp, boxf bb)
{
pointf ur;
/* Adjust bounding box */
bb.LL.x = MIN(bb.LL.x, objp->pos.x);
bb.LL.y = MIN(bb.LL.y, objp->pos.y);
ur.x = objp->pos.x + objp->sz.x;
ur.y = objp->pos.y + objp->sz.y;
bb.UR.x = MAX(bb.UR.x, ur.x);
bb.UR.y = MAX(bb.UR.y, ur.y);
return bb;
}
/* addXLabel:
* Set up xlabel_t object and connect with related object.
* If initObj is set, initialize the object.
*/
static void
addXLabel (textlabel_t* lp, object_t* objp, xlabel_t* xlp, int initObj, pointf pos)
{
if (initObj) {
*objp = (object_t){.pos = pos};
}
if (Flip) {
xlp->sz.x = lp->dimen.y;
xlp->sz.y = lp->dimen.x;
}
else {
xlp->sz = lp->dimen;
}
xlp->lbl = lp;
xlp->set = 0;
objp->lbl = xlp;
}
/* addLabelObj:
* Set up obstacle object based on set external label.
* This includes dot edge labels.
* Use label information to determine size and position of object.
* Then adjust given bounding box bb to include label and return new bb.
*/
static boxf
addLabelObj (textlabel_t* lp, object_t* objp, boxf bb)
{
if (Flip) {
objp->sz.x = lp->dimen.y;
objp->sz.y = lp->dimen.x;
}
else {
objp->sz.x = lp->dimen.x;
objp->sz.y = lp->dimen.y;
}
objp->pos = lp->pos;
objp->pos.x -= objp->sz.x / 2.0;
objp->pos.y -= objp->sz.y / 2.0;
return adjustBB(objp, bb);
}
/* addNodeOjb:
* Set up obstacle object based on a node.
* Use node information to determine size and position of object.
* Then adjust given bounding box bb to include label and return new bb.
*/
static boxf
addNodeObj (node_t* np, object_t* objp, boxf bb)
{
if (Flip) {
objp->sz.x = INCH2PS(ND_height(np));
objp->sz.y = INCH2PS(ND_width(np));
}
else {
objp->sz.x = INCH2PS(ND_width(np));
objp->sz.y = INCH2PS(ND_height(np));
}
objp->pos = ND_coord(np);
objp->pos.x -= objp->sz.x / 2.0;
objp->pos.y -= objp->sz.y / 2.0;
return adjustBB(objp, bb);
}
typedef struct {
boxf bb;
object_t* objp;
} cinfo_t;
static cinfo_t
addClusterObj (Agraph_t* g, cinfo_t info)
{
int c;
for (c = 1; c <= GD_n_cluster(g); c++)
info = addClusterObj (GD_clust(g)[c], info);
if (g != agroot(g) && GD_label(g) && GD_label(g)->set) {
object_t* objp = info.objp;
info.bb = addLabelObj (GD_label(g), objp, info.bb);
info.objp++;
}
return info;
}
static size_t countClusterLabels(Agraph_t *g) {
size_t i = 0;
if (g != agroot(g) && GD_label(g) && GD_label(g)->set)
i++;
for (int c = 1; c <= GD_n_cluster(g); c++)
i += countClusterLabels (GD_clust(g)[c]);
return i;
}
/* True if edges geometries were computed and this edge has a geometry */
#define HAVE_EDGE(ep) ((et != EDGETYPE_NONE) && (ED_spl(ep) != NULL))
/// position xlabels and any unpositioned edge labels using a map placement
/// algorithm to avoid overlap
///
/// TODO: interaction with spline=ortho
static void addXLabels(Agraph_t * gp)
{
Agnode_t *np;
Agedge_t *ep;
size_t n_nlbls = 0; // # of unset node xlabels
size_t n_elbls = 0; // # of unset edge labels or xlabels
size_t n_set_lbls = 0; // # of set xlabels and edge labels
size_t n_clbls = 0; // # of set cluster labels
boxf bb;
textlabel_t* lp;
object_t* objs;
xlabel_t* lbls;
Agsym_t* force;
int et = EDGE_TYPE(gp);
if (!(GD_has_labels(gp) & NODE_XLABEL) &&
!(GD_has_labels(gp) & EDGE_XLABEL) &&
!(GD_has_labels(gp) & TAIL_LABEL) &&
!(GD_has_labels(gp) & HEAD_LABEL) &&
(!(GD_has_labels(gp) & EDGE_LABEL) || EdgeLabelsDone))
return;
for (np = agfstnode(gp); np; np = agnxtnode(gp, np)) {
if (ND_xlabel(np)) {
if (ND_xlabel(np)->set)
n_set_lbls++;
else
n_nlbls++;
}
for (ep = agfstout(gp, np); ep; ep = agnxtout(gp, ep)) {
if (ED_xlabel(ep)) {
if (ED_xlabel(ep)->set)
n_set_lbls++;
else if (HAVE_EDGE(ep))
n_elbls++;
}
if (ED_head_label(ep)) {
if (ED_head_label(ep)->set)
n_set_lbls++;
else if (HAVE_EDGE(ep))
n_elbls++;
}
if (ED_tail_label(ep)) {
if (ED_tail_label(ep)->set)
n_set_lbls++;
else if (HAVE_EDGE(ep))
n_elbls++;
}
if (ED_label(ep)) {
if (ED_label(ep)->set)
n_set_lbls++;
else if (HAVE_EDGE(ep))
n_elbls++;
}
}
}
if (GD_has_labels(gp) & GRAPH_LABEL)
n_clbls = countClusterLabels (gp);
/* A label for each unpositioned external label */
size_t n_lbls = n_nlbls + n_elbls;
if (n_lbls == 0) return;
/* An object for each node, each positioned external label, any cluster label,
* and all unset edge labels and xlabels.
*/
size_t n_objs = (size_t)agnnodes(gp) + n_set_lbls + n_clbls + n_elbls;
object_t* objp = objs = gv_calloc(n_objs, sizeof(object_t));
xlabel_t* xlp = lbls = gv_calloc(n_lbls, sizeof(xlabel_t));
bb.LL = (pointf){DBL_MAX, DBL_MAX};
bb.UR = (pointf){-DBL_MAX, -DBL_MAX};
for (np = agfstnode(gp); np; np = agnxtnode(gp, np)) {
bb = addNodeObj (np, objp, bb);
if ((lp = ND_xlabel(np))) {
if (lp->set) {
objp++;
bb = addLabelObj (lp, objp, bb);
}
else {
pointf ignored = { 0.0, 0.0 };
addXLabel (lp, objp, xlp, 0, ignored);
xlp++;
}
}
objp++;
for (ep = agfstout(gp, np); ep; ep = agnxtout(gp, ep)) {
if ((lp = ED_label(ep))) {
if (lp->set) {
bb = addLabelObj (lp, objp, bb);
}
else if (HAVE_EDGE(ep)) {
addXLabel (lp, objp, xlp, 1, edgeMidpoint(gp, ep));
xlp++;
}
else {
agwarningf("no position for edge with label %s\n",
ED_label(ep)->text);
continue;
}
objp++;
}
if ((lp = ED_tail_label(ep))) {
if (lp->set) {
bb = addLabelObj (lp, objp, bb);
}
else if (HAVE_EDGE(ep)) {
addXLabel (lp, objp, xlp, 1, edgeTailpoint(ep));
xlp++;
}
else {
agwarningf("no position for edge with tail label %s\n",
ED_tail_label(ep)->text);
continue;
}
objp++;
}
if ((lp = ED_head_label(ep))) {
if (lp->set) {
bb = addLabelObj (lp, objp, bb);
}
else if (HAVE_EDGE(ep)) {
addXLabel (lp, objp, xlp, 1, edgeHeadpoint(ep));
xlp++;
}
else {
agwarningf("no position for edge with head label %s\n",
ED_head_label(ep)->text);
continue;
}
objp++;
}
if ((lp = ED_xlabel(ep))) {
if (lp->set) {
bb = addLabelObj (lp, objp, bb);
}
else if (HAVE_EDGE(ep)) {
addXLabel (lp, objp, xlp, 1, edgeMidpoint(gp, ep));
xlp++;
}
else {
agwarningf("no position for edge with xlabel %s\n",
ED_xlabel(ep)->text);
continue;
}
objp++;
}
}
}
if (n_clbls) {
cinfo_t info;
info.bb = bb;
info.objp = objp;
info = addClusterObj (gp, info);
bb = info.bb;
}
force = agfindgraphattr(gp, "forcelabels");
label_params_t params = {.bb = bb, .force = late_bool(gp, force, true)};
placeLabels(objs, n_objs, lbls, n_lbls, ¶ms);
if (Verbose)
printData(objs, n_objs, lbls, n_lbls, ¶ms);
xlp = lbls;
size_t cnt = 0;
for (size_t i = 0; i < n_lbls; i++) {
if (xlp->set) {
cnt++;
lp = (textlabel_t *)xlp->lbl;
lp->set = 1;
lp->pos = centerPt(xlp);
updateBB (gp, lp);
}
xlp++;
}
if (Verbose)
fprintf(stderr, "%" PRISIZE_T " out of %" PRISIZE_T " labels positioned.\n",
cnt, n_lbls);
else if (cnt != n_lbls)
agwarningf("%" PRISIZE_T " out of %" PRISIZE_T " exterior labels positioned.\n",
cnt, n_lbls);
free(objs);
free(lbls);
}
/* gv_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 allowTranslation)
{
double diff;
pointf dimen = { 0., 0. };
Rankdir = GD_rankdir(g);
Flip = GD_flip(g);
/* Handle cluster labels */
if (Flip)
place_flip_graph_label(g);
else
place_graph_label(g);
/* Everything has been placed except the root graph label, if any.
* The graph positions have not yet been rotated back if necessary.
*/
addXLabels(g);
/* Add space for graph label if necessary */
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;
}
}
}
if (allowTranslation) {
switch (Rankdir) {
case RANKDIR_TB:
Offset = GD_bb(g).LL;
break;
case RANKDIR_LR:
Offset = (pointf){-GD_bb(g).UR.y, GD_bb(g).LL.x};
break;
case RANKDIR_BT:
Offset = (pointf){GD_bb(g).LL.x, -GD_bb(g).UR.y};
break;
case RANKDIR_RL:
Offset = (pointf){GD_bb(g).LL.y, GD_bb(g).LL.x};
break;
default:
UNREACHABLE();
}
translate_drawing(g);
}
if (GD_label(g) && !GD_label(g)->set)
place_root_label(g, dimen);
if (!LIST_IS_EMPTY(&Show_boxes)) {
agxbuf buf = {0};
if (Flip)
agxbprint(&buf, M2, Offset.x, Offset.y, Offset.x, Offset.y);
else
agxbprint(&buf, M1, Offset.y, Offset.x, Offset.y, Offset.x,
-Offset.x, -Offset.y);
LIST_PREPEND(&Show_boxes, agxbdisown(&buf));
}
}
/* dotneato_postprocess:
*/
void dotneato_postprocess(Agraph_t * g)
{
gv_postprocess(g, 1);
}
/* 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;
if (g != agroot(g) && GD_label(g) && !GD_label(g)->set) {
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;
if (g != agroot(g) && GD_label(g) && !GD_label(g)->set) {
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]);
}
|