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 Partitioned Boolean Quadratic Problem (PBQP) solver.
24 * @author Sebastian Buchwald
29 #include "adt/array.h"
33 #include "pbqp_edge.h"
34 #include "pbqp_edge_t.h"
35 #include "pbqp_node.h"
36 #include "pbqp_node_t.h"
39 pbqp_node *get_node(pbqp *pbqp, unsigned index)
41 return pbqp->nodes[index];
44 pbqp_edge *get_edge(pbqp *pbqp, unsigned src_index, unsigned tgt_index)
49 if (tgt_index < src_index) {
50 unsigned tmp = src_index;
51 src_index = tgt_index;
55 pbqp_node *src_node = get_node(pbqp, src_index);
56 pbqp_node *tgt_node = get_node(pbqp, tgt_index);
60 len = ARR_LEN(src_node->edges);
62 for (i = 0; i < len; ++i) {
63 pbqp_edge *cur_edge = src_node->edges[i];
64 if (cur_edge->tgt == tgt_node) {
72 pbqp *alloc_pbqp(unsigned number_nodes)
74 pbqp* pbqp = xmalloc(sizeof(*pbqp));
76 obstack_init(&pbqp->obstack);
79 pbqp->num_nodes = number_nodes;
81 pbqp->dump_file = NULL;
83 pbqp->nodes = obstack_alloc(&pbqp->obstack, number_nodes
84 * sizeof(*pbqp->nodes));
85 memset(pbqp->nodes, 0, number_nodes * sizeof(*pbqp->nodes));
99 void free_pbqp(pbqp *pbqp)
101 obstack_free(&pbqp->obstack, NULL);
105 void add_node_costs(pbqp *pbqp, unsigned node_index, vector *costs)
107 pbqp_node *node = get_node(pbqp, node_index);
110 node = alloc_node(pbqp, node_index, costs);
111 pbqp->nodes[node_index] = node;
113 vector_add(node->costs, costs);
117 void add_edge_costs(pbqp *pbqp, unsigned src_index, unsigned tgt_index,
120 pbqp_edge *edge = get_edge(pbqp, src_index, tgt_index);
122 if (tgt_index < src_index) {
123 pbqp_matrix_transpose(pbqp, costs);
124 add_edge_costs(pbqp, tgt_index, src_index, costs);
129 edge = alloc_edge(pbqp, src_index, tgt_index, costs);
131 pbqp_matrix_add(edge->costs, costs);
135 num get_node_solution(pbqp *pbqp, unsigned node_index)
137 pbqp_node *node = get_node(pbqp, node_index);
140 return node->solution;
143 num get_solution(pbqp *pbqp)
145 return pbqp->solution;
149 void set_dumpfile(pbqp *pbqp, FILE *f)