s/\<\(LC_\)\?INLINE\>/inline/.

[libfirm] / ir / be / becopyopt.c

diff --git a/ir/be/becopyopt.c b/ir/be/becopyopt.c
index 47cd566..ca32b86 100644 (file)
--- a/ir/be/becopyopt.c
+++ b/ir/be/becopyopt.c
@@ -29,9 +29,7 @@
  * - Register-constrained nodes
  * - Two-address code instructions
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include "execfreq.h"
 #include "xmalloc.h"
@@ -196,7 +194,6 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs)
 
        co = XMALLOCZ(copy_opt_t);
        co->cenv      = chordal_env;
-       co->aenv      = chordal_env->birg->main_env->arch_env;
        co->irg       = chordal_env->irg;
        co->cls       = chordal_env->cls;
        co->get_costs = get_costs;
@@ -216,10 +213,14 @@ void free_copy_opt(copy_opt_t *co) {
        free(co);
 }
 
-int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn) {
+/**
+ * Checks if a node is optimizable, viz. has something to do with coalescing
+ * @param irn  The irn to check
+ */
+static int co_is_optimizable_root(ir_node *irn)
+{
        const arch_register_req_t *req;
        const arch_register_t *reg;
-       (void)co; // TODO remove parameter
 
        if (arch_irn_is(irn, ignore))
                return 0;
@@ -381,7 +382,7 @@ static void co_collect_units(ir_node *irn, void *env) {
 
        if (!is_curr_reg_class(co, irn))
                return;
-       if (!co_is_optimizable_root(co, irn))
+       if (!co_is_optimizable_root(irn))
                return;
 
        /* Init a new unit */
@@ -760,7 +761,7 @@ static void add_edge(copy_opt_t *co, ir_node *n1, ir_node *n2, int costs) {
        nbr->costs += costs;
 }
 
-static INLINE void add_edges(copy_opt_t *co, ir_node *n1, ir_node *n2, int costs) {
+static inline void add_edges(copy_opt_t *co, ir_node *n1, ir_node *n2, int costs) {
        if (! be_ifg_connected(co->cenv->ifg, n1, n2)) {
                add_edge(co, n1, n2, costs);
                add_edge(co, n2, n1, costs);