-/**
- * Internal backend global data structures.
- * @author Sebastian Hack
- * @date 8.12.2004
+/*
+ * Copyright (C) 1995-2008 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.
*/
-#ifndef FIRM_BE_T_H
-#define FIRM_BE_T_H
+/**
+ * @file
+ * @brief Internal backend global data structures.
+ * @author Sebastian Hack
+ * @version $Id$
+ */
+#ifndef FIRM_BE_BE_T_H
+#define FIRM_BE_BE_T_H
#include "firm_types.h"
#include "obst.h"
#include "debug.h"
#include "bitset.h"
+#include "timing.h"
#include "be.h"
#include "bearch.h"
int scheduler; /**< the scheduler */
char ilp_server[128]; /**< the ilp server name */
char ilp_solver[128]; /**< the ilp solver name */
- char stat_file_name[256]; /**< name of the file where the statistics are put to */
+ int statev; /**< enable stat event dumping */
+ char printev[128];
};
struct be_main_env_t {
arch_code_generator_t *cg;
arch_irn_handler_t *phi_handler;
dbg_handle *db_handle;
+ const char *cup_name;
};
/**
* @param bs The bitset (may be NULL).
* @return The number of registers to be ignored.
*/
-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);
+
+extern int be_timing;
+
+#define BE_TIMER_PUSH(timer) \
+ if (be_timing) { \
+ int res = ir_timer_push(timer); \
+ (void) res; \
+ assert(res && "Timer already on stack, cannot be pushed twice."); \
+ }
+
+#define BE_TIMER_POP(timer) \
+ if (be_timing) { \
+ ir_timer_t *tmp = ir_timer_pop(); \
+ (void) tmp; \
+ assert(tmp == timer && "Attempt to pop wrong timer."); \
+ }
+
+extern ir_timer_t *t_abi;
+extern ir_timer_t *t_codegen;
+extern ir_timer_t *t_sched;
+extern ir_timer_t *t_constr;
+extern ir_timer_t *t_finish;
+extern ir_timer_t *t_emit;
+extern ir_timer_t *t_other;
+extern ir_timer_t *t_execfreq;
+extern ir_timer_t *t_verify;
+extern ir_timer_t *t_heights;
+extern ir_timer_t *t_live; /**< timer for liveness calculation */
+extern ir_timer_t *t_ssa_constr; /**< timer for ssa reconstruction */
+extern ir_timer_t *t_ra_prolog; /**< timer for prolog */
+extern ir_timer_t *t_ra_epilog; /**< timer for epilog */
+extern ir_timer_t *t_ra_constr; /**< timer for spill constraints */
+extern ir_timer_t *t_ra_spill; /**< timer for spilling */
+extern ir_timer_t *t_ra_spill_apply;
+extern ir_timer_t *t_ra_color; /**< timer for graph coloring */
+extern ir_timer_t *t_ra_ifg; /**< timer for building interference graph */
+extern ir_timer_t *t_ra_copymin; /**< timer for copy minimization */
+extern ir_timer_t *t_ra_ssa; /**< timer for ssa destruction */
+extern ir_timer_t *t_ra_other; /**< timer for remaining stuff */
-#endif
+#endif /* FIRM_BE_BE_T_H */