27 #include "iredges_t.h"
32 #include "besched_t.h"
39 #define DBG_MODULE "firm.be.irgmod"
40 #define DBG_LEVEL SET_LEVEL_0
44 | _ \ ___ _ __ ___ (_)_ __ __ _ _ __ ___ ___
45 | | | |/ _ \| '_ ` _ \| | '_ \ / _` | '_ \ / __/ _ \
46 | |_| | (_) | | | | | | | | | | (_| | | | | (_| __/
47 |____/ \___/|_| |_| |_|_|_| |_|\__,_|_| |_|\___\___|
48 | ___| __ ___ _ __ | |_(_) ___ _ __ ___
49 | |_ | '__/ _ \| '_ \| __| |/ _ \ '__/ __|
50 | _|| | | (_) | | | | |_| | __/ | \__ \
51 |_| |_| \___/|_| |_|\__|_|\___|_| |___/
56 struct _dom_front_info_t {
61 * A wrapper for get_Block_idom.
62 * This function returns the block itself, if the block is the start
63 * block. Returning NULL would make any != comparison true which
64 * suggests, that the start block is dominated by some other node.
65 * @param bl The block.
66 * @return The immediate dominator of the block.
68 static INLINE ir_node *get_idom(ir_node *bl)
70 ir_node *idom = get_Block_idom(bl);
71 return idom == NULL ? bl : idom;
74 static void compute_df(ir_node *n, pmap *df_map)
77 const ir_edge_t *edge;
78 pset *df = pset_new_ptr_default();
80 /* Add local dominance frontiers */
81 foreach_block_succ(n, edge) {
82 ir_node *y = edge->src;
85 pset_insert_ptr(df, y);
89 * Go recursively down the dominance tree and add all blocks
90 * int the dominance frontiers of the children, which are not
91 * dominated by the given block.
93 for(c = get_Block_dominated_first(n); c; c = get_Block_dominated_next(c)) {
97 compute_df(c, df_map);
98 df_c = pmap_get(df_map, c);
100 for(w = pset_first(df_c); w; w = pset_next(df_c)) {
102 pset_insert_ptr(df, w);
106 pmap_insert(df_map, n, df);
110 dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg)
112 dom_front_info_t *info = xmalloc(sizeof(*info));
115 info->df_map = pmap_create();
117 compute_df(get_irg_start_block(irg), info->df_map);
122 void be_free_dominance_frontiers(dom_front_info_t *info)
126 for(ent = pmap_first(info->df_map); ent; ent = pmap_next(info->df_map))
127 del_pset(ent->value);
129 pmap_destroy(info->df_map);
133 pset *be_get_dominance_frontier(dom_front_info_t *info, ir_node *block)
135 return pmap_get(info->df_map, block);
138 static void determine_phi_blocks(pset *copies, pset *copy_blocks, pset *phi_blocks, dom_front_info_t *df_info)
141 pdeq *worklist = new_pdeq();
142 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
145 * Fill the worklist queue and the rest of the orig blocks array.
147 for(bl = pset_first(copy_blocks); bl; bl = pset_next(copy_blocks)) {
148 pdeq_putr(worklist, bl);
151 while (!pdeq_empty(worklist)) {
152 ir_node *bl = pdeq_getl(worklist);
153 pset *df = be_get_dominance_frontier(df_info, bl);
157 DBG((dbg, LEVEL_3, "dom front of %+F\n", bl));
159 for (y = pset_first(df); y; y = pset_next(df))
160 DBG((dbg, LEVEL_3, "\t%+F\n", y))
163 for(y = pset_first(df); y; y = pset_next(df)) {
164 if(!pset_find_ptr(phi_blocks, y)) {
165 pset_insert_ptr(phi_blocks, y);
168 * Clear the link field of a possible phi block, since
169 * the possibly created phi will be stored there. See,
172 set_irn_link(y, NULL);
174 if(!pset_find_ptr(copy_blocks, y))
175 pdeq_putr(worklist, y);
191 / ___|___ _ __ ___| |_ _ __ _ _ ___| |_(_) ___ _ __
192 | | / _ \| '_ \/ __| __| '__| | | |/ __| __| |/ _ \| '_ \
193 | |__| (_) | | | \__ \ |_| | | |_| | (__| |_| | (_) | | | |
194 \____\___/|_| |_|___/\__|_| \__,_|\___|\__|_|\___/|_| |_|
199 * Find the copy of the given original node whose value is 'active'
202 * The usage is given as a node and a position. Initially, the given operand
203 * points to a node for which copies were introduced. We have to find
204 * the valid copy for this usage. This is done by traversing the
205 * dominance tree upwards. If the usage is a phi function, we start
206 * traversing from the predecessor block which corresponds to the phi
209 * @param usage The node which uses the original node.
210 * @param pos The position of the argument which corresponds to the original node.
211 * @param copies A set containing all node which are copies from the original node.
212 * @param copy_blocks A set containing all basic block in which copies of the original node are located.
213 * @param phis A set where all created phis are recorded.
214 * @param phi_blocks A set of all blocks where Phis shall be inserted (iterated dominance frontier).
215 * @param mode The mode for the Phi if one has to be created.
216 * @return The valid copy for usage.
218 static ir_node *search_def(ir_node *usage, int pos, pset *copies, pset *copy_blocks, pset *phis, pset *phi_blocks, ir_mode *mode)
222 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
224 curr_bl = get_nodes_block(usage);
226 DBG((dbg, LEVEL_1, "Searching valid def for use %+F at pos %d\n", usage, pos));
228 * If the usage is in a phi node, search the copy in the
229 * predecessor denoted by pos.
232 curr_bl = get_Block_cfgpred_block(curr_bl, pos);
233 start_irn = sched_last(curr_bl);
235 start_irn = sched_prev(usage);
239 * Traverse the dominance tree upwards from the
240 * predecessor block of the usage.
242 while(curr_bl != NULL) {
245 * If this block contains a copy, search the block
246 * instruction by instruction.
248 if(pset_find_ptr(copy_blocks, curr_bl)) {
251 /* Look at each instruction from last to first. */
252 sched_foreach_reverse_from(start_irn, irn) {
254 /* Take the first copy we find. */
255 if(pset_find_ptr(copies, irn))
260 if(pset_find_ptr(phi_blocks, curr_bl)) {
261 ir_node *phi = get_irn_link(curr_bl);
264 int i, n_preds = get_irn_arity(curr_bl);
265 ir_graph *irg = get_irn_irg(curr_bl);
266 ir_node **ins = xmalloc(n_preds * sizeof(ins[0]));
268 for(i = 0; i < n_preds; ++i)
269 ins[i] = new_r_Bad(irg);
271 phi = new_r_Phi(irg, curr_bl, n_preds, ins, mode);
272 DBG((dbg, LEVEL_2, "\tcreating phi %+F in %+F\n", phi, curr_bl));
274 set_irn_link(curr_bl, phi);
275 sched_add_after(curr_bl, phi);
278 for(i = 0; i < n_preds; ++i) {
279 ir_node *arg = search_def(phi, i, copies, copy_blocks, phis, phi_blocks, mode);
280 DBG((dbg, LEVEL_2, "\t\t%+F(%d) -> %+F\n", phi, i, arg));
281 set_irn_n(phi, i, arg);
285 pset_insert_ptr(phis, phi);
291 /* If were not done yet, look in the immediate dominator */
292 curr_bl = get_Block_idom(curr_bl);
294 start_irn = sched_last(curr_bl);
300 static void fix_usages(pset *copies, pset *copy_blocks, pset *phi_blocks, pset *phis, pset *ignore_uses)
311 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
316 * Put all outs into an array.
317 * This is necessary, since the outs would be modified while
318 * iterating on them what could bring the outs module in trouble.
320 for (irn = pset_first(copies); irn; irn = pset_next(copies)) {
321 const ir_edge_t *edge;
322 foreach_out_edge(irn, edge) {
323 if (!pset_find_ptr(ignore_uses, get_edge_src_irn(edge))) {
325 tmp.irn = get_edge_src_irn(edge);
326 tmp.pos = get_edge_src_pos(edge);
327 obstack_grow(&obst, &tmp, sizeof(tmp));
332 outs = obstack_finish(&obst);
335 * Search the valid def for each out and set it.
337 for(i = 0; i < n_outs; ++i) {
338 ir_node *irn = outs[i].irn;
339 int pos = outs[i].pos;
340 ir_mode *mode = get_irn_mode(get_irn_n(irn, pos));
344 def = search_def(irn, pos, copies, copy_blocks, phis, phi_blocks, mode);
345 DBG((dbg, LEVEL_2, "\t%+F(%d) -> %+F\n", irn, pos, def));
348 set_irn_n(irn, pos, def);
351 obstack_free(&obst, NULL);
355 * Remove phis which are not necessary.
356 * During place_phi_functions() phi functions are put on the dominance
357 * frontiers blindly. However some of them will never be used (these
358 * have at least one predecessor which is NULL, see search_def() for
359 * this case). Since place_phi_functions() enters them into the
360 * schedule, we have to remove them from there.
362 * @param copies The set of all copies made (including the phi functions).
364 static void remove_odd_phis(pset *copies, pset *unused_copies)
368 for(irn = pset_first(copies); irn; irn = pset_next(copies)) {
373 assert(sched_is_scheduled(irn) && "phi must be scheduled");
374 for(i = 0, n = get_irn_arity(irn); i < n && !illegal; ++i)
375 illegal = get_irn_n(irn, i) == NULL;
382 for(irn = pset_first(unused_copies); irn; irn = pset_next(unused_copies)) {
387 void be_ssa_constr_phis_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *phis, pset *ignore_uses)
389 pset *irns = pset_new_ptr(n);
392 for(i = 0; i < n; ++i)
393 pset_insert_ptr(irns, nodes[i]);
394 be_ssa_constr_set_phis_ignore(info, irns, phis, ignore_uses);
398 void be_ssa_constr_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *ignore_uses)
400 be_ssa_constr_phis_ignore(info, n, nodes, NULL, ignore_uses);
403 void be_ssa_constr(dom_front_info_t *info, int n, ir_node *nodes[])
405 pset *empty_set = be_empty_set();
406 be_ssa_constr_ignore(info, n, nodes, empty_set);
409 void be_ssa_constr_set_phis_ignore(dom_front_info_t *df, pset *nodes, pset *phis, pset *ignore_uses)
411 int n = pset_count(nodes);
412 pset *blocks = pset_new_ptr(n);
413 pset *phi_blocks = pset_new_ptr(n);
414 int save_optimize = get_optimize();
415 int save_normalize = get_opt_normalize();
416 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, DBG_MODULE);
420 DBG((dbg, LEVEL_1, "Introducing following copies for:\n"));
423 for(irn = pset_first(nodes); irn; irn = pset_next(nodes)) {
424 ir_node *bl = get_nodes_block(irn);
425 pset_insert_ptr(blocks, bl);
426 DBG((dbg, LEVEL_1, "\t%+F in %+F\n", irn, bl));
430 * Disable optimization so that the phi functions do not
434 set_opt_normalize(0);
437 * Place the phi functions and reroute the usages.
439 determine_phi_blocks(nodes, blocks, phi_blocks, df);
440 fix_usages(nodes, blocks, phi_blocks, phis, ignore_uses);
442 /* reset the optimizations */
443 set_optimize(save_optimize);
444 set_opt_normalize(save_normalize);
446 del_pset(phi_blocks);
451 void be_ssa_constr_set_phis(dom_front_info_t *df, pset *nodes, pset *phis)
453 pset *empty_set = be_empty_set();
454 be_ssa_constr_set_phis_ignore(df, nodes, phis, empty_set);
457 void be_ssa_constr_set_ignore(dom_front_info_t *df, pset *nodes, pset *ignore_uses)
459 be_ssa_constr_set_phis_ignore(df, nodes, NULL, ignore_uses);
462 void be_ssa_constr_set(dom_front_info_t *info, pset *nodes)
464 pset *empty_set = be_empty_set();
465 be_ssa_constr_set_ignore(info, nodes, empty_set);
470 |_ _|_ __ ___ ___ _ __| |_ | _ \ ___ _ __ _ __ ___
471 | || '_ \/ __|/ _ \ '__| __| | |_) / _ \ '__| '_ ` _ \
472 | || | | \__ \ __/ | | |_ | __/ __/ | | | | | | |
473 |___|_| |_|___/\___|_| \__| |_| \___|_| |_| |_| |_|
477 ir_node *insert_Perm_after(const arch_env_t *arch_env,
478 const arch_register_class_t *cls,
479 dom_front_info_t *dom_front,
482 ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
483 ir_graph *irg = get_irn_irg(bl);
484 pset *live = pset_new_ptr_default();
485 FIRM_DBG_REGISTER(firm_dbg_module_t *dbg, "be.node");
487 ir_node *curr, *irn, *perm, **nodes;
490 DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
492 if(!be_liveness_nodes_live_at(arch_env, cls, pos, live));
494 n = pset_count(live);
501 nodes = xmalloc(n * sizeof(nodes[0]));
503 DBG((dbg, LEVEL_1, "live:\n"));
504 for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) {
505 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
510 perm = be_new_Perm(cls, irg, bl, n, nodes);
511 sched_add_after(pos, perm);
515 for(i = 0; i < n; ++i) {
517 ir_node *perm_op = get_irn_n(perm, i);
518 const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op);
520 ir_mode *mode = get_irn_mode(perm_op);
521 ir_node *proj = new_r_Proj(irg, bl, perm, mode, i);
522 arch_set_irn_register(arch_env, proj, reg);
524 sched_add_after(curr, proj);
529 be_ssa_constr(dom_front, 2, copies);