Adapt to latest libfirm.

[libfirm] / pbqp_edge.c

diff --git a/pbqp_edge.c b/pbqp_edge.c
index d94ade9..31b9028 100644 (file)
--- a/pbqp_edge.c
+++ b/pbqp_edge.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 edges.
+ * @date    02.10.2008
+ * @author  Sebastian Buchwald
+ * @version $Id$
+ */
+#include "config.h"
+
 #include "adt/array.h"
 #include "assert.h"
 
@@ -11,8 +39,14 @@
 
 pbqp_edge *alloc_edge(pbqp *pbqp, int src_index, int tgt_index, pbqp_matrix *costs)
 {
+       int transpose = 0;
+
        if (tgt_index < src_index) {
-               return alloc_edge(pbqp, tgt_index, src_index, costs);
+               int tmp = src_index;
+               src_index = tgt_index;
+               tgt_index = tmp;
+
+               transpose = 1;
        }
 
        pbqp_edge *edge = obstack_alloc(&pbqp->obstack, sizeof(*edge));
@@ -24,16 +58,55 @@ pbqp_edge *alloc_edge(pbqp *pbqp, int src_index, int tgt_index, pbqp_matrix *cos
        pbqp_node *tgt_node = get_node(pbqp, tgt_index);
        assert(tgt_node);
 
-       edge->costs = pbqp_matrix_copy(pbqp, costs);
+       if (transpose) {
+               edge->costs = pbqp_matrix_copy_and_transpose(pbqp, costs);
+       } else {
+               edge->costs = pbqp_matrix_copy(pbqp, costs);
+       }
 
        /*
         * Connect edge with incident nodes. Since the edge is allocated, we know
         * that it don't appear in the edge lists of the nodes.
         */
        ARR_APP1(pbqp_edge *, src_node->edges, edge);
-       edge->src = src_index;
+       edge->src = src_node;
        ARR_APP1(pbqp_edge *, tgt_node->edges, edge);
-       edge->tgt = tgt_index;
+       edge->tgt = tgt_node;
+       edge->bucket_index = UINT_MAX;
 
        return edge;
 }
+
+void delete_edge(pbqp_edge *edge)
+{
+       pbqp_node  *src_node;
+       pbqp_node  *tgt_node;
+
+       assert(edge);
+
+       src_node = edge->src;
+       tgt_node = edge->tgt;
+       assert(src_node);
+       assert(tgt_node);
+
+       disconnect_edge(src_node, edge);
+       disconnect_edge(tgt_node, edge);
+}
+
+pbqp_edge *pbqp_edge_deep_copy(pbqp *pbqp, pbqp_edge *edge,
+               pbqp_node *src_node, pbqp_node *tgt_node)
+{
+       pbqp_edge *copy = obstack_alloc(&pbqp->obstack, sizeof(*copy));
+       assert(copy);
+       assert(src_node);
+       assert(tgt_node);
+
+       copy->costs = pbqp_matrix_copy(pbqp, edge->costs);
+
+       /* Connect edge with incident nodes. */
+       copy->src = src_node;
+       copy->tgt = tgt_node;
+       copy->bucket_index = UINT_MAX;
+
+       return copy;
+}