2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Lower Double word operations, ie 64bit -> 32bit, 32bit -> 16bit etc.
24 * @author Michael Beck
36 #include "irgraph_t.h"
41 #include "dbginfo_t.h"
42 #include "iropt_dbg.h"
57 /** A map from mode to a primitive type. */
58 static pmap *prim_types;
60 /** A map from (op, imode, omode) to Intrinsic functions entities. */
61 static set *intrinsic_fkt;
63 /** A map from (imode, omode) to conv function types. */
64 static set *conv_types;
66 /** A map from a method type to its lowered type. */
67 static pmap *lowered_type;
69 /** The types for the binop and unop intrinsics. */
70 static ir_type *binop_tp_u, *binop_tp_s, *unop_tp_u, *unop_tp_s, *shiftop_tp_u, *shiftop_tp_s, *tp_s, *tp_u;
72 /** the debug handle */
73 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
76 * An entry in the (op, imode, omode) -> entity map.
78 typedef struct _op_mode_entry {
79 const ir_op *op; /**< the op */
80 const ir_mode *imode; /**< the input mode */
81 const ir_mode *omode; /**< the output mode */
82 ir_entity *ent; /**< the associated entity of this (op, imode, omode) triple */
86 * An entry in the (imode, omode) -> tp map.
88 typedef struct _conv_tp_entry {
89 const ir_mode *imode; /**< the input mode */
90 const ir_mode *omode; /**< the output mode */
91 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
95 * Every double word node will be replaced,
96 * we need some store to hold the replacement:
98 typedef struct _node_entry_t {
99 ir_node *low_word; /**< the low word */
100 ir_node *high_word; /**< the high word */
104 MUST_BE_LOWERED = 1, /**< graph must be lowered */
105 CF_CHANGED = 2, /**< control flow was changed */
109 * The lower environment.
111 typedef struct _lower_env_t {
112 node_entry_t **entries; /**< entries per node */
113 struct obstack obst; /**< an obstack holding the temporary data */
114 ir_type *l_mtp; /**< lowered method type of the current method */
115 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
116 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
117 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
118 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
119 ident *first_id; /**< .l for little and .h for big endian */
120 ident *next_id; /**< .h for little and .l for big endian */
121 const lwrdw_param_t *params; /**< transformation parameter */
122 unsigned flags; /**< some flags */
123 int n_entries; /**< number of entries */
124 ir_type *value_param_tp; /**< the old value param type */
128 * Get a primitive mode for a mode.
130 static ir_type *get_primitive_type(ir_mode *mode)
132 pmap_entry *entry = pmap_find(prim_types, mode);
139 snprintf(buf, sizeof(buf), "_prim_%s", get_mode_name(mode));
140 tp = new_type_primitive(mode);
142 pmap_insert(prim_types, mode, tp);
144 } /* get_primitive_type */
147 * Create a method type for a Conv emulation from imode to omode.
149 static ir_type *get_conv_type(ir_mode *imode, ir_mode *omode, lower_env_t *env)
151 conv_tp_entry_t key, *entry;
158 entry = set_insert(conv_types, &key, sizeof(key), HASH_PTR(imode) ^ HASH_PTR(omode));
160 int n_param = 1, n_res = 1;
162 if (imode == env->params->high_signed || imode == env->params->high_unsigned)
164 if (omode == env->params->high_signed || omode == env->params->high_unsigned)
167 /* create a new one */
168 mtd = new_type_method(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_Block_phis(block); phi != NULL; phi = get_Phi_next(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 = OALLOCZ(&lenv->obst, node_entry_t);
286 idx = get_irn_idx(node);
287 if (idx >= lenv->n_entries) {
288 /* enlarge: this happens only for Rotl nodes which is RARELY */
289 int old = lenv->n_entries;
290 int n_idx = idx + (idx >> 3);
292 ARR_RESIZE(node_entry_t *, lenv->entries, n_idx);
293 memset(&lenv->entries[old], 0, (n_idx - old) * sizeof(lenv->entries[0]));
294 lenv->n_entries = n_idx;
296 lenv->entries[idx] = link;
297 lenv->flags |= MUST_BE_LOWERED;
298 } else if (is_Conv(node)) {
299 /* Conv nodes have two modes */
300 ir_node *pred = get_Conv_op(node);
301 mode = get_irn_mode(pred);
303 if (mode == lenv->params->high_signed ||
304 mode == lenv->params->high_unsigned) {
305 /* must lower this node either but don't need a link */
306 lenv->flags |= MUST_BE_LOWERED;
312 /* link all Proj nodes to its predecessor:
313 Note that Tuple Proj's and its Projs are linked either. */
314 ir_node *pred = get_Proj_pred(node);
316 set_irn_link(node, get_irn_link(pred));
317 set_irn_link(pred, node);
318 } else if (is_Phi(node)) {
319 /* link all Phi nodes to its block */
320 ir_node *block = get_nodes_block(node);
321 add_Block_phi(block, node);
322 } else if (is_Block(node)) {
323 /* fill the Proj -> Block map */
324 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
325 ir_node *pred = get_Block_cfgpred(node, i);
328 pmap_insert(lenv->proj_2_block, pred, node);
331 } /* prepare_links */
334 * Translate a Constant: create two.
336 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env)
338 tarval *tv, *tv_l, *tv_h;
340 dbg_info *dbg = get_irn_dbg_info(node);
342 ir_graph *irg = current_ir_graph;
343 ir_mode *low_mode = env->params->low_unsigned;
345 tv = get_Const_tarval(node);
347 tv_l = tarval_convert_to(tv, low_mode);
348 low = new_rd_Const(dbg, irg, tv_l);
350 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
351 high = new_rd_Const(dbg, irg, tv_h);
353 idx = get_irn_idx(node);
354 assert(idx < env->n_entries);
355 env->entries[idx]->low_word = low;
356 env->entries[idx]->high_word = high;
360 * Translate a Load: create two.
362 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env)
364 ir_mode *low_mode = env->params->low_unsigned;
365 ir_graph *irg = current_ir_graph;
366 ir_node *adr = get_Load_ptr(node);
367 ir_node *mem = get_Load_mem(node);
368 ir_node *low, *high, *proj;
370 ir_node *block = get_nodes_block(node);
372 ir_cons_flags volatility = get_Load_volatility(node) == volatility_is_volatile
375 if (env->params->little_endian) {
377 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
379 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
383 /* create two loads */
384 dbg = get_irn_dbg_info(node);
385 low = new_rd_Load(dbg, block, mem, low, low_mode, volatility);
386 proj = new_r_Proj(block, low, mode_M, pn_Load_M);
387 high = new_rd_Load(dbg, block, proj, high, mode, volatility);
389 idx = get_irn_idx(node);
390 assert(idx < env->n_entries);
391 env->entries[idx]->low_word = low;
392 env->entries[idx]->high_word = high;
394 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
395 idx = get_irn_idx(proj);
397 switch (get_Proj_proj(proj)) {
398 case pn_Load_M: /* Memory result. */
399 /* put it to the second one */
400 set_Proj_pred(proj, high);
402 case pn_Load_X_except: /* Execution result if exception occurred. */
403 /* put it to the first one */
404 set_Proj_pred(proj, low);
406 case pn_Load_res: /* Result of load operation. */
407 assert(idx < env->n_entries);
408 env->entries[idx]->low_word = new_r_Proj(block, low, low_mode, pn_Load_res);
409 env->entries[idx]->high_word = new_r_Proj(block, high, mode, pn_Load_res);
412 assert(0 && "unexpected Proj number");
414 /* mark this proj: we have handled it already, otherwise we might fall into
416 mark_irn_visited(proj);
421 * Translate a Store: create two.
423 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env)
426 ir_node *block, *adr, *mem;
427 ir_node *low, *high, *irn, *proj;
431 ir_cons_flags volatility = get_Store_volatility(node) == volatility_is_volatile
435 irn = get_Store_value(node);
436 entry = env->entries[get_irn_idx(irn)];
439 if (! entry->low_word) {
440 /* not ready yet, wait */
441 pdeq_putr(env->waitq, node);
445 irg = current_ir_graph;
446 adr = get_Store_ptr(node);
447 mem = get_Store_mem(node);
448 block = get_nodes_block(node);
450 if (env->params->little_endian) {
452 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
454 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
458 /* create two Stores */
459 dbg = get_irn_dbg_info(node);
460 low = new_rd_Store(dbg, block, mem, low, entry->low_word, volatility);
461 proj = new_r_Proj(block, low, mode_M, pn_Store_M);
462 high = new_rd_Store(dbg, block, proj, high, entry->high_word, volatility);
464 idx = get_irn_idx(node);
465 assert(idx < env->n_entries);
466 env->entries[idx]->low_word = low;
467 env->entries[idx]->high_word = high;
469 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
470 idx = get_irn_idx(proj);
472 switch (get_Proj_proj(proj)) {
473 case pn_Store_M: /* Memory result. */
474 /* put it to the second one */
475 set_Proj_pred(proj, high);
477 case pn_Store_X_except: /* Execution result if exception occurred. */
478 /* put it to the first one */
479 set_Proj_pred(proj, low);
482 assert(0 && "unexpected Proj number");
484 /* mark this proj: we have handled it already, otherwise we might fall into
486 mark_irn_visited(proj);
491 * Return a node containing the address of the intrinsic emulation function.
493 * @param method the method type of the emulation function
494 * @param op the emulated ir_op
495 * @param imode the input mode of the emulated opcode
496 * @param omode the output mode of the emulated opcode
497 * @param env the lower environment
499 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
500 ir_mode *imode, ir_mode *omode,
504 op_mode_entry_t key, *entry;
511 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
512 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
514 /* create a new one */
515 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
517 assert(ent && "Intrinsic creator must return an entity");
523 return new_r_SymConst(current_ir_graph, mode_P_code, sym, symconst_addr_ent);
524 } /* get_intrinsic_address */
529 * Create an intrinsic Call.
531 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env)
533 ir_node *block, *irn, *call, *proj;
541 irn = get_Div_left(node);
542 entry = env->entries[get_irn_idx(irn)];
545 if (! entry->low_word) {
546 /* not ready yet, wait */
547 pdeq_putr(env->waitq, node);
551 in[0] = entry->low_word;
552 in[1] = entry->high_word;
554 irn = get_Div_right(node);
555 entry = env->entries[get_irn_idx(irn)];
558 if (! entry->low_word) {
559 /* not ready yet, wait */
560 pdeq_putr(env->waitq, node);
564 in[2] = entry->low_word;
565 in[3] = entry->high_word;
567 dbg = get_irn_dbg_info(node);
568 block = get_nodes_block(node);
570 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
571 opmode = get_irn_op_mode(node);
572 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
573 call = new_rd_Call(dbg, block, get_Div_mem(node), irn, 4, in, mtp);
574 set_irn_pinned(call, get_irn_pinned(node));
575 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
577 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
578 switch (get_Proj_proj(proj)) {
579 case pn_Div_M: /* Memory result. */
580 /* reroute to the call */
581 set_Proj_pred(proj, call);
582 set_Proj_proj(proj, pn_Call_M);
584 case pn_Div_X_except: /* Execution result if exception occurred. */
585 /* reroute to the call */
586 set_Proj_pred(proj, call);
587 set_Proj_proj(proj, pn_Call_X_except);
589 case pn_Div_res: /* Result of computation. */
590 idx = get_irn_idx(proj);
591 assert(idx < env->n_entries);
592 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
593 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
596 assert(0 && "unexpected Proj number");
598 /* mark this proj: we have handled it already, otherwise we might fall into
600 mark_irn_visited(proj);
607 * Create an intrinsic Call.
609 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env)
611 ir_node *block, *proj, *irn, *call;
619 irn = get_Mod_left(node);
620 entry = env->entries[get_irn_idx(irn)];
623 if (! entry->low_word) {
624 /* not ready yet, wait */
625 pdeq_putr(env->waitq, node);
629 in[0] = entry->low_word;
630 in[1] = entry->high_word;
632 irn = get_Mod_right(node);
633 entry = env->entries[get_irn_idx(irn)];
636 if (! entry->low_word) {
637 /* not ready yet, wait */
638 pdeq_putr(env->waitq, node);
642 in[2] = entry->low_word;
643 in[3] = entry->high_word;
645 dbg = get_irn_dbg_info(node);
646 block = get_nodes_block(node);
648 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
649 opmode = get_irn_op_mode(node);
650 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
651 call = new_rd_Call(dbg, block, get_Mod_mem(node), irn, 4, in, mtp);
652 set_irn_pinned(call, get_irn_pinned(node));
653 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
655 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
656 switch (get_Proj_proj(proj)) {
657 case pn_Mod_M: /* Memory result. */
658 /* reroute to the call */
659 set_Proj_pred(proj, call);
660 set_Proj_proj(proj, pn_Call_M);
662 case pn_Mod_X_except: /* Execution result if exception occurred. */
663 /* reroute to the call */
664 set_Proj_pred(proj, call);
665 set_Proj_proj(proj, pn_Call_X_except);
667 case pn_Mod_res: /* Result of computation. */
668 idx = get_irn_idx(proj);
669 assert(idx < env->n_entries);
670 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
671 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
674 assert(0 && "unexpected Proj number");
676 /* mark this proj: we have handled it already, otherwise we might fall into
678 mark_irn_visited(proj);
683 * Translate a DivMod.
685 * Create two intrinsic Calls.
687 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env)
689 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
690 ir_node *resDiv = NULL;
691 ir_node *resMod = NULL;
700 /* check if both results are needed */
701 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
702 switch (get_Proj_proj(proj)) {
703 case pn_DivMod_res_div: flags |= 1; break;
704 case pn_DivMod_res_mod: flags |= 2; break;
709 irn = get_DivMod_left(node);
710 entry = env->entries[get_irn_idx(irn)];
713 if (! entry->low_word) {
714 /* not ready yet, wait */
715 pdeq_putr(env->waitq, node);
719 in[0] = entry->low_word;
720 in[1] = entry->high_word;
722 irn = get_DivMod_right(node);
723 entry = env->entries[get_irn_idx(irn)];
726 if (! entry->low_word) {
727 /* not ready yet, wait */
728 pdeq_putr(env->waitq, node);
732 in[2] = entry->low_word;
733 in[3] = entry->high_word;
735 dbg = get_irn_dbg_info(node);
736 block = get_nodes_block(node);
738 mem = get_DivMod_mem(node);
740 callDiv = callMod = NULL;
741 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
743 opmode = get_irn_op_mode(node);
744 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, env);
745 callDiv = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
746 set_irn_pinned(callDiv, get_irn_pinned(node));
747 resDiv = new_r_Proj(block, callDiv, mode_T, pn_Call_T_result);
751 mem = new_r_Proj(block, callDiv, mode_M, pn_Call_M);
752 opmode = get_irn_op_mode(node);
753 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, env);
754 callMod = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
755 set_irn_pinned(callMod, get_irn_pinned(node));
756 resMod = new_r_Proj(block, callMod, mode_T, pn_Call_T_result);
759 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
760 switch (get_Proj_proj(proj)) {
761 case pn_DivMod_M: /* Memory result. */
762 /* reroute to the first call */
763 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
764 set_Proj_proj(proj, pn_Call_M);
766 case pn_DivMod_X_except: /* Execution result if exception occurred. */
767 /* reroute to the first call */
768 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
769 set_Proj_proj(proj, pn_Call_X_except);
771 case pn_DivMod_res_div: /* Result of Div. */
772 idx = get_irn_idx(proj);
773 assert(idx < env->n_entries);
774 env->entries[idx]->low_word = new_r_Proj(block, resDiv, env->params->low_unsigned, 0);
775 env->entries[idx]->high_word = new_r_Proj(block, resDiv, mode, 1);
777 case pn_DivMod_res_mod: /* Result of Mod. */
778 idx = get_irn_idx(proj);
779 env->entries[idx]->low_word = new_r_Proj(block, resMod, env->params->low_unsigned, 0);
780 env->entries[idx]->high_word = new_r_Proj(block, resMod, mode, 1);
783 assert(0 && "unexpected Proj number");
785 /* mark this proj: we have handled it already, otherwise we might fall into
787 mark_irn_visited(proj);
794 * Create an intrinsic Call.
796 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env)
798 ir_node *block, *irn;
806 irn = get_binop_left(node);
807 entry = env->entries[get_irn_idx(irn)];
810 if (! entry->low_word) {
811 /* not ready yet, wait */
812 pdeq_putr(env->waitq, node);
816 in[0] = entry->low_word;
817 in[1] = entry->high_word;
819 irn = get_binop_right(node);
820 entry = env->entries[get_irn_idx(irn)];
823 if (! entry->low_word) {
824 /* not ready yet, wait */
825 pdeq_putr(env->waitq, node);
829 in[2] = entry->low_word;
830 in[3] = entry->high_word;
832 dbg = get_irn_dbg_info(node);
833 block = get_nodes_block(node);
834 irg = current_ir_graph;
836 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
837 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
838 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
840 set_irn_pinned(irn, get_irn_pinned(node));
841 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
843 idx = get_irn_idx(node);
844 assert(idx < env->n_entries);
845 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
846 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
850 * Translate a Shiftop.
852 * Create an intrinsic Call.
854 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env)
856 ir_node *block, *irn;
864 irn = get_binop_left(node);
865 entry = env->entries[get_irn_idx(irn)];
868 if (! entry->low_word) {
869 /* not ready yet, wait */
870 pdeq_putr(env->waitq, node);
874 in[0] = entry->low_word;
875 in[1] = entry->high_word;
877 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
878 in[2] = get_binop_right(node);
879 assert(get_irn_mode(in[2]) != env->params->high_signed
880 && get_irn_mode(in[2]) != env->params->high_unsigned);
882 dbg = get_irn_dbg_info(node);
883 block = get_nodes_block(node);
884 irg = current_ir_graph;
886 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
887 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
888 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
890 set_irn_pinned(irn, get_irn_pinned(node));
891 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
893 idx = get_irn_idx(node);
894 assert(idx < env->n_entries);
895 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
896 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
897 } /* lower_Shiftop */
900 * Translate a Shr and handle special cases.
902 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env)
904 ir_node *right = get_Shr_right(node);
905 ir_graph *irg = current_ir_graph;
907 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
908 tarval *tv = get_Const_tarval(right);
910 if (tarval_is_long(tv) &&
911 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
912 ir_node *block = get_nodes_block(node);
913 ir_node *left = get_Shr_left(node);
915 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
916 int idx = get_irn_idx(left);
918 left = env->entries[idx]->high_word;
920 /* not ready yet, wait */
921 pdeq_putr(env->waitq, node);
925 idx = get_irn_idx(node);
928 c = new_r_Const_long(irg, env->params->low_unsigned, shf_cnt);
929 env->entries[idx]->low_word = new_r_Shr(block, left, c, mode);
931 env->entries[idx]->low_word = left;
933 env->entries[idx]->high_word = new_r_Const(irg, get_mode_null(mode));
938 lower_Shiftop(node, mode, env);
942 * Translate a Shl and handle special cases.
944 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env)
946 ir_node *right = get_Shl_right(node);
947 ir_graph *irg = current_ir_graph;
949 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
950 tarval *tv = get_Const_tarval(right);
952 if (tarval_is_long(tv) &&
953 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
955 ir_node *block = get_nodes_block(node);
956 ir_node *left = get_Shl_left(node);
958 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
959 int idx = get_irn_idx(left);
961 left = new_r_Conv(block, env->entries[idx]->low_word, mode);
962 idx = get_irn_idx(node);
964 mode_l = env->params->low_unsigned;
966 c = new_r_Const_long(irg, mode_l, shf_cnt);
967 env->entries[idx]->high_word = new_r_Shl(block, left, c, mode);
969 env->entries[idx]->high_word = left;
971 env->entries[idx]->low_word = new_r_Const(irg, get_mode_null(mode_l));
976 lower_Shiftop(node, mode, env);
980 * Translate a Shrs and handle special cases.
982 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env)
984 ir_node *right = get_Shrs_right(node);
985 ir_graph *irg = current_ir_graph;
987 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
988 tarval *tv = get_Const_tarval(right);
990 if (tarval_is_long(tv) &&
991 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
992 ir_node *block = get_nodes_block(node);
993 ir_node *left = get_Shrs_left(node);
994 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
995 int idx = get_irn_idx(left);
1000 left = env->entries[idx]->high_word;
1001 idx = get_irn_idx(node);
1003 mode_l = env->params->low_unsigned;
1005 c = new_r_Const_long(irg, mode_l, shf_cnt);
1006 low = new_r_Shrs(block, left, c, mode);
1010 /* low word is expected to have mode_l */
1011 env->entries[idx]->low_word = new_r_Conv(block, low, mode_l);
1013 c = new_r_Const_long(irg, mode_l, get_mode_size_bits(mode) - 1);
1014 env->entries[idx]->high_word = new_r_Shrs(block, left, c, mode);
1019 lower_Shiftop(node, mode, env);
1023 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1025 static void prepare_links_and_handle_rotl(ir_node *node, void *env)
1027 lower_env_t *lenv = env;
1029 if (is_Rotl(node)) {
1030 ir_mode *mode = get_irn_op_mode(node);
1031 if (mode == lenv->params->high_signed ||
1032 mode == lenv->params->high_unsigned) {
1033 ir_node *right = get_Rotl_right(node);
1034 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1035 ir_mode *omode, *rmode;
1037 optimization_state_t state;
1039 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1040 tarval *tv = get_Const_tarval(right);
1042 if (tarval_is_long(tv) &&
1043 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1044 /* will be optimized in lower_Rotl() */
1049 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1050 dbg = get_irn_dbg_info(node);
1051 omode = get_irn_mode(node);
1052 left = get_Rotl_left(node);
1053 block = get_nodes_block(node);
1054 shl = new_rd_Shl(dbg, block, left, right, omode);
1055 rmode = get_irn_mode(right);
1056 c = new_Const_long(rmode, get_mode_size_bits(omode));
1057 sub = new_rd_Sub(dbg, block, c, right, rmode);
1058 shr = new_rd_Shr(dbg, block, left, sub, omode);
1060 /* optimization must be switched off here, or we will get the Rotl back */
1061 save_optimization_state(&state);
1062 set_opt_algebraic_simplification(0);
1063 or = new_rd_Or(dbg, block, shl, shr, omode);
1064 restore_optimization_state(&state);
1068 /* do lowering on the new nodes */
1069 prepare_links(shl, env);
1070 prepare_links(c, env);
1071 prepare_links(sub, env);
1072 prepare_links(shr, env);
1073 prepare_links(or, env);
1076 prepare_links(node, env);
1081 * Translate a special case Rotl(x, sizeof(w)).
1083 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env)
1085 ir_node *right = get_Rotl_right(node);
1086 ir_node *left = get_Rotl_left(node);
1088 int idx = get_irn_idx(left);
1092 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1093 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1094 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1096 l = env->entries[idx]->low_word;
1097 h = env->entries[idx]->high_word;
1098 idx = get_irn_idx(node);
1100 env->entries[idx]->low_word = h;
1101 env->entries[idx]->high_word = l;
1105 * Translate an Unop.
1107 * Create an intrinsic Call.
1109 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env)
1111 ir_node *block, *irn;
1116 node_entry_t *entry;
1118 irn = get_unop_op(node);
1119 entry = env->entries[get_irn_idx(irn)];
1122 if (! entry->low_word) {
1123 /* not ready yet, wait */
1124 pdeq_putr(env->waitq, node);
1128 in[0] = entry->low_word;
1129 in[1] = entry->high_word;
1131 dbg = get_irn_dbg_info(node);
1132 block = get_nodes_block(node);
1134 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1135 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
1136 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
1138 set_irn_pinned(irn, get_irn_pinned(node));
1139 irn = new_r_Proj(block, irn, mode_T, pn_Call_T_result);
1141 idx = get_irn_idx(node);
1142 assert(idx < env->n_entries);
1143 env->entries[idx]->low_word = new_r_Proj(block, irn, env->params->low_unsigned, 0);
1144 env->entries[idx]->high_word = new_r_Proj(block, irn, mode, 1);
1148 * Translate a logical Binop.
1150 * Create two logical Binops.
1152 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1153 ir_node *(*constr_rd)(dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1154 ir_node *block, *irn;
1155 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1159 node_entry_t *entry;
1161 irn = get_binop_left(node);
1162 entry = env->entries[get_irn_idx(irn)];
1165 if (! entry->low_word) {
1166 /* not ready yet, wait */
1167 pdeq_putr(env->waitq, node);
1171 lop_l = entry->low_word;
1172 lop_h = entry->high_word;
1174 irn = get_binop_right(node);
1175 entry = env->entries[get_irn_idx(irn)];
1178 if (! entry->low_word) {
1179 /* not ready yet, wait */
1180 pdeq_putr(env->waitq, node);
1184 rop_l = entry->low_word;
1185 rop_h = entry->high_word;
1187 dbg = get_irn_dbg_info(node);
1188 block = get_nodes_block(node);
1190 idx = get_irn_idx(node);
1191 assert(idx < env->n_entries);
1192 irg = current_ir_graph;
1193 env->entries[idx]->low_word = constr_rd(dbg, block, lop_l, rop_l, env->params->low_unsigned);
1194 env->entries[idx]->high_word = constr_rd(dbg, block, lop_h, rop_h, mode);
1195 } /* lower_Binop_logical */
1197 /** create a logical operation transformation */
1198 #define lower_logical(op) \
1199 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1200 lower_Binop_logical(node, mode, env, new_rd_##op); \
1210 * Create two logical Nots.
1212 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env)
1214 ir_node *block, *irn;
1215 ir_node *op_l, *op_h;
1218 node_entry_t *entry;
1220 irn = get_Not_op(node);
1221 entry = env->entries[get_irn_idx(irn)];
1224 if (! entry->low_word) {
1225 /* not ready yet, wait */
1226 pdeq_putr(env->waitq, node);
1230 op_l = entry->low_word;
1231 op_h = entry->high_word;
1233 dbg = get_irn_dbg_info(node);
1234 block = get_nodes_block(node);
1236 idx = get_irn_idx(node);
1237 assert(idx < env->n_entries);
1238 env->entries[idx]->low_word = new_rd_Not(dbg, block, op_l, env->params->low_unsigned);
1239 env->entries[idx]->high_word = new_rd_Not(dbg, block, op_h, mode);
1245 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env)
1247 ir_node *cmp, *left, *right, *block;
1248 ir_node *sel = get_Cond_selector(node);
1249 ir_mode *m = get_irn_mode(sel);
1254 node_entry_t *lentry, *rentry;
1255 ir_node *proj, *projT = NULL, *projF = NULL;
1256 ir_node *new_bl, *cmpH, *cmpL, *irn;
1257 ir_node *projHF, *projHT;
1266 cmp = get_Proj_pred(sel);
1270 left = get_Cmp_left(cmp);
1271 idx = get_irn_idx(left);
1272 lentry = env->entries[idx];
1279 right = get_Cmp_right(cmp);
1280 idx = get_irn_idx(right);
1281 rentry = env->entries[idx];
1284 if (! lentry->low_word || !rentry->low_word) {
1286 pdeq_putr(env->waitq, node);
1290 /* all right, build the code */
1291 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1292 long proj_nr = get_Proj_proj(proj);
1294 if (proj_nr == pn_Cond_true) {
1295 assert(projT == NULL && "more than one Proj(true)");
1298 assert(proj_nr == pn_Cond_false);
1299 assert(projF == NULL && "more than one Proj(false)");
1302 mark_irn_visited(proj);
1304 assert(projT && projF);
1306 /* create a new high compare */
1307 block = get_nodes_block(node);
1308 irg = get_Block_irg(block);
1309 dbg = get_irn_dbg_info(cmp);
1310 pnc = get_Proj_proj(sel);
1312 if (is_Const(right) && is_Const_null(right)) {
1313 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1314 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1315 ir_mode *mode = env->params->low_unsigned;
1316 ir_node *low = new_r_Conv(block, lentry->low_word, mode);
1317 ir_node *high = new_r_Conv(block, lentry->high_word, mode);
1318 ir_node *or = new_rd_Or(dbg, block, low, high, mode);
1319 ir_node *cmp = new_rd_Cmp(dbg, block, or, new_Const_long(mode, 0));
1321 ir_node *proj = new_r_Proj(block, cmp, mode_b, pnc);
1322 set_Cond_selector(node, proj);
1327 cmpH = new_rd_Cmp(dbg, block, lentry->high_word, rentry->high_word);
1329 if (pnc == pn_Cmp_Eq) {
1330 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1331 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1334 dst_blk = entry->value;
1336 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Eq);
1337 dbg = get_irn_dbg_info(node);
1338 irn = new_rd_Cond(dbg, block, irn);
1340 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1341 mark_irn_visited(projHF);
1342 exchange(projF, projHF);
1344 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1345 mark_irn_visited(projHT);
1347 new_bl = new_r_Block(irg, 1, &projHT);
1349 dbg = get_irn_dbg_info(cmp);
1350 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1351 irn = new_r_Proj(new_bl, cmpL, mode_b, pn_Cmp_Eq);
1352 dbg = get_irn_dbg_info(node);
1353 irn = new_rd_Cond(dbg, new_bl, irn);
1355 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_false);
1356 mark_irn_visited(proj);
1357 add_block_cf_input(dst_blk, projHF, proj);
1359 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_true);
1360 mark_irn_visited(proj);
1361 exchange(projT, proj);
1362 } else if (pnc == pn_Cmp_Lg) {
1363 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1364 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1367 dst_blk = entry->value;
1369 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Lg);
1370 dbg = get_irn_dbg_info(node);
1371 irn = new_rd_Cond(dbg, block, irn);
1373 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1374 mark_irn_visited(projHT);
1375 exchange(projT, projHT);
1377 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1378 mark_irn_visited(projHF);
1380 new_bl = new_r_Block(irg, 1, &projHF);
1382 dbg = get_irn_dbg_info(cmp);
1383 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1384 irn = new_r_Proj(new_bl, cmpL, mode_b, pn_Cmp_Lg);
1385 dbg = get_irn_dbg_info(node);
1386 irn = new_rd_Cond(dbg, new_bl, irn);
1388 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_true);
1389 mark_irn_visited(proj);
1390 add_block_cf_input(dst_blk, projHT, proj);
1392 proj = new_r_Proj(new_bl, irn, mode_X, pn_Cond_false);
1393 mark_irn_visited(proj);
1394 exchange(projF, proj);
1396 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1397 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1400 entry = pmap_find(env->proj_2_block, projT);
1402 dstT = entry->value;
1404 entry = pmap_find(env->proj_2_block, projF);
1406 dstF = entry->value;
1408 irn = new_r_Proj(block, cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1409 dbg = get_irn_dbg_info(node);
1410 irn = new_rd_Cond(dbg, block, irn);
1412 projHT = new_r_Proj(block, irn, mode_X, pn_Cond_true);
1413 mark_irn_visited(projHT);
1414 exchange(projT, projHT);
1417 projHF = new_r_Proj(block, irn, mode_X, pn_Cond_false);
1418 mark_irn_visited(projHF);
1420 newbl_eq = new_r_Block(irg, 1, &projHF);
1422 irn = new_r_Proj(block, cmpH, mode_b, pn_Cmp_Eq);
1423 irn = new_rd_Cond(dbg, newbl_eq, irn);
1425 proj = new_r_Proj(newbl_eq, irn, mode_X, pn_Cond_false);
1426 mark_irn_visited(proj);
1427 exchange(projF, proj);
1430 proj = new_r_Proj(newbl_eq, irn, mode_X, pn_Cond_true);
1431 mark_irn_visited(proj);
1433 newbl_l = new_r_Block(irg, 1, &proj);
1435 dbg = get_irn_dbg_info(cmp);
1436 cmpL = new_rd_Cmp(dbg, newbl_l, lentry->low_word, rentry->low_word);
1437 irn = new_r_Proj(newbl_l, cmpL, mode_b, pnc);
1438 dbg = get_irn_dbg_info(node);
1439 irn = new_rd_Cond(dbg, newbl_l, irn);
1441 proj = new_r_Proj(newbl_l, irn, mode_X, pn_Cond_true);
1442 mark_irn_visited(proj);
1443 add_block_cf_input(dstT, projT, proj);
1445 proj = new_r_Proj(newbl_l, irn, mode_X, pn_Cond_false);
1446 mark_irn_visited(proj);
1447 add_block_cf_input(dstF, projF, proj);
1450 /* we have changed the control flow */
1451 env->flags |= CF_CHANGED;
1453 idx = get_irn_idx(sel);
1455 if (env->entries[idx]) {
1457 Bad, a jump-table with double-word index.
1458 This should not happen, but if it does we handle
1459 it like a Conv were between (in other words, ignore
1463 if (! env->entries[idx]->low_word) {
1464 /* not ready yet, wait */
1465 pdeq_putr(env->waitq, node);
1468 set_Cond_selector(node, env->entries[idx]->low_word);
1474 * Translate a Conv to higher_signed
1476 static void lower_Conv_to_Ll(ir_node *node, lower_env_t *env)
1478 ir_mode *omode = get_irn_mode(node);
1479 ir_node *op = get_Conv_op(node);
1480 ir_mode *imode = get_irn_mode(op);
1481 int idx = get_irn_idx(node);
1482 ir_graph *irg = current_ir_graph;
1483 ir_node *block = get_nodes_block(node);
1484 dbg_info *dbg = get_irn_dbg_info(node);
1485 node_entry_t *entry = env->entries[idx];
1486 ir_mode *low_unsigned = env->params->low_unsigned;
1488 = mode_is_signed(omode) ? env->params->low_signed : low_unsigned;
1490 assert(idx < env->n_entries);
1492 if (mode_is_int(imode) || mode_is_reference(imode)) {
1493 if (imode == env->params->high_signed
1494 || imode == env->params->high_unsigned) {
1495 /* a Conv from Lu to Ls or Ls to Lu */
1496 int op_idx = get_irn_idx(op);
1497 node_entry_t *op_entry = env->entries[op_idx];
1499 if (! op_entry->low_word) {
1500 /* not ready yet, wait */
1501 pdeq_putr(env->waitq, node);
1504 entry->low_word = op_entry->low_word;
1505 entry->high_word = new_rd_Conv(dbg, block, op_entry->high_word,
1508 /* simple case: create a high word */
1509 if (imode != low_unsigned)
1510 op = new_rd_Conv(dbg, block, op, low_unsigned);
1512 entry->low_word = op;
1514 if (mode_is_signed(imode)) {
1515 int c = get_mode_size_bits(low_signed) - 1;
1516 ir_node *cnst = new_Const_long(low_unsigned, c);
1517 if (get_irn_mode(op) != low_signed)
1518 op = new_rd_Conv(dbg, block, op, low_signed);
1519 entry->high_word = new_rd_Shrs(dbg, block, op, cnst,
1522 entry->high_word = new_Const(get_mode_null(low_signed));
1525 } else if (imode == mode_b) {
1526 entry->low_word = new_rd_Conv(dbg, block, op, low_unsigned);
1527 entry->high_word = new_Const(get_mode_null(low_signed));
1529 ir_node *irn, *call;
1530 ir_type *mtp = get_conv_type(imode, omode, env);
1532 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1533 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1534 set_irn_pinned(call, get_irn_pinned(node));
1535 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1537 entry->low_word = new_r_Proj(block, irn, low_unsigned, 0);
1538 entry->high_word = new_r_Proj(block, irn, low_signed, 1);
1543 * Translate a Conv from higher_unsigned
1545 static void lower_Conv_from_Ll(ir_node *node, lower_env_t *env)
1547 ir_node *op = get_Conv_op(node);
1548 ir_mode *omode = get_irn_mode(node);
1549 ir_node *block = get_nodes_block(node);
1550 dbg_info *dbg = get_irn_dbg_info(node);
1551 int idx = get_irn_idx(op);
1552 ir_graph *irg = current_ir_graph;
1553 node_entry_t *entry = env->entries[idx];
1555 assert(idx < env->n_entries);
1557 if (! entry->low_word) {
1558 /* not ready yet, wait */
1559 pdeq_putr(env->waitq, node);
1563 if (mode_is_int(omode) || mode_is_reference(omode)) {
1564 op = entry->low_word;
1566 /* simple case: create a high word */
1567 if (omode != env->params->low_unsigned)
1568 op = new_rd_Conv(dbg, block, op, omode);
1570 set_Conv_op(node, op);
1571 } else if (omode == mode_b) {
1572 /* llu ? true : false <=> (low|high) ? true : false */
1573 ir_mode *mode = env->params->low_unsigned;
1574 ir_node *or = new_rd_Or(dbg, block, entry->low_word, entry->high_word,
1576 set_Conv_op(node, or);
1578 ir_node *irn, *call, *in[2];
1579 ir_mode *imode = get_irn_mode(op);
1580 ir_type *mtp = get_conv_type(imode, omode, env);
1582 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1583 in[0] = entry->low_word;
1584 in[1] = entry->high_word;
1586 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1587 set_irn_pinned(call, get_irn_pinned(node));
1588 irn = new_r_Proj(block, call, mode_T, pn_Call_T_result);
1590 exchange(node, new_r_Proj(block, irn, omode, 0));
1597 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env)
1599 mode = get_irn_mode(node);
1601 if (mode == env->params->high_signed
1602 || mode == env->params->high_unsigned) {
1603 lower_Conv_to_Ll(node, env);
1605 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1607 if (mode == env->params->high_signed
1608 || mode == env->params->high_unsigned) {
1609 lower_Conv_from_Ll(node, env);
1615 * Lower the method type.
1617 * @param mtp the method type to lower
1618 * @param ent the lower environment
1620 * @return the lowered type
1622 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env)
1626 ir_type *res, *value_type;
1628 if (is_lowered_type(mtp))
1631 entry = pmap_find(lowered_type, mtp);
1633 int i, n, r, n_param, n_res;
1635 /* count new number of params */
1636 n_param = n = get_method_n_params(mtp);
1637 for (i = n_param - 1; i >= 0; --i) {
1638 ir_type *tp = get_method_param_type(mtp, i);
1640 if (is_Primitive_type(tp)) {
1641 ir_mode *mode = get_type_mode(tp);
1643 if (mode == env->params->high_signed ||
1644 mode == env->params->high_unsigned)
1649 /* count new number of results */
1650 n_res = r = get_method_n_ress(mtp);
1651 for (i = n_res - 1; i >= 0; --i) {
1652 ir_type *tp = get_method_res_type(mtp, i);
1654 if (is_Primitive_type(tp)) {
1655 ir_mode *mode = get_type_mode(tp);
1657 if (mode == env->params->high_signed ||
1658 mode == env->params->high_unsigned)
1663 res = new_type_method(n_param, n_res);
1665 /* set param types and result types */
1666 for (i = n_param = 0; i < n; ++i) {
1667 ir_type *tp = get_method_param_type(mtp, i);
1669 if (is_Primitive_type(tp)) {
1670 ir_mode *mode = get_type_mode(tp);
1672 if (mode == env->params->high_signed) {
1673 set_method_param_type(res, n_param++, tp_u);
1674 set_method_param_type(res, n_param++, tp_s);
1675 } else if (mode == env->params->high_unsigned) {
1676 set_method_param_type(res, n_param++, tp_u);
1677 set_method_param_type(res, n_param++, tp_u);
1679 set_method_param_type(res, n_param++, tp);
1682 set_method_param_type(res, n_param++, tp);
1685 for (i = n_res = 0; i < r; ++i) {
1686 ir_type *tp = get_method_res_type(mtp, i);
1688 if (is_Primitive_type(tp)) {
1689 ir_mode *mode = get_type_mode(tp);
1691 if (mode == env->params->high_signed) {
1692 set_method_res_type(res, n_res++, tp_u);
1693 set_method_res_type(res, n_res++, tp_s);
1694 } else if (mode == env->params->high_unsigned) {
1695 set_method_res_type(res, n_res++, tp_u);
1696 set_method_res_type(res, n_res++, tp_u);
1698 set_method_res_type(res, n_res++, tp);
1701 set_method_res_type(res, n_res++, tp);
1704 set_lowered_type(mtp, res);
1705 pmap_insert(lowered_type, mtp, res);
1707 value_type = get_method_value_param_type(mtp);
1708 if (value_type != NULL) {
1709 /* this creates a new value parameter type */
1710 (void)get_method_value_param_ent(res, 0);
1712 /* set new param positions */
1713 for (i = n_param = 0; i < n; ++i) {
1714 ir_type *tp = get_method_param_type(mtp, i);
1715 ident *id = get_method_param_ident(mtp, i);
1716 ir_entity *ent = get_method_value_param_ent(mtp, i);
1718 set_entity_link(ent, INT_TO_PTR(n_param));
1719 if (is_Primitive_type(tp)) {
1720 ir_mode *mode = get_type_mode(tp);
1722 if (mode == env->params->high_signed || mode == env->params->high_unsigned) {
1724 lid = id_mangle(id, env->first_id);
1725 set_method_param_ident(res, n_param, lid);
1726 set_entity_ident(get_method_value_param_ent(res, n_param), lid);
1727 lid = id_mangle(id, env->next_id);
1728 set_method_param_ident(res, n_param + 1, lid);
1729 set_entity_ident(get_method_value_param_ent(res, n_param + 1), lid);
1736 set_method_param_ident(res, n_param, id);
1737 set_entity_ident(get_method_value_param_ent(res, n_param), id);
1742 set_lowered_type(value_type, get_method_value_param_type(res));
1751 * Translate a Return.
1753 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env)
1755 ir_graph *irg = current_ir_graph;
1756 ir_entity *ent = get_irg_entity(irg);
1757 ir_type *mtp = get_entity_type(ent);
1763 /* check if this return must be lowered */
1764 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1765 ir_node *pred = get_Return_res(node, i);
1766 ir_mode *mode = get_irn_op_mode(pred);
1768 if (mode == env->params->high_signed ||
1769 mode == env->params->high_unsigned) {
1770 idx = get_irn_idx(pred);
1771 if (! env->entries[idx]->low_word) {
1772 /* not ready yet, wait */
1773 pdeq_putr(env->waitq, node);
1782 ent = get_irg_entity(irg);
1783 mtp = get_entity_type(ent);
1785 mtp = lower_mtp(mtp, env);
1786 set_entity_type(ent, mtp);
1788 /* create a new in array */
1789 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1790 in[0] = get_Return_mem(node);
1792 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1793 ir_node *pred = get_Return_res(node, i);
1795 idx = get_irn_idx(pred);
1796 assert(idx < env->n_entries);
1798 if (env->entries[idx]) {
1799 in[++j] = env->entries[idx]->low_word;
1800 in[++j] = env->entries[idx]->high_word;
1806 set_irn_in(node, j+1, in);
1807 } /* lower_Return */
1810 * Translate the parameters.
1812 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env)
1814 ir_graph *irg = get_irn_irg(node);
1815 ir_entity *ent = get_irg_entity(irg);
1816 ir_type *tp = get_entity_type(ent);
1819 int i, j, n_params, rem;
1820 ir_node *proj, *args;
1823 if (is_lowered_type(tp)) {
1824 mtp = get_associated_type(tp);
1828 assert(! is_lowered_type(mtp));
1830 n_params = get_method_n_params(mtp);
1834 NEW_ARR_A(long, new_projs, n_params);
1836 /* first check if we have parameters that must be fixed */
1837 for (i = j = 0; i < n_params; ++i, ++j) {
1838 ir_type *tp = get_method_param_type(mtp, i);
1841 if (is_Primitive_type(tp)) {
1842 ir_mode *mode = get_type_mode(tp);
1844 if (mode == env->params->high_signed ||
1845 mode == env->params->high_unsigned)
1852 mtp = lower_mtp(mtp, env);
1853 set_entity_type(ent, mtp);
1855 /* switch off optimization for new Proj nodes or they might be CSE'ed
1856 with not patched one's */
1857 rem = get_optimize();
1860 /* ok, fix all Proj's and create new ones */
1861 args = get_irg_args(irg);
1862 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1863 ir_node *pred = get_Proj_pred(proj);
1869 /* do not visit this node again */
1870 mark_irn_visited(proj);
1875 proj_nr = get_Proj_proj(proj);
1876 set_Proj_proj(proj, new_projs[proj_nr]);
1878 idx = get_irn_idx(proj);
1879 if (env->entries[idx]) {
1880 ir_mode *low_mode = env->params->low_unsigned;
1882 mode = get_irn_mode(proj);
1884 if (mode == env->params->high_signed) {
1885 mode = env->params->low_signed;
1887 mode = env->params->low_unsigned;
1890 dbg = get_irn_dbg_info(proj);
1891 env->entries[idx]->low_word =
1892 new_rd_Proj(dbg, get_nodes_block(proj), args, low_mode, new_projs[proj_nr]);
1893 env->entries[idx]->high_word =
1894 new_rd_Proj(dbg, get_nodes_block(proj), args, mode, new_projs[proj_nr] + 1);
1903 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env)
1905 ir_type *tp = get_Call_type(node);
1907 ir_node **in, *proj, *results;
1908 int n_params, n_res, need_lower = 0;
1910 long *res_numbers = NULL;
1913 if (is_lowered_type(tp)) {
1914 call_tp = get_associated_type(tp);
1919 assert(! is_lowered_type(call_tp));
1921 n_params = get_method_n_params(call_tp);
1922 for (i = 0; i < n_params; ++i) {
1923 ir_type *tp = get_method_param_type(call_tp, i);
1925 if (is_Primitive_type(tp)) {
1926 ir_mode *mode = get_type_mode(tp);
1928 if (mode == env->params->high_signed ||
1929 mode == env->params->high_unsigned) {
1935 n_res = get_method_n_ress(call_tp);
1937 NEW_ARR_A(long, res_numbers, n_res);
1939 for (i = j = 0; i < n_res; ++i, ++j) {
1940 ir_type *tp = get_method_res_type(call_tp, i);
1943 if (is_Primitive_type(tp)) {
1944 ir_mode *mode = get_type_mode(tp);
1946 if (mode == env->params->high_signed ||
1947 mode == env->params->high_unsigned) {
1958 /* let's lower it */
1959 call_tp = lower_mtp(call_tp, env);
1960 set_Call_type(node, call_tp);
1962 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
1964 in[0] = get_Call_mem(node);
1965 in[1] = get_Call_ptr(node);
1967 for (j = 2, i = 0; i < n_params; ++i) {
1968 ir_node *pred = get_Call_param(node, i);
1969 int idx = get_irn_idx(pred);
1971 if (env->entries[idx]) {
1972 if (! env->entries[idx]->low_word) {
1973 /* not ready yet, wait */
1974 pdeq_putr(env->waitq, node);
1977 in[j++] = env->entries[idx]->low_word;
1978 in[j++] = env->entries[idx]->high_word;
1984 set_irn_in(node, j, in);
1986 /* fix the results */
1988 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1989 long proj_nr = get_Proj_proj(proj);
1991 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
1992 /* found the result proj */
1998 if (results) { /* there are results */
1999 int rem = get_optimize();
2001 /* switch off optimization for new Proj nodes or they might be CSE'ed
2002 with not patched one's */
2004 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2005 if (get_Proj_pred(proj) == results) {
2006 long proj_nr = get_Proj_proj(proj);
2009 /* found a result */
2010 set_Proj_proj(proj, res_numbers[proj_nr]);
2011 idx = get_irn_idx(proj);
2012 if (env->entries[idx]) {
2013 ir_mode *mode = get_irn_mode(proj);
2014 ir_mode *low_mode = env->params->low_unsigned;
2017 if (mode == env->params->high_signed) {
2018 mode = env->params->low_signed;
2020 mode = env->params->low_unsigned;
2023 dbg = get_irn_dbg_info(proj);
2024 env->entries[idx]->low_word =
2025 new_rd_Proj(dbg, get_nodes_block(proj), results, low_mode, res_numbers[proj_nr]);
2026 env->entries[idx]->high_word =
2027 new_rd_Proj(dbg, get_nodes_block(proj), results, mode, res_numbers[proj_nr] + 1);
2029 mark_irn_visited(proj);
2037 * Translate an Unknown into two.
2039 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env)
2041 int idx = get_irn_idx(node);
2042 ir_graph *irg = get_irn_irg(node);
2043 ir_mode *low_mode = env->params->low_unsigned;
2045 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2046 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2047 } /* lower_Unknown */
2052 * First step: just create two templates
2054 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env)
2056 ir_mode *mode_l = env->params->low_unsigned;
2057 ir_graph *irg = get_irn_irg(phi);
2058 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2059 ir_node **inl, **inh;
2061 int idx, i, arity = get_Phi_n_preds(phi);
2064 idx = get_irn_idx(phi);
2065 if (env->entries[idx]->low_word) {
2066 /* Phi nodes already build, check for inputs */
2067 ir_node *phil = env->entries[idx]->low_word;
2068 ir_node *phih = env->entries[idx]->high_word;
2070 for (i = 0; i < arity; ++i) {
2071 ir_node *pred = get_Phi_pred(phi, i);
2072 int idx = get_irn_idx(pred);
2074 if (env->entries[idx]->low_word) {
2075 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2076 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2078 /* still not ready */
2079 pdeq_putr(env->waitq, phi);
2085 /* first create a new in array */
2086 NEW_ARR_A(ir_node *, inl, arity);
2087 NEW_ARR_A(ir_node *, inh, arity);
2088 unk_l = new_r_Unknown(irg, mode_l);
2089 unk_h = new_r_Unknown(irg, mode);
2091 for (i = 0; i < arity; ++i) {
2092 ir_node *pred = get_Phi_pred(phi, i);
2093 int idx = get_irn_idx(pred);
2095 if (env->entries[idx]->low_word) {
2096 inl[i] = env->entries[idx]->low_word;
2097 inh[i] = env->entries[idx]->high_word;
2105 dbg = get_irn_dbg_info(phi);
2106 block = get_nodes_block(phi);
2108 idx = get_irn_idx(phi);
2109 assert(idx < env->n_entries);
2110 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, block, arity, inl, mode_l);
2111 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, block, arity, inh, mode);
2113 /* Don't forget to link the new Phi nodes into the block.
2114 * Beware that some Phis might be optimized away. */
2116 add_Block_phi(block, phi_l);
2118 add_Block_phi(block, phi_h);
2121 /* not yet finished */
2122 pdeq_putr(env->waitq, phi);
2129 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env)
2131 ir_node *block, *val;
2132 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2136 val = get_Mux_true(mux);
2137 idx = get_irn_idx(val);
2138 if (env->entries[idx]->low_word) {
2139 /* Values already build */
2140 true_l = env->entries[idx]->low_word;
2141 true_h = env->entries[idx]->high_word;
2143 /* still not ready */
2144 pdeq_putr(env->waitq, mux);
2148 val = get_Mux_false(mux);
2149 idx = get_irn_idx(val);
2150 if (env->entries[idx]->low_word) {
2151 /* Values already build */
2152 false_l = env->entries[idx]->low_word;
2153 false_h = env->entries[idx]->high_word;
2155 /* still not ready */
2156 pdeq_putr(env->waitq, mux);
2161 sel = get_Mux_sel(mux);
2163 dbg = get_irn_dbg_info(mux);
2164 block = get_nodes_block(mux);
2166 idx = get_irn_idx(mux);
2167 assert(idx < env->n_entries);
2168 env->entries[idx]->low_word = new_rd_Mux(dbg, block, sel, false_l, true_l, mode);
2169 env->entries[idx]->high_word = new_rd_Mux(dbg, block, sel, false_h, true_h, mode);
2173 * Translate an ASM node.
2175 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env)
2177 ir_mode *his = env->params->high_signed;
2178 ir_mode *hiu = env->params->high_unsigned;
2184 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2185 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2186 if (op_mode == his || op_mode == hiu) {
2187 panic("lowering ASM unimplemented");
2194 n = get_irn_link(n);
2198 proj_mode = get_irn_mode(n);
2199 if (proj_mode == his || proj_mode == hiu) {
2200 panic("lowering ASM unimplemented");
2206 * Translate a Sel node.
2208 static void lower_Sel(ir_node *sel, ir_mode *mode, lower_env_t *env)
2212 /* we must only lower value parameter Sels if we change the
2213 value parameter type. */
2214 if (env->value_param_tp != NULL) {
2215 ir_entity *ent = get_Sel_entity(sel);
2216 if (get_entity_owner(ent) == env->value_param_tp) {
2217 int pos = PTR_TO_INT(get_entity_link(ent));
2219 ent = get_method_value_param_ent(env->l_mtp, pos);
2220 set_Sel_entity(sel, ent);
2226 * check for opcodes that must always be lowered.
2228 static int always_lower(ir_opcode code)
2243 } /* always_lower */
2246 * lower boolean Proj(Cmp)
2248 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env)
2251 ir_node *l, *r, *low, *high, *t, *res;
2256 l = get_Cmp_left(cmp);
2257 lidx = get_irn_idx(l);
2258 if (! env->entries[lidx]->low_word) {
2259 /* still not ready */
2263 r = get_Cmp_right(cmp);
2264 ridx = get_irn_idx(r);
2265 if (! env->entries[ridx]->low_word) {
2266 /* still not ready */
2270 pnc = get_Proj_proj(proj);
2271 blk = get_nodes_block(cmp);
2272 db = get_irn_dbg_info(cmp);
2273 low = new_rd_Cmp(db, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2274 high = new_rd_Cmp(db, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2276 if (pnc == pn_Cmp_Eq) {
2277 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2278 res = new_rd_And(db, blk,
2279 new_r_Proj(blk, low, mode_b, pnc),
2280 new_r_Proj(blk, high, mode_b, pnc),
2282 } else if (pnc == pn_Cmp_Lg) {
2283 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2284 res = new_rd_Or(db, blk,
2285 new_r_Proj(blk, low, mode_b, pnc),
2286 new_r_Proj(blk, high, mode_b, pnc),
2289 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2290 t = new_rd_And(db, blk,
2291 new_r_Proj(blk, low, mode_b, pnc),
2292 new_r_Proj(blk, high, mode_b, pn_Cmp_Eq),
2294 res = new_rd_Or(db, blk,
2295 new_r_Proj(blk, high, mode_b, pnc & ~pn_Cmp_Eq),
2300 } /* lower_boolean_Proj_Cmp */
2303 * The type of a lower function.
2305 * @param node the node to be lowered
2306 * @param mode the low mode for the destination node
2307 * @param env the lower environment
2309 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2314 static void lower_ops(ir_node *node, void *env)
2316 lower_env_t *lenv = env;
2317 node_entry_t *entry;
2318 int idx = get_irn_idx(node);
2319 ir_mode *mode = get_irn_mode(node);
2321 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2324 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2325 ir_node *proj = get_irn_n(node, i);
2327 if (is_Proj(proj)) {
2328 ir_node *cmp = get_Proj_pred(proj);
2331 ir_node *arg = get_Cmp_left(cmp);
2333 mode = get_irn_mode(arg);
2334 if (mode == lenv->params->high_signed ||
2335 mode == lenv->params->high_unsigned) {
2336 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2339 /* could not lower because predecessors not ready */
2340 waitq_put(lenv->waitq, node);
2343 set_irn_n(node, i, res);
2350 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2351 if (entry || always_lower(get_irn_opcode(node))) {
2352 ir_op *op = get_irn_op(node);
2353 lower_func func = (lower_func)op->ops.generic;
2356 mode = get_irn_op_mode(node);
2358 if (mode == lenv->params->high_signed)
2359 mode = lenv->params->low_signed;
2361 mode = lenv->params->low_unsigned;
2363 DB((dbg, LEVEL_1, " %+F\n", node));
2364 func(node, mode, lenv);
2369 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2372 * Compare two op_mode_entry_t's.
2374 static int cmp_op_mode(const void *elt, const void *key, size_t size)
2376 const op_mode_entry_t *e1 = elt;
2377 const op_mode_entry_t *e2 = key;
2380 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2384 * Compare two conv_tp_entry_t's.
2386 static int cmp_conv_tp(const void *elt, const void *key, size_t size)
2388 const conv_tp_entry_t *e1 = elt;
2389 const conv_tp_entry_t *e2 = key;
2392 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2396 * Enter a lowering function into an ir_op.
2398 static void enter_lower_func(ir_op *op, lower_func func)
2400 op->ops.generic = (op_func)func;
2401 } /* enter_lower_func */
2404 * Returns non-zero if a method type must be lowered.
2406 * @param mtp the method type
2408 static int mtp_must_to_lowered(ir_type *mtp, lower_env_t *env)
2412 n_params = get_method_n_params(mtp);
2416 /* first check if we have parameters that must be fixed */
2417 for (i = 0; i < n_params; ++i) {
2418 ir_type *tp = get_method_param_type(mtp, i);
2420 if (is_Primitive_type(tp)) {
2421 ir_mode *mode = get_type_mode(tp);
2423 if (mode == env->params->high_signed ||
2424 mode == env->params->high_unsigned)
2429 } /* mtp_must_to_lowered */
2434 void lower_dw_ops(const lwrdw_param_t *param)
2443 if (! param->enable)
2446 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2448 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2449 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2450 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2452 /* create the necessary maps */
2454 prim_types = pmap_create();
2455 if (! intrinsic_fkt)
2456 intrinsic_fkt = new_set(cmp_op_mode, iro_Last + 1);
2458 conv_types = new_set(cmp_conv_tp, 16);
2460 lowered_type = pmap_create();
2462 /* create a primitive unsigned and signed type */
2464 tp_u = get_primitive_type(param->low_unsigned);
2466 tp_s = get_primitive_type(param->low_signed);
2468 /* create method types for the created binop calls */
2470 binop_tp_u = new_type_method(4, 2);
2471 set_method_param_type(binop_tp_u, 0, tp_u);
2472 set_method_param_type(binop_tp_u, 1, tp_u);
2473 set_method_param_type(binop_tp_u, 2, tp_u);
2474 set_method_param_type(binop_tp_u, 3, tp_u);
2475 set_method_res_type(binop_tp_u, 0, tp_u);
2476 set_method_res_type(binop_tp_u, 1, tp_u);
2479 binop_tp_s = new_type_method(4, 2);
2480 set_method_param_type(binop_tp_s, 0, tp_u);
2481 set_method_param_type(binop_tp_s, 1, tp_s);
2482 set_method_param_type(binop_tp_s, 2, tp_u);
2483 set_method_param_type(binop_tp_s, 3, tp_s);
2484 set_method_res_type(binop_tp_s, 0, tp_u);
2485 set_method_res_type(binop_tp_s, 1, tp_s);
2487 if (! shiftop_tp_u) {
2488 shiftop_tp_u = new_type_method(3, 2);
2489 set_method_param_type(shiftop_tp_u, 0, tp_u);
2490 set_method_param_type(shiftop_tp_u, 1, tp_u);
2491 set_method_param_type(shiftop_tp_u, 2, tp_u);
2492 set_method_res_type(shiftop_tp_u, 0, tp_u);
2493 set_method_res_type(shiftop_tp_u, 1, tp_u);
2495 if (! shiftop_tp_s) {
2496 shiftop_tp_s = new_type_method(3, 2);
2497 set_method_param_type(shiftop_tp_s, 0, tp_u);
2498 set_method_param_type(shiftop_tp_s, 1, tp_s);
2499 set_method_param_type(shiftop_tp_s, 2, tp_u);
2500 set_method_res_type(shiftop_tp_s, 0, tp_u);
2501 set_method_res_type(shiftop_tp_s, 1, tp_s);
2504 unop_tp_u = new_type_method(2, 2);
2505 set_method_param_type(unop_tp_u, 0, tp_u);
2506 set_method_param_type(unop_tp_u, 1, tp_u);
2507 set_method_res_type(unop_tp_u, 0, tp_u);
2508 set_method_res_type(unop_tp_u, 1, tp_u);
2511 unop_tp_s = new_type_method(2, 2);
2512 set_method_param_type(unop_tp_s, 0, tp_u);
2513 set_method_param_type(unop_tp_s, 1, tp_s);
2514 set_method_res_type(unop_tp_s, 0, tp_u);
2515 set_method_res_type(unop_tp_s, 1, tp_s);
2518 lenv.tv_mode_bytes = new_tarval_from_long(get_mode_size_bytes(param->low_unsigned), param->low_unsigned);
2519 lenv.tv_mode_bits = new_tarval_from_long(get_mode_size_bits(param->low_unsigned), param->low_unsigned);
2520 lenv.waitq = new_pdeq();
2521 lenv.params = param;
2522 lenv.first_id = new_id_from_chars(param->little_endian ? ".l" : ".h", 2);
2523 lenv.next_id = new_id_from_chars(param->little_endian ? ".h" : ".l", 2);
2525 /* first clear the generic function pointer for all ops */
2526 clear_irp_opcodes_generic_func();
2528 #define LOWER2(op, fkt) enter_lower_func(op_##op, fkt)
2529 #define LOWER(op) LOWER2(op, lower_##op)
2530 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2531 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2533 /* the table of all operations that must be lowered follows */
2571 /* transform all graphs */
2572 rem = current_ir_graph;
2573 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2574 ir_graph *irg = get_irp_irg(i);
2579 obstack_init(&lenv.obst);
2581 n_idx = get_irg_last_idx(irg);
2582 n_idx = n_idx + (n_idx >> 2); /* add 25% */
2583 lenv.n_entries = n_idx;
2584 lenv.entries = NEW_ARR_F(node_entry_t *, n_idx);
2585 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2589 lenv.proj_2_block = pmap_create();
2590 lenv.value_param_tp = NULL;
2591 ir_reserve_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2593 ent = get_irg_entity(irg);
2594 mtp = get_entity_type(ent);
2596 if (mtp_must_to_lowered(mtp, &lenv)) {
2597 ir_type *ltp = lower_mtp(mtp, &lenv);
2598 lenv.flags |= MUST_BE_LOWERED;
2599 set_entity_type(ent, ltp);
2601 lenv.value_param_tp = get_method_value_param_type(mtp);
2604 /* first step: link all nodes and allocate data */
2605 irg_walk_graph(irg, firm_clear_node_and_phi_links, prepare_links_and_handle_rotl, &lenv);
2607 if (lenv.flags & MUST_BE_LOWERED) {
2608 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2610 /* must do some work */
2611 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2613 /* last step: all waiting nodes */
2614 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2615 current_ir_graph = irg;
2616 while (! pdeq_empty(lenv.waitq)) {
2617 ir_node *node = pdeq_getl(lenv.waitq);
2619 lower_ops(node, &lenv);
2622 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2624 /* outs are invalid, we changed the graph */
2625 set_irg_outs_inconsistent(irg);
2627 if (lenv.flags & CF_CHANGED) {
2628 /* control flow changed, dominance info is invalid */
2629 set_irg_doms_inconsistent(irg);
2630 set_irg_extblk_inconsistent(irg);
2631 set_irg_loopinfo_inconsistent(irg);
2634 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2636 pmap_destroy(lenv.proj_2_block);
2637 DEL_ARR_F(lenv.entries);
2638 obstack_free(&lenv.obst, NULL);
2640 del_pdeq(lenv.waitq);
2641 current_ir_graph = rem;
2642 } /* lower_dw_ops */
2645 ir_prog_pass_t pass;
2646 const lwrdw_param_t *param;
2650 * Creates a wrapper around lower_dw_ops().
2652 static int pass_wrapper(ir_prog *irp, void *context)
2654 struct pass_t *pass = context;
2657 lower_dw_ops(pass->param);
2661 ir_prog_pass_t *lower_dw_ops_pass(const char *name, const lwrdw_param_t *param)
2663 struct pass_t *pass = XMALLOCZ(struct pass_t);
2665 pass->param = param;
2666 return def_prog_pass_constructor(
2667 &pass->pass, name ? name : "lower_dw", pass_wrapper);
2668 } /* lower_dw_ops_pass */
2670 /* Default implementation. */
2671 ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2672 const ir_mode *imode, const ir_mode *omode,
2680 if (imode == omode) {
2681 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2683 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2684 get_mode_name(imode), get_mode_name(omode));
2686 id = new_id_from_str(buf);
2688 ent = new_entity(get_glob_type(), id, method);
2689 set_entity_ld_ident(ent, get_entity_ident(ent));
2691 } /* def_create_intrinsic_fkt */