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 (op, imode, omode) to Intrinsic functions entities. */
58 static set *intrinsic_fkt;
60 /** A map from (imode, omode) to conv function types. */
61 static set *conv_types;
63 /** A map from a method type to its lowered type. */
64 static pmap *lowered_type;
66 /** The types for the binop and unop intrinsics. */
67 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;
69 /** the debug handle */
70 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
73 * An entry in the (op, imode, omode) -> entity map.
75 typedef struct op_mode_entry {
76 const ir_op *op; /**< the op */
77 const ir_mode *imode; /**< the input mode */
78 const ir_mode *omode; /**< the output mode */
79 ir_entity *ent; /**< the associated entity of this (op, imode, omode) triple */
83 * An entry in the (imode, omode) -> tp map.
85 typedef struct conv_tp_entry {
86 const ir_mode *imode; /**< the input mode */
87 const ir_mode *omode; /**< the output mode */
88 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
92 * Every double word node will be replaced,
93 * we need some store to hold the replacement:
95 typedef struct node_entry_t {
96 ir_node *low_word; /**< the low word */
97 ir_node *high_word; /**< the high word */
101 MUST_BE_LOWERED = 1, /**< graph must be lowered */
102 CF_CHANGED = 2, /**< control flow was changed */
106 * The lower environment.
108 typedef struct lower_env_t {
109 node_entry_t **entries; /**< entries per node */
110 struct obstack obst; /**< an obstack holding the temporary data */
111 ir_type *l_mtp; /**< lowered method type of the current method */
112 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
113 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
114 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
115 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
116 ir_mode *high_signed; /**< doubleword signed type */
117 ir_mode *high_unsigned; /**< doubleword unsigned type */
118 ir_mode *low_signed; /**< word signed type */
119 ir_mode *low_unsigned; /**< word unsigned type */
120 ident *first_id; /**< .l for little and .h for big endian */
121 ident *next_id; /**< .h for little and .l for big endian */
122 const lwrdw_param_t *params; /**< transformation parameter */
123 unsigned flags; /**< some flags */
124 int n_entries; /**< number of entries */
125 ir_type *value_param_tp; /**< the old value param type */
129 * Create a method type for a Conv emulation from imode to omode.
131 static ir_type *get_conv_type(ir_mode *imode, ir_mode *omode, lower_env_t *env)
133 conv_tp_entry_t key, *entry;
140 entry = set_insert(conv_types, &key, sizeof(key), HASH_PTR(imode) ^ HASH_PTR(omode));
142 int n_param = 1, n_res = 1;
144 if (imode == env->high_signed || imode == env->high_unsigned)
146 if (omode == env->high_signed || omode == env->high_unsigned)
149 /* create a new one */
150 mtd = new_type_method(n_param, n_res);
152 /* set param types and result types */
154 if (imode == env->high_signed) {
155 set_method_param_type(mtd, n_param++, tp_u);
156 set_method_param_type(mtd, n_param++, tp_s);
157 } else if (imode == env->high_unsigned) {
158 set_method_param_type(mtd, n_param++, tp_u);
159 set_method_param_type(mtd, n_param++, tp_u);
161 ir_type *tp = get_type_for_mode(imode);
162 set_method_param_type(mtd, n_param++, tp);
166 if (omode == env->high_signed) {
167 set_method_res_type(mtd, n_res++, tp_u);
168 set_method_res_type(mtd, n_res++, tp_s);
169 } else if (omode == env->high_unsigned) {
170 set_method_res_type(mtd, n_res++, tp_u);
171 set_method_res_type(mtd, n_res++, tp_u);
173 ir_type *tp = get_type_for_mode(omode);
174 set_method_res_type(mtd, n_res++, tp);
181 } /* get_conv_type */
184 * Add an additional control flow input to a block.
185 * Patch all Phi nodes. The new Phi inputs are copied from
186 * old input number nr.
188 static void add_block_cf_input_nr(ir_node *block, int nr, ir_node *cf)
190 int i, arity = get_irn_arity(block);
195 NEW_ARR_A(ir_node *, in, arity + 1);
196 for (i = 0; i < arity; ++i)
197 in[i] = get_irn_n(block, i);
200 set_irn_in(block, i + 1, in);
202 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
203 for (i = 0; i < arity; ++i)
204 in[i] = get_irn_n(phi, i);
206 set_irn_in(phi, i + 1, in);
208 } /* add_block_cf_input_nr */
211 * Add an additional control flow input to a block.
212 * Patch all Phi nodes. The new Phi inputs are copied from
213 * old input from cf tmpl.
215 static void add_block_cf_input(ir_node *block, ir_node *tmpl, ir_node *cf)
217 int i, arity = get_irn_arity(block);
220 for (i = 0; i < arity; ++i) {
221 if (get_irn_n(block, i) == tmpl) {
227 add_block_cf_input_nr(block, nr, cf);
228 } /* add_block_cf_input */
231 * Return the "operational" mode of a Firm node.
233 static ir_mode *get_irn_op_mode(ir_node *node)
235 switch (get_irn_opcode(node)) {
237 return get_Load_mode(node);
239 return get_irn_mode(get_Store_value(node));
241 return get_irn_mode(get_DivMod_left(node));
243 return get_irn_mode(get_Div_left(node));
245 return get_irn_mode(get_Mod_left(node));
247 return get_irn_mode(get_Cmp_left(node));
249 return get_irn_mode(node);
251 } /* get_irn_op_mode */
254 * Walker, prepare the node links.
256 static void prepare_links(ir_node *node, void *env)
258 lower_env_t *lenv = env;
259 ir_mode *mode = get_irn_op_mode(node);
263 if (mode == lenv->high_signed ||
264 mode == lenv->high_unsigned) {
265 /* ok, found a node that will be lowered */
266 link = OALLOCZ(&lenv->obst, node_entry_t);
268 idx = get_irn_idx(node);
269 if (idx >= lenv->n_entries) {
270 /* enlarge: this happens only for Rotl nodes which is RARELY */
271 int old = lenv->n_entries;
272 int n_idx = idx + (idx >> 3);
274 ARR_RESIZE(node_entry_t *, lenv->entries, n_idx);
275 memset(&lenv->entries[old], 0, (n_idx - old) * sizeof(lenv->entries[0]));
276 lenv->n_entries = n_idx;
278 lenv->entries[idx] = link;
279 lenv->flags |= MUST_BE_LOWERED;
280 } else if (is_Conv(node)) {
281 /* Conv nodes have two modes */
282 ir_node *pred = get_Conv_op(node);
283 mode = get_irn_mode(pred);
285 if (mode == lenv->high_signed ||
286 mode == lenv->high_unsigned) {
287 /* must lower this node either but don't need a link */
288 lenv->flags |= MUST_BE_LOWERED;
294 /* link all Proj nodes to its predecessor:
295 Note that Tuple Proj's and its Projs are linked either. */
296 ir_node *pred = get_Proj_pred(node);
298 set_irn_link(node, get_irn_link(pred));
299 set_irn_link(pred, node);
300 } else if (is_Phi(node)) {
301 /* link all Phi nodes to its block */
302 ir_node *block = get_nodes_block(node);
303 add_Block_phi(block, node);
304 } else if (is_Block(node)) {
305 /* fill the Proj -> Block map */
306 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
307 ir_node *pred = get_Block_cfgpred(node, i);
310 pmap_insert(lenv->proj_2_block, pred, node);
313 } /* prepare_links */
316 * Translate a Constant: create two.
318 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env)
320 tarval *tv, *tv_l, *tv_h;
322 dbg_info *dbg = get_irn_dbg_info(node);
324 ir_graph *irg = current_ir_graph;
325 ir_mode *low_mode = env->low_unsigned;
327 tv = get_Const_tarval(node);
329 tv_l = tarval_convert_to(tv, low_mode);
330 low = new_rd_Const(dbg, irg, tv_l);
332 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
333 high = new_rd_Const(dbg, irg, tv_h);
335 idx = get_irn_idx(node);
336 assert(idx < env->n_entries);
337 env->entries[idx]->low_word = low;
338 env->entries[idx]->high_word = high;
342 * Translate a Load: create two.
344 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env)
346 ir_mode *low_mode = env->low_unsigned;
347 ir_graph *irg = current_ir_graph;
348 ir_node *adr = get_Load_ptr(node);
349 ir_node *mem = get_Load_mem(node);
350 ir_node *low, *high, *proj;
352 ir_node *block = get_nodes_block(node);
354 ir_cons_flags volatility = get_Load_volatility(node) == volatility_is_volatile
357 if (env->params->little_endian) {
359 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
361 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
365 /* create two loads */
366 dbg = get_irn_dbg_info(node);
367 low = new_rd_Load(dbg, block, mem, low, low_mode, volatility);
368 proj = new_r_Proj(low, mode_M, pn_Load_M);
369 high = new_rd_Load(dbg, block, proj, high, mode, volatility);
371 idx = get_irn_idx(node);
372 assert(idx < env->n_entries);
373 env->entries[idx]->low_word = low;
374 env->entries[idx]->high_word = high;
376 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
377 idx = get_irn_idx(proj);
379 switch (get_Proj_proj(proj)) {
380 case pn_Load_M: /* Memory result. */
381 /* put it to the second one */
382 set_Proj_pred(proj, high);
384 case pn_Load_X_except: /* Execution result if exception occurred. */
385 /* put it to the first one */
386 set_Proj_pred(proj, low);
388 case pn_Load_res: /* Result of load operation. */
389 assert(idx < env->n_entries);
390 env->entries[idx]->low_word = new_r_Proj(low, low_mode, pn_Load_res);
391 env->entries[idx]->high_word = new_r_Proj(high, mode, pn_Load_res);
394 assert(0 && "unexpected Proj number");
396 /* mark this proj: we have handled it already, otherwise we might fall into
398 mark_irn_visited(proj);
403 * Translate a Store: create two.
405 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env)
408 ir_node *block, *adr, *mem;
409 ir_node *low, *high, *irn, *proj;
413 ir_cons_flags volatility = get_Store_volatility(node) == volatility_is_volatile
417 irn = get_Store_value(node);
418 entry = env->entries[get_irn_idx(irn)];
421 if (! entry->low_word) {
422 /* not ready yet, wait */
423 pdeq_putr(env->waitq, node);
427 irg = current_ir_graph;
428 adr = get_Store_ptr(node);
429 mem = get_Store_mem(node);
430 block = get_nodes_block(node);
432 if (env->params->little_endian) {
434 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
436 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
440 /* create two Stores */
441 dbg = get_irn_dbg_info(node);
442 low = new_rd_Store(dbg, block, mem, low, entry->low_word, volatility);
443 proj = new_r_Proj(low, mode_M, pn_Store_M);
444 high = new_rd_Store(dbg, block, proj, high, entry->high_word, volatility);
446 idx = get_irn_idx(node);
447 assert(idx < env->n_entries);
448 env->entries[idx]->low_word = low;
449 env->entries[idx]->high_word = high;
451 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
452 idx = get_irn_idx(proj);
454 switch (get_Proj_proj(proj)) {
455 case pn_Store_M: /* Memory result. */
456 /* put it to the second one */
457 set_Proj_pred(proj, high);
459 case pn_Store_X_except: /* Execution result if exception occurred. */
460 /* put it to the first one */
461 set_Proj_pred(proj, low);
464 assert(0 && "unexpected Proj number");
466 /* mark this proj: we have handled it already, otherwise we might fall into
468 mark_irn_visited(proj);
473 * Return a node containing the address of the intrinsic emulation function.
475 * @param method the method type of the emulation function
476 * @param op the emulated ir_op
477 * @param imode the input mode of the emulated opcode
478 * @param omode the output mode of the emulated opcode
479 * @param env the lower environment
481 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
482 ir_mode *imode, ir_mode *omode,
487 op_mode_entry_t key, *entry;
494 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
495 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
497 /* create a new one */
498 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
500 assert(ent && "Intrinsic creator must return an entity");
506 return new_r_SymConst(current_ir_graph, mode_P_code, sym, symconst_addr_ent);
507 } /* get_intrinsic_address */
512 * Create an intrinsic Call.
514 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env)
516 ir_node *block, *irn, *call, *proj;
524 irn = get_Div_left(node);
525 entry = env->entries[get_irn_idx(irn)];
528 if (! entry->low_word) {
529 /* not ready yet, wait */
530 pdeq_putr(env->waitq, node);
534 in[0] = entry->low_word;
535 in[1] = entry->high_word;
537 irn = get_Div_right(node);
538 entry = env->entries[get_irn_idx(irn)];
541 if (! entry->low_word) {
542 /* not ready yet, wait */
543 pdeq_putr(env->waitq, node);
547 in[2] = entry->low_word;
548 in[3] = entry->high_word;
550 dbg = get_irn_dbg_info(node);
551 block = get_nodes_block(node);
553 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
554 opmode = get_irn_op_mode(node);
555 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
556 call = new_rd_Call(dbg, block, get_Div_mem(node), irn, 4, in, mtp);
557 set_irn_pinned(call, get_irn_pinned(node));
558 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
560 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
561 switch (get_Proj_proj(proj)) {
562 case pn_Div_M: /* Memory result. */
563 /* reroute to the call */
564 set_Proj_pred(proj, call);
565 set_Proj_proj(proj, pn_Call_M);
567 case pn_Div_X_except: /* Execution result if exception occurred. */
568 /* reroute to the call */
569 set_Proj_pred(proj, call);
570 set_Proj_proj(proj, pn_Call_X_except);
572 case pn_Div_res: /* Result of computation. */
573 idx = get_irn_idx(proj);
574 assert(idx < env->n_entries);
575 env->entries[idx]->low_word = new_r_Proj(irn, env->low_unsigned, 0);
576 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
579 assert(0 && "unexpected Proj number");
581 /* mark this proj: we have handled it already, otherwise we might fall into
583 mark_irn_visited(proj);
590 * Create an intrinsic Call.
592 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env)
594 ir_node *block, *proj, *irn, *call;
602 irn = get_Mod_left(node);
603 entry = env->entries[get_irn_idx(irn)];
606 if (! entry->low_word) {
607 /* not ready yet, wait */
608 pdeq_putr(env->waitq, node);
612 in[0] = entry->low_word;
613 in[1] = entry->high_word;
615 irn = get_Mod_right(node);
616 entry = env->entries[get_irn_idx(irn)];
619 if (! entry->low_word) {
620 /* not ready yet, wait */
621 pdeq_putr(env->waitq, node);
625 in[2] = entry->low_word;
626 in[3] = entry->high_word;
628 dbg = get_irn_dbg_info(node);
629 block = get_nodes_block(node);
631 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
632 opmode = get_irn_op_mode(node);
633 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
634 call = new_rd_Call(dbg, block, get_Mod_mem(node), irn, 4, in, mtp);
635 set_irn_pinned(call, get_irn_pinned(node));
636 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
638 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
639 switch (get_Proj_proj(proj)) {
640 case pn_Mod_M: /* Memory result. */
641 /* reroute to the call */
642 set_Proj_pred(proj, call);
643 set_Proj_proj(proj, pn_Call_M);
645 case pn_Mod_X_except: /* Execution result if exception occurred. */
646 /* reroute to the call */
647 set_Proj_pred(proj, call);
648 set_Proj_proj(proj, pn_Call_X_except);
650 case pn_Mod_res: /* Result of computation. */
651 idx = get_irn_idx(proj);
652 assert(idx < env->n_entries);
653 env->entries[idx]->low_word = new_r_Proj(irn, env->low_unsigned, 0);
654 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
657 assert(0 && "unexpected Proj number");
659 /* mark this proj: we have handled it already, otherwise we might fall into
661 mark_irn_visited(proj);
666 * Translate a DivMod.
668 * Create two intrinsic Calls.
670 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env)
672 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
673 ir_node *resDiv = NULL;
674 ir_node *resMod = NULL;
683 /* check if both results are needed */
684 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
685 switch (get_Proj_proj(proj)) {
686 case pn_DivMod_res_div: flags |= 1; break;
687 case pn_DivMod_res_mod: flags |= 2; break;
692 irn = get_DivMod_left(node);
693 entry = env->entries[get_irn_idx(irn)];
696 if (! entry->low_word) {
697 /* not ready yet, wait */
698 pdeq_putr(env->waitq, node);
702 in[0] = entry->low_word;
703 in[1] = entry->high_word;
705 irn = get_DivMod_right(node);
706 entry = env->entries[get_irn_idx(irn)];
709 if (! entry->low_word) {
710 /* not ready yet, wait */
711 pdeq_putr(env->waitq, node);
715 in[2] = entry->low_word;
716 in[3] = entry->high_word;
718 dbg = get_irn_dbg_info(node);
719 block = get_nodes_block(node);
721 mem = get_DivMod_mem(node);
723 callDiv = callMod = NULL;
724 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
726 opmode = get_irn_op_mode(node);
727 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, env);
728 callDiv = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
729 set_irn_pinned(callDiv, get_irn_pinned(node));
730 resDiv = new_r_Proj(callDiv, mode_T, pn_Call_T_result);
734 mem = new_r_Proj(callDiv, mode_M, pn_Call_M);
735 opmode = get_irn_op_mode(node);
736 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, env);
737 callMod = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
738 set_irn_pinned(callMod, get_irn_pinned(node));
739 resMod = new_r_Proj(callMod, mode_T, pn_Call_T_result);
742 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
743 switch (get_Proj_proj(proj)) {
744 case pn_DivMod_M: /* Memory result. */
745 /* reroute to the first call */
746 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
747 set_Proj_proj(proj, pn_Call_M);
749 case pn_DivMod_X_except: /* Execution result if exception occurred. */
750 /* reroute to the first call */
751 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
752 set_Proj_proj(proj, pn_Call_X_except);
754 case pn_DivMod_res_div: /* Result of Div. */
755 idx = get_irn_idx(proj);
756 assert(idx < env->n_entries);
757 env->entries[idx]->low_word = new_r_Proj(resDiv, env->low_unsigned, 0);
758 env->entries[idx]->high_word = new_r_Proj(resDiv, mode, 1);
760 case pn_DivMod_res_mod: /* Result of Mod. */
761 idx = get_irn_idx(proj);
762 env->entries[idx]->low_word = new_r_Proj(resMod, env->low_unsigned, 0);
763 env->entries[idx]->high_word = new_r_Proj(resMod, mode, 1);
766 assert(0 && "unexpected Proj number");
768 /* mark this proj: we have handled it already, otherwise we might fall into
770 mark_irn_visited(proj);
777 * Create an intrinsic Call.
779 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env)
781 ir_node *block, *irn;
789 irn = get_binop_left(node);
790 entry = env->entries[get_irn_idx(irn)];
793 if (! entry->low_word) {
794 /* not ready yet, wait */
795 pdeq_putr(env->waitq, node);
799 in[0] = entry->low_word;
800 in[1] = entry->high_word;
802 irn = get_binop_right(node);
803 entry = env->entries[get_irn_idx(irn)];
806 if (! entry->low_word) {
807 /* not ready yet, wait */
808 pdeq_putr(env->waitq, node);
812 in[2] = entry->low_word;
813 in[3] = entry->high_word;
815 dbg = get_irn_dbg_info(node);
816 block = get_nodes_block(node);
817 irg = current_ir_graph;
819 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
820 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
821 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
823 set_irn_pinned(irn, get_irn_pinned(node));
824 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
826 idx = get_irn_idx(node);
827 assert(idx < env->n_entries);
828 env->entries[idx]->low_word = new_r_Proj(irn, env->low_unsigned, 0);
829 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
833 * Translate a Shiftop.
835 * Create an intrinsic Call.
837 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env)
839 ir_node *block, *irn;
847 irn = get_binop_left(node);
848 entry = env->entries[get_irn_idx(irn)];
851 if (! entry->low_word) {
852 /* not ready yet, wait */
853 pdeq_putr(env->waitq, node);
857 in[0] = entry->low_word;
858 in[1] = entry->high_word;
860 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
861 in[2] = get_binop_right(node);
862 assert(get_irn_mode(in[2]) != env->high_signed
863 && get_irn_mode(in[2]) != env->high_unsigned);
865 dbg = get_irn_dbg_info(node);
866 block = get_nodes_block(node);
867 irg = current_ir_graph;
869 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
870 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
871 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
873 set_irn_pinned(irn, get_irn_pinned(node));
874 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
876 idx = get_irn_idx(node);
877 assert(idx < env->n_entries);
878 env->entries[idx]->low_word = new_r_Proj(irn, env->low_unsigned, 0);
879 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
880 } /* lower_Shiftop */
883 * Translate a Shr and handle special cases.
885 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env)
887 ir_node *right = get_Shr_right(node);
888 ir_graph *irg = current_ir_graph;
890 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
891 tarval *tv = get_Const_tarval(right);
893 if (tarval_is_long(tv) &&
894 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
895 ir_node *block = get_nodes_block(node);
896 ir_node *left = get_Shr_left(node);
897 ir_mode *low_unsigned = env->low_unsigned;
899 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
900 int idx = get_irn_idx(left);
902 left = env->entries[idx]->high_word;
904 /* not ready yet, wait */
905 pdeq_putr(env->waitq, node);
909 idx = get_irn_idx(node);
910 /* convert high word into low_unsigned mode if necessary */
911 if (get_irn_mode(left) != low_unsigned)
912 left = new_r_Conv(block, left, low_unsigned);
915 c = new_r_Const_long(irg, low_unsigned, shf_cnt);
916 env->entries[idx]->low_word = new_r_Shr(block, left, c,
919 env->entries[idx]->low_word = left;
921 env->entries[idx]->high_word = new_r_Const(irg, get_mode_null(mode));
926 lower_Shiftop(node, mode, env);
930 * Translate a Shl and handle special cases.
932 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env)
934 ir_node *right = get_Shl_right(node);
935 ir_graph *irg = current_ir_graph;
937 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
938 tarval *tv = get_Const_tarval(right);
940 if (tarval_is_long(tv) &&
941 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
943 ir_node *block = get_nodes_block(node);
944 ir_node *left = get_Shl_left(node);
946 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
947 int idx = get_irn_idx(left);
949 left = env->entries[idx]->low_word;
951 /* not ready yet, wait */
952 pdeq_putr(env->waitq, node);
956 left = new_r_Conv(block, left, mode);
957 idx = get_irn_idx(node);
959 mode_l = env->low_unsigned;
961 c = new_r_Const_long(irg, mode_l, shf_cnt);
962 env->entries[idx]->high_word = new_r_Shl(block, left, c, mode);
964 env->entries[idx]->high_word = left;
966 env->entries[idx]->low_word = new_r_Const(irg, get_mode_null(mode_l));
971 lower_Shiftop(node, mode, env);
975 * Translate a Shrs and handle special cases.
977 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env)
979 ir_node *right = get_Shrs_right(node);
980 ir_graph *irg = current_ir_graph;
982 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
983 tarval *tv = get_Const_tarval(right);
985 if (tarval_is_long(tv) &&
986 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
987 ir_node *block = get_nodes_block(node);
988 ir_node *left = get_Shrs_left(node);
989 ir_mode *low_unsigned = env->low_unsigned;
990 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
991 int idx = get_irn_idx(left);
992 ir_node *left_unsigned = left;
996 left = env->entries[idx]->high_word;
998 /* not ready yet, wait */
999 pdeq_putr(env->waitq, node);
1003 idx = get_irn_idx(node);
1004 /* convert high word into low_unsigned mode if necessary */
1005 if (get_irn_mode(left_unsigned) != low_unsigned)
1006 left_unsigned = new_r_Conv(block, left, low_unsigned);
1009 c = new_r_Const_long(irg, low_unsigned, shf_cnt);
1010 low = new_r_Shrs(block, left_unsigned, c, low_unsigned);
1012 low = left_unsigned;
1014 /* low word is expected to have low_unsigned */
1015 env->entries[idx]->low_word = new_r_Conv(block, low, low_unsigned);
1017 c = new_r_Const_long(irg, low_unsigned,
1018 get_mode_size_bits(mode) - 1);
1019 env->entries[idx]->high_word = new_r_Shrs(block, left, c, mode);
1024 lower_Shiftop(node, mode, env);
1028 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1030 static void prepare_links_and_handle_rotl(ir_node *node, void *env)
1032 lower_env_t *lenv = env;
1034 if (is_Rotl(node)) {
1035 ir_mode *mode = get_irn_op_mode(node);
1036 if (mode == lenv->high_signed ||
1037 mode == lenv->high_unsigned) {
1038 ir_node *right = get_Rotl_right(node);
1039 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1040 ir_mode *omode, *rmode;
1043 optimization_state_t state;
1045 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1046 tarval *tv = get_Const_tarval(right);
1048 if (tarval_is_long(tv) &&
1049 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1050 /* will be optimized in lower_Rotl() */
1055 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1056 irg = get_irn_irg(node);
1057 dbg = get_irn_dbg_info(node);
1058 omode = get_irn_mode(node);
1059 left = get_Rotl_left(node);
1060 block = get_nodes_block(node);
1061 shl = new_rd_Shl(dbg, block, left, right, omode);
1062 rmode = get_irn_mode(right);
1063 c = new_r_Const_long(irg, rmode, get_mode_size_bits(omode));
1064 sub = new_rd_Sub(dbg, block, c, right, rmode);
1065 shr = new_rd_Shr(dbg, block, left, sub, omode);
1067 /* optimization must be switched off here, or we will get the Rotl back */
1068 save_optimization_state(&state);
1069 set_opt_algebraic_simplification(0);
1070 or = new_rd_Or(dbg, block, shl, shr, omode);
1071 restore_optimization_state(&state);
1075 /* do lowering on the new nodes */
1076 prepare_links(shl, env);
1077 prepare_links(c, env);
1078 prepare_links(sub, env);
1079 prepare_links(shr, env);
1080 prepare_links(or, env);
1083 prepare_links(node, env);
1088 * Translate a special case Rotl(x, sizeof(w)).
1090 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env)
1092 ir_node *right = get_Rotl_right(node);
1093 ir_node *left = get_Rotl_left(node);
1095 int idx = get_irn_idx(left);
1099 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1100 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1101 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1103 l = env->entries[idx]->low_word;
1104 h = env->entries[idx]->high_word;
1105 idx = get_irn_idx(node);
1107 env->entries[idx]->low_word = h;
1108 env->entries[idx]->high_word = l;
1112 * Translate an Unop.
1114 * Create an intrinsic Call.
1116 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env)
1118 ir_node *block, *irn;
1123 node_entry_t *entry;
1125 irn = get_unop_op(node);
1126 entry = env->entries[get_irn_idx(irn)];
1129 if (! entry->low_word) {
1130 /* not ready yet, wait */
1131 pdeq_putr(env->waitq, node);
1135 in[0] = entry->low_word;
1136 in[1] = entry->high_word;
1138 dbg = get_irn_dbg_info(node);
1139 block = get_nodes_block(node);
1141 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1142 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
1143 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
1145 set_irn_pinned(irn, get_irn_pinned(node));
1146 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
1148 idx = get_irn_idx(node);
1149 assert(idx < env->n_entries);
1150 env->entries[idx]->low_word = new_r_Proj(irn, env->low_unsigned, 0);
1151 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
1155 * Translate a logical Binop.
1157 * Create two logical Binops.
1159 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1160 ir_node *(*constr_rd)(dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1161 ir_node *block, *irn;
1162 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1166 node_entry_t *entry;
1168 irn = get_binop_left(node);
1169 entry = env->entries[get_irn_idx(irn)];
1172 if (! entry->low_word) {
1173 /* not ready yet, wait */
1174 pdeq_putr(env->waitq, node);
1178 lop_l = entry->low_word;
1179 lop_h = entry->high_word;
1181 irn = get_binop_right(node);
1182 entry = env->entries[get_irn_idx(irn)];
1185 if (! entry->low_word) {
1186 /* not ready yet, wait */
1187 pdeq_putr(env->waitq, node);
1191 rop_l = entry->low_word;
1192 rop_h = entry->high_word;
1194 dbg = get_irn_dbg_info(node);
1195 block = get_nodes_block(node);
1197 idx = get_irn_idx(node);
1198 assert(idx < env->n_entries);
1199 irg = current_ir_graph;
1200 env->entries[idx]->low_word = constr_rd(dbg, block, lop_l, rop_l, env->low_unsigned);
1201 env->entries[idx]->high_word = constr_rd(dbg, block, lop_h, rop_h, mode);
1202 } /* lower_Binop_logical */
1204 /** create a logical operation transformation */
1205 #define lower_logical(op) \
1206 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1207 lower_Binop_logical(node, mode, env, new_rd_##op); \
1217 * Create two logical Nots.
1219 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env)
1221 ir_node *block, *irn;
1222 ir_node *op_l, *op_h;
1225 node_entry_t *entry;
1227 irn = get_Not_op(node);
1228 entry = env->entries[get_irn_idx(irn)];
1231 if (! entry->low_word) {
1232 /* not ready yet, wait */
1233 pdeq_putr(env->waitq, node);
1237 op_l = entry->low_word;
1238 op_h = entry->high_word;
1240 dbg = get_irn_dbg_info(node);
1241 block = get_nodes_block(node);
1243 idx = get_irn_idx(node);
1244 assert(idx < env->n_entries);
1245 env->entries[idx]->low_word = new_rd_Not(dbg, block, op_l, env->low_unsigned);
1246 env->entries[idx]->high_word = new_rd_Not(dbg, block, op_h, mode);
1252 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env)
1254 ir_node *cmp, *left, *right, *block;
1255 ir_node *sel = get_Cond_selector(node);
1256 ir_mode *m = get_irn_mode(sel);
1261 node_entry_t *lentry, *rentry;
1262 ir_node *proj, *projT = NULL, *projF = NULL;
1263 ir_node *new_bl, *cmpH, *cmpL, *irn;
1264 ir_node *projHF, *projHT;
1273 cmp = get_Proj_pred(sel);
1277 left = get_Cmp_left(cmp);
1278 idx = get_irn_idx(left);
1279 lentry = env->entries[idx];
1286 right = get_Cmp_right(cmp);
1287 idx = get_irn_idx(right);
1288 rentry = env->entries[idx];
1291 if (! lentry->low_word || !rentry->low_word) {
1293 pdeq_putr(env->waitq, node);
1297 /* all right, build the code */
1298 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1299 long proj_nr = get_Proj_proj(proj);
1301 if (proj_nr == pn_Cond_true) {
1302 assert(projT == NULL && "more than one Proj(true)");
1305 assert(proj_nr == pn_Cond_false);
1306 assert(projF == NULL && "more than one Proj(false)");
1309 mark_irn_visited(proj);
1311 assert(projT && projF);
1313 /* create a new high compare */
1314 block = get_nodes_block(node);
1315 irg = get_Block_irg(block);
1316 dbg = get_irn_dbg_info(cmp);
1317 pnc = get_Proj_proj(sel);
1319 if (is_Const(right) && is_Const_null(right)) {
1320 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1321 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1322 ir_mode *mode = env->low_unsigned;
1323 ir_node *low = new_r_Conv(block, lentry->low_word, mode);
1324 ir_node *high = new_r_Conv(block, lentry->high_word, mode);
1325 ir_node *or = new_rd_Or(dbg, block, low, high, mode);
1326 ir_node *cmp = new_rd_Cmp(dbg, block, or, new_r_Const_long(irg, mode, 0));
1328 ir_node *proj = new_r_Proj(cmp, mode_b, pnc);
1329 set_Cond_selector(node, proj);
1334 cmpH = new_rd_Cmp(dbg, block, lentry->high_word, rentry->high_word);
1336 if (pnc == pn_Cmp_Eq) {
1337 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1338 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1341 dst_blk = entry->value;
1343 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1344 dbg = get_irn_dbg_info(node);
1345 irn = new_rd_Cond(dbg, block, irn);
1347 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1348 mark_irn_visited(projHF);
1349 exchange(projF, projHF);
1351 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1352 mark_irn_visited(projHT);
1354 new_bl = new_r_Block(irg, 1, &projHT);
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(cmpL, mode_b, pn_Cmp_Eq);
1359 dbg = get_irn_dbg_info(node);
1360 irn = new_rd_Cond(dbg, new_bl, irn);
1362 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1363 mark_irn_visited(proj);
1364 add_block_cf_input(dst_blk, projHF, proj);
1366 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1367 mark_irn_visited(proj);
1368 exchange(projT, proj);
1369 } else if (pnc == pn_Cmp_Lg) {
1370 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1371 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1374 dst_blk = entry->value;
1376 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Lg);
1377 dbg = get_irn_dbg_info(node);
1378 irn = new_rd_Cond(dbg, block, irn);
1380 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1381 mark_irn_visited(projHT);
1382 exchange(projT, projHT);
1384 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1385 mark_irn_visited(projHF);
1387 new_bl = new_r_Block(irg, 1, &projHF);
1389 dbg = get_irn_dbg_info(cmp);
1390 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1391 irn = new_r_Proj(cmpL, mode_b, pn_Cmp_Lg);
1392 dbg = get_irn_dbg_info(node);
1393 irn = new_rd_Cond(dbg, new_bl, irn);
1395 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1396 mark_irn_visited(proj);
1397 add_block_cf_input(dst_blk, projHT, proj);
1399 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1400 mark_irn_visited(proj);
1401 exchange(projF, proj);
1403 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1404 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1407 entry = pmap_find(env->proj_2_block, projT);
1409 dstT = entry->value;
1411 entry = pmap_find(env->proj_2_block, projF);
1413 dstF = entry->value;
1415 irn = new_r_Proj(cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1416 dbg = get_irn_dbg_info(node);
1417 irn = new_rd_Cond(dbg, block, irn);
1419 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1420 mark_irn_visited(projHT);
1421 exchange(projT, projHT);
1424 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1425 mark_irn_visited(projHF);
1427 newbl_eq = new_r_Block(irg, 1, &projHF);
1429 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1430 irn = new_rd_Cond(dbg, newbl_eq, irn);
1432 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1433 mark_irn_visited(proj);
1434 exchange(projF, proj);
1437 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1438 mark_irn_visited(proj);
1440 newbl_l = new_r_Block(irg, 1, &proj);
1442 dbg = get_irn_dbg_info(cmp);
1443 cmpL = new_rd_Cmp(dbg, newbl_l, lentry->low_word, rentry->low_word);
1444 irn = new_r_Proj(cmpL, mode_b, pnc);
1445 dbg = get_irn_dbg_info(node);
1446 irn = new_rd_Cond(dbg, newbl_l, irn);
1448 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1449 mark_irn_visited(proj);
1450 add_block_cf_input(dstT, projT, proj);
1452 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1453 mark_irn_visited(proj);
1454 add_block_cf_input(dstF, projF, proj);
1457 /* we have changed the control flow */
1458 env->flags |= CF_CHANGED;
1460 idx = get_irn_idx(sel);
1462 if (env->entries[idx]) {
1464 Bad, a jump-table with double-word index.
1465 This should not happen, but if it does we handle
1466 it like a Conv were between (in other words, ignore
1470 if (! env->entries[idx]->low_word) {
1471 /* not ready yet, wait */
1472 pdeq_putr(env->waitq, node);
1475 set_Cond_selector(node, env->entries[idx]->low_word);
1481 * Translate a Conv to higher_signed
1483 static void lower_Conv_to_Ll(ir_node *node, lower_env_t *env)
1485 ir_mode *omode = get_irn_mode(node);
1486 ir_node *op = get_Conv_op(node);
1487 ir_mode *imode = get_irn_mode(op);
1488 int idx = get_irn_idx(node);
1489 ir_graph *irg = current_ir_graph;
1490 ir_node *block = get_nodes_block(node);
1491 dbg_info *dbg = get_irn_dbg_info(node);
1492 node_entry_t *entry = env->entries[idx];
1493 ir_mode *low_unsigned = env->low_unsigned;
1495 = mode_is_signed(omode) ? env->low_signed : low_unsigned;
1497 assert(idx < env->n_entries);
1499 if (mode_is_int(imode) || mode_is_reference(imode)) {
1500 if (imode == env->high_signed
1501 || imode == env->high_unsigned) {
1502 /* a Conv from Lu to Ls or Ls to Lu */
1503 int op_idx = get_irn_idx(op);
1504 node_entry_t *op_entry = env->entries[op_idx];
1506 if (! op_entry->low_word) {
1507 /* not ready yet, wait */
1508 pdeq_putr(env->waitq, node);
1511 entry->low_word = op_entry->low_word;
1512 entry->high_word = new_rd_Conv(dbg, block, op_entry->high_word,
1515 /* simple case: create a high word */
1516 if (imode != low_unsigned)
1517 op = new_rd_Conv(dbg, block, op, low_unsigned);
1519 entry->low_word = op;
1521 if (mode_is_signed(imode)) {
1522 int c = get_mode_size_bits(low_signed) - 1;
1523 ir_node *cnst = new_r_Const_long(irg, low_unsigned, c);
1524 if (get_irn_mode(op) != low_signed)
1525 op = new_rd_Conv(dbg, block, op, low_signed);
1526 entry->high_word = new_rd_Shrs(dbg, block, op, cnst,
1529 entry->high_word = new_r_Const(irg, get_mode_null(low_signed));
1532 } else if (imode == mode_b) {
1533 entry->low_word = new_rd_Conv(dbg, block, op, low_unsigned);
1534 entry->high_word = new_r_Const(irg, get_mode_null(low_signed));
1536 ir_node *irn, *call;
1537 ir_type *mtp = get_conv_type(imode, omode, env);
1539 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1540 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1541 set_irn_pinned(call, get_irn_pinned(node));
1542 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1544 entry->low_word = new_r_Proj(irn, low_unsigned, 0);
1545 entry->high_word = new_r_Proj(irn, low_signed, 1);
1550 * Translate a Conv from higher_unsigned
1552 static void lower_Conv_from_Ll(ir_node *node, lower_env_t *env)
1554 ir_node *op = get_Conv_op(node);
1555 ir_mode *omode = get_irn_mode(node);
1556 ir_node *block = get_nodes_block(node);
1557 dbg_info *dbg = get_irn_dbg_info(node);
1558 int idx = get_irn_idx(op);
1559 ir_graph *irg = current_ir_graph;
1560 node_entry_t *entry = env->entries[idx];
1562 assert(idx < env->n_entries);
1564 if (! entry->low_word) {
1565 /* not ready yet, wait */
1566 pdeq_putr(env->waitq, node);
1570 if (mode_is_int(omode) || mode_is_reference(omode)) {
1571 op = entry->low_word;
1573 /* simple case: create a high word */
1574 if (omode != env->low_unsigned)
1575 op = new_rd_Conv(dbg, block, op, omode);
1577 set_Conv_op(node, op);
1578 } else if (omode == mode_b) {
1579 /* llu ? true : false <=> (low|high) ? true : false */
1580 ir_mode *mode = env->low_unsigned;
1581 ir_node *or = new_rd_Or(dbg, block, entry->low_word, entry->high_word,
1583 set_Conv_op(node, or);
1585 ir_node *irn, *call, *in[2];
1586 ir_mode *imode = get_irn_mode(op);
1587 ir_type *mtp = get_conv_type(imode, omode, env);
1589 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1590 in[0] = entry->low_word;
1591 in[1] = entry->high_word;
1593 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1594 set_irn_pinned(call, get_irn_pinned(node));
1595 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1597 exchange(node, new_r_Proj(irn, omode, 0));
1604 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env)
1606 mode = get_irn_mode(node);
1608 if (mode == env->high_signed
1609 || mode == env->high_unsigned) {
1610 lower_Conv_to_Ll(node, env);
1612 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1614 if (mode == env->high_signed
1615 || mode == env->high_unsigned) {
1616 lower_Conv_from_Ll(node, env);
1622 * Lower the method type.
1624 * @param mtp the method type to lower
1625 * @param ent the lower environment
1627 * @return the lowered type
1629 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env)
1633 ir_type *res, *value_type;
1635 if (is_lowered_type(mtp))
1638 entry = pmap_find(lowered_type, mtp);
1640 int i, n, r, n_param, n_res;
1642 /* count new number of params */
1643 n_param = n = get_method_n_params(mtp);
1644 for (i = n_param - 1; i >= 0; --i) {
1645 ir_type *tp = get_method_param_type(mtp, i);
1647 if (is_Primitive_type(tp)) {
1648 ir_mode *mode = get_type_mode(tp);
1650 if (mode == env->high_signed ||
1651 mode == env->high_unsigned)
1656 /* count new number of results */
1657 n_res = r = get_method_n_ress(mtp);
1658 for (i = n_res - 1; i >= 0; --i) {
1659 ir_type *tp = get_method_res_type(mtp, i);
1661 if (is_Primitive_type(tp)) {
1662 ir_mode *mode = get_type_mode(tp);
1664 if (mode == env->high_signed ||
1665 mode == env->high_unsigned)
1670 res = new_type_method(n_param, n_res);
1672 /* set param types and result types */
1673 for (i = n_param = 0; i < n; ++i) {
1674 ir_type *tp = get_method_param_type(mtp, i);
1676 if (is_Primitive_type(tp)) {
1677 ir_mode *mode = get_type_mode(tp);
1679 if (mode == env->high_signed) {
1680 set_method_param_type(res, n_param++, tp_u);
1681 set_method_param_type(res, n_param++, tp_s);
1682 } else if (mode == env->high_unsigned) {
1683 set_method_param_type(res, n_param++, tp_u);
1684 set_method_param_type(res, n_param++, tp_u);
1686 set_method_param_type(res, n_param++, tp);
1689 set_method_param_type(res, n_param++, tp);
1692 for (i = n_res = 0; i < r; ++i) {
1693 ir_type *tp = get_method_res_type(mtp, i);
1695 if (is_Primitive_type(tp)) {
1696 ir_mode *mode = get_type_mode(tp);
1698 if (mode == env->high_signed) {
1699 set_method_res_type(res, n_res++, tp_u);
1700 set_method_res_type(res, n_res++, tp_s);
1701 } else if (mode == env->high_unsigned) {
1702 set_method_res_type(res, n_res++, tp_u);
1703 set_method_res_type(res, n_res++, tp_u);
1705 set_method_res_type(res, n_res++, tp);
1708 set_method_res_type(res, n_res++, tp);
1711 set_lowered_type(mtp, res);
1712 pmap_insert(lowered_type, mtp, res);
1714 value_type = get_method_value_param_type(mtp);
1715 if (value_type != NULL) {
1716 /* this creates a new value parameter type */
1717 (void)get_method_value_param_ent(res, 0);
1719 /* set new param positions */
1720 for (i = n_param = 0; i < n; ++i) {
1721 ir_type *tp = get_method_param_type(mtp, i);
1722 ident *id = get_method_param_ident(mtp, i);
1723 ir_entity *ent = get_method_value_param_ent(mtp, i);
1725 set_entity_link(ent, INT_TO_PTR(n_param));
1726 if (is_Primitive_type(tp)) {
1727 ir_mode *mode = get_type_mode(tp);
1729 if (mode == env->high_signed || mode == env->high_unsigned) {
1731 lid = id_mangle(id, env->first_id);
1732 set_method_param_ident(res, n_param, lid);
1733 set_entity_ident(get_method_value_param_ent(res, n_param), lid);
1734 lid = id_mangle(id, env->next_id);
1735 set_method_param_ident(res, n_param + 1, lid);
1736 set_entity_ident(get_method_value_param_ent(res, n_param + 1), lid);
1743 set_method_param_ident(res, n_param, id);
1744 set_entity_ident(get_method_value_param_ent(res, n_param), id);
1749 set_lowered_type(value_type, get_method_value_param_type(res));
1758 * Translate a Return.
1760 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env)
1762 ir_graph *irg = current_ir_graph;
1763 ir_entity *ent = get_irg_entity(irg);
1764 ir_type *mtp = get_entity_type(ent);
1770 /* check if this return must be lowered */
1771 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1772 ir_node *pred = get_Return_res(node, i);
1773 ir_mode *mode = get_irn_op_mode(pred);
1775 if (mode == env->high_signed ||
1776 mode == env->high_unsigned) {
1777 idx = get_irn_idx(pred);
1778 if (! env->entries[idx]->low_word) {
1779 /* not ready yet, wait */
1780 pdeq_putr(env->waitq, node);
1789 ent = get_irg_entity(irg);
1790 mtp = get_entity_type(ent);
1792 mtp = lower_mtp(mtp, env);
1793 set_entity_type(ent, mtp);
1795 /* create a new in array */
1796 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1797 in[0] = get_Return_mem(node);
1799 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1800 ir_node *pred = get_Return_res(node, i);
1802 idx = get_irn_idx(pred);
1803 assert(idx < env->n_entries);
1805 if (env->entries[idx]) {
1806 in[++j] = env->entries[idx]->low_word;
1807 in[++j] = env->entries[idx]->high_word;
1813 set_irn_in(node, j+1, in);
1814 } /* lower_Return */
1817 * Translate the parameters.
1819 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env)
1821 ir_graph *irg = get_irn_irg(node);
1822 ir_entity *ent = get_irg_entity(irg);
1823 ir_type *tp = get_entity_type(ent);
1826 int i, j, n_params, rem;
1827 ir_node *proj, *args;
1830 if (is_lowered_type(tp)) {
1831 mtp = get_associated_type(tp);
1835 assert(! is_lowered_type(mtp));
1837 n_params = get_method_n_params(mtp);
1841 NEW_ARR_A(long, new_projs, n_params);
1843 /* first check if we have parameters that must be fixed */
1844 for (i = j = 0; i < n_params; ++i, ++j) {
1845 ir_type *tp = get_method_param_type(mtp, i);
1848 if (is_Primitive_type(tp)) {
1849 ir_mode *mode = get_type_mode(tp);
1851 if (mode == env->high_signed ||
1852 mode == env->high_unsigned)
1859 mtp = lower_mtp(mtp, env);
1860 set_entity_type(ent, mtp);
1862 /* switch off optimization for new Proj nodes or they might be CSE'ed
1863 with not patched one's */
1864 rem = get_optimize();
1867 /* ok, fix all Proj's and create new ones */
1868 args = get_irg_args(irg);
1869 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1870 ir_node *pred = get_Proj_pred(proj);
1876 /* do not visit this node again */
1877 mark_irn_visited(proj);
1882 proj_nr = get_Proj_proj(proj);
1883 set_Proj_proj(proj, new_projs[proj_nr]);
1885 idx = get_irn_idx(proj);
1886 if (env->entries[idx]) {
1887 ir_mode *low_mode = env->low_unsigned;
1889 mode = get_irn_mode(proj);
1891 if (mode == env->high_signed) {
1892 mode = env->low_signed;
1894 mode = env->low_unsigned;
1897 dbg = get_irn_dbg_info(proj);
1898 env->entries[idx]->low_word =
1899 new_rd_Proj(dbg, args, low_mode, new_projs[proj_nr]);
1900 env->entries[idx]->high_word =
1901 new_rd_Proj(dbg, args, mode, new_projs[proj_nr] + 1);
1910 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env)
1912 ir_type *tp = get_Call_type(node);
1914 ir_node **in, *proj, *results;
1915 int n_params, n_res, need_lower = 0;
1917 long *res_numbers = NULL;
1920 if (is_lowered_type(tp)) {
1921 call_tp = get_associated_type(tp);
1926 assert(! is_lowered_type(call_tp));
1928 n_params = get_method_n_params(call_tp);
1929 for (i = 0; i < n_params; ++i) {
1930 ir_type *tp = get_method_param_type(call_tp, i);
1932 if (is_Primitive_type(tp)) {
1933 ir_mode *mode = get_type_mode(tp);
1935 if (mode == env->high_signed ||
1936 mode == env->high_unsigned) {
1942 n_res = get_method_n_ress(call_tp);
1944 NEW_ARR_A(long, res_numbers, n_res);
1946 for (i = j = 0; i < n_res; ++i, ++j) {
1947 ir_type *tp = get_method_res_type(call_tp, i);
1950 if (is_Primitive_type(tp)) {
1951 ir_mode *mode = get_type_mode(tp);
1953 if (mode == env->high_signed ||
1954 mode == env->high_unsigned) {
1965 /* let's lower it */
1966 call_tp = lower_mtp(call_tp, env);
1967 set_Call_type(node, call_tp);
1969 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
1971 in[0] = get_Call_mem(node);
1972 in[1] = get_Call_ptr(node);
1974 for (j = 2, i = 0; i < n_params; ++i) {
1975 ir_node *pred = get_Call_param(node, i);
1976 int idx = get_irn_idx(pred);
1978 if (env->entries[idx]) {
1979 if (! env->entries[idx]->low_word) {
1980 /* not ready yet, wait */
1981 pdeq_putr(env->waitq, node);
1984 in[j++] = env->entries[idx]->low_word;
1985 in[j++] = env->entries[idx]->high_word;
1991 set_irn_in(node, j, in);
1993 /* fix the results */
1995 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1996 long proj_nr = get_Proj_proj(proj);
1998 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
1999 /* found the result proj */
2005 if (results) { /* there are results */
2006 int rem = get_optimize();
2008 /* switch off optimization for new Proj nodes or they might be CSE'ed
2009 with not patched one's */
2011 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2012 if (get_Proj_pred(proj) == results) {
2013 long proj_nr = get_Proj_proj(proj);
2016 /* found a result */
2017 set_Proj_proj(proj, res_numbers[proj_nr]);
2018 idx = get_irn_idx(proj);
2019 if (env->entries[idx]) {
2020 ir_mode *mode = get_irn_mode(proj);
2021 ir_mode *low_mode = env->low_unsigned;
2024 if (mode == env->high_signed) {
2025 mode = env->low_signed;
2027 mode = env->low_unsigned;
2030 dbg = get_irn_dbg_info(proj);
2031 env->entries[idx]->low_word =
2032 new_rd_Proj(dbg, results, low_mode, res_numbers[proj_nr]);
2033 env->entries[idx]->high_word =
2034 new_rd_Proj(dbg, results, mode, res_numbers[proj_nr] + 1);
2036 mark_irn_visited(proj);
2044 * Translate an Unknown into two.
2046 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env)
2048 int idx = get_irn_idx(node);
2049 ir_graph *irg = get_irn_irg(node);
2050 ir_mode *low_mode = env->low_unsigned;
2052 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2053 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2054 } /* lower_Unknown */
2059 * First step: just create two templates
2061 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env)
2063 ir_mode *mode_l = env->low_unsigned;
2064 ir_graph *irg = get_irn_irg(phi);
2065 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2066 ir_node **inl, **inh;
2068 int idx, i, arity = get_Phi_n_preds(phi);
2071 idx = get_irn_idx(phi);
2072 if (env->entries[idx]->low_word) {
2073 /* Phi nodes already build, check for inputs */
2074 ir_node *phil = env->entries[idx]->low_word;
2075 ir_node *phih = env->entries[idx]->high_word;
2077 for (i = 0; i < arity; ++i) {
2078 ir_node *pred = get_Phi_pred(phi, i);
2079 int idx = get_irn_idx(pred);
2081 if (env->entries[idx]->low_word) {
2082 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2083 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2085 /* still not ready */
2086 pdeq_putr(env->waitq, phi);
2092 /* first create a new in array */
2093 NEW_ARR_A(ir_node *, inl, arity);
2094 NEW_ARR_A(ir_node *, inh, arity);
2095 unk_l = new_r_Unknown(irg, mode_l);
2096 unk_h = new_r_Unknown(irg, mode);
2098 for (i = 0; i < arity; ++i) {
2099 ir_node *pred = get_Phi_pred(phi, i);
2100 int idx = get_irn_idx(pred);
2102 if (env->entries[idx]->low_word) {
2103 inl[i] = env->entries[idx]->low_word;
2104 inh[i] = env->entries[idx]->high_word;
2112 dbg = get_irn_dbg_info(phi);
2113 block = get_nodes_block(phi);
2115 idx = get_irn_idx(phi);
2116 assert(idx < env->n_entries);
2117 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, block, arity, inl, mode_l);
2118 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, block, arity, inh, mode);
2120 /* Don't forget to link the new Phi nodes into the block.
2121 * Beware that some Phis might be optimized away. */
2123 add_Block_phi(block, phi_l);
2125 add_Block_phi(block, phi_h);
2128 /* not yet finished */
2129 pdeq_putr(env->waitq, phi);
2136 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env)
2138 ir_node *block, *val;
2139 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2143 val = get_Mux_true(mux);
2144 idx = get_irn_idx(val);
2145 if (env->entries[idx]->low_word) {
2146 /* Values already build */
2147 true_l = env->entries[idx]->low_word;
2148 true_h = env->entries[idx]->high_word;
2150 /* still not ready */
2151 pdeq_putr(env->waitq, mux);
2155 val = get_Mux_false(mux);
2156 idx = get_irn_idx(val);
2157 if (env->entries[idx]->low_word) {
2158 /* Values already build */
2159 false_l = env->entries[idx]->low_word;
2160 false_h = env->entries[idx]->high_word;
2162 /* still not ready */
2163 pdeq_putr(env->waitq, mux);
2168 sel = get_Mux_sel(mux);
2170 dbg = get_irn_dbg_info(mux);
2171 block = get_nodes_block(mux);
2173 idx = get_irn_idx(mux);
2174 assert(idx < env->n_entries);
2175 env->entries[idx]->low_word = new_rd_Mux(dbg, block, sel, false_l, true_l, env->low_unsigned);
2176 env->entries[idx]->high_word = new_rd_Mux(dbg, block, sel, false_h, true_h, mode);
2180 * Translate an ASM node.
2182 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env)
2184 ir_mode *his = env->high_signed;
2185 ir_mode *hiu = env->high_unsigned;
2191 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2192 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2193 if (op_mode == his || op_mode == hiu) {
2194 panic("lowering ASM unimplemented");
2201 n = get_irn_link(n);
2205 proj_mode = get_irn_mode(n);
2206 if (proj_mode == his || proj_mode == hiu) {
2207 panic("lowering ASM unimplemented");
2213 * Translate a Sel node.
2215 static void lower_Sel(ir_node *sel, ir_mode *mode, lower_env_t *env)
2219 /* we must only lower value parameter Sels if we change the
2220 value parameter type. */
2221 if (env->value_param_tp != NULL) {
2222 ir_entity *ent = get_Sel_entity(sel);
2223 if (get_entity_owner(ent) == env->value_param_tp) {
2224 int pos = PTR_TO_INT(get_entity_link(ent));
2226 ent = get_method_value_param_ent(env->l_mtp, pos);
2227 set_Sel_entity(sel, ent);
2233 * check for opcodes that must always be lowered.
2235 static int always_lower(ir_opcode code)
2250 } /* always_lower */
2253 * lower boolean Proj(Cmp)
2255 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env)
2258 ir_node *l, *r, *low, *high, *t, *res;
2263 l = get_Cmp_left(cmp);
2264 lidx = get_irn_idx(l);
2265 if (! env->entries[lidx]->low_word) {
2266 /* still not ready */
2270 r = get_Cmp_right(cmp);
2271 ridx = get_irn_idx(r);
2272 if (! env->entries[ridx]->low_word) {
2273 /* still not ready */
2277 pnc = get_Proj_proj(proj);
2278 blk = get_nodes_block(cmp);
2279 db = get_irn_dbg_info(cmp);
2280 low = new_rd_Cmp(db, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2281 high = new_rd_Cmp(db, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2283 if (pnc == pn_Cmp_Eq) {
2284 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2285 res = new_rd_And(db, blk,
2286 new_r_Proj(low, mode_b, pnc),
2287 new_r_Proj(high, mode_b, pnc),
2289 } else if (pnc == pn_Cmp_Lg) {
2290 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2291 res = new_rd_Or(db, blk,
2292 new_r_Proj(low, mode_b, pnc),
2293 new_r_Proj(high, mode_b, pnc),
2296 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2297 t = new_rd_And(db, blk,
2298 new_r_Proj(low, mode_b, pnc),
2299 new_r_Proj(high, mode_b, pn_Cmp_Eq),
2301 res = new_rd_Or(db, blk,
2302 new_r_Proj(high, mode_b, pnc & ~pn_Cmp_Eq),
2307 } /* lower_boolean_Proj_Cmp */
2310 * The type of a lower function.
2312 * @param node the node to be lowered
2313 * @param mode the low mode for the destination node
2314 * @param env the lower environment
2316 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2321 static void lower_ops(ir_node *node, void *env)
2323 lower_env_t *lenv = env;
2324 node_entry_t *entry;
2325 int idx = get_irn_idx(node);
2326 ir_mode *mode = get_irn_mode(node);
2328 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2331 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2332 ir_node *proj = get_irn_n(node, i);
2334 if (is_Proj(proj)) {
2335 ir_node *cmp = get_Proj_pred(proj);
2338 ir_node *arg = get_Cmp_left(cmp);
2340 mode = get_irn_mode(arg);
2341 if (mode == lenv->high_signed ||
2342 mode == lenv->high_unsigned) {
2343 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2346 /* could not lower because predecessors not ready */
2347 waitq_put(lenv->waitq, node);
2350 set_irn_n(node, i, res);
2357 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2358 if (entry || always_lower(get_irn_opcode(node))) {
2359 ir_op *op = get_irn_op(node);
2360 lower_func func = (lower_func)op->ops.generic;
2363 mode = get_irn_op_mode(node);
2365 if (mode == lenv->high_signed)
2366 mode = lenv->low_signed;
2368 mode = lenv->low_unsigned;
2370 DB((dbg, LEVEL_1, " %+F\n", node));
2371 func(node, mode, lenv);
2376 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2379 * Compare two op_mode_entry_t's.
2381 static int cmp_op_mode(const void *elt, const void *key, size_t size)
2383 const op_mode_entry_t *e1 = elt;
2384 const op_mode_entry_t *e2 = key;
2387 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2391 * Compare two conv_tp_entry_t's.
2393 static int cmp_conv_tp(const void *elt, const void *key, size_t size)
2395 const conv_tp_entry_t *e1 = elt;
2396 const conv_tp_entry_t *e2 = key;
2399 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2403 * Enter a lowering function into an ir_op.
2405 static void enter_lower_func(ir_op *op, lower_func func)
2407 op->ops.generic = (op_func)func;
2408 } /* enter_lower_func */
2411 * Returns non-zero if a method type must be lowered.
2413 * @param mtp the method type
2415 static int mtp_must_be_lowered(ir_type *mtp, lower_env_t *env)
2419 n_params = get_method_n_params(mtp);
2423 /* first check if we have parameters that must be fixed */
2424 for (i = 0; i < n_params; ++i) {
2425 ir_type *tp = get_method_param_type(mtp, i);
2427 if (is_Primitive_type(tp)) {
2428 ir_mode *mode = get_type_mode(tp);
2430 if (mode == env->high_signed ||
2431 mode == env->high_unsigned)
2438 static void setup_modes(lower_env_t *env)
2440 unsigned size_bits = env->params->doubleword_size;
2441 ir_mode *doubleword_signed = NULL;
2442 ir_mode *doubleword_unsigned = NULL;
2443 int n_modes = get_irp_n_modes();
2444 ir_mode_arithmetic arithmetic;
2445 unsigned modulo_shift;
2448 /* search for doubleword modes... */
2449 for (i = 0; i < n_modes; ++i) {
2450 ir_mode *mode = get_irp_mode(i);
2451 if (!mode_is_int(mode))
2453 if (get_mode_size_bits(mode) != size_bits)
2455 if (mode_is_signed(mode)) {
2456 if (doubleword_signed != NULL) {
2457 /* sigh - the lowerer should really just lower all mode with
2458 * size_bits it finds. Unfortunately this required a bigger
2460 panic("multiple double word signed modes found");
2462 doubleword_signed = mode;
2464 if (doubleword_unsigned != NULL) {
2465 /* sigh - the lowerer should really just lower all mode with
2466 * size_bits it finds. Unfortunately this required a bigger
2468 panic("multiple double word unsigned modes found");
2470 doubleword_unsigned = mode;
2473 if (doubleword_signed == NULL || doubleword_unsigned == NULL) {
2474 panic("Couldn't find doubleword modes");
2477 arithmetic = get_mode_arithmetic(doubleword_signed);
2478 modulo_shift = get_mode_modulo_shift(doubleword_signed);
2480 assert(get_mode_size_bits(doubleword_unsigned) == size_bits);
2481 assert(size_bits % 2 == 0);
2482 assert(get_mode_sign(doubleword_signed) == 1);
2483 assert(get_mode_sign(doubleword_unsigned) == 0);
2484 assert(get_mode_sort(doubleword_signed) == irms_int_number);
2485 assert(get_mode_sort(doubleword_unsigned) == irms_int_number);
2486 assert(get_mode_arithmetic(doubleword_unsigned) == arithmetic);
2487 assert(get_mode_modulo_shift(doubleword_unsigned) == modulo_shift);
2489 /* try to guess a sensible modulo shift for the new mode.
2490 * (This is IMO another indication that this should really be a node
2491 * attribute instead of a mode thing) */
2492 if (modulo_shift == size_bits) {
2493 modulo_shift = modulo_shift / 2;
2494 } else if (modulo_shift == 0) {
2497 panic("Don't know what new modulo shift to use for lowered doubleword mode");
2501 /* produce lowered modes */
2502 env->high_signed = doubleword_signed;
2503 env->high_unsigned = doubleword_unsigned;
2504 env->low_signed = new_ir_mode("WS", irms_int_number, size_bits, 1,
2505 arithmetic, modulo_shift);
2506 env->low_unsigned = new_ir_mode("WU", irms_int_number, size_bits, 0,
2507 arithmetic, modulo_shift);
2513 void lower_dw_ops(const lwrdw_param_t *param)
2522 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2524 memset(&lenv, 0, sizeof(lenv));
2525 lenv.params = param;
2528 /* create the necessary maps */
2529 if (! intrinsic_fkt)
2530 intrinsic_fkt = new_set(cmp_op_mode, iro_Last + 1);
2532 conv_types = new_set(cmp_conv_tp, 16);
2534 lowered_type = pmap_create();
2536 /* create a primitive unsigned and signed type */
2538 tp_u = get_type_for_mode(lenv.low_unsigned);
2540 tp_s = get_type_for_mode(lenv.low_signed);
2542 /* create method types for the created binop calls */
2544 binop_tp_u = new_type_method(4, 2);
2545 set_method_param_type(binop_tp_u, 0, tp_u);
2546 set_method_param_type(binop_tp_u, 1, tp_u);
2547 set_method_param_type(binop_tp_u, 2, tp_u);
2548 set_method_param_type(binop_tp_u, 3, tp_u);
2549 set_method_res_type(binop_tp_u, 0, tp_u);
2550 set_method_res_type(binop_tp_u, 1, tp_u);
2553 binop_tp_s = new_type_method(4, 2);
2554 set_method_param_type(binop_tp_s, 0, tp_u);
2555 set_method_param_type(binop_tp_s, 1, tp_s);
2556 set_method_param_type(binop_tp_s, 2, tp_u);
2557 set_method_param_type(binop_tp_s, 3, tp_s);
2558 set_method_res_type(binop_tp_s, 0, tp_u);
2559 set_method_res_type(binop_tp_s, 1, tp_s);
2561 if (! shiftop_tp_u) {
2562 shiftop_tp_u = new_type_method(3, 2);
2563 set_method_param_type(shiftop_tp_u, 0, tp_u);
2564 set_method_param_type(shiftop_tp_u, 1, tp_u);
2565 set_method_param_type(shiftop_tp_u, 2, tp_u);
2566 set_method_res_type(shiftop_tp_u, 0, tp_u);
2567 set_method_res_type(shiftop_tp_u, 1, tp_u);
2569 if (! shiftop_tp_s) {
2570 shiftop_tp_s = new_type_method(3, 2);
2571 set_method_param_type(shiftop_tp_s, 0, tp_u);
2572 set_method_param_type(shiftop_tp_s, 1, tp_s);
2573 set_method_param_type(shiftop_tp_s, 2, tp_u);
2574 set_method_res_type(shiftop_tp_s, 0, tp_u);
2575 set_method_res_type(shiftop_tp_s, 1, tp_s);
2578 unop_tp_u = new_type_method(2, 2);
2579 set_method_param_type(unop_tp_u, 0, tp_u);
2580 set_method_param_type(unop_tp_u, 1, tp_u);
2581 set_method_res_type(unop_tp_u, 0, tp_u);
2582 set_method_res_type(unop_tp_u, 1, tp_u);
2585 unop_tp_s = new_type_method(2, 2);
2586 set_method_param_type(unop_tp_s, 0, tp_u);
2587 set_method_param_type(unop_tp_s, 1, tp_s);
2588 set_method_res_type(unop_tp_s, 0, tp_u);
2589 set_method_res_type(unop_tp_s, 1, tp_s);
2592 lenv.tv_mode_bytes = new_tarval_from_long(param->doubleword_size/(2*8), lenv.low_unsigned);
2593 lenv.tv_mode_bits = new_tarval_from_long(param->doubleword_size/2, lenv.low_unsigned);
2594 lenv.waitq = new_pdeq();
2595 lenv.first_id = new_id_from_chars(param->little_endian ? ".l" : ".h", 2);
2596 lenv.next_id = new_id_from_chars(param->little_endian ? ".h" : ".l", 2);
2598 /* first clear the generic function pointer for all ops */
2599 clear_irp_opcodes_generic_func();
2601 #define LOWER2(op, fkt) enter_lower_func(op_##op, fkt)
2602 #define LOWER(op) LOWER2(op, lower_##op)
2603 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2604 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2606 /* the table of all operations that must be lowered follows */
2643 /* transform all graphs */
2644 rem = current_ir_graph;
2645 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2646 ir_graph *irg = get_irp_irg(i);
2651 obstack_init(&lenv.obst);
2653 n_idx = get_irg_last_idx(irg);
2654 n_idx = n_idx + (n_idx >> 2); /* add 25% */
2655 lenv.n_entries = n_idx;
2656 lenv.entries = NEW_ARR_F(node_entry_t *, n_idx);
2657 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2661 lenv.proj_2_block = pmap_create();
2662 lenv.value_param_tp = NULL;
2663 ir_reserve_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2665 ent = get_irg_entity(irg);
2666 mtp = get_entity_type(ent);
2668 if (mtp_must_be_lowered(mtp, &lenv)) {
2669 ir_type *ltp = lower_mtp(mtp, &lenv);
2670 lenv.flags |= MUST_BE_LOWERED;
2671 set_entity_type(ent, ltp);
2673 lenv.value_param_tp = get_method_value_param_type(mtp);
2676 /* first step: link all nodes and allocate data */
2677 irg_walk_graph(irg, firm_clear_node_and_phi_links, prepare_links_and_handle_rotl, &lenv);
2679 if (lenv.flags & MUST_BE_LOWERED) {
2680 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2682 /* must do some work */
2683 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2685 /* last step: all waiting nodes */
2686 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2687 current_ir_graph = irg;
2688 while (! pdeq_empty(lenv.waitq)) {
2689 ir_node *node = pdeq_getl(lenv.waitq);
2691 lower_ops(node, &lenv);
2694 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2696 /* outs are invalid, we changed the graph */
2697 set_irg_outs_inconsistent(irg);
2699 if (lenv.flags & CF_CHANGED) {
2700 /* control flow changed, dominance info is invalid */
2701 set_irg_doms_inconsistent(irg);
2702 set_irg_extblk_inconsistent(irg);
2703 set_irg_loopinfo_inconsistent(irg);
2706 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2708 pmap_destroy(lenv.proj_2_block);
2709 DEL_ARR_F(lenv.entries);
2710 obstack_free(&lenv.obst, NULL);
2712 del_pdeq(lenv.waitq);
2713 current_ir_graph = rem;
2714 } /* lower_dw_ops */
2716 /* Default implementation. */
2717 ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2718 const ir_mode *imode, const ir_mode *omode,
2726 if (imode == omode) {
2727 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2729 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2730 get_mode_name(imode), get_mode_name(omode));
2732 id = new_id_from_str(buf);
2734 ent = new_entity(get_glob_type(), id, method);
2735 set_entity_ld_ident(ent, get_entity_ident(ent));
2737 } /* def_create_intrinsic_fkt */