summaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorSebastian Buchwald <Sebastian.Buchwald@kit.edu>2019-02-23 00:04:58 +0100
committerSebastian Buchwald <Sebastian.Buchwald@kit.edu>2019-02-23 00:07:15 +0100
commit8aca5bc23c106cee58da6122854224ee1f830497 (patch)
treef66ff845a6ef908b37232de98f31fe85b092c7a5
parentd98268cba2d5aa01239c9b8ab610d3cd4faca85d (diff)
Fix typos
-rw-r--r--ir/be/bepbqpcoloring.c28
1 files changed, 14 insertions, 14 deletions
diff --git a/ir/be/bepbqpcoloring.c b/ir/be/bepbqpcoloring.c
index ecd969c..ab09e4c 100644
--- a/ir/be/bepbqpcoloring.c
+++ b/ir/be/bepbqpcoloring.c
@@ -52,10 +52,10 @@
#include "pbqp_node.h"
#include "pbqp_edge_t.h"
-#define TIMER 0
-#define PRINT_RPEO 0
-#define USE_BIPARTIT_MATCHING 0
-#define DO_USEFUL_OPT 1
+#define TIMER 0
+#define PRINT_RPEO 0
+#define USE_BIPARTITE_MATCHING 1
+#define DO_USEFUL_OPT 1
static bool use_exec_freq = true;
@@ -157,7 +157,7 @@ static void insert_ife_edge(be_pbqp_alloc_env_t *pbqp_alloc_env, ir_node *src_no
pbqp_alloc_env->ife_edge_num[get_irn_idx(src_node)]++;
pbqp_alloc_env->ife_edge_num[get_irn_idx(trg_node)]++;
-#if DO_USEFUL_OPT || USE_BIPARTIT_MATCHING
+#if DO_USEFUL_OPT || USE_BIPARTITE_MATCHING
/* do useful optimization to speed up pbqp solving (we can do this because we know our matrix) */
if (get_free_regs(restr_nodes, cls, src_node) == 1 && get_free_regs(restr_nodes, cls, trg_node) == 1) {
assert(vector_get_min_index(get_node(pbqp, get_irn_idx(src_node))->costs) !=
@@ -207,7 +207,7 @@ static void insert_afe_edge(be_pbqp_alloc_env_t *pbqp_alloc_env, ir_node *src_no
} else {
afe_matrix = pbqp_alloc_env->aff_matrix_template;
}
-#if DO_USEFUL_OPT || USE_BIPARTIT_MATCHING
+#if DO_USEFUL_OPT || USE_BIPARTITE_MATCHING
/* do useful optimization to speed up pbqp solving */
if (get_free_regs(restr_nodes, cls, src_node) == 1 && get_free_regs(restr_nodes, cls, trg_node) == 1) {
return;
@@ -282,7 +282,7 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
pbqp_t *pbqp_inst = pbqp_alloc_env->pbqp_inst;
pbqp_node_t **temp_list = NEW_ARR_F(pbqp_node_t*, 0);
ir_nodeset_t live_nodes;
-#if USE_BIPARTIT_MATCHING
+#if USE_BIPARTITE_MATCHING
int *assignment = ALLOCAN(int, cls->n_regs);
#else
unsigned *restr_nodes = pbqp_alloc_env->restr_nodes;
@@ -306,13 +306,13 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
if (!arch_irn_consider_in_reg_alloc(cls, value))
continue;
- /* create pbqp source node if it dosn't exist */
+ /* create pbqp source node if it doesn't exist */
if (!get_node(pbqp_inst, get_irn_idx(value)))
create_pbqp_node(pbqp_alloc_env, value);
/* create nodes and interference edges */
foreach_ir_nodeset(&live_nodes, live, iter) {
- /* create pbqp source node if it dosn't exist */
+ /* create pbqp source node if it doesn't exist */
if (!get_node(pbqp_inst, get_irn_idx(live)))
create_pbqp_node(pbqp_alloc_env, live);
@@ -329,7 +329,7 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
be_liveness_transfer(cls, irn, &live_nodes);
}
-#if USE_BIPARTIT_MATCHING
+#if USE_BIPARTITE_MATCHING
if (get_irn_mode(irn) == mode_T) {
unsigned clique_size = 0;
unsigned n_alloc = 0;
@@ -448,9 +448,9 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
if (last_element == NULL)
continue;
- /* check if proj has an if edge to last_element (at this time pbqp contains only if edges) */
+ /* check if proj has an interference edge to last_element (at this time pbqp contains only interference edges) */
if (get_edge(pbqp_inst, proj->node_idx, last_element->node_idx) == NULL && get_edge(pbqp_inst, last_element->node_idx, proj->node_idx) == NULL) {
- allHaveIFEdges = false; /* there is no if edge between proj and last_element */
+ allHaveIFEdges = false; /* there is no interference edge between proj and last_element */
}
}
@@ -502,7 +502,7 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
#endif
}
- /* add the temp rpeo list of this block to the global reverse perfect
+ /* add the temp peo list of this block to the global reverse perfect
* elimination order list */
for (size_t i = ARR_LEN(temp_list); i-- > 0;) {
if (temp_list[i] == NULL)
@@ -513,7 +513,7 @@ static void create_pbqp_coloring_instance(ir_node *block, void *data)
/* free reserved memory */
ir_nodeset_destroy(&live_nodes);
DEL_ARR_F(temp_list);
-#if USE_BIPARTIT_MATCHING
+#if USE_BIPARTITE_MATCHING
#else
DEL_ARR_F(sorted_list);
del_pqueue(queue);