Removed unused variables and addes some asserts.

[libfirm] / pbqp_node.c

diff --git a/pbqp_node.c b/pbqp_node.c
index 51a2248..b4aaae6 100644 (file)
--- a/pbqp_node.c
+++ b/pbqp_node.c
@@ -4,9 +4,10 @@
 
 #include "pbqp_node.h"
 #include "pbqp_node_t.h"
+#include "pbqp_edge_t.h"
 #include "vector.h"
 
-pbqp_node *alloc_node(pbqp *pbqp, vector *costs)
+pbqp_node *alloc_node(pbqp *pbqp, unsigned node_index, vector *costs)
 {
        pbqp_node *node = obstack_alloc(&pbqp->obstack, sizeof(*node));
        assert(node);
@@ -15,10 +16,35 @@ pbqp_node *alloc_node(pbqp *pbqp, vector *costs)
        node->costs = vector_copy(pbqp, costs);
        node->bucket_index = UINT_MAX;
        node->solution = UINT_MAX;
+       node->index = node_index;
 
        return node;
 }
 
+int is_connected(pbqp_node *node, pbqp_edge *edge)
+{
+       pbqp_edge **edges;
+       unsigned    edge_index;
+       unsigned    edge_len;
+
+       assert(node);
+       assert(edge);
+
+       if (edge->src != node && edge->tgt != node) return 0;
+
+       edges = node->edges;
+       edge_len = ARR_LEN(edges);
+
+       for (edge_index = 0; edge_index < edge_len; ++edge_index) {
+               pbqp_edge *edge_candidate = edges[edge_index];
+               if (edge_candidate == edge) {
+                       return 1;
+               }
+       }
+
+       return 0;
+}
+
 void disconnect_edge(pbqp_node *node, pbqp_edge *edge)
 {
        pbqp_edge **edges;
@@ -37,3 +63,28 @@ void disconnect_edge(pbqp_node *node, pbqp_edge *edge)
                }
        }
 }
+
+unsigned pbqp_node_get_degree(pbqp_node *node)
+{
+       assert(node);
+       return ARR_LEN(node->edges);
+}
+
+pbqp_node *pbqp_node_deep_copy(pbqp *pbqp, pbqp_node *node)
+{
+       unsigned   edge_index;
+       unsigned   edge_length = pbqp_node_get_degree(node);
+       pbqp_node *copy        = obstack_alloc(&pbqp->obstack, sizeof(*node));
+       assert(copy);
+
+       for (edge_index = 0; edge_index < edge_length; ++edge_index) {
+               copy->edges[edge_index] = pbqp_edge_deep_copy(node->edges[edge_index]);
+       }
+       copy->edges        = NEW_ARR_F(pbqp_edge *, 0);
+       copy->costs        = vector_copy(pbqp, node->costs);
+       copy->bucket_index = node->bucket_index;
+       copy->solution     = node->solution;
+       copy->index   = node->index;
+
+       return node;
+}