nsz Git - libfirm/blob - pbqp_edge.c

   1 #include "adt/array.h"
   2 #include "assert.h"
   3
   4 #include "kaps.h"
   5 #include "matrix.h"
   6 #include "pbqp_edge.h"
   7 #include "pbqp_edge_t.h"
   8 #include "pbqp_node.h"
   9 #include "pbqp_node_t.h"
  10 #include "pbqp_t.h"
  11
  12 pbqp_edge *alloc_edge(pbqp *pbqp, int src_index, int tgt_index, pbqp_matrix *costs)
  13 {
  14         int transpose = 0;
  15
  16         if (tgt_index < src_index) {
  17                 int tmp = src_index;
  18                 src_index = tgt_index;
  19                 tgt_index = tmp;
  20
  21                 transpose = 1;
  22         }
  23
  24         pbqp_edge *edge = obstack_alloc(&pbqp->obstack, sizeof(*edge));
  25         assert(edge);
  26
  27         pbqp_node *src_node = get_node(pbqp, src_index);
  28         assert(src_node);
  29
  30         pbqp_node *tgt_node = get_node(pbqp, tgt_index);
  31         assert(tgt_node);
  32
  33         if (transpose) {
  34                 edge->costs = pbqp_matrix_copy_and_transpose(pbqp, costs);
  35         } else {
  36                 edge->costs = pbqp_matrix_copy(pbqp, costs);
  37         }
  38
  39         /*
  40          * Connect edge with incident nodes. Since the edge is allocated, we know
  41          * that it don't appear in the edge lists of the nodes.
  42          */
  43         ARR_APP1(pbqp_edge *, src_node->edges, edge);
  44         edge->src = src_node;
  45         ARR_APP1(pbqp_edge *, tgt_node->edges, edge);
  46         edge->tgt = tgt_node;
  47         edge->bucket_index = UINT_MAX;
  48
  49         return edge;
  50 }
  51
  52 void delete_edge(pbqp_edge *edge)
  53 {
  54         pbqp_node  *src_node;
  55         pbqp_node  *tgt_node;
  56
  57         assert(edge);
  58
  59         src_node = edge->src;
  60         tgt_node = edge->tgt;
  61         assert(src_node);
  62         assert(tgt_node);
  63
  64         disconnect_edge(src_node, edge);
  65         disconnect_edge(tgt_node, edge);
  66 }
  67
  68 pbqp_edge *pbqp_edge_deep_copy(pbqp *pbqp, pbqp_edge *edge)
  69 {
  70         return alloc_edge(pbqp, edge->src->index, edge->tgt->index, edge->costs);
  71 }