X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=pbqp_t.h;h=9fb316e923c4d212c30f98e8b005366c8a6b9d23;hb=fa4874ea8b3807d7c04a8a966ec0887f9f5a97d1;hp=2a79aff99f452c977796b67310394fa73bdae934;hpb=1ea0aa5252ce08621d0859f9310761accde922ea;p=libfirm

diff --git a/pbqp_t.h b/pbqp_t.h
index 2a79aff99..9fb316e92 100644
--- a/pbqp_t.h
+++ b/pbqp_t.h
@@ -2,25 +2,28 @@
 #define KAPS_PBQP_T_H
 
 #include <limits.h>
+#include <stdint.h>
+#include <stdio.h>
 
 #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 */