5 * File name: ir/ana/ecg.c
6 * Purpose: Extended Call Graph
11 * Copyright: (c) 1999-2004 Universität Karlsruhe
12 * Licence: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE.
20 Erweiterter Aufrufgraph.
25 /* #include "eset.h" */
41 /* Lists, err, Sets */
42 typedef struct lset_entry
45 struct lset_entry *next;
51 lset_entry_t *last; /* useful for lset_append */
52 lset_entry_t *curs; /* for lset_first/lset_next */
57 typedef enum typalise_kind_enum {
58 type_invalid = 0, /* invalid (only set at deletion time) */
59 type_exact = 1, /* this and only this type (res.type) */
60 type_types = 2, /* these types (res.types) */
61 type_type = 3 /* this type and sub types (res.type) */
64 typedef struct typalise
69 type *type; /* for kind == kind_exact and kind == kind_type */
70 lset_t *types; /* for kind == kind_types */
78 static int verbose = 0;
79 static int do_typalise = 0;
85 /* mapping from method graphs (callR) to method graphs (lset_ts of callEds) */
86 /* static pmap *calls; */
87 static pmap *graph_infos;
89 /** Counters for ecg_ecg and friends */
90 static long _graphs = 0;
91 static long _calls = 0;
93 static int _depth = 0;
94 static int _max_depth = 0;
96 static int _max_callEds = 0;
97 static entity* _max_callEds_callR = NULL;
99 static long ta_id = 0;
101 /* ====================
103 ==================== */
104 /* create a new lset */
105 static lset_t *lset_create ()
107 lset_t *lset = xmalloc (sizeof (lset_t));
112 /* check whether the lset contains an entry for the given data */
113 static int lset_contains (lset_t *lset, void *data)
115 lset_entry_t *entry = lset->first;
117 while (NULL != entry) {
118 if (data == entry->data) {
128 /* check whether the given lset is empty */
129 static int lset_empty (lset_t *lset)
131 return (NULL == lset->first);
135 /* insert the data into the lset (unless there's an entry for it
137 static void lset_insert (lset_t *lset, void *data)
139 if (! lset_contains (lset, data)) {
140 lset_entry_t *entry = xmalloc (sizeof (lset_entry_t));
142 entry->next = lset->first;
145 if (NULL == lset->last) {
153 /* insert all entries from src into tgt */
154 static void lset_insert_all (lset_t *tgt, lset_t *src)
156 lset_entry_t *curs = src->first;
158 while (NULL != curs) {
159 lset_insert (tgt, curs->data);
165 /* append src to tgt. src is deallocated. */
166 static void lset_append (lset_t *tgt, lset_t *src)
168 assert (! tgt->last->next);
170 tgt->last->next = src->first;
171 tgt->last = src->last;
172 tgt->n_entries += src->n_entries;
174 memset (src, 0x00, sizeof (lset_t));
178 /* remove the entry for the given data element from the lset. return
179 TRUE iff it was on the list in the first place, FALSE else */
180 static int lset_remove (lset_t *lset, void *data)
182 lset_entry_t *entry = lset->first;
183 lset_entry_t *prev = NULL;
185 while (NULL != entry) {
186 if (data == entry->data) {
187 /* ok, dike it out */
189 if (NULL == prev) { /* ok, it's lset->first that needs diking */
190 lset->first = entry->next;
192 prev->next = entry->next;
195 memset (entry, 0x00, sizeof (lset_entry_t));
210 /* prepare the given lset for an iteration. return the first element. */
211 static void *lset_first (lset_t *lset)
213 lset->curs = lset->first;
216 return (lset->first->data);
222 /* after calling lset_first, get the next element, if applicable, or
224 static void *lset_next (lset_t *lset)
226 lset->curs = lset->curs->next;
229 return (lset->curs->data);
235 /* say how many entries there are in the given lset */
236 static int lset_n_entries (lset_t *lset)
238 return (lset->n_entries);
241 /* deallocate the lset and all of its entries */
242 static void lset_destroy (lset_t *lset)
244 lset_entry_t *curs = lset->first;
246 while (NULL != curs) {
247 lset_entry_t *tmp = curs->next;
249 memset (curs, 0x00, sizeof (lset_entry_t));
255 memset (lset, 0x00, sizeof (lset_t));
259 /* ====================
261 ==================== */
263 Find out whether the given clazz uses the given implementation of a
264 method. Presumably, this is because clazz inherits the graph as
265 the implementation for a method.
267 static int uses_graph (type *clazz, entity *meth, ir_graph *graph)
269 type *g_clazz = get_entity_owner (meth);
271 if (g_clazz == clazz) {
275 if (peculiarity_existent == get_entity_peculiarity (meth)) {
276 ir_graph *g_graph = get_entity_irg (meth);
278 if (g_graph != graph) {
283 /* else inherited or description */
286 int n_over = get_entity_n_overwrittenby (meth); /* DOWN-wards */
288 for (i = 0; (i < n_over) && (!use); i ++) {
289 entity *over = get_entity_overwrittenby (meth, i);
291 use |= uses_graph (clazz, over, graph);
299 Find out whether otype is a subtype of stype.
300 Return non-zero iff otype is a subtype of stype.
302 static int is_subtype (type *otype, type *stype)
304 int n_sub = get_class_n_subtypes (stype);
308 if (otype == stype) {
312 for (i = 0; (!is_sub) && (i < n_sub); i ++) {
313 type *sub = get_class_subtype (stype, i);
315 is_sub |= is_subtype (otype, sub);
323 Compute the closure of all subtypes of otype (including otype
326 static void _collect_subtypes (type *otype, lset_t *set)
328 lset_insert (set, otype);
330 int n_sub = get_class_n_subtypes (otype);
333 for (i = 0; i < n_sub; i ++) {
334 type *sub = get_class_subtype (otype, i);
336 _collect_subtypes (sub, set);
340 static lset_t *subtype_closure (type *otype)
342 lset_t *set = lset_create ();
344 _collect_subtypes (otype, set);
350 Helper method for get_owner_types
352 static void _collect_owner_types (entity *method, ir_graph *graph, lset_t *tps)
354 /* search DOWNwards in clazz hierarchy */
356 if ((peculiarity_description == get_entity_peculiarity (method)) ||
357 (peculiarity_inherited == get_entity_peculiarity (method))) {
358 lset_insert (tps, get_entity_owner (method));
359 } else if (peculiarity_existent == get_entity_peculiarity (method)) {
360 ir_graph *ex_graph = get_entity_irg (method);
362 if ((NULL == ex_graph) || (ex_graph == graph)) {
363 /* wtf? they define the same graph again? well, whatever: */
364 lset_insert (tps, get_entity_owner (method));
366 /* aha: they define a new graph. can't have that, so bail out */
371 int n_over = get_entity_n_overwrittenby (method);
374 for (i = 0; i < n_over; i ++) {
375 entity *ometh = get_entity_overwrittenby (method, i);
377 _collect_owner_types (ometh, graph, tps);
383 Collect all classes that use the given implementation of a method.
385 static lset_t *get_owner_types (ir_graph *graph)
387 lset_t *tps = lset_create ();
388 entity *meth = get_irg_entity (graph);
390 _collect_owner_types (meth, graph, tps);
397 Convenience funcs to create a typalise_t
399 static typalise_t *ta_exact (type *tp)
401 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
402 ta->kind = type_exact;
406 assert (is_class_type (tp));
411 static typalise_t *ta_types (lset_t *set)
413 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
414 ta->kind = type_types;
421 static typalise_t *ta_type (type *tp)
423 typalise_t *ta = (typalise_t*) xmalloc (sizeof (typalise_t));
424 ta->kind = type_type;
428 assert (is_class_type (tp));
433 static void ta_delete (typalise_t *ta)
435 if (type_types == ta->kind) {
436 lset_destroy (ta->res.types);
437 ta->res.types = NULL;
442 ta->kind = type_invalid;
448 Join 'one' and 'two'; both args are deallocated, result is freshly
451 static typalise_t *ta_join (typalise_t *one, typalise_t *two)
453 typalise_t *res = NULL;
459 if (one->res.type == two->res.type) {
462 lset_t *set = lset_create ();
463 lset_insert (set, one->res.type);
464 lset_insert (set, two->res.type);
465 res = ta_types (set);
473 lset_insert (two->res.types, one->res.type);
479 if (is_subtype (one->res.type, two->res.type)) {
483 lset_t *closure = subtype_closure (two->res.type);
484 lset_insert (closure, one->res.type);
496 res = ta_join (two, one);
499 lset_insert_all (one->res.types, two->res.types);
505 lset_t *closure = subtype_closure (two->res.type);
506 lset_append (one->res.types, closure);
517 res = ta_join (two, one);
520 res = ta_join (two, one);
523 type *one_type = one->res.type;
524 type *two_type = two->res.type;
526 if (is_subtype (one_type, two_type)) {
529 } else if (is_subtype (two_type, one_type)) {
533 lset_t *one_closure = subtype_closure (one->res.type);
534 lset_t *two_closure = subtype_closure (two->res.type);
536 lset_append (one_closure, two_closure);
541 res = ta_types (one_closure);
548 assert (res && "no result");
554 static const char *ta_name (typalise_t *ta)
556 # define BUF_SIZE 1024
557 static char buf [BUF_SIZE];
559 int len = sprintf (buf, "[%d] ", ta->id);
563 len += sprintf (buf+len, "only ");
564 strncat (buf, get_type_name (ta->res.type), BUF_SIZE);
567 len += sprintf (buf+len, "one_of ");
569 type *iter = lset_first (ta->res.types);
571 int size = BUF_SIZE - len - 1;
572 while ((NULL != iter) && (0 < size)) {
573 char *dest = strncat (buf, get_type_name (iter), size);
576 iter = lset_next (ta->res.types);
580 len += sprintf (buf+len, "poly ");
581 strncat (buf, get_type_name (ta->res.type), BUF_SIZE);
590 Check whether the given typalise_t includes the given type.
592 static int ta_supports (typalise_t *ta, ir_graph *graph)
597 lset_t *tps = get_owner_types (graph);
599 if (lset_contains (tps, ta->res.type)) {
608 entity *meth = get_irg_entity (graph);
609 type *tp = get_entity_owner (meth);
610 int res = is_subtype (tp, ta->res.type);
615 res = uses_graph (ta->res.type, meth, graph);
621 type *tp = get_entity_owner (get_irg_entity (graph));
623 return (lset_contains (ta->res.types, tp));
627 assert (0 && "invalid ta");
632 Given a set of graphs and a typalise_t, return the method(s) in
633 the set that are supported by the typalise_t. Also, deallocates
636 static lset_t *filter_for_ta (lset_t *set, typalise_t *ta)
638 lset_t *res = lset_create ();
639 ir_graph *curs = (ir_graph*) lset_first (set);
641 while (NULL != curs) {
642 if (ta_supports (ta, curs)) {
643 lset_insert (res, curs);
646 curs = lset_next (set);
656 Return a list containing all types of 'set' which are a subtype of 'type'.
658 static lset_t *filter_for_type (lset_t *set, type *stype)
660 type *curs = (type*) lset_first (set);
661 lset_t *lset = lset_create ();
663 while (NULL != curs) {
664 if (is_subtype (curs, stype)) {
665 lset_insert (lset, curs);
668 curs = lset_next (set);
675 Find an approximation to the given node's value's types
677 static typalise_t *typalise (ir_node*);
680 Find an approximation to the given proj node's value's types
682 static typalise_t *typalise_proj (ir_node *proj)
684 typalise_t *res = NULL;
685 ir_node *proj_in = get_Proj_pred (proj);
687 if (iro_Proj == get_irn_opcode (proj_in)) {
688 /* fprintf (stdout, "\tProj (Proj)\n"); */
690 proj_in = get_Proj_pred (proj_in);
691 if (iro_Start == get_irn_opcode (proj_in)) {
692 long n = get_Proj_proj (proj);
695 ir_graph *graph = get_irn_irg (proj);
696 entity *meth = get_irg_entity (graph);
697 type *tp = get_entity_owner (meth);
699 /* res = ta_exact (tp); */
700 res = ta_type (tp); /* TODO */
703 /* hey, even 'filtering' this NULL by the select of the actual
704 call is probably as "precise" as anything: */
707 } else if (iro_Call == get_irn_opcode (proj_in)) {
708 /* call result ... 'whatever' */
709 ir_node *call_ptr = get_Call_ptr (proj_in);
711 res = typalise (call_ptr);
713 fprintf (stdout, "\n Proj(Proj(%s)) not handled\n",
714 get_op_name (get_irn_op (proj_in)));
718 opcode op = get_irn_opcode (proj_in);
719 if ((iro_Load != op) && (iro_Alloc != op) && (iro_Call != op)) {
720 fprintf (stdout, "\n Proj(%s) not handled\n",
721 get_op_name (get_irn_op (proj_in)));
724 res = typalise (proj_in); /* everything else */
725 /* Proj(Load), Proj(New), Proj(Call) */
733 For the given ptr, do a quick check about what (class) types may be
736 static typalise_t *typalise (ir_node *node)
738 opcode op = get_irn_opcode (node);
739 typalise_t *res = NULL;
743 typalise_t *ta = NULL;
744 type *tp = get_Cast_type (node);
746 if (is_pointer_type (tp)) {
747 tp = get_pointer_points_to_type (tp);
749 assert (is_class_type (tp));
751 ta = typalise (get_Cast_op (node));
753 if (NULL == ta) { /* no type found */
755 } else if (type_exact == ta->kind) { /* one type found */
756 /* nothing (maybe check cast? */
757 } else if (type_type == ta->kind) { /* some types found */
758 if (is_subtype (tp, ta->res.type)) {
759 ta->res.type = tp; /* assume cast is correct */
761 /* should assert (is_subtype (ta->res.type, tp)) */
763 } else if (type_types == ta->kind) {
764 lset_t *ftp = filter_for_type (ta->res.types, tp);
765 lset_destroy (ta->res.types);
773 res = typalise_proj (node);
777 /* presumably it's call(load(ptr)) we're analyzing. */
778 ir_node *load_ptr = get_Load_ptr (node);
780 res = typalise (load_ptr);
785 /* it's call(sel(ptr)) or load(sel(ptr)) */
786 entity *ent = get_Sel_entity (node);
787 type *tp = get_entity_type (ent);
789 if (is_method_type (tp)) {
790 tp = get_entity_type (ent);
791 tp = get_method_res_type (tp, 0);
793 if (is_pointer_type (tp)) {
794 tp = get_pointer_points_to_type (tp);
798 } else if (is_class_type (tp)) {
799 tp = get_entity_type (ent);
801 if (is_pointer_type (tp)) {
802 tp = get_pointer_points_to_type (tp);
806 } else if (is_pointer_type (tp)) {
807 tp = get_pointer_points_to_type (tp);
810 assert (0 && "select not handled");
815 int n_ins = get_irn_arity (node);
817 ir_node *phi_in = NULL;
818 typalise_t *ta = NULL;
819 /* assert (0 && "Do we ever get here?"); */ /* apparently, we do. */
821 for (i = 0; i < n_ins; i ++) {
822 phi_in = get_irn_n (node, i);
823 ta = (NULL == ta) ? typalise (phi_in) : ta_join (ta, typalise (phi_in));
830 type *type = get_Alloc_type (node);
831 res = ta_exact (type);
835 /* presumably call(sel(proj(call))) */
836 ir_node *ptr = get_Call_ptr (node);
838 if (iro_Sel == get_irn_opcode (ptr)) {
839 meth = get_Sel_entity (ptr);
840 } else if (iro_SymConst == get_irn_opcode (ptr)) {
841 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
842 meth = get_SymConst_entity (ptr);
844 meth = NULL; /* WTF? */
849 type *tp = get_method_res_type ((type*) meth, 0);
852 /* could be anything */
853 /* fprintf (stdout, "meth=(null)"); */
857 fprintf (stdout, "]\n");
861 case (iro_SymConst): {
862 if (get_SymConst_kind(node) == symconst_type_tag) {
863 type *tp = get_SymConst_type (node);
866 } else if (get_SymConst_kind (node) == symconst_addr_ent) {
867 entity *ent = get_SymConst_entity (node);
868 type *tp = get_entity_type (ent);
869 tp = get_pointer_points_to_type (tp);
870 assert (is_class_type (tp));
872 res = ta_type (tp); /* can't use ta_exact */
874 fprintf (stdout, "can't handle SymConst %s?\n",
875 get_op_name (get_irn_op (node)));
886 fprintf (stdout, "what's with %s?\n", get_op_name (get_irn_op (node)));
895 /* ====================
897 ==================== */
899 Append the given callEd to the given callEd info.
901 static callEd_info_t *append_callEd_info (callEd_info_t *ced, ir_graph *callEd)
903 callEd_info_t *nced = (callEd_info_t*) xmalloc (sizeof (sizeof (callEd_info_t)));
905 nced->callEd = callEd;
912 Append all callEd methods of the given (call) node to the given graph_info.
914 static void append_calls (graph_info_t *info, ir_node *call, lset_t *callEds)
918 call_info_t *cinfo = (call_info_t*) xmalloc (sizeof (call_info_t));
922 cinfo->prev = info->calls;
924 cinfo->callEds = NULL;
927 ir_graph *callEd = lset_first (callEds);
929 cinfo->callEds = append_callEd_info (cinfo->callEds, callEd);
931 callEd = lset_next (callEds);
936 Append the (single) callEd to the given (call) node of the given graph_info.
938 static void append_call (graph_info_t *info, ir_node *call, ir_graph *callEd)
940 call_info_t *cinfo = (call_info_t*) xmalloc (sizeof (call_info_t));
943 cinfo->prev = info->calls;
946 cinfo->callEds = append_callEd_info (cinfo->callEds, callEd);
950 Given a method, find the firm graph that implements that method.
951 Return NULL for abstract and native methods.
953 static ir_graph *_get_implementing_graph (entity *method)
955 ir_graph *graph = NULL;
957 /* What's up with the fenced out stuff in rta? */
958 if (peculiarity_existent == get_entity_peculiarity (method)) {
959 if (visibility_external_allocated == get_entity_visibility (method)) {
960 /* Todo: native implementation */
964 graph = get_entity_irg (get_SymConst_entity (get_atomic_ent_value (method)));
965 assert (graph && "no graph");
969 } else if (0 && (peculiarity_description == get_entity_peculiarity (method))) {
970 /* abstract --- can't find an implementation */
971 graph = get_entity_irg (method);
972 assert (!graph && "graph in abstract method");
975 } else if ((peculiarity_description == get_entity_peculiarity (method)) ||
976 (peculiarity_inherited == get_entity_peculiarity (method))) {
979 int n_over = get_entity_n_overwrites (method);
983 for (i = 0; (NULL == graph) && (i < n_over); i ++) {
984 entity *over = get_entity_overwrites (method, i);
986 graph = _get_implementing_graph (over);
989 assert (0 && "invalid peculiarity");
997 Collect all graphs of 'method' in the given set.
999 static void _collect_implementing_graphs (entity *method, lset_t *set)
1001 /* search DOWN-wards in clazz hierarchy */
1003 int n_over = get_entity_n_overwrittenby (method);
1004 ir_graph *graph = get_entity_irg (method);
1006 if (NULL == graph) {
1007 graph = _get_implementing_graph (method);
1011 lset_insert (set, graph);
1014 for (i = 0; i < n_over; i ++) {
1015 entity *over = get_entity_overwrittenby (method, i);
1017 _collect_implementing_graphs (over, set);
1023 Collect all graphs that could possibly be executed when 'method' is called.
1025 static lset_t *get_implementing_graphs (entity *method, ir_node *select)
1027 lset_t *set = lset_create ();
1029 ir_graph *impl = _get_implementing_graph (method);
1032 lset_insert (set, impl);
1034 /* actually, abstract OR native */
1038 _collect_implementing_graphs (method, set);
1040 if (lset_empty (set)) {
1041 /* then it's a method which is only implemented natively, and we
1042 don' bother to analyse anything */
1046 void *tmp = lset_first (set);
1047 int n_graphs = lset_n_entries (set);
1049 /* typalise select_in */
1051 ir_node *select_in = get_Sel_ptr (select);
1052 typalise_t *ta = typalise (select_in);
1053 assert (ta && "typalise failed (go figure)");
1055 const char *res = ta_name (ta);
1057 /* fprintf (stdout, "typalyse res = %s\n", res); */
1059 if (1 != n_graphs) {
1060 set = filter_for_ta (set, ta);
1062 int n_filtered_graphs = lset_n_entries (set);
1064 fprintf (stdout, "%s: %02d %02d\n",
1068 n_graphs - n_filtered_graphs);
1069 n_graphs = n_filtered_graphs;
1073 if (n_graphs > _max_callEds) {
1074 _max_callEds = n_graphs;
1075 _max_callEds_callR = method;
1079 if (visibility_external_allocated != get_entity_visibility (method)) {
1080 if (0 == n_graphs) {
1081 /* fprintf (stdout, "no graphs for method %s\n", get_entity_name (method)); */
1082 assert (n_graphs && "no graphs for method");
1090 Action for the graph.
1092 static void ecg_calls_act (ir_node *node, void *env)
1094 opcode op = get_irn_opcode (node);
1096 if (iro_Call == op) { /* CALL */
1097 graph_info_t *graph_info = (graph_info_t*) env;
1100 ir_node *ptr = get_Call_ptr (node);
1103 if (iro_Sel == get_irn_opcode (ptr)) {
1104 ent = get_Sel_entity (ptr);
1105 lset_t *graphs = get_implementing_graphs (ent, ptr);
1107 append_calls (graph_info, node, graphs);
1108 } else if (iro_SymConst == get_irn_opcode (ptr)) {
1109 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
1110 ent = get_SymConst_entity (ptr);
1111 ir_graph *graph = get_entity_irg (ent);
1114 append_call (graph_info, node, graph);
1116 /* it's an externally allocated thingy */
1118 } else if (get_SymConst_kind(ptr) == symconst_addr_name) {
1119 /* If this SymConst refers to a method the method is external_visible
1120 and therefore must be considered live anyways. */
1121 if (get_SymConst_name(ptr) != new_id_from_str("iro_Catch")) {
1122 assert (ent && "couldn't determine entity of call to symConst");
1125 /* other symconst. */
1126 assert (0 && "This SymConst can not be an address for a method call.");
1129 /* STRANGE, no less ... */
1132 assert(0 && "Unexpected address expression");
1138 Collect called graphs for the given graph.
1140 static void ecg_fill_graph_calls (ir_graph *graph)
1142 graph_info_t *graph_info = (graph_info_t*) xmalloc (sizeof (graph_info_t));
1144 graph_info->graph = graph;
1145 graph_info->calls = NULL;
1146 graph_info->ecg_seen = 0;
1148 entity *method = get_irg_entity (graph);
1149 type *clazz = get_entity_owner (method);
1151 irg_walk_graph (graph, ecg_calls_act, NULL, graph_info);
1153 pmap_insert (graph_infos, graph, graph_info);
1157 For each graph, collect called graphs, and enter them into calls.
1159 static void ecg_fill_calls ()
1163 for (i = 0; i < get_irp_n_irgs (); i++) {
1164 ir_graph *graph = get_irp_irg (i);
1166 ecg_fill_graph_calls (graph);
1170 /* ====================
1172 ==================== */
1175 get the call infos for the given graph
1177 graph_info_t *ecg_get_info (ir_graph *graph)
1179 graph_info_t *ginfo = (graph_info_t*) pmap_get (graph_infos, graph);
1181 assert (ginfo && "no info for graph");
1189 Dump the given graph and it's calls and it's calls callEds to the given file.
1191 static int ecg_ecg_graph (FILE *dot, ir_graph *graph)
1193 const char *name = get_irg_entity (graph) ?
1194 get_entity_name (get_irg_entity (graph)) : "noEntity";
1196 (get_entity_stickyness
1197 (get_irg_entity (graph)) == stickyness_sticky) ?
1200 graph_info_t *ginfo = (graph_info_t*) pmap_get (graph_infos, graph);
1202 if (0 != ginfo->ecg_seen) {
1203 fprintf (dot, "\t/* recursive call to \"%s\" (0x%08x) */\n", name, graph);
1205 return (ginfo->ecg_seen);
1208 assert (0L <= _graphs);
1210 const int graph_no = _graphs ++;
1211 ginfo->ecg_seen = graph_no;
1213 fprintf (dot, "\t/* Graph of \"%s\" */\n", name);
1214 fprintf (dot, "\tgraph_%i [label=\"%s\", color=\"%s\"];\n", graph_no, name, color);
1215 fprintf (dot, "\n");
1217 if (visibility_external_allocated ==
1218 get_entity_visibility (get_irg_entity (graph))) {
1219 fprintf (dot, "\t/* graph \"%s\" is external */\n", name);
1224 call_info_t *cinfo = ginfo->calls;
1225 while (NULL != cinfo) {
1226 ir_node *call = cinfo->call;
1227 callEd_info_t *ced = cinfo->callEds;
1228 const int call_no = _calls ++;
1230 fprintf (dot, "\t/* Call 0x%08x */\n", call);
1231 fprintf (dot, "\tcall_%i [label=\"call\\l0x%08x\"];\n",
1233 fprintf (dot, "\tgraph_%i -> call_%i;\n", graph_no, call_no);
1235 while (NULL != ced) {
1236 ir_graph *callEd_graph = ced->callEd;
1237 const int callEd_no = ecg_ecg_graph (dot, callEd_graph);
1238 const char *callEd_name = get_irg_entity (callEd_graph) ?
1239 get_entity_name (get_irg_entity (callEd_graph)) : "noEntity";
1240 const char *direction = (callEd_no <= graph_no) ? "back" : "forward";
1241 const char *callEd_color = (callEd_no <= graph_no) ? "red" : "black";
1243 fprintf (dot, "\t/* Call to graph \"%s\" */\n", callEd_name);
1244 /* Todo: Check for recursive calls */
1245 /* if (callEd_no > graph_no) */ { /* do do recursive calls (for now) */
1246 fprintf (dot, "\tcall_%i -> graph_%i [color=\"%s\", dir=\"%s\"];\n",
1247 call_no, callEd_no, callEd_color, direction);
1252 } /* done all calEds(call) */
1254 cinfo = cinfo->prev;
1255 } /* done all calls(graph) */
1257 fprintf (dot, "\t/* done with graph of \"%s\" */\n\n", name);
1260 ginfo->ecg_seen = 0;
1266 Count how many nodes the ECG will have
1268 static void ecg_ecg_count (ir_graph *graph)
1270 graph_info_t *ginfo = (graph_info_t*) pmap_get (graph_infos, graph);
1272 if (0 != ginfo->ecg_seen) {
1277 if (_depth > _max_depth) {
1278 _max_depth = _depth;
1280 fprintf (stdout, "_max_depth = %i\n", _max_depth);
1281 fprintf (stdout, "\tn_graphs: %i\n", _graphs);
1284 assert (0L <= _graphs);
1286 if (!(_graphs % 1000000)) {
1287 fprintf (stdout, "\tn_graphs: %i\n", _graphs);
1288 fprintf (stdout, "_depth = %i\n", _depth);
1291 const int graph_no = _graphs ++;
1292 ginfo->ecg_seen = graph_no;
1294 call_info_t *cinfo = ginfo->calls;
1295 while (NULL != cinfo) {
1297 callEd_info_t *ced = cinfo->callEds;
1298 while (NULL != ced) {
1299 ir_graph *callEd_graph = ced->callEd;
1301 ecg_ecg_count (callEd_graph);
1304 } /* done all calEds(call) */
1305 cinfo = cinfo->prev;
1306 } /* done all calls(graph) */
1308 ginfo->ecg_seen = 0;
1312 /* ====================
1314 ==================== */
1317 Initialise our data structures.
1319 void ecg_init (int typalise)
1321 do_typalise = typalise;
1323 graph_infos = pmap_create ();
1335 for (i = 0; i < get_irp_n_irgs (); i++) {
1336 ir_graph *graph = get_irp_irg (i);
1338 graph_info_t *info = pmap_get (graph_infos, graph);
1339 call_info_t *cinfo = info->calls;
1341 while (NULL != cinfo) {
1342 free (cinfo->callEds);
1345 callEd_info_t *ced = cinfo->callEds;
1347 while (NULL != ced) {
1348 callEd_info_t *nced = ced->prev;
1355 /* Todo: delete callEds */
1356 cinfo->callEds = NULL;
1359 cinfo = cinfo->prev;
1363 pmap_insert (graph_infos, graph, NULL);
1367 pmap_destroy (graph_infos);
1369 /* BEGIN mild paranoia mode */
1371 /* END mild paranoia mode */
1375 Show what we have found.
1381 FILE *dot = fopen ("calls.dot", "w");
1383 fprintf (dot, "digraph \"calls\" {\n");
1384 fprintf (dot, "\tnode [shape = \"record\", style = \"filled\"];\n");
1385 fprintf (dot, "\tedge [color = \"black\"];\n");
1386 fprintf (dot, "\n");
1387 fprintf (dot, "\tsize = \"11, 7\";\n");
1388 fprintf (dot, "\trotate = \"90\";\n");
1389 fprintf (dot, "\tratio = \"fill\";\n");
1390 fprintf (dot, "\trankdir = \"LR\";\n");
1391 fprintf (dot, "\n");
1393 for (i = 0; i < get_irp_n_irgs (); i++) {
1394 ir_graph *graph = get_irp_irg (i);
1395 graph_info_t *info = (graph_info_t*) pmap_get (graph_infos, graph);
1397 const char *name = get_irg_entity (graph) ?
1398 get_entity_name (get_irg_entity (graph)) : "noEntity";
1400 const char *oname = get_type_name
1401 (get_entity_owner (get_irg_entity (graph)));
1404 (get_entity_stickyness
1405 (get_irg_entity (graph)) == stickyness_sticky) ?
1408 fprintf (dot, "\t/* graph_0x%08x (\"%s\") */\n", graph, name);
1410 "\tgraph_0x%08x [label=\"%s\\l%s\", color=\"%s\"];\n",
1411 graph, oname, name, color);
1412 fprintf (dot, "\n");
1413 fprintf (dot, "\t/* now the calls */\n");
1415 call_info_t *cinfo = info->calls;
1416 while (NULL != cinfo) {
1417 ir_node *call = cinfo->call;
1420 fprintf (dot, "\t/* call_0x%08x */\n", call);
1421 fprintf (dot, "\tcall_0x%08x [label=\"call\\l0x%08x\"];\n", call, call);
1422 fprintf (dot, "\tgraph_0x%08x -> call_0x%08x;\n", graph, call);
1424 callEd_info_t *ced = cinfo->callEds;
1425 while (NULL != ced) {
1426 fprintf (dot, "\tcall_0x%08x -> graph_0x%08x;\n", call, ced->callEd);
1429 fprintf (dot, "\n");
1431 cinfo = cinfo->prev;
1433 fprintf (dot, "\n");
1435 fprintf (dot, "}\n");
1437 fprintf (stdout, " max_callEds: %i\n", _max_callEds);
1438 fprintf (stdout, " max_callEds_callR: \"%s\"\n",
1439 get_entity_name (_max_callEds_callR));
1447 Experimental: Print the ecg
1454 ir_graph *main_graph = get_irp_main_irg ();
1457 ecg_ecg_count (main_graph);
1458 fprintf (stdout, "n_graphs: %i\n", _graphs);
1459 fprintf (stdout, "max_depth = %i\n", _max_depth);
1467 FILE *dot = fopen ("ecg.dot", "w");
1469 fprintf (dot, "digraph \"ecg\" {\n");
1470 fprintf (dot, "\tnode [shape = \"record\", style = \"filled\"];\n");
1471 fprintf (dot, "\tedge [color = \"black\"];\n");
1472 fprintf (dot, "\n");
1473 fprintf (dot, "\tsize = \"11, 7\";\n");
1474 fprintf (dot, "\trotate = \"90\";\n");
1475 fprintf (dot, "\tratio = \"fill\";\n");
1476 fprintf (dot, "\trankdir = \"LR\";\n");
1477 fprintf (dot, "\n");
1479 /* ir_graph *main_graph = get_irp_main_irg (); */
1480 ecg_ecg_graph (dot, main_graph);
1482 fprintf (dot, "\t/* Grand Total: */\n");
1483 fprintf (dot, "\t/* calls: %i */\n", _calls);
1484 fprintf (dot, "\t/* graphs: %i */\n", _graphs);
1485 fprintf (dot, "\t/* (sales tax not included) */\n");
1487 fprintf (dot, "}\n");