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 Contains some useful function for the backend.
23 * @author Sebastian Hack
41 #include "iredges_t.h"
48 * Edge hook to dump the schedule edges.
50 static int sched_edge_hook(FILE *F, ir_node *irn)
54 if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
55 ir_node *prev = sched_prev(irn);
56 fprintf(F, "edge:{sourcename:\"");
58 fprintf(F, "\" targetname:\"");
60 fprintf(F, "\" color:magenta}\n");
65 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix)
67 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
70 if (have_sched_info(irg))
71 set_dump_node_edge_hook(sched_edge_hook);
72 dump_ir_block_graph(irg, suffix);
73 set_dump_node_edge_hook(old);
76 void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix)
78 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
81 if (have_sched_info(irg))
82 set_dump_node_edge_hook(sched_edge_hook);
83 dump_ir_extblock_graph(irg, suffix);
84 set_dump_node_edge_hook(old);
88 * Dumps a graph and numbers all dumps.
89 * @param irg The graph
90 * @param suffix A suffix to its file name.
91 * @param dumper The dump function
93 void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *))
95 static ir_graph *last_irg = NULL;
99 if (irg != last_irg) {
101 nr = strcmp(suffix, "-abi") ? 0 : 1;
104 snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
105 buf[sizeof(buf) - 1] = '\0';
109 void be_clear_links(ir_graph *irg)
111 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
114 static void count_num_reachable_nodes(ir_node *irn, void *env)
121 unsigned get_num_reachable_nodes(ir_graph *irg)
124 irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
129 * Gets the Proj with number pn from irn.
131 ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn)
133 const ir_edge_t *edge;
135 assert(get_irn_mode(irn) == mode_T && "need mode_T");
137 foreach_out_edge(irn, edge) {
138 proj = get_edge_src_irn(edge);
140 if (is_Proj(proj) && get_Proj_proj(proj) == pn)
147 FILE *be_ffopen(const char *base, const char *ext, const char *mode)
152 snprintf(buf, sizeof(buf), "%s.%s", base, ext);
153 buf[sizeof(buf) - 1] = '\0';
154 if (! (out = fopen(buf, mode))) {
155 fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode);
161 static void add_to_postorder(ir_node *block, void *data)
163 ir_node ***list = (ir_node***) data;
164 ARR_APP1(ir_node*, *list, block);
167 ir_node **be_get_cfgpostorder(ir_graph *irg)
169 ir_node **list = NEW_ARR_F(ir_node*, 0);
170 ir_node *end_block = get_irg_end_block(irg);
172 /* end block may be unreachable in case of endless loops */
173 if (get_Block_n_cfgpreds(end_block) == 0)
174 ARR_APP1(ir_node*, list, end_block);
177 irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder,
183 ir_node *get_first_block_succ(const ir_node *block)
185 const ir_edge_t *edge = get_irn_out_edge_first_kind(block, EDGE_KIND_BLOCK);
186 assert(edge != NULL);
187 return get_edge_src_irn(edge);