2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Code for dumping backend datastructures (i.e. interference graphs)
23 * @author Matthias Braun
32 #include "becopyopt_t.h"
35 static void dump_ifg_nodes(FILE *F, const be_ifg_t *ifg)
37 nodes_iter_t ifg_iter;
38 be_ifg_foreach_node(ifg, &ifg_iter, node) {
43 static void dump_ifg_edges(FILE *F, const be_ifg_t *ifg)
45 nodes_iter_t ifg_iter;
47 be_ifg_foreach_node(ifg, &ifg_iter, node) {
48 neighbours_iter_t neigh_iter;
50 be_ifg_foreach_neighbour(ifg, &neigh_iter, node, neighbour) {
51 /* interference is bidirectional, but it's enough to dump 1
53 if (get_irn_node_nr(node) >= get_irn_node_nr(neighbour))
56 fprintf(F, "edge: {sourcename: ");
57 print_nodeid(F, node);
58 fprintf(F, " targetname: ");
59 print_nodeid(F, neighbour);
60 fprintf(F, " arrowstyle:none class:1}\n");
65 void be_dump_ifg(FILE *F, ir_graph *irg, const be_ifg_t *ifg)
68 "graph: { title: \"interference graph of %+F\"\n"
69 "layoutalgorithm: mindepth //$ \"circular\"\n"
70 "classname 1: \"interference\"\n"
72 dump_vcg_infonames(F);
73 dump_vcg_header_colors(F);
75 dump_ifg_nodes(F, ifg);
76 dump_ifg_edges(F, ifg);
81 static void dump_affinity_edges(FILE *F, const copy_opt_t *co,
82 bool dump_costs, bool dump_colors)
84 co_gs_foreach_aff_node(co, a) {
85 co_gs_foreach_neighb(a, n) {
86 /* edges are bidirection, dumping one direction is enough */
87 if (get_irn_node_nr(a->irn) >= get_irn_node_nr(n->irn))
90 fprintf(F, "edge: {sourcename: ");
91 print_nodeid(F, a->irn);
92 fprintf(F, " targetname: ");
93 print_nodeid(F, n->irn);
94 fprintf(F, " arrowstyle:none");
97 fprintf(F, " label:\"%d\"", n->costs);
99 const arch_register_t *ar = arch_get_irn_register(a->irn);
100 const arch_register_t *nr = arch_get_irn_register(n->irn);
101 const char *color = nr == ar ? "blue" : "red";
102 fprintf(F, " color:%s", color);
104 fprintf(F, " linestyle:dashed class:2");
110 void be_dump_ifg_co(FILE *F, const copy_opt_t *co, bool dump_costs,
113 ir_graph *irg = co->irg;
114 be_ifg_t *ifg = co->cenv->ifg;
117 "graph: { title: \"interference graph of %+F\"\n"
118 "layoutalgorithm: mindepth //$ \"circular\"\n"
119 "classname 1: \"interference\"\n"
120 "classname 2: \"affinity\"\n"
122 dump_vcg_infonames(F);
123 dump_vcg_header_colors(F);
125 dump_ifg_nodes(F, ifg);
126 dump_ifg_edges(F, ifg);
127 dump_affinity_edges(F, co, dump_costs, dump_colors);
132 static const char *lv_flags_to_str(unsigned flags)
134 static const char *states[] = {
145 return states[flags & 7];
148 void be_dump_liveness_block(be_lv_t *lv, FILE *F, const ir_node *bl)
150 be_lv_info_t *info = ir_nodehashmap_get(be_lv_info_t, &lv->map, bl);
152 fprintf(F, "liveness:\n");
154 unsigned n = info[0].head.n_members;
157 for (i = 0; i < n; ++i) {
158 be_lv_info_node_t *n = &info[i+1].node;
159 ir_fprintf(F, "%s %+F\n", lv_flags_to_str(n->flags), n->node);
164 typedef struct lv_walker_t {
169 static void lv_dump_block_walker(ir_node *irn, void *data)
171 lv_walker_t *w = (lv_walker_t*)data;
174 be_dump_liveness_block(w->lv, w->out, irn);
177 void be_liveness_dump(FILE *F, const be_lv_t *lv)
181 w.lv = (be_lv_t *) lv;
183 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);