ignore last scheduled node on reordering after a perm if it is not colorable

[libfirm] / ir / be / beifg_clique.c

diff --git a/ir/be/beifg_clique.c b/ir/be/beifg_clique.c
index c8864f8..affe7cc 100644 (file)
--- a/ir/be/beifg_clique.c
+++ b/ir/be/beifg_clique.c
@@ -40,6 +40,7 @@
 #include "be_t.h"
 #include "beintlive_t.h"
 #include "beifg_t.h"
+#include "beifg_impl.h"
 #include "bechordal_t.h"
 
 typedef struct _cli_head_t {
@@ -86,7 +87,7 @@ static cli_head_t *get_new_cli_head(ifg_clique_t *ifg)
        else
        {
                cli_head = ifg->cli_root;
-               while(!(cli_head->next_cli_head == NULL))
+               while (!(cli_head->next_cli_head == NULL))
                {
                        cli_head = cli_head->next_cli_head;
                }
@@ -150,7 +151,7 @@ static void write_clique(ir_nodeset_t *live_set, ifg_clique_t *ifg)
                }
 
                list_for_each_entry(cli_element_t, element, &cli_head->list, list){
-                       if(element->irn == live_irn){
+                       if (element->irn == live_irn){
                                is_element = 1;
                                break;
                        }
@@ -173,7 +174,6 @@ static cli_head_t *get_next_cli_head(const ir_node *irn, cli_iter_t *it) /* ...c
        cli_element_t *element;
 
        int is_dominated_by_max;
-       //int dominates_min;
 
        if (it->curr_cli_head == NULL || it->curr_cli_head->next_cli_head == NULL) /* way back of recursion or this is the last clique */
        {
@@ -184,7 +184,6 @@ static cli_head_t *get_next_cli_head(const ir_node *irn, cli_iter_t *it) /* ...c
        head = it->curr_cli_head->next_cli_head;
 
        is_dominated_by_max = value_dominates(head->max, irn);
-       //dominates_min = value_dominates(irn, head->min);
 
        if ((is_dominated_by_max) || (irn == head->max)) /* node could be in clique */
        {
@@ -338,7 +337,7 @@ static void find_neighbour_walker(ir_node *bl, void *data)
                if (b->is_def) /* b is a new node */
                {
                        ir_nodeset_insert(&live, irn);
-                       if(b->is_real)
+                       if (b->is_real)
                        {
                                was_def = 1;
                        }
@@ -363,7 +362,6 @@ static void find_first_neighbour(const ifg_clique_t *ifg, cli_iter_t *it, const
        bitset_t      *bitset_visneighbours = bitset_malloc(get_irg_last_idx(ifg->env->irg));
 
        int is_dominated_by_max = 0;
-       int dominates_min = 0;
        int is_in_clique = 0;
 
        it->curr_cli_head = cli_head;
@@ -373,7 +371,6 @@ static void find_first_neighbour(const ifg_clique_t *ifg, cli_iter_t *it, const
        assert(cli_head && "There is no root entry for a cli_head.");
 
        is_dominated_by_max = value_dominates(cli_head->max, irn);
-       dominates_min = value_dominates(irn, cli_head->min);
 
        if ((is_dominated_by_max) || (irn == cli_head->max))  /* node could be in clique */
        {
@@ -389,7 +386,7 @@ static void find_first_neighbour(const ifg_clique_t *ifg, cli_iter_t *it, const
                        }
                }
        }
-       if(!is_in_clique)
+       if (!is_in_clique)
        {
                cli_head = get_next_cli_head(irn, it);
                element = get_next_element(irn, it);