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
21 * Register allocation functions.
22 * @author Sebastian Hack
28 #include "firm_config.h"
30 #include <libcore/lc_timing.h>
32 #include "firm_types.h"
40 lc_timer_t *t_prolog; /**< timer for prolog */
41 lc_timer_t *t_epilog; /**< timer for epilog */
42 lc_timer_t *t_live; /**< timer for liveness calculation */
43 lc_timer_t *t_spill; /**< timer for spilling */
44 lc_timer_t *t_spillslots; /**< spillslot coalescing */
45 lc_timer_t *t_color; /**< timer for graph coloring */
46 lc_timer_t *t_ifg; /**< timer for building interference graph */
47 lc_timer_t *t_copymin; /**< timer for copy minimization */
48 lc_timer_t *t_ssa; /**< timer for ssa destruction */
49 lc_timer_t *t_verify; /**< timer for verification runs */
50 lc_timer_t *t_other; /**< timer for remaining stuff */
53 extern be_ra_timer_t *global_ra_timer;
55 typedef struct be_ra_t {
56 void (*allocate)(be_irg_t *bi); /**< allocate registers on a graph */
59 void be_register_allocator(const char *name, be_ra_t *allocator);
62 * Do register allocation with currently selected register allocator
64 void be_allocate_registers(be_irg_t *birg);
67 * Check, if two values interfere.
68 * @param lv Liveness information.
69 * @param a The first value.
70 * @param b The second value.
71 * @return 1, if @p a and @p b interfere, 0 if not.
73 int values_interfere(const be_lv_t *lv, const ir_node *a, const ir_node *b);
76 * Check, if a value dominates the other one.
77 * Note, that this function also considers the schedule and does thus
78 * more than block_dominates().
81 * @param b The second value.
82 * @return 1 if a dominates b, 0 else.
84 int value_dominates(const ir_node *a, const ir_node *b);
87 * Like value_dominates(), but the nodes have to be in the same block
89 int value_dominates_intrablock(const ir_node *a, const ir_node *b);