splay-tree.ll.callgraph.gv 2.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. digraph "Call Graph"{
  2. label="Call Graph";
  3. Nodesplay_tree_compare_pointers [shape=record, label="{splay_tree_compare_pointers}"];
  4. Nodesplay_tree_min [shape=record, label="{splay_tree_min}"];
  5. Nodesplay_tree_new [shape=record, label="{splay_tree_new}"];
  6. Nodedp_calloc [shape=record, label="{dp_calloc}"];
  7. Nodesplay_tree_compare_ints [shape=record, label="{splay_tree_compare_ints}"];
  8. Nodesplay_tree_insert [shape=record, label="{splay_tree_insert}"];
  9. Nodesplay_tree_delete [shape=record, label="{splay_tree_delete}"];
  10. Nodesplay_tree_max [shape=record, label="{splay_tree_max}"];
  11. Nodesplay_tree_malloc [shape=record, label="{splay_tree_malloc}"];
  12. Nodesplay_tree_remove [shape=record, label="{splay_tree_remove}"];
  13. Nodesplay_tree_foreach [shape=record, label="{splay_tree_foreach}"];
  14. Nodesplay_tree_free_value [shape=record, label="{splay_tree_free_value}"];
  15. Nodesplay [shape=record, label="{splay}"];
  16. Nodesplay_tree_compare_strings [shape=record, label="{splay_tree_compare_strings}"];
  17. Nodesplay_tree_has_data [shape=record, label="{splay_tree_has_data}"];
  18. Nodesplay_tree_free_key [shape=record, label="{splay_tree_free_key}"];
  19. Nodesplay_tree_free [shape=record, label="{splay_tree_free}"];
  20. Nodesplay_tree_successor [shape=record, label="{splay_tree_successor}"];
  21. Nodesplay_tree_lookup [shape=record, label="{splay_tree_lookup}"];
  22. Nodestrcmp [shape=record, label="{strcmp}"];
  23. Nodedp_free [shape=record, label="{dp_free}"];
  24. Nodesplay_tree_foreach -> Nodesplay_tree_min;
  25. Nodesplay_tree_foreach -> Nodesplay_tree_successor;
  26. Nodesplay_tree_new -> Nodesplay_tree_malloc;
  27. Nodesplay_tree_insert -> Nodesplay_tree_lookup;
  28. Nodesplay_tree_insert -> Nodesplay_tree_malloc;
  29. Nodesplay_tree_remove -> Nodesplay_tree_lookup;
  30. Nodesplay_tree_remove -> Nodesplay_tree_free;
  31. Nodesplay_tree_malloc -> Nodedp_calloc;
  32. Nodesplay_tree_free_value -> Nodesplay_tree_free;
  33. Nodesplay_tree_compare_strings -> Nodestrcmp;
  34. Nodesplay_tree_free -> Nodedp_free;
  35. Nodesplay_tree_successor -> Nodesplay;
  36. Nodesplay_tree_lookup -> Nodesplay;
  37. Nodesplay_tree_delete -> Nodesplay_tree_min;
  38. Nodesplay_tree_delete -> Nodesplay_tree_successor;
  39. Nodesplay_tree_delete -> Nodesplay_tree_malloc;
  40. Nodesplay_tree_delete -> Nodesplay_tree_min;
  41. Nodesplay_tree_delete -> Nodesplay_tree_successor;
  42. Nodesplay_tree_delete -> Nodesplay_tree_remove;
  43. Nodesplay_tree_delete -> Nodesplay_tree_free;
  44. Nodesplay_tree_delete -> Nodesplay_tree_free;
  45. Nodesplay_tree_free_key -> Nodesplay_tree_free;
  46. }