Searched refs:alloc_elist (Results 1 – 9 of 9) sorted by relevance
/dports/graphics/graphviz/graphviz-2.44.1/lib/neatogen/ |
H A D | constraint.c | 236 alloc_elist(0, ND_in(n)); in mkNConstraintG() 237 alloc_elist(0, ND_out(n)); in mkNConstraintG() 346 alloc_elist(lcnt, ND_in(n)); in mkConstraintG() 349 alloc_elist(2 * (cnt - 1), ND_out(prev)); in mkConstraintG() 351 alloc_elist(cnt - lcnt - 1, ND_out(prev)); in mkConstraintG() 364 alloc_elist(0, ND_out(prev)); in mkConstraintG() 418 alloc_elist(0, ND_out(vn)); in mkConstraintG() 419 alloc_elist(2, ND_in(vn)); in mkConstraintG() 423 alloc_elist(1, ND_in(an)); in mkConstraintG() 424 alloc_elist(1, ND_out(an)); in mkConstraintG()
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/ |
H A D | dotinit.c | 42 alloc_elist(4, ND_in(n)); in dot_init_node() 43 alloc_elist(4, ND_out(n)); in dot_init_node() 44 alloc_elist(2, ND_flat_in(n)); in dot_init_node() 45 alloc_elist(2, ND_flat_out(n)); in dot_init_node() 46 alloc_elist(2, ND_other(n)); in dot_init_node()
|
H A D | fastgr.c | 253 alloc_elist(4, ND_in(n)); in named_virtual_node() 254 alloc_elist(4, ND_out(n)); in named_virtual_node()
|
H A D | sameport.c | 92 alloc_elist(1, same[i].l); in sameedge()
|
H A D | rank.c | 898 alloc_elist(4, ND_in(n)); in makeXnode() 899 alloc_elist(4, ND_out(n)); in makeXnode()
|
H A D | position.c | 205 alloc_elist(n_in + 3, ND_in(n)); in allocate_aux_edges() 206 alloc_elist(3, ND_out(n)); in allocate_aux_edges()
|
H A D | mincross.c | 1159 alloc_elist(4, ND_in(n)); in realFillRanks() 1160 alloc_elist(4, ND_out(n)); in realFillRanks()
|
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/ |
H A D | htmltable.c | 1469 alloc_elist(tbl->rc, ND_in(t)); in makeGraphs() 1470 alloc_elist(tbl->rc, ND_out(t)); in makeGraphs() 1482 alloc_elist(tbl->cc, ND_in(t)); in makeGraphs() 1483 alloc_elist(tbl->cc, ND_out(t)); in makeGraphs()
|
H A D | types.h | 273 #define alloc_elist(n,L) do {L.size = 0; L.list = N_NEW(n + 1,edge_t*); } while (0) macro
|