nsz Git - libfirm/blob - kaps.c

   1 #include "adt/array.h"
   2
   3 #include "kaps.h"
   4 #include "matrix.h"
   5 #include "pbqp_edge.h"
   6 #include "pbqp_edge_t.h"
   7 #include "pbqp_node.h"
   8 #include "pbqp_node_t.h"
   9 #include "vector.h"
  10
  11 pbqp_node *get_node(pbqp *pbqp, unsigned index)
  12 {
  13         return pbqp->nodes[index];
  14 }
  15
  16 pbqp_edge *get_edge(pbqp *pbqp, unsigned src_index, unsigned tgt_index)
  17 {
  18         int i;
  19         int len;
  20
  21         if (tgt_index < src_index) {
  22                 return get_edge(pbqp, tgt_index, src_index);
  23         }
  24
  25         pbqp_node *src_node = get_node(pbqp, src_index);
  26         assert(src_node);
  27         assert(get_node(pbqp, tgt_index));
  28
  29         len = ARR_LEN(src_node->edges);
  30
  31         for (i = 0; i < len; ++i) {
  32                 pbqp_edge *cur_edge = src_node->edges[i];
  33                 if (cur_edge->tgt->index == tgt_index) {
  34                         return cur_edge;
  35                 }
  36         }
  37
  38         return NULL;
  39 }
  40
  41 pbqp *alloc_pbqp(unsigned number_nodes)
  42 {
  43         pbqp* pbqp = xmalloc(sizeof(*pbqp));
  44
  45         obstack_init(&pbqp->obstack);
  46
  47         pbqp->solution = 0;
  48         pbqp->num_nodes = number_nodes;
  49         pbqp->dump_file = NULL;
  50         pbqp->nodes = obstack_alloc(&pbqp->obstack, number_nodes
  51                         * sizeof(*pbqp->nodes));
  52         memset(pbqp->nodes, 0, number_nodes * sizeof(*pbqp->nodes));
  53
  54         return pbqp;
  55 }
  56
  57 void free_pbqp(pbqp *pbqp)
  58 {
  59         obstack_free(&pbqp->obstack, NULL);
  60         xfree(pbqp);
  61 }
  62
  63 void add_node_costs(pbqp *pbqp, unsigned node_index, vector *costs)
  64 {
  65         pbqp_node *node = get_node(pbqp, node_index);
  66
  67         if (node == NULL) {
  68                 node = alloc_node(pbqp, node_index, costs);
  69                 pbqp->nodes[node_index] = node;
  70         } else {
  71                 vector_add(node->costs, costs);
  72         }
  73 }
  74
  75 void add_edge_costs(pbqp *pbqp, unsigned src_index, unsigned tgt_index,
  76                 pbqp_matrix *costs)
  77 {
  78         pbqp_edge *edge = get_edge(pbqp, src_index, tgt_index);
  79
  80         if (edge == NULL) {
  81                 edge = alloc_edge(pbqp, src_index, tgt_index, costs);
  82         } else {
  83                 pbqp_matrix_add(edge->costs, costs);
  84         }
  85 }
  86
  87 num get_node_solution(pbqp *pbqp, unsigned node_index)
  88 {
  89         pbqp_node *node = get_node(pbqp, node_index);
  90         assert(node);
  91
  92         return node->solution;
  93 }
  94
  95 num get_solution(pbqp *pbqp)
  96 {
  97         return pbqp->solution;
  98 }
  99
 100 void set_dumpfile(pbqp *pbqp, FILE *f)
 101 {
 102         assert(pbqp);
 103         pbqp->dump_file = f;
 104 }