2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief lower mode_b operations to something the backend can handle
9 * @author Matthias Braun, Christoph Mallon
13 #include "lower_mode_b.h"
34 typedef struct needs_lowering_t {
39 static ir_mode *lowered_mode;
40 static needs_lowering_t *needs_lowering;
42 static ir_node *create_not(dbg_info *dbgi, ir_node *node)
44 ir_node *block = get_nodes_block(node);
45 ir_mode *mode = lowered_mode;
46 ir_tarval *tv_one = get_mode_one(mode);
47 ir_graph *irg = get_irn_irg(node);
48 ir_node *one = new_rd_Const(dbgi, irg, tv_one);
50 return new_rd_Eor(dbgi, block, node, one, mode);
53 static ir_node *convert_to_modeb(ir_node *node)
55 ir_node *block = get_nodes_block(node);
56 ir_graph *irg = get_irn_irg(node);
57 ir_mode *mode = lowered_mode;
58 ir_tarval *tv_zero = get_mode_null(mode);
59 ir_node *zero = new_r_Const(irg, tv_zero);
60 ir_node *cmp = new_r_Cmp(block, node, zero, ir_relation_less_greater);
65 * implementation of create_set_func which produces a cond with control
68 static ir_node *create_cond_set(ir_node *cond_value, ir_mode *dest_mode)
70 ir_node *lower_block = part_block_edges(cond_value);
71 ir_node *upper_block = get_nodes_block(cond_value);
72 ir_graph *irg = get_irn_irg(cond_value);
73 ir_node *cond = new_r_Cond(upper_block, cond_value);
74 ir_node *proj_true = new_r_Proj(cond, mode_X, pn_Cond_true);
75 ir_node *proj_false = new_r_Proj(cond, mode_X, pn_Cond_false);
76 ir_node *in_true[1] = { proj_true };
77 ir_node *in_false[1] = { proj_false };
78 ir_node *true_block = new_r_Block(irg, ARRAY_SIZE(in_true), in_true);
79 ir_node *false_block = new_r_Block(irg, ARRAY_SIZE(in_false),in_false);
80 ir_node *true_jmp = new_r_Jmp(true_block);
81 ir_node *false_jmp = new_r_Jmp(false_block);
82 ir_node *lower_in[2] = { true_jmp, false_jmp };
83 ir_node *one = new_r_Const(irg, get_mode_one(dest_mode));
84 ir_node *zero = new_r_Const(irg, get_mode_null(dest_mode));
85 ir_node *phi_in[2] = { one, zero };
88 set_irn_in(lower_block, ARRAY_SIZE(lower_in), lower_in);
89 phi = new_r_Phi(lower_block, ARRAY_SIZE(phi_in), phi_in, dest_mode);
94 static ir_node *lower_node(ir_node *node)
96 dbg_info *dbgi = get_irn_dbg_info(node);
97 ir_node *block = get_nodes_block(node);
98 ir_mode *mode = lowered_mode;
99 ir_node *res = (ir_node*)get_irn_link(node);
105 node = skip_Tuple(node);
107 assert(get_irn_mode(node) == mode_b);
109 irg = get_irn_irg(node);
110 switch (get_irn_opcode(node)) {
117 arity = get_irn_arity(node);
118 in = ALLOCAN(ir_node*, arity);
119 dummy = new_r_Dummy(irg, mode);
120 for (i = 0; i < arity; ++i) {
123 new_phi = new_r_Phi(block, arity, in, mode);
124 /* FIXME This does not correctly break cycles: The Phi might not be the
125 * first in the recursion, so the caller(s) are some yet un-lowered
126 * nodes and this Phi might have them (indirectly) as operands, so they
127 * would be replaced twice. */
128 set_irn_link(node, new_phi);
130 for (i = 0; i < arity; ++i) {
131 ir_node *in = get_irn_n(node, i);
132 ir_node *lowered_in = lower_node(in);
134 set_irn_n(new_phi, i, lowered_in);
141 ir_node *lowered_left = lower_node(get_And_left(node));
142 ir_node *lowered_right = lower_node(get_And_right(node));
143 res = new_rd_And(dbgi, block, lowered_left, lowered_right, mode);
147 ir_node *lowered_left = lower_node(get_Or_left(node));
148 ir_node *lowered_right = lower_node(get_Or_right(node));
149 res = new_rd_Or(dbgi, block, lowered_left, lowered_right, mode);
153 ir_node *lowered_left = lower_node(get_Eor_left(node));
154 ir_node *lowered_right = lower_node(get_Eor_right(node));
155 res = new_rd_Eor(dbgi, block, lowered_left, lowered_right, mode);
160 ir_node *op = get_Not_op(node);
161 ir_node *low_op = lower_node(op);
163 res = create_not(dbgi, low_op);
168 ir_node *cond = get_Mux_sel(node);
169 ir_node *low_cond = lower_node(cond);
170 ir_node *v_true = get_Mux_true(node);
171 ir_node *low_v_true = lower_node(v_true);
172 ir_node *v_false = get_Mux_false(node);
173 ir_node *low_v_false = lower_node(v_false);
175 ir_node *and0 = new_rd_And(dbgi, block, low_cond, low_v_true, mode);
176 ir_node *not_cond = create_not(dbgi, low_cond);
177 ir_node *and1 = new_rd_And(dbgi, block, not_cond, low_v_false, mode);
178 res = new_rd_Or(dbgi, block, and0, and1, mode);
183 res = create_cond_set(node, mode);
187 ir_tarval *tv = get_Const_tarval(node);
188 if (tv == get_tarval_b_true()) {
189 ir_tarval *tv_one = get_mode_one(mode);
190 res = new_rd_Const(dbgi, irg, tv_one);
191 } else if (tv == get_tarval_b_false()) {
192 ir_tarval *tv_zero = get_mode_null(mode);
193 res = new_rd_Const(dbgi, irg, tv_zero);
195 panic("invalid boolean const %+F", node);
201 res = new_r_Unknown(irg, mode);
205 res = new_r_Bad(irg, mode);
209 panic("Don't know how to lower mode_b node %+F", node);
212 set_irn_link(node, res);
216 static bool needs_mode_b_input(const ir_node *node, int input)
218 return (is_Cond(node) && input == n_Cond_selector)
219 || (is_Mux(node) && input == n_Mux_sel);
223 * Collects "roots" of a mode_b calculation. These are nodes which require a
224 * mode_b input (Cond, Mux)
226 static void collect_needs_lowering(ir_node *node, void *env)
228 int arity = get_irn_arity(node);
232 /* if the node produces mode_b then it is not a root (but should be
233 * something our lower_node function can handle) */
234 if (get_irn_mode(node) == mode_b) {
235 assert(is_And(node) || is_Or(node) || is_Eor(node) || is_Phi(node)
236 || is_Not(node) || is_Mux(node) || is_Cmp(node)
237 || is_Const(node) || is_Unknown(node) || is_Bad(node));
241 for (i = 0; i < arity; ++i) {
242 needs_lowering_t entry;
243 ir_node *in = get_irn_n(node, i);
244 if (get_irn_mode(in) != mode_b)
246 if (is_Cmp(in) && needs_mode_b_input(node, i))
251 ARR_APP1(needs_lowering_t, needs_lowering, entry);
255 void ir_lower_mode_b(ir_graph *const irg, ir_mode *const nlowered_mode)
260 lowered_mode = nlowered_mode;
262 /* edges are used by part_block_edges in the ir_create_cond_set variant. */
263 assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
264 | IR_GRAPH_PROPERTY_NO_TUPLES);
266 add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED);
267 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
269 needs_lowering = NEW_ARR_F(needs_lowering_t, 0);
271 irg_walk_graph(irg, firm_clear_link, collect_needs_lowering, NULL);
273 n = ARR_LEN(needs_lowering);
274 for (i = 0; i < n; ++i) {
275 const needs_lowering_t *entry = &needs_lowering[i];
276 ir_node *node = entry->node;
277 int input = entry->input;
278 ir_node *in = get_irn_n(node, input);
279 ir_node *lowered = lower_node(in);
281 if (needs_mode_b_input(node, input))
282 lowered = convert_to_modeb(lowered);
283 set_irn_n(node, input, lowered);
286 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
288 DEL_ARR_F(needs_lowering);
290 confirm_irg_properties(irg, n > 0 ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);