irextbb2.c 5.65 KB
Newer Older
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Matthias Braun's avatar
Matthias Braun committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
18
19
20
 */

/**
Matthias Braun's avatar
Matthias Braun committed
21
22
23
24
25
26
 * @file
 * @brief     Alternative extended basic block computation
 * @author    Matthias Braun
 * @date      5.2005
 * @version   $Id$
 * @summary
27
28
29
 *  Alternative algorithm for computing extended basic blocks (using out edges
 *  and execution frequencies)
 */
Matthias Braun's avatar
Matthias Braun committed
30
#include "config.h"
31

32
33
34
35
36
37
38
39
40
41
42
43
44
#include "irextbb_t.h"
#include "irgwalk.h"
#include "irnode_t.h"
#include "irgraph_t.h"
#include "iredges_t.h"
#include "irouts.h"
#include "xmalloc.h"
#include "irprintf.h"
#include "execfreq.h"

typedef struct _env {
  	struct obstack *obst;   /**< the obstack where allocations took place */
	ir_extblk *head;        /**< head of the list of all extended blocks */
45
	ir_exec_freq *execfreqs;
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
} env_t;

/**
 * allocate a new extended block header.
 */
static ir_extblk *allocate_extblk(ir_node *block, env_t *env)
{
	ir_extblk *extblk = obstack_alloc(env->obst, sizeof(*extblk));

	extblk->kind    = k_ir_extblk;
	extblk->visited = 1;
	extblk->blks    = (ir_node **)env->head;
	extblk->link    = block;
	env->head       = extblk;

	set_Block_extbb(block, extblk);
	set_irn_link(block, NULL);

	return extblk;
}

/**
 * add a block to an extended block
 */
static void addto_extblk(ir_extblk *extblk, ir_node *block)
{
	/* link all blocks belonging to this extended block */
	set_irn_link(block, extblk->link);

	extblk->link = block;
	extblk->visited++;

	set_Block_extbb(block, extblk);
}

/**
 * Returns the number of block successors.
 * we are interested only in 1, 2 and >2.
 */
static int get_block_n_succs(ir_node *block) {
	if (edges_activated(current_ir_graph)) {
		const ir_edge_t *edge;

		edge = get_block_succ_first(block);
		if (! edge)
			return 0;
Christian Würdig's avatar
Christian Würdig committed
92

93
94
95
		edge = get_block_succ_next(block, edge);
		if (! edge)
			return 1;
Christian Würdig's avatar
Christian Würdig committed
96

97
98
99
100
101
102
103
104
105
106
107
		edge = get_block_succ_next(block, edge);
		return edge ? 3 : 2;
	}

	return get_Block_n_cfg_outs(block);
}

static void pick_successor(ir_node *block, ir_extblk *extblk, env_t *env);

static void create_extblk(ir_node *block, env_t *env)
{
Christian Würdig's avatar
Christian Würdig committed
108
109
	ir_extblk *extblk;

110
	if (irn_visited_else_mark(block))
111
112
		return;

Christian Würdig's avatar
Christian Würdig committed
113
	extblk = allocate_extblk(block, env);
114
115
116
117
118
119
120

	pick_successor(block, extblk, env);
}

