2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Support for ir graph modification.
9 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier
16 #include "irgraph_t.h"
21 #include "iredges_t.h"
25 void turn_into_tuple(ir_node *const node, int const arity, ir_node *const *const in)
27 set_irn_in(node, arity, in);
28 set_irn_op(node, op_Tuple);
31 void exchange(ir_node *old, ir_node *nw)
36 assert(old != nw && "Exchanging node with itself is not allowed");
38 irg = get_irn_irg(old);
39 assert(irg == get_irn_irg(nw) && "New node must be in same irg as old node");
41 hook_replace(old, nw);
44 * If new outs are on, we can skip the id node creation and reroute
45 * the edges from the old node to the new directly.
47 if (edges_activated(irg)) {
48 /* copy all dependencies from old to new */
49 add_irn_deps(nw, old);
51 edges_reroute(old, nw);
52 edges_reroute_kind(old, nw, EDGE_KIND_DEP);
53 edges_node_deleted(old);
54 /* noone is allowed to reference this node anymore */
55 set_irn_op(old, op_Deleted);
57 /* Else, do it the old-fashioned way. */
60 hook_turn_into_id(old);
64 block = is_Block(nw) ? nw : get_nodes_block(nw);
67 panic("cannot find legal block for id");
71 if (get_irn_op(old)->opar == oparity_dynamic) {
72 DEL_ARR_F(get_irn_in(old));
76 old->in = NEW_ARR_D(ir_node*, get_irg_obstack(irg), 2);
81 /* update irg flags */
82 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS
83 | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
87 * Walker: links all Phi nodes to their Blocks lists,
88 * all Proj nodes to there predecessors.
90 static void collect_phiprojs_walker(ir_node *n, void *env)
96 ir_node *block = get_nodes_block(n);
97 add_Block_phi(block, n);
98 } else if (is_Proj(n)) {
101 pred = get_Proj_pred(pred);
102 } while (is_Proj(pred));
104 set_irn_link(n, get_irn_link(pred));
105 set_irn_link(pred, n);
109 void collect_phiprojs(ir_graph *irg)
111 assert((ir_resources_reserved(irg) & (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST)) ==
112 (IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST));
113 irg_walk_graph(irg, firm_clear_node_and_phi_links, collect_phiprojs_walker, NULL);
117 * Moves node and all predecessors of node from from_bl to to_bl.
118 * Does not move predecessors of Phi nodes (or block nodes).
120 static void move(ir_node *node, ir_node *from_bl, ir_node *to_bl)
125 set_nodes_block(node, to_bl);
128 if (get_irn_mode(node) == mode_T) {
129 ir_node *proj = (ir_node*)get_irn_link(node);
131 if (get_nodes_block(proj) == from_bl)
132 set_nodes_block(proj, to_bl);
133 proj = (ir_node*)get_irn_link(proj);
141 arity = get_irn_arity(node);
142 for (i = 0; i < arity; i++) {
143 ir_node *pred = get_irn_n(node, i);
144 if (get_nodes_block(pred) == from_bl)
145 move(pred, from_bl, to_bl);
149 static void move_projs(const ir_node *node, ir_node *to_bl)
151 if (get_irn_mode(node) != mode_T)
154 foreach_out_edge(node, edge) {
155 ir_node *proj = get_edge_src_irn(edge);
158 set_nodes_block(proj, to_bl);
159 move_projs(proj, to_bl);
164 * Moves node and all predecessors of node from from_bl to to_bl.
165 * Does not move predecessors of Phi nodes (or block nodes).
167 static void move_edges(ir_node *node, ir_node *from_bl, ir_node *to_bl)
172 set_nodes_block(node, to_bl);
175 move_projs(node, to_bl);
177 /* We must not move predecessors of Phi nodes, even if they are in
178 * from_bl. (because these are values from an earlier loop iteration
179 * which are not predecessors of node here)
185 arity = get_irn_arity(node);
186 for (i = 0; i < arity; i++) {
187 ir_node *pred = get_irn_n(node, i);
188 if (get_nodes_block(pred) == from_bl)
189 move_edges(pred, from_bl, to_bl);
193 void part_block(ir_node *node)
195 ir_graph *irg = get_irn_irg(node);
196 ir_node *new_block, *old_block;
199 /* Turn off optimizations so that blocks are not merged again. */
200 int rem_opt = get_opt_optimize();
203 /* Transform the control flow */
204 old_block = get_nodes_block(node);
205 new_block = new_r_Block(irg, get_Block_n_cfgpreds(old_block),
206 get_Block_cfgpred_arr(old_block));
208 /* create a jump from new_block to old_block, which is now the lower one */
209 jmp = new_r_Jmp(new_block);
210 set_irn_in(old_block, 1, &jmp);
212 /* move node and its predecessors to new_block */
213 move(node, old_block, new_block);
215 /* move Phi nodes to new_block */
216 phi = get_Block_phis(old_block);
217 set_Block_phis(new_block, phi);
218 set_Block_phis(old_block, NULL);
220 set_nodes_block(phi, new_block);
221 phi = get_Phi_next(phi);
224 set_optimize(rem_opt);
227 ir_node *part_block_edges(ir_node *node)
229 ir_graph *irg = get_irn_irg(node);
230 ir_node *old_block = get_nodes_block(node);
231 ir_node *new_block = new_r_Block(irg, get_Block_n_cfgpreds(old_block), get_Block_cfgpred_arr(old_block));
233 /* old_block has no predecessors anymore for now */
234 set_irn_in(old_block, 0, NULL);
236 /* move node and its predecessors to new_block */
237 move_edges(node, old_block, new_block);
239 /* move Phi nodes to new_block */
240 foreach_out_edge_safe(old_block, edge) {
241 ir_node *phi = get_edge_src_irn(edge);
244 set_nodes_block(phi, new_block);
250 void kill_node(ir_node *node)
252 ir_graph *irg = get_irn_irg(node);
254 if (edges_activated(irg)) {
255 edges_node_deleted(node);
257 /* noone is allowed to reference this node anymore */
258 set_irn_op(node, op_Deleted);