sfg-cflow-callfraph.gv 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  1. sfg_addedge() <int sfg_addedge (int number, int from, int to, int tx, int ty) at sfg.c:412>:
  2. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  3. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  4. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  5. calloc()
  6. free()
  7. sfg_addnode() <int sfg_addnode (int number, int tx, int ty) at sfg.c:342>:
  8. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  9. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  10. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  11. calloc()
  12. free()
  13. uniqnode_add() <void uniqnode_add (struct gml_graph *g, struct gml_node *node) at sfg.c:1781>:
  14. splay_tree_new() <splay_tree splay_tree_new (splay_tree_compare_fn compare_fn, splay_tree_delete_key_fn delete_key_fn, splay_tree_delete_value_fn delete_value_fn) at sfg.c:1519>:
  15. calloc()
  16. splay_tree_compare_ints() <int splay_tree_compare_ints (splay_tree_key k1, splay_tree_key k2) at sfg.c:1638>
  17. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  18. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  19. splay_tree_insert() <void splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value) at sfg.c:1547>:
  20. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  21. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  22. calloc()
  23. sfg_crossings() <int sfg_crossings (void) at sfg.c:570>:
  24. sfg_deinit() <int sfg_deinit (void) at sfg.c:304>:
  25. free()
  26. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  27. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  28. free()
  29. clear_edgelist() <void clear_edgelist (struct gml_graph *g) at sfg.c:1825>:
  30. free()
  31. clear_nodelist() <void clear_nodelist (struct gml_graph *g) at sfg.c:1804>:
  32. free()
  33. splay_tree_delete() <splay_tree splay_tree_delete (splay_tree sp) at sfg.c:1505>:
  34. splay_tree_delete_helper() <void splay_tree_delete_helper (splay_tree sp, splay_tree_node node) at sfg.c:1476> (R):
  35. splay_tree_delete_helper() <void splay_tree_delete_helper (splay_tree sp, splay_tree_node node) at sfg.c:1476> (recursive: see 34)
  36. free()
  37. free()
  38. sfg_edge_foreach() <int sfg_edge_foreach (int (*getedgedata) (int num, int from, int to, int type, int rev)) at sfg.c:1414>:
  39. sfg_edgefrom() <int sfg_edgefrom (int num) at sfg.c:1292>:
  40. findedge() <struct gml_edge *findedge (int num) at sfg.c:5575>:
  41. sfg_edgelabels() <int sfg_edgelabels (int status) at sfg.c:602>:
  42. sfg_edgemax() <int sfg_edgemax (void) at sfg.c:966>:
  43. sfg_edgemin() <int sfg_edgemin (void) at sfg.c:946>:
  44. sfg_edgerev() <int sfg_edgerev (int num) at sfg.c:1378>:
  45. findedge() <struct gml_edge *findedge (int num) at sfg.c:5575>:
  46. sfg_edgeto() <int sfg_edgeto (int num) at sfg.c:1318>:
  47. findedge() <struct gml_edge *findedge (int num) at sfg.c:5575>:
  48. sfg_edgetype() <int sfg_edgetype (int num) at sfg.c:1344>:
  49. findedge() <struct gml_edge *findedge (int num) at sfg.c:5575>:
  50. sfg_init() <int sfg_init (void) at sfg.c:280>:
  51. calloc()
  52. splay_tree_new() <splay_tree splay_tree_new (splay_tree_compare_fn compare_fn, splay_tree_delete_key_fn delete_key_fn, splay_tree_delete_value_fn delete_value_fn) at sfg.c:1519>:
  53. calloc()
  54. splay_tree_compare_ints() <int splay_tree_compare_ints (splay_tree_key k1, splay_tree_key k2) at sfg.c:1638>
  55. sfg_initialcrossings() <int sfg_initialcrossings (void) at sfg.c:586>:
  56. sfg_layout() <int sfg_layout (void) at sfg.c:499>:
  57. prep() <void prep (struct gml_graph *g) at sfg.c:1846>:
  58. reorg() <void reorg (struct gml_graph *g) at sfg.c:1861>:
  59. calloc()
  60. free()
  61. uncycle() <void uncycle (struct gml_graph *g) at sfg.c:2020>:
  62. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  63. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  64. free()
  65. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  66. calloc()
  67. decycle3() <int decycle3 (struct gml_graph *g, struct gml_node *n, int level) at sfg.c:1968> (R):
  68. decycle3() <int decycle3 (struct gml_graph *g, struct gml_node *n, int level) at sfg.c:1968> (recursive: see 67)
  69. ylevels() <void ylevels (struct gml_graph *g) at sfg.c:2199>:
  70. add_singlenode() <void add_singlenode (struct gml_graph *g, struct gml_node *node) at sfg.c:2181>:
  71. calloc()
  72. set_level2() <void set_level2 (struct gml_graph *g, struct gml_node *n, int i, int startnode) at sfg.c:2312> (R):
  73. set_level2() <void set_level2 (struct gml_graph *g, struct gml_node *n, int i, int startnode) at sfg.c:2312> (recursive: see 72)
  74. calloc()
  75. shorteredges() <void shorteredges (struct gml_graph *g) at sfg.c:2398>:
  76. unrev() <void unrev (struct gml_graph *g) at sfg.c:2354>:
  77. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  78. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  79. free()
  80. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  81. calloc()
  82. do_abs() <int do_abs (int i) at sfg.c:2388>
  83. edgesdownwards() <void edgesdownwards (struct gml_graph *g) at sfg.c:2432>:
  84. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  85. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  86. free()
  87. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  88. calloc()
  89. edgelen() <void edgelen (struct gml_graph *g) at sfg.c:2474>:
  90. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  91. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  92. free()
  93. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  94. calloc()
  95. doublespacey() <void doublespacey (struct gml_graph *g) at sfg.c:2507>:
  96. edgelabels() <void edgelabels (struct gml_graph *g) at sfg.c:2659>:
  97. add_new_dummynode() <void add_new_dummynode (struct gml_graph *g, int foundid) at sfg.c:2526>:
  98. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  99. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  100. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  101. calloc()
  102. uniqnode_add() <void uniqnode_add (struct gml_graph *g, struct gml_node *node) at sfg.c:1781>:
  103. splay_tree_new() <splay_tree splay_tree_new (splay_tree_compare_fn compare_fn, splay_tree_delete_key_fn delete_key_fn, splay_tree_delete_value_fn delete_value_fn) at sfg.c:1519>:
  104. calloc()
  105. splay_tree_compare_ints() <int splay_tree_compare_ints (splay_tree_key k1, splay_tree_key k2) at sfg.c:1638>
  106. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  107. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  108. splay_tree_insert() <void splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value) at sfg.c:1547>:
  109. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  110. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  111. calloc()
  112. free()
  113. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  114. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  115. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  116. add_new_dummyedge() <void add_new_dummyedge (struct gml_graph *g, int foundsource, int foundtarget, int reversed) at sfg.c:2559>:
  117. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  118. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  119. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  120. calloc()
  121. free()
  122. del_edge() <void del_edge (struct gml_graph *g, struct gml_elist *edgeel) at sfg.c:2603>:
  123. free()
  124. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  125. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  126. free()
  127. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  128. calloc()
  129. splitedges() <void splitedges (struct gml_graph *g) at sfg.c:2744>:
  130. add_new_dummynode() <void add_new_dummynode (struct gml_graph *g, int foundid) at sfg.c:2526>:
  131. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  132. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  133. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  134. calloc()
  135. uniqnode_add() <void uniqnode_add (struct gml_graph *g, struct gml_node *node) at sfg.c:1781>:
  136. splay_tree_new() <splay_tree splay_tree_new (splay_tree_compare_fn compare_fn, splay_tree_delete_key_fn delete_key_fn, splay_tree_delete_value_fn delete_value_fn) at sfg.c:1519>:
  137. calloc()
  138. splay_tree_compare_ints() <int splay_tree_compare_ints (splay_tree_key k1, splay_tree_key k2) at sfg.c:1638>
  139. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  140. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  141. splay_tree_insert() <void splay_tree_insert (splay_tree sp, splay_tree_key key, splay_tree_value value) at sfg.c:1547>:
  142. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  143. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  144. calloc()
  145. free()
  146. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  147. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  148. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  149. add_new_dummyedge() <void add_new_dummyedge (struct gml_graph *g, int foundsource, int foundtarget, int reversed) at sfg.c:2559>:
  150. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  151. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  152. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  153. calloc()
  154. free()
  155. del_edge() <void del_edge (struct gml_graph *g, struct gml_elist *edgeel) at sfg.c:2603>:
  156. free()
  157. nodecounts() <void nodecounts (struct gml_graph *g) at sfg.c:2807>:
  158. clear_stlist_all() <void clear_stlist_all (struct gml_graph *g) at sfg.c:2169>:
  159. clear_stlist() <void clear_stlist (struct gml_node *node) at sfg.c:2137>:
  160. free()
  161. make_stlist() <void make_stlist (struct gml_graph *g) at sfg.c:2071>:
  162. calloc()
  163. calloc()
  164. barycenter() <void barycenter (struct gml_graph *g, int it1v, int it2v) at sfg.c:4216>:
  165. calloc()
  166. bc_n() <void bc_n (struct gml_graph *g, int it1value, int it2value) at sfg.c:3597>:
  167. calloc()
  168. make_matrix() <void make_matrix (struct gml_graph *g, int l, struct mmatrix *m) at sfg.c:2990>:
  169. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  170. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  171. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  172. copy_a() <inline void copy_a (struct gml_graph *g, struct mmatrix **mm1, struct mmatrix **mm2) at sfg.c:3170>:
  173. copy_m() <void copy_m (struct mmatrix *m1, struct mmatrix *m2) at sfg.c:3114>:
  174. do_memmove() <void *do_memmove (void *dst, void *src, size_t count) at sfg.c:3095>
  175. number_of_crossings_a() <int number_of_crossings_a (struct gml_graph *g, struct mmatrix **mm) at sfg.c:2971>:
  176. number_of_crossings3() <int number_of_crossings3 (struct mmatrix *m, int r, int c) at sfg.c:2936>:
  177. number_of_crossings2() <int number_of_crossings2 (struct mmatrix *m, int r, int c) at sfg.c:2915>:
  178. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  179. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  180. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  181. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  182. phase1_down() <inline int phase1_down (struct gml_graph *g, struct mmatrix **mm) at sfg.c:3478>:
  183. b_c() <int b_c (struct mmatrix *m1, struct mmatrix *m2, int max_r, int max_c) at sfg.c:3420>:
  184. column_barycenter() <double column_barycenter (struct mmatrix *m, int j, int maxval) at sfg.c:3291>:
  185. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  186. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  187. exch_columns() <void exch_columns (struct mmatrix *m, int c1, int c2) at sfg.c:3212>:
  188. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  189. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  190. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  191. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  192. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  193. exch_rows() <void exch_rows (struct mmatrix *m, int r1, int r2) at sfg.c:3181>:
  194. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  195. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  196. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  197. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  198. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  199. phase1_up() <inline int phase1_up (struct gml_graph *g, struct mmatrix **mm) at sfg.c:3493>:
  200. b_r() <int b_r (struct mmatrix *m1, struct mmatrix *m2, int max_r, int max_c) at sfg.c:3378>:
  201. row_barycenter() <double row_barycenter (struct mmatrix *m, int i, int maxval) at sfg.c:3271>:
  202. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  203. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  204. exch_rows() <void exch_rows (struct mmatrix *m, int r1, int r2) at sfg.c:3181>:
  205. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  206. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  207. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  208. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  209. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  210. exch_columns() <void exch_columns (struct mmatrix *m, int c1, int c2) at sfg.c:3212>:
  211. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  212. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  213. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  214. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  215. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  216. equal_a() <int equal_a (struct gml_graph *g, struct mmatrix **mm1, struct mmatrix **mm2) at sfg.c:3150>:
  217. equal_m() <int equal_m (struct mmatrix *m1, struct mmatrix *m2, int r, int c) at sfg.c:3133>:
  218. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  219. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  220. phase2_down() <inline int phase2_down (struct gml_graph *g, struct mmatrix **mm) at sfg.c:3515>:
  221. column_barycenter() <double column_barycenter (struct mmatrix *m, int j, int maxval) at sfg.c:3291>:
  222. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  223. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  224. sorted() <int sorted (double *vector, int maxval) at sfg.c:3464>
  225. r_c() <int r_c (struct mmatrix *m1, struct mmatrix *m2, int max_r, int max_c) at sfg.c:3345>:
  226. column_barycenter() <double column_barycenter (struct mmatrix *m, int j, int maxval) at sfg.c:3291>:
  227. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  228. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  229. reverse_c() <int reverse_c (struct mmatrix *m, int c1, int c2) at sfg.c:3257>:
  230. exch_columns() <void exch_columns (struct mmatrix *m, int c1, int c2) at sfg.c:3212>:
  231. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  232. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  233. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  234. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  235. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  236. reverse_r() <int reverse_r (struct mmatrix *m, int r1, int r2) at sfg.c:3243>:
  237. exch_rows() <void exch_rows (struct mmatrix *m, int r1, int r2) at sfg.c:3181>:
  238. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  239. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  240. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  241. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  242. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  243. phase2_up() <inline int phase2_up (struct gml_graph *g, struct mmatrix **mm) at sfg.c:3554>:
  244. row_barycenter() <double row_barycenter (struct mmatrix *m, int i, int maxval) at sfg.c:3271>:
  245. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  246. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  247. sorted() <int sorted (double *vector, int maxval) at sfg.c:3464>
  248. r_r() <int r_r (struct mmatrix *m1, struct mmatrix *m2, int max_r, int max_c) at sfg.c:3312>:
  249. row_barycenter() <double row_barycenter (struct mmatrix *m, int i, int maxval) at sfg.c:3271>:
  250. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  251. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  252. reverse_r() <int reverse_r (struct mmatrix *m, int r1, int r2) at sfg.c:3243>:
  253. exch_rows() <void exch_rows (struct mmatrix *m, int r1, int r2) at sfg.c:3181>:
  254. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  255. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  256. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  257. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  258. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  259. reverse_c() <int reverse_c (struct mmatrix *m, int c1, int c2) at sfg.c:3257>:
  260. exch_columns() <void exch_columns (struct mmatrix *m, int c1, int c2) at sfg.c:3212>:
  261. mget() <inline int mget (struct mmatrix *m, int i, int j) at sfg.c:2899>:
  262. testbit() <inline int testbit (struct mmatrix *m, unsigned char a[], int k) at sfg.c:2870>:
  263. mget_set() <inline void mget_set (struct mmatrix *m, int i, int j, int value) at sfg.c:2905>:
  264. setbit() <inline void setbit (unsigned char a[], int k) at sfg.c:2852>:
  265. clearbit() <inline void clearbit (unsigned char a[], int k) at sfg.c:2861>:
  266. store_new_positions() <void store_new_positions (struct gml_graph *g, struct mmatrix *m, int level) at sfg.c:3059>:
  267. su_find_node_with_number() <struct gml_node *su_find_node_with_number (struct gml_graph *g, int nr) at sfg.c:3054>:
  268. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  269. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  270. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  271. free()
  272. improve_positions() <void improve_positions (struct gml_graph *g) at sfg.c:5440>:
  273. make_cnodelist() <void make_cnodelist (struct gml_graph *g) at sfg.c:4889>:
  274. calloc()
  275. make_cnnodes_at_level() <void make_cnnodes_at_level (struct gml_graph *g) at sfg.c:4857>:
  276. calloc()
  277. improve_positions2local() <void improve_positions2local (struct gml_graph *g) at sfg.c:4785>:
  278. calloc()
  279. make_node_list_down() <void make_node_list_down (int l) at sfg.c:4509>:
  280. is_dummy() <int is_dummy (struct gml_node *node) at sfg.c:4288>
  281. upper_connectivity() <int upper_connectivity (struct gml_node *node) at sfg.c:4298>:
  282. sort() <void sort (int n) at sfg.c:4451>:
  283. do_down() <void do_down (int l) at sfg.c:4558>:
  284. find_next() <int find_next (int n) at sfg.c:4541>:
  285. upper_barycenter() <int upper_barycenter (struct gml_node *node) at sfg.c:4370>:
  286. upper_connectivity() <int upper_connectivity (struct gml_node *node) at sfg.c:4298>:
  287. do_floor() <double do_floor (double num) at sfg.c:4358>
  288. free()
  289. make_node_list_up() <void make_node_list_up (int l) at sfg.c:4475>:
  290. is_dummy() <int is_dummy (struct gml_node *node) at sfg.c:4288>
  291. lower_connectivity() <int lower_connectivity (struct gml_node *node) at sfg.c:4328>:
  292. sort() <void sort (int n) at sfg.c:4451>:
  293. do_up() <void do_up (int l) at sfg.c:4672>:
  294. find_next() <int find_next (int n) at sfg.c:4541>:
  295. lower_barycenter() <int lower_barycenter (struct gml_node *node) at sfg.c:4411>:
  296. lower_connectivity() <int lower_connectivity (struct gml_node *node) at sfg.c:4328>:
  297. do_floor() <double do_floor (double num) at sfg.c:4358>
  298. move0() <void move0 (void) at sfg.c:4940>:
  299. cfinalxy() <void cfinalxy (struct gml_graph *g) at sfg.c:5187>:
  300. make_cposnodes() <void make_cposnodes (void) at sfg.c:4969>:
  301. calloc()
  302. clear_cposnodes() <void clear_cposnodes (void) at sfg.c:5059>:
  303. free()
  304. make_clevelnodes() <void make_clevelnodes (struct gml_graph *g) at sfg.c:5091>:
  305. calloc()
  306. calloc()
  307. clear_clevelnodes() <void clear_clevelnodes (struct gml_graph *g) at sfg.c:5155>:
  308. free()
  309. free()
  310. tunedummy() <void tunedummy (struct gml_graph *g) at sfg.c:5361>:
  311. tunenodes() <void tunenodes (struct gml_graph *g) at sfg.c:5395>:
  312. movefinal() <void movefinal (int xoffset) at sfg.c:5344>:
  313. clear_cnnodes_at_level() <void clear_cnnodes_at_level (void) at sfg.c:4874>:
  314. free()
  315. clear_cnodelist() <void clear_cnodelist (void) at sfg.c:4919>:
  316. free()
  317. finalxy() <void finalxy (struct gml_graph *g) at sfg.c:5519>:
  318. setminmax() <void setminmax (struct gml_graph *g) at sfg.c:5594>:
  319. sfg_maxx() <int sfg_maxx (void) at sfg.c:873>:
  320. sfg_maxy() <int sfg_maxy (void) at sfg.c:889>:
  321. sfg_nedges() <int sfg_nedges (void) at sfg.c:1017>:
  322. sfg_nlevels() <int sfg_nlevels (void) at sfg.c:985>:
  323. sfg_nnodes() <int sfg_nnodes (void) at sfg.c:1001>:
  324. sfg_node_foreach() <int sfg_node_foreach (int (*getnodedata) (int num, int level, int pos, int xpos, int ypos, int tx, int ty, int nselfedges, int type, int indegree, int outdegree, int ly0, int ly1)) at sfg.c:1252>:
  325. sfg_nodedata() <void *sfg_nodedata (int num) at sfg.c:1177>:
  326. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  327. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  328. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  329. sfg_nodeenum() <int sfg_nodeenum (int num) at sfg.c:1148>:
  330. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  331. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  332. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  333. sfg_nodeindegree() <int sfg_nodeindegree (int num) at sfg.c:1095>:
  334. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  335. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  336. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  337. sfg_nodely0() <int sfg_nodely0 (int num) at sfg.c:729>:
  338. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  339. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  340. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  341. sfg_nodely1() <int sfg_nodely1 (int num) at sfg.c:755>:
  342. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  343. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  344. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  345. sfg_nodemax() <int sfg_nodemax (void) at sfg.c:926>:
  346. sfg_nodemin() <int sfg_nodemin (void) at sfg.c:906>:
  347. sfg_nodeoutdegree() <int sfg_nodeoutdegree (int num) at sfg.c:1121>:
  348. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  349. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  350. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  351. sfg_noderelxpos() <int sfg_noderelxpos (int num) at sfg.c:677>:
  352. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  353. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  354. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  355. sfg_noderelypos() <int sfg_noderelypos (int num) at sfg.c:703>:
  356. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  357. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  358. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  359. sfg_nodeselfedges() <int sfg_nodeselfedges (int num) at sfg.c:1069>:
  360. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  361. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  362. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  363. sfg_nodetype() <int sfg_nodetype (int num) at sfg.c:1035>:
  364. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  365. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  366. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  367. sfg_nodexpos() <int sfg_nodexpos (int num) at sfg.c:625>:
  368. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  369. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  370. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  371. sfg_nodexsize() <int sfg_nodexsize (int num) at sfg.c:781>:
  372. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  373. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  374. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  375. sfg_nodeypos() <int sfg_nodeypos (int num) at sfg.c:651>:
  376. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  377. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  378. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  379. sfg_nodeysize() <int sfg_nodeysize (int num) at sfg.c:807>:
  380. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  381. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  382. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  383. sfg_setnodedata() <int sfg_setnodedata (int num, void *data) at sfg.c:1203>:
  384. uniqnode() <struct gml_node *uniqnode (struct gml_graph *g, int nr) at sfg.c:1764>:
  385. splay_tree_lookup() <splay_tree_node splay_tree_lookup (splay_tree sp, splay_tree_key key) at sfg.c:1603>:
  386. splay() <struct splay_tree_node_n *splay (splay_tree sp, splay_tree_key key) at sfg.c:1650>:
  387. sfg_version() <int sfg_version (void) at sfg.c:270>
  388. sfg_xspacing() <int sfg_xspacing (int num) at sfg.c:832>:
  389. sfg_yspacing() <int sfg_yspacing (int num) at sfg.c:853>: