2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
24 * @author Sebastian Buchwald
29 #include "adt/array.h"
34 #include "pbqp_edge.h"
35 #include "pbqp_edge_t.h"
36 #include "pbqp_node.h"
37 #include "pbqp_node_t.h"
40 pbqp_edge *alloc_edge(pbqp *pbqp, int src_index, int tgt_index, pbqp_matrix *costs)
44 if (tgt_index < src_index) {
46 src_index = tgt_index;
52 pbqp_edge *edge = obstack_alloc(&pbqp->obstack, sizeof(*edge));
55 pbqp_node *src_node = get_node(pbqp, src_index);
58 pbqp_node *tgt_node = get_node(pbqp, tgt_index);
62 edge->costs = pbqp_matrix_copy_and_transpose(pbqp, costs);
64 edge->costs = pbqp_matrix_copy(pbqp, costs);
68 * Connect edge with incident nodes. Since the edge is allocated, we know
69 * that it don't appear in the edge lists of the nodes.
71 ARR_APP1(pbqp_edge *, src_node->edges, edge);
73 ARR_APP1(pbqp_edge *, tgt_node->edges, edge);
75 edge->bucket_index = UINT_MAX;
80 void delete_edge(pbqp_edge *edge)
92 disconnect_edge(src_node, edge);
93 disconnect_edge(tgt_node, edge);
96 pbqp_edge *pbqp_edge_deep_copy(pbqp *pbqp, pbqp_edge *edge,
97 pbqp_node *src_node, pbqp_node *tgt_node)
99 pbqp_edge *copy = obstack_alloc(&pbqp->obstack, sizeof(*copy));
104 copy->costs = pbqp_matrix_copy(pbqp, edge->costs);
106 /* Connect edge with incident nodes. */
107 copy->src = src_node;
108 copy->tgt = tgt_node;
109 copy->bucket_index = UINT_MAX;