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
|
/*
* compute node and edge coordinates
*/
#include <dag.h>
#include <ns.h>
#ifdef DMALLOC
#include "dmalloc.h"
#endif
static void fix_separation(ddview_t *view, Agnode_t *ln)
{
Agnode_t *left, *right; /* ln's left and right neighbors */
Agnode_t *var, *left_var, *right_var; /* constraint variables */
Agedge_t *ce; /* constraint edge */
double sep, width, left_width, right_width;
int scaled_len;
sep = dd_nodesep(view).x;
width = dd_nodesize(view,ln).x / 2.0;
var = dd_getvar(view, ln, XCON);
if ((left = dd_left(view,ln))) {
left_var = dd_getvar(view, left, XCON);
left_width = dd_nodesize(view,left).x / 2.0;
}
else {
left_var = view->con[XCON].anchor;
left_width = -ns_getrank(left_var);
}
ce = agedge(left_var,var,NILstr,TRUE);
scaled_len = ROUND(view->xscale * (sep + left_width + width));
ns_setminlength(ce,scaled_len);
ns_setweight(ce,0);
if (left && (ns_getrank(var) - ns_getrank(left_var) < scaled_len))
view->con[XCON].inconsistent = TRUE;
if ((right = dd_right(view,ln))) {
right_var = dd_getvar(view, right, XCON);
right_width = dd_nodesize(view,right).x / 2.0;
ce = agedge(var,right_var,NILstr,TRUE);
scaled_len = ROUND(view->xscale * (sep + right_width + width));
ns_setminlength(ce,scaled_len);
ns_setweight(ce,0);
if (ns_getrank(right_var) - ns_getrank(var) < scaled_len)
view->con[XCON].inconsistent = TRUE;
}
}
static void do_nodesep(ddview_t *view, Agraph_t *subg)
{
Agnode_t *n;
for (n = agfstnode(subg); n; n = agnxtnode(n))
fix_separation(view, dd_rep(n));
}
static void do_edgesep(ddview_t *view, Agraph_t *subg)
{
Agnode_t *n;
Agedge_t *e;
Agedge_t *le;
ddpath_t *path;
for (n = agfstnode(subg); n; n = agnxtnode(n)) {
for (e = agfstout(n); e; e = agnxtout(e)) {
if ((path = dd_pathrep(e)) && ((le = path->first))) {
while (le != path->last) {
fix_separation(view,le->node);
le = agfstout(le->node);
}
}
else { /* flat or self edge */
if (e->node != n) { /* flat */
Agnode_t *u, *v;
Agnode_t *uvar, *vvar;
int ux, vx;
Agedge_t *ce;
double sep;
u = dd_rep(agtail(e));
v = dd_rep(aghead(e));
ux = dd_order(u);
vx = dd_order(v);
if (abs(ux - vx) == 1) {
if (ux > vx) {Agnode_t *t; t = u; u = v; v = t;}
uvar = dd_node(u)->con[XCON].n;
vvar = dd_node(v)->con[XCON].n;
ce = agedge(uvar,vvar,NILstr,FALSE);
sep = (dd_nodesize(view,u).x + dd_nodesize(view,v).x) / 2.0 + 3.0 * dd_nodesep(view).x;
ns_setminlength(ce,ROUND(view->xscale * sep));
}
}
else {
} /* self */
}
}
}
}
static void restore_nodesep(ddview_t *view)
{
Agnode_t *ln;
do_nodesep(view, BASE(view)->model.v[IL_INS]);
do_nodesep(view, BASE(view)->model.v[IL_MOD]);
do_edgesep(view, BASE(view)->model.e[IL_INS]);
do_edgesep(view, BASE(view)->model.e[IL_MOD]);
for (ln = agfstnode(view->dirty); ln; ln = agnxtnode(ln))
fix_separation(view,ln);
while ((ln = agfstnode(view->dirty))) agdelete(view->dirty,ln);
}
static void fix_edgecost(ddview_t *view, Agedge_t *le)
{
ddedge_t *ed;
Agraph_t *cg;
edgepair_t ep;
ed = dd_edge(le);
cg = view->con[XCON].g;
if (ed->cn == NILnode) {
ed->cn = agnode(cg,NILstr,TRUE);
ep = dd_getedgepair(cg,ed->cn,dd_getvar(view,agtail(le),XCON),dd_getvar(view,aghead(le),XCON));
ns_setweight(ep.e[0],1000);
ns_setweight(ep.e[1],1000);
}
}
static void do_edgecost(ddview_t *view, Agraph_t *subg)
{
Agnode_t *n;
Agedge_t *e, *le;
ddpath_t *path;
for (n = agfstnode(subg); n; n = agnxtnode(n)) {
for (e = agfstout(n); e; e = agnxtout(e)) {
if ((path = dd_pathrep(e)) && ((le = path->first))) {
while (1) {
fix_edgecost(view,le);
if (le == path->last) break;
le = agfstout(le->node);
}
}
}
}
}
static void restore_edgecost(ddview_t *view)
{
do_edgecost(view, BASE(view)->model.e[IL_INS]);
do_edgecost(view, BASE(view)->model.e[IL_MOD]);
}
static void readout_coords(ddview_t *view)
{
Agnode_t *ln;
Agnode_t *cn;
double oldpos,newpos;
ILnode_t *spec;
ddnode_t *dn;
int anchor_rank;
anchor_rank = ns_getrank(view->con[XCON].anchor);
for (ln = agfstnode(view->layout); ln; ln = agnxtnode(ln)) {
dn = dd_node(ln);
if ((cn = dn->con[XCON].n)) {
oldpos = dn->prev.pos.x;
newpos = (ns_getrank(cn) - anchor_rank) / view->xscale;
dd_set_x(ln,newpos);
if (dd_is_a_vnode(ln)) continue;
spec = dd_nspec(ln);
if (newpos != oldpos) {
il_register_node_callback(BASE(view),spec,IL_MOD);
}
}
}
}
static void stabilize_nodes(ddview_t *view)
{
Agnode_t *mn;
Agnode_t *ln;
Agraph_t *modnodes[2], *modedges[2];
int i;
modnodes[0] = BASE(view)->model.v[IL_INS];
modnodes[1] = BASE(view)->model.v[IL_MOD];
modedges[0] = BASE(view)->model.e[IL_INS];
modedges[1] = BASE(view)->model.e[IL_MOD];
/* what about e[IL_DEL]? make sure endpoint isn't deleted too. */
for (i = 0; i < 2; i++) {
for (mn = agfstnode(modnodes[i]); mn; mn = agnxtnode(mn)) {
ln = dd_rep(mn);
if (dd_coord_fixed(ln))
dd_stabilize(view, ln, XCON, ROUND(view->xscale * il_pos(mn).x),
STABILITY_FACTOR);
}
}
for (i = 0; i < 2; i++) {
for (mn = agfstnode(modedges[i]); mn; mn = agnxtnode(mn)) {
ln = dd_rep(mn);
if (NOT(dd_coord_fixed(ln)))
dd_unstabilize(view, ln, XCON);
}
}
}
void dd_update_X(ddview_t *view)
{
restore_nodesep(view);
restore_edgecost(view);
stabilize_nodes(view);
if (view->con[XCON].inconsistent || 1) {
ns_solve(view->con[XCON].g,NS_DEBUG|NS_VALIDATE|NS_NORMALIZE);
readout_coords(view);
view->con[XCON].inconsistent = FALSE;
}
}
|
