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"
44 #include "betranshlp.h"
48 typedef struct be_transform_env_t {
49 ir_graph *irg; /**< The irg, the node should be created in */
50 waitq *worklist; /**< worklist of nodes that still need to be
52 ir_node *old_anchor; /**< the old anchor node in the old irg */
56 static be_transform_env_t env;
58 void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
60 set_irn_link(old_node, new_node);
61 mark_irn_visited(old_node);
64 int be_is_transformed(const ir_node *node)
66 return irn_visited(node);
69 static inline ir_node *be_get_transformed_node(ir_node *old_node)
71 if (irn_visited(old_node)) {
72 ir_node *new_node = (ir_node*)get_irn_link(old_node);
73 assert(new_node != NULL);
79 void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
82 int deps = get_irn_deps(old_node);
84 for (i = 0; i < deps; ++i) {
85 ir_node *dep = get_irn_dep(old_node, i);
86 ir_node *new_dep = be_transform_node(dep);
88 add_irn_dep(new_node, new_dep);
92 void be_set_transform_function(ir_op *op, be_transform_func func)
94 /* shouldn't be assigned twice (except for exchanging the default
95 * be_duplicate_node entries) */
96 assert(op->ops.generic == NULL
97 || op->ops.generic == (op_func) be_duplicate_node);
98 op->ops.generic = (op_func) func;
101 void be_start_transform_setup(void)
103 clear_irp_opcodes_generic_func();
105 be_set_transform_function(op_Bad, be_duplicate_node);
106 be_set_transform_function(op_be_Copy, be_duplicate_node);
107 be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
108 be_set_transform_function(op_be_IncSP, be_duplicate_node);
109 be_set_transform_function(op_be_Keep, be_duplicate_node);
110 be_set_transform_function(op_be_Return, be_duplicate_node);
111 be_set_transform_function(op_be_Start, be_duplicate_node);
112 be_set_transform_function(op_NoMem, be_duplicate_node);
113 be_set_transform_function(op_Pin, be_duplicate_node);
114 be_set_transform_function(op_Start, be_duplicate_node);
115 be_set_transform_function(op_Sync, be_duplicate_node);
118 ir_node *be_duplicate_node(ir_node *node)
120 ir_node *block = be_transform_node(get_nodes_block(node));
121 ir_graph *irg = env.irg;
122 dbg_info *dbgi = get_irn_dbg_info(node);
123 ir_mode *mode = get_irn_mode(node);
124 ir_op *op = get_irn_op(node);
128 arity = get_irn_arity(node);
129 if (op->opar == oparity_dynamic) {
130 new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
131 for (i = 0; i < arity; ++i) {
132 ir_node *in = get_irn_n(node, i);
133 in = be_transform_node(in);
134 add_irn_n(new_node, in);
137 ir_node **ins = ALLOCAN(ir_node*, arity);
138 for (i = 0; i < arity; ++i) {
139 ir_node *in = get_irn_n(node, i);
140 ins[i] = be_transform_node(in);
143 new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
146 copy_node_attr(irg, node, new_node);
147 be_duplicate_deps(node, new_node);
149 new_node->node_nr = node->node_nr;
153 ir_node *be_transform_node(ir_node *node)
156 ir_node *new_node = be_get_transformed_node(node);
157 be_transform_func *transform;
159 if (new_node != NULL)
162 DEBUG_ONLY(be_set_transformed_node(node, NULL));
164 op = get_irn_op(node);
165 if (op->ops.generic == NULL) {
166 panic("No transform function registered for node %+F.", node);
168 transform = (be_transform_func *)op->ops.generic;
170 new_node = transform(node);
171 assert(new_node != NULL);
173 be_set_transformed_node(node, new_node);
174 hook_dead_node_elim_subst(current_ir_graph, node, new_node);
178 void be_enqueue_preds(ir_node *node)
182 /* put the preds in the worklist */
183 arity = get_irn_arity(node);
184 for (i = 0; i < arity; ++i) {
185 ir_node *pred = get_irn_n(node, i);
186 pdeq_putr(env.worklist, pred);
191 * Rewire nodes which are potential loops (like Phis) to avoid endless loops.
193 static void fix_loops(ir_node *node)
198 assert(node_is_in_irgs_storage(env.irg, node));
200 if (irn_visited_else_mark(node))
204 if (! is_Block(node)) {
205 ir_node *block = get_nodes_block(node);
206 ir_node *new_block = (ir_node*)get_irn_link(block);
208 if (new_block != NULL) {
209 set_nodes_block(node, new_block);
217 arity = get_irn_arity(node);
218 for (i = 0; i < arity; ++i) {
219 ir_node *in = get_irn_n(node, i);
220 ir_node *nw = (ir_node*)get_irn_link(in);
222 if (nw != NULL && nw != in) {
223 set_irn_n(node, i, nw);
232 set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
236 arity = get_irn_deps(node);
237 for (i = 0; i < arity; ++i) {
238 ir_node *in = get_irn_dep(node, i);
239 ir_node *nw = (ir_node*)get_irn_link(in);
241 if (nw != NULL && nw != in) {
242 set_irn_dep(node, i, nw);
251 identify_remember(node);
255 ir_node *be_pre_transform_node(ir_node *place)
260 return be_transform_node(place);
263 static void pre_transform_anchor(int anchor)
265 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
266 ir_node *transformed = be_transform_node(old_anchor_node);
267 set_irg_anchor(current_ir_graph, anchor, transformed);
270 static void kill_unused_anchor(int anchor)
272 ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
273 ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
274 if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
275 set_irn_n(env.old_anchor, anchor, old_bad);
279 static ir_node *new_be_Anchor(ir_graph *irg)
281 struct obstack *obst = be_get_be_obst(irg);
282 backend_info_t *info;
285 /* Hack: some places in the code ask the Anchor for its register
287 new_anchor = new_r_Anchor(irg);
288 info = be_get_info(new_anchor);
289 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
290 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
291 info->out_infos[0].req = arch_no_register_req;
297 * Transforms all nodes. Deletes the old obstack and creates a new one.
299 static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
302 ir_node *old_end, *new_anchor;
304 hook_dead_node_elim(irg, 1);
306 inc_irg_visited(irg);
309 env.worklist = new_waitq();
310 env.old_anchor = irg->anchor;
312 old_end = get_irg_end(irg);
314 /* put all anchor nodes in the worklist */
315 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
316 ir_node *anchor = get_irg_anchor(irg, i);
320 waitq_put(env.worklist, anchor);
323 new_anchor = new_be_Anchor(irg);
324 irg->anchor = new_anchor;
326 /* pre transform some anchors (so they are available in the other transform
328 pre_transform_anchor(anchor_bad);
329 pre_transform_anchor(anchor_no_mem);
330 pre_transform_anchor(anchor_start_block);
331 pre_transform_anchor(anchor_start);
332 pre_transform_anchor(anchor_frame);
333 kill_unused_anchor(anchor_tls);
338 /* process worklist (this should transform all nodes in the graph) */
339 while (! waitq_empty(env.worklist)) {
340 ir_node *node = (ir_node*)waitq_get(env.worklist);
341 be_transform_node(node);
344 /* let beabi grab new nodes */
345 be_abi_transform_fixup(irg);
346 assert(waitq_empty(env.worklist)); // let's hope this didn't trigger new transforms
348 /* fix loops and set new anchors*/
349 inc_irg_visited(irg);
350 for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
351 ir_node *anchor = get_irn_n(env.old_anchor, i);
356 anchor = (ir_node*)get_irn_link(anchor);
358 set_irn_n(new_anchor, i, anchor);
361 del_waitq(env.worklist);
363 hook_dead_node_elim(irg, 0);
367 * Transform helper for blocks.
369 static ir_node *gen_Block(ir_node *node)
371 ir_graph *irg = current_ir_graph;
372 dbg_info *dbgi = get_irn_dbg_info(node);
375 block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
376 get_irn_arity(node), get_irn_in(node) + 1);
377 copy_node_attr(irg, node, block);
378 block->node_nr = node->node_nr;
380 /* put the preds in the worklist */
381 be_enqueue_preds(node);
386 static ir_node *gen_End(ir_node *node)
388 /* end has to be duplicated manually because we need a dynamic in array */
389 ir_graph *irg = current_ir_graph;
390 dbg_info *dbgi = get_irn_dbg_info(node);
391 ir_node *block = be_transform_node(get_nodes_block(node));
395 new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
396 copy_node_attr(irg, node, new_end);
397 be_duplicate_deps(node, new_end);
399 set_irg_end(irg, new_end);
401 /* transform preds */
402 arity = get_irn_arity(node);
403 for (i = 0; i < arity; ++i) {
404 ir_node *in = get_irn_n(node, i);
405 ir_node *new_in = be_transform_node(in);
407 add_End_keepalive(new_end, new_in);
413 void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
415 ir_graph *old_current_ir_graph = current_ir_graph;
416 struct obstack *old_obst = NULL;
417 struct obstack *new_obst = NULL;
419 current_ir_graph = irg;
421 /* create a new obstack */
422 old_obst = irg->obst;
423 new_obst = XMALLOC(struct obstack);
424 obstack_init(new_obst);
425 irg->obst = new_obst;
426 irg->last_node_idx = 0;
428 /* invalidate phase info as (at least vrp info) is used inside the
429 * equivalent/compute_value functions and might replace our newly
430 * created nodes with middleend nodes */
431 irg_invalidate_phases(irg);
433 /* create new value table for CSE */
436 /* enter special helper */
437 op_Block->ops.generic = (op_func)gen_Block;
438 op_End->ops.generic = (op_func)gen_End;
440 /* do the main transformation */
441 transform_nodes(irg, func);
443 /* free the old obstack */
444 obstack_free(old_obst, 0);
448 current_ir_graph = old_current_ir_graph;
450 /* most analysis info is wrong after transformation */
451 free_callee_info(irg);
454 free_loop_information(irg);
455 set_irg_doms_inconsistent(irg);
457 be_liveness_invalidate(be_get_irg_liveness(irg));
458 /* Hack for now, something is buggy with invalidate liveness... */
459 be_birg_from_irg(irg)->lv = NULL;
460 be_invalidate_dom_front(irg);
462 /* recalculate edges */
463 edges_deactivate(irg);
467 int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
472 ir_relation relation;
478 * Note further that these optimization work even for floating point
479 * with NaN's because -NaN == NaN.
480 * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
483 mode = get_irn_mode(mux_true);
484 if (mode_honor_signed_zeros(mode))
487 /* must be <, <=, >=, > */
488 relation = get_Cmp_relation(sel);
489 if ((relation & ir_relation_less_greater) == 0)
492 if (!ir_is_negated_value(mux_true, mux_false))
495 /* must be x cmp 0 */
496 cmp_right = get_Cmp_right(sel);
497 if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
500 cmp_left = get_Cmp_left(sel);
501 if (cmp_left == mux_false) {
502 if (relation & ir_relation_less) {
505 assert(relation & ir_relation_greater);
508 } else if (cmp_left == mux_true) {
509 if (relation & ir_relation_less) {
512 assert(relation & ir_relation_greater);
520 ir_node *be_get_abs_op(ir_node *sel)
522 ir_node *cmp_left = get_Cmp_left(sel);