2 * Copyright (C) 1995-2010 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 be transform helper extracted from the ia32 backend.
23 * @author Matthias Braun, Michael Beck
33 #include "irgraph_t.h"
43 #include "betranshlp.h"
47 typedef struct be_transform_env_t {
48 ir_graph *irg; /**< The irg, the node should be created in */
49 waitq *worklist; /**< worklist of nodes that still need to be
51 ir_node *old_anchor; /**< the old anchor node in the old irg */
55 static be_transform_env_t env;
57 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
59 set_irn_link(old_node, new_node);
60 mark_irn_visited(old_node);
63 int be_is_transformed(const ir_node *node)
65 return irn_visited(node);
68 static inline ir_node *be_get_transformed_node(ir_node *old_node)
70 if (irn_visited(old_node)) {
71 ir_node *new_node = get_irn_link(old_node);
72 assert(new_node != NULL);
78 void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
81 int deps = get_irn_deps(old_node);
83 for (i = 0; i < deps; ++i) {
84 ir_node *dep = get_irn_dep(old_node, i);
85 ir_node *new_dep = be_transform_node(dep);
87 add_irn_dep(new_node, new_dep);
91 void be_dep_on_frame(ir_node* node)
93 ir_graph *const irg = current_ir_graph;
95 if (get_irg_start_block(irg) == get_nodes_block(node))
96 add_irn_dep(node, get_irg_frame(irg));
99 void be_set_transform_function(ir_op *op, be_transform_func func)
101 /* shouldn't be assigned twice (except for exchanging the default
102 * be_duplicate_node entries) */
103 assert(op->ops.generic == NULL
104 || op->ops.generic == (op_func) be_duplicate_node);
105 op->ops.generic = (op_func) func;
108 void be_start_transform_setup(void)
110 clear_irp_opcodes_generic_func();
112 be_set_transform_function(op_Bad, be_duplicate_node);
113 be_set_transform_function(op_be_Barrier, be_duplicate_node);
114 be_set_transform_function(op_be_Copy, be_duplicate_node);
115 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
116 be_set_transform_function(op_be_IncSP, be_duplicate_node);
117 be_set_transform_function(op_be_Keep, be_duplicate_node);
118 be_set_transform_function(op_be_Return, be_duplicate_node);
119 be_set_transform_function(op_be_Start, be_duplicate_node);
120 be_set_transform_function(op_NoMem, be_duplicate_node);
121 be_set_transform_function(op_Pin, be_duplicate_node);
122 be_set_transform_function(op_Start, be_duplicate_node);
123 be_set_transform_function(op_Sync, be_duplicate_node);
126 ir_node *be_duplicate_node(ir_node *node)
128 ir_node *block = be_transform_node(get_nodes_block(node));
129 ir_graph *irg = env.irg;
130 dbg_info *dbgi = get_irn_dbg_info(node);
131 ir_mode *mode = get_irn_mode(node);
132 ir_op *op = get_irn_op(node);
136 arity = get_irn_arity(node);
137 if (op->opar == oparity_dynamic) {
138 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
139 for (i = 0; i < arity; ++i) {
140 ir_node *in = get_irn_n(node, i);
141 in = be_transform_node(in);
142 add_irn_n(new_node, in);
145 ir_node **ins = ALLOCAN(ir_node*, arity);
146 for (i = 0; i < arity; ++i) {
147 ir_node *in = get_irn_n(node, i);
148 ins[i] = be_transform_node(in);
151 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
154 copy_node_attr(irg, node, new_node);
155 be_duplicate_deps(node, new_node);
157 new_node->node_nr = node->node_nr;
161 ir_node *be_transform_node(ir_node *node)
164 ir_node *new_node = be_get_transformed_node(node);
165 be_transform_func *transform;
167 if (new_node != NULL)
170 DEBUG_ONLY(be_set_transformed_node(node, NULL));
172 op = get_irn_op(node);
173 if (op->ops.generic == NULL) {
174 panic("No transform function registered for node %+F.", node);
176 transform = (be_transform_func *)op->ops.generic;
178 new_node = transform(node);
179 assert(new_node != NULL);
181 be_set_transformed_node(node, new_node);
182 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
186 void be_enqueue_preds(ir_node *node)
190 /* put the preds in the worklist */
191 arity = get_irn_arity(node);
192 for (i = 0; i < arity; ++i) {
193 ir_node *pred = get_irn_n(node, i);
194 pdeq_putr(env.worklist, pred);
199 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
201 static void fix_loops(ir_node *node)
206 assert(node_is_in_irgs_storage(env.irg, node));
208 if (irn_visited_else_mark(node))
212 if (! is_Block(node)) {
213 ir_node *block = get_nodes_block(node);
214 ir_node *new_block = get_irn_link(block);
216 if (new_block != NULL) {
217 set_nodes_block(node, new_block);
225 arity = get_irn_arity(node);
226 for (i = 0; i < arity; ++i) {
227 ir_node *in = get_irn_n(node, i);
228 ir_node *nw = get_irn_link(in);
230 if (nw != NULL && nw != in) {
231 set_irn_n(node, i, nw);
240 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
244 arity = get_irn_deps(node);
245 for (i = 0; i < arity; ++i) {
246 ir_node *in = get_irn_dep(node, i);
247 ir_node *nw = get_irn_link(in);
249 if (nw != NULL && nw != in) {
250 set_irn_dep(node, i, nw);
259 identify_remember(node);
263 ir_node *be_pre_transform_node(ir_node *place)
268 return be_transform_node(place);
271 static void pre_transform_anchor(int anchor)
273 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
274 ir_node *transformed = be_transform_node(old_anchor_node);
275 set_irg_anchor(current_ir_graph, anchor, transformed);
278 static void kill_unused_anchor(int anchor)
280 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
281 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
282 if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
283 set_irn_n(env.old_anchor, anchor, old_bad);
287 static ir_node *new_be_Anchor(ir_graph *irg)
289 struct obstack *obst = be_get_be_obst(irg);
290 backend_info_t *info;
293 /* Hack: some places in the code ask the Anchor for its register
295 new_anchor = new_Anchor(irg);
296 info = be_get_info(new_anchor);
297 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
298 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
299 info->out_infos[0].req = arch_no_register_req;
305 * Transforms all nodes. Deletes the old obstack and creates a new one.
307 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
310 ir_node *old_end, *new_anchor;
312 hook_dead_node_elim(irg, 1);
314 inc_irg_visited(irg);
317 env.worklist = new_waitq();
318 env.old_anchor = irg->anchor;
320 old_end = get_irg_end(irg);
322 /* put all anchor nodes in the worklist */
323 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
324 ir_node *anchor = get_irg_anchor(irg, i);
328 waitq_put(env.worklist, anchor);
331 new_anchor = new_be_Anchor(irg);
332 irg->anchor = new_anchor;
334 /* pre transform some anchors (so they are available in the other transform
336 pre_transform_anchor(anchor_bad);
337 pre_transform_anchor(anchor_no_mem);
338 pre_transform_anchor(anchor_start_block);
339 pre_transform_anchor(anchor_start);
340 pre_transform_anchor(anchor_frame);
341 kill_unused_anchor(anchor_tls);
346 /* process worklist (this should transform all nodes in the graph) */
347 while (! waitq_empty(env.worklist)) {
348 ir_node *node = waitq_get(env.worklist);
349 be_transform_node(node);
352 /* fix loops and set new anchors*/
353 inc_irg_visited(irg);
354 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
355 ir_node *anchor = get_irn_n(env.old_anchor, i);
360 anchor = get_irn_link(anchor);
362 set_irn_n(new_anchor, i, anchor);
365 del_waitq(env.worklist);
367 hook_dead_node_elim(irg, 0);
371 * Transform helper for blocks.
373 static ir_node *gen_Block(ir_node *node)
375 ir_graph *irg = current_ir_graph;
376 dbg_info *dbgi = get_irn_dbg_info(node);
379 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
380 get_irn_arity(node), get_irn_in(node) + 1);
381 copy_node_attr(irg, node, block);
382 block->node_nr = node->node_nr;
384 /* put the preds in the worklist */
385 be_enqueue_preds(node);
390 static ir_node *gen_End(ir_node *node)
392 /* end has to be duplicated manually because we need a dynamic in array */
393 ir_graph *irg = current_ir_graph;
394 dbg_info *dbgi = get_irn_dbg_info(node);
395 ir_node *block = be_transform_node(get_nodes_block(node));
399 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
400 copy_node_attr(irg, node, new_end);
401 be_duplicate_deps(node, new_end);
403 set_irg_end(irg, new_end);
405 /* transform preds */
406 arity = get_irn_arity(node);
407 for (i = 0; i < arity; ++i) {
408 ir_node *in = get_irn_n(node, i);
409 ir_node *new_in = be_transform_node(in);
411 add_End_keepalive(new_end, new_in);
417 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
419 ir_graph *old_current_ir_graph = current_ir_graph;
420 struct obstack *old_obst = NULL;
421 struct obstack *new_obst = NULL;
423 current_ir_graph = irg;
425 /* create a new obstack */
426 old_obst = irg->obst;
427 new_obst = XMALLOC(struct obstack);
428 obstack_init(new_obst);
429 irg->obst = new_obst;
430 irg->last_node_idx = 0;
432 /* invalidate phase info as (at least vrp info) is used inside the
433 * equivalent/compute_value functions and might replace our newly
434 * created nodes with middleend nodes */
435 irg_invalidate_phases(irg);
437 /* create new value table for CSE */
440 /* enter special helper */
441 op_Block->ops.generic = (op_func)gen_Block;
442 op_End->ops.generic = (op_func)gen_End;
444 /* do the main transformation */
445 transform_nodes(irg, func);
447 /* free the old obstack */
448 obstack_free(old_obst, 0);
452 current_ir_graph = old_current_ir_graph;
454 /* most analysis info is wrong after transformation */
455 free_callee_info(irg);
458 free_loop_information(irg);
459 set_irg_doms_inconsistent(irg);
461 be_liveness_invalidate(be_get_irg_liveness(irg));
462 /* Hack for now, something is buggy with invalidate liveness... */
463 be_birg_from_irg(irg)->lv = NULL;
464 be_invalidate_dom_front(irg);
466 /* recalculate edges */
467 edges_deactivate(irg);
471 int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
481 cmp = get_Proj_pred(sel);
486 * Note further that these optimization work even for floating point
487 * with NaN's because -NaN == NaN.
488 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
491 mode = get_irn_mode(mux_true);
492 if (mode_honor_signed_zeros(mode))
495 /* must be <, <=, >=, > */
496 pnc = get_Proj_proj(sel);
511 if (!is_negated_value(mux_true, mux_false))
514 /* must be x cmp 0 */
515 cmp_right = get_Cmp_right(cmp);
516 if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
519 cmp_left = get_Cmp_left(cmp);
520 if (cmp_left == mux_false) {
521 if (pnc & pn_Cmp_Lt) {
524 assert(pnc & pn_Cmp_Gt);
527 } else if (cmp_left == mux_true) {
528 if (pnc & pn_Cmp_Lt) {
531 assert(pnc & pn_Cmp_Gt);
539 ir_node *be_get_abs_op(ir_node *sel)
541 ir_node *cmp = get_Proj_pred(sel);
542 ir_node *cmp_left = get_Cmp_left(cmp);