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
41 #include "irgraph_t.h"
46 #include "dbginfo_t.h"
47 #include "iropt_dbg.h"
61 /** A map from mode to a primitive type. */
62 static pmap *prim_types;
64 /** A map from (op, imode, omode) to Intrinsic functions entities. */
65 static set *intrinsic_fkt;
67 /** A map from (imode, omode) to conv function types. */
68 static set *conv_types;
70 /** A map from a method type to its lowered type. */
71 static pmap *lowered_type;
73 /** The types for the binop and unop intrinsics. */
74 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;
76 /** the debug handle */
77 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
80 * An entry in the (op, imode, omode) -> entity map.
82 typedef struct _op_mode_entry {
83 const ir_op *op; /**< the op */
84 const ir_mode *imode; /**< the input mode */
85 const ir_mode *omode; /**< the output mode */
86 ir_entity *ent; /**< the associated entity of this (op, imode, omode) triple */
90 * An entry in the (imode, omode) -> tp map.
92 typedef struct _conv_tp_entry {
93 const ir_mode *imode; /**< the input mode */
94 const ir_mode *omode; /**< the output mode */
95 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
99 * Every double word node will be replaced,
100 * we need some store to hold the replacement:
102 typedef struct _node_entry_t {
103 ir_node *low_word; /**< the low word */
104 ir_node *high_word; /**< the high word */
108 MUST_BE_LOWERED = 1, /**< graph must be lowered */
109 CF_CHANGED = 2, /**< control flow was changed */
113 * The lower environment.
115 typedef struct _lower_env_t {
116 node_entry_t **entries; /**< entries per node */
117 struct obstack obst; /**< an obstack holding the temporary data */
118 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
119 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
120 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
121 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
122 const lwrdw_param_t *params; /**< transformation parameter */
123 unsigned flags; /**< some flags */
124 int n_entries; /**< number of entries */
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(new_id_from_str(buf), 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;
161 if (imode == env->params->high_signed || imode == env->params->high_unsigned)
163 if (omode == env->params->high_signed || omode == env->params->high_unsigned)
166 /* create a new one */
167 snprintf(buf, sizeof(buf), "LConv%s%s", get_mode_name(imode), get_mode_name(omode));
168 mtd = new_type_method(new_id_from_str(buf), n_param, n_res);
170 /* set param types and result types */
172 if (imode == env->params->high_signed) {
173 set_method_param_type(mtd, n_param++, tp_u);
174 set_method_param_type(mtd, n_param++, tp_s);
175 } else if (imode == env->params->high_unsigned) {
176 set_method_param_type(mtd, n_param++, tp_u);
177 set_method_param_type(mtd, n_param++, tp_u);
179 ir_type *tp = get_primitive_type(imode);
180 set_method_param_type(mtd, n_param++, tp);
184 if (omode == env->params->high_signed) {
185 set_method_res_type(mtd, n_res++, tp_u);
186 set_method_res_type(mtd, n_res++, tp_s);
187 } else if (omode == env->params->high_unsigned) {
188 set_method_res_type(mtd, n_res++, tp_u);
189 set_method_res_type(mtd, n_res++, tp_u);
191 ir_type *tp = get_primitive_type(omode);
192 set_method_res_type(mtd, n_res++, tp);
199 } /* get_conv_type */
202 * Add an additional control flow input to a block.
203 * Patch all Phi nodes. The new Phi inputs are copied from
204 * old input number nr.
206 static void add_block_cf_input_nr(ir_node *block, int nr, ir_node *cf)
208 int i, arity = get_irn_arity(block);
213 NEW_ARR_A(ir_node *, in, arity + 1);
214 for (i = 0; i < arity; ++i)
215 in[i] = get_irn_n(block, i);
218 set_irn_in(block, i + 1, in);
220 for (phi = get_irn_link(block); phi; phi = get_irn_link(phi)) {
221 for (i = 0; i < arity; ++i)
222 in[i] = get_irn_n(phi, i);
224 set_irn_in(phi, i + 1, in);
226 } /* add_block_cf_input_nr */
229 * Add an additional control flow input to a block.
230 * Patch all Phi nodes. The new Phi inputs are copied from
231 * old input from cf tmpl.
233 static void add_block_cf_input(ir_node *block, ir_node *tmpl, ir_node *cf)
235 int i, arity = get_irn_arity(block);
238 for (i = 0; i < arity; ++i) {
239 if (get_irn_n(block, i) == tmpl) {
245 add_block_cf_input_nr(block, nr, cf);
246 } /* add_block_cf_input */
249 * Return the "operational" mode of a Firm node.
251 static ir_mode *get_irn_op_mode(ir_node *node)
253 switch (get_irn_opcode(node)) {
255 return get_Load_mode(node);
257 return get_irn_mode(get_Store_value(node));
259 return get_irn_mode(get_DivMod_left(node));
261 return get_irn_mode(get_Div_left(node));
263 return get_irn_mode(get_Mod_left(node));
265 return get_irn_mode(get_Cmp_left(node));
267 return get_irn_mode(node);
269 } /* get_irn_op_mode */
272 * Walker, prepare the node links.
274 static void prepare_links(ir_node *node, void *env)
276 lower_env_t *lenv = env;
277 ir_mode *mode = get_irn_op_mode(node);
281 if (mode == lenv->params->high_signed ||
282 mode == lenv->params->high_unsigned) {
283 /* ok, found a node that will be lowered */
284 link = obstack_alloc(&lenv->obst, sizeof(*link));
286 memset(link, 0, sizeof(*link));
288 idx = get_irn_idx(node);
289 if (idx >= lenv->n_entries) {
290 /* enlarge: this happens only for Rotl nodes which is RARELY */
291 int old = lenv->n_entries;
292 int n_idx = idx + (idx >> 3);
294 ARR_RESIZE(node_entry_t *, lenv->entries, n_idx);
295 memset(&lenv->entries[old], 0, (n_idx - old) * sizeof(lenv->entries[0]));
296 lenv->n_entries = n_idx;
298 lenv->entries[idx] = link;
299 lenv->flags |= MUST_BE_LOWERED;
300 } else if (is_Conv(node)) {
301 /* Conv nodes have two modes */
302 ir_node *pred = get_Conv_op(node);
303 mode = get_irn_mode(pred);
305 if (mode == lenv->params->high_signed ||
306 mode == lenv->params->high_unsigned) {
307 /* must lower this node either but don't need a link */
308 lenv->flags |= MUST_BE_LOWERED;
314 /* link all Proj nodes to its predecessor:
315 Note that Tuple Proj's and its Projs are linked either. */
316 ir_node *pred = get_Proj_pred(node);
318 set_irn_link(node, get_irn_link(pred));
319 set_irn_link(pred, node);
320 } else if (is_Phi(node)) {
321 /* link all Phi nodes to its block */
322 ir_node *block = get_nodes_block(node);
324 set_irn_link(node, get_irn_link(block));
325 set_irn_link(block, node);
326 } else if (is_Block(node)) {
327 /* fill the Proj -> Block map */
328 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
329 ir_node *pred = get_Block_cfgpred(node, i);
332 pmap_insert(lenv->proj_2_block, pred, node);
335 } /* prepare_links */
338 * Translate a Constant: create two.
340 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env) {
341 tarval *tv, *tv_l, *tv_h;
343 dbg_info *dbg = get_irn_dbg_info(node);
344 ir_node *block = get_nodes_block(node);
346 ir_graph *irg = current_ir_graph;
347 ir_mode *low_mode = env->params->low_unsigned;
349 tv = get_Const_tarval(node);
351 tv_l = tarval_convert_to(tv, low_mode);
352 low = new_rd_Const(dbg, irg, block, low_mode, tv_l);
354 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
355 high = new_rd_Const(dbg, irg, block, mode, tv_h);
357 idx = get_irn_idx(node);
358 assert(idx < env->n_entries);
359 env->entries[idx]->low_word = low;
360 env->entries[idx]->high_word = high;
364 * Translate a Load: create two.
366 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env) {
367 ir_mode *low_mode = env->params->low_unsigned;
368 ir_graph *irg = current_ir_graph;
369 ir_node *adr = get_Load_ptr(node);
370 ir_node *mem = get_Load_mem(node);
371 ir_node *low, *high, *proj;
373 ir_node *block = get_nodes_block(node);
376 if (env->params->little_endian) {
378 high = new_r_Add(irg, block, adr,
379 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
382 low = new_r_Add(irg, block, adr,
383 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
388 /* create two loads */
389 dbg = get_irn_dbg_info(node);
390 low = new_rd_Load(dbg, irg, block, mem, low, low_mode);
391 proj = new_r_Proj(irg, block, low, mode_M, pn_Load_M);
392 high = new_rd_Load(dbg, irg, block, proj, high, mode);
394 set_Load_volatility(low, get_Load_volatility(node));
395 set_Load_volatility(high, get_Load_volatility(node));
397 idx = get_irn_idx(node);
398 assert(idx < env->n_entries);
399 env->entries[idx]->low_word = low;
400 env->entries[idx]->high_word = high;
402 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
403 idx = get_irn_idx(proj);
405 switch (get_Proj_proj(proj)) {
406 case pn_Load_M: /* Memory result. */
407 /* put it to the second one */
408 set_Proj_pred(proj, high);
410 case pn_Load_X_except: /* Execution result if exception occurred. */
411 /* put it to the first one */
412 set_Proj_pred(proj, low);
414 case pn_Load_res: /* Result of load operation. */
415 assert(idx < env->n_entries);
416 env->entries[idx]->low_word = new_r_Proj(irg, block, low, low_mode, pn_Load_res);
417 env->entries[idx]->high_word = new_r_Proj(irg, block, high, mode, pn_Load_res);
420 assert(0 && "unexpected Proj number");
422 /* mark this proj: we have handled it already, otherwise we might fall into
424 mark_irn_visited(proj);
429 * Translate a Store: create two.
431 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env) {
433 ir_node *block, *adr, *mem;
434 ir_node *low, *high, *irn, *proj;
441 irn = get_Store_value(node);
442 entry = env->entries[get_irn_idx(irn)];
445 if (! entry->low_word) {
446 /* not ready yet, wait */
447 pdeq_putr(env->waitq, node);
451 irg = current_ir_graph;
452 adr = get_Store_ptr(node);
453 mem = get_Store_mem(node);
454 block = get_nodes_block(node);
456 if (env->params->little_endian) {
458 high = new_r_Add(irg, block, adr,
459 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
462 low = new_r_Add(irg, block, adr,
463 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
468 /* create two Stores */
469 dbg = get_irn_dbg_info(node);
470 low = new_rd_Store(dbg, irg, block, mem, low, entry->low_word);
471 proj = new_r_Proj(irg, block, low, mode_M, pn_Store_M);
472 high = new_rd_Store(dbg, irg, block, proj, high, entry->high_word);
474 set_Store_volatility(low, get_Store_volatility(node));
475 set_Store_volatility(high, get_Store_volatility(node));
477 idx = get_irn_idx(node);
478 assert(idx < env->n_entries);
479 env->entries[idx]->low_word = low;
480 env->entries[idx]->high_word = high;
482 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
483 idx = get_irn_idx(proj);
485 switch (get_Proj_proj(proj)) {
486 case pn_Store_M: /* Memory result. */
487 /* put it to the second one */
488 set_Proj_pred(proj, high);
490 case pn_Store_X_except: /* Execution result if exception occurred. */
491 /* put it to the first one */
492 set_Proj_pred(proj, low);
495 assert(0 && "unexpected Proj number");
497 /* mark this proj: we have handled it already, otherwise we might fall into
499 mark_irn_visited(proj);
504 * Return a node containing the address of the intrinsic emulation function.
506 * @param method the method type of the emulation function
507 * @param op the emulated ir_op
508 * @param imode the input mode of the emulated opcode
509 * @param omode the output mode of the emulated opcode
510 * @param block where the new mode is created
511 * @param env the lower environment
513 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
514 ir_mode *imode, ir_mode *omode,
515 ir_node *block, lower_env_t *env) {
518 op_mode_entry_t key, *entry;
525 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
526 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
528 /* create a new one */
529 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
531 assert(ent && "Intrinsic creator must return an entity");
537 return new_r_SymConst(current_ir_graph, block, mode_P_code, sym, symconst_addr_ent);
538 } /* get_intrinsic_address */
543 * Create an intrinsic Call.
545 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env) {
546 ir_node *block, *irn, *call, *proj;
555 irn = get_Div_left(node);
556 entry = env->entries[get_irn_idx(irn)];
559 if (! entry->low_word) {
560 /* not ready yet, wait */
561 pdeq_putr(env->waitq, node);
565 in[0] = entry->low_word;
566 in[1] = entry->high_word;
568 irn = get_Div_right(node);
569 entry = env->entries[get_irn_idx(irn)];
572 if (! entry->low_word) {
573 /* not ready yet, wait */
574 pdeq_putr(env->waitq, node);
578 in[2] = entry->low_word;
579 in[3] = entry->high_word;
581 dbg = get_irn_dbg_info(node);
582 block = get_nodes_block(node);
583 irg = current_ir_graph;
585 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
586 opmode = get_irn_op_mode(node);
587 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, block, env);
588 call = new_rd_Call(dbg, irg, block, get_Div_mem(node),
590 set_irn_pinned(call, get_irn_pinned(node));
591 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
593 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
594 switch (get_Proj_proj(proj)) {
595 case pn_Div_M: /* Memory result. */
596 /* reroute to the call */
597 set_Proj_pred(proj, call);
598 set_Proj_proj(proj, pn_Call_M_except);
600 case pn_Div_X_except: /* Execution result if exception occurred. */
601 /* reroute to the call */
602 set_Proj_pred(proj, call);
603 set_Proj_proj(proj, pn_Call_X_except);
605 case pn_Div_res: /* Result of computation. */
606 idx = get_irn_idx(proj);
607 assert(idx < env->n_entries);
608 env->entries[idx]->low_word = new_r_Proj(current_ir_graph, block, irn, env->params->low_unsigned, 0);
609 env->entries[idx]->high_word = new_r_Proj(current_ir_graph, block, irn, mode, 1);
612 assert(0 && "unexpected Proj number");
614 /* mark this proj: we have handled it already, otherwise we might fall into
616 mark_irn_visited(proj);
623 * Create an intrinsic Call.
625 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env) {
626 ir_node *block, *proj, *irn, *call;
635 irn = get_Mod_left(node);
636 entry = env->entries[get_irn_idx(irn)];
639 if (! entry->low_word) {
640 /* not ready yet, wait */
641 pdeq_putr(env->waitq, node);
645 in[0] = entry->low_word;
646 in[1] = entry->high_word;
648 irn = get_Mod_right(node);
649 entry = env->entries[get_irn_idx(irn)];
652 if (! entry->low_word) {
653 /* not ready yet, wait */
654 pdeq_putr(env->waitq, node);
658 in[2] = entry->low_word;
659 in[3] = entry->high_word;
661 dbg = get_irn_dbg_info(node);
662 block = get_nodes_block(node);
663 irg = current_ir_graph;
665 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
666 opmode = get_irn_op_mode(node);
667 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, block, env);
668 call = new_rd_Call(dbg, irg, block, get_Mod_mem(node),
670 set_irn_pinned(call, get_irn_pinned(node));
671 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
673 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
674 switch (get_Proj_proj(proj)) {
675 case pn_Mod_M: /* Memory result. */
676 /* reroute to the call */
677 set_Proj_pred(proj, call);
678 set_Proj_proj(proj, pn_Call_M_except);
680 case pn_Mod_X_except: /* Execution result if exception occurred. */
681 /* reroute to the call */
682 set_Proj_pred(proj, call);
683 set_Proj_proj(proj, pn_Call_X_except);
685 case pn_Mod_res: /* Result of computation. */
686 idx = get_irn_idx(proj);
687 assert(idx < env->n_entries);
688 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, env->params->low_unsigned, 0);
689 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
692 assert(0 && "unexpected Proj number");
694 /* mark this proj: we have handled it already, otherwise we might fall into
696 mark_irn_visited(proj);
701 * Translate a DivMod.
703 * Create two intrinsic Calls.
705 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env) {
706 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
707 ir_node *resDiv = NULL;
708 ir_node *resMod = NULL;
718 /* check if both results are needed */
719 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
720 switch (get_Proj_proj(proj)) {
721 case pn_DivMod_res_div: flags |= 1; break;
722 case pn_DivMod_res_mod: flags |= 2; break;
727 irn = get_DivMod_left(node);
728 entry = env->entries[get_irn_idx(irn)];
731 if (! entry->low_word) {
732 /* not ready yet, wait */
733 pdeq_putr(env->waitq, node);
737 in[0] = entry->low_word;
738 in[1] = entry->high_word;
740 irn = get_DivMod_right(node);
741 entry = env->entries[get_irn_idx(irn)];
744 if (! entry->low_word) {
745 /* not ready yet, wait */
746 pdeq_putr(env->waitq, node);
750 in[2] = entry->low_word;
751 in[3] = entry->high_word;
753 dbg = get_irn_dbg_info(node);
754 block = get_nodes_block(node);
755 irg = current_ir_graph;
757 mem = get_DivMod_mem(node);
759 callDiv = callMod = NULL;
760 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
762 opmode = get_irn_op_mode(node);
763 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, block, env);
764 callDiv = new_rd_Call(dbg, irg, block, mem,
766 set_irn_pinned(callDiv, get_irn_pinned(node));
767 resDiv = new_r_Proj(irg, block, callDiv, mode_T, pn_Call_T_result);
771 mem = new_r_Proj(irg, block, callDiv, mode_M, pn_Call_M);
772 opmode = get_irn_op_mode(node);
773 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, block, env);
774 callMod = new_rd_Call(dbg, irg, block, mem,
776 set_irn_pinned(callMod, get_irn_pinned(node));
777 resMod = new_r_Proj(irg, block, callMod, mode_T, pn_Call_T_result);
780 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
781 switch (get_Proj_proj(proj)) {
782 case pn_DivMod_M: /* Memory result. */
783 /* reroute to the first call */
784 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
785 set_Proj_proj(proj, pn_Call_M_except);
787 case pn_DivMod_X_except: /* Execution result if exception occurred. */
788 /* reroute to the first call */
789 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
790 set_Proj_proj(proj, pn_Call_X_except);
792 case pn_DivMod_res_div: /* Result of Div. */
793 idx = get_irn_idx(proj);
794 assert(idx < env->n_entries);
795 env->entries[idx]->low_word = new_r_Proj(irg, block, resDiv, env->params->low_unsigned, 0);
796 env->entries[idx]->high_word = new_r_Proj(irg, block, resDiv, mode, 1);
798 case pn_DivMod_res_mod: /* Result of Mod. */
799 idx = get_irn_idx(proj);
800 env->entries[idx]->low_word = new_r_Proj(irg, block, resMod, env->params->low_unsigned, 0);
801 env->entries[idx]->high_word = new_r_Proj(irg, block, resMod, mode, 1);
804 assert(0 && "unexpected Proj number");
806 /* mark this proj: we have handled it already, otherwise we might fall into
808 mark_irn_visited(proj);
815 * Create an intrinsic Call.
817 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env) {
818 ir_node *block, *irn;
826 irn = get_binop_left(node);
827 entry = env->entries[get_irn_idx(irn)];
830 if (! entry->low_word) {
831 /* not ready yet, wait */
832 pdeq_putr(env->waitq, node);
836 in[0] = entry->low_word;
837 in[1] = entry->high_word;
839 irn = get_binop_right(node);
840 entry = env->entries[get_irn_idx(irn)];
843 if (! entry->low_word) {
844 /* not ready yet, wait */
845 pdeq_putr(env->waitq, node);
849 in[2] = entry->low_word;
850 in[3] = entry->high_word;
852 dbg = get_irn_dbg_info(node);
853 block = get_nodes_block(node);
854 irg = current_ir_graph;
856 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
857 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
858 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
860 set_irn_pinned(irn, get_irn_pinned(node));
861 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
863 idx = get_irn_idx(node);
864 assert(idx < env->n_entries);
865 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, env->params->low_unsigned, 0);
866 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
870 * Translate a Shiftop.
872 * Create an intrinsic Call.
874 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env) {
875 ir_node *block, *irn;
883 irn = get_binop_left(node);
884 entry = env->entries[get_irn_idx(irn)];
887 if (! entry->low_word) {
888 /* not ready yet, wait */
889 pdeq_putr(env->waitq, node);
893 in[0] = entry->low_word;
894 in[1] = entry->high_word;
896 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
897 in[2] = get_binop_right(node);
899 dbg = get_irn_dbg_info(node);
900 block = get_nodes_block(node);
901 irg = current_ir_graph;
903 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
904 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
905 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
907 set_irn_pinned(irn, get_irn_pinned(node));
908 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
910 idx = get_irn_idx(node);
911 assert(idx < env->n_entries);
912 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, env->params->low_unsigned, 0);
913 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
914 } /* lower_Shiftop */
917 * Translate a Shr and handle special cases.
919 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env) {
920 ir_node *right = get_Shr_right(node);
921 ir_graph *irg = current_ir_graph;
923 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
924 tarval *tv = get_Const_tarval(right);
926 if (tarval_is_long(tv) &&
927 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
928 ir_node *block = get_nodes_block(node);
929 ir_node *left = get_Shr_left(node);
931 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
932 int idx = get_irn_idx(left);
934 left = env->entries[idx]->high_word;
935 idx = get_irn_idx(node);
938 c = new_r_Const_long(irg, block, env->params->low_unsigned, shf_cnt);
939 env->entries[idx]->low_word = new_r_Shr(irg, block, left, c, mode);
941 env->entries[idx]->low_word = left;
943 env->entries[idx]->high_word = new_r_Const(irg, block, mode, get_mode_null(mode));
948 lower_Shiftop(node, mode, env);
952 * Translate a Shl and handle special cases.
954 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env) {
955 ir_node *right = get_Shl_right(node);
956 ir_graph *irg = current_ir_graph;
958 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
959 tarval *tv = get_Const_tarval(right);
961 if (tarval_is_long(tv) &&
962 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
964 ir_node *block = get_nodes_block(node);
965 ir_node *left = get_Shl_left(node);
967 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
968 int idx = get_irn_idx(left);
970 left = new_r_Conv(irg, block, env->entries[idx]->low_word, mode);
971 idx = get_irn_idx(node);
973 mode_l = env->params->low_unsigned;
975 c = new_r_Const_long(irg, block, mode_l, shf_cnt);
976 env->entries[idx]->high_word = new_r_Shl(irg, block, left, c, mode);
978 env->entries[idx]->high_word = left;
980 env->entries[idx]->low_word = new_r_Const(irg, block, mode_l, get_mode_null(mode_l));
985 lower_Shiftop(node, mode, env);
989 * Translate a Shrs and handle special cases.
991 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env) {
992 ir_node *right = get_Shrs_right(node);
993 ir_graph *irg = current_ir_graph;
995 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
996 tarval *tv = get_Const_tarval(right);
998 if (tarval_is_long(tv) &&
999 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
1000 ir_node *block = get_nodes_block(node);
1001 ir_node *left = get_Shrs_left(node);
1002 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
1003 int idx = get_irn_idx(left);
1008 left = env->entries[idx]->high_word;
1009 idx = get_irn_idx(node);
1011 mode_l = env->params->low_unsigned;
1013 c = new_r_Const_long(irg, block, mode_l, shf_cnt);
1014 low = new_r_Shrs(irg, block, left, c, mode);
1018 /* low word is expected to have mode_l */
1019 env->entries[idx]->low_word = new_r_Conv(irg, block, low, mode_l);
1021 c = new_r_Const_long(irg, block, mode_l, get_mode_size_bits(mode) - 1);
1022 env->entries[idx]->high_word = new_r_Shrs(irg, block, left, c, mode);
1027 lower_Shiftop(node, mode, env);
1031 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1033 static void prepare_links_and_handle_rotl(ir_node *node, void *env) {
1034 lower_env_t *lenv = env;
1036 if (is_Rotl(node)) {
1037 ir_mode *mode = get_irn_op_mode(node);
1038 if (mode == lenv->params->high_signed ||
1039 mode == lenv->params->high_unsigned) {
1040 ir_node *right = get_Rotl_right(node);
1041 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1042 ir_mode *omode, *rmode;
1045 optimization_state_t state;
1047 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1048 tarval *tv = get_Const_tarval(right);
1050 if (tarval_is_long(tv) &&
1051 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1052 /* will be optimized in lower_Rotl() */
1057 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1058 dbg = get_irn_dbg_info(node);
1059 omode = get_irn_mode(node);
1060 left = get_Rotl_left(node);
1061 irg = current_ir_graph;
1062 block = get_nodes_block(node);
1063 shl = new_rd_Shl(dbg, irg, block, left, right, omode);
1064 rmode = get_irn_mode(right);
1065 c = new_Const_long(rmode, get_mode_size_bits(omode));
1066 sub = new_rd_Sub(dbg, irg, block, c, right, rmode);
1067 shr = new_rd_Shr(dbg, irg, block, left, sub, omode);
1069 /* optimization must be switched off here, or we will get the Rotl back */
1070 save_optimization_state(&state);
1071 set_opt_algebraic_simplification(0);
1072 or = new_rd_Or(dbg, irg, block, shl, shr, omode);
1073 restore_optimization_state(&state);
1077 /* do lowering on the new nodes */
1078 prepare_links(shl, env);
1079 prepare_links(c, env);
1080 prepare_links(sub, env);
1081 prepare_links(shr, env);
1082 prepare_links(or, env);
1085 prepare_links(node, env);
1090 * Translate a special case Rotl(x, sizeof(w)).
1092 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env) {
1093 ir_node *right = get_Rotl_right(node);
1094 ir_node *left = get_Rotl_left(node);
1096 int idx = get_irn_idx(left);
1100 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1101 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1102 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1104 l = env->entries[idx]->low_word;
1105 h = env->entries[idx]->high_word;
1106 idx = get_irn_idx(node);
1108 env->entries[idx]->low_word = h;
1109 env->entries[idx]->high_word = l;
1113 * Translate an Unop.
1115 * Create an intrinsic Call.
1117 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env) {
1118 ir_node *block, *irn;
1124 node_entry_t *entry;
1126 irn = get_unop_op(node);
1127 entry = env->entries[get_irn_idx(irn)];
1130 if (! entry->low_word) {
1131 /* not ready yet, wait */
1132 pdeq_putr(env->waitq, node);
1136 in[0] = entry->low_word;
1137 in[1] = entry->high_word;
1139 dbg = get_irn_dbg_info(node);
1140 block = get_nodes_block(node);
1141 irg = current_ir_graph;
1143 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1144 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
1145 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
1147 set_irn_pinned(irn, get_irn_pinned(node));
1148 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
1150 idx = get_irn_idx(node);
1151 assert(idx < env->n_entries);
1152 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, env->params->low_unsigned, 0);
1153 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
1157 * Translate a logical Binop.
1159 * Create two logical Binops.
1161 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1162 ir_node *(*constr_rd)(dbg_info *db, ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1163 ir_node *block, *irn;
1164 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1168 node_entry_t *entry;
1170 irn = get_binop_left(node);
1171 entry = env->entries[get_irn_idx(irn)];
1174 if (! entry->low_word) {
1175 /* not ready yet, wait */
1176 pdeq_putr(env->waitq, node);
1180 lop_l = entry->low_word;
1181 lop_h = entry->high_word;
1183 irn = get_binop_right(node);
1184 entry = env->entries[get_irn_idx(irn)];
1187 if (! entry->low_word) {
1188 /* not ready yet, wait */
1189 pdeq_putr(env->waitq, node);
1193 rop_l = entry->low_word;
1194 rop_h = entry->high_word;
1196 dbg = get_irn_dbg_info(node);
1197 block = get_nodes_block(node);
1199 idx = get_irn_idx(node);
1200 assert(idx < env->n_entries);
1201 irg = current_ir_graph;
1202 env->entries[idx]->low_word = constr_rd(dbg, irg, block, lop_l, rop_l, env->params->low_unsigned);
1203 env->entries[idx]->high_word = constr_rd(dbg, irg, block, lop_h, rop_h, mode);
1204 } /* lower_Binop_logical */
1206 /** create a logical operation transformation */
1207 #define lower_logical(op) \
1208 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1209 lower_Binop_logical(node, mode, env, new_rd_##op); \
1219 * Create two logical Nots.
1221 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env) {
1222 ir_node *block, *irn;
1223 ir_node *op_l, *op_h;
1227 node_entry_t *entry;
1229 irn = get_Not_op(node);
1230 entry = env->entries[get_irn_idx(irn)];
1233 if (! entry->low_word) {
1234 /* not ready yet, wait */
1235 pdeq_putr(env->waitq, node);
1239 op_l = entry->low_word;
1240 op_h = entry->high_word;
1242 dbg = get_irn_dbg_info(node);
1243 block = get_nodes_block(node);
1244 irg = current_ir_graph;
1246 idx = get_irn_idx(node);
1247 assert(idx < env->n_entries);
1248 env->entries[idx]->low_word = new_rd_Not(dbg, current_ir_graph, block, op_l, env->params->low_unsigned);
1249 env->entries[idx]->high_word = new_rd_Not(dbg, current_ir_graph, block, op_h, mode);
1255 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env) {
1256 ir_node *cmp, *left, *right, *block;
1257 ir_node *sel = get_Cond_selector(node);
1258 ir_mode *m = get_irn_mode(sel);
1263 node_entry_t *lentry, *rentry;
1264 ir_node *proj, *projT = NULL, *projF = NULL;
1265 ir_node *new_bl, *cmpH, *cmpL, *irn;
1266 ir_node *projHF, *projHT;
1275 cmp = get_Proj_pred(sel);
1279 left = get_Cmp_left(cmp);
1280 idx = get_irn_idx(left);
1281 lentry = env->entries[idx];
1288 right = get_Cmp_right(cmp);
1289 idx = get_irn_idx(right);
1290 rentry = env->entries[idx];
1293 if (! lentry->low_word || !rentry->low_word) {
1295 pdeq_putr(env->waitq, node);
1299 /* all right, build the code */
1300 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1301 long proj_nr = get_Proj_proj(proj);
1303 if (proj_nr == pn_Cond_true) {
1304 assert(projT == NULL && "more than one Proj(true)");
1307 assert(proj_nr == pn_Cond_false);
1308 assert(projF == NULL && "more than one Proj(false)");
1311 mark_irn_visited(proj);
1313 assert(projT && projF);
1315 /* create a new high compare */
1316 block = get_nodes_block(node);
1317 dbg = get_irn_dbg_info(cmp);
1318 irg = current_ir_graph;
1319 pnc = get_Proj_proj(sel);
1321 if (is_Const(right) && is_Const_null(right)) {
1322 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1323 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1324 ir_mode *mode = env->params->low_unsigned;
1325 ir_node *low = new_r_Conv(irg, block, lentry->low_word, mode);
1326 ir_node *high = new_r_Conv(irg, block, lentry->high_word, mode);
1327 ir_node *or = new_rd_Or(dbg, irg, block, low, high, mode);
1328 ir_node *cmp = new_rd_Cmp(dbg, irg, block, or, new_Const_long(mode, 0));
1330 ir_node *proj = new_r_Proj(irg, block, cmp, mode_b, pnc);
1331 set_Cond_selector(node, proj);
1336 cmpH = new_rd_Cmp(dbg, irg, block, lentry->high_word, rentry->high_word);
1338 if (pnc == pn_Cmp_Eq) {
1339 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1340 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1343 dst_blk = entry->value;
1345 irn = new_r_Proj(irg, block, cmpH, mode_b, pn_Cmp_Eq);
1346 dbg = get_irn_dbg_info(node);
1347 irn = new_rd_Cond(dbg, irg, block, irn);
1349 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1350 mark_irn_visited(projHF);
1351 exchange(projF, projHF);
1353 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1354 mark_irn_visited(projHT);
1356 new_bl = new_r_Block(irg, 1, &projHT);
1358 dbg = get_irn_dbg_info(cmp);
1359 cmpL = new_rd_Cmp(dbg, irg, new_bl, lentry->low_word, rentry->low_word);
1360 irn = new_r_Proj(irg, new_bl, cmpL, mode_b, pn_Cmp_Eq);
1361 dbg = get_irn_dbg_info(node);
1362 irn = new_rd_Cond(dbg, irg, new_bl, irn);
1364 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_false);
1365 mark_irn_visited(proj);
1366 add_block_cf_input(dst_blk, projHF, proj);
1368 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_true);
1369 mark_irn_visited(proj);
1370 exchange(projT, proj);
1371 } else if (pnc == pn_Cmp_Lg) {
1372 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1373 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1376 dst_blk = entry->value;
1378 irn = new_r_Proj(irg, block, cmpH, mode_b, pn_Cmp_Lg);
1379 dbg = get_irn_dbg_info(node);
1380 irn = new_rd_Cond(dbg, irg, block, irn);
1382 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1383 mark_irn_visited(projHT);
1384 exchange(projT, projHT);
1386 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1387 mark_irn_visited(projHF);
1389 new_bl = new_r_Block(irg, 1, &projHF);
1391 dbg = get_irn_dbg_info(cmp);
1392 cmpL = new_rd_Cmp(dbg, irg, new_bl, lentry->low_word, rentry->low_word);
1393 irn = new_r_Proj(irg, new_bl, cmpL, mode_b, pn_Cmp_Lg);
1394 dbg = get_irn_dbg_info(node);
1395 irn = new_rd_Cond(dbg, irg, new_bl, irn);
1397 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_true);
1398 mark_irn_visited(proj);
1399 add_block_cf_input(dst_blk, projHT, proj);
1401 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_false);
1402 mark_irn_visited(proj);
1403 exchange(projF, proj);
1405 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1406 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1409 entry = pmap_find(env->proj_2_block, projT);
1411 dstT = entry->value;
1413 entry = pmap_find(env->proj_2_block, projF);
1415 dstF = entry->value;
1417 irn = new_r_Proj(irg, block, cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1418 dbg = get_irn_dbg_info(node);
1419 irn = new_rd_Cond(dbg, irg, block, irn);
1421 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1422 mark_irn_visited(projHT);
1423 exchange(projT, projHT);
1426 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1427 mark_irn_visited(projHF);
1429 newbl_eq = new_r_Block(irg, 1, &projHF);
1431 irn = new_r_Proj(irg, newbl_eq, cmpH, mode_b, pn_Cmp_Eq);
1432 irn = new_rd_Cond(dbg, irg, newbl_eq, irn);
1434 proj = new_r_Proj(irg, newbl_eq, irn, mode_X, pn_Cond_false);
1435 mark_irn_visited(proj);
1436 exchange(projF, proj);
1439 proj = new_r_Proj(irg, newbl_eq, irn, mode_X, pn_Cond_true);
1440 mark_irn_visited(proj);
1442 newbl_l = new_r_Block(irg, 1, &proj);
1444 dbg = get_irn_dbg_info(cmp);
1445 cmpL = new_rd_Cmp(dbg, irg, newbl_l, lentry->low_word, rentry->low_word);
1446 irn = new_r_Proj(irg, newbl_l, cmpL, mode_b, pnc);
1447 dbg = get_irn_dbg_info(node);
1448 irn = new_rd_Cond(dbg, irg, newbl_l, irn);
1450 proj = new_r_Proj(irg, newbl_l, irn, mode_X, pn_Cond_true);
1451 mark_irn_visited(proj);
1452 add_block_cf_input(dstT, projT, proj);
1454 proj = new_r_Proj(irg, newbl_l, irn, mode_X, pn_Cond_false);
1455 mark_irn_visited(proj);
1456 add_block_cf_input(dstF, projF, proj);
1459 /* we have changed the control flow */
1460 env->flags |= CF_CHANGED;
1462 idx = get_irn_idx(sel);
1464 if (env->entries[idx]) {
1466 Bad, a jump-table with double-word index.
1467 This should not happen, but if it does we handle
1468 it like a Conv were between (in other words, ignore
1472 if (! env->entries[idx]->low_word) {
1473 /* not ready yet, wait */
1474 pdeq_putr(env->waitq, node);
1477 set_Cond_selector(node, env->entries[idx]->low_word);
1483 * Translate a Conv to higher_signed
1485 static void lower_Conv_to_Ls(ir_node *node, lower_env_t *env) {
1486 ir_node *op = get_Conv_op(node);
1487 ir_mode *imode = get_irn_mode(op);
1488 ir_mode *dst_mode_l = env->params->low_unsigned;
1489 ir_mode *dst_mode_h = env->params->low_signed;
1490 int idx = get_irn_idx(node);
1491 ir_graph *irg = current_ir_graph;
1492 ir_node *block = get_nodes_block(node);
1493 dbg_info *dbg = get_irn_dbg_info(node);
1495 assert(idx < env->n_entries);
1497 if (mode_is_int(imode) || mode_is_reference(imode)) {
1498 if (imode == env->params->high_unsigned) {
1499 /* a Conv from Lu to Ls */
1500 int op_idx = get_irn_idx(op);
1502 if (! env->entries[op_idx]->low_word) {
1503 /* not ready yet, wait */
1504 pdeq_putr(env->waitq, node);
1507 env->entries[idx]->low_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->low_word, dst_mode_l);
1508 env->entries[idx]->high_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->high_word, dst_mode_h);
1510 /* simple case: create a high word */
1511 if (imode != dst_mode_l)
1512 op = new_rd_Conv(dbg, irg, block, op, dst_mode_l);
1514 env->entries[idx]->low_word = op;
1516 if (mode_is_signed(imode)) {
1517 ir_node *op_conv = new_rd_Conv(dbg, irg, block, op, dst_mode_h);
1518 env->entries[idx]->high_word = new_rd_Shrs(dbg, irg, block, op_conv,
1519 new_Const_long(dst_mode_l, get_mode_size_bits(dst_mode_h) - 1), dst_mode_h);
1521 env->entries[idx]->high_word = new_Const(dst_mode_h, get_mode_null(dst_mode_h));
1525 ir_node *irn, *call;
1526 ir_mode *omode = env->params->high_signed;
1527 ir_type *mtp = get_conv_type(imode, omode, env);
1529 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1530 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1531 set_irn_pinned(call, get_irn_pinned(node));
1532 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1534 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, dst_mode_l, 0);
1535 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, dst_mode_h, 1);
1537 } /* lower_Conv_to_Ls */
1540 * Translate a Conv to higher_unsigned
1542 static void lower_Conv_to_Lu(ir_node *node, lower_env_t *env) {
1543 ir_node *op = get_Conv_op(node);
1544 ir_mode *imode = get_irn_mode(op);
1545 ir_mode *dst_mode = env->params->low_unsigned;
1546 int idx = get_irn_idx(node);
1547 ir_graph *irg = current_ir_graph;
1548 ir_node *block = get_nodes_block(node);
1549 dbg_info *dbg = get_irn_dbg_info(node);
1551 assert(idx < env->n_entries);
1553 if (mode_is_int(imode) || mode_is_reference(imode)) {
1554 if (imode == env->params->high_signed) {
1555 /* a Conv from Ls to Lu */
1556 int op_idx = get_irn_idx(op);
1558 if (! env->entries[op_idx]->low_word) {
1559 /* not ready yet, wait */
1560 pdeq_putr(env->waitq, node);
1563 env->entries[idx]->low_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->low_word, dst_mode);
1564 env->entries[idx]->high_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->high_word, dst_mode);
1566 /* simple case: create a high word */
1567 if (imode != dst_mode)
1568 op = new_rd_Conv(dbg, irg, block, op, dst_mode);
1570 env->entries[idx]->low_word = op;
1572 if (mode_is_signed(imode)) {
1573 env->entries[idx]->high_word = new_rd_Shrs(dbg, irg, block, op,
1574 new_Const_long(dst_mode, get_mode_size_bits(dst_mode) - 1), dst_mode);
1576 env->entries[idx]->high_word = new_Const(dst_mode, get_mode_null(dst_mode));
1580 ir_node *irn, *call;
1581 ir_mode *omode = env->params->high_unsigned;
1582 ir_type *mtp = get_conv_type(imode, omode, env);
1584 /* do an intrinsic call */
1585 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1586 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1587 set_irn_pinned(call, get_irn_pinned(node));
1588 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1590 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, dst_mode, 0);
1591 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, dst_mode, 1);
1593 } /* lower_Conv_to_Lu */
1596 * Translate a Conv from higher_signed
1598 static void lower_Conv_from_Ls(ir_node *node, lower_env_t *env) {
1599 ir_node *op = get_Conv_op(node);
1600 ir_mode *omode = get_irn_mode(node);
1601 ir_node *block = get_nodes_block(node);
1602 dbg_info *dbg = get_irn_dbg_info(node);
1603 int idx = get_irn_idx(op);
1604 ir_graph *irg = current_ir_graph;
1606 assert(idx < env->n_entries);
1608 if (! env->entries[idx]->low_word) {
1609 /* not ready yet, wait */
1610 pdeq_putr(env->waitq, node);
1614 if (mode_is_int(omode) || mode_is_reference(omode)) {
1615 op = env->entries[idx]->low_word;
1617 /* simple case: create a high word */
1618 if (omode != env->params->low_signed)
1619 op = new_rd_Conv(dbg, irg, block, op, omode);
1621 set_Conv_op(node, op);
1623 ir_node *irn, *call, *in[2];
1624 ir_mode *imode = env->params->high_signed;
1625 ir_type *mtp = get_conv_type(imode, omode, env);
1627 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1628 in[0] = env->entries[idx]->low_word;
1629 in[1] = env->entries[idx]->high_word;
1631 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1632 set_irn_pinned(call, get_irn_pinned(node));
1633 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1635 exchange(node, new_r_Proj(irg, block, irn, omode, 0));
1637 } /* lower_Conv_from_Ls */
1640 * Translate a Conv from higher_unsigned
1642 static void lower_Conv_from_Lu(ir_node *node, lower_env_t *env) {
1643 ir_node *op = get_Conv_op(node);
1644 ir_mode *omode = get_irn_mode(node);
1645 ir_node *block = get_nodes_block(node);
1646 dbg_info *dbg = get_irn_dbg_info(node);
1647 int idx = get_irn_idx(op);
1648 ir_graph *irg = current_ir_graph;
1650 assert(idx < env->n_entries);
1652 if (! env->entries[idx]->low_word) {
1653 /* not ready yet, wait */
1654 pdeq_putr(env->waitq, node);
1658 if (mode_is_int(omode) || mode_is_reference(omode)) {
1659 op = env->entries[idx]->low_word;
1661 /* simple case: create a high word */
1662 if (omode != env->params->low_unsigned)
1663 op = new_rd_Conv(dbg, irg, block, op, omode);
1665 set_Conv_op(node, op);
1667 ir_node *irn, *call, *in[2];
1668 ir_mode *imode = env->params->high_unsigned;
1669 ir_type *mtp = get_conv_type(imode, omode, env);
1671 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1672 in[0] = env->entries[idx]->low_word;
1673 in[1] = env->entries[idx]->high_word;
1675 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1676 set_irn_pinned(call, get_irn_pinned(node));
1677 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1679 exchange(node, new_r_Proj(irg, block, irn, omode, 0));
1681 } /* lower_Conv_from_Lu */
1686 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env) {
1687 mode = get_irn_mode(node);
1689 if (mode == env->params->high_signed) {
1690 lower_Conv_to_Ls(node, env);
1691 } else if (mode == env->params->high_unsigned) {
1692 lower_Conv_to_Lu(node, env);
1694 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1696 if (mode == env->params->high_signed) {
1697 lower_Conv_from_Ls(node, env);
1698 } else if (mode == env->params->high_unsigned) {
1699 lower_Conv_from_Lu(node, env);
1705 * Lower the method type.
1707 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env) {
1712 if (is_lowered_type(mtp))
1715 entry = pmap_find(lowered_type, mtp);
1717 int i, n, r, n_param, n_res;
1719 /* count new number of params */
1720 n_param = n = get_method_n_params(mtp);
1721 for (i = n_param - 1; i >= 0; --i) {
1722 ir_type *tp = get_method_param_type(mtp, i);
1724 if (is_Primitive_type(tp)) {
1725 ir_mode *mode = get_type_mode(tp);
1727 if (mode == env->params->high_signed ||
1728 mode == env->params->high_unsigned)
1733 /* count new number of results */
1734 n_res = r = get_method_n_ress(mtp);
1735 for (i = n_res - 1; i >= 0; --i) {
1736 ir_type *tp = get_method_res_type(mtp, i);
1738 if (is_Primitive_type(tp)) {
1739 ir_mode *mode = get_type_mode(tp);
1741 if (mode == env->params->high_signed ||
1742 mode == env->params->high_unsigned)
1747 id = id_mangle_u(new_id_from_chars("L", 1), get_type_ident(mtp));
1748 res = new_type_method(id, n_param, n_res);
1750 /* set param types and result types */
1751 for (i = n_param = 0; i < n; ++i) {
1752 ir_type *tp = get_method_param_type(mtp, i);
1754 if (is_Primitive_type(tp)) {
1755 ir_mode *mode = get_type_mode(tp);
1757 if (mode == env->params->high_signed) {
1758 set_method_param_type(res, n_param++, tp_u);
1759 set_method_param_type(res, n_param++, tp_s);
1760 } else if (mode == env->params->high_unsigned) {
1761 set_method_param_type(res, n_param++, tp_u);
1762 set_method_param_type(res, n_param++, tp_u);
1764 set_method_param_type(res, n_param++, tp);
1767 set_method_param_type(res, n_param++, tp);
1770 for (i = n_res = 0; i < r; ++i) {
1771 ir_type *tp = get_method_res_type(mtp, i);
1773 if (is_Primitive_type(tp)) {
1774 ir_mode *mode = get_type_mode(tp);
1776 if (mode == env->params->high_signed) {
1777 set_method_res_type(res, n_res++, tp_u);
1778 set_method_res_type(res, n_res++, tp_s);
1779 } else if (mode == env->params->high_unsigned) {
1780 set_method_res_type(res, n_res++, tp_u);
1781 set_method_res_type(res, n_res++, tp_u);
1783 set_method_res_type(res, n_res++, tp);
1786 set_method_res_type(res, n_res++, tp);
1789 set_lowered_type(mtp, res);
1790 pmap_insert(lowered_type, mtp, res);
1798 * Translate a Return.
1800 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env) {
1801 ir_graph *irg = current_ir_graph;
1802 ir_entity *ent = get_irg_entity(irg);
1803 ir_type *mtp = get_entity_type(ent);
1809 /* check if this return must be lowered */
1810 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1811 ir_node *pred = get_Return_res(node, i);
1812 ir_mode *mode = get_irn_op_mode(pred);
1814 if (mode == env->params->high_signed ||
1815 mode == env->params->high_unsigned) {
1816 idx = get_irn_idx(pred);
1817 if (! env->entries[idx]->low_word) {
1818 /* not ready yet, wait */
1819 pdeq_putr(env->waitq, node);
1828 ent = get_irg_entity(irg);
1829 mtp = get_entity_type(ent);
1831 mtp = lower_mtp(mtp, env);
1832 set_entity_type(ent, mtp);
1834 /* create a new in array */
1835 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1836 in[0] = get_Return_mem(node);
1838 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1839 ir_node *pred = get_Return_res(node, i);
1841 idx = get_irn_idx(pred);
1842 assert(idx < env->n_entries);
1844 if (env->entries[idx]) {
1845 in[++j] = env->entries[idx]->low_word;
1846 in[++j] = env->entries[idx]->high_word;
1852 set_irn_in(node, j+1, in);
1853 } /* lower_Return */
1856 * Translate the parameters.
1858 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env) {
1859 ir_graph *irg = current_ir_graph;
1860 ir_entity *ent = get_irg_entity(irg);
1861 ir_type *tp = get_entity_type(ent);
1864 int i, j, n_params, rem;
1865 ir_node *proj, *args;
1868 if (is_lowered_type(tp)) {
1869 mtp = get_associated_type(tp);
1873 assert(! is_lowered_type(mtp));
1875 n_params = get_method_n_params(mtp);
1879 NEW_ARR_A(long, new_projs, n_params);
1881 /* first check if we have parameters that must be fixed */
1882 for (i = j = 0; i < n_params; ++i, ++j) {
1883 ir_type *tp = get_method_param_type(mtp, i);
1886 if (is_Primitive_type(tp)) {
1887 ir_mode *mode = get_type_mode(tp);
1889 if (mode == env->params->high_signed ||
1890 mode == env->params->high_unsigned)
1897 mtp = lower_mtp(mtp, env);
1898 set_entity_type(ent, mtp);
1900 /* switch off optimization for new Proj nodes or they might be CSE'ed
1901 with not patched one's */
1902 rem = get_optimize();
1905 /* ok, fix all Proj's and create new ones */
1906 args = get_irg_args(irg);
1907 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1908 ir_node *pred = get_Proj_pred(proj);
1914 /* do not visit this node again */
1915 mark_irn_visited(proj);
1920 proj_nr = get_Proj_proj(proj);
1921 set_Proj_proj(proj, new_projs[proj_nr]);
1923 idx = get_irn_idx(proj);
1924 if (env->entries[idx]) {
1925 ir_mode *low_mode = env->params->low_unsigned;
1927 mode = get_irn_mode(proj);
1929 if (mode == env->params->high_signed) {
1930 mode = env->params->low_signed;
1932 mode = env->params->low_unsigned;
1935 dbg = get_irn_dbg_info(proj);
1936 env->entries[idx]->low_word =
1937 new_rd_Proj(dbg, irg, get_nodes_block(proj), args, low_mode, new_projs[proj_nr]);
1938 env->entries[idx]->high_word =
1939 new_rd_Proj(dbg, irg, get_nodes_block(proj), args, mode, new_projs[proj_nr] + 1);
1948 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env) {
1949 ir_graph *irg = current_ir_graph;
1950 ir_type *tp = get_Call_type(node);
1952 ir_node **in, *proj, *results;
1953 int n_params, n_res, need_lower = 0;
1955 long *res_numbers = NULL;
1958 if (is_lowered_type(tp)) {
1959 call_tp = get_associated_type(tp);
1964 assert(! is_lowered_type(call_tp));
1966 n_params = get_method_n_params(call_tp);
1967 for (i = 0; i < n_params; ++i) {
1968 ir_type *tp = get_method_param_type(call_tp, i);
1970 if (is_Primitive_type(tp)) {
1971 ir_mode *mode = get_type_mode(tp);
1973 if (mode == env->params->high_signed ||
1974 mode == env->params->high_unsigned) {
1980 n_res = get_method_n_ress(call_tp);
1982 NEW_ARR_A(long, res_numbers, n_res);
1984 for (i = j = 0; i < n_res; ++i, ++j) {
1985 ir_type *tp = get_method_res_type(call_tp, i);
1988 if (is_Primitive_type(tp)) {
1989 ir_mode *mode = get_type_mode(tp);
1991 if (mode == env->params->high_signed ||
1992 mode == env->params->high_unsigned) {
2003 /* let's lower it */
2004 call_tp = lower_mtp(call_tp, env);
2005 set_Call_type(node, call_tp);
2007 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
2009 in[0] = get_Call_mem(node);
2010 in[1] = get_Call_ptr(node);
2012 for (j = 2, i = 0; i < n_params; ++i) {
2013 ir_node *pred = get_Call_param(node, i);
2014 int idx = get_irn_idx(pred);
2016 if (env->entries[idx]) {
2017 if (! env->entries[idx]->low_word) {
2018 /* not ready yet, wait */
2019 pdeq_putr(env->waitq, node);
2022 in[j++] = env->entries[idx]->low_word;
2023 in[j++] = env->entries[idx]->high_word;
2029 set_irn_in(node, j, in);
2031 /* fix the results */
2033 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
2034 long proj_nr = get_Proj_proj(proj);
2036 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
2037 /* found the result proj */
2043 if (results) { /* there are results */
2044 int rem = get_optimize();
2046 /* switch off optimization for new Proj nodes or they might be CSE'ed
2047 with not patched one's */
2049 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2050 if (get_Proj_pred(proj) == results) {
2051 long proj_nr = get_Proj_proj(proj);
2054 /* found a result */
2055 set_Proj_proj(proj, res_numbers[proj_nr]);
2056 idx = get_irn_idx(proj);
2057 if (env->entries[idx]) {
2058 ir_mode *mode = get_irn_mode(proj);
2059 ir_mode *low_mode = env->params->low_unsigned;
2062 if (mode == env->params->high_signed) {
2063 mode = env->params->low_signed;
2065 mode = env->params->low_unsigned;
2068 dbg = get_irn_dbg_info(proj);
2069 env->entries[idx]->low_word =
2070 new_rd_Proj(dbg, irg, get_nodes_block(proj), results, low_mode, res_numbers[proj_nr]);
2071 env->entries[idx]->high_word =
2072 new_rd_Proj(dbg, irg, get_nodes_block(proj), results, mode, res_numbers[proj_nr] + 1);
2074 mark_irn_visited(proj);
2082 * Translate an Unknown into two.
2084 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env) {
2085 int idx = get_irn_idx(node);
2086 ir_graph *irg = current_ir_graph;
2087 ir_mode *low_mode = env->params->low_unsigned;
2089 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2090 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2091 } /* lower_Unknown */
2096 * First step: just create two templates
2098 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env) {
2099 ir_mode *mode_l = env->params->low_unsigned;
2100 ir_graph *irg = current_ir_graph;
2101 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2102 ir_node **inl, **inh;
2104 int idx, i, arity = get_Phi_n_preds(phi);
2107 idx = get_irn_idx(phi);
2108 if (env->entries[idx]->low_word) {
2109 /* Phi nodes already build, check for inputs */
2110 ir_node *phil = env->entries[idx]->low_word;
2111 ir_node *phih = env->entries[idx]->high_word;
2113 for (i = 0; i < arity; ++i) {
2114 ir_node *pred = get_Phi_pred(phi, i);
2115 int idx = get_irn_idx(pred);
2117 if (env->entries[idx]->low_word) {
2118 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2119 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2121 /* still not ready */
2122 pdeq_putr(env->waitq, phi);
2128 /* first create a new in array */
2129 NEW_ARR_A(ir_node *, inl, arity);
2130 NEW_ARR_A(ir_node *, inh, arity);
2131 unk_l = new_r_Unknown(irg, mode_l);
2132 unk_h = new_r_Unknown(irg, mode);
2134 for (i = 0; i < arity; ++i) {
2135 ir_node *pred = get_Phi_pred(phi, i);
2136 int idx = get_irn_idx(pred);
2138 if (env->entries[idx]->low_word) {
2139 inl[i] = env->entries[idx]->low_word;
2140 inh[i] = env->entries[idx]->high_word;
2148 dbg = get_irn_dbg_info(phi);
2149 block = get_nodes_block(phi);
2151 idx = get_irn_idx(phi);
2152 assert(idx < env->n_entries);
2153 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, irg, block, arity, inl, mode_l);
2154 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, irg, block, arity, inh, mode);
2156 /* Don't forget to link the new Phi nodes into the block! */
2157 set_irn_link(phi_l, get_irn_link(block));
2158 set_irn_link(phi_h, phi_l);
2159 set_irn_link(block, phi_h);
2162 /* not yet finished */
2163 pdeq_putr(env->waitq, phi);
2170 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env) {
2171 ir_graph *irg = current_ir_graph;
2172 ir_node *block, *val;
2173 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2177 val = get_Mux_true(mux);
2178 idx = get_irn_idx(val);
2179 if (env->entries[idx]->low_word) {
2180 /* Values already build */
2181 true_l = env->entries[idx]->low_word;
2182 true_h = env->entries[idx]->high_word;
2184 /* still not ready */
2185 pdeq_putr(env->waitq, mux);
2189 val = get_Mux_false(mux);
2190 idx = get_irn_idx(val);
2191 if (env->entries[idx]->low_word) {
2192 /* Values already build */
2193 false_l = env->entries[idx]->low_word;
2194 false_h = env->entries[idx]->high_word;
2196 /* still not ready */
2197 pdeq_putr(env->waitq, mux);
2202 sel = get_Mux_sel(mux);
2204 dbg = get_irn_dbg_info(mux);
2205 block = get_nodes_block(mux);
2207 idx = get_irn_idx(mux);
2208 assert(idx < env->n_entries);
2209 env->entries[idx]->low_word = new_rd_Mux(dbg, irg, block, sel, false_l, true_l, mode);
2210 env->entries[idx]->high_word = new_rd_Mux(dbg, irg, block, sel, false_h, true_h, mode);
2213 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env)
2215 ir_mode *his = env->params->high_signed;
2216 ir_mode *hiu = env->params->high_unsigned;
2222 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2223 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2224 if (op_mode == his || op_mode == hiu) {
2225 panic("lowering ASM unimplemented");
2232 n = get_irn_link(n);
2236 proj_mode = get_irn_mode(n);
2237 if (proj_mode == his || proj_mode == hiu) {
2238 panic("lowering ASM unimplemented");
2244 * check for opcodes that must always be lowered.
2246 static int always_lower(ir_opcode code) {
2259 } /* always_lower */
2262 * lower boolean Proj(Cmp)
2264 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env) {
2266 ir_node *l, *r, *low, *high, *t, *res;
2269 ir_graph *irg = current_ir_graph;
2272 l = get_Cmp_left(cmp);
2273 lidx = get_irn_idx(l);
2274 if (! env->entries[lidx]->low_word) {
2275 /* still not ready */
2279 r = get_Cmp_right(cmp);
2280 ridx = get_irn_idx(r);
2281 if (! env->entries[ridx]->low_word) {
2282 /* still not ready */
2286 pnc = get_Proj_proj(proj);
2287 blk = get_nodes_block(cmp);
2288 db = get_irn_dbg_info(cmp);
2289 low = new_rd_Cmp(db, irg, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2290 high = new_rd_Cmp(db, irg, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2292 if (pnc == pn_Cmp_Eq) {
2293 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2294 res = new_rd_And(db, irg, blk,
2295 new_r_Proj(irg, blk, low, mode_b, pnc),
2296 new_r_Proj(irg, blk, high, mode_b, pnc),
2298 } else if (pnc == pn_Cmp_Lg) {
2299 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2300 res = new_rd_Or(db, irg, blk,
2301 new_r_Proj(irg, blk, low, mode_b, pnc),
2302 new_r_Proj(irg, blk, high, mode_b, pnc),
2305 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2306 t = new_rd_And(db, irg, blk,
2307 new_r_Proj(irg, blk, low, mode_b, pnc),
2308 new_r_Proj(irg, blk, high, mode_b, pn_Cmp_Eq),
2310 res = new_rd_Or(db, irg, blk,
2311 new_r_Proj(irg, blk, high, mode_b, pnc & ~pn_Cmp_Eq),
2316 } /* lower_boolean_Proj_Cmp */
2319 * The type of a lower function.
2321 * @param node the node to be lowered
2322 * @param mode the low mode for the destination node
2323 * @param env the lower environment
2325 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2330 static void lower_ops(ir_node *node, void *env)
2332 lower_env_t *lenv = env;
2333 node_entry_t *entry;
2334 int idx = get_irn_idx(node);
2335 ir_mode *mode = get_irn_mode(node);
2337 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2340 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2341 ir_node *proj = get_irn_n(node, i);
2343 if (is_Proj(proj)) {
2344 ir_node *cmp = get_Proj_pred(proj);
2347 ir_node *arg = get_Cmp_left(cmp);
2349 mode = get_irn_mode(arg);
2350 if (mode == lenv->params->high_signed ||
2351 mode == lenv->params->high_unsigned) {
2352 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2355 /* could not lower because predecessors not ready */
2356 waitq_put(lenv->waitq, node);
2359 set_irn_n(node, i, res);
2366 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2367 if (entry || always_lower(get_irn_opcode(node))) {
2368 ir_op *op = get_irn_op(node);
2369 lower_func func = (lower_func)op->ops.generic;
2372 mode = get_irn_op_mode(node);
2374 if (mode == lenv->params->high_signed)
2375 mode = lenv->params->low_signed;
2377 mode = lenv->params->low_unsigned;
2379 DB((dbg, LEVEL_1, " %+F\n", node));
2380 func(node, mode, lenv);
2385 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2388 * Compare two op_mode_entry_t's.
2390 static int cmp_op_mode(const void *elt, const void *key, size_t size) {
2391 const op_mode_entry_t *e1 = elt;
2392 const op_mode_entry_t *e2 = key;
2395 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2399 * Compare two conv_tp_entry_t's.
2401 static int cmp_conv_tp(const void *elt, const void *key, size_t size) {
2402 const conv_tp_entry_t *e1 = elt;
2403 const conv_tp_entry_t *e2 = key;
2406 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2407 } /* static int cmp_conv_tp */
2410 * Enter a lowering function into an ir_op.
2412 static void enter_lower_func(ir_op *op, lower_func func) {
2413 op->ops.generic = (op_func)func;
2419 void lower_dw_ops(const lwrdw_param_t *param)
2428 if (! param->enable)
2431 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2433 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2434 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2435 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2437 /* create the necessary maps */
2439 prim_types = pmap_create();
2440 if (! intrinsic_fkt)
2441 intrinsic_fkt = new_set(cmp_op_mode, iro_Last + 1);
2443 conv_types = new_set(cmp_conv_tp, 16);
2445 lowered_type = pmap_create();
2447 /* create a primitive unsigned and signed type */
2449 tp_u = get_primitive_type(param->low_unsigned);
2451 tp_s = get_primitive_type(param->low_signed);
2453 /* create method types for the created binop calls */
2455 binop_tp_u = new_type_method(IDENT("binop_u_intrinsic"), 4, 2);
2456 set_method_param_type(binop_tp_u, 0, tp_u);
2457 set_method_param_type(binop_tp_u, 1, tp_u);
2458 set_method_param_type(binop_tp_u, 2, tp_u);
2459 set_method_param_type(binop_tp_u, 3, tp_u);
2460 set_method_res_type(binop_tp_u, 0, tp_u);
2461 set_method_res_type(binop_tp_u, 1, tp_u);
2464 binop_tp_s = new_type_method(IDENT("binop_s_intrinsic"), 4, 2);
2465 set_method_param_type(binop_tp_s, 0, tp_u);
2466 set_method_param_type(binop_tp_s, 1, tp_s);
2467 set_method_param_type(binop_tp_s, 2, tp_u);
2468 set_method_param_type(binop_tp_s, 3, tp_s);
2469 set_method_res_type(binop_tp_s, 0, tp_u);
2470 set_method_res_type(binop_tp_s, 1, tp_s);
2472 if (! shiftop_tp_u) {
2473 shiftop_tp_u = new_type_method(IDENT("shiftop_u_intrinsic"), 3, 2);
2474 set_method_param_type(shiftop_tp_u, 0, tp_u);
2475 set_method_param_type(shiftop_tp_u, 1, tp_u);
2476 set_method_param_type(shiftop_tp_u, 2, tp_u);
2477 set_method_res_type(shiftop_tp_u, 0, tp_u);
2478 set_method_res_type(shiftop_tp_u, 1, tp_u);
2480 if (! shiftop_tp_s) {
2481 shiftop_tp_s = new_type_method(IDENT("shiftop_s_intrinsic"), 3, 2);
2482 set_method_param_type(shiftop_tp_s, 0, tp_u);
2483 set_method_param_type(shiftop_tp_s, 1, tp_s);
2484 /* beware: shift count is always mode_Iu */
2485 set_method_param_type(shiftop_tp_s, 2, tp_u);
2486 set_method_res_type(shiftop_tp_s, 0, tp_u);
2487 set_method_res_type(shiftop_tp_s, 1, tp_s);
2490 unop_tp_u = new_type_method(IDENT("unop_u_intrinsic"), 2, 2);
2491 set_method_param_type(unop_tp_u, 0, tp_u);
2492 set_method_param_type(unop_tp_u, 1, tp_u);
2493 set_method_res_type(unop_tp_u, 0, tp_u);
2494 set_method_res_type(unop_tp_u, 1, tp_u);
2497 unop_tp_s = new_type_method(IDENT("unop_s_intrinsic"), 2, 2);
2498 set_method_param_type(unop_tp_s, 0, tp_u);
2499 set_method_param_type(unop_tp_s, 1, tp_s);
2500 set_method_res_type(unop_tp_s, 0, tp_u);
2501 set_method_res_type(unop_tp_s, 1, tp_s);
2504 lenv.tv_mode_bytes = new_tarval_from_long(get_mode_size_bytes(param->low_unsigned), mode_Iu);
2505 lenv.tv_mode_bits = new_tarval_from_long(get_mode_size_bits(param->low_unsigned), mode_Iu);
2506 lenv.waitq = new_pdeq();
2507 lenv.params = param;
2509 /* first clear the generic function pointer for all ops */
2510 clear_irp_opcodes_generic_func();
2512 #define LOWER2(op, fkt) enter_lower_func(op_##op, fkt)
2513 #define LOWER(op) LOWER2(op, lower_##op)
2514 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2515 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2517 /* the table of all operations that must be lowered follows */
2554 /* transform all graphs */
2555 rem = current_ir_graph;
2556 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2557 ir_graph *irg = get_irp_irg(i);
2560 obstack_init(&lenv.obst);
2562 n_idx = get_irg_last_idx(irg);
2563 n_idx = n_idx + (n_idx >> 2); /* add 25% */
2564 lenv.n_entries = n_idx;
2565 lenv.entries = NEW_ARR_F(node_entry_t *, n_idx);
2566 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2568 /* first step: link all nodes and allocate data */
2570 lenv.proj_2_block = pmap_create();
2571 irg_walk_graph(irg, firm_clear_link, prepare_links_and_handle_rotl, &lenv);
2573 if (lenv.flags & MUST_BE_LOWERED) {
2574 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2576 /* must do some work */
2577 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2579 /* last step: all waiting nodes */
2580 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2581 current_ir_graph = irg;
2582 while (! pdeq_empty(lenv.waitq)) {
2583 ir_node *node = pdeq_getl(lenv.waitq);
2585 lower_ops(node, &lenv);
2588 /* outs are invalid, we changed the graph */
2589 set_irg_outs_inconsistent(irg);
2591 if (lenv.flags & CF_CHANGED) {
2592 /* control flow changed, dominance info is invalid */
2593 set_irg_doms_inconsistent(irg);
2594 set_irg_extblk_inconsistent(irg);
2595 set_irg_loopinfo_inconsistent(irg);
2598 pmap_destroy(lenv.proj_2_block);
2599 DEL_ARR_F(lenv.entries);
2600 obstack_free(&lenv.obst, NULL);
2602 del_pdeq(lenv.waitq);
2603 current_ir_graph = rem;
2604 } /* lower_dw_ops */
2606 /* Default implementation. */
2607 ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2608 const ir_mode *imode, const ir_mode *omode,
2616 if (imode == omode) {
2617 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2619 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2620 get_mode_name(imode), get_mode_name(omode));
2622 id = new_id_from_str(buf);
2624 ent = new_entity(get_glob_type(), id, method);
2625 set_entity_ld_ident(ent, get_entity_ident(ent));
2626 set_entity_visibility(ent, visibility_external_allocated);
2628 } /* def_create_intrinsic_fkt */