From: Sebastian Buchwald <Sebastian.Buchwald@kit.edu>
Date: Mon, 6 Oct 2008 12:51:24 +0000 (+0000)
Subject: - added RN reduction (node used, not test, no html dump)
X-Git-Url: http://nsz.repo.hu/git/?a=commitdiff_plain;h=b1b7b0d991eeac15ade2c354ba4467f4ab7ed858;p=libfirm

- added RN reduction (node used, not test, no html dump)

[r22529]
---

diff --git a/heuristical.c b/heuristical.c
index 37f62acc3..8b1e14229 100644
--- a/heuristical.c
+++ b/heuristical.c
@@ -563,6 +563,67 @@ void apply_RII(pbqp *pbqp)
 	simplify_edge(pbqp, edge);
 }
 
+void apply_RN(pbqp *pbqp)
+{
+	pbqp_node  **bucket     = node_buckets[3];
+	unsigned     bucket_len = ARR_LEN(bucket);
+	pbqp_node   *node       = bucket[bucket_len - 1];
+	pbqp_edge   *edge;
+	vector      *node_vec   = node->costs;
+	vector      *vec;
+	pbqp_matrix *mat;
+	unsigned     edge_index;
+	unsigned     edge_len   = ARR_LEN(node->edges);
+	unsigned     node_index;
+	unsigned     node_len   = ARR_LEN(node_vec);
+	unsigned     min_index  = 0;
+	num          min        = INF_COSTS;
+	int          is_src;
+
+	assert(pbqp);
+
+	for (node_index = 0; node_index < node_len; ++node_index) {
+		num value = 0;
+
+		for (edge_index = 0; edge_index < edge_len; ++edge_index) {
+			edge   = node->edges[edge_index];
+			mat    = edge->costs;
+			is_src = edge->src == node;
+
+			if (is_src) {
+				vec = vector_copy(pbqp, edge->tgt->costs);
+				vector_add_matrix_row(vec, mat, node_index);
+			} else {
+				vec = vector_copy(pbqp, edge->src->costs);
+				vector_add_matrix_col(vec, mat, node_index);
+			}
+
+			value = pbqp_add(value, vector_get_min(vec));
+
+			obstack_free(&pbqp->obstack, vec);
+		}
+
+		if (value < min) {
+			min = value;
+			min_index = node_index;
+		}
+	}
+
+	node->solution = min_index;
+
+	/* Now that we found the local minimum set all other costs to infinity. */
+	for (node_index = 0; node_index < node_len; ++node_index) {
+		if (node_index != min_index) {
+			node_vec->entries[node_index].data = INF_COSTS;
+		}
+	}
+
+	/* Add all incident edges to edge bucket, since they are now independent. */
+	for (edge_index = 0; edge_index < edge_len; ++edge_index) {
+		ARR_APP1(pbqp_edge *, edge_bucket, node->edges[node_index]);
+	}
+}
+
 void back_propagate_RI(pbqp *pbqp, pbqp_node *node)
 {
 	pbqp_edge   *edge;
diff --git a/heuristical.h b/heuristical.h
index 1fab63c4c..4d3a55657 100644
--- a/heuristical.h
+++ b/heuristical.h
@@ -7,6 +7,7 @@ void solve_pbqp_heuristical(pbqp *pbqp);
 
 void apply_RI(pbqp *pbqp);
 void apply_RII(pbqp *pbqp);
+void apply_RN(pbqp *pbqp);
 
 void back_propagate_RI(pbqp *pbqp, pbqp_node *node);
 void back_propagate_RII(pbqp *pbqp, pbqp_node *node);