Home
last modified time | relevance | path

Searched refs:ND_out (Results 1 – 19 of 19) sorted by relevance

/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/
H A Dconc.c44 && (ND_out(v).size == 1) && (ND_label(v) == NULL)); in downcandidate()
61 return ((ND_node_type(v) == VIRTUAL) && (ND_out(v).size == 1) in upcandidate()
68 e = ND_out(u).list[0]; in bothupcandidates()
69 f = ND_out(v).list[0]; in bothupcandidates()
88 while ((e = ND_out(right).list[0])) { in mergevirtual()
89 for (k = 0; (f = ND_out(left).list[k]); k++) in mergevirtual()
108 while ((e0 = ND_out(right).list[0])) { in mergevirtual()
115 assert(ND_in(right).size + ND_out(right).size == 0); in mergevirtual()
155 rep = ND_out(aghead(rep)).list[0]; in rebuild_vlists()
H A Dfastgr.c44 return ffe(u, ND_out(u), v, ND_in(v)); in find_fast_edge()
79 for (i = 0; (f = ND_out(agtail(e)).list[i]); i++) { in fast_edge()
94 elist_append(e, ND_out(agtail(e))); in fast_edge()
118 zapinlist(&(ND_out(agtail(e))), e); in delete_fast_edge()
129 for (i = 0; (f = ND_out(agtail(e)).list[i]); i++) in safe_delete_fast_edge()
131 zapinlist(&(ND_out(agtail(e))), e); in safe_delete_fast_edge()
254 alloc_elist(4, ND_out(n)); in named_virtual_node()
299 for (i = 0; (e = ND_out(n).list[i]); i++) { in fastgr()
314 for (j = 0; (f = ND_out(w).list[j]); j++) in fastgr()
370 && (ND_out(aghead(rep)).size == 1)) { in unmerge_oneway()
[all …]
H A Dcluster.c107 ve = ND_out(aghead(ve)).list[0]; in map_path()
134 e = ND_out(aghead(e)).list[0]; in map_path()
272 while ((e = ND_out(v).list[0])) in remove_rankleaders()
333 e = ND_out(aghead(e)).list[0]; in mark_clusters()
368 ED_count(ND_out(rl).list[0])++; in build_skeleton()
407 e = ND_out(aghead(e)).list[0]; in mark_lowclusters()
437 e = ND_out(aghead(e)).list[0]; in mark_lowcluster_basic()
H A Dmincross.c116 for (j = 0; (e = ND_out(v).list[j]); j++) { in dumpg()
142 for (j = 0; (e = ND_out(v).list[j]); j++) { in dumpr()
306 lo = ND_order(aghead(ND_out(u).list[0])); in checkLabelOrder()
307 hi = ND_order(aghead(ND_out(u).list[1])); in checkLabelOrder()
589 for (e2 = ND_out(w).list; *e2; e2++) { in out_cross()
593 for (e1 = ND_out(v).list; *e1; e1++) { in out_cross()
1042 edge_t *e = ND_out(v).list[0]; in is_a_vnode_of_an_edge_of()
1160 alloc_elist(4, ND_out(n)); in realFillRanks()
1445 for (i = 0; i < ND_out(n0).size; i++) { in enqueue_neighbors()
1446 e = ND_out(n0).list[i]; in enqueue_neighbors()
[all …]
H A Dflat.c63 assert(ND_out(v).size == 2); in setbounds()
64 findlr(aghead(ND_out(v).list[0]), aghead(ND_out(v).list[1]), &l, in setbounds()
83 for (i = 0; (f = ND_out(v).list[i]); i++) { in setbounds()
H A Ddotinit.c43 alloc_elist(4, ND_out(n)); in dot_init_node()
105 free_list(ND_out(n)); in dot_cleanup_node()
127 for (i = ND_out(n).size - 1; i >= 0; i--) { in free_virtual_edge_list()
128 e = ND_out(n).list[i]; in free_virtual_edge_list()
143 free_list(ND_out(vn)); in free_virtual_node_list()
H A Dposition.c47 el = ND_out(n); in dumpNS()
161 for (i = 0; (e = ND_out(u).list[i]); i++) { in go()
201 ND_save_out(n) = ND_out(n); in allocate_aux_edges()
202 for (i = 0; ND_out(n).list[i]; i++); in allocate_aux_edges()
206 alloc_elist(3, ND_out(n)); in allocate_aux_edges()
557 for (i = 0; (e = ND_out(n).list[i]); i++) { in remove_aux_edges()
561 free_list(ND_out(n)); in remove_aux_edges()
563 ND_out(n) = ND_save_out(n); in remove_aux_edges()
1102 if (ND_out(leader).size > 0) { /* in-edge leaves */ in do_leaves()
1103 n = aghead(ND_out(leader).list[0]); in do_leaves()
[all …]
H A Ddotsplines.c1827 e = ND_out(hn).list[0];
2260 v = aghead(ND_out(v).list[0]);
2278 f = ND_out(aghead(f)).list[0];
2294 vn = aghead(ND_out(vn).list[0])) {
2390 orig = ED_to_orig(ND_out(n).list[0]);
2399 orig = ED_to_orig(ND_out(adj).list[0]);
2514 if ((ND_out(n0).size != 1) && (ND_out(n0).size != 1))
2517 if (ND_out(n0).size == 1 && e1) {
2518 e0 = ND_out(n0).list[0];
2526 e0 = ND_out(na).list[0];
[all …]
H A Ddecomp.c148 vec[0] = ND_out(n); in search_component()
177 vec[0] = ND_out(n);
H A Dacyclic.c43 for (i = 0; (e = ND_out(n).list[i]); i++) { in dfs()
H A Dclass2.c130 ve = ND_out(aghead(ve)).list[0]) in interclrep()
160 rep = ND_out(aghead(rep)).list[0]; in merge_chain()
H A Dsameport.c228 ND_out(aghead(f)).size == 1 ? in sameport()
229 ND_out(aghead(f)).list[0] : NULL) { in sameport()
H A Drank.c54 renewlist(&ND_out(n)); in cleanup1()
388 while ((e = ND_out(n).list[0])) { in minmax_edges()
413 if ((ND_out(n).size == 0) && GD_maxset(g) && (n != GD_maxset(g))) { in minmax_edges2()
899 alloc_elist(4, ND_out(n)); in makeXnode()
1167 free_list(ND_out(n)); in readout_levels()
1219 elist_append(e, ND_out(n)); in add_fast_edges()
H A Daspect.c1188 dummydiff = dummydiff - ND_in(v).size + ND_out(v).size; in countDummyDiff()
1214 myNodeInfo[i].outdegree = ND_out(v).size; in applyPromotionHeuristic()
1263 for (i = 0; i < ND_out(n).size; i++) { in allNeighborsAreBelow()
1264 e = ND_out(n).list[i]; in allNeighborsAreBelow()
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/
H A Dconstraint.c146 elist_append(ce, ND_out(t)); in mapGraphs()
237 alloc_elist(0, ND_out(n)); in mkNConstraintG()
281 elist_append(e, ND_out(n)); in mkNConstraintG()
356 elist_append(e, ND_out(prev)); in mkConstraintG()
364 alloc_elist(0, ND_out(prev)); in mkConstraintG()
418 alloc_elist(0, ND_out(vn)); in mkConstraintG()
424 alloc_elist(1, ND_out(an)); in mkConstraintG()
428 elist_append(e, ND_out(root)); in mkConstraintG()
432 elist_append(e, ND_out(an)); in mkConstraintG()
436 elist_append(e, ND_out(n)); in mkConstraintG()
[all …]
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Dns.c130 for (i = 0; (e = ND_out(v).list[i]); i++) { in init_rank()
188 for (i = 0; (e = ND_out(v).list[i]); i++) { in dfs_enter_outedge()
285 for (i = 0; (e = ND_out(v).list[i]); i++) { in tight_subtree_search()
348 for (i = 0; (e = ND_out(v).list[i]); i++) { in inter_tree_edge_search()
701 if (ND_out(n).size == 0) in TB_balance()
765 for (i = 0; (e = ND_out(n).list[i]); i++) in init_graph()
787 for (i = 0; (e = ND_out(n).list[i]); i++); in init_graph()
807 for (i = 0; (e = ND_out(n).list[i]); i++) { in graphSize()
929 for (i = 0; (e = ND_out(v).list[i]); i++) in x_cutval()
1112 for (i = 0; (e = ND_out(n).list[i]); i++) { in dump_graph()
[all …]
H A Dhtmltable.c1397 free_list(ND_out(n)); in closeGraphs()
1419 elist_append(e, ND_out(t)); in checkChain()
1442 elist_append(e, ND_out(t)); in checkEdge()
1470 alloc_elist(tbl->rc, ND_out(t)); in makeGraphs()
1483 alloc_elist(tbl->cc, ND_out(t)); in makeGraphs()
H A Dtypes.h522 #define ND_out(n) (((Agnodeinfo_t*)AGDATA(n))->out) macro
H A Dsplines.c341 for (cnt_out = 0; (e = ND_out(n).list[cnt_out]); cnt_out++) in conc_slope()
347 p.y = ND_coord(aghead(ND_out(n).list[0])).y - ND_coord(n).y; in conc_slope()