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 Lower Double word operations, ie 64bit -> 32bit, 32bit -> 16bit etc.
24 * @author Michael Beck
36 #include "irgraph_t.h"
41 #include "dbginfo_t.h"
42 #include "iropt_dbg.h"
57 /** A map from mode to a primitive type. */
58 static pmap *prim_types;
60 /** A map from (op, imode, omode) to Intrinsic functions entities. */
61 static set *intrinsic_fkt;
63 /** A map from (imode, omode) to conv function types. */
64 static set *conv_types;
66 /** A map from a method type to its lowered type. */
67 static pmap *lowered_type;
69 /** The types for the binop and unop intrinsics. */
70 static ir_type *binop_tp_u, *binop_tp_s, *unop_tp_u, *unop_tp_s, *shiftop_tp_u, *shiftop_tp_s, *tp_s, *tp_u;
72 /** the debug handle */
73 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
76 * An entry in the (op, imode, omode) -> entity map.
78 typedef struct _op_mode_entry {
79 const ir_op *op; /**< the op */
80 const ir_mode *imode; /**< the input mode */
81 const ir_mode *omode; /**< the output mode */
82 ir_entity *ent; /**< the associated entity of this (op, imode, omode) triple */
86 * An entry in the (imode, omode) -> tp map.
88 typedef struct _conv_tp_entry {
89 const ir_mode *imode; /**< the input mode */
90 const ir_mode *omode; /**< the output mode */
91 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
95 * Every double word node will be replaced,
96 * we need some store to hold the replacement:
98 typedef struct _node_entry_t {
99 ir_node *low_word; /**< the low word */
100 ir_node *high_word; /**< the high word */
104 MUST_BE_LOWERED = 1, /**< graph must be lowered */
105 CF_CHANGED = 2, /**< control flow was changed */
109 * The lower environment.
111 typedef struct _lower_env_t {
112 node_entry_t **entries; /**< entries per node */
113 struct obstack obst; /**< an obstack holding the temporary data */
114 ir_type *l_mtp; /**< lowered method type of the current method */
115 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
116 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
117 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
118 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
119 ident *first_id; /**< .l for little and .h for big endian */
120 ident *next_id; /**< .h for little and .l for big endian */
121 const lwrdw_param_t *params; /**< transformation parameter */
122 unsigned flags; /**< some flags */
123 int n_entries; /**< number of entries */
124 ir_type *value_param_tp; /**< the old value param type */
128 * Get a primitive mode for a mode.
130 static ir_type *get_primitive_type(ir_mode *mode) {
131 pmap_entry *entry = pmap_find(prim_types, mode);
138 snprintf(buf, sizeof(buf), "_prim_%s", get_mode_name(mode));
139 tp = new_type_primitive(mode);
141 pmap_insert(prim_types, mode, tp);
143 } /* get_primitive_type */
146 * Create a method type for a Conv emulation from imode to omode.
148 static ir_type *get_conv_type(ir_mode *imode, ir_mode *omode, lower_env_t *env) {
149 conv_tp_entry_t key, *entry;
156 entry = set_insert(conv_types, &key, sizeof(key), HASH_PTR(imode) ^ HASH_PTR(omode));
158 int n_param = 1, n_res = 1;
160 if (imode == env->params->high_signed || imode == env->params->high_unsigned)
162 if (omode == env->params->high_signed || omode == env->params->high_unsigned)
165 /* create a new one */
166 mtd = new_type_method(n_param, n_res);
168 /* set param types and result types */
170 if (imode == env->params->high_signed) {
171 set_method_param_type(mtd, n_param++, tp_u);
172 set_method_param_type(mtd, n_param++, tp_s);
173 } else if (imode == env->params->high_unsigned) {
174 set_method_param_type(mtd, n_param++, tp_u);
175 set_method_param_type(mtd, n_param++, tp_u);
177 ir_type *tp = get_primitive_type(imode);
178 set_method_param_type(mtd, n_param++, tp);
182 if (omode == env->params->high_signed) {
183 set_method_res_type(mtd, n_res++, tp_u);
184 set_method_res_type(mtd, n_res++, tp_s);
185 } else if (omode == env->params->high_unsigned) {
186 set_method_res_type(mtd, n_res++, tp_u);
187 set_method_res_type(mtd, n_res++, tp_u);
189 ir_type *tp = get_primitive_type(omode);
190 set_method_res_type(mtd, n_res++, tp);
197 } /* get_conv_type */
200 * Add an additional control flow input to a block.
201 * Patch all Phi nodes. The new Phi inputs are copied from
202 * old input number nr.
204 static void add_block_cf_input_nr(ir_node *block, int nr, ir_node *cf)
206 int i, arity = get_irn_arity(block);
211 NEW_ARR_A(ir_node *, in, arity + 1);
212 for (i = 0; i < arity; ++i)
213 in[i] = get_irn_n(block, i);
216 set_irn_in(block, i + 1, in);
218 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
219 for (i = 0; i < arity; ++i)
220 in[i] = get_irn_n(phi, i);
222 set_irn_in(phi, i + 1, in);
224 } /* add_block_cf_input_nr */
227 * Add an additional control flow input to a block.
228 * Patch all Phi nodes. The new Phi inputs are copied from
229 * old input from cf tmpl.
231 static void add_block_cf_input(ir_node *block, ir_node *tmpl, ir_node *cf)
233 int i, arity = get_irn_arity(block);
236 for (i = 0; i < arity; ++i) {
237 if (get_irn_n(block, i) == tmpl) {
243 add_block_cf_input_nr(block, nr, cf);
244 } /* add_block_cf_input */
247 * Return the "operational" mode of a Firm node.
249 static ir_mode *get_irn_op_mode(ir_node *node)
251 switch (get_irn_opcode(node)) {
253 return get_Load_mode(node);
255 return get_irn_mode(get_Store_value(node));
257 return get_irn_mode(get_DivMod_left(node));
259 return get_irn_mode(get_Div_left(node));
261 return get_irn_mode(get_Mod_left(node));
263 return get_irn_mode(get_Cmp_left(node));
265 return get_irn_mode(node);
267 } /* get_irn_op_mode */
270 * Walker, prepare the node links.
272 static void prepare_links(ir_node *node, void *env)
274 lower_env_t *lenv = env;
275 ir_mode *mode = get_irn_op_mode(node);
279 if (mode == lenv->params->high_signed ||
280 mode == lenv->params->high_unsigned) {
281 /* ok, found a node that will be lowered */
282 link = OALLOCZ(&lenv->obst, node_entry_t);
284 idx = get_irn_idx(node);
285 if (idx >= lenv->n_entries) {
286 /* enlarge: this happens only for Rotl nodes which is RARELY */
287 int old = lenv->n_entries;
288 int n_idx = idx + (idx >> 3);
290 ARR_RESIZE(node_entry_t *, lenv->entries, n_idx);
291 memset(&lenv->entries[old], 0, (n_idx - old) * sizeof(lenv->entries[0]));
292 lenv->n_entries = n_idx;
294 lenv->entries[idx] = link;
295 lenv->flags |= MUST_BE_LOWERED;
296 } else if (is_Conv(node)) {
297 /* Conv nodes have two modes */
298 ir_node *pred = get_Conv_op(node);
299 mode = get_irn_mode(pred);
301 if (mode == lenv->params->high_signed ||
302 mode == lenv->params->high_unsigned) {
303 /* must lower this node either but don't need a link */
304 lenv->flags |= MUST_BE_LOWERED;
310 /* link all Proj nodes to its predecessor:
311 Note that Tuple Proj's and its Projs are linked either. */
312 ir_node *pred = get_Proj_pred(node);
314 set_irn_link(node, get_irn_link(pred));
315 set_irn_link(pred, node);
316 } else if (is_Phi(node)) {
317 /* link all Phi nodes to its block */
318 ir_node *block = get_nodes_block(node);
319 add_Block_phi(block, node);
320 } else if (is_Block(node)) {
321 /* fill the Proj -> Block map */
322 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
323 ir_node *pred = get_Block_cfgpred(node, i);
326 pmap_insert(lenv->proj_2_block, pred, node);
329 } /* prepare_links */
332 * Translate a Constant: create two.
334 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env) {
335 tarval *tv, *tv_l, *tv_h;
337 dbg_info *dbg = get_irn_dbg_info(node);
339 ir_graph *irg = current_ir_graph;
340 ir_mode *low_mode = env->params->low_unsigned;
342 tv = get_Const_tarval(node);
344 tv_l = tarval_convert_to(tv, low_mode);
345 low = new_rd_Const(dbg, irg, tv_l);
347 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
348 high = new_rd_Const(dbg, irg, tv_h);
350 idx = get_irn_idx(node);
351 assert(idx < env->n_entries);
352 env->entries[idx]->low_word = low;
353 env->entries[idx]->high_word = high;
357 * Translate a Load: create two.
359 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env) {
360 ir_mode *low_mode = env->params->low_unsigned;
361 ir_graph *irg = current_ir_graph;
362 ir_node *adr = get_Load_ptr(node);
363 ir_node *mem = get_Load_mem(node);
364 ir_node *low, *high, *proj;
366 ir_node *block = get_nodes_block(node);
368 ir_cons_flags volatility = get_Load_volatility(node) == volatility_is_volatile
371 if (env->params->little_endian) {
373 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
375 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
379 /* create two loads */
380 dbg = get_irn_dbg_info(node);
381 low = new_rd_Load(dbg, block, mem, low, low_mode, volatility);
382 proj = new_r_Proj(block, low, mode_M, pn_Load_M);
383 high = new_rd_Load(dbg, block, proj, high, mode, volatility);
385 idx = get_irn_idx(node);
386 assert(idx < env->n_entries);
387 env->entries[idx]->low_word = low;
388 env->entries[idx]->high_word = high;
390 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
391 idx = get_irn_idx(proj);
393 switch (get_Proj_proj(proj)) {
394 case pn_Load_M: /* Memory result. */
395 /* put it to the second one */
396 set_Proj_pred(proj, high);
398 case pn_Load_X_except: /* Execution result if exception occurred. */
399 /* put it to the first one */
400 set_Proj_pred(proj, low);
402 case pn_Load_res: /* Result of load operation. */
403 assert(idx < env->n_entries);
404 env->entries[idx]->low_word = new_r_Proj(block, low, low_mode, pn_Load_res);
405 env->entries[idx]->high_word = new_r_Proj(block, high, mode, pn_Load_res);
408 assert(0 && "unexpected Proj number");
410 /* mark this proj: we have handled it already, otherwise we might fall into
412 mark_irn_visited(proj);
417 * Translate a Store: create two.
419 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env) {
421 ir_node *block, *adr, *mem;
422 ir_node *low, *high, *irn, *proj;
426 ir_cons_flags volatility = get_Store_volatility(node) == volatility_is_volatile
430 irn = get_Store_value(node);
431 entry = env->entries[get_irn_idx(irn)];
434 if (! entry->low_word) {
435 /* not ready yet, wait */
436 pdeq_putr(env->waitq, node);
440 irg = current_ir_graph;
441 adr = get_Store_ptr(node);
442 mem = get_Store_mem(node);
443 block = get_nodes_block(node);
445 if (env->params->little_endian) {
447 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
449 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
453 /* create two Stores */
454 dbg = get_irn_dbg_info(node);
455 low = new_rd_Store(dbg, block, mem, low, entry->low_word, volatility);
456 proj = new_r_Proj(block, low, mode_M, pn_Store_M);
457 high = new_rd_Store(dbg, block, proj, high, entry->high_word, volatility);
459 idx = get_irn_idx(node);
460 assert(idx < env->n_entries);
461 env->entries[idx]->low_word = low;
462 env->entries[idx]->high_word = high;
464 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
465 idx = get_irn_idx(proj);
467 switch (get_Proj_proj(proj)) {
468 case pn_Store_M: /* Memory result. */
469 /* put it to the second one */
470 set_Proj_pred(proj, high);
472 case pn_Store_X_except: /* Execution result if exception occurred. */
473 /* put it to the first one */
474 set_Proj_pred(proj, low);
477 assert(0 && "unexpected Proj number");
479 /* mark this proj: we have handled it already, otherwise we might fall into
481 mark_irn_visited(proj);
486 * Return a node containing the address of the intrinsic emulation function.
488 * @param method the method type of the emulation function
489 * @param op the emulated ir_op
490 * @param imode the input mode of the emulated opcode
491 * @param omode the output mode of the emulated opcode
492 * @param env the lower environment
494 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
495 ir_mode *imode, ir_mode *omode,
499 op_mode_entry_t key, *entry;
506 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
507 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
509 /* create a new one */
510 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
512 assert(ent && "Intrinsic creator must return an entity");
518 return new_r_SymConst(current_ir_graph, mode_P_code, sym, symconst_addr_ent);
519 } /* get_intrinsic_address */
524 * Create an intrinsic Call.
526 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env) {
527 ir_node *block, *irn, *call, *proj;
535 irn = get_Div_left(node);
536 entry = env->entries[get_irn_idx(irn)];
539 if (! entry->low_word) {
540 /* not ready yet, wait */
541 pdeq_putr(env->waitq, node);
545 in[0] = entry->low_word;
546 in[1] = entry->high_word;
548 irn = get_Div_right(node);
549 entry = env->entries[get_irn_idx(irn)];
552 if (! entry->low_word) {
553 /* not ready yet, wait */
554 pdeq_putr(env->waitq, node);
558 in[2] = entry->low_word;
559 in[3] = entry->high_word;
561 dbg = get_irn_dbg_info(node);
562 block = get_nodes_block(node);
564 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
565 opmode = get_irn_op_mode(node);
566 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
567 call = new_rd_Call(dbg, block, get_Div_mem(node), irn, 4, in, mtp);
568 set_irn_pinned(call, get_irn_pinned(node));
569 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
571 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
572 switch (get_Proj_proj(proj)) {
573 case pn_Div_M: /* Memory result. */
574 /* reroute to the call */
575 set_Proj_pred(proj, call);
576 set_Proj_proj(proj, pn_Call_M);
578 case pn_Div_X_except: /* Execution result if exception occurred. */
579 /* reroute to the call */
580 set_Proj_pred(proj, call);
581 set_Proj_proj(proj, pn_Call_X_except);
583 case pn_Div_res: /* Result of computation. */
584 idx = get_irn_idx(proj);
585 assert(idx < env->n_entries);
586 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
587 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
590 assert(0 && "unexpected Proj number");
592 /* mark this proj: we have handled it already, otherwise we might fall into
594 mark_irn_visited(proj);
601 * Create an intrinsic Call.
603 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env) {
604 ir_node *block, *proj, *irn, *call;
612 irn = get_Mod_left(node);
613 entry = env->entries[get_irn_idx(irn)];
616 if (! entry->low_word) {
617 /* not ready yet, wait */
618 pdeq_putr(env->waitq, node);
622 in[0] = entry->low_word;
623 in[1] = entry->high_word;
625 irn = get_Mod_right(node);
626 entry = env->entries[get_irn_idx(irn)];
629 if (! entry->low_word) {
630 /* not ready yet, wait */
631 pdeq_putr(env->waitq, node);
635 in[2] = entry->low_word;
636 in[3] = entry->high_word;
638 dbg = get_irn_dbg_info(node);
639 block = get_nodes_block(node);
641 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
642 opmode = get_irn_op_mode(node);
643 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
644 call = new_rd_Call(dbg, block, get_Mod_mem(node), irn, 4, in, mtp);
645 set_irn_pinned(call, get_irn_pinned(node));
646 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
648 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
649 switch (get_Proj_proj(proj)) {
650 case pn_Mod_M: /* Memory result. */
651 /* reroute to the call */
652 set_Proj_pred(proj, call);
653 set_Proj_proj(proj, pn_Call_M);
655 case pn_Mod_X_except: /* Execution result if exception occurred. */
656 /* reroute to the call */
657 set_Proj_pred(proj, call);
658 set_Proj_proj(proj, pn_Call_X_except);
660 case pn_Mod_res: /* Result of computation. */
661 idx = get_irn_idx(proj);
662 assert(idx < env->n_entries);
663 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
664 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
667 assert(0 && "unexpected Proj number");
669 /* mark this proj: we have handled it already, otherwise we might fall into
671 mark_irn_visited(proj);
676 * Translate a DivMod.
678 * Create two intrinsic Calls.
680 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env) {
681 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
682 ir_node *resDiv = NULL;
683 ir_node *resMod = NULL;
692 /* check if both results are needed */
693 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
694 switch (get_Proj_proj(proj)) {
695 case pn_DivMod_res_div: flags |= 1; break;
696 case pn_DivMod_res_mod: flags |= 2; break;
701 irn = get_DivMod_left(node);
702 entry = env->entries[get_irn_idx(irn)];
705 if (! entry->low_word) {
706 /* not ready yet, wait */
707 pdeq_putr(env->waitq, node);
711 in[0] = entry->low_word;
712 in[1] = entry->high_word;
714 irn = get_DivMod_right(node);
715 entry = env->entries[get_irn_idx(irn)];
718 if (! entry->low_word) {
719 /* not ready yet, wait */
720 pdeq_putr(env->waitq, node);
724 in[2] = entry->low_word;
725 in[3] = entry->high_word;
727 dbg = get_irn_dbg_info(node);
728 block = get_nodes_block(node);
730 mem = get_DivMod_mem(node);
732 callDiv = callMod = NULL;
733 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
735 opmode = get_irn_op_mode(node);
736 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, env);
737 callDiv = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
738 set_irn_pinned(callDiv, get_irn_pinned(node));
739 resDiv = new_r_Proj(block, callDiv, mode_T, pn_Call_T_result);
743 mem = new_r_Proj(block, callDiv, mode_M, pn_Call_M);
744 opmode = get_irn_op_mode(node);
745 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, env);
746 callMod = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
747 set_irn_pinned(callMod, get_irn_pinned(node));
748 resMod = new_r_Proj(block, callMod, mode_T, pn_Call_T_result);
751 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
752 switch (get_Proj_proj(proj)) {
753 case pn_DivMod_M: /* Memory result. */
754 /* reroute to the first call */
755 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
756 set_Proj_proj(proj, pn_Call_M);
758 case pn_DivMod_X_except: /* Execution result if exception occurred. */
759 /* reroute to the first call */
760 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
761 set_Proj_proj(proj, pn_Call_X_except);
763 case pn_DivMod_res_div: /* Result of Div. */
764 idx = get_irn_idx(proj);
765 assert(idx < env->n_entries);
766 env->entries[idx]->low_word = new_r_Proj(block, resDiv, env->params->low_unsigned, 0);
767 env->entries[idx]->high_word = new_r_Proj(block, resDiv, mode, 1);
769 case pn_DivMod_res_mod: /* Result of Mod. */
770 idx = get_irn_idx(proj);
771 env->entries[idx]->low_word = new_r_Proj(block, resMod, env->params->low_unsigned, 0);
772 env->entries[idx]->high_word = new_r_Proj(block, resMod, mode, 1);
775 assert(0 && "unexpected Proj number");
777 /* mark this proj: we have handled it already, otherwise we might fall into
779 mark_irn_visited(proj);
786 * Create an intrinsic Call.
788 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env) {
789 ir_node *block, *irn;
797 irn = get_binop_left(node);
798 entry = env->entries[get_irn_idx(irn)];
801 if (! entry->low_word) {
802 /* not ready yet, wait */
803 pdeq_putr(env->waitq, node);
807 in[0] = entry->low_word;
808 in[1] = entry->high_word;
810 irn = get_binop_right(node);
811 entry = env->entries[get_irn_idx(irn)];
814 if (! entry->low_word) {
815 /* not ready yet, wait */
816 pdeq_putr(env->waitq, node);
820 in[2] = entry->low_word;
821 in[3] = entry->high_word;
823 dbg = get_irn_dbg_info(node);
824 block = get_nodes_block(node);
825 irg = current_ir_graph;
827 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
828 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
829 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
831 set_irn_pinned(irn, get_irn_pinned(node));
832 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
834 idx = get_irn_idx(node);
835 assert(idx < env->n_entries);
836 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
837 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
841 * Translate a Shiftop.
843 * Create an intrinsic Call.
845 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env) {
846 ir_node *block, *irn;
854 irn = get_binop_left(node);
855 entry = env->entries[get_irn_idx(irn)];
858 if (! entry->low_word) {
859 /* not ready yet, wait */
860 pdeq_putr(env->waitq, node);
864 in[0] = entry->low_word;
865 in[1] = entry->high_word;
867 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
868 in[2] = get_binop_right(node);
870 dbg = get_irn_dbg_info(node);
871 block = get_nodes_block(node);
872 irg = current_ir_graph;
874 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
875 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
876 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
878 set_irn_pinned(irn, get_irn_pinned(node));
879 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
881 idx = get_irn_idx(node);
882 assert(idx < env->n_entries);
883 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
884 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
885 } /* lower_Shiftop */
888 * Translate a Shr and handle special cases.
890 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env) {
891 ir_node *right = get_Shr_right(node);
892 ir_graph *irg = current_ir_graph;
894 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
895 tarval *tv = get_Const_tarval(right);
897 if (tarval_is_long(tv) &&
898 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
899 ir_node *block = get_nodes_block(node);
900 ir_node *left = get_Shr_left(node);
902 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
903 int idx = get_irn_idx(left);
905 left = env->entries[idx]->high_word;
906 idx = get_irn_idx(node);
909 c = new_r_Const_long(irg, env->params->low_unsigned, shf_cnt);
910 env->entries[idx]->low_word = new_r_Shr(block, left, c, mode);
912 env->entries[idx]->low_word = left;
914 env->entries[idx]->high_word = new_r_Const(irg, get_mode_null(mode));
919 lower_Shiftop(node, mode, env);
923 * Translate a Shl and handle special cases.
925 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env) {
926 ir_node *right = get_Shl_right(node);
927 ir_graph *irg = current_ir_graph;
929 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
930 tarval *tv = get_Const_tarval(right);
932 if (tarval_is_long(tv) &&
933 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
935 ir_node *block = get_nodes_block(node);
936 ir_node *left = get_Shl_left(node);
938 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
939 int idx = get_irn_idx(left);
941 left = new_r_Conv(block, env->entries[idx]->low_word, mode);
942 idx = get_irn_idx(node);
944 mode_l = env->params->low_unsigned;
946 c = new_r_Const_long(irg, mode_l, shf_cnt);
947 env->entries[idx]->high_word = new_r_Shl(block, left, c, mode);
949 env->entries[idx]->high_word = left;
951 env->entries[idx]->low_word = new_r_Const(irg, get_mode_null(mode_l));
956 lower_Shiftop(node, mode, env);
960 * Translate a Shrs and handle special cases.
962 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env) {
963 ir_node *right = get_Shrs_right(node);
964 ir_graph *irg = current_ir_graph;
966 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
967 tarval *tv = get_Const_tarval(right);
969 if (tarval_is_long(tv) &&
970 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
971 ir_node *block = get_nodes_block(node);
972 ir_node *left = get_Shrs_left(node);
973 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
974 int idx = get_irn_idx(left);
979 left = env->entries[idx]->high_word;
980 idx = get_irn_idx(node);
982 mode_l = env->params->low_unsigned;
984 c = new_r_Const_long(irg, mode_l, shf_cnt);
985 low = new_r_Shrs(block, left, c, mode);
989 /* low word is expected to have mode_l */
990 env->entries[idx]->low_word = new_r_Conv(block, low, mode_l);
992 c = new_r_Const_long(irg, mode_l, get_mode_size_bits(mode) - 1);
993 env->entries[idx]->high_word = new_r_Shrs(block, left, c, mode);
998 lower_Shiftop(node, mode, env);
1002 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1004 static void prepare_links_and_handle_rotl(ir_node *node, void *env) {
1005 lower_env_t *lenv = env;
1007 if (is_Rotl(node)) {
1008 ir_mode *mode = get_irn_op_mode(node);
1009 if (mode == lenv->params->high_signed ||
1010 mode == lenv->params->high_unsigned) {
1011 ir_node *right = get_Rotl_right(node);
1012 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1013 ir_mode *omode, *rmode;
1015 optimization_state_t state;
1017 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1018 tarval *tv = get_Const_tarval(right);
1020 if (tarval_is_long(tv) &&
1021 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1022 /* will be optimized in lower_Rotl() */
1027 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1028 dbg = get_irn_dbg_info(node);
1029 omode = get_irn_mode(node);
1030 left = get_Rotl_left(node);
1031 block = get_nodes_block(node);
1032 shl = new_rd_Shl(dbg, block, left, right, omode);
1033 rmode = get_irn_mode(right);
1034 c = new_Const_long(rmode, get_mode_size_bits(omode));
1035 sub = new_rd_Sub(dbg, block, c, right, rmode);
1036 shr = new_rd_Shr(dbg, block, left, sub, omode);
1038 /* optimization must be switched off here, or we will get the Rotl back */
1039 save_optimization_state(&state);
1040 set_opt_algebraic_simplification(0);
1041 or = new_rd_Or(dbg, block, shl, shr, omode);
1042 restore_optimization_state(&state);
1046 /* do lowering on the new nodes */
1047 prepare_links(shl, env);
1048 prepare_links(c, env);
1049 prepare_links(sub, env);
1050 prepare_links(shr, env);
1051 prepare_links(or, env);
1054 prepare_links(node, env);
1059 * Translate a special case Rotl(x, sizeof(w)).
1061 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env) {
1062 ir_node *right = get_Rotl_right(node);
1063 ir_node *left = get_Rotl_left(node);
1065 int idx = get_irn_idx(left);
1069 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1070 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1071 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1073 l = env->entries[idx]->low_word;
1074 h = env->entries[idx]->high_word;
1075 idx = get_irn_idx(node);
1077 env->entries[idx]->low_word = h;
1078 env->entries[idx]->high_word = l;
1082 * Translate an Unop.
1084 * Create an intrinsic Call.
1086 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env) {
1087 ir_node *block, *irn;
1092 node_entry_t *entry;
1094 irn = get_unop_op(node);
1095 entry = env->entries[get_irn_idx(irn)];
1098 if (! entry->low_word) {
1099 /* not ready yet, wait */
1100 pdeq_putr(env->waitq, node);
1104 in[0] = entry->low_word;
1105 in[1] = entry->high_word;
1107 dbg = get_irn_dbg_info(node);
1108 block = get_nodes_block(node);
1110 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1111 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
1112 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
1114 set_irn_pinned(irn, get_irn_pinned(node));
1115 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
1117 idx = get_irn_idx(node);
1118 assert(idx < env->n_entries);
1119 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
1120 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
1124 * Translate a logical Binop.
1126 * Create two logical Binops.
1128 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1129 ir_node *(*constr_rd)(dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1130 ir_node *block, *irn;
1131 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1135 node_entry_t *entry;
1137 irn = get_binop_left(node);
1138 entry = env->entries[get_irn_idx(irn)];
1141 if (! entry->low_word) {
1142 /* not ready yet, wait */
1143 pdeq_putr(env->waitq, node);
1147 lop_l = entry->low_word;
1148 lop_h = entry->high_word;
1150 irn = get_binop_right(node);
1151 entry = env->entries[get_irn_idx(irn)];
1154 if (! entry->low_word) {
1155 /* not ready yet, wait */
1156 pdeq_putr(env->waitq, node);
1160 rop_l = entry->low_word;
1161 rop_h = entry->high_word;
1163 dbg = get_irn_dbg_info(node);
1164 block = get_nodes_block(node);
1166 idx = get_irn_idx(node);
1167 assert(idx < env->n_entries);
1168 irg = current_ir_graph;
1169 env->entries[idx]->low_word = constr_rd(dbg, block, lop_l, rop_l, env->params->low_unsigned);
1170 env->entries[idx]->high_word = constr_rd(dbg, block, lop_h, rop_h, mode);
1171 } /* lower_Binop_logical */
1173 /** create a logical operation transformation */
1174 #define lower_logical(op) \
1175 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1176 lower_Binop_logical(node, mode, env, new_rd_##op); \
1186 * Create two logical Nots.
1188 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env) {
1189 ir_node *block, *irn;
1190 ir_node *op_l, *op_h;
1193 node_entry_t *entry;
1195 irn = get_Not_op(node);
1196 entry = env->entries[get_irn_idx(irn)];
1199 if (! entry->low_word) {
1200 /* not ready yet, wait */
1201 pdeq_putr(env->waitq, node);
1205 op_l = entry->low_word;
1206 op_h = entry->high_word;
1208 dbg = get_irn_dbg_info(node);
1209 block = get_nodes_block(node);
1211 idx = get_irn_idx(node);
1212 assert(idx < env->n_entries);
1213 env->entries[idx]->low_word = new_rd_Not(dbg, block, op_l, env->params->low_unsigned);
1214 env->entries[idx]->high_word = new_rd_Not(dbg, block, op_h, mode);
1220 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env) {
1221 ir_node *cmp, *left, *right, *block;
1222 ir_node *sel = get_Cond_selector(node);
1223 ir_mode *m = get_irn_mode(sel);
1228 node_entry_t *lentry, *rentry;
1229 ir_node *proj, *projT = NULL, *projF = NULL;
1230 ir_node *new_bl, *cmpH, *cmpL, *irn;
1231 ir_node *projHF, *projHT;
1240 cmp = get_Proj_pred(sel);
1244 left = get_Cmp_left(cmp);
1245 idx = get_irn_idx(left);
1246 lentry = env->entries[idx];
1253 right = get_Cmp_right(cmp);
1254 idx = get_irn_idx(right);
1255 rentry = env->entries[idx];
1258 if (! lentry->low_word || !rentry->low_word) {
1260 pdeq_putr(env->waitq, node);
1264 /* all right, build the code */
1265 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1266 long proj_nr = get_Proj_proj(proj);
1268 if (proj_nr == pn_Cond_true) {
1269 assert(projT == NULL && "more than one Proj(true)");
1272 assert(proj_nr == pn_Cond_false);
1273 assert(projF == NULL && "more than one Proj(false)");
1276 mark_irn_visited(proj);
1278 assert(projT && projF);
1280 /* create a new high compare */
1281 block = get_nodes_block(node);
1282 irg = get_Block_irg(block);
1283 dbg = get_irn_dbg_info(cmp);
1284 pnc = get_Proj_proj(sel);
1286 if (is_Const(right) && is_Const_null(right)) {
1287 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1288 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1289 ir_mode *mode = env->params->low_unsigned;
1290 ir_node *low = new_r_Conv(block, lentry->low_word, mode);
1291 ir_node *high = new_r_Conv(block, lentry->high_word, mode);
1292 ir_node *or = new_rd_Or(dbg, block, low, high, mode);
1293 ir_node *cmp = new_rd_Cmp(dbg, block, or, new_Const_long(mode, 0));
1295 ir_node *proj = new_r_Proj(block, cmp, mode_b, pnc);
1296 set_Cond_selector(node, proj);
1301 cmpH = new_rd_Cmp(dbg, block, lentry->high_word, rentry->high_word);
1303 if (pnc == pn_Cmp_Eq) {
1304 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1305 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1308 dst_blk = entry->value;
1310 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Eq);
1311 dbg = get_irn_dbg_info(node);
1312 irn = new_rd_Cond(dbg, block, irn);
1314 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1315 mark_irn_visited(projHF);
1316 exchange(projF, projHF);
1318 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1319 mark_irn_visited(projHT);
1321 new_bl = new_r_Block(irg, 1, &projHT);
1323 dbg = get_irn_dbg_info(cmp);
1324 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1325 irn = new_r_Proj(new_bl, cmpL, mode_b, pn_Cmp_Eq);
1326 dbg = get_irn_dbg_info(node);
1327 irn = new_rd_Cond(dbg, new_bl, irn);
1329 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_false);
1330 mark_irn_visited(proj);
1331 add_block_cf_input(dst_blk, projHF, proj);
1333 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_true);
1334 mark_irn_visited(proj);
1335 exchange(projT, proj);
1336 } else if (pnc == pn_Cmp_Lg) {
1337 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1338 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1341 dst_blk = entry->value;
1343 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Lg);
1344 dbg = get_irn_dbg_info(node);
1345 irn = new_rd_Cond(dbg, block, irn);
1347 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1348 mark_irn_visited(projHT);
1349 exchange(projT, projHT);
1351 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1352 mark_irn_visited(projHF);
1354 new_bl = new_r_Block(irg, 1, &projHF);
1356 dbg = get_irn_dbg_info(cmp);
1357 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1358 irn = new_r_Proj(new_bl, cmpL, mode_b, pn_Cmp_Lg);
1359 dbg = get_irn_dbg_info(node);
1360 irn = new_rd_Cond(dbg, new_bl, irn);
1362 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_true);
1363 mark_irn_visited(proj);
1364 add_block_cf_input(dst_blk, projHT, proj);
1366 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_false);
1367 mark_irn_visited(proj);
1368 exchange(projF, proj);
1370 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1371 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1374 entry = pmap_find(env->proj_2_block, projT);
1376 dstT = entry->value;
1378 entry = pmap_find(env->proj_2_block, projF);
1380 dstF = entry->value;
1382 irn = new_r_Proj(block, cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1383 dbg = get_irn_dbg_info(node);
1384 irn = new_rd_Cond(dbg, block, irn);
1386 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1387 mark_irn_visited(projHT);
1388 exchange(projT, projHT);
1391 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1392 mark_irn_visited(projHF);
1394 newbl_eq = new_r_Block(irg, 1, &projHF);
1396 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Eq);
1397 irn = new_rd_Cond(dbg, newbl_eq, irn);
1399 proj = new_r_Proj(newbl_eq, irn, mode_X, pn_Cond_false);
1400 mark_irn_visited(proj);
1401 exchange(projF, proj);
1404 proj = new_r_Proj(newbl_eq, irn, mode_X, pn_Cond_true);
1405 mark_irn_visited(proj);
1407 newbl_l = new_r_Block(irg, 1, &proj);
1409 dbg = get_irn_dbg_info(cmp);
1410 cmpL = new_rd_Cmp(dbg, newbl_l, lentry->low_word, rentry->low_word);
1411 irn = new_r_Proj(newbl_l, cmpL, mode_b, pnc);
1412 dbg = get_irn_dbg_info(node);
1413 irn = new_rd_Cond(dbg, newbl_l, irn);
1415 proj = new_r_Proj(newbl_l, irn, mode_X, pn_Cond_true);
1416 mark_irn_visited(proj);
1417 add_block_cf_input(dstT, projT, proj);
1419 proj = new_r_Proj(newbl_l, irn, mode_X, pn_Cond_false);
1420 mark_irn_visited(proj);
1421 add_block_cf_input(dstF, projF, proj);
1424 /* we have changed the control flow */
1425 env->flags |= CF_CHANGED;
1427 idx = get_irn_idx(sel);
1429 if (env->entries[idx]) {
1431 Bad, a jump-table with double-word index.
1432 This should not happen, but if it does we handle
1433 it like a Conv were between (in other words, ignore
1437 if (! env->entries[idx]->low_word) {
1438 /* not ready yet, wait */
1439 pdeq_putr(env->waitq, node);
1442 set_Cond_selector(node, env->entries[idx]->low_word);
1448 * Translate a Conv to higher_signed
1450 static void lower_Conv_to_Ls(ir_node *node, lower_env_t *env) {
1451 ir_node *op = get_Conv_op(node);
1452 ir_mode *imode = get_irn_mode(op);
1453 ir_mode *dst_mode_l = env->params->low_unsigned;
1454 ir_mode *dst_mode_h = env->params->low_signed;
1455 int idx = get_irn_idx(node);
1456 ir_graph *irg = current_ir_graph;
1457 ir_node *block = get_nodes_block(node);
1458 dbg_info *dbg = get_irn_dbg_info(node);
1460 assert(idx < env->n_entries);
1462 if (mode_is_int(imode) || mode_is_reference(imode)) {
1463 if (imode == env->params->high_unsigned) {
1464 /* a Conv from Lu to Ls */
1465 int op_idx = get_irn_idx(op);
1467 if (! env->entries[op_idx]->low_word) {
1468 /* not ready yet, wait */
1469 pdeq_putr(env->waitq, node);
1472 env->entries[idx]->low_word = new_rd_Conv(dbg, block, env->entries[op_idx]->low_word, dst_mode_l);
1473 env->entries[idx]->high_word = new_rd_Conv(dbg, block, env->entries[op_idx]->high_word, dst_mode_h);
1475 /* simple case: create a high word */
1476 if (imode != dst_mode_l)
1477 op = new_rd_Conv(dbg, block, op, dst_mode_l);
1479 env->entries[idx]->low_word = op;
1481 if (mode_is_signed(imode)) {
1482 ir_node *op_conv = new_rd_Conv(dbg, block, op, dst_mode_h);
1483 env->entries[idx]->high_word = new_rd_Shrs(dbg, block, op_conv,
1484 new_Const_long(dst_mode_l, get_mode_size_bits(dst_mode_h) - 1), dst_mode_h);
1486 env->entries[idx]->high_word = new_Const(get_mode_null(dst_mode_h));
1490 ir_node *irn, *call;
1491 ir_mode *omode = env->params->high_signed;
1492 ir_type *mtp = get_conv_type(imode, omode, env);
1494 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1495 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1496 set_irn_pinned(call, get_irn_pinned(node));
1497 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1499 env->entries[idx]->low_word = new_r_Proj(block, irn, dst_mode_l, 0);
1500 env->entries[idx]->high_word = new_r_Proj(block, irn, dst_mode_h, 1);
1502 } /* lower_Conv_to_Ls */
1505 * Translate a Conv to higher_unsigned
1507 static void lower_Conv_to_Lu(ir_node *node, lower_env_t *env) {
1508 ir_node *op = get_Conv_op(node);
1509 ir_mode *imode = get_irn_mode(op);
1510 ir_mode *dst_mode = env->params->low_unsigned;
1511 int idx = get_irn_idx(node);
1512 ir_graph *irg = current_ir_graph;
1513 ir_node *block = get_nodes_block(node);
1514 dbg_info *dbg = get_irn_dbg_info(node);
1516 assert(idx < env->n_entries);
1518 if (mode_is_int(imode) || mode_is_reference(imode)) {
1519 if (imode == env->params->high_signed) {
1520 /* a Conv from Ls to Lu */
1521 int op_idx = get_irn_idx(op);
1523 if (! env->entries[op_idx]->low_word) {
1524 /* not ready yet, wait */
1525 pdeq_putr(env->waitq, node);
1528 env->entries[idx]->low_word = new_rd_Conv(dbg, block, env->entries[op_idx]->low_word, dst_mode);
1529 env->entries[idx]->high_word = new_rd_Conv(dbg, block, env->entries[op_idx]->high_word, dst_mode);
1531 /* simple case: create a high word */
1532 if (imode != dst_mode)
1533 op = new_rd_Conv(dbg, block, op, dst_mode);
1535 env->entries[idx]->low_word = op;
1537 if (mode_is_signed(imode)) {
1538 env->entries[idx]->high_word = new_rd_Shrs(dbg, block, op,
1539 new_Const_long(dst_mode, get_mode_size_bits(dst_mode) - 1), dst_mode);
1541 env->entries[idx]->high_word = new_Const(get_mode_null(dst_mode));
1545 ir_node *irn, *call;
1546 ir_mode *omode = env->params->high_unsigned;
1547 ir_type *mtp = get_conv_type(imode, omode, env);
1549 /* do an intrinsic call */
1550 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1551 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1552 set_irn_pinned(call, get_irn_pinned(node));
1553 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1555 env->entries[idx]->low_word = new_r_Proj(block, irn, dst_mode, 0);
1556 env->entries[idx]->high_word = new_r_Proj(block, irn, dst_mode, 1);
1558 } /* lower_Conv_to_Lu */
1561 * Translate a Conv from higher_signed
1563 static void lower_Conv_from_Ls(ir_node *node, lower_env_t *env) {
1564 ir_node *op = get_Conv_op(node);
1565 ir_mode *omode = get_irn_mode(node);
1566 ir_node *block = get_nodes_block(node);
1567 dbg_info *dbg = get_irn_dbg_info(node);
1568 int idx = get_irn_idx(op);
1569 ir_graph *irg = current_ir_graph;
1571 assert(idx < env->n_entries);
1573 if (! env->entries[idx]->low_word) {
1574 /* not ready yet, wait */
1575 pdeq_putr(env->waitq, node);
1579 if (mode_is_int(omode) || mode_is_reference(omode)) {
1580 op = env->entries[idx]->low_word;
1582 /* simple case: create a high word */
1583 if (omode != env->params->low_signed)
1584 op = new_rd_Conv(dbg, block, op, omode);
1586 set_Conv_op(node, op);
1588 ir_node *irn, *call, *in[2];
1589 ir_mode *imode = env->params->high_signed;
1590 ir_type *mtp = get_conv_type(imode, omode, env);
1592 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1593 in[0] = env->entries[idx]->low_word;
1594 in[1] = env->entries[idx]->high_word;
1596 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1597 set_irn_pinned(call, get_irn_pinned(node));
1598 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1600 exchange(node, new_r_Proj(block, irn, omode, 0));
1602 } /* lower_Conv_from_Ls */
1605 * Translate a Conv from higher_unsigned
1607 static void lower_Conv_from_Lu(ir_node *node, lower_env_t *env) {
1608 ir_node *op = get_Conv_op(node);
1609 ir_mode *omode = get_irn_mode(node);
1610 ir_node *block = get_nodes_block(node);
1611 dbg_info *dbg = get_irn_dbg_info(node);
1612 int idx = get_irn_idx(op);
1613 ir_graph *irg = current_ir_graph;
1615 assert(idx < env->n_entries);
1617 if (! env->entries[idx]->low_word) {
1618 /* not ready yet, wait */
1619 pdeq_putr(env->waitq, node);
1623 if (mode_is_int(omode) || mode_is_reference(omode)) {
1624 op = env->entries[idx]->low_word;
1626 /* simple case: create a high word */
1627 if (omode != env->params->low_unsigned)
1628 op = new_rd_Conv(dbg, block, op, omode);
1630 set_Conv_op(node, op);
1632 ir_node *irn, *call, *in[2];
1633 ir_mode *imode = env->params->high_unsigned;
1634 ir_type *mtp = get_conv_type(imode, omode, env);
1636 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1637 in[0] = env->entries[idx]->low_word;
1638 in[1] = env->entries[idx]->high_word;
1640 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1641 set_irn_pinned(call, get_irn_pinned(node));
1642 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1644 exchange(node, new_r_Proj(block, irn, omode, 0));
1646 } /* lower_Conv_from_Lu */
1651 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env) {
1652 mode = get_irn_mode(node);
1654 if (mode == env->params->high_signed) {
1655 lower_Conv_to_Ls(node, env);
1656 } else if (mode == env->params->high_unsigned) {
1657 lower_Conv_to_Lu(node, env);
1659 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1661 if (mode == env->params->high_signed) {
1662 lower_Conv_from_Ls(node, env);
1663 } else if (mode == env->params->high_unsigned) {
1664 lower_Conv_from_Lu(node, env);
1670 * Lower the method type.
1672 * @param mtp the method type to lower
1673 * @param ent the lower environment
1675 * @return the lowered type
1677 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env) {
1680 ir_type *res, *value_type;
1682 if (is_lowered_type(mtp))
1685 entry = pmap_find(lowered_type, mtp);
1687 int i, n, r, n_param, n_res;
1689 /* count new number of params */
1690 n_param = n = get_method_n_params(mtp);
1691 for (i = n_param - 1; i >= 0; --i) {
1692 ir_type *tp = get_method_param_type(mtp, i);
1694 if (is_Primitive_type(tp)) {
1695 ir_mode *mode = get_type_mode(tp);
1697 if (mode == env->params->high_signed ||
1698 mode == env->params->high_unsigned)
1703 /* count new number of results */
1704 n_res = r = get_method_n_ress(mtp);
1705 for (i = n_res - 1; i >= 0; --i) {
1706 ir_type *tp = get_method_res_type(mtp, i);
1708 if (is_Primitive_type(tp)) {
1709 ir_mode *mode = get_type_mode(tp);
1711 if (mode == env->params->high_signed ||
1712 mode == env->params->high_unsigned)
1717 res = new_type_method(n_param, n_res);
1719 /* set param types and result types */
1720 for (i = n_param = 0; i < n; ++i) {
1721 ir_type *tp = get_method_param_type(mtp, i);
1723 if (is_Primitive_type(tp)) {
1724 ir_mode *mode = get_type_mode(tp);
1726 if (mode == env->params->high_signed) {
1727 set_method_param_type(res, n_param++, tp_u);
1728 set_method_param_type(res, n_param++, tp_s);
1729 } else if (mode == env->params->high_unsigned) {
1730 set_method_param_type(res, n_param++, tp_u);
1731 set_method_param_type(res, n_param++, tp_u);
1733 set_method_param_type(res, n_param++, tp);
1736 set_method_param_type(res, n_param++, tp);
1739 for (i = n_res = 0; i < r; ++i) {
1740 ir_type *tp = get_method_res_type(mtp, i);
1742 if (is_Primitive_type(tp)) {
1743 ir_mode *mode = get_type_mode(tp);
1745 if (mode == env->params->high_signed) {
1746 set_method_res_type(res, n_res++, tp_u);
1747 set_method_res_type(res, n_res++, tp_s);
1748 } else if (mode == env->params->high_unsigned) {
1749 set_method_res_type(res, n_res++, tp_u);
1750 set_method_res_type(res, n_res++, tp_u);
1752 set_method_res_type(res, n_res++, tp);
1755 set_method_res_type(res, n_res++, tp);
1758 set_lowered_type(mtp, res);
1759 pmap_insert(lowered_type, mtp, res);
1761 value_type = get_method_value_param_type(mtp);
1762 if (value_type != NULL) {
1763 /* this creates a new value parameter type */
1764 (void)get_method_value_param_ent(res, 0);
1766 /* set new param positions */
1767 for (i = n_param = 0; i < n; ++i) {
1768 ir_type *tp = get_method_param_type(mtp, i);
1769 ident *id = get_method_param_ident(mtp, i);
1770 ir_entity *ent = get_method_value_param_ent(mtp, i);
1772 set_entity_link(ent, INT_TO_PTR(n_param));
1773 if (is_Primitive_type(tp)) {
1774 ir_mode *mode = get_type_mode(tp);
1776 if (mode == env->params->high_signed || mode == env->params->high_unsigned) {
1778 lid = id_mangle(id, env->first_id);
1779 set_method_param_ident(res, n_param, lid);
1780 set_entity_ident(get_method_value_param_ent(res, n_param), lid);
1781 lid = id_mangle(id, env->next_id);
1782 set_method_param_ident(res, n_param + 1, lid);
1783 set_entity_ident(get_method_value_param_ent(res, n_param + 1), lid);
1790 set_method_param_ident(res, n_param, id);
1791 set_entity_ident(get_method_value_param_ent(res, n_param), id);
1796 set_lowered_type(value_type, get_method_value_param_type(res));
1805 * Translate a Return.
1807 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env) {
1808 ir_graph *irg = current_ir_graph;
1809 ir_entity *ent = get_irg_entity(irg);
1810 ir_type *mtp = get_entity_type(ent);
1816 /* check if this return must be lowered */
1817 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1818 ir_node *pred = get_Return_res(node, i);
1819 ir_mode *mode = get_irn_op_mode(pred);
1821 if (mode == env->params->high_signed ||
1822 mode == env->params->high_unsigned) {
1823 idx = get_irn_idx(pred);
1824 if (! env->entries[idx]->low_word) {
1825 /* not ready yet, wait */
1826 pdeq_putr(env->waitq, node);
1835 ent = get_irg_entity(irg);
1836 mtp = get_entity_type(ent);
1838 mtp = lower_mtp(mtp, env);
1839 set_entity_type(ent, mtp);
1841 /* create a new in array */
1842 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1843 in[0] = get_Return_mem(node);
1845 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1846 ir_node *pred = get_Return_res(node, i);
1848 idx = get_irn_idx(pred);
1849 assert(idx < env->n_entries);
1851 if (env->entries[idx]) {
1852 in[++j] = env->entries[idx]->low_word;
1853 in[++j] = env->entries[idx]->high_word;
1859 set_irn_in(node, j+1, in);
1860 } /* lower_Return */
1863 * Translate the parameters.
1865 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env) {
1866 ir_graph *irg = get_irn_irg(node);
1867 ir_entity *ent = get_irg_entity(irg);
1868 ir_type *tp = get_entity_type(ent);
1871 int i, j, n_params, rem;
1872 ir_node *proj, *args;
1875 if (is_lowered_type(tp)) {
1876 mtp = get_associated_type(tp);
1880 assert(! is_lowered_type(mtp));
1882 n_params = get_method_n_params(mtp);
1886 NEW_ARR_A(long, new_projs, n_params);
1888 /* first check if we have parameters that must be fixed */
1889 for (i = j = 0; i < n_params; ++i, ++j) {
1890 ir_type *tp = get_method_param_type(mtp, i);
1893 if (is_Primitive_type(tp)) {
1894 ir_mode *mode = get_type_mode(tp);
1896 if (mode == env->params->high_signed ||
1897 mode == env->params->high_unsigned)
1904 mtp = lower_mtp(mtp, env);
1905 set_entity_type(ent, mtp);
1907 /* switch off optimization for new Proj nodes or they might be CSE'ed
1908 with not patched one's */
1909 rem = get_optimize();
1912 /* ok, fix all Proj's and create new ones */
1913 args = get_irg_args(irg);
1914 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1915 ir_node *pred = get_Proj_pred(proj);
1921 /* do not visit this node again */
1922 mark_irn_visited(proj);
1927 proj_nr = get_Proj_proj(proj);
1928 set_Proj_proj(proj, new_projs[proj_nr]);
1930 idx = get_irn_idx(proj);
1931 if (env->entries[idx]) {
1932 ir_mode *low_mode = env->params->low_unsigned;
1934 mode = get_irn_mode(proj);
1936 if (mode == env->params->high_signed) {
1937 mode = env->params->low_signed;
1939 mode = env->params->low_unsigned;
1942 dbg = get_irn_dbg_info(proj);
1943 env->entries[idx]->low_word =
1944 new_rd_Proj(dbg, get_nodes_block(proj), args, low_mode, new_projs[proj_nr]);
1945 env->entries[idx]->high_word =
1946 new_rd_Proj(dbg, get_nodes_block(proj), args, mode, new_projs[proj_nr] + 1);
1955 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env) {
1956 ir_type *tp = get_Call_type(node);
1958 ir_node **in, *proj, *results;
1959 int n_params, n_res, need_lower = 0;
1961 long *res_numbers = NULL;
1964 if (is_lowered_type(tp)) {
1965 call_tp = get_associated_type(tp);
1970 assert(! is_lowered_type(call_tp));
1972 n_params = get_method_n_params(call_tp);
1973 for (i = 0; i < n_params; ++i) {
1974 ir_type *tp = get_method_param_type(call_tp, i);
1976 if (is_Primitive_type(tp)) {
1977 ir_mode *mode = get_type_mode(tp);
1979 if (mode == env->params->high_signed ||
1980 mode == env->params->high_unsigned) {
1986 n_res = get_method_n_ress(call_tp);
1988 NEW_ARR_A(long, res_numbers, n_res);
1990 for (i = j = 0; i < n_res; ++i, ++j) {
1991 ir_type *tp = get_method_res_type(call_tp, i);
1994 if (is_Primitive_type(tp)) {
1995 ir_mode *mode = get_type_mode(tp);
1997 if (mode == env->params->high_signed ||
1998 mode == env->params->high_unsigned) {
2009 /* let's lower it */
2010 call_tp = lower_mtp(call_tp, env);
2011 set_Call_type(node, call_tp);
2013 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
2015 in[0] = get_Call_mem(node);
2016 in[1] = get_Call_ptr(node);
2018 for (j = 2, i = 0; i < n_params; ++i) {
2019 ir_node *pred = get_Call_param(node, i);
2020 int idx = get_irn_idx(pred);
2022 if (env->entries[idx]) {
2023 if (! env->entries[idx]->low_word) {
2024 /* not ready yet, wait */
2025 pdeq_putr(env->waitq, node);
2028 in[j++] = env->entries[idx]->low_word;
2029 in[j++] = env->entries[idx]->high_word;
2035 set_irn_in(node, j, in);
2037 /* fix the results */
2039 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
2040 long proj_nr = get_Proj_proj(proj);
2042 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
2043 /* found the result proj */
2049 if (results) { /* there are results */
2050 int rem = get_optimize();
2052 /* switch off optimization for new Proj nodes or they might be CSE'ed
2053 with not patched one's */
2055 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2056 if (get_Proj_pred(proj) == results) {
2057 long proj_nr = get_Proj_proj(proj);
2060 /* found a result */
2061 set_Proj_proj(proj, res_numbers[proj_nr]);
2062 idx = get_irn_idx(proj);
2063 if (env->entries[idx]) {
2064 ir_mode *mode = get_irn_mode(proj);
2065 ir_mode *low_mode = env->params->low_unsigned;
2068 if (mode == env->params->high_signed) {
2069 mode = env->params->low_signed;
2071 mode = env->params->low_unsigned;
2074 dbg = get_irn_dbg_info(proj);
2075 env->entries[idx]->low_word =
2076 new_rd_Proj(dbg, get_nodes_block(proj), results, low_mode, res_numbers[proj_nr]);
2077 env->entries[idx]->high_word =
2078 new_rd_Proj(dbg, get_nodes_block(proj), results, mode, res_numbers[proj_nr] + 1);
2080 mark_irn_visited(proj);
2088 * Translate an Unknown into two.
2090 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env) {
2091 int idx = get_irn_idx(node);
2092 ir_graph *irg = get_irn_irg(node);
2093 ir_mode *low_mode = env->params->low_unsigned;
2095 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2096 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2097 } /* lower_Unknown */
2102 * First step: just create two templates
2104 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env) {
2105 ir_mode *mode_l = env->params->low_unsigned;
2106 ir_graph *irg = get_irn_irg(phi);
2107 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2108 ir_node **inl, **inh;
2110 int idx, i, arity = get_Phi_n_preds(phi);
2113 idx = get_irn_idx(phi);
2114 if (env->entries[idx]->low_word) {
2115 /* Phi nodes already build, check for inputs */
2116 ir_node *phil = env->entries[idx]->low_word;
2117 ir_node *phih = env->entries[idx]->high_word;
2119 for (i = 0; i < arity; ++i) {
2120 ir_node *pred = get_Phi_pred(phi, i);
2121 int idx = get_irn_idx(pred);
2123 if (env->entries[idx]->low_word) {
2124 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2125 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2127 /* still not ready */
2128 pdeq_putr(env->waitq, phi);
2134 /* first create a new in array */
2135 NEW_ARR_A(ir_node *, inl, arity);
2136 NEW_ARR_A(ir_node *, inh, arity);
2137 unk_l = new_r_Unknown(irg, mode_l);
2138 unk_h = new_r_Unknown(irg, mode);
2140 for (i = 0; i < arity; ++i) {
2141 ir_node *pred = get_Phi_pred(phi, i);
2142 int idx = get_irn_idx(pred);
2144 if (env->entries[idx]->low_word) {
2145 inl[i] = env->entries[idx]->low_word;
2146 inh[i] = env->entries[idx]->high_word;
2154 dbg = get_irn_dbg_info(phi);
2155 block = get_nodes_block(phi);
2157 idx = get_irn_idx(phi);
2158 assert(idx < env->n_entries);
2159 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, block, arity, inl, mode_l);
2160 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, block, arity, inh, mode);
2162 /* Don't forget to link the new Phi nodes into the block.
2163 * Beware that some Phis might be optimized away. */
2165 add_Block_phi(block, phi_l);
2167 add_Block_phi(block, phi_h);
2170 /* not yet finished */
2171 pdeq_putr(env->waitq, phi);
2178 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env) {
2179 ir_node *block, *val;
2180 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2184 val = get_Mux_true(mux);
2185 idx = get_irn_idx(val);
2186 if (env->entries[idx]->low_word) {
2187 /* Values already build */
2188 true_l = env->entries[idx]->low_word;
2189 true_h = env->entries[idx]->high_word;
2191 /* still not ready */
2192 pdeq_putr(env->waitq, mux);
2196 val = get_Mux_false(mux);
2197 idx = get_irn_idx(val);
2198 if (env->entries[idx]->low_word) {
2199 /* Values already build */
2200 false_l = env->entries[idx]->low_word;
2201 false_h = env->entries[idx]->high_word;
2203 /* still not ready */
2204 pdeq_putr(env->waitq, mux);
2209 sel = get_Mux_sel(mux);
2211 dbg = get_irn_dbg_info(mux);
2212 block = get_nodes_block(mux);
2214 idx = get_irn_idx(mux);
2215 assert(idx < env->n_entries);
2216 env->entries[idx]->low_word = new_rd_Mux(dbg, block, sel, false_l, true_l, mode);
2217 env->entries[idx]->high_word = new_rd_Mux(dbg, block, sel, false_h, true_h, mode);
2221 * Translate an ASM node.
2223 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env) {
2224 ir_mode *his = env->params->high_signed;
2225 ir_mode *hiu = env->params->high_unsigned;
2231 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2232 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2233 if (op_mode == his || op_mode == hiu) {
2234 panic("lowering ASM unimplemented");
2241 n = get_irn_link(n);
2245 proj_mode = get_irn_mode(n);
2246 if (proj_mode == his || proj_mode == hiu) {
2247 panic("lowering ASM unimplemented");
2253 * Translate a Sel node.
2255 static void lower_Sel(ir_node *sel, ir_mode *mode, lower_env_t *env) {
2258 /* we must only lower value parameter Sels if we change the
2259 value parameter type. */
2260 if (env->value_param_tp != NULL) {
2261 ir_entity *ent = get_Sel_entity(sel);
2262 if (get_entity_owner(ent) == env->value_param_tp) {
2263 int pos = PTR_TO_INT(get_entity_link(ent));
2265 ent = get_method_value_param_ent(env->l_mtp, pos);
2266 set_Sel_entity(sel, ent);
2272 * check for opcodes that must always be lowered.
2274 static int always_lower(ir_opcode code) {
2288 } /* always_lower */
2291 * lower boolean Proj(Cmp)
2293 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env) {
2295 ir_node *l, *r, *low, *high, *t, *res;
2300 l = get_Cmp_left(cmp);
2301 lidx = get_irn_idx(l);
2302 if (! env->entries[lidx]->low_word) {
2303 /* still not ready */
2307 r = get_Cmp_right(cmp);
2308 ridx = get_irn_idx(r);
2309 if (! env->entries[ridx]->low_word) {
2310 /* still not ready */
2314 pnc = get_Proj_proj(proj);
2315 blk = get_nodes_block(cmp);
2316 db = get_irn_dbg_info(cmp);
2317 low = new_rd_Cmp(db, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2318 high = new_rd_Cmp(db, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2320 if (pnc == pn_Cmp_Eq) {
2321 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2322 res = new_rd_And(db, blk,
2323 new_r_Proj(blk, low, mode_b, pnc),
2324 new_r_Proj(blk, high, mode_b, pnc),
2326 } else if (pnc == pn_Cmp_Lg) {
2327 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2328 res = new_rd_Or(db, blk,
2329 new_r_Proj(blk, low, mode_b, pnc),
2330 new_r_Proj(blk, high, mode_b, pnc),
2333 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2334 t = new_rd_And(db, blk,
2335 new_r_Proj(blk, low, mode_b, pnc),
2336 new_r_Proj(blk, high, mode_b, pn_Cmp_Eq),
2338 res = new_rd_Or(db, blk,
2339 new_r_Proj(blk, high, mode_b, pnc & ~pn_Cmp_Eq),
2344 } /* lower_boolean_Proj_Cmp */
2347 * The type of a lower function.
2349 * @param node the node to be lowered
2350 * @param mode the low mode for the destination node
2351 * @param env the lower environment
2353 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2358 static void lower_ops(ir_node *node, void *env)
2360 lower_env_t *lenv = env;
2361 node_entry_t *entry;
2362 int idx = get_irn_idx(node);
2363 ir_mode *mode = get_irn_mode(node);
2365 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2368 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2369 ir_node *proj = get_irn_n(node, i);
2371 if (is_Proj(proj)) {
2372 ir_node *cmp = get_Proj_pred(proj);
2375 ir_node *arg = get_Cmp_left(cmp);
2377 mode = get_irn_mode(arg);
2378 if (mode == lenv->params->high_signed ||
2379 mode == lenv->params->high_unsigned) {
2380 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2383 /* could not lower because predecessors not ready */
2384 waitq_put(lenv->waitq, node);
2387 set_irn_n(node, i, res);
2394 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2395 if (entry || always_lower(get_irn_opcode(node))) {
2396 ir_op *op = get_irn_op(node);
2397 lower_func func = (lower_func)op->ops.generic;
2400 mode = get_irn_op_mode(node);
2402 if (mode == lenv->params->high_signed)
2403 mode = lenv->params->low_signed;
2405 mode = lenv->params->low_unsigned;
2407 DB((dbg, LEVEL_1, " %+F\n", node));
2408 func(node, mode, lenv);
2413 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2416 * Compare two op_mode_entry_t's.
2418 static int cmp_op_mode(const void *elt, const void *key, size_t size) {
2419 const op_mode_entry_t *e1 = elt;
2420 const op_mode_entry_t *e2 = key;
2423 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2427 * Compare two conv_tp_entry_t's.
2429 static int cmp_conv_tp(const void *elt, const void *key, size_t size) {
2430 const conv_tp_entry_t *e1 = elt;
2431 const conv_tp_entry_t *e2 = key;
2434 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2438 * Enter a lowering function into an ir_op.
2440 static void enter_lower_func(ir_op *op, lower_func func) {
2441 op->ops.generic = (op_func)func;
2442 } /* enter_lower_func */
2445 * Returns non-zero if a method type must be lowered.
2447 * @param mtp the method type
2449 static int mtp_must_to_lowered(ir_type *mtp, lower_env_t *env) {
2452 n_params = get_method_n_params(mtp);
2456 /* first check if we have parameters that must be fixed */
2457 for (i = 0; i < n_params; ++i) {
2458 ir_type *tp = get_method_param_type(mtp, i);
2460 if (is_Primitive_type(tp)) {
2461 ir_mode *mode = get_type_mode(tp);
2463 if (mode == env->params->high_signed ||
2464 mode == env->params->high_unsigned)
2469 } /* mtp_must_to_lowered */
2474 void lower_dw_ops(const lwrdw_param_t *param)
2483 if (! param->enable)
2486 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2488 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2489 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2490 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2492 /* create the necessary maps */
2494 prim_types = pmap_create();
2495 if (! intrinsic_fkt)
2496 intrinsic_fkt = new_set(cmp_op_mode, iro_Last + 1);
2498 conv_types = new_set(cmp_conv_tp, 16);
2500 lowered_type = pmap_create();
2502 /* create a primitive unsigned and signed type */
2504 tp_u = get_primitive_type(param->low_unsigned);
2506 tp_s = get_primitive_type(param->low_signed);
2508 /* create method types for the created binop calls */
2510 binop_tp_u = new_type_method(4, 2);
2511 set_method_param_type(binop_tp_u, 0, tp_u);
2512 set_method_param_type(binop_tp_u, 1, tp_u);
2513 set_method_param_type(binop_tp_u, 2, tp_u);
2514 set_method_param_type(binop_tp_u, 3, tp_u);
2515 set_method_res_type(binop_tp_u, 0, tp_u);
2516 set_method_res_type(binop_tp_u, 1, tp_u);
2519 binop_tp_s = new_type_method(4, 2);
2520 set_method_param_type(binop_tp_s, 0, tp_u);
2521 set_method_param_type(binop_tp_s, 1, tp_s);
2522 set_method_param_type(binop_tp_s, 2, tp_u);
2523 set_method_param_type(binop_tp_s, 3, tp_s);
2524 set_method_res_type(binop_tp_s, 0, tp_u);
2525 set_method_res_type(binop_tp_s, 1, tp_s);
2527 if (! shiftop_tp_u) {
2528 shiftop_tp_u = new_type_method(3, 2);
2529 set_method_param_type(shiftop_tp_u, 0, tp_u);
2530 set_method_param_type(shiftop_tp_u, 1, tp_u);
2531 set_method_param_type(shiftop_tp_u, 2, tp_u);
2532 set_method_res_type(shiftop_tp_u, 0, tp_u);
2533 set_method_res_type(shiftop_tp_u, 1, tp_u);
2535 if (! shiftop_tp_s) {
2536 shiftop_tp_s = new_type_method(3, 2);
2537 set_method_param_type(shiftop_tp_s, 0, tp_u);
2538 set_method_param_type(shiftop_tp_s, 1, tp_s);
2539 set_method_param_type(shiftop_tp_s, 2, tp_u);
2540 set_method_res_type(shiftop_tp_s, 0, tp_u);
2541 set_method_res_type(shiftop_tp_s, 1, tp_s);
2544 unop_tp_u = new_type_method(2, 2);
2545 set_method_param_type(unop_tp_u, 0, tp_u);
2546 set_method_param_type(unop_tp_u, 1, tp_u);
2547 set_method_res_type(unop_tp_u, 0, tp_u);
2548 set_method_res_type(unop_tp_u, 1, tp_u);
2551 unop_tp_s = new_type_method(2, 2);
2552 set_method_param_type(unop_tp_s, 0, tp_u);
2553 set_method_param_type(unop_tp_s, 1, tp_s);
2554 set_method_res_type(unop_tp_s, 0, tp_u);
2555 set_method_res_type(unop_tp_s, 1, tp_s);
2558 lenv.tv_mode_bytes = new_tarval_from_long(get_mode_size_bytes(param->low_unsigned), param->low_unsigned);
2559 lenv.tv_mode_bits = new_tarval_from_long(get_mode_size_bits(param->low_unsigned), param->low_unsigned);
2560 lenv.waitq = new_pdeq();
2561 lenv.params = param;
2562 lenv.first_id = new_id_from_chars(param->little_endian ? ".l" : ".h", 2);
2563 lenv.next_id = new_id_from_chars(param->little_endian ? ".h" : ".l", 2);
2565 /* first clear the generic function pointer for all ops */
2566 clear_irp_opcodes_generic_func();
2568 #define LOWER2(op, fkt) enter_lower_func(op_##op, fkt)
2569 #define LOWER(op) LOWER2(op, lower_##op)
2570 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2571 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2573 /* the table of all operations that must be lowered follows */
2611 /* transform all graphs */
2612 rem = current_ir_graph;
2613 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2614 ir_graph *irg = get_irp_irg(i);
2619 obstack_init(&lenv.obst);
2621 n_idx = get_irg_last_idx(irg);
2622 n_idx = n_idx + (n_idx >> 2); /* add 25% */
2623 lenv.n_entries = n_idx;
2624 lenv.entries = NEW_ARR_F(node_entry_t *, n_idx);
2625 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2629 lenv.proj_2_block = pmap_create();
2630 lenv.value_param_tp = NULL;
2631 ir_reserve_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2633 ent = get_irg_entity(irg);
2634 mtp = get_entity_type(ent);
2636 if (mtp_must_to_lowered(mtp, &lenv)) {
2637 ir_type *ltp = lower_mtp(mtp, &lenv);
2638 lenv.flags |= MUST_BE_LOWERED;
2639 set_entity_type(ent, ltp);
2641 lenv.value_param_tp = get_method_value_param_type(mtp);
2644 /* first step: link all nodes and allocate data */
2645 irg_walk_graph(irg, firm_clear_node_and_phi_links, prepare_links_and_handle_rotl, &lenv);
2647 if (lenv.flags & MUST_BE_LOWERED) {
2648 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2650 /* must do some work */
2651 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2653 /* last step: all waiting nodes */
2654 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2655 current_ir_graph = irg;
2656 while (! pdeq_empty(lenv.waitq)) {
2657 ir_node *node = pdeq_getl(lenv.waitq);
2659 lower_ops(node, &lenv);
2662 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2664 /* outs are invalid, we changed the graph */
2665 set_irg_outs_inconsistent(irg);
2667 if (lenv.flags & CF_CHANGED) {
2668 /* control flow changed, dominance info is invalid */
2669 set_irg_doms_inconsistent(irg);
2670 set_irg_extblk_inconsistent(irg);
2671 set_irg_loopinfo_inconsistent(irg);
2674 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2676 pmap_destroy(lenv.proj_2_block);
2677 DEL_ARR_F(lenv.entries);
2678 obstack_free(&lenv.obst, NULL);
2680 del_pdeq(lenv.waitq);
2681 current_ir_graph = rem;
2682 } /* lower_dw_ops */
2685 ir_prog_pass_t pass;
2686 const lwrdw_param_t *param;
2690 * Creates a wrapper around lower_dw_ops().
2692 static int pass_wrapper(ir_prog *irp, void *context)
2694 struct pass_t *pass = context;
2697 lower_dw_ops(pass->param);
2701 ir_prog_pass_t *lower_dw_ops_pass(const char *name, const lwrdw_param_t *param) {
2702 struct pass_t *pass = XMALLOCZ(struct pass_t);
2704 pass->param = param;
2705 return def_prog_pass_constructor(
2706 &pass->pass, name ? name : "lower_dw", pass_wrapper);
2707 } /* lower_dw_ops_pass */
2709 /* Default implementation. */
2710 ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2711 const ir_mode *imode, const ir_mode *omode,
2719 if (imode == omode) {
2720 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2722 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2723 get_mode_name(imode), get_mode_name(omode));
2725 id = new_id_from_str(buf);
2727 ent = new_entity(get_glob_type(), id, method);
2728 set_entity_ld_ident(ent, get_entity_ident(ent));
2729 set_entity_visibility(ent, visibility_external_allocated);
2731 } /* def_create_intrinsic_fkt */