void common_init_node(node_t * n)
{
struct fontinfo fi;
char *str;
ND_width(n) =
late_double(n, N_width, DEFAULT_NODEWIDTH, MIN_NODEWIDTH);
ND_height(n) =
late_double(n, N_height, DEFAULT_NODEHEIGHT, MIN_NODEHEIGHT);
ND_shape(n) =
bind_shape(late_nnstring(n, N_shape, DEFAULT_NODESHAPE), n);
str = agxget(n, N_label);
fi.fontsize = late_double(n, N_fontsize, DEFAULT_FONTSIZE, MIN_FONTSIZE);
fi.fontname = late_nnstring(n, N_fontname, DEFAULT_FONTNAME);
fi.fontcolor = late_nnstring(n, N_fontcolor, DEFAULT_COLOR);
ND_label(n) = make_label((void*)n, str,
((aghtmlstr(str) ? LT_HTML : LT_NONE) | ( (shapeOf(n) == SH_RECORD) ? LT_RECD : LT_NONE)),
fi.fontsize, fi.fontname, fi.fontcolor);
if (N_xlabel && (str = agxget(n, N_xlabel)) && (str[0])) {
ND_xlabel(n) = make_label((void*)n, str, (aghtmlstr(str) ? LT_HTML : LT_NONE),
fi.fontsize, fi.fontname, fi.fontcolor);
GD_has_labels(agraphof(n)) |= NODE_XLABEL;
}
ND_showboxes(n) = late_int(n, N_showboxes, 0, 0);
ND_shape(n)->fns->initfn(n);
}
/* 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));
}
static void
dot_cleanup_node(node_t * n)
{
free_list(ND_in(n));
free_list(ND_out(n));
free_list(ND_flat_out(n));
free_list(ND_flat_in(n));
free_list(ND_other(n));
free_label(ND_label(n));
free_label(ND_xlabel(n));
if (ND_shape(n))
ND_shape(n)->fns->freefn(n);
agdelrec(n, "Agnodeinfo_t");
}
static void addXLabels(Agraph_t * gp)
{
Agnode_t *np;
Agedge_t *ep;
int cnt, i, n_objs, n_lbls;
int n_nlbls = 0; /* # of unset node xlabels */
int n_elbls = 0; /* # of unset edge labels or xlabels */
int n_set_lbls = 0; /* # of set xlabels and edge labels */
int n_clbls = 0; /* # of set cluster labels */
boxf bb;
pointf ur;
textlabel_t* lp;
label_params_t params;
object_t* objs;
xlabel_t* lbls;
object_t* objp;
xlabel_t* xlp;
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 */
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.
*/
n_objs = agnnodes(gp) + n_set_lbls + n_clbls + n_elbls;
objp = objs = N_NEW(n_objs, object_t);
xlp = lbls = N_NEW(n_lbls, xlabel_t);
bb.LL = pointfof(INT_MAX, INT_MAX);
bb.UR = pointfof(-INT_MAX, -INT_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 {
addXLabel (lp, objp, xlp, 0, ur);
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 {
agerr(AGWARN, "no position for edge with label %s",
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 {
agerr(AGWARN, "no position for edge with tail label %s",
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 {
agerr(AGWARN, "no position for edge with head label %s",
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 {
agerr(AGWARN, "no position for edge with xlabel %s",
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");
params.force = late_bool(gp, force, TRUE);
params.bb = bb;
placeLabels(objs, n_objs, lbls, n_lbls, ¶ms);
if (Verbose)
printData(objs, n_objs, lbls, n_lbls, ¶ms);
xlp = lbls;
cnt = 0;
for (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, "%d out of %d labels positioned.\n", cnt, n_lbls);
else if (cnt != n_lbls)
agerr(AGWARN, "%d out of %d exterior labels positioned.\n", cnt, n_lbls);
free(objs);
free(lbls);
}
void attach_attrs_and_arrows(graph_t* g, int* sp, int* ep)
{
int e_arrows; /* graph has edges with end arrows */
int s_arrows; /* graph has edges with start arrows */
int i, j, sides;
char buf[BUFSIZ]; /* Used only for small strings */
unsigned char xbuffer[BUFSIZ]; /* Initial buffer for xb */
agxbuf xb;
node_t *n;
edge_t *e;
pointf ptf;
int dim3 = (GD_odim(g) >= 3);
Agsym_t* bbsym;
gv_fixLocale (1);
e_arrows = s_arrows = 0;
setYInvert(g);
agxbinit(&xb, BUFSIZ, xbuffer);
safe_dcl(g, AGNODE, "pos", "");
safe_dcl(g, AGNODE, "rects", "");
N_width = safe_dcl(g, AGNODE, "width", "");
N_height = safe_dcl(g, AGNODE, "height", "");
safe_dcl(g, AGEDGE, "pos", "");
if (GD_has_labels(g) & NODE_XLABEL)
safe_dcl(g, AGNODE, "xlp", "");
if (GD_has_labels(g) & EDGE_LABEL)
safe_dcl(g, AGEDGE, "lp", "");
if (GD_has_labels(g) & EDGE_XLABEL)
safe_dcl(g, AGEDGE, "xlp", "");
if (GD_has_labels(g) & HEAD_LABEL)
safe_dcl(g, AGEDGE, "head_lp", "");
if (GD_has_labels(g) & TAIL_LABEL)
safe_dcl(g, AGEDGE, "tail_lp", "");
if (GD_label(g)) {
safe_dcl(g, AGRAPH, "lp", "");
safe_dcl(g, AGRAPH, "lwidth", "");
safe_dcl(g, AGRAPH, "lheight", "");
if (GD_label(g)->text[0]) {
ptf = GD_label(g)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(g, "lp", buf);
ptf = GD_label(g)->dimen;
sprintf(buf, "%.2f", PS2INCH(ptf.x));
agset(g, "lwidth", buf);
sprintf(buf, "%.2f", PS2INCH(ptf.y));
agset(g, "lheight", buf);
}
}
bbsym = safe_dcl(g, AGRAPH, "bb", "");
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
if (dim3) {
int k;
sprintf(buf, "%.5g,%.5g,%.5g", ND_coord(n).x, YDIR(ND_coord(n).y), POINTS_PER_INCH*(ND_pos(n)[2]));
agxbput (&xb, buf);
for (k = 3; k < GD_odim(g); k++) {
sprintf(buf, ",%.5g", POINTS_PER_INCH*(ND_pos(n)[k]));
agxbput (&xb, buf);
}
agset(n, "pos", agxbuse(&xb));
} else {
sprintf(buf, "%.5g,%.5g", ND_coord(n).x, YDIR(ND_coord(n).y));
agset(n, "pos", buf);
}
sprintf(buf, "%.5g", PS2INCH(ND_ht(n)));
agxset(n, N_height, buf);
sprintf(buf, "%.5g", PS2INCH(ND_lw(n) + ND_rw(n)));
agxset(n, N_width, buf);
if (ND_xlabel(n) && ND_xlabel(n)->set) {
ptf = ND_xlabel(n)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(n, "xlp", buf);
}
if (strcmp(ND_shape(n)->name, "record") == 0) {
set_record_rects(n, ND_shape_info(n), &xb);
agxbpop(&xb); /* get rid of last space */
agset(n, "rects", agxbuse(&xb));
} else {
polygon_t *poly;
int i;
if (N_vertices && isPolygon(n)) {
poly = (polygon_t *) ND_shape_info(n);
sides = poly->sides;
if (sides < 3) {
char *p = agget(n, "samplepoints");
if (p)
sides = atoi(p);
else
sides = 8;
if (sides < 3)
sides = 8;
}
for (i = 0; i < sides; i++) {
if (i > 0)
agxbputc(&xb, ' ');
if (poly->sides >= 3)
sprintf(buf, "%.5g %.5g",
PS2INCH(poly->vertices[i].x),
YFDIR(PS2INCH(poly->vertices[i].y)));
else
sprintf(buf, "%.5g %.5g",
ND_width(n) / 2.0 * cos(i / (double) sides * M_PI * 2.0),
YFDIR(ND_height(n) / 2.0 * sin(i / (double) sides * M_PI * 2.0)));
agxbput(&xb, buf);
}
agxset(n, N_vertices, agxbuse(&xb));
}
}
if (State >= GVSPLINES) {
for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
if (ED_edge_type(e) == IGNORED)
continue;
if (ED_spl(e) == NULL)
continue; /* reported in postproc */
for (i = 0; i < ED_spl(e)->size; i++) {
if (i > 0)
agxbputc(&xb, ';');
if (ED_spl(e)->list[i].sflag) {
s_arrows = 1;
sprintf(buf, "s,%.5g,%.5g ",
ED_spl(e)->list[i].sp.x,
YDIR(ED_spl(e)->list[i].sp.y));
agxbput(&xb, buf);
}
if (ED_spl(e)->list[i].eflag) {
e_arrows = 1;
sprintf(buf, "e,%.5g,%.5g ",
ED_spl(e)->list[i].ep.x,
YDIR(ED_spl(e)->list[i].ep.y));
agxbput(&xb, buf);
}
for (j = 0; j < ED_spl(e)->list[i].size; j++) {
if (j > 0)
agxbputc(&xb, ' ');
ptf = ED_spl(e)->list[i].list[j];
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agxbput(&xb, buf);
}
}
agset(e, "pos", agxbuse(&xb));
if (ED_label(e)) {
ptf = ED_label(e)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(e, "lp", buf);
}
if (ED_xlabel(e) && ED_xlabel(e)->set) {
ptf = ED_xlabel(e)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(e, "xlp", buf);
}
if (ED_head_label(e)) {
ptf = ED_head_label(e)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(e, "head_lp", buf);
}
if (ED_tail_label(e)) {
ptf = ED_tail_label(e)->pos;
sprintf(buf, "%.5g,%.5g", ptf.x, YDIR(ptf.y));
agset(e, "tail_lp", buf);
}
}
}
}
rec_attach_bb(g, bbsym);
agxbfree(&xb);
if (HAS_CLUST_EDGE(g))
undoClusterEdges(g);
*sp = s_arrows;
*ep = e_arrows;
gv_fixLocale (0);
}
/* compute_bb:
* Compute bounding box of g using nodes, splines, and clusters.
* Assumes bb of clusters already computed.
* store in GD_bb.
*/
void compute_bb(graph_t * g)
{
node_t *n;
edge_t *e;
boxf b, bb;
boxf BF;
pointf ptf, s2;
int i, j;
if ((agnnodes(g) == 0) && (GD_n_cluster(g) ==0)) {
bb.LL = pointfof(0, 0);
bb.UR = pointfof(0, 0);
return;
}
bb.LL = pointfof(INT_MAX, INT_MAX);
bb.UR = pointfof(-INT_MAX, -INT_MAX);
for (n = agfstnode(g); n; n = agnxtnode(g, n)) {
ptf = coord(n);
s2.x = ND_xsize(n) / 2.0;
s2.y = ND_ysize(n) / 2.0;
b.LL = sub_pointf(ptf, s2);
b.UR = add_pointf(ptf, s2);
EXPANDBB(bb,b);
if (ND_xlabel(n) && ND_xlabel(n)->set) {
bb = addLabelBB(bb, ND_xlabel(n), GD_flip(g));
}
for (e = agfstout(g, n); e; e = agnxtout(g, e)) {
if (ED_spl(e) == 0)
continue;
for (i = 0; i < ED_spl(e)->size; i++) {
for (j = 0; j < (((Agedgeinfo_t*)AGDATA(e))->spl)->list[i].size; j++) {
ptf = ED_spl(e)->list[i].list[j];
EXPANDBP(bb,ptf);
}
}
if (ED_label(e) && ED_label(e)->set) {
bb = addLabelBB(bb, ED_label(e), GD_flip(g));
}
if (ED_head_label(e) && ED_head_label(e)->set) {
bb = addLabelBB(bb, ED_head_label(e), GD_flip(g));
}
if (ED_tail_label(e) && ED_tail_label(e)->set) {
bb = addLabelBB(bb, ED_tail_label(e), GD_flip(g));
}
if (ED_xlabel(e) && ED_xlabel(e)->set) {
bb = addLabelBB(bb, ED_xlabel(e), GD_flip(g));
}
}
}
for (i = 1; i <= GD_n_cluster(g); i++) {
B2BF(GD_bb(GD_clust(g)[i]), BF);
EXPANDBB(bb,BF);
}
if (GD_label(g) && GD_label(g)->set) {
bb = addLabelBB(bb, GD_label(g), GD_flip(g));
}
GD_bb(g) = bb;
}
