Added simplification loop.
[libfirm] / pbqp_node.c
1 #include "adt/array.h"
2
3 #include "assert.h"
4
5 #include "pbqp_node.h"
6 #include "pbqp_node_t.h"
7 #include "vector.h"
8
9 pbqp_node *alloc_node(pbqp *pbqp, vector *costs)
10 {
11         pbqp_node *node = obstack_alloc(&pbqp->obstack, sizeof(*node));
12         assert(node);
13
14         node->edges = NEW_ARR_F(pbqp_edge *, 0);
15         node->costs = vector_copy(pbqp, costs);
16
17         return node;
18 }
19
20 void disconnect_edge(pbqp_node *node, pbqp_edge *edge)
21 {
22         pbqp_edge **edges;
23         unsigned    edge_index;
24         unsigned    edge_len;
25
26         edges = node->edges;
27         edge_len = ARR_LEN(edges);
28
29         for (edge_index = 0; edge_index < edge_len; ++edge_index) {
30                 pbqp_edge *edge_candidate = edges[edge_index];
31                 if (edge_candidate == edge) {
32                         edges[edge_index] = edges[edge_len - 1];
33                         ARR_SHRINKLEN(edges, (int)edge_len - 1);
34                         break;
35                 }
36         }
37 }