2 * Copyright (C) 1995-2007 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
46 #include "besched_t.h"
49 /* Get an always empty set. */
50 pset *be_empty_set(void)
52 static pset *empty_set = NULL;
55 empty_set = pset_new_ptr(1);
57 assert(pset_count(empty_set) == 0);
66 static void dump_allocated_block(ir_node *block, void *data)
70 struct dump_env *dump_env = data;
71 FILE *f = dump_env->f;
72 arch_env_t *env = dump_env->env;
74 ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
75 sched_foreach(block, irn) {
76 const char *prefix = "";
78 const arch_register_t *reg = arch_get_irn_register(env, irn);
82 ir_fprintf(f, "%s = ", arch_register_get_name(reg));
84 ir_fprintf(f, "%n(", irn);
86 if(block != get_irg_start_block(get_irn_irg(block))) {
87 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
88 ir_node *op = get_irn_n(irn, i);
89 if(arch_is_register_operand(dump_env->env, op, -1)) {
90 ir_fprintf(f, "%s%s", prefix,
91 arch_register_get_name(arch_get_irn_register(env, op)));
99 ir_fprintf(f, "\"}\n");
101 if(get_irg_start_block(get_irn_irg(block)) != block) {
102 for(i = 0, n = get_irn_arity(block); i < n; ++i) {
103 ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
104 ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
109 void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
116 ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
118 if((env.f = fopen(buf, "wt")) != NULL) {
119 fprintf(env.f, "graph:{title:\"prg\"\n");
120 irg_block_walk_graph(irg, dump_allocated_block, NULL, &env);
121 fprintf(env.f, "}\n");
127 * Edge hook to dump the schedule edges.
129 static int sched_edge_hook(FILE *F, ir_node *irn)
131 if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
132 ir_node *prev = sched_prev(irn);
133 fprintf(F, "edge:{sourcename:\"");
135 fprintf(F, "\" targetname:\"");
137 fprintf(F, "\" color:magenta}\n");
142 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
143 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
145 dump_consts_local(0);
146 set_dump_node_edge_hook(sched_edge_hook);
147 dump_ir_block_graph(irg, suffix);
148 set_dump_node_edge_hook(old);
151 void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
152 DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
154 dump_consts_local(0);
155 set_dump_node_edge_hook(sched_edge_hook);
156 dump_ir_extblock_graph(irg, suffix);
157 set_dump_node_edge_hook(old);
161 * Dumps a graph and numbers all dumps.
162 * @param irg The graph
163 * @param suffix A suffix to its file name.
164 * @param dumper The dump function
166 void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const char *)) {
167 static ir_graph *last_irg = NULL;
171 if (irg != last_irg) {
173 nr = strcmp(suffix, "-abi") ? 0 : 1;
176 snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
177 buf[sizeof(buf) - 1] = '\0';
183 static void collect_phis(ir_node *irn, void *data)
186 ir_node *bl = get_nodes_block(irn);
187 set_irn_link(irn, get_irn_link(bl));
188 set_irn_link(bl, irn);
192 void be_clear_links(ir_graph *irg)
194 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
197 void be_collect_phis(ir_graph *irg)
199 irg_walk_graph(irg, collect_phis, NULL, NULL);
202 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 * Sets all node inputs to BAD node.
216 void be_kill_node(ir_node *irn) {
217 ir_graph *irg = get_irn_irg(irn);
219 assert(!is_Bad(irn));
224 first = 0 - ! is_Block(irn);
226 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
227 set_irn_n(irn, i, get_irg_bad(irg));
232 edges_node_deleted(irn, irg);
235 /* FIXME: not used. can be deleted? */
236 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
239 /* search the current block */
240 for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
241 if (pset_find_ptr(accept, irn))
244 /* FIXME: This is obviously buggy: after the first recursive call idom is a block
245 and get_nodes_block will fail.
246 Moreover, why not a simple iteration instead of recursion */
247 idom = get_Block_idom(get_nodes_block(start_point_exclusive));
250 return dom_up_search(accept, idom); /* continue search in idom-block */
252 return NULL; /* this was the start block and we did not find an acceptable irn */
256 * Gets the Proj with number pn from irn.
258 ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) {
259 const ir_edge_t *edge;
261 assert(get_irn_mode(irn) == mode_T && "need mode_T");
263 foreach_out_edge(irn, edge) {
264 proj = get_edge_src_irn(edge);
266 if (get_Proj_proj(proj) == pn)
273 FILE *be_ffopen(const char *base, const char *ext, const char *mode) {
277 snprintf(buf, sizeof(buf), "%s.%s", base, ext);
278 buf[sizeof(buf) - 1] = '\0';
279 if (! (out = fopen(buf, mode))) {
280 fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode);