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
22 * @brief Buckets for nodes and edges.
24 * @author Sebastian Buchwald
29 #include "adt/array.h"
32 #include "pbqp_edge_t.h"
33 #include "pbqp_node.h"
34 #include "pbqp_node_t.h"
36 int edge_bucket_contains(pbqp_edge_bucket bucket, pbqp_edge *edge)
40 return edge->bucket_index < edge_bucket_get_length(bucket)
41 && bucket[edge->bucket_index] == edge;
44 void edge_bucket_free(pbqp_edge_bucket *bucket)
50 unsigned edge_bucket_get_length(pbqp_edge_bucket bucket)
52 return ARR_LEN(bucket);
55 void edge_bucket_init(pbqp_edge_bucket *bucket)
57 *bucket = NEW_ARR_F(pbqp_edge *, 0);
60 void edge_bucket_insert(pbqp_edge_bucket *bucket, pbqp_edge *edge)
62 edge->bucket_index = edge_bucket_get_length(*bucket);
63 ARR_APP1(pbqp_edge *, *bucket, edge);
66 pbqp_edge *edge_bucket_pop(pbqp_edge_bucket *bucket)
68 unsigned bucket_len = edge_bucket_get_length(*bucket);
71 assert(bucket_len > 0);
73 edge = (*bucket)[bucket_len - 1];
75 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
76 edge->bucket_index = UINT_MAX;
81 void node_bucket_shrink(pbqp_node_bucket *bucket, unsigned len)
83 ARR_SHRINKLEN(*bucket, (int)len);
86 int node_bucket_contains(pbqp_node_bucket bucket, pbqp_node *node)
90 return node->bucket_index < node_bucket_get_length(bucket)
91 && bucket[node->bucket_index] == node;
94 void node_bucket_copy(pbqp_node_bucket *dst, pbqp_node_bucket src)
97 unsigned src_length = node_bucket_get_length(src);
99 for (src_index = 0; src_index < src_length; ++src_index) {
100 node_bucket_insert(dst, src[src_index]);
104 void node_bucket_update(pbqp *pbqp, pbqp_node_bucket bucket)
107 unsigned length = node_bucket_get_length(bucket);
109 for (index = 0; index < length; ++index) {
110 pbqp->nodes[bucket[index]->index] = bucket[index];
114 void node_bucket_free(pbqp_node_bucket *bucket)
120 unsigned node_bucket_get_length(pbqp_node_bucket bucket)
122 return ARR_LEN(bucket);
125 void node_bucket_init(pbqp_node_bucket *bucket)
127 *bucket = NEW_ARR_F(pbqp_node *, 0);
130 void node_bucket_insert(pbqp_node_bucket *bucket, pbqp_node *node)
132 node->bucket_index = node_bucket_get_length(*bucket);
133 ARR_APP1(pbqp_node *, *bucket, node);
136 pbqp_node *node_bucket_pop(pbqp_node_bucket *bucket)
138 unsigned bucket_len = node_bucket_get_length(*bucket);
141 assert(bucket_len > 0);
143 node = (*bucket)[bucket_len - 1];
146 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
147 node->bucket_index = UINT_MAX;
152 void node_bucket_remove(pbqp_node_bucket *bucket, pbqp_node *node)
154 unsigned bucket_len = node_bucket_get_length(*bucket);
159 assert(node_bucket_contains(*bucket, node));
160 assert(bucket_len > 0);
162 node_index = node->bucket_index;
163 other = (*bucket)[bucket_len - 1];
164 other->bucket_index = node_index;
165 (*bucket)[node_index] = other;
167 ARR_SHRINKLEN(*bucket, (int)bucket_len - 1);
168 node->bucket_index = UINT_MAX;
171 void node_bucket_deep_copy(pbqp *pbqp, pbqp_node_bucket *dst, pbqp_node_bucket src)
173 unsigned bucket_index;
174 unsigned bucket_length;
176 bucket_length = node_bucket_get_length(src);
178 for (bucket_index = 0; bucket_index < bucket_length; ++bucket_index) {
179 node_bucket_insert(dst, pbqp_node_deep_copy(pbqp, *dst, src[bucket_index]));