static void pick_successor(ir_node *block, ir_extblk *extblk, env_t *env)
{
	const ir_edge_t *edge;
Christian Würdig's avatar
Christian Würdig committed
121
122
123
124
125
126
127
128
129
	ir_node         *best_succ    = NULL;
	double          best_execfreq = -1;

 	/*
		More than two successors means we have a jump table.
		we cannot include a jump target into the current extended
		basic block, so create a new one here.
	*/
	if (get_block_n_succs(block) > 2) {
130
131
132
133
134
135
136
137
138
139
140
141
142
143
		const ir_edge_t *edge;

		foreach_block_succ(block, edge) {
			ir_node *succ = get_edge_src_irn(edge);
			create_extblk(succ, env);
		}

		return;
	}

	foreach_block_succ(block, edge) {
		ir_node *succ = get_edge_src_irn(edge);
		double execfreq;

144
145
146
		if(irn_visited(succ))
			continue;

147
148
149
150
151
152
153
		if(get_Block_n_cfgpreds(succ) > 1) {
			create_extblk(succ, env);
			continue;
		}

		execfreq = get_block_execfreq(env->execfreqs, succ);

Christian Würdig's avatar
Christian Würdig committed
154
155
156
157
158
159
		/*
			Remember best successor and make non best successor with only 1
			pred block to new extbb leaders.
		*/
		if (execfreq > best_execfreq) {
			if (best_succ != NULL) {
160
161
162
163
164
				create_extblk(best_succ, env);
			}

			best_execfreq = execfreq;
			best_succ = succ;
Christian Würdig's avatar
Christian Würdig committed
165
166
		}
		else {
167
168
169
170
			create_extblk(succ, env);
		}
	}

Christian Würdig's avatar
Christian Würdig committed
171
	/* add best successor and recursively try to pick more */
172
173
174
175
176
177
178
179
180
181
	if(best_succ != NULL) {
		addto_extblk(extblk, best_succ);
		mark_irn_visited(best_succ);
		pick_successor(best_succ, extblk, env);
	}
}

/*
 * Compute the extended basic blocks for a graph
 */
182
void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs) {
Christian Würdig's avatar
Christian Würdig committed
183
  	env_t     env;
184
	ir_extblk *extbb, *next;
Christian Würdig's avatar
Christian Würdig committed
185
	ir_node   *endblock;
186
187
188

	if (irg->extbb_obst) {
		obstack_free(irg->extbb_obst, NULL);
Christian Würdig's avatar
Christian Würdig committed
189
190
	}
	else {
191
		irg->extbb_obst = XMALLOC(struct obstack);
192
193
194
	}
	obstack_init(irg->extbb_obst);

Christian Würdig's avatar
Christian Würdig committed
195
196
	env.obst      = irg->extbb_obst;
	env.head      = NULL;
197
198
199
200
201
202
203
204
	env.execfreqs = execfreqs;

	assure_irg_outs(irg);

	/* we must mark nodes, so increase the visited flag */
	inc_irg_visited(irg);
	create_extblk(get_irg_start_block(irg), &env);

Christian Würdig's avatar
Christian Würdig committed
205
	/* the end block needs a extbb assigned (even for endless loops) */
206
	endblock = get_irg_end_block(irg);
Christoph Mallon's avatar
Christoph Mallon committed
207
	create_extblk(endblock, &env);
208
209

	/*
Christian Würdig's avatar
Christian Würdig committed
210
211
212
213
214
215
		Ok, we have now the list of all extended blocks starting with env.head
		every extended block "knowns" the number of blocks in visited and
		the blocks are linked in link.
		Now we can create arrays that hold the blocks, some kind of "out" edges
		for the extended block
	*/
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
	for (extbb = env.head; extbb; extbb = next) {
		int i, len = (int)extbb->visited;
		ir_node *block;

		next = (ir_extblk *)extbb->blks;

		extbb->blks = NEW_ARR_D(ir_node *, env.obst, len);

		for (block = extbb->link, i = 0; i < len; ++i) {
			ir_node *nblock = get_irn_link(block);

			/* ensure that the leader is the first one */
			extbb->blks[len - 1 - i] = block;
			set_irn_link(block, NULL);
			block = nblock;
		}

Adam Szalkowski's avatar
Adam Szalkowski committed
233
#if 0
234
235
236
237
238
239
		for(i = 0; i < len; ++i) {
			if(i > 0)
				printf(", ");
			ir_printf("%+F", extbb->blks[i]);
		}
		printf("\n");
Adam Szalkowski's avatar
Adam Szalkowski committed
240
#endif
241
242
243
244
245
246
247

		extbb->link    = NULL;
		extbb->visited = 0;
	}

	irg->extblk_state = extblk_valid;
}