- integrated new PBQP solver into existing PBQP transformation, so it can be easily...
[libfirm] / pbqp_t.h
1 #ifndef KAPS_PBQP_T_H
2 #define KAPS_PBQP_T_H
3
4 #include <limits.h>
5 #include <stdio.h>
6
7 #include "adt/obstack.h"
8
9 typedef int num;
10
11 #include "matrix_t.h"
12 #include "vector_t.h"
13
14 typedef struct pbqp_edge pbqp_edge;
15 typedef struct pbqp_node pbqp_node;
16 typedef struct pbqp      pbqp;
17
18 static const num INF_COSTS = INT_MAX;
19
20 struct pbqp {
21         struct obstack obstack;            /* Obstack. */
22         num            solution;           /* Computed solution. */
23         size_t         num_nodes;          /* Number of PBQP nodes. */
24         pbqp_node    **nodes;              /* Nodes of PBQP. */
25         FILE          *dump_file;          /* File to dump in. */
26 };
27
28 #endif /* KAPS_PBQP_T_H */