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
44 #include "besched_t.h"
47 /* Get an always empty set. */
48 pset *be_empty_set(void)
50 static pset *empty_set = NULL;
53 empty_set = pset_new_ptr(1);
55 assert(pset_count(empty_set) == 0);
59 static void dump_allocated_block(ir_node *block, void *data)
66 ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
67 sched_foreach(block, irn) {
68 const char *prefix = "";
70 const arch_register_t *reg = arch_get_irn_register(irn);
74 ir_fprintf(f, "%s = ", arch_register_get_name(reg));
76 ir_fprintf(f, "%n(", irn);
78 if(block != get_irg_start_block(get_irn_irg(block))) {
79 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
80 ir_node *op = get_irn_n(irn, i);
81 if (arch_is_register_operand(op, -1)) {
82 ir_fprintf(f, "%s%s", prefix,
83 arch_register_get_name(arch_get_irn_register(op)));
91 ir_fprintf(f, "\"}\n");
93 if(get_irg_start_block(get_irn_irg(block)) != block) {
94 for(i = 0, n = get_irn_arity(block); i < n; ++i) {
95 ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
96 ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
101 void dump_allocated_irg(ir_graph *irg, char *suffix)
106 ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
108 f = fopen(buf, "wt");
110 fprintf(f, "graph:{title:\"prg\"\n");
111 irg_block_walk_graph(irg, dump_allocated_block, NULL, f);
118 * Edge hook to dump the schedule edges.
120 static int sched_edge_hook(FILE *F, ir_node *irn)
124 if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
125 ir_node *prev = sched_prev(irn);
126 fprintf(F, "edge:{sourcename:\"");
128 fprintf(F, "\" targetname:\"");
130 fprintf(F, "\" color:magenta}\n");
135 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
136 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
138 dump_consts_local(0);
139 if (have_sched_info(irg))
140 set_dump_node_edge_hook(sched_edge_hook);
141 dump_ir_block_graph(irg, suffix);
142 set_dump_node_edge_hook(old);
145 void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
146 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
148 dump_consts_local(0);
149 if (have_sched_info(irg))
150 set_dump_node_edge_hook(sched_edge_hook);
151 dump_ir_extblock_graph(irg, suffix);
152 set_dump_node_edge_hook(old);
156 * Dumps a graph and numbers all dumps.
157 * @param irg The graph
158 * @param suffix A suffix to its file name.
159 * @param dumper The dump function
161 void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)) {
162 static ir_graph *last_irg = NULL;
166 if (irg != last_irg) {
168 nr = strcmp(suffix, "-abi") ? 0 : 1;
171 snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
172 buf[sizeof(buf) - 1] = '\0';
178 static void collect_phis(ir_node *irn, void *data)
182 ir_node *bl = get_nodes_block(irn);
183 set_irn_link(irn, get_irn_link(bl));
184 set_irn_link(bl, irn);
188 void be_clear_links(ir_graph *irg)
190 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
191 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
192 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
195 void be_collect_phis(ir_graph *irg)
197 irg_walk_graph(irg, collect_phis, NULL, NULL);
200 static void count_num_reachable_nodes(ir_node *irn, void *env)
207 unsigned get_num_reachable_nodes(ir_graph *irg) {
209 irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
214 * Gets the Proj with number pn from irn.
216 ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) {
217 const ir_edge_t *edge;
219 assert(get_irn_mode(irn) == mode_T && "need mode_T");
221 foreach_out_edge(irn, edge) {
222 proj = get_edge_src_irn(edge);
224 if (is_Proj(proj) && get_Proj_proj(proj) == pn)
231 FILE *be_ffopen(const char *base, const char *ext, const char *mode) {
235 snprintf(buf, sizeof(buf), "%s.%s", base, ext);
236 buf[sizeof(buf) - 1] = '\0';
237 if (! (out = fopen(buf, mode))) {
238 fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode);