2 * Copyright (C) 1995-2008 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 lowers operations with mode_b. The result is a graph which
23 * might still contains some convs from/to mode_b, but no
24 * operations are performed on them anymore, they are just there
25 * so modes match. A backend can safely skip all mode_b convs.
26 * @author Matthias Braun, Christoph Mallon
29 * After this pass the following should hold:
30 * - The only inputs with mode_b are for the Cond node or the
31 * Sel input of a Mux node.
32 * - The only nodes producing mode_b are: Proj(Cmp) and ConvB(X) (where X
33 * is some mode that can be converted to the lowered mode).
34 * ConvB will usually be implemented by a comparison with 0 producing some
35 * flags in the backends. It's debatable wether ConvB(X) is a goode idea.
36 * Maybe we should rather introduce a Test node.
37 * All other former uses should be converted to manipulations with an integer
38 * mode that was specified in the pass configuration.
61 static const lower_mode_b_config_t *config;
62 static ir_type *lowered_type;
63 static ir_node **lowered_nodes;
64 static ir_node **check_later;
67 * Removes a node if its out-edge count has reached 0.
68 * temporary hack until we have proper automatic dead code elimination.
70 static void maybe_kill_node(ir_node *node)
75 if (get_irn_n_edges(node) != 0)
78 irg = get_irn_irg(node);
80 assert(!is_Bad(node));
82 arity = get_irn_arity(node);
83 for (i = 0; i < arity; ++i) {
84 set_irn_n(node, i, new_r_Bad(irg));
86 set_nodes_block(node, new_r_Bad(irg));
88 edges_node_deleted(node, irg);
91 static ir_node *create_not(dbg_info *dbgi, ir_node *node)
93 ir_node *block = get_nodes_block(node);
94 ir_mode *mode = config->lowered_mode;
95 tarval *tv_one = get_mode_one(mode);
96 ir_graph *irg = get_irn_irg(node);
97 ir_node *one = new_rd_Const(dbgi, irg, tv_one);
99 return new_rd_Eor(dbgi, block, node, one, mode);
102 static ir_node *create_convb(ir_node *node)
104 ir_node *block = get_nodes_block(node);
105 ir_node *conv = new_rd_Conv(NULL, block, node, mode_b);
110 static ir_type *create_lowered_type(void)
112 if (lowered_type == NULL) {
113 lowered_type = new_type_primitive(config->lowered_mode);
118 ir_node *ir_create_mux_set(ir_node *cond, ir_mode *dest_mode)
120 ir_graph *irg = get_irn_irg(cond);
121 ir_node *block = get_nodes_block(cond);
122 tarval *tv_one = get_mode_one(dest_mode);
123 ir_node *one = new_r_Const(irg, tv_one);
124 tarval *tv_zero = get_mode_null(dest_mode);
125 ir_node *zero = new_r_Const(irg, tv_zero);
126 ir_node *set = new_r_Mux(block, cond, zero, one, dest_mode);
130 ir_node *ir_create_cond_set(ir_node *cond_value, ir_mode *dest_mode)
132 ir_node *lower_block = part_block_edges(cond_value);
133 ir_node *upper_block = get_nodes_block(cond_value);
134 ir_graph *irg = get_irn_irg(cond_value);
135 ir_node *cond = new_r_Cond(upper_block, cond_value);
136 ir_node *proj_true = new_r_Proj(cond, mode_X, pn_Cond_true);
137 ir_node *proj_false = new_r_Proj(cond, mode_X, pn_Cond_false);
138 ir_node *in_true[1] = { proj_true };
139 ir_node *in_false[1] = { proj_false };
140 ir_node *true_block = new_r_Block(irg, ARRAY_SIZE(in_true), in_true);
141 ir_node *false_block = new_r_Block(irg, ARRAY_SIZE(in_false),in_false);
142 ir_node *true_jmp = new_r_Jmp(true_block);
143 ir_node *false_jmp = new_r_Jmp(false_block);
144 ir_node *lower_in[2] = { true_jmp, false_jmp };
145 ir_node *one = new_r_Const(irg, get_mode_one(dest_mode));
146 ir_node *zero = new_r_Const(irg, get_mode_null(dest_mode));
147 ir_node *phi_in[2] = { one, zero };
150 set_irn_in(lower_block, ARRAY_SIZE(lower_in), lower_in);
151 phi = new_r_Phi(lower_block, ARRAY_SIZE(phi_in), phi_in, dest_mode);
152 assert(get_Block_phis(lower_block) == NULL);
153 set_Block_phis(lower_block, phi);
154 set_Phi_next(phi, NULL);
156 /* make sure we do visit the cond_value later... */
157 ARR_APP1(ir_node*, check_later, cond_value);
162 static void adjust_method_type(ir_type *method_type)
168 n_params = get_method_n_params(method_type);
169 for (i = 0; i < n_params; ++i) {
170 ir_type *param = get_method_param_type(method_type, i);
171 if (get_type_mode(param) == mode_b) {
172 set_method_param_type(method_type, i, create_lowered_type());
176 n_res = get_method_n_ress(method_type);
177 for (i = 0; i < n_res; ++i) {
178 ir_type *res_type = get_method_res_type(method_type, i);
179 if (get_type_mode(res_type) == mode_b) {
180 set_method_res_type(method_type, i, create_lowered_type());
185 static ir_node *lower_node(ir_node *node)
187 dbg_info *dbgi = get_irn_dbg_info(node);
188 ir_node *block = get_nodes_block(node);
189 ir_mode *mode = config->lowered_mode;
193 res = get_irn_link(node);
197 assert(get_irn_mode(node) == mode_b);
199 irg = get_irn_irg(node);
200 switch (get_irn_opcode(node)) {
204 ir_node *unknown, *new_phi;
206 arity = get_irn_arity(node);
207 in = ALLOCAN(ir_node*, arity);
208 unknown = new_r_Unknown(irg, mode);
209 for (i = 0; i < arity; ++i) {
212 new_phi = new_r_Phi(block, arity, in, mode);
213 /* FIXME This does not correctly break cycles: The Phi might not be the
214 * first in the recursion, so the caller(s) are some yet un-lowered
215 * nodes and this Phi might have them (indirectly) as operands, so they
216 * would be replaced twice. */
217 set_irn_link(node, new_phi);
218 ARR_APP1(ir_node*, lowered_nodes, node);
220 for (i = 0; i < arity; ++i) {
221 ir_node *in = get_irn_n(node, i);
222 ir_node *low_in = lower_node(in);
224 set_irn_n(new_phi, i, low_in);
231 ir_node *lowered_left = lower_node(get_And_left(node));
232 ir_node *lowered_right = lower_node(get_And_right(node));
233 res = new_rd_And(dbgi, block, lowered_left, lowered_right, mode);
237 ir_node *lowered_left = lower_node(get_Or_left(node));
238 ir_node *lowered_right = lower_node(get_Or_right(node));
239 res = new_rd_Or(dbgi, block, lowered_left, lowered_right, mode);
243 ir_node *lowered_left = lower_node(get_Eor_left(node));
244 ir_node *lowered_right = lower_node(get_Eor_right(node));
245 res = new_rd_Eor(dbgi, block, lowered_left, lowered_right, mode);
250 ir_node *op = get_Not_op(node);
251 ir_node *low_op = lower_node(op);
253 res = create_not(dbgi, low_op);
258 ir_node *cond = get_Mux_sel(node);
259 ir_node *low_cond = lower_node(cond);
260 ir_node *v_true = get_Mux_true(node);
261 ir_node *low_v_true = lower_node(v_true);
262 ir_node *v_false = get_Mux_false(node);
263 ir_node *low_v_false = lower_node(v_false);
265 ir_node *and0 = new_rd_And(dbgi, block, low_cond, low_v_true, mode);
266 ir_node *not_cond = create_not(dbgi, low_cond);
267 ir_node *and1 = new_rd_And(dbgi, block, not_cond, low_v_false, mode);
268 res = new_rd_Or(dbgi, block, and0, and1, mode);
273 ir_node *pred = get_Conv_op(node);
274 ir_mode *mode = get_irn_mode(pred);
275 tarval *tv_zeroc = get_mode_null(mode);
276 ir_node *zero_cmp = new_rd_Const(dbgi, irg, tv_zeroc);
278 ir_node *cmp = new_rd_Cmp(dbgi, block, pred, zero_cmp);
279 ir_node *proj = new_rd_Proj(dbgi, cmp, mode_b, pn_Cmp_Lg);
280 res = config->create_set(proj);
285 ir_node *pred = get_Proj_pred(node);
288 ir_node *left = get_Cmp_left(pred);
289 ir_node *right = get_Cmp_right(pred);
290 ir_mode *cmp_mode = get_irn_mode(left);
292 if ((mode_is_int(cmp_mode) || mode_is_reference(cmp_mode)) &&
293 (get_mode_size_bits(cmp_mode) < get_mode_size_bits(mode) ||
294 (mode_is_signed(cmp_mode) && is_Const(right) && is_Const_null(right)))) {
295 int pnc = get_Proj_proj(node);
303 if (pnc == pn_Cmp_Lt) {
304 /* a < b -> (a - b) >> 31 */
307 } else if (pnc == pn_Cmp_Le) {
308 /* a <= b -> ~(a - b) >> 31 */
312 } else if (pnc == pn_Cmp_Gt) {
313 /* a > b -> (b - a) >> 31 */
316 } else if (pnc == pn_Cmp_Ge) {
317 /* a >= b -> ~(a - b) >> 31 */
325 bits = get_mode_size_bits(mode);
326 tv = new_tarval_from_long(bits-1, mode_Iu);
327 shift_cnt = new_rd_Const(dbgi, irg, tv);
329 if (cmp_mode != mode) {
330 a = new_rd_Conv(dbgi, block, a, mode);
331 b = new_rd_Conv(dbgi, block, b, mode);
334 res = new_rd_Sub(dbgi, block, a, b, mode);
336 res = new_rd_Not(dbgi, block, res, mode);
338 res = new_rd_Shr(dbgi, block, res, shift_cnt, mode);
340 /* synthesize the 0/1 value */
342 res = config->create_set(node);
344 } else if (is_Proj(pred) && is_Call(get_Proj_pred(pred))) {
345 ir_type *type = get_Call_type(get_Proj_pred(pred));
346 adjust_method_type(type);
347 set_irn_mode(node, mode);
349 goto own_replacement;
350 } else if (is_Proj(pred) && is_Start(get_Proj_pred(pred))) {
351 ir_graph *irg = get_irn_irg(node);
352 ir_entity *entity = get_irg_entity(irg);
353 ir_type *type = get_entity_type(entity);
354 adjust_method_type(type);
355 set_irn_mode(node, mode);
357 goto own_replacement;
359 panic("unexpected projb: %+F (pred: %+F)", node, pred);
365 tarval *tv = get_Const_tarval(node);
366 if (tv == get_tarval_b_true()) {
367 tarval *tv_one = get_mode_one(mode);
368 res = new_rd_Const(dbgi, irg, tv_one);
369 } else if (tv == get_tarval_b_false()) {
370 tarval *tv_zero = get_mode_null(mode);
371 res = new_rd_Const(dbgi, irg, tv_zero);
373 panic("invalid boolean const %+F", node);
379 res = new_r_Unknown(irg, mode);
383 panic("didn't expect %+F to have mode_b", node);
386 ARR_APP1(ir_node*, lowered_nodes, node);
388 set_irn_link(node, res);
392 static void lower_mode_b_walker(ir_node *node, void *env)
395 bool changed = false;
397 arity = get_irn_arity(node);
398 for (i = 0; i < arity; ++i) {
400 ir_node *in = get_irn_n(node, i);
401 if (get_irn_mode(in) != mode_b)
404 if (! config->lower_direct_cmp) {
405 /* Proj(Cmp) as input for Cond and Mux nodes needs no changes.
406 (Mux with mode_b is an exception as it gets replaced by and/or
407 anyway so we still lower the inputs then) */
409 (is_Mux(node) && get_irn_mode(node) != mode_b)) {
411 ir_node *pred = get_Proj_pred(in);
418 lowered_in = lower_node(in);
421 ir_type *type = get_Call_type(node);
422 adjust_method_type(type);
423 } else if (is_Cond(node) || (is_Mux(node) && i == 0)) {
424 lowered_in = create_convb(lowered_in);
426 set_irn_n(node, i, lowered_in);
430 bool *global_changed = env;
431 *global_changed = true;
432 add_identities(node);
436 void ir_lower_mode_b(ir_graph *irg, const lower_mode_b_config_t *nconfig)
438 ir_entity *entity = get_irg_entity(irg);
439 ir_type *type = get_entity_type(entity);
440 bool changed = false;
445 lowered_nodes = NEW_ARR_F(ir_node*, 0);
446 check_later = NEW_ARR_F(ir_node*, 0);
451 /* ensure no optimisation touches muxes anymore */
452 set_irg_state(irg, IR_GRAPH_STATE_KEEP_MUX | IR_GRAPH_STATE_BCONV_ALLOWED);
454 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
456 adjust_method_type(type);
458 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
459 irg_walk_graph(irg, lower_mode_b_walker, NULL, &changed);
461 for (i = 0; i < ARR_LEN(check_later); ++i) {
462 ir_node *node = check_later[i];
463 irg_walk_core(node, lower_mode_b_walker, NULL, &changed);
466 n = ARR_LEN(lowered_nodes);
467 for (i = 0; i < n; ++i) {
468 ir_node *node = lowered_nodes[i];
469 maybe_kill_node(node);
471 DEL_ARR_F(check_later);
472 DEL_ARR_F(lowered_nodes);
474 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
477 set_irg_outs_inconsistent(irg);