2 * Copyright (C) 1995-2007 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 SSA construction for a set of nodes
23 * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
27 * The problem: Given a value and a set of "copies" that are known to
28 * represent the same abstract value, rewire all usages of the original value
29 * to their closest copy while introducing phis as necessary.
31 * Algorithm: Mark all blocks in the iterated dominance frontiers of the value
32 * and it's copies. Link the copies ordered by dominance to the blocks. The
33 * we search for each use all all definitions in the current block, if none is
34 * found, then we search one in the immediate dominator. If we are in a block
35 * of the dominance frontier, create a phi and search do the same search for
38 * A copy in this context means, that you want to introduce several new
39 * abstract values (in Firm: nodes) for which you know, that they
40 * represent the same concrete value. This is the case if you
46 * This function reroutes all uses of the original value to the copies in the
47 * corresponding dominance subtrees and creates Phi functions where necessary.
53 #include "bessaconstr.h"
55 #include "besched_t.h"
56 #include "beintlive_t.h"
66 #include "iredges_t.h"
68 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
71 * Calculates the iterated dominance frontier of a set of blocks. Marks the
72 * blocks as visited. Sets the link fields of the blocks in the dominance
73 * frontier to the block itself.
76 void mark_iterated_dominance_frontiers(const be_dom_front_info_t *domfronts,
79 DBG((dbg, LEVEL_3, "Dominance Frontier:"));
80 while(!pdeq_empty(worklist)) {
82 ir_node *block = waitq_get(worklist);
83 ir_node **domfront = be_get_dominance_frontier(domfronts, block);
84 int domfront_len = ARR_LEN(domfront);
86 for (i = 0; i < domfront_len; ++i) {
87 ir_node *y = domfront[i];
88 if(Block_block_visited(y))
92 set_irn_link(y, NULL);
93 waitq_put(worklist, y);
95 DBG((dbg, LEVEL_3, " %+F", y));
96 mark_Block_block_visited(y);
99 DBG((dbg, LEVEL_3, "\n"));
103 ir_node *search_def_end_of_block(be_ssa_construction_env_t *env,
107 ir_node *create_phi(be_ssa_construction_env_t *env, ir_node *block,
110 int i, n_preds = get_Block_n_cfgpreds(block);
111 ir_graph *irg = get_irn_irg(block);
113 ir_node **ins = alloca(n_preds * sizeof(ins[0]));
117 for(i = 0; i < n_preds; ++i) {
118 ins[i] = new_r_Unknown(irg, env->mode);
120 phi = new_r_Phi(irg, block, n_preds, ins, env->mode);
121 if(env->new_phis != NULL) {
122 ARR_APP1(ir_node*, env->new_phis, phi);
125 if(env->mode != mode_M) {
126 sched_add_after(block, phi);
129 DBG((dbg, LEVEL_2, "\tcreating phi %+F in %+F\n", phi, block));
130 set_irn_link(link_with, phi);
131 mark_irn_visited(block);
133 for(i = 0; i < n_preds; ++i) {
134 ir_node *pred_block = get_Block_cfgpred_block(block, i);
135 ir_node *pred_def = search_def_end_of_block(env, pred_block);
137 set_irn_n(phi, i, pred_def);
144 ir_node *get_def_at_idom(be_ssa_construction_env_t *env, ir_node *block)
146 ir_node *dom = get_Block_idom(block);
148 return search_def_end_of_block(env, dom);
152 ir_node *search_def_end_of_block(be_ssa_construction_env_t *env, ir_node *block)
154 if(irn_visited(block)) {
155 assert(get_irn_link(block) != NULL);
156 return get_irn_link(block);
157 } else if(Block_block_visited(block)) {
158 return create_phi(env, block, block);
160 ir_node *def = get_def_at_idom(env, block);
161 mark_irn_visited(block);
162 set_irn_link(block, def);
169 ir_node *search_def(be_ssa_construction_env_t *env, ir_node *at)
171 ir_node *block = get_nodes_block(at);
175 DBG((dbg, LEVEL_3, "\t...searching def at %+F\n", at));
177 /* no defs in the current block we can do the normal searching */
178 if(!irn_visited(block) && !Block_block_visited(block)) {
179 DBG((dbg, LEVEL_3, "\t...continue at idom\n"));
180 return get_def_at_idom(env, block);
183 /* there are defs in the current block, walk the linked list to find
184 the one immediately dominating us
187 def = get_irn_link(node);
189 if(!value_dominates(at, def)) {
190 DBG((dbg, LEVEL_3, "\t...found dominating def %+F\n", def));
195 def = get_irn_link(node);
198 /* block in dominance frontier? create a phi then */
199 if(Block_block_visited(block)) {
200 DBG((dbg, LEVEL_3, "\t...create phi at block %+F\n", block));
201 assert(!is_Phi(node));
202 return create_phi(env, block, node);
206 DBG((dbg, LEVEL_3, "\t...continue at idom (after checking block)\n"));
207 return get_def_at_idom(env, block);
211 * Adds a definition into the link field of the block. The definitions are
212 * sorted by dominance. A non-visited block means no definition has been
216 void introduce_def_at_block(ir_node *block, ir_node *def)
218 if(irn_visited(block)) {
219 ir_node *node = block;
220 ir_node *current_def;
223 current_def = get_irn_link(node);
224 if(current_def == def) {
225 /* already in block */
228 if(current_def == NULL)
230 if(value_dominates(current_def, def))
235 set_irn_link(node, def);
236 set_irn_link(def, current_def);
238 set_irn_link(block, def);
239 set_irn_link(def, NULL);
240 mark_irn_visited(block);
244 void be_ssa_construction_init(be_ssa_construction_env_t *env, be_irg_t *birg)
246 ir_graph *irg = be_get_birg_irg(birg);
247 memset(env, 0, sizeof(env[0]));
249 be_assure_dom_front(birg);
252 env->domfronts = be_get_birg_dom_front(birg);
253 env->new_phis = NEW_ARR_F(ir_node*, 0);
254 env->worklist = new_waitq();
256 set_using_visited(irg);
257 set_using_block_visited(irg);
258 set_using_irn_link(irg);
260 /* we use the visited flag to indicate blocks in the dominance frontier
261 * and blocks that already have the relevant value at the end calculated */
262 inc_irg_visited(irg);
263 /* We use the block visited flag to indicate blocks in the dominance
264 * froniter of some values (and this potentially needing phis) */
265 inc_irg_block_visited(irg);
268 void be_ssa_construction_destroy(be_ssa_construction_env_t *env)
270 del_waitq(env->worklist);
271 DEL_ARR_F(env->new_phis);
273 clear_using_visited(env->irg);
274 clear_using_block_visited(env->irg);
275 clear_using_irn_link(env->irg);
278 void be_ssa_construction_add_copy(be_ssa_construction_env_t *env,
283 assert(env->iterated_domfront_calculated == 0);
285 if(env->mode == NULL) {
286 env->mode = get_irn_mode(copy);
288 assert(env->mode == get_irn_mode(copy));
291 block = get_nodes_block(copy);
293 if(!irn_visited(block)) {
294 waitq_put(env->worklist, block);
296 introduce_def_at_block(block, copy);
299 void be_ssa_construction_add_copies(be_ssa_construction_env_t *env,
300 ir_node **copies, size_t copies_len)
304 assert(env->iterated_domfront_calculated == 0);
306 if(env->mode == NULL) {
307 env->mode = get_irn_mode(copies[0]);
310 for(i = 0; i < copies_len; ++i) {
311 ir_node *copy = copies[i];
312 ir_node *block = get_nodes_block(copy);
314 assert(env->mode == get_irn_mode(copy));
315 if(!irn_visited(block)) {
316 waitq_put(env->worklist, block);
318 introduce_def_at_block(block, copy);
322 void be_ssa_construction_set_ignore_uses(be_ssa_construction_env_t *env,
323 const ir_nodeset_t *ignore_uses)
325 env->ignore_uses = ignore_uses;
328 ir_node **be_ssa_construction_get_new_phis(be_ssa_construction_env_t *env)
330 return env->new_phis;
333 void be_ssa_construction_fix_users(be_ssa_construction_env_t *env,
336 const ir_edge_t *edge, *next;
338 if(!env->iterated_domfront_calculated) {
339 mark_iterated_dominance_frontiers(env->domfronts, env->worklist);
340 env->iterated_domfront_calculated = 1;
344 * Search the valid def for each use and set it.
346 foreach_out_edge_safe(value, edge, next) {
347 ir_node *use = get_edge_src_irn(edge);
349 int pos = get_edge_src_pos(edge);
352 if(env->ignore_uses != NULL &&
353 ir_nodeset_contains(env->ignore_uses, use))
359 ir_node *block = get_nodes_block(use);
360 ir_node *predblock = get_Block_cfgpred_block(block, pos);
361 at = sched_last(predblock);
364 def = search_def(env, at);
367 panic("no definition found for %+F at position %d\n", use, pos);
370 DBG((dbg, LEVEL_2, "\t%+F(%d) -> %+F\n", use, pos, def));
371 set_irn_n(use, pos, def);
375 void be_ssa_construction_fix_users_array(be_ssa_construction_env_t *env,
376 ir_node **nodes, size_t nodes_len)
380 for(i = 0; i < nodes_len; ++i) {
381 ir_node *node = nodes[i];
382 be_ssa_construction_fix_users(env, node);
386 void be_ssa_construction_update_liveness_phis(be_ssa_construction_env_t *env,
391 n = ARR_LEN(env->new_phis);
392 for(i = 0; i < n; ++i) {
393 ir_node *phi = env->new_phis[i];
394 be_liveness_introduce(lv, phi);
398 void be_init_ssaconstr(void)
400 FIRM_DBG_REGISTER(dbg, "firm.be.ssaconstr");
403 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ssaconstr);