2 * Register allocation functions.
3 * @author Sebastian Hack
10 #include "firm_config.h"
13 #include <libcore/lc_timing.h>
16 #include "firm_types.h"
26 lc_timer_t *t_prolog; /**< timer for prolog */
27 lc_timer_t *t_epilog; /**< timer for epilog */
28 lc_timer_t *t_live; /**< timer for liveness calculation */
29 lc_timer_t *t_spill; /**< timer for spilling */
30 lc_timer_t *t_spillslots; /**< spillslot coalescing */
31 lc_timer_t *t_color; /**< timer for graph coloring */
32 lc_timer_t *t_ifg; /**< timer for building interference graph */
33 lc_timer_t *t_copymin; /**< timer for copy minimization */
34 lc_timer_t *t_ssa; /**< timer for ssa destruction */
35 lc_timer_t *t_verify; /**< timer for verification runs */
36 lc_timer_t *t_other; /**< timer for remaining stuff */
39 typedef void *be_ra_timer_t;
40 typedef void *lc_opt_entry_t;
41 #endif /* WITH_LIBCORE */
43 typedef struct be_ra_t {
44 void (*allocate)(be_irg_t *bi); /**< allocate registers on a graph */
47 void be_register_allocator(const char *name, be_ra_t *allocator);
50 * Do register allocation with currently selected register allocator
52 void be_allocate_registers(be_irg_t *birg);
55 * Check, if two values interfere.
56 * @param lv Liveness information.
57 * @param a The first value.
58 * @param b The second value.
59 * @return 1, if @p a and @p b interfere, 0 if not.
61 int values_interfere(const be_lv_t *lv, const ir_node *a, const ir_node *b);
64 * Check, if a value dominates the other one.
65 * Note, that this function also considers the schedule and does thus
66 * more than block_dominates().
69 * @param b The second value.
70 * @return 1 if a dominates b, 0 else.
72 int value_dominates(const ir_node *a, const ir_node *b);