2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief PBQP data types.
24 * @author Sebastian Buchwald
33 #include "adt/obstack.h"
36 #define KAPS_ENABLE_VECTOR_NAMES 0
37 #define KAPS_STATISTIC 0
39 #define KAPS_USE_UNSIGNED 1
43 #define INF_COSTS UINT_MAX
46 #define INF_COSTS INTMAX_MAX
52 typedef struct pbqp_edge_t pbqp_edge_t;
53 typedef struct pbqp_node_t pbqp_node_t;
54 typedef struct pbqp_t pbqp_t;
57 struct obstack obstack; /* Obstack. */
58 num solution; /* Computed solution. */
59 size_t num_nodes; /* Number of PBQP nodes. */
60 pbqp_node_t **nodes; /* Nodes of PBQP. */
61 FILE *dump_file; /* File to dump in. */
63 unsigned num_bf; /* Number of brute force reductions. */
64 unsigned num_edges; /* Number of independent edges. */
65 unsigned num_r0; /* Number of trivial solved nodes. */
66 unsigned num_r1; /* Number of R1 reductions. */
67 unsigned num_r2; /* Number of R2 reductions. */
68 unsigned num_rm; /* Number of RM reductions. */
69 unsigned num_rn; /* Number of RN reductions. */
73 #endif /* KAPS_PBQP_T_H */