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_node_t *alloc_node(pbqp_t *pbqp, unsigned node_index, vector_t *costs)
42 pbqp_node_t *node = OALLOC(&pbqp->obstack, pbqp_node_t);
45 node->edges = NEW_ARR_F(pbqp_edge_t *, 0);
46 node->costs = vector_copy(pbqp, costs);
47 node->bucket_index = UINT_MAX;
48 node->solution = UINT_MAX;
49 node->index = node_index;
54 int is_connected(pbqp_node_t *node, pbqp_edge_t *edge)
63 if (edge->src != node && edge->tgt != node) return 0;
66 edge_len = ARR_LEN(edges);
68 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
69 pbqp_edge_t *edge_candidate = edges[edge_index];
70 if (edge_candidate == edge) {
78 void disconnect_edge(pbqp_node_t *node, pbqp_edge_t *edge)
85 edge_len = ARR_LEN(edges);
87 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
88 pbqp_edge_t *edge_candidate = edges[edge_index];
89 if (edge_candidate == edge) {
90 edges[edge_index] = edges[edge_len - 1];
91 ARR_SHRINKLEN(edges, (int)edge_len - 1);
97 unsigned pbqp_node_get_degree(pbqp_node_t *node)
100 return ARR_LEN(node->edges);
103 pbqp_node_t *pbqp_node_deep_copy(pbqp_t *pbqp, pbqp_node_bucket_t new_bucket,
107 unsigned edge_length = pbqp_node_get_degree(node);
108 pbqp_node_t *copy = OALLOC(&pbqp->obstack, pbqp_node_t);
112 copy->edges = NEW_ARR_F(pbqp_edge_t *, 0);
113 for (edge_index = 0; edge_index < edge_length; ++edge_index) {
114 pbqp_edge_t *edge_copy = NULL;
115 pbqp_edge_t *edge = node->edges[edge_index];
116 int is_src = edge->src == node;
119 unsigned other_index = edge->tgt->bucket_index;
120 unsigned is_copied = other_index < node->bucket_index;
123 pbqp_node_t *other_copy = new_bucket[other_index];
124 unsigned degree = pbqp_node_get_degree(other_copy);
127 for (index = 0; index < degree; ++index) {
128 if (other_copy->edges[index]->src == node) {
129 edge_copy = other_copy->edges[index];
130 edge_copy->src = copy;
135 edge_copy = pbqp_edge_deep_copy(pbqp, edge, copy, edge->tgt);
138 unsigned other_index = edge->src->bucket_index;
139 unsigned is_copied = other_index < node->bucket_index;
142 pbqp_node_t *other_copy = new_bucket[other_index];
143 unsigned degree = pbqp_node_get_degree(other_copy);
146 for (index = 0; index < degree; ++index) {
147 if (other_copy->edges[index]->tgt == node) {
148 edge_copy = other_copy->edges[index];
149 edge_copy->tgt = copy;
154 edge_copy = pbqp_edge_deep_copy(pbqp, edge, edge->src, copy);
157 ARR_APP1(pbqp_edge_t *, copy->edges, edge_copy);
159 copy->costs = vector_copy(pbqp, node->costs);
160 copy->bucket_index = node->bucket_index;
161 copy->solution = node->solution;
162 copy->index = node->index;