nsz Git - libfirm/blob - 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         node->bucket_index = UINT_MAX;
  17         node->solution = UINT_MAX;
  18
  19         return node;
  20 }
  21
  22 void disconnect_edge(pbqp_node *node, pbqp_edge *edge)
  23 {
  24         pbqp_edge **edges;
  25         unsigned    edge_index;
  26         unsigned    edge_len;
  27
  28         edges = node->edges;
  29         edge_len = ARR_LEN(edges);
  30
  31         for (edge_index = 0; edge_index < edge_len; ++edge_index) {
  32                 pbqp_edge *edge_candidate = edges[edge_index];
  33                 if (edge_candidate == edge) {
  34                         edges[edge_index] = edges[edge_len - 1];
  35                         ARR_SHRINKLEN(edges, (int)edge_len - 1);
  36                         break;
  37                 }
  38         }
  39 }