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
32 #include "irgraph_t.h"
37 #include "firm_common_t.h"
39 #include "iropt_dbg.h"
44 /* when we need verifying */
46 # define IRN_VRFY_IRG(res, irg)
48 # define IRN_VRFY_IRG(res, irg) irn_vrfy_irg(res, irg)
51 /** current settings */
52 static arch_ops_info settings;
54 /** default settings */
55 static const arch_ops_info default_settings = {
61 * construct a Min: Min(a,b) = a < b ? a : b
64 new_rd_Min(dbg_info *db, ir_graph *irg, ir_node *block,
65 ir_node *op1, ir_node *op2, ir_mode *mode)
71 panic("cannot create Min node, not allowed");
76 res = new_ir_node(db, irg, block, op_Min, mode, 2, in);
77 res = optimize_node(res);
78 IRN_VRFY_IRG(res, irg);
83 * construct a Max: Max(a,b) = a > b ? a : b
86 new_rd_Max(dbg_info *db, ir_graph *irg, ir_node *block,
87 ir_node *op1, ir_node *op2, ir_mode *mode)
93 panic("cannot create Max node, not allowed");
98 res = new_ir_node(db, irg, block, op_Max, mode, 2, in);
99 res = optimize_node(res);
100 IRN_VRFY_IRG(res, irg);
105 new_r_Min(ir_graph *irg, ir_node *block,
106 ir_node *op1, ir_node *op2, ir_mode *mode) {
107 return new_rd_Min(NULL, irg, block, op1, op2, mode);
111 new_r_Max(ir_graph *irg, ir_node *block,
112 ir_node *op1, ir_node *op2, ir_mode *mode) {
113 return new_rd_Max(NULL, irg, block, op1, op2, mode);
117 new_d_Min(dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode) {
118 return new_rd_Min(db, current_ir_graph, current_ir_graph->current_block,
123 new_d_Max(dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode) {
124 return new_rd_Max(db, current_ir_graph, current_ir_graph->current_block,
129 new_Min(ir_node *op1, ir_node *op2, ir_mode *mode) {
130 return new_d_Min(NULL, op1, op2, mode);
134 new_Max(ir_node *op1, ir_node *op2, ir_mode *mode) {
135 return new_d_Max(NULL, op1, op2, mode);
141 * return the value of a Min
143 static tarval *computed_value_Min(const ir_node *n) {
144 ir_node *a = get_binop_left(n);
145 ir_node *b = get_binop_right(n);
147 tarval *ta = value_of(a);
148 tarval *tb = value_of(b);
150 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
151 pn_Cmp res = tarval_cmp(ta, tb);
153 /* beware: there might be Unordered tarvals here, in that
154 * case let the backend decide, do NOT optimize */
155 if (res == pn_Cmp_Lt)
157 if (res == pn_Cmp_Gt || res == pn_Cmp_Eq)
164 * return the value of a Max
166 static tarval *computed_value_Max(const ir_node *n) {
167 ir_node *a = get_binop_left(n);
168 ir_node *b = get_binop_right(n);
170 tarval *tb = value_of(b);
171 tarval *ta = value_of(a);
173 if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
174 pn_Cmp res = tarval_cmp(ta, tb);
176 /* beware: there might be Unordered tarvals here, in that
177 * case let the backend decide, do NOT optimize */
178 if (res == pn_Cmp_Gt)
180 if (res == pn_Cmp_Lt || res == pn_Cmp_Eq)
187 * Returns an equivalent node for a Min/Max node.
188 * We do not allow Exceptions in our Min/Max, so there will be always
190 * The problem is Min(NaN, NaN) == NaN ???.
192 static ir_node *equivalent_node_MinMax(ir_node *n)
198 if (settings.minmax_handle_NaN == 0 && mode_is_float(get_irn_mode(n)))
201 a = get_binop_left(n);
202 b = get_binop_right(n);
205 DBG_OPT_ALGSIM0(n, a, FS_OPT_MIN_MAX_EQ);
209 mode = get_irn_mode(n);
210 tv = n->op == op_Max ? get_mode_min(mode) : get_mode_max(mode);
212 if (value_of(b) == tv) {
213 DBG_OPT_ALGSIM0(n, a, FS_OPT_MIN_MAX_EQ);
216 if (value_of(a) == tv) {
217 DBG_OPT_ALGSIM0(n, b, FS_OPT_MIN_MAX_EQ);
224 #define equivalent_node_Min equivalent_node_MinMax
225 #define equivalent_node_Max equivalent_node_MinMax
228 * Create Min and Max from Mux nodes
230 ir_node *arch_transform_node_Mux(ir_node *n)
232 if (settings.enabled_ops & ARCH_OPS_MINMAX) {
233 ir_node *oldn = n, *cmp, *proj = get_Mux_sel(n);
236 if (get_irn_op(proj) != op_Proj)
239 cmp = get_Proj_pred(proj);
241 ir_node *a = get_Cmp_left(cmp);
242 ir_node *b = get_Cmp_right(cmp);
243 ir_node *t = get_Mux_true(n);
244 ir_node *f = get_Mux_false(n);
246 proj_nr = get_Proj_proj(proj);
248 if (proj_nr == pn_Cmp_Lt || proj_nr == pn_Cmp_Le) {
249 if (a == t && b == f) {
250 /* a </<= b ? a : b ==> Min(a,b) */
251 n = new_rd_Min(get_irn_dbg_info(n),
257 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MIN);
260 else if (a == f && b == t) {
261 /* a </<= b ? b : a ==> Max(a,b) */
262 n = new_rd_Max(get_irn_dbg_info(n),
268 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MAX);
272 else if (proj_nr == pn_Cmp_Gt || proj_nr == pn_Cmp_Ge) {
273 if (a == t && b == f) {
274 /* a >/>= b ? a : b ==> Max(a,b) */
275 n = new_rd_Max(get_irn_dbg_info(n),
281 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MAX);
284 else if (a == f && b == t) {
285 /* a >/>= b ? b : a ==> Min(a,b) */
286 n = new_rd_Min(get_irn_dbg_info(n),
292 DBG_OPT_ALGSIM1(oldn, cmp, proj, n, FS_OPT_MUX_TO_MIN);
302 * verify a MinMax node
304 static int verify_node_MinMax(ir_node *n, ir_graph *irg) {
305 ir_mode *mymode = get_irn_mode(n);
306 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
307 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
311 /* MinMax: BB x numP x numP --> numP */
314 mode_is_data(mymode),
321 * initialize the ops.
323 void firm_archops_init(const arch_ops_info *info)
328 info = &default_settings;
330 memcpy(&settings, info, sizeof(settings));
332 if (info->enabled_ops & ARCH_OPS_MINMAX) {
333 memset(&ops, 0, sizeof(ops));
335 op_Min->ops.computed_value = computed_value_Min;
336 op_Min->ops.equivalent_node = equivalent_node_Min;
337 op_Min->ops.verify_node = verify_node_MinMax;
339 op_Max->ops.computed_value = computed_value_Max;
340 op_Max->ops.equivalent_node = equivalent_node_Max;
341 op_Max->ops.verify_node = verify_node_MinMax;