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                 unsigned tmp = src_index;
  23                 src_index    = tgt_index;
  24                 tgt_index    = tmp;
  25         }
  26
  27         pbqp_node *src_node = get_node(pbqp, src_index);
  28         pbqp_node *tgt_node = get_node(pbqp, tgt_index);
  29         assert(src_node);
  30         assert(tgt_node);
  31
  32         len = ARR_LEN(src_node->edges);
  33
  34         for (i = 0; i < len; ++i) {
  35                 pbqp_edge *cur_edge = src_node->edges[i];
  36                 if (cur_edge->tgt == tgt_node) {
  37                         return cur_edge;
  38                 }
  39         }
  40
  41         return NULL;
  42 }
  43
  44 pbqp *alloc_pbqp(unsigned number_nodes)
  45 {
  46         pbqp* pbqp = xmalloc(sizeof(*pbqp));
  47
  48         obstack_init(&pbqp->obstack);
  49
  50         pbqp->solution = 0;
  51         pbqp->num_nodes = number_nodes;
  52         pbqp->dump_file = NULL;
  53         pbqp->nodes = obstack_alloc(&pbqp->obstack, number_nodes
  54                         * sizeof(*pbqp->nodes));
  55         memset(pbqp->nodes, 0, number_nodes * sizeof(*pbqp->nodes));
  56 #if KAPS_STATISTIC
  57         pbqp->num_bf = 0;
  58         pbqp->num_edges = 0;
  59         pbqp->num_r0 = 0;
  60         pbqp->num_r1 = 0;
  61         pbqp->num_r2 = 0;
  62         pbqp->num_rn = 0;
  63 #endif
  64
  65         return pbqp;
  66 }
  67
  68 void free_pbqp(pbqp *pbqp)
  69 {
  70         obstack_free(&pbqp->obstack, NULL);
  71         xfree(pbqp);
  72 }
  73
  74 void add_node_costs(pbqp *pbqp, unsigned node_index, vector *costs)
  75 {
  76         pbqp_node *node = get_node(pbqp, node_index);
  77
  78         if (node == NULL) {
  79                 node = alloc_node(pbqp, node_index, costs);
  80                 pbqp->nodes[node_index] = node;
  81         } else {
  82                 vector_add(node->costs, costs);
  83         }
  84 }
  85
  86 void add_edge_costs(pbqp *pbqp, unsigned src_index, unsigned tgt_index,
  87                 pbqp_matrix *costs)
  88 {
  89         pbqp_edge *edge = get_edge(pbqp, src_index, tgt_index);
  90
  91         if (tgt_index < src_index) {
  92                 pbqp_matrix_transpose(pbqp, costs);
  93                 add_edge_costs(pbqp, tgt_index, src_index, costs);
  94                 return;
  95         }
  96
  97         if (edge == NULL) {
  98                 edge = alloc_edge(pbqp, src_index, tgt_index, costs);
  99         } else {
 100                 pbqp_matrix_add(edge->costs, costs);
 101         }
 102 }
 103
 104 num get_node_solution(pbqp *pbqp, unsigned node_index)
 105 {
 106         pbqp_node *node = get_node(pbqp, node_index);
 107         assert(node);
 108
 109         return node->solution;
 110 }
 111
 112 num get_solution(pbqp *pbqp)
 113 {
 114         return pbqp->solution;
 115 }
 116
 117 void set_dumpfile(pbqp *pbqp, FILE *f)
 118 {
 119         assert(pbqp);
 120         pbqp->dump_file = f;
 121 }