projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
cleanup, simplify hungarian algorithm implementation
[libfirm]
/
ir
/
stat
/
dags.c
diff --git
a/ir/stat/dags.c
b/ir/stat/dags.c
index
e607096
..
debb813
100644
(file)
--- a/
ir/stat/dags.c
+++ b/
ir/stat/dags.c
@@
-379,7
+379,7
@@
void count_dags_in_graph(graph_entry_t *global, graph_entry_t *graph)
/* connect and count them */
irg_walk_graph(graph->irg, connect_dags, NULL, &root_env);
/* connect and count them */
irg_walk_graph(graph->irg, connect_dags, NULL, &root_env);
- printf("Graph %p %s --- %
d
\n", (void *)graph->irg, get_entity_name(get_irg_entity(graph->irg)),
+ printf("Graph %p %s --- %
u
\n", (void *)graph->irg, get_entity_name(get_irg_entity(graph->irg)),
root_env.num_of_dags);
for (id = 0, entry = root_env.list_of_dags; entry; entry = entry->next) {
root_env.num_of_dags);
for (id = 0, entry = root_env.list_of_dags; entry; entry = entry->next) {
@@
-387,7
+387,7
@@
void count_dags_in_graph(graph_entry_t *global, graph_entry_t *graph)
continue;
entry->id = id++;
continue;
entry->id = id++;
- printf("number of roots %
d number of nodes %d inner %d
tree %u %ld\n",
+ printf("number of roots %
u number of nodes %u inner %u
tree %u %ld\n",
entry->num_roots,
entry->num_nodes,
entry->num_inner_nodes,
entry->num_roots,
entry->num_nodes,
entry->num_inner_nodes,
@@
-399,7
+399,7
@@
void count_dags_in_graph(graph_entry_t *global, graph_entry_t *graph)
/* dump for test */
mark_options = root_env.options;
set_dump_node_vcgattr_hook(stat_dag_mark_hook);
/* dump for test */
mark_options = root_env.options;
set_dump_node_vcgattr_hook(stat_dag_mark_hook);
- dump_ir_
block_
graph(graph->irg, "-dag");
+ dump_ir_graph(graph->irg, "-dag");
set_dump_node_vcgattr_hook(NULL);
#endif
set_dump_node_vcgattr_hook(NULL);
#endif