X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbera.c;h=36276690b82887129d04e81375e193fa64220c88;hb=80a6158fdd766f42ee6c508a773bc114ff1b61f3;hp=7bddee0c00ff504278f96f19db6210a8fb76702f;hpb=9b060a71a2667ced8d103023eda0ff710e799867;p=libfirm

diff --git a/ir/be/bera.c b/ir/be/bera.c
index 7bddee0c0..36276690b 100644
--- a/ir/be/bera.c
+++ b/ir/be/bera.c
@@ -3,23 +3,138 @@
  * @author Sebastian Hack
  * @date 22.11.2004
  */
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <stdlib.h>
 
 #include "pset.h"
 #include "impl.h"
 
 #include "irnode.h"
 #include "irmode.h"
-#include "besched.h"
+#include "irdom.h"
+
+#include "bera.h"
+#include "beutil.h"
+#include "besched_t.h"
+#include "belive_t.h"
+#include "bemodule.h"
+
+static sched_timestep_t get_time_step(const ir_node *irn)
+{
+	if(is_Phi(irn))
+		return 0;
+
+	return sched_get_time_step(irn);
+}
+
+int value_dominates(const ir_node *a, const ir_node *b)
+{
+	int res = 0;
+	const ir_node *ba = get_block(a);
+	const ir_node *bb = get_block(b);
+
+	/*
+	 * a and b are not in the same block,
+	 * so dominance is determined by the dominance of the blocks.
+	 */
+	if(ba != bb) {
+		res = block_dominates(ba, bb);
+
+	/*
+	 * Dominance is determined by the time steps of the schedule.
+	 */
+	} else {
+		sched_timestep_t as = get_time_step(a);
+		sched_timestep_t bs = get_time_step(b);
+		res = as <= bs;
+	}
+
+	return res;
+}
+
+/**
+ * Check, if two values interfere.
+ * @param a The first value.
+ * @param b The second value.
+ * @return 1, if a and b interfere, 0 if not.
+ */
+int values_interfere(const be_lv_t *lv, const ir_node *a, const ir_node *b)
+{
+	int a2b = value_dominates(a, b);
+	int b2a = value_dominates(b, a);
+
+	/* If there is no dominance relation, they do not interfere. */
+	if((a2b | b2a) > 0) {
+		const ir_edge_t *edge;
+		ir_node *bb;
+
+		/*
+		 * Adjust a and b so, that a dominates b if
+		 * a dominates b or vice versa.
+		 */
+		if(b2a) {
+			const ir_node *t = a;
+			a = b;
+			b = t;
+		}
+
+		bb = get_nodes_block(b);
+
+		/*
+		 * If a is live end in b's block it is
+		 * live at b's definition (a dominates b)
+		 */
+		if(be_is_live_end(lv, bb, a))
+			return 1;
+
+		/*
+		 * Look at all usages of a.
+		 * If there's one usage of a in the block of b, then
+		 * we check, if this use is dominated by b, if that's true
+		 * a and b interfere. Note that b must strictly dominate the user,
+		 * since if b is the last user of in the block, b and a do not
+		 * interfere.
+		 * Uses of a not in b's block can be disobeyed, because the
+		 * check for a being live at the end of b's block is already
+		 * performed.
+		 */
+		foreach_out_edge(a, edge) {
+			const ir_node *user = get_edge_src_irn(edge);
+			if(get_nodes_block(user) == bb && !is_Phi(user) && b != user && value_dominates(b, user))
+				return 1;
+		}
+  	}
 
-#include "bera_t.h"
+	return 0;
+}
 
-FIRM_IMPL1(is_allocatable_irn, int, const ir_node *)
+/** The list of register allocators */
+static be_module_list_entry_t *register_allocators = NULL;
+static be_ra_t *selected_allocator = NULL;
 
-size_t ra_irn_data_offset = 0;
-size_t ra_irg_data_offset = 0;
+void be_register_allocator(const char *name, be_ra_t *allocator)
+{
+	if(selected_allocator == NULL)
+		selected_allocator = allocator;
+	be_add_module_to_list(&register_allocators, name, allocator);
+}
 
-void be_ra_init(void)
+void be_allocate_registers(be_irg_t *birg)
 {
-	ra_irn_data_offset = register_additional_node_data(sizeof(ra_info_t));
-	ra_irg_data_offset = register_additional_graph_data(sizeof(void *));
+	assert(selected_allocator != NULL);
+	if(selected_allocator != NULL) {
+		selected_allocator->allocate(birg);
+	}
+}
+
+void be_init_ra(void)
+{
+	lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
+
+	be_add_module_list_opt(be_grp, "regalloc", "register allocator",
+	                       &register_allocators, (void**) &selected_allocator);
 }
+BE_REGISTER_MODULE_CONSTRUCTOR(init_be_ra);