X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=pbqp_t.h;h=9fb316e923c4d212c30f98e8b005366c8a6b9d23;hb=fe4449bb019217bdc353e3a78e78b8849ee52690;hp=bb8a34c9ca75fc376c880d8c79de8f7d6a087dee;hpb=d01193ed5f4474a0f51b2b8dd809f5b39ac9b722;p=libfirm diff --git a/pbqp_t.h b/pbqp_t.h index bb8a34c9c..9fb316e92 100644 --- a/pbqp_t.h +++ b/pbqp_t.h @@ -2,22 +2,28 @@ #define KAPS_PBQP_T_H #include +#include +#include + +#include "adt/obstack.h" + +typedef intmax_t num; #include "matrix_t.h" #include "vector_t.h" -typedef int num; - typedef struct pbqp_edge pbqp_edge; typedef struct pbqp_node pbqp_node; +typedef struct pbqp pbqp; -static const num INF_COST = INT_MAX; +static const num INF_COSTS = INTMAX_MAX; struct pbqp { struct obstack obstack; /* Obstack. */ num solution; /* Computed solution. */ size_t num_nodes; /* Number of PBQP nodes. */ pbqp_node **nodes; /* Nodes of PBQP. */ + FILE *dump_file; /* File to dump in. */ }; #endif /* KAPS_PBQP_T_H */