4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Common stuff used by all ILP fomulations.
11 #ifndef _BECOPYILP_T_H
12 #define _BECOPYILP_T_H
14 #include "firm_config.h"
25 #include "becopyopt_t.h"
27 /******************************************************************************
30 | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
31 \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
32 ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
33 |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
35 *****************************************************************************/
37 typedef struct _coloring_suffix_t coloring_suffix_t;
39 struct _coloring_suffix_t {
40 coloring_suffix_t *next;
44 typedef struct _size_red_t {
46 pset *all_removed; /**< All nodes removed during problem size reduction */
47 coloring_suffix_t *col_suff; /**< Coloring suffix. Reverse would be a PEO prefix */
52 * Just prepare. Do nothing yet.
54 size_red_t *new_size_red(copy_opt_t *co);
57 * Checks if a node has already been removed
59 #define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
62 * Virtually remove all nodes not related to the problem
63 * (simplicial AND not adjacent to a equal-color-edge)
65 void sr_remove(size_red_t *sr);
68 * Virtually reinsert the nodes removed before and color them
70 void sr_reinsert(size_red_t *sr);
75 void free_size_red(size_red_t *sr);
78 * TODO: This search is necessary because during the construction of the
79 * units (ou's) args could be merged and weights are accumulated.
82 static INLINE int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
86 /* search optimization unit for phi */
87 list_for_each_entry(unit_t, curr, &co->units, units)
88 if (curr->nodes[0] == root) {
90 for (i=1; i<curr->node_count; ++i)
91 if (curr->nodes[i] == arg)
92 return curr->costs[i];
94 assert(0 && "irn must occur in this ou");
97 assert(0 && "phi must be found in a ou");
101 /******************************************************************************
102 _____ _ _____ _ _____
103 / ____| (_) |_ _| | | __ \
104 | | __ ___ _ __ ___ _ __ _ ___ | | | | | |__) |
105 | | |_ |/ _ \ '_ \ / _ \ '__| |/ __| | | | | | ___/
106 | |__| | __/ | | | __/ | | | (__ _| |_| |____| |
107 \_____|\___|_| |_|\___|_| |_|\___| |_____|______|_|
109 *****************************************************************************/
114 #define LPP_SOLVE_NET
117 # include <lpp/lpp_net.h>
119 # include <lpp/lpp_cplex.h>
122 #define EPSILON 0.00001
124 typedef struct _ilp_env_t ilp_env_t;
126 typedef void(*ilp_callback)(ilp_env_t*);
129 const copy_opt_t *co; /**< the copy opt problem */
130 size_red_t *sr; /**< problem size reduction. removes simple nodes */
131 lpp_t *lp; /**< the linear programming problem */
137 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env);
139 lpp_sol_state_t ilp_go(ilp_env_t *ienv);
141 void free_ilp_env(ilp_env_t *ienv);
144 #define name_cdd(buf, char1, int1, int2) \
145 (snprintf(buf, sizeof(buf), "%c_%d_%d", char1, int1, int2), buf)
147 #define name_cdd_sorted(buf, char1, int1, int2) \
148 name_cdd(buf, char1, MIN(int1, int2), MAX(int1, int2))