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 architecture dependent IR operations
34 #include "irgraph_t.h"
39 #include "firm_common_t.h"
41 #include "iropt_dbg.h"
46 /* when we need verifying */
48 # define IRN_VRFY_IRG(res, irg)
50 # define IRN_VRFY_IRG(res, irg) irn_vrfy_irg(res, irg)
53 /** current settings */
54 static arch_ops_info settings;
56 /** default settings */
57 static const arch_ops_info default_settings = {
63 * construct a Min: Min(a,b) = a < b ? a : b
66 new_rd_Min(dbg_info *db, ir_graph *irg, ir_node *block,
67 ir_node *op1, ir_node *op2, ir_mode *mode)
73 panic("cannot create Min node, not allowed");
78 res = new_ir_node(db, irg, block, op_Min, mode, 2, in);
79 res = optimize_node(res);
80 IRN_VRFY_IRG(res, irg);
85 * construct a Max: Max(a,b) = a > b ? a : b
88 new_rd_Max(dbg_info *db, ir_graph *irg, ir_node *block,
89 ir_node *op1, ir_node *op2, ir_mode *mode)
95 panic("cannot create Max node, not allowed");
100 res = new_ir_node(db, irg, block, op_Max, mode, 2, in);
101 res = optimize_node(res);
102 IRN_VRFY_IRG(res, irg);
107 new_r_Min(ir_graph *irg, ir_node *block,
108 ir_node *op1, ir_node *op2, ir_mode *mode) {
109 return new_rd_Min(NULL, irg, block, op1, op2, mode);
113 new_r_Max(ir_graph *irg, ir_node *block,
114 ir_node *op1, ir_node *op2, ir_mode *mode) {
115 return new_rd_Max(NULL, irg, block, op1, op2, mode);
119 new_d_Min(dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode) {
120 return new_rd_Min(db, current_ir_graph, current_ir_graph->current_block,
125 new_d_Max(dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode) {
126 return new_rd_Max(db, current_ir_graph, current_ir_graph->current_block,
131 new_Min(ir_node *op1, ir_node *op2, ir_mode *mode) {
132 return new_d_Min(NULL, op1, op2, mode);
136 new_Max(ir_node *op1, ir_node *op2, ir_mode *mode) {
137 return new_d_Max(NULL, op1, op2, mode);
143 * return the value of a Min
145 static tarval *computed_value_Min(const ir_node *n) {
146 ir_node *a = get_binop_left(n);
147 ir_node *b = get_binop_right(n);
149 tarval *ta = value_of(a);
150 tarval *tb = value_of(b);
152 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
153 pn_Cmp res = tarval_cmp(ta, tb);
155 /* beware: there might be Unordered tarvals here, in that
156 * case let the backend decide, do NOT optimize */
157 if (res == pn_Cmp_Lt)
159 if (res == pn_Cmp_Gt || res == pn_Cmp_Eq)
166 * return the value of a Max
168 static tarval *computed_value_Max(const ir_node *n) {
169 ir_node *a = get_binop_left(n);
170 ir_node *b = get_binop_right(n);
172 tarval *tb = value_of(b);
173 tarval *ta = value_of(a);
175 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
176 pn_Cmp res = tarval_cmp(ta, tb);
178 /* beware: there might be Unordered tarvals here, in that
179 * case let the backend decide, do NOT optimize */
180 if (res == pn_Cmp_Gt)
182 if (res == pn_Cmp_Lt || res == pn_Cmp_Eq)
189 * Returns an equivalent node for a Min/Max node.
190 * We do not allow Exceptions in our Min/Max, so there will be always
192 * The problem is Min(NaN, NaN) == NaN ???.
194 static ir_node *equivalent_node_MinMax(ir_node *n)
200 if (settings.minmax_handle_NaN == 0 && mode_is_float(get_irn_mode(n)))
203 a = get_binop_left(n);
204 b = get_binop_right(n);
207 DBG_OPT_ALGSIM0(n, a, FS_OPT_MIN_MAX_EQ);
211 mode = get_irn_mode(n);
212 tv = n->op == op_Max ? get_mode_min(mode) : get_mode_max(mode);
214 if (value_of(b) == tv) {
215 DBG_OPT_ALGSIM0(n, a, FS_OPT_MIN_MAX_EQ);
218 if (value_of(a) == tv) {
219 DBG_OPT_ALGSIM0(n, b, FS_OPT_MIN_MAX_EQ);
226 #define equivalent_node_Min equivalent_node_MinMax
227 #define equivalent_node_Max equivalent_node_MinMax
230 * Create Min and Max from Mux nodes
232 ir_node *arch_transform_node_Mux(ir_node *n)
234 if (settings.enabled_ops & ARCH_OPS_MINMAX) {
235 ir_node *oldn = n, *cmp, *proj = get_Mux_sel(n);
238 if (get_irn_op(proj) != op_Proj)
241 cmp = get_Proj_pred(proj);
243 ir_node *a = get_Cmp_left(cmp);
244 ir_node *b = get_Cmp_right(cmp);
245 ir_node *t = get_Mux_true(n);
246 ir_node *f = get_Mux_false(n);
248 proj_nr = get_Proj_proj(proj);
250 if (proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Le) {
251 if (a == t && b == f) {
252 /* a </<= b ? a : b ==> Min(a,b) */
253 n = new_rd_Min(get_irn_dbg_info(n),
259 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MIN);
262 else if (a == f && b == t) {
263 /* a </<= b ? b : a ==> Max(a,b) */
264 n = new_rd_Max(get_irn_dbg_info(n),
270 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MAX);
274 else if (proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Ge) {
275 if (a == t && b == f) {
276 /* a >/>= b ? a : b ==> Max(a,b) */
277 n = new_rd_Max(get_irn_dbg_info(n),
283 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MAX);
286 else if (a == f && b == t) {
287 /* a >/>= b ? b : a ==> Min(a,b) */
288 n = new_rd_Min(get_irn_dbg_info(n),
294 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MIN);
304 * verify a MinMax node
306 static int verify_node_MinMax(ir_node *n, ir_graph *irg) {
307 ir_mode *mymode = get_irn_mode(n);
308 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
309 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
313 /* MinMax: BB x numP x numP --> numP */
316 mode_is_data(mymode),
323 * initialize the ops.
325 void firm_archops_init(const arch_ops_info *info)
330 info = &default_settings;
332 memcpy(&settings, info, sizeof(settings));
334 if (info->enabled_ops & ARCH_OPS_MINMAX) {
335 memset(&ops, 0, sizeof(ops));
337 op_Min->ops.computed_value = computed_value_Min;
338 op_Min->ops.equivalent_node = equivalent_node_Min;
339 op_Min->ops.verify_node = verify_node_MinMax;
341 op_Max->ops.computed_value = computed_value_Max;
342 op_Max->ops.equivalent_node = equivalent_node_Max;
343 op_Max->ops.verify_node = verify_node_MinMax;