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
27 #ifndef KAPS_OPTIMAL_H
28 #define KAPS_OPTIMAL_H
32 extern pbqp_edge **edge_bucket;
33 extern pbqp_node **node_buckets[4];
34 extern pbqp_node **reduced_bucket;
35 extern pbqp_node **rn_bucket;
37 void apply_edge(pbqp *pbqp);
39 void apply_RI(pbqp *pbqp);
40 void apply_RII(pbqp *pbqp);
41 void apply_RM(pbqp *pbqp, pbqp_node *node);
43 void back_propagate(pbqp *pbqp);
44 num determine_solution(pbqp *pbqp);
45 void fill_node_buckets(pbqp *pbqp);
46 void free_buckets(void);
47 unsigned get_local_minimal_alternative(pbqp *pbqp, pbqp_node *node);
48 pbqp_node *get_node_with_max_degree(void);
49 void initial_simplify_edges(pbqp *pbqp);
50 void select_alternative(pbqp_node *node, unsigned selected_index);
51 void simplify_edge(pbqp *pbqp, pbqp_edge *edge);
52 void reorder_node(pbqp_node *node);
54 int node_is_reduced(pbqp_node *node);
56 #endif /* KAPS_OPTIMAL_H */