Adapt to coding conventions.

[libfirm] / pbqp_node.c

diff --git a/pbqp_node.c b/pbqp_node.c
index 9f982a8..cd9536b 100644 (file)
--- a/pbqp_node.c
+++ b/pbqp_node.c
@@ -1,3 +1,31 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief   PBQP nodes.
+ * @date    02.10.2008
+ * @author  Sebastian Buchwald
+ * @version $Id$
+ */
+#include "config.h"
+
 #include "adt/array.h"
 
 #include "assert.h"
@@ -77,13 +105,14 @@ pbqp_node *pbqp_node_deep_copy(pbqp *pbqp, pbqp_node_bucket new_bucket, pbqp_nod
        unsigned   edge_index;
        unsigned   edge_length = pbqp_node_get_degree(node);
        pbqp_node *copy        = obstack_alloc(&pbqp->obstack, sizeof(*node));
+
        assert(copy);
 
        copy->edges        = NEW_ARR_F(pbqp_edge *, 0);
        for (edge_index = 0; edge_index < edge_length; ++edge_index) {
-               pbqp_edge *edge_copy;
-               pbqp_edge *edge        = node->edges[edge_index];
-               int        is_src      = edge->src == node;
+               pbqp_edge *edge_copy = NULL;
+               pbqp_edge *edge      = node->edges[edge_index];
+               int        is_src    = edge->src == node;
 
                if (is_src) {
                        unsigned other_index = edge->tgt->bucket_index;
@@ -96,7 +125,8 @@ pbqp_node *pbqp_node_deep_copy(pbqp *pbqp, pbqp_node_bucket new_bucket, pbqp_nod
 
                                for (index = 0; index < degree; ++index) {
                                        if (other_copy->edges[index]->src == node) {
-                                               edge_copy = other_copy->edges[index];
+                                               edge_copy      = other_copy->edges[index];
+                                               edge_copy->src = copy;
                                                break;
                                        }
                                }
@@ -114,7 +144,8 @@ pbqp_node *pbqp_node_deep_copy(pbqp *pbqp, pbqp_node_bucket new_bucket, pbqp_nod
 
                                for (index = 0; index < degree; ++index) {
                                        if (other_copy->edges[index]->tgt == node) {
-                                               edge_copy = other_copy->edges[index];
+                                               edge_copy      = other_copy->edges[index];
+                                               edge_copy->tgt = copy;
                                                break;
                                        }
                                }