Home
last modified time | relevance | path

Searched refs:ED_to_virt (Results 1 – 16 of 16) sorted by relevance

/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/
H A Dclass2.c89 assert(ED_to_virt(orig) == NULL); in make_chain()
103 assert(ED_to_virt(orig) != NULL); in make_chain()
129 for (ve = ED_to_virt(e); ve && (ND_rank(aghead(ve)) <= ND_rank(h)); in interclrep()
148 assert(ED_to_virt(e) == NULL); in merge_chain()
149 ED_to_virt(e) = f; in merge_chain()
202 if (ED_to_virt(e)) { in class2()
211 if (ED_to_virt(prev)) { in class2()
212 merge_chain(g, e, ED_to_virt(prev), FALSE); in class2()
237 merge_chain(g, e, ED_to_virt(prev), TRUE); in class2()
282 if (ED_to_virt(opp) == NULL) in class2()
[all …]
H A Dfastgr.c191 if (ED_to_virt(orig) == NULL) in new_virtual_edge()
192 ED_to_virt(orig) = e; in new_virtual_edge()
275 if (ED_to_orig(e) && ED_to_virt(ED_to_orig(e)) == e) in delete_flat_edge()
276 ED_to_virt(ED_to_orig(e)) = NULL; in delete_flat_edge()
334 rep = ED_to_virt(rep); in basic_merge()
341 if (rep == ED_to_virt(e) || e == ED_to_virt(rep)) { in merge_oneway()
345 assert(ED_to_virt(e) == NULL); in merge_oneway()
346 ED_to_virt(e) = rep; in merge_oneway()
361 for (rep = ED_to_virt(e); rep; rep = nextrep) { in unmerge_oneway()
363 nextrep = ED_to_virt(rep); in unmerge_oneway()
[all …]
H A Dcluster.c87 ED_to_virt(orig) = NULL; in map_path()
113 ED_to_virt(orig) = ve; in map_path()
120 ED_to_virt(orig) = NULL; in map_path()
128 ED_to_virt(orig) = NULL; in map_path()
185 ED_to_virt(e) = prev; in interclexp()
187 ED_to_virt(e) = NULL; in interclexp()
188 if (ED_to_virt(prev) == NULL) in interclexp()
203 if (!ED_to_virt(e)) merge_oneway(e, fe); in interclexp()
330 if ((e = ED_to_virt(orig))) { in mark_clusters()
404 if ((e = ED_to_virt(orig))) { in mark_lowclusters()
[all …]
H A Dclass1.c76 if (ED_to_virt(e)) in class1()
110 if (f && (ED_to_virt(f) == NULL)) in class1()
H A Dflat.c237 e = ED_to_virt(e); in checkFlatAdjacent()
317 while (ED_to_virt(le)) le = ED_to_virt(le); in flat_edges()
H A Dsameport.c224 for (; e; e = ED_to_virt(e)) { /* assign to all virt edges of e */ in sameport()
247 for (; e; e = ED_to_virt(e)) { /* assign to all virt edges of e */ in sameport()
H A Dconc.c152 for (rep = e; ED_to_virt(rep); rep = ED_to_virt(rep)); in rebuild_vlists()
H A Drank.c60 f = ED_to_virt(e); in cleanup1()
66 ED_to_virt(e) = NULL; in cleanup1()
72 f = ED_to_virt(e); in cleanup1()
76 ED_to_virt(e) = NULL; in cleanup1()
H A Ddotsplines.c88 while (ED_to_virt(le)) in getmainedge()
89 le = ED_to_virt(le); in getmainedge()
1388 for (f = ED_to_virt(e); ED_to_virt(f); f = ED_to_virt(f));
1777 while (ED_to_virt(le))
1778 le = ED_to_virt(le);
/dports/graphics/graphviz/graphviz-2.44.1/lib/fdpgen/
H A Dlayout.c64 #define NEW_EDGE(e) (ED_to_virt(e) == 0)
226 free (ED_to_virt(e)); in freeDerivedGraph()
393 el = (edge_t **) (ED_to_virt(de)); in addEdge()
396 ED_to_virt(de) = (edge_t *) el; in addEdge()
713 ep = (edge_t **) (el = ED_to_virt(e)); in genPorts()
H A Dclusteredges.c304 for (e0 = e; e0; e0 = ED_to_virt(e0)) { in compoundEdges()
H A Ddbg.c114 for (i = 0, ep = (Agedge_t **) ED_to_virt(e); in dumpE()
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/
H A Dneatosplines.c241 e = ED_to_virt(e); in makeSelfArcs()
656 e0 = ED_to_virt(e0); in _spline_edges()
728 ED_to_virt(e) = ED_to_virt(leader); in splineEdges()
729 ED_to_virt(leader) = e; in splineEdges()
H A Dmultispline.c958 e = ED_to_virt(e); in genroute()
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Droutespl.c1192 while ((e0 != ED_to_virt(e0)) && (e0 = ED_to_virt(e0))) e_cnt++; in makeStraightEdge()
1201 e0 = ED_to_virt(e0); in makeStraightEdge()
H A Dtypes.h602 #define ED_to_virt(e) (((Agedgeinfo_t*)AGDATA(e))->to_virt) macro