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"
35 typedef struct needs_lowering_t {
40 static ir_mode *lowered_mode;
41 static needs_lowering_t *needs_lowering;
43 static ir_node *create_not(dbg_info *dbgi, ir_node *node)
45 ir_node *block = get_nodes_block(node);
46 ir_mode *mode = lowered_mode;
47 ir_tarval *tv_one = get_mode_one(mode);
48 ir_graph *irg = get_irn_irg(node);
49 ir_node *one = new_rd_Const(dbgi, irg, tv_one);
51 return new_rd_Eor(dbgi, block, node, one, mode);
54 static ir_node *convert_to_modeb(ir_node *node)
56 ir_node *block = get_nodes_block(node);
57 ir_graph *irg = get_irn_irg(node);
58 ir_mode *mode = lowered_mode;
59 ir_tarval *tv_zero = get_mode_null(mode);
60 ir_node *zero = new_r_Const(irg, tv_zero);
61 ir_node *cmp = new_r_Cmp(block, node, zero, ir_relation_less_greater);
66 * implementation of create_set_func which produces a cond with control
69 static ir_node *create_cond_set(ir_node *cond_value, ir_mode *dest_mode)
71 ir_node *lower_block = part_block_edges(cond_value);
72 ir_node *upper_block = get_nodes_block(cond_value);
73 ir_graph *irg = get_irn_irg(cond_value);
74 ir_node *cond = new_r_Cond(upper_block, cond_value);
75 ir_node *proj_true = new_r_Proj(cond, mode_X, pn_Cond_true);
76 ir_node *proj_false = new_r_Proj(cond, mode_X, pn_Cond_false);
77 ir_node *in_true[1] = { proj_true };
78 ir_node *in_false[1] = { proj_false };
79 ir_node *true_block = new_r_Block(irg, ARRAY_SIZE(in_true), in_true);
80 ir_node *false_block = new_r_Block(irg, ARRAY_SIZE(in_false),in_false);
81 ir_node *true_jmp = new_r_Jmp(true_block);
82 ir_node *false_jmp = new_r_Jmp(false_block);
83 ir_node *lower_in[2] = { true_jmp, false_jmp };
84 ir_node *one = new_r_Const(irg, get_mode_one(dest_mode));
85 ir_node *zero = new_r_Const(irg, get_mode_null(dest_mode));
86 ir_node *phi_in[2] = { one, zero };
89 set_irn_in(lower_block, ARRAY_SIZE(lower_in), lower_in);
90 phi = new_r_Phi(lower_block, ARRAY_SIZE(phi_in), phi_in, dest_mode);
95 static ir_node *lower_node(ir_node *node)
97 dbg_info *dbgi = get_irn_dbg_info(node);
98 ir_node *block = get_nodes_block(node);
99 ir_mode *mode = lowered_mode;
100 ir_node *res = (ir_node*)get_irn_link(node);
106 node = skip_Tuple(node);
108 assert(get_irn_mode(node) == mode_b);
110 irg = get_irn_irg(node);
111 switch (get_irn_opcode(node)) {
118 arity = get_irn_arity(node);
119 in = ALLOCAN(ir_node*, arity);
120 dummy = new_r_Dummy(irg, mode);
121 for (i = 0; i < arity; ++i) {
124 new_phi = new_r_Phi(block, arity, in, mode);
125 /* FIXME This does not correctly break cycles: The Phi might not be the
126 * first in the recursion, so the caller(s) are some yet un-lowered
127 * nodes and this Phi might have them (indirectly) as operands, so they
128 * would be replaced twice. */
129 set_irn_link(node, new_phi);
131 for (i = 0; i < arity; ++i) {
132 ir_node *in = get_irn_n(node, i);
133 ir_node *lowered_in = lower_node(in);
135 set_irn_n(new_phi, i, lowered_in);
142 ir_node *lowered_left = lower_node(get_And_left(node));
143 ir_node *lowered_right = lower_node(get_And_right(node));
144 res = new_rd_And(dbgi, block, lowered_left, lowered_right, mode);
148 ir_node *lowered_left = lower_node(get_Or_left(node));
149 ir_node *lowered_right = lower_node(get_Or_right(node));
150 res = new_rd_Or(dbgi, block, lowered_left, lowered_right, mode);
154 ir_node *lowered_left = lower_node(get_Eor_left(node));
155 ir_node *lowered_right = lower_node(get_Eor_right(node));
156 res = new_rd_Eor(dbgi, block, lowered_left, lowered_right, mode);
161 ir_node *op = get_Not_op(node);
162 ir_node *low_op = lower_node(op);
164 res = create_not(dbgi, low_op);
169 ir_node *cond = get_Mux_sel(node);
170 ir_node *low_cond = lower_node(cond);
171 ir_node *v_true = get_Mux_true(node);
172 ir_node *low_v_true = lower_node(v_true);
173 ir_node *v_false = get_Mux_false(node);
174 ir_node *low_v_false = lower_node(v_false);
176 ir_node *and0 = new_rd_And(dbgi, block, low_cond, low_v_true, mode);
177 ir_node *not_cond = create_not(dbgi, low_cond);
178 ir_node *and1 = new_rd_And(dbgi, block, not_cond, low_v_false, mode);
179 res = new_rd_Or(dbgi, block, and0, and1, mode);
184 res = create_cond_set(node, mode);
188 ir_tarval *tv = get_Const_tarval(node);
189 if (tv == get_tarval_b_true()) {
190 ir_tarval *tv_one = get_mode_one(mode);
191 res = new_rd_Const(dbgi, irg, tv_one);
192 } else if (tv == get_tarval_b_false()) {
193 ir_tarval *tv_zero = get_mode_null(mode);
194 res = new_rd_Const(dbgi, irg, tv_zero);
196 panic("invalid boolean const %+F", node);
202 res = new_r_Unknown(irg, mode);
206 res = new_r_Bad(irg, mode);
210 panic("Don't know how to lower mode_b node %+F", node);
213 set_irn_link(node, res);
217 static bool needs_mode_b_input(const ir_node *node, int input)
219 return (is_Cond(node) && input == n_Cond_selector)
220 || (is_Mux(node) && input == n_Mux_sel);
224 * Collects "roots" of a mode_b calculation. These are nodes which require a
225 * mode_b input (Cond, Mux)
227 static void collect_needs_lowering(ir_node *node, void *env)
229 int arity = get_irn_arity(node);
233 /* if the node produces mode_b then it is not a root (but should be
234 * something our lower_node function can handle) */
235 if (get_irn_mode(node) == mode_b) {
236 assert(is_And(node) || is_Or(node) || is_Eor(node) || is_Phi(node)
237 || is_Not(node) || is_Mux(node) || is_Cmp(node)
238 || is_Const(node) || is_Unknown(node) || is_Bad(node));
242 for (i = 0; i < arity; ++i) {
243 needs_lowering_t entry;
244 ir_node *in = get_irn_n(node, i);
245 if (get_irn_mode(in) != mode_b)
247 if (is_Cmp(in) && needs_mode_b_input(node, i))
252 ARR_APP1(needs_lowering_t, needs_lowering, entry);
256 void ir_lower_mode_b(ir_graph *const irg, ir_mode *const nlowered_mode)
261 lowered_mode = nlowered_mode;
263 /* edges are used by part_block_edges in the ir_create_cond_set variant. */
264 assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
265 | IR_GRAPH_PROPERTY_NO_TUPLES);
267 add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED);
268 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
270 needs_lowering = NEW_ARR_F(needs_lowering_t, 0);
272 irg_walk_graph(irg, firm_clear_link, collect_needs_lowering, NULL);
274 n = ARR_LEN(needs_lowering);
275 for (i = 0; i < n; ++i) {
276 const needs_lowering_t *entry = &needs_lowering[i];
277 ir_node *node = entry->node;
278 int input = entry->input;
279 ir_node *in = get_irn_n(node, input);
280 ir_node *lowered = lower_node(in);
282 if (needs_mode_b_input(node, input))
283 lowered = convert_to_modeb(lowered);
284 set_irn_n(node, input, lowered);
287 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
289 DEL_ARR_F(needs_lowering);
291 confirm_irg_properties(irg, n > 0 ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);