summaryrefslogtreecommitdiffhomepage
path: root/ir/be/becopyilp.c
blob: 4e3bed6969062595ae3185040bbf77292f5fe9c2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
/*
 * This file is part of libFirm.
 * Copyright (C) 2012 University of Karlsruhe.
 */

/**
 * @file
 * @brief       Common stuff used by all ILP formulations.
 * @author      Daniel Grund
 * @date        28.02.2006
 */
#include "becopyilp_t.h"

#include "be_t.h"
#include "becopyopt_t.h"
#include "beifg.h"
#include "belive.h"
#include "bemodule.h"
#include "irprintf.h"
#include "irtools.h"
#include "lc_opts_enum.h"
#include "panic.h"
#include "statev_t.h"
#include <stdbool.h>
#include <stdio.h>

#define DUMP_ILP 1

static int      time_limit = 60;
static bool     solve_log  = false;
static unsigned dump_flags = 0;

static const lc_opt_enum_mask_items_t dump_items[] = {
	{ "ilp", DUMP_ILP },
	{ NULL, 0 }
};

static lc_opt_enum_mask_var_t dump_var = {
	&dump_flags, dump_items
};

static const lc_opt_table_entry_t options[] = {
	LC_OPT_ENT_INT      ("limit", "time limit for solving in seconds (0 for unlimited)", &time_limit),
	LC_OPT_ENT_BOOL     ("log",   "show ilp solving log", &solve_log),
	LC_OPT_ENT_ENUM_MASK("dump",  "dump flags", &dump_var),
	LC_OPT_LAST
};

BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyilp)
void be_init_copyilp(void)
{
	lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
	lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
	lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
	lc_opt_entry_t *co_grp = lc_opt_get_grp(chordal_grp, "co");
	lc_opt_entry_t *ilp_grp = lc_opt_get_grp(co_grp, "ilp");

	lc_opt_add_table(ilp_grp, options);
}

/******************************************************************************
    _____ _                        _            _   _
   / ____(_)                      | |          | | (_)
  | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
   \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
   ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|

 *****************************************************************************/


/**
 * Checks if a node is simplicial in the graph heeding the already removed nodes.
 */
static inline bool sr_is_simplicial(ilp_env_t *const ienv, ir_node const *const ifn)
{
	bool              res = true;
	ir_node         **all = NEW_ARR_F(ir_node*, 0);
	neighbours_iter_t iter;
	be_ifg_foreach_neighbour(ienv->co->cenv->ifg, &iter, ifn, curr) {
		/* Only consider non-removed neighbours. */
		if (sr_is_removed(ienv, curr))
			continue;

		/* Check whether the current node forms a clique with all previous nodes. */
		for (size_t i = ARR_LEN(all); i-- != 0;) {
			if (!be_values_interfere(curr, all[i])) {
				res = false;
				goto end;
			}
		}

		ARR_APP1(ir_node*, all, curr);
	}

end:
	DEL_ARR_F(all);
	return res;
}

/**
 * Virtually remove all nodes not related to the problem
 * (simplicial AND not adjacent to a equal-color-edge)
 */
static void sr_remove(ilp_env_t *const ienv)
{
	be_ifg_t const *const ifg  = ienv->co->cenv->ifg;
	bool                  redo = true;
	while (redo) {
		redo = false;
		be_ifg_foreach_node(ifg, irn) {
			arch_register_req_t const *const req = arch_get_irn_register_req(irn);
			if (req->limited || sr_is_removed(ienv, irn))
				continue;
			if (co_gs_is_optimizable(ienv->co, irn))
				continue;
			if (!sr_is_simplicial(ienv, irn))
				continue;

			ARR_APP1(ir_node*, ienv->col_suff, irn);
			ir_nodeset_insert(&ienv->all_removed, irn);

			redo = true;
		}
	}
}

/**
 * Virtually reinsert the nodes removed before and color them
 */
static void sr_reinsert(ilp_env_t *const ienv)
{
	/* color the removed nodes in right order */
	unsigned        const n_regs           = ienv->co->cls->n_regs;
	unsigned       *const possible_cols    = rbitset_alloca(n_regs);
	unsigned const *const allocatable_cols = ienv->co->cenv->allocatable_regs->data;
	be_ifg_t const *const ifg              = ienv->co->cenv->ifg;
	for (size_t i = ARR_LEN(ienv->col_suff); i-- != 0;) {
		ir_node *const irn = ienv->col_suff[i];

		rbitset_copy(possible_cols, allocatable_cols, n_regs);

		/* get free color by inspecting all neighbors */
		neighbours_iter_t iter;
		be_ifg_foreach_neighbour(ifg, &iter, irn, other) {

			/* only inspect nodes which are in graph right now */
			if (sr_is_removed(ienv, other))
				continue;

			/* Invalidate all single size register when it is a large one */
			unsigned const width   = arch_get_irn_register_req(other)->width;
			unsigned       cur_col = get_irn_col(other);
			do  {
				rbitset_clear(possible_cols, cur_col);
				++cur_col;
			} while (cur_col % width != 0);
		}

		/* now all bits not set are possible colors */
		/* take one that matches the alignment constraint */
		assert(!rbitset_is_empty(possible_cols, n_regs) && "No free color found. This can not be.");
		unsigned free_col = 0;
		for (;;) {
			free_col = (unsigned)rbitset_next(possible_cols, free_col, true);
			if (free_col % arch_get_irn_register_req(irn)->width == 0)
				break;
			++free_col;
			assert(free_col < n_regs);
		}
		arch_set_irn_register_idx(irn, free_col);
		ir_nodeset_remove(&ienv->all_removed, irn); /* irn is back in graph again */
	}
}

/******************************************************************************
    _____                      _        _____ _      _____
   / ____|                    (_)      |_   _| |    |  __ \
  | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
  | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
  | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
   \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|

 *****************************************************************************/

ilp_env_t *new_ilp_env(copy_opt_t *const co, ilp_callback const build, ilp_callback const apply, void *const env)
{
	ilp_env_t *const res = XMALLOC(ilp_env_t);
	res->co       = co;
	res->build    = build;
	res->apply    = apply;
	res->env      = env;
	res->col_suff = NEW_ARR_F(ir_node*, 0);
	ir_nodeset_init(&res->all_removed);

	return res;
}

lpp_sol_state_t ilp_go(ilp_env_t *const ienv)
{
	sr_remove(ienv);

	ienv->build(ienv);

	if (dump_flags & DUMP_ILP) {
		char buf[128];
		ir_snprintf(buf, sizeof(buf), "%F_%s-co.ilp", ienv->co->irg, ienv->co->cenv->cls->name);
		FILE *const f = fopen(buf, "wt");
		if (!f)
			panic("couldn't open '%s' for writing", buf);
		lpp_dump_plain(ienv->lp, f);
		fclose(f);
	}

	lpp_set_time_limit(ienv->lp, time_limit);
	if (solve_log)
		lpp_set_log(ienv->lp, stdout);

	lpp_solve(ienv->lp, be_options.ilp_solver);

	//stat_ev_dbl("co_ilp_objval",     ienv->lp->objval);
	//stat_ev_dbl("co_ilp_best_bound", ienv->lp->best_bound);
	stat_ev_int("co_ilp_iter",       lpp_get_iter_cnt(ienv->lp));
	stat_ev_dbl("co_ilp_sol_time",   lpp_get_sol_time(ienv->lp));

	ienv->apply(ienv);

	sr_reinsert(ienv);

	return lpp_get_sol_state(ienv->lp);
}

void free_ilp_env(ilp_env_t *const ienv)
{
	ir_nodeset_destroy(&ienv->all_removed);
	DEL_ARR_F(ienv->col_suff);
	lpp_free(ienv->lp);
	free(ienv);
}