+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
/**
- * Backend driver.
- * @author Sebastian Hack
- * @date 25.11.2004
- * @cvsid $Id$
+ * @file
+ * @brief Main Backend driver.
+ * @author Sebastian Hack
+ * @date 25.11.2004
+ * @version $Id$
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#include <stdarg.h>
#include <stdio.h>
-#ifdef WITH_LIBCORE
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
-#endif /* WITH_LIBCORE */
#include "obst.h"
#include "bitset.h"
#include "irtools.h"
#include "irvrfy.h"
#include "irprintf.h"
-#include "return.h"
+#include "iroptimize.h"
#include "firmstat.h"
-#include "cfopt.h"
#include "execfreq.h"
+#include "irprofile.h"
-#include "bearch.h"
+#include "bearch_t.h"
#include "be_t.h"
#include "bemodule.h"
#include "beutil.h"
#include "besched_t.h"
#include "belistsched.h"
#include "belive_t.h"
-#include "bespillbelady.h"
#include "bera.h"
-#include "beraextern.h"
#include "bechordal_t.h"
#include "beifg.h"
#include "beifg_impl.h"
#include "beschedmris.h"
#include "bestat.h"
#include "beverify.h"
-#include "beprofile.h"
#include "be_dbgout.h"
+#include "beirg_t.h"
#ifdef WITH_ILP
#include "beilpsched.h"
DUMP_NONE, /* dump flags */
BE_TIME_OFF, /* no timing */
0, /* no opt profile */
- 1, /* try to omit frame pointer */
- 0, /* always stabs debugging output */
+ 0, /* try to omit frame pointer */
+ 0, /* no stabs debugging output */
BE_VRFY_WARN, /* verification level: warn */
BE_SCHED_LIST, /* scheduler: list scheduler */
"i44pc52.info.uni-karlsruhe.de", /* ilp server */
- "cplex" /* ilp solver */
+ "cplex", /* ilp solver */
+ 0, /* enable statistic event dumping */
+ "", /* print stat events */
};
/* config file. */
/* back end instruction set architecture to use */
static const arch_isa_if_t *isa_if = NULL;
-#ifdef WITH_LIBCORE
-
/* possible dumping options */
static const lc_opt_enum_mask_items_t dump_items[] = {
{ "none", DUMP_NONE },
static const lc_opt_table_entry_t be_main_options[] = {
LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
- LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_options.omit_fp),
+ LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
LC_OPT_ENT_BOOL ("stabs", "enable stabs debug support", &be_options.stabs_debug_support),
LC_OPT_ENT_ENUM_PTR ("vrfy", "verify the backend irg", &vrfy_var),
LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
- LC_OPT_ENT_STR ("statfile", "append statistics to file statfile", &be_options.stat_file_name, sizeof(be_options.stat_file_name)),
+#ifdef FIRM_STATISTICS
+ LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
+ LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", &be_options.printev, sizeof(be_options.printev)),
+#endif
#ifdef WITH_ILP
LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
#endif /* WITH_ILP */
- { NULL }
+ LC_OPT_LAST
};
-#endif /* WITH_LIBCORE */
-
static be_module_list_entry_t *isa_ifs = NULL;
void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
void be_opt_register(void)
{
-#ifdef WITH_LIBCORE
lc_opt_entry_t *be_grp;
static int run_once = 0;
be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
&isa_ifs, (void**) &isa_if);
-#endif /* WITH_LIBCORE */
}
/* Parse one argument. */
int be_parse_arg(const char *arg) {
-#ifdef WITH_LIBCORE
lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
lc_opt_print_help(be_grp, stdout);
return -1;
}
return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
-#else
- return 0;
-#endif /* WITH_LIBCORE */
}
/** The be parameters returned by default, all off. */
-const static backend_params be_params = {
- NULL,
- NULL,
- 0,
- NULL,
+static const backend_params be_params = {
+ 0, /* need dword lowering */
+ 0, /* don't support inlien assembler yet */
+ NULL, /* no additional opcodes */
+ NULL, /* will be set later */
+ NULL, /* but yet no creator function */
+ NULL, /* context for create_intrinsic_fkt */
+ NULL, /* no if conversion settings */
};
/* Perform schedule verification if requested. */
-static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
+static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
if (vrfy_opt == BE_VRFY_WARN) {
- be_verify_schedule(irg);
+ be_verify_schedule(birg);
}
else if (vrfy_opt == BE_VRFY_ASSERT) {
- assert(be_verify_schedule(irg) && "Schedule verification failed.");
+ assert(be_verify_schedule(birg) && "Schedule verification failed.");
}
}
obstack_init(&env->obst);
env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
env->options = &be_options;
- FIRM_DBG_REGISTER(env->dbg, "be.main");
arch_env_init(env->arch_env, isa_if, file_handle, env);
edges_deactivate_kind(irg, EDGE_KIND_DEP);
edges_activate_kind(irg, EDGE_KIND_DEP);
- DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
be_stat_init_irg(env->arch_env, irg);
/* Normalize proj nodes. */
normalize_proj_nodes(irg);
- /* Make just one return node. */
- normalize_one_return(irg);
+ /* we do this before critical edge split. As this produces less returns,
+ because sometimes (= 164.gzip) multiple returns are slower */
+ normalize_n_returns(irg);
/* Remove critical edges */
remove_critical_cf_edges(irg);
/* Ensure, that the ir_edges are computed. */
edges_assure(irg);
- /* reset the phi handler. */
- be_phi_handler_reset(env->phi_handler);
-
set_irg_phase_state(irg, phase_backend);
-}
-#ifdef WITH_LIBCORE
+ dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph);
+}
#define BE_TIMER_PUSH(timer) \
if (be_options.timing == BE_TIME_ON) { \
#define BE_TIMER_ONLY(code) do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
-#else
-
-#define BE_TIMER_PUSH(timer)
-#define BE_TIMER_POP(timer)
-#define BE_TIMER_ONLY(code)
-
-#endif /* WITH_LIBCORE */
-
-
/**
* The Firm backend main loop.
* Do architecture specific lowering for all graphs
char prof_filename[256];
static const char suffix[] = ".prof";
be_irg_t *birgs;
- unsigned num_birgs;
+ int num_birgs;
ir_graph **irg_list, **backend_irg_list;
- be_ra_timer_t *ra_timer;
-
-#ifdef WITH_LIBCORE
lc_timer_t *t_abi = NULL;
lc_timer_t *t_codegen = NULL;
lc_timer_t *t_sched = NULL;
t_verify = lc_timer_register("verify", "graph verification");
t_other = lc_timer_register("other", "other");
}
-#endif /* WITH_LIBCORE */
be_init_env(&env, file_handle);
+ env.cup_name = cup_name;
isa = arch_env_get_isa(env.arch_env);
or try to read in profile data for current translation unit.
*/
if (be_options.opt_profile) {
- ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
+ ir_graph *prof_init_irg = ir_profile_instrument(prof_filename, profile_default);
initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
num_birgs++;
set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
- }
- else {
- be_profile_read(prof_filename);
+ } else {
+ ir_profile_read(prof_filename);
}
/* For all graphs */
ir_graph *irg = birg->irg;
optimization_state_t state;
const arch_code_generator_if_t *cg_if;
- char irg_name[128];
/* set the current graph (this is important for several firm functions) */
current_ir_graph = irg;
-#ifdef FIRM_STATISTICS
- if(be_stat_ev_is_active()) {
- ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
- be_stat_tags[STAT_TAG_CLS] = "<all>";
- be_stat_tags[STAT_TAG_IRG] = irg_name;
- be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
- }
-#endif
+ be_sched_init_phase(irg);
+
+ /* reset the phi handler. */
+ be_phi_handler_reset(env.phi_handler);
+
+ stat_ev_ctx_push_fobj("bemain_irg", irg);
/* stop and reset timers */
BE_TIMER_ONLY(
/* some transformations need to be done before abi introduce */
arch_code_generator_before_abi(birg->cg);
- /* reset the phi handler. */
- be_phi_handler_reset(env.phi_handler);
-
/* implement the ABI conventions. */
BE_TIMER_PUSH(t_abi);
birg->abi = be_abi_introduce(birg);
if (be_options.vrfy_option == BE_VRFY_WARN) {
be_check_dominance(irg);
be_verify_out_edges(irg);
- }
- else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
+ } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
assert(be_verify_out_edges(irg));
assert(be_check_dominance(irg) && "Dominance verification failed");
}
/* generate code */
+ stat_ev_ctx_push_str("bemain_phase", "prepare");
BE_TIMER_PUSH(t_codegen);
arch_code_generator_prepare_graph(birg->cg);
BE_TIMER_POP(t_codegen);
+ stat_ev_ctx_pop("bemain_phase");
+
+ /* reset the phi handler. */
+ be_phi_handler_reset(env.phi_handler);
be_do_stat_nodes(irg, "03 Prepare");
- /* Transformation may produce nodes only reachable via out edges, kill them. */
- be_kill_dead_nodes(irg);
dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
if (be_options.vrfy_option == BE_VRFY_WARN) {
be_check_dominance(irg);
be_verify_out_edges(irg);
- }
- else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
+ } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
assert(be_verify_out_edges(irg));
assert(be_check_dominance(irg) && "Dominance verification failed");
}
/**
* Create execution frequencies from profile data or estimate some
*/
- if (be_profile_has_data()) {
- birg->exec_freq = be_create_execfreqs_from_profile(irg);
- } else {
+ if (ir_profile_has_data())
+ birg->exec_freq = ir_create_execfreqs_from_profile(irg);
+ else
birg->exec_freq = compute_execfreq(irg, 10);
- }
+
+
+ /* disabled for now, fails for EmptyFor.c and XXEndless.c */
+ /* be_live_chk_compare(birg); */
/* let backend prepare scheduling */
+ stat_ev_ctx_push_str("bemain_phase", "before_sched");
BE_TIMER_PUSH(t_codegen);
arch_code_generator_before_sched(birg->cg);
BE_TIMER_POP(t_codegen);
+ stat_ev_ctx_pop("bemain_phase");
/* schedule the irg */
BE_TIMER_PUSH(t_sched);
break;
#ifdef WITH_ILP
case BE_SCHED_ILP:
- be_ilp_sched(birg);
- //fprintf(stderr, "Warning: ILP scheduler not yet fully implemented, falling back to list scheduler.\n");
- //list_sched(birg, &be_options);
+ be_ilp_sched(birg, &be_options);
break;
#endif /* WITH_ILP */
};
/* check schedule */
BE_TIMER_PUSH(t_verify);
- be_sched_vrfy(irg, be_options.vrfy_option);
+ be_sched_vrfy(birg, be_options.vrfy_option);
BE_TIMER_POP(t_verify);
be_do_stat_nodes(irg, "04 Schedule");
save_optimization_state(&state);
set_optimize(0);
set_opt_normalize(0);
+ set_opt_cse(0);
+
+ assert(!get_opt_cse());
/* add Keeps for should_be_different constrained nodes */
/* beware: needs schedule due to usage of be_ssa_constr */
dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
be_do_stat_nodes(irg, "05 Constraints");
+ /* stuff needs to be done after scheduling but before register allocation */
+ BE_TIMER_PUSH(t_codegen);
+ arch_code_generator_before_ra(birg->cg);
+ BE_TIMER_POP(t_codegen);
+
/* connect all stack modifying nodes together (see beabi.c) */
BE_TIMER_PUSH(t_abi);
- be_abi_fix_stack_nodes(birg->abi, NULL);
+ be_abi_fix_stack_nodes(birg->abi);
BE_TIMER_POP(t_abi);
dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
/* check schedule */
BE_TIMER_PUSH(t_verify);
- be_sched_vrfy(irg, be_options.vrfy_option);
+ be_sched_vrfy(birg, be_options.vrfy_option);
BE_TIMER_POP(t_verify);
/* do some statistics */
- be_do_stat_reg_pressure(birg);
-
- /* stuff needs to be done after scheduling but before register allocation */
- BE_TIMER_PUSH(t_codegen);
- arch_code_generator_before_ra(birg->cg);
- BE_TIMER_POP(t_codegen);
+ //be_do_stat_reg_pressure(birg);
#ifdef FIRM_STATISTICS
- if(be_stat_ev_is_active()) {
- be_stat_ev_l("costs_before_ra",
- (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
- }
+ stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
#endif
/* Do register allocation */
BE_TIMER_POP(t_regalloc);
#ifdef FIRM_STATISTICS
- if(be_stat_ev_is_active()) {
- be_stat_ev_l("costs_after_ra",
- (long) be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
- }
+ stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
#endif
dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
/* fix stack offsets */
BE_TIMER_PUSH(t_abi);
- be_abi_fix_stack_nodes(birg->abi, NULL);
- be_remove_dead_nodes_from_schedule(irg);
+ be_abi_fix_stack_nodes(birg->abi);
+ be_remove_dead_nodes_from_schedule(birg);
be_abi_fix_stack_bias(birg->abi);
BE_TIMER_POP(t_abi);
/* check schedule and register allocation */
BE_TIMER_PUSH(t_verify);
if (be_options.vrfy_option == BE_VRFY_WARN) {
- //irg_verify(irg, VRFY_ENFORCE_SSA);
+ irg_verify(irg, VRFY_ENFORCE_SSA);
be_check_dominance(irg);
be_verify_out_edges(irg);
- be_verify_schedule(irg);
- be_verify_register_allocation(env.arch_env, irg);
- }
- else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
- //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
- assert(be_verify_out_edges(irg));
+ be_verify_schedule(birg);
+ be_verify_register_allocation(birg);
+ } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
+ assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
+ assert(be_verify_out_edges(irg) && "out edge verification failed");
assert(be_check_dominance(irg) && "Dominance verification failed");
- assert(be_verify_schedule(irg) && "Schedule verification failed");
- assert(be_verify_register_allocation(env.arch_env, irg)
+ assert(be_verify_schedule(birg) && "Schedule verification failed");
+ assert(be_verify_register_allocation(birg)
&& "register allocation verification failed");
+
}
BE_TIMER_POP(t_verify);
BE_TIMER_POP(t_other);
#define LC_EMIT(timer) \
- if(!be_stat_ev_is_active()) { \
printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
- } else { \
- be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
- }
+ stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer));
+
#define LC_EMIT_RA(timer) \
- if(!be_stat_ev_is_active()) { \
printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
- } else { \
- be_stat_ev_l(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
- }
+ stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
+
BE_TIMER_ONLY(
- if(!be_stat_ev_is_active()) {
- printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
- printf("# nodes at begin: %u\n", num_nodes_b);
- printf("# nodes before ra: %u\n", num_nodes_r);
- printf("# nodes at end: %u\n\n", num_nodes_a);
- }
+ printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
+ printf("# nodes at begin: %u\n", num_nodes_b);
+ printf("# nodes before ra: %u\n", num_nodes_r);
+ printf("# nodes at end: %u\n\n", num_nodes_a);
LC_EMIT(t_abi);
LC_EMIT(t_codegen);
LC_EMIT(t_sched);
LC_EMIT(t_constr);
LC_EMIT(t_regalloc);
- LC_EMIT_RA(ra_timer->t_prolog);
- LC_EMIT_RA(ra_timer->t_live);
- LC_EMIT_RA(ra_timer->t_spill);
- LC_EMIT_RA(ra_timer->t_spillslots);
- LC_EMIT_RA(ra_timer->t_color);
- LC_EMIT_RA(ra_timer->t_ifg);
- LC_EMIT_RA(ra_timer->t_copymin);
- LC_EMIT_RA(ra_timer->t_ssa);
- LC_EMIT_RA(ra_timer->t_epilog);
- LC_EMIT_RA(ra_timer->t_verify);
- LC_EMIT_RA(ra_timer->t_other);
+ if(global_ra_timer != NULL) {
+ LC_EMIT_RA(global_ra_timer->t_prolog);
+ LC_EMIT_RA(global_ra_timer->t_live);
+ LC_EMIT_RA(global_ra_timer->t_spill);
+ LC_EMIT_RA(global_ra_timer->t_spillslots);
+ LC_EMIT_RA(global_ra_timer->t_color);
+ LC_EMIT_RA(global_ra_timer->t_ifg);
+ LC_EMIT_RA(global_ra_timer->t_copymin);
+ LC_EMIT_RA(global_ra_timer->t_ssa);
+ LC_EMIT_RA(global_ra_timer->t_epilog);
+ LC_EMIT_RA(global_ra_timer->t_verify);
+ LC_EMIT_RA(global_ra_timer->t_other);
+ }
LC_EMIT(t_finish);
LC_EMIT(t_emit);
LC_EMIT(t_verify);
#undef LC_EMIT_RA
#undef LC_EMIT
+ be_sched_free_phase(irg);
+
be_free_birg(birg);
/* switched off due to statistics (statistic module needs all irgs) */
+#if 0 /* STA needs irgs */
#ifdef FIRM_STATISTICS
if (! stat_is_active())
-#endif
+#endif /* FIRM_STATISTICS */
free_ir_graph(irg);
-
- if(be_stat_ev_is_active()) {
- be_stat_ev_pop();
- }
+#endif /* if 0 */
+ stat_ev_ctx_pop("bemain_irg");
}
- be_profile_free();
+ ir_profile_free();
be_done_env(&env);
#undef BE_TIMER_POP
/* Main interface to the frontend. */
void be_main(FILE *file_handle, const char *cup_name)
{
-#ifdef WITH_LIBCORE
lc_timer_t *t = NULL;
/* The user specified another config file to read. do that now. */
}
#ifdef FIRM_STATISTICS
- be_init_stat_file(be_options.stat_file_name, cup_name);
+ if (be_options.statev) {
+ const char *dot = strrchr(cup_name, '.');
+ const char *pos = dot ? dot : cup_name + strlen(cup_name);
+ char *buf = alloca(pos - cup_name + 1);
+ strncpy(buf, cup_name, pos - cup_name);
+ buf[pos - cup_name] = '\0';
+
+ be_options.statev = 1;
+ stat_ev_begin(buf, be_options.printev);
+ }
#endif
-#endif /* WITH_LIBCORE */
/* never build code for pseudo irgs */
set_visit_pseudo_irgs(0);
be_main_loop(file_handle, cup_name);
-#ifdef WITH_LIBCORE
if (be_options.timing == BE_TIME_ON) {
lc_timer_stop(t);
lc_timer_leave_high_priority();
- if(be_stat_ev_is_active()) {
- be_stat_ev_l("backend_time", lc_timer_elapsed_msec(t));
- } else {
- printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
- }
+ stat_ev_dbl("backend_time", lc_timer_elapsed_msec(t));
+ printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
}
#ifdef FIRM_STATISTICS
- be_close_stat_file();
+ if (be_options.statev)
+ stat_ev_end();
#endif
-#endif /* WITH_LIBCORE */
-}
-
-/** The debug info retriever function. */
-static retrieve_dbg_func retrieve_dbg = NULL;
-
-/* Sets a debug info retriever. */
-void be_set_debug_retrieve(retrieve_dbg_func func) {
- retrieve_dbg = func;
-}
-
-/* Retrieve the debug info. */
-const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
- if (retrieve_dbg)
- return retrieve_dbg(dbg, line);
-
- *line = 0;
- return NULL;
}
-int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
+unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
{
- if(bs == NULL)
+ if (bs == NULL)
bs = bitset_alloca(cls->n_regs);
else
bitset_clear_all(bs);
- assert(bitset_size(bs) == (unsigned) cls->n_regs);
+ assert(bitset_size(bs) == (unsigned)cls->n_regs);
arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
bitset_flip_all(bs);
be_abi_put_ignore_regs(birg->abi, cls, bs);
projects / libfirm / blobdiff