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 Heuristic PBQP solver.
24 * @author Sebastian Buchwald
26 #ifndef KAPS_OPTIMAL_H
27 #define KAPS_OPTIMAL_H
31 extern pbqp_edge_t **edge_bucket;
32 extern pbqp_node_t **node_buckets[4];
33 extern pbqp_node_t **reduced_bucket;
34 extern pbqp_node_t *merged_node;
36 void apply_edge(pbqp_t *pbqp);
38 void apply_RI(pbqp_t *pbqp);
39 void apply_RII(pbqp_t *pbqp);
40 void apply_RM(pbqp_t *pbqp, pbqp_node_t *node);
42 void back_propagate(pbqp_t *pbqp);
43 num determine_solution(pbqp_t *pbqp);
44 void fill_node_buckets(pbqp_t *pbqp);
45 void free_buckets(void);
46 unsigned get_local_minimal_alternative(pbqp_t *pbqp, pbqp_node_t *node);
47 pbqp_node_t *get_node_with_max_degree(void);
48 void initial_simplify_edges(pbqp_t *pbqp);
49 void select_alternative(pbqp_node_t *node, unsigned selected_index);
50 void simplify_edge(pbqp_t *pbqp, pbqp_edge_t *edge);
51 void reorder_node_after_edge_deletion(pbqp_node_t *node);
52 void reorder_node_after_edge_insertion(pbqp_node_t *node);
54 int node_is_reduced(pbqp_node_t *node);
56 #endif /* KAPS_OPTIMAL_H */