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(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(low, low_mode, pn_Load_res);
409 env->entries[idx]->high_word = new_r_Proj(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(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,
505 op_mode_entry_t key, *entry;
512 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
513 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
515 /* create a new one */
516 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
518 assert(ent && "Intrinsic creator must return an entity");
524 return new_r_SymConst(current_ir_graph, mode_P_code, sym, symconst_addr_ent);
525 } /* get_intrinsic_address */
530 * Create an intrinsic Call.
532 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env)
534 ir_node *block, *irn, *call, *proj;
542 irn = get_Div_left(node);
543 entry = env->entries[get_irn_idx(irn)];
546 if (! entry->low_word) {
547 /* not ready yet, wait */
548 pdeq_putr(env->waitq, node);
552 in[0] = entry->low_word;
553 in[1] = entry->high_word;
555 irn = get_Div_right(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[2] = entry->low_word;
566 in[3] = entry->high_word;
568 dbg = get_irn_dbg_info(node);
569 block = get_nodes_block(node);
571 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
572 opmode = get_irn_op_mode(node);
573 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
574 call = new_rd_Call(dbg, block, get_Div_mem(node), irn, 4, in, mtp);
575 set_irn_pinned(call, get_irn_pinned(node));
576 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
578 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
579 switch (get_Proj_proj(proj)) {
580 case pn_Div_M: /* Memory result. */
581 /* reroute to the call */
582 set_Proj_pred(proj, call);
583 set_Proj_proj(proj, pn_Call_M);
585 case pn_Div_X_except: /* Execution result if exception occurred. */
586 /* reroute to the call */
587 set_Proj_pred(proj, call);
588 set_Proj_proj(proj, pn_Call_X_except);
590 case pn_Div_res: /* Result of computation. */
591 idx = get_irn_idx(proj);
592 assert(idx < env->n_entries);
593 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
594 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
597 assert(0 && "unexpected Proj number");
599 /* mark this proj: we have handled it already, otherwise we might fall into
601 mark_irn_visited(proj);
608 * Create an intrinsic Call.
610 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env)
612 ir_node *block, *proj, *irn, *call;
620 irn = get_Mod_left(node);
621 entry = env->entries[get_irn_idx(irn)];
624 if (! entry->low_word) {
625 /* not ready yet, wait */
626 pdeq_putr(env->waitq, node);
630 in[0] = entry->low_word;
631 in[1] = entry->high_word;
633 irn = get_Mod_right(node);
634 entry = env->entries[get_irn_idx(irn)];
637 if (! entry->low_word) {
638 /* not ready yet, wait */
639 pdeq_putr(env->waitq, node);
643 in[2] = entry->low_word;
644 in[3] = entry->high_word;
646 dbg = get_irn_dbg_info(node);
647 block = get_nodes_block(node);
649 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
650 opmode = get_irn_op_mode(node);
651 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
652 call = new_rd_Call(dbg, block, get_Mod_mem(node), irn, 4, in, mtp);
653 set_irn_pinned(call, get_irn_pinned(node));
654 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
656 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
657 switch (get_Proj_proj(proj)) {
658 case pn_Mod_M: /* Memory result. */
659 /* reroute to the call */
660 set_Proj_pred(proj, call);
661 set_Proj_proj(proj, pn_Call_M);
663 case pn_Mod_X_except: /* Execution result if exception occurred. */
664 /* reroute to the call */
665 set_Proj_pred(proj, call);
666 set_Proj_proj(proj, pn_Call_X_except);
668 case pn_Mod_res: /* Result of computation. */
669 idx = get_irn_idx(proj);
670 assert(idx < env->n_entries);
671 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
672 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
675 assert(0 && "unexpected Proj number");
677 /* mark this proj: we have handled it already, otherwise we might fall into
679 mark_irn_visited(proj);
684 * Translate a DivMod.
686 * Create two intrinsic Calls.
688 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env)
690 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
691 ir_node *resDiv = NULL;
692 ir_node *resMod = NULL;
701 /* check if both results are needed */
702 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
703 switch (get_Proj_proj(proj)) {
704 case pn_DivMod_res_div: flags |= 1; break;
705 case pn_DivMod_res_mod: flags |= 2; break;
710 irn = get_DivMod_left(node);
711 entry = env->entries[get_irn_idx(irn)];
714 if (! entry->low_word) {
715 /* not ready yet, wait */
716 pdeq_putr(env->waitq, node);
720 in[0] = entry->low_word;
721 in[1] = entry->high_word;
723 irn = get_DivMod_right(node);
724 entry = env->entries[get_irn_idx(irn)];
727 if (! entry->low_word) {
728 /* not ready yet, wait */
729 pdeq_putr(env->waitq, node);
733 in[2] = entry->low_word;
734 in[3] = entry->high_word;
736 dbg = get_irn_dbg_info(node);
737 block = get_nodes_block(node);
739 mem = get_DivMod_mem(node);
741 callDiv = callMod = NULL;
742 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
744 opmode = get_irn_op_mode(node);
745 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, env);
746 callDiv = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
747 set_irn_pinned(callDiv, get_irn_pinned(node));
748 resDiv = new_r_Proj(callDiv, mode_T, pn_Call_T_result);
752 mem = new_r_Proj(callDiv, mode_M, pn_Call_M);
753 opmode = get_irn_op_mode(node);
754 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, env);
755 callMod = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
756 set_irn_pinned(callMod, get_irn_pinned(node));
757 resMod = new_r_Proj(callMod, mode_T, pn_Call_T_result);
760 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
761 switch (get_Proj_proj(proj)) {
762 case pn_DivMod_M: /* Memory result. */
763 /* reroute to the first call */
764 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
765 set_Proj_proj(proj, pn_Call_M);
767 case pn_DivMod_X_except: /* Execution result if exception occurred. */
768 /* reroute to the first call */
769 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
770 set_Proj_proj(proj, pn_Call_X_except);
772 case pn_DivMod_res_div: /* Result of Div. */
773 idx = get_irn_idx(proj);
774 assert(idx < env->n_entries);
775 env->entries[idx]->low_word = new_r_Proj(resDiv, env->params->low_unsigned, 0);
776 env->entries[idx]->high_word = new_r_Proj(resDiv, mode, 1);
778 case pn_DivMod_res_mod: /* Result of Mod. */
779 idx = get_irn_idx(proj);
780 env->entries[idx]->low_word = new_r_Proj(resMod, env->params->low_unsigned, 0);
781 env->entries[idx]->high_word = new_r_Proj(resMod, mode, 1);
784 assert(0 && "unexpected Proj number");
786 /* mark this proj: we have handled it already, otherwise we might fall into
788 mark_irn_visited(proj);
795 * Create an intrinsic Call.
797 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env)
799 ir_node *block, *irn;
807 irn = get_binop_left(node);
808 entry = env->entries[get_irn_idx(irn)];
811 if (! entry->low_word) {
812 /* not ready yet, wait */
813 pdeq_putr(env->waitq, node);
817 in[0] = entry->low_word;
818 in[1] = entry->high_word;
820 irn = get_binop_right(node);
821 entry = env->entries[get_irn_idx(irn)];
824 if (! entry->low_word) {
825 /* not ready yet, wait */
826 pdeq_putr(env->waitq, node);
830 in[2] = entry->low_word;
831 in[3] = entry->high_word;
833 dbg = get_irn_dbg_info(node);
834 block = get_nodes_block(node);
835 irg = current_ir_graph;
837 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
838 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
839 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
841 set_irn_pinned(irn, get_irn_pinned(node));
842 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
844 idx = get_irn_idx(node);
845 assert(idx < env->n_entries);
846 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
847 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
851 * Translate a Shiftop.
853 * Create an intrinsic Call.
855 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env)
857 ir_node *block, *irn;
865 irn = get_binop_left(node);
866 entry = env->entries[get_irn_idx(irn)];
869 if (! entry->low_word) {
870 /* not ready yet, wait */
871 pdeq_putr(env->waitq, node);
875 in[0] = entry->low_word;
876 in[1] = entry->high_word;
878 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
879 in[2] = get_binop_right(node);
880 assert(get_irn_mode(in[2]) != env->params->high_signed
881 && get_irn_mode(in[2]) != env->params->high_unsigned);
883 dbg = get_irn_dbg_info(node);
884 block = get_nodes_block(node);
885 irg = current_ir_graph;
887 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
888 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
889 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
891 set_irn_pinned(irn, get_irn_pinned(node));
892 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
894 idx = get_irn_idx(node);
895 assert(idx < env->n_entries);
896 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
897 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
898 } /* lower_Shiftop */
901 * Translate a Shr and handle special cases.
903 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env)
905 ir_node *right = get_Shr_right(node);
906 ir_graph *irg = current_ir_graph;
908 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
909 tarval *tv = get_Const_tarval(right);
911 if (tarval_is_long(tv) &&
912 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
913 ir_node *block = get_nodes_block(node);
914 ir_node *left = get_Shr_left(node);
916 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
917 int idx = get_irn_idx(left);
919 left = env->entries[idx]->high_word;
921 /* not ready yet, wait */
922 pdeq_putr(env->waitq, node);
926 idx = get_irn_idx(node);
929 c = new_r_Const_long(irg, env->params->low_unsigned, shf_cnt);
930 env->entries[idx]->low_word = new_r_Shr(block, left, c, mode);
932 env->entries[idx]->low_word = left;
934 env->entries[idx]->high_word = new_r_Const(irg, get_mode_null(mode));
939 lower_Shiftop(node, mode, env);
943 * Translate a Shl and handle special cases.
945 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env)
947 ir_node *right = get_Shl_right(node);
948 ir_graph *irg = current_ir_graph;
950 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
951 tarval *tv = get_Const_tarval(right);
953 if (tarval_is_long(tv) &&
954 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
956 ir_node *block = get_nodes_block(node);
957 ir_node *left = get_Shl_left(node);
959 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
960 int idx = get_irn_idx(left);
962 left = new_r_Conv(block, env->entries[idx]->low_word, mode);
963 idx = get_irn_idx(node);
965 mode_l = env->params->low_unsigned;
967 c = new_r_Const_long(irg, mode_l, shf_cnt);
968 env->entries[idx]->high_word = new_r_Shl(block, left, c, mode);
970 env->entries[idx]->high_word = left;
972 env->entries[idx]->low_word = new_r_Const(irg, get_mode_null(mode_l));
977 lower_Shiftop(node, mode, env);
981 * Translate a Shrs and handle special cases.
983 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env)
985 ir_node *right = get_Shrs_right(node);
986 ir_graph *irg = current_ir_graph;
988 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
989 tarval *tv = get_Const_tarval(right);
991 if (tarval_is_long(tv) &&
992 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
993 ir_node *block = get_nodes_block(node);
994 ir_node *left = get_Shrs_left(node);
995 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
996 int idx = get_irn_idx(left);
1001 left = env->entries[idx]->high_word;
1002 idx = get_irn_idx(node);
1004 mode_l = env->params->low_unsigned;
1006 c = new_r_Const_long(irg, mode_l, shf_cnt);
1007 low = new_r_Shrs(block, left, c, mode);
1011 /* low word is expected to have mode_l */
1012 env->entries[idx]->low_word = new_r_Conv(block, low, mode_l);
1014 c = new_r_Const_long(irg, mode_l, get_mode_size_bits(mode) - 1);
1015 env->entries[idx]->high_word = new_r_Shrs(block, left, c, mode);
1020 lower_Shiftop(node, mode, env);
1024 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1026 static void prepare_links_and_handle_rotl(ir_node *node, void *env)
1028 lower_env_t *lenv = env;
1030 if (is_Rotl(node)) {
1031 ir_mode *mode = get_irn_op_mode(node);
1032 if (mode == lenv->params->high_signed ||
1033 mode == lenv->params->high_unsigned) {
1034 ir_node *right = get_Rotl_right(node);
1035 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1036 ir_mode *omode, *rmode;
1038 optimization_state_t state;
1040 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1041 tarval *tv = get_Const_tarval(right);
1043 if (tarval_is_long(tv) &&
1044 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1045 /* will be optimized in lower_Rotl() */
1050 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1051 dbg = get_irn_dbg_info(node);
1052 omode = get_irn_mode(node);
1053 left = get_Rotl_left(node);
1054 block = get_nodes_block(node);
1055 shl = new_rd_Shl(dbg, block, left, right, omode);
1056 rmode = get_irn_mode(right);
1057 c = new_Const_long(rmode, get_mode_size_bits(omode));
1058 sub = new_rd_Sub(dbg, block, c, right, rmode);
1059 shr = new_rd_Shr(dbg, block, left, sub, omode);
1061 /* optimization must be switched off here, or we will get the Rotl back */
1062 save_optimization_state(&state);
1063 set_opt_algebraic_simplification(0);
1064 or = new_rd_Or(dbg, block, shl, shr, omode);
1065 restore_optimization_state(&state);
1069 /* do lowering on the new nodes */
1070 prepare_links(shl, env);
1071 prepare_links(c, env);
1072 prepare_links(sub, env);
1073 prepare_links(shr, env);
1074 prepare_links(or, env);
1077 prepare_links(node, env);
1082 * Translate a special case Rotl(x, sizeof(w)).
1084 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env)
1086 ir_node *right = get_Rotl_right(node);
1087 ir_node *left = get_Rotl_left(node);
1089 int idx = get_irn_idx(left);
1093 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1094 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1095 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1097 l = env->entries[idx]->low_word;
1098 h = env->entries[idx]->high_word;
1099 idx = get_irn_idx(node);
1101 env->entries[idx]->low_word = h;
1102 env->entries[idx]->high_word = l;
1106 * Translate an Unop.
1108 * Create an intrinsic Call.
1110 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env)
1112 ir_node *block, *irn;
1117 node_entry_t *entry;
1119 irn = get_unop_op(node);
1120 entry = env->entries[get_irn_idx(irn)];
1123 if (! entry->low_word) {
1124 /* not ready yet, wait */
1125 pdeq_putr(env->waitq, node);
1129 in[0] = entry->low_word;
1130 in[1] = entry->high_word;
1132 dbg = get_irn_dbg_info(node);
1133 block = get_nodes_block(node);
1135 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1136 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
1137 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
1139 set_irn_pinned(irn, get_irn_pinned(node));
1140 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
1142 idx = get_irn_idx(node);
1143 assert(idx < env->n_entries);
1144 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
1145 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
1149 * Translate a logical Binop.
1151 * Create two logical Binops.
1153 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1154 ir_node *(*constr_rd)(dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1155 ir_node *block, *irn;
1156 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1160 node_entry_t *entry;
1162 irn = get_binop_left(node);
1163 entry = env->entries[get_irn_idx(irn)];
1166 if (! entry->low_word) {
1167 /* not ready yet, wait */
1168 pdeq_putr(env->waitq, node);
1172 lop_l = entry->low_word;
1173 lop_h = entry->high_word;
1175 irn = get_binop_right(node);
1176 entry = env->entries[get_irn_idx(irn)];
1179 if (! entry->low_word) {
1180 /* not ready yet, wait */
1181 pdeq_putr(env->waitq, node);
1185 rop_l = entry->low_word;
1186 rop_h = entry->high_word;
1188 dbg = get_irn_dbg_info(node);
1189 block = get_nodes_block(node);
1191 idx = get_irn_idx(node);
1192 assert(idx < env->n_entries);
1193 irg = current_ir_graph;
1194 env->entries[idx]->low_word = constr_rd(dbg, block, lop_l, rop_l, env->params->low_unsigned);
1195 env->entries[idx]->high_word = constr_rd(dbg, block, lop_h, rop_h, mode);
1196 } /* lower_Binop_logical */
1198 /** create a logical operation transformation */
1199 #define lower_logical(op) \
1200 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1201 lower_Binop_logical(node, mode, env, new_rd_##op); \
1211 * Create two logical Nots.
1213 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env)
1215 ir_node *block, *irn;
1216 ir_node *op_l, *op_h;
1219 node_entry_t *entry;
1221 irn = get_Not_op(node);
1222 entry = env->entries[get_irn_idx(irn)];
1225 if (! entry->low_word) {
1226 /* not ready yet, wait */
1227 pdeq_putr(env->waitq, node);
1231 op_l = entry->low_word;
1232 op_h = entry->high_word;
1234 dbg = get_irn_dbg_info(node);
1235 block = get_nodes_block(node);
1237 idx = get_irn_idx(node);
1238 assert(idx < env->n_entries);
1239 env->entries[idx]->low_word = new_rd_Not(dbg, block, op_l, env->params->low_unsigned);
1240 env->entries[idx]->high_word = new_rd_Not(dbg, block, op_h, mode);
1246 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env)
1248 ir_node *cmp, *left, *right, *block;
1249 ir_node *sel = get_Cond_selector(node);
1250 ir_mode *m = get_irn_mode(sel);
1255 node_entry_t *lentry, *rentry;
1256 ir_node *proj, *projT = NULL, *projF = NULL;
1257 ir_node *new_bl, *cmpH, *cmpL, *irn;
1258 ir_node *projHF, *projHT;
1267 cmp = get_Proj_pred(sel);
1271 left = get_Cmp_left(cmp);
1272 idx = get_irn_idx(left);
1273 lentry = env->entries[idx];
1280 right = get_Cmp_right(cmp);
1281 idx = get_irn_idx(right);
1282 rentry = env->entries[idx];
1285 if (! lentry->low_word || !rentry->low_word) {
1287 pdeq_putr(env->waitq, node);
1291 /* all right, build the code */
1292 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1293 long proj_nr = get_Proj_proj(proj);
1295 if (proj_nr == pn_Cond_true) {
1296 assert(projT == NULL && "more than one Proj(true)");
1299 assert(proj_nr == pn_Cond_false);
1300 assert(projF == NULL && "more than one Proj(false)");
1303 mark_irn_visited(proj);
1305 assert(projT && projF);
1307 /* create a new high compare */
1308 block = get_nodes_block(node);
1309 irg = get_Block_irg(block);
1310 dbg = get_irn_dbg_info(cmp);
1311 pnc = get_Proj_proj(sel);
1313 if (is_Const(right) && is_Const_null(right)) {
1314 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1315 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1316 ir_mode *mode = env->params->low_unsigned;
1317 ir_node *low = new_r_Conv(block, lentry->low_word, mode);
1318 ir_node *high = new_r_Conv(block, lentry->high_word, mode);
1319 ir_node *or = new_rd_Or(dbg, block, low, high, mode);
1320 ir_node *cmp = new_rd_Cmp(dbg, block, or, new_Const_long(mode, 0));
1322 ir_node *proj = new_r_Proj(cmp, mode_b, pnc);
1323 set_Cond_selector(node, proj);
1328 cmpH = new_rd_Cmp(dbg, block, lentry->high_word, rentry->high_word);
1330 if (pnc == pn_Cmp_Eq) {
1331 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1332 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1335 dst_blk = entry->value;
1337 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1338 dbg = get_irn_dbg_info(node);
1339 irn = new_rd_Cond(dbg, block, irn);
1341 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1342 mark_irn_visited(projHF);
1343 exchange(projF, projHF);
1345 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1346 mark_irn_visited(projHT);
1348 new_bl = new_r_Block(irg, 1, &projHT);
1350 dbg = get_irn_dbg_info(cmp);
1351 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1352 irn = new_r_Proj(cmpL, mode_b, pn_Cmp_Eq);
1353 dbg = get_irn_dbg_info(node);
1354 irn = new_rd_Cond(dbg, new_bl, irn);
1356 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1357 mark_irn_visited(proj);
1358 add_block_cf_input(dst_blk, projHF, proj);
1360 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1361 mark_irn_visited(proj);
1362 exchange(projT, proj);
1363 } else if (pnc == pn_Cmp_Lg) {
1364 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1365 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1368 dst_blk = entry->value;
1370 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Lg);
1371 dbg = get_irn_dbg_info(node);
1372 irn = new_rd_Cond(dbg, block, irn);
1374 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1375 mark_irn_visited(projHT);
1376 exchange(projT, projHT);
1378 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1379 mark_irn_visited(projHF);
1381 new_bl = new_r_Block(irg, 1, &projHF);
1383 dbg = get_irn_dbg_info(cmp);
1384 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1385 irn = new_r_Proj(cmpL, mode_b, pn_Cmp_Lg);
1386 dbg = get_irn_dbg_info(node);
1387 irn = new_rd_Cond(dbg, new_bl, irn);
1389 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1390 mark_irn_visited(proj);
1391 add_block_cf_input(dst_blk, projHT, proj);
1393 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1394 mark_irn_visited(proj);
1395 exchange(projF, proj);
1397 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1398 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1401 entry = pmap_find(env->proj_2_block, projT);
1403 dstT = entry->value;
1405 entry = pmap_find(env->proj_2_block, projF);
1407 dstF = entry->value;
1409 irn = new_r_Proj(cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1410 dbg = get_irn_dbg_info(node);
1411 irn = new_rd_Cond(dbg, block, irn);
1413 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1414 mark_irn_visited(projHT);
1415 exchange(projT, projHT);
1418 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1419 mark_irn_visited(projHF);
1421 newbl_eq = new_r_Block(irg, 1, &projHF);
1423 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1424 irn = new_rd_Cond(dbg, newbl_eq, irn);
1426 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1427 mark_irn_visited(proj);
1428 exchange(projF, proj);
1431 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1432 mark_irn_visited(proj);
1434 newbl_l = new_r_Block(irg, 1, &proj);
1436 dbg = get_irn_dbg_info(cmp);
1437 cmpL = new_rd_Cmp(dbg, newbl_l, lentry->low_word, rentry->low_word);
1438 irn = new_r_Proj(cmpL, mode_b, pnc);
1439 dbg = get_irn_dbg_info(node);
1440 irn = new_rd_Cond(dbg, newbl_l, irn);
1442 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1443 mark_irn_visited(proj);
1444 add_block_cf_input(dstT, projT, proj);
1446 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1447 mark_irn_visited(proj);
1448 add_block_cf_input(dstF, projF, proj);
1451 /* we have changed the control flow */
1452 env->flags |= CF_CHANGED;
1454 idx = get_irn_idx(sel);
1456 if (env->entries[idx]) {
1458 Bad, a jump-table with double-word index.
1459 This should not happen, but if it does we handle
1460 it like a Conv were between (in other words, ignore
1464 if (! env->entries[idx]->low_word) {
1465 /* not ready yet, wait */
1466 pdeq_putr(env->waitq, node);
1469 set_Cond_selector(node, env->entries[idx]->low_word);
1475 * Translate a Conv to higher_signed
1477 static void lower_Conv_to_Ll(ir_node *node, lower_env_t *env)
1479 ir_mode *omode = get_irn_mode(node);
1480 ir_node *op = get_Conv_op(node);
1481 ir_mode *imode = get_irn_mode(op);
1482 int idx = get_irn_idx(node);
1483 ir_graph *irg = current_ir_graph;
1484 ir_node *block = get_nodes_block(node);
1485 dbg_info *dbg = get_irn_dbg_info(node);
1486 node_entry_t *entry = env->entries[idx];
1487 ir_mode *low_unsigned = env->params->low_unsigned;
1489 = mode_is_signed(omode) ? env->params->low_signed : low_unsigned;
1491 assert(idx < env->n_entries);
1493 if (mode_is_int(imode) || mode_is_reference(imode)) {
1494 if (imode == env->params->high_signed
1495 || imode == env->params->high_unsigned) {
1496 /* a Conv from Lu to Ls or Ls to Lu */
1497 int op_idx = get_irn_idx(op);
1498 node_entry_t *op_entry = env->entries[op_idx];
1500 if (! op_entry->low_word) {
1501 /* not ready yet, wait */
1502 pdeq_putr(env->waitq, node);
1505 entry->low_word = op_entry->low_word;
1506 entry->high_word = new_rd_Conv(dbg, block, op_entry->high_word,
1509 /* simple case: create a high word */
1510 if (imode != low_unsigned)
1511 op = new_rd_Conv(dbg, block, op, low_unsigned);
1513 entry->low_word = op;
1515 if (mode_is_signed(imode)) {
1516 int c = get_mode_size_bits(low_signed) - 1;
1517 ir_node *cnst = new_Const_long(low_unsigned, c);
1518 if (get_irn_mode(op) != low_signed)
1519 op = new_rd_Conv(dbg, block, op, low_signed);
1520 entry->high_word = new_rd_Shrs(dbg, block, op, cnst,
1523 entry->high_word = new_Const(get_mode_null(low_signed));
1526 } else if (imode == mode_b) {
1527 entry->low_word = new_rd_Conv(dbg, block, op, low_unsigned);
1528 entry->high_word = new_Const(get_mode_null(low_signed));
1530 ir_node *irn, *call;
1531 ir_type *mtp = get_conv_type(imode, omode, env);
1533 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1534 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1535 set_irn_pinned(call, get_irn_pinned(node));
1536 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1538 entry->low_word = new_r_Proj(irn, low_unsigned, 0);
1539 entry->high_word = new_r_Proj(irn, low_signed, 1);
1544 * Translate a Conv from higher_unsigned
1546 static void lower_Conv_from_Ll(ir_node *node, lower_env_t *env)
1548 ir_node *op = get_Conv_op(node);
1549 ir_mode *omode = get_irn_mode(node);
1550 ir_node *block = get_nodes_block(node);
1551 dbg_info *dbg = get_irn_dbg_info(node);
1552 int idx = get_irn_idx(op);
1553 ir_graph *irg = current_ir_graph;
1554 node_entry_t *entry = env->entries[idx];
1556 assert(idx < env->n_entries);
1558 if (! entry->low_word) {
1559 /* not ready yet, wait */
1560 pdeq_putr(env->waitq, node);
1564 if (mode_is_int(omode) || mode_is_reference(omode)) {
1565 op = entry->low_word;
1567 /* simple case: create a high word */
1568 if (omode != env->params->low_unsigned)
1569 op = new_rd_Conv(dbg, block, op, omode);
1571 set_Conv_op(node, op);
1572 } else if (omode == mode_b) {
1573 /* llu ? true : false <=> (low|high) ? true : false */
1574 ir_mode *mode = env->params->low_unsigned;
1575 ir_node *or = new_rd_Or(dbg, block, entry->low_word, entry->high_word,
1577 set_Conv_op(node, or);
1579 ir_node *irn, *call, *in[2];
1580 ir_mode *imode = get_irn_mode(op);
1581 ir_type *mtp = get_conv_type(imode, omode, env);
1583 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1584 in[0] = entry->low_word;
1585 in[1] = entry->high_word;
1587 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1588 set_irn_pinned(call, get_irn_pinned(node));
1589 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1591 exchange(node, new_r_Proj(irn, omode, 0));
1598 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env)
1600 mode = get_irn_mode(node);
1602 if (mode == env->params->high_signed
1603 || mode == env->params->high_unsigned) {
1604 lower_Conv_to_Ll(node, env);
1606 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1608 if (mode == env->params->high_signed
1609 || mode == env->params->high_unsigned) {
1610 lower_Conv_from_Ll(node, env);
1616 * Lower the method type.
1618 * @param mtp the method type to lower
1619 * @param ent the lower environment
1621 * @return the lowered type
1623 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env)
1627 ir_type *res, *value_type;
1629 if (is_lowered_type(mtp))
1632 entry = pmap_find(lowered_type, mtp);
1634 int i, n, r, n_param, n_res;
1636 /* count new number of params */
1637 n_param = n = get_method_n_params(mtp);
1638 for (i = n_param - 1; i >= 0; --i) {
1639 ir_type *tp = get_method_param_type(mtp, i);
1641 if (is_Primitive_type(tp)) {
1642 ir_mode *mode = get_type_mode(tp);
1644 if (mode == env->params->high_signed ||
1645 mode == env->params->high_unsigned)
1650 /* count new number of results */
1651 n_res = r = get_method_n_ress(mtp);
1652 for (i = n_res - 1; i >= 0; --i) {
1653 ir_type *tp = get_method_res_type(mtp, i);
1655 if (is_Primitive_type(tp)) {
1656 ir_mode *mode = get_type_mode(tp);
1658 if (mode == env->params->high_signed ||
1659 mode == env->params->high_unsigned)
1664 res = new_type_method(n_param, n_res);
1666 /* set param types and result types */
1667 for (i = n_param = 0; i < n; ++i) {
1668 ir_type *tp = get_method_param_type(mtp, i);
1670 if (is_Primitive_type(tp)) {
1671 ir_mode *mode = get_type_mode(tp);
1673 if (mode == env->params->high_signed) {
1674 set_method_param_type(res, n_param++, tp_u);
1675 set_method_param_type(res, n_param++, tp_s);
1676 } else if (mode == env->params->high_unsigned) {
1677 set_method_param_type(res, n_param++, tp_u);
1678 set_method_param_type(res, n_param++, tp_u);
1680 set_method_param_type(res, n_param++, tp);
1683 set_method_param_type(res, n_param++, tp);
1686 for (i = n_res = 0; i < r; ++i) {
1687 ir_type *tp = get_method_res_type(mtp, i);
1689 if (is_Primitive_type(tp)) {
1690 ir_mode *mode = get_type_mode(tp);
1692 if (mode == env->params->high_signed) {
1693 set_method_res_type(res, n_res++, tp_u);
1694 set_method_res_type(res, n_res++, tp_s);
1695 } else if (mode == env->params->high_unsigned) {
1696 set_method_res_type(res, n_res++, tp_u);
1697 set_method_res_type(res, n_res++, tp_u);
1699 set_method_res_type(res, n_res++, tp);
1702 set_method_res_type(res, n_res++, tp);
1705 set_lowered_type(mtp, res);
1706 pmap_insert(lowered_type, mtp, res);
1708 value_type = get_method_value_param_type(mtp);
1709 if (value_type != NULL) {
1710 /* this creates a new value parameter type */
1711 (void)get_method_value_param_ent(res, 0);
1713 /* set new param positions */
1714 for (i = n_param = 0; i < n; ++i) {
1715 ir_type *tp = get_method_param_type(mtp, i);
1716 ident *id = get_method_param_ident(mtp, i);
1717 ir_entity *ent = get_method_value_param_ent(mtp, i);
1719 set_entity_link(ent, INT_TO_PTR(n_param));
1720 if (is_Primitive_type(tp)) {
1721 ir_mode *mode = get_type_mode(tp);
1723 if (mode == env->params->high_signed || mode == env->params->high_unsigned) {
1725 lid = id_mangle(id, env->first_id);
1726 set_method_param_ident(res, n_param, lid);
1727 set_entity_ident(get_method_value_param_ent(res, n_param), lid);
1728 lid = id_mangle(id, env->next_id);
1729 set_method_param_ident(res, n_param + 1, lid);
1730 set_entity_ident(get_method_value_param_ent(res, n_param + 1), lid);
1737 set_method_param_ident(res, n_param, id);
1738 set_entity_ident(get_method_value_param_ent(res, n_param), id);
1743 set_lowered_type(value_type, get_method_value_param_type(res));
1752 * Translate a Return.
1754 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env)
1756 ir_graph *irg = current_ir_graph;
1757 ir_entity *ent = get_irg_entity(irg);
1758 ir_type *mtp = get_entity_type(ent);
1764 /* check if this return must be lowered */
1765 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1766 ir_node *pred = get_Return_res(node, i);
1767 ir_mode *mode = get_irn_op_mode(pred);
1769 if (mode == env->params->high_signed ||
1770 mode == env->params->high_unsigned) {
1771 idx = get_irn_idx(pred);
1772 if (! env->entries[idx]->low_word) {
1773 /* not ready yet, wait */
1774 pdeq_putr(env->waitq, node);
1783 ent = get_irg_entity(irg);
1784 mtp = get_entity_type(ent);
1786 mtp = lower_mtp(mtp, env);
1787 set_entity_type(ent, mtp);
1789 /* create a new in array */
1790 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1791 in[0] = get_Return_mem(node);
1793 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1794 ir_node *pred = get_Return_res(node, i);
1796 idx = get_irn_idx(pred);
1797 assert(idx < env->n_entries);
1799 if (env->entries[idx]) {
1800 in[++j] = env->entries[idx]->low_word;
1801 in[++j] = env->entries[idx]->high_word;
1807 set_irn_in(node, j+1, in);
1808 } /* lower_Return */
1811 * Translate the parameters.
1813 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env)
1815 ir_graph *irg = get_irn_irg(node);
1816 ir_entity *ent = get_irg_entity(irg);
1817 ir_type *tp = get_entity_type(ent);
1820 int i, j, n_params, rem;
1821 ir_node *proj, *args;
1824 if (is_lowered_type(tp)) {
1825 mtp = get_associated_type(tp);
1829 assert(! is_lowered_type(mtp));
1831 n_params = get_method_n_params(mtp);
1835 NEW_ARR_A(long, new_projs, n_params);
1837 /* first check if we have parameters that must be fixed */
1838 for (i = j = 0; i < n_params; ++i, ++j) {
1839 ir_type *tp = get_method_param_type(mtp, i);
1842 if (is_Primitive_type(tp)) {
1843 ir_mode *mode = get_type_mode(tp);
1845 if (mode == env->params->high_signed ||
1846 mode == env->params->high_unsigned)
1853 mtp = lower_mtp(mtp, env);
1854 set_entity_type(ent, mtp);
1856 /* switch off optimization for new Proj nodes or they might be CSE'ed
1857 with not patched one's */
1858 rem = get_optimize();
1861 /* ok, fix all Proj's and create new ones */
1862 args = get_irg_args(irg);
1863 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1864 ir_node *pred = get_Proj_pred(proj);
1870 /* do not visit this node again */
1871 mark_irn_visited(proj);
1876 proj_nr = get_Proj_proj(proj);
1877 set_Proj_proj(proj, new_projs[proj_nr]);
1879 idx = get_irn_idx(proj);
1880 if (env->entries[idx]) {
1881 ir_mode *low_mode = env->params->low_unsigned;
1883 mode = get_irn_mode(proj);
1885 if (mode == env->params->high_signed) {
1886 mode = env->params->low_signed;
1888 mode = env->params->low_unsigned;
1891 dbg = get_irn_dbg_info(proj);
1892 env->entries[idx]->low_word =
1893 new_rd_Proj(dbg, args, low_mode, new_projs[proj_nr]);
1894 env->entries[idx]->high_word =
1895 new_rd_Proj(dbg, args, mode, new_projs[proj_nr] + 1);
1904 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env)
1906 ir_type *tp = get_Call_type(node);
1908 ir_node **in, *proj, *results;
1909 int n_params, n_res, need_lower = 0;
1911 long *res_numbers = NULL;
1914 if (is_lowered_type(tp)) {
1915 call_tp = get_associated_type(tp);
1920 assert(! is_lowered_type(call_tp));
1922 n_params = get_method_n_params(call_tp);
1923 for (i = 0; i < n_params; ++i) {
1924 ir_type *tp = get_method_param_type(call_tp, i);
1926 if (is_Primitive_type(tp)) {
1927 ir_mode *mode = get_type_mode(tp);
1929 if (mode == env->params->high_signed ||
1930 mode == env->params->high_unsigned) {
1936 n_res = get_method_n_ress(call_tp);
1938 NEW_ARR_A(long, res_numbers, n_res);
1940 for (i = j = 0; i < n_res; ++i, ++j) {
1941 ir_type *tp = get_method_res_type(call_tp, i);
1944 if (is_Primitive_type(tp)) {
1945 ir_mode *mode = get_type_mode(tp);
1947 if (mode == env->params->high_signed ||
1948 mode == env->params->high_unsigned) {
1959 /* let's lower it */
1960 call_tp = lower_mtp(call_tp, env);
1961 set_Call_type(node, call_tp);
1963 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
1965 in[0] = get_Call_mem(node);
1966 in[1] = get_Call_ptr(node);
1968 for (j = 2, i = 0; i < n_params; ++i) {
1969 ir_node *pred = get_Call_param(node, i);
1970 int idx = get_irn_idx(pred);
1972 if (env->entries[idx]) {
1973 if (! env->entries[idx]->low_word) {
1974 /* not ready yet, wait */
1975 pdeq_putr(env->waitq, node);
1978 in[j++] = env->entries[idx]->low_word;
1979 in[j++] = env->entries[idx]->high_word;
1985 set_irn_in(node, j, in);
1987 /* fix the results */
1989 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1990 long proj_nr = get_Proj_proj(proj);
1992 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
1993 /* found the result proj */
1999 if (results) { /* there are results */
2000 int rem = get_optimize();
2002 /* switch off optimization for new Proj nodes or they might be CSE'ed
2003 with not patched one's */
2005 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2006 if (get_Proj_pred(proj) == results) {
2007 long proj_nr = get_Proj_proj(proj);
2010 /* found a result */
2011 set_Proj_proj(proj, res_numbers[proj_nr]);
2012 idx = get_irn_idx(proj);
2013 if (env->entries[idx]) {
2014 ir_mode *mode = get_irn_mode(proj);
2015 ir_mode *low_mode = env->params->low_unsigned;
2018 if (mode == env->params->high_signed) {
2019 mode = env->params->low_signed;
2021 mode = env->params->low_unsigned;
2024 dbg = get_irn_dbg_info(proj);
2025 env->entries[idx]->low_word =
2026 new_rd_Proj(dbg, results, low_mode, res_numbers[proj_nr]);
2027 env->entries[idx]->high_word =
2028 new_rd_Proj(dbg, results, mode, res_numbers[proj_nr] + 1);
2030 mark_irn_visited(proj);
2038 * Translate an Unknown into two.
2040 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env)
2042 int idx = get_irn_idx(node);
2043 ir_graph *irg = get_irn_irg(node);
2044 ir_mode *low_mode = env->params->low_unsigned;
2046 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2047 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2048 } /* lower_Unknown */
2053 * First step: just create two templates
2055 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env)
2057 ir_mode *mode_l = env->params->low_unsigned;
2058 ir_graph *irg = get_irn_irg(phi);
2059 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2060 ir_node **inl, **inh;
2062 int idx, i, arity = get_Phi_n_preds(phi);
2065 idx = get_irn_idx(phi);
2066 if (env->entries[idx]->low_word) {
2067 /* Phi nodes already build, check for inputs */
2068 ir_node *phil = env->entries[idx]->low_word;
2069 ir_node *phih = env->entries[idx]->high_word;
2071 for (i = 0; i < arity; ++i) {
2072 ir_node *pred = get_Phi_pred(phi, i);
2073 int idx = get_irn_idx(pred);
2075 if (env->entries[idx]->low_word) {
2076 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2077 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2079 /* still not ready */
2080 pdeq_putr(env->waitq, phi);
2086 /* first create a new in array */
2087 NEW_ARR_A(ir_node *, inl, arity);
2088 NEW_ARR_A(ir_node *, inh, arity);
2089 unk_l = new_r_Unknown(irg, mode_l);
2090 unk_h = new_r_Unknown(irg, mode);
2092 for (i = 0; i < arity; ++i) {
2093 ir_node *pred = get_Phi_pred(phi, i);
2094 int idx = get_irn_idx(pred);
2096 if (env->entries[idx]->low_word) {
2097 inl[i] = env->entries[idx]->low_word;
2098 inh[i] = env->entries[idx]->high_word;
2106 dbg = get_irn_dbg_info(phi);
2107 block = get_nodes_block(phi);
2109 idx = get_irn_idx(phi);
2110 assert(idx < env->n_entries);
2111 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, block, arity, inl, mode_l);
2112 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, block, arity, inh, mode);
2114 /* Don't forget to link the new Phi nodes into the block.
2115 * Beware that some Phis might be optimized away. */
2117 add_Block_phi(block, phi_l);
2119 add_Block_phi(block, phi_h);
2122 /* not yet finished */
2123 pdeq_putr(env->waitq, phi);
2130 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env)
2132 ir_node *block, *val;
2133 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2137 val = get_Mux_true(mux);
2138 idx = get_irn_idx(val);
2139 if (env->entries[idx]->low_word) {
2140 /* Values already build */
2141 true_l = env->entries[idx]->low_word;
2142 true_h = env->entries[idx]->high_word;
2144 /* still not ready */
2145 pdeq_putr(env->waitq, mux);
2149 val = get_Mux_false(mux);
2150 idx = get_irn_idx(val);
2151 if (env->entries[idx]->low_word) {
2152 /* Values already build */
2153 false_l = env->entries[idx]->low_word;
2154 false_h = env->entries[idx]->high_word;
2156 /* still not ready */
2157 pdeq_putr(env->waitq, mux);
2162 sel = get_Mux_sel(mux);
2164 dbg = get_irn_dbg_info(mux);
2165 block = get_nodes_block(mux);
2167 idx = get_irn_idx(mux);
2168 assert(idx < env->n_entries);
2169 env->entries[idx]->low_word = new_rd_Mux(dbg, block, sel, false_l, true_l, mode);
2170 env->entries[idx]->high_word = new_rd_Mux(dbg, block, sel, false_h, true_h, mode);
2174 * Translate an ASM node.
2176 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env)
2178 ir_mode *his = env->params->high_signed;
2179 ir_mode *hiu = env->params->high_unsigned;
2185 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2186 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2187 if (op_mode == his || op_mode == hiu) {
2188 panic("lowering ASM unimplemented");
2195 n = get_irn_link(n);
2199 proj_mode = get_irn_mode(n);
2200 if (proj_mode == his || proj_mode == hiu) {
2201 panic("lowering ASM unimplemented");
2207 * Translate a Sel node.
2209 static void lower_Sel(ir_node *sel, ir_mode *mode, lower_env_t *env)
2213 /* we must only lower value parameter Sels if we change the
2214 value parameter type. */
2215 if (env->value_param_tp != NULL) {
2216 ir_entity *ent = get_Sel_entity(sel);
2217 if (get_entity_owner(ent) == env->value_param_tp) {
2218 int pos = PTR_TO_INT(get_entity_link(ent));
2220 ent = get_method_value_param_ent(env->l_mtp, pos);
2221 set_Sel_entity(sel, ent);
2227 * check for opcodes that must always be lowered.
2229 static int always_lower(ir_opcode code)
2244 } /* always_lower */
2247 * lower boolean Proj(Cmp)
2249 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env)
2252 ir_node *l, *r, *low, *high, *t, *res;
2257 l = get_Cmp_left(cmp);
2258 lidx = get_irn_idx(l);
2259 if (! env->entries[lidx]->low_word) {
2260 /* still not ready */
2264 r = get_Cmp_right(cmp);
2265 ridx = get_irn_idx(r);
2266 if (! env->entries[ridx]->low_word) {
2267 /* still not ready */
2271 pnc = get_Proj_proj(proj);
2272 blk = get_nodes_block(cmp);
2273 db = get_irn_dbg_info(cmp);
2274 low = new_rd_Cmp(db, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2275 high = new_rd_Cmp(db, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2277 if (pnc == pn_Cmp_Eq) {
2278 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2279 res = new_rd_And(db, blk,
2280 new_r_Proj(low, mode_b, pnc),
2281 new_r_Proj(high, mode_b, pnc),
2283 } else if (pnc == pn_Cmp_Lg) {
2284 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2285 res = new_rd_Or(db, blk,
2286 new_r_Proj(low, mode_b, pnc),
2287 new_r_Proj(high, mode_b, pnc),
2290 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2291 t = new_rd_And(db, blk,
2292 new_r_Proj(low, mode_b, pnc),
2293 new_r_Proj(high, mode_b, pn_Cmp_Eq),
2295 res = new_rd_Or(db, blk,
2296 new_r_Proj(high, mode_b, pnc & ~pn_Cmp_Eq),
2301 } /* lower_boolean_Proj_Cmp */
2304 * The type of a lower function.
2306 * @param node the node to be lowered
2307 * @param mode the low mode for the destination node
2308 * @param env the lower environment
2310 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2315 static void lower_ops(ir_node *node, void *env)
2317 lower_env_t *lenv = env;
2318 node_entry_t *entry;
2319 int idx = get_irn_idx(node);
2320 ir_mode *mode = get_irn_mode(node);
2322 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2325 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2326 ir_node *proj = get_irn_n(node, i);
2328 if (is_Proj(proj)) {
2329 ir_node *cmp = get_Proj_pred(proj);
2332 ir_node *arg = get_Cmp_left(cmp);
2334 mode = get_irn_mode(arg);
2335 if (mode == lenv->params->high_signed ||
2336 mode == lenv->params->high_unsigned) {
2337 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2340 /* could not lower because predecessors not ready */
2341 waitq_put(lenv->waitq, node);
2344 set_irn_n(node, i, res);
2351 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2352 if (entry || always_lower(get_irn_opcode(node))) {
2353 ir_op *op = get_irn_op(node);
2354 lower_func func = (lower_func)op->ops.generic;
2357 mode = get_irn_op_mode(node);
2359 if (mode == lenv->params->high_signed)
2360 mode = lenv->params->low_signed;
2362 mode = lenv->params->low_unsigned;
2364 DB((dbg, LEVEL_1, " %+F\n", node));
2365 func(node, mode, lenv);
2370 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2373 * Compare two op_mode_entry_t's.
2375 static int cmp_op_mode(const void *elt, const void *key, size_t size)
2377 const op_mode_entry_t *e1 = elt;
2378 const op_mode_entry_t *e2 = key;
2381 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2385 * Compare two conv_tp_entry_t's.
2387 static int cmp_conv_tp(const void *elt, const void *key, size_t size)
2389 const conv_tp_entry_t *e1 = elt;
2390 const conv_tp_entry_t *e2 = key;
2393 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2397 * Enter a lowering function into an ir_op.
2399 static void enter_lower_func(ir_op *op, lower_func func)
2401 op->ops.generic = (op_func)func;
2402 } /* enter_lower_func */
2405 * Returns non-zero if a method type must be lowered.
2407 * @param mtp the method type
2409 static int mtp_must_to_lowered(ir_type *mtp, lower_env_t *env)
2413 n_params = get_method_n_params(mtp);
2417 /* first check if we have parameters that must be fixed */
2418 for (i = 0; i < n_params; ++i) {
2419 ir_type *tp = get_method_param_type(mtp, i);
2421 if (is_Primitive_type(tp)) {
2422 ir_mode *mode = get_type_mode(tp);
2424 if (mode == env->params->high_signed ||
2425 mode == env->params->high_unsigned)
2430 } /* mtp_must_to_lowered */
2435 void lower_dw_ops(const lwrdw_param_t *param)
2444 if (! param->enable)
2447 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2449 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2450 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2451 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2453 /* create the necessary maps */
2455 prim_types = pmap_create();
2456 if (! intrinsic_fkt)
2457 intrinsic_fkt = new_set(cmp_op_mode, iro_Last + 1);
2459 conv_types = new_set(cmp_conv_tp, 16);
2461 lowered_type = pmap_create();
2463 /* create a primitive unsigned and signed type */
2465 tp_u = get_primitive_type(param->low_unsigned);
2467 tp_s = get_primitive_type(param->low_signed);
2469 /* create method types for the created binop calls */
2471 binop_tp_u = new_type_method(4, 2);
2472 set_method_param_type(binop_tp_u, 0, tp_u);
2473 set_method_param_type(binop_tp_u, 1, tp_u);
2474 set_method_param_type(binop_tp_u, 2, tp_u);
2475 set_method_param_type(binop_tp_u, 3, tp_u);
2476 set_method_res_type(binop_tp_u, 0, tp_u);
2477 set_method_res_type(binop_tp_u, 1, tp_u);
2480 binop_tp_s = new_type_method(4, 2);
2481 set_method_param_type(binop_tp_s, 0, tp_u);
2482 set_method_param_type(binop_tp_s, 1, tp_s);
2483 set_method_param_type(binop_tp_s, 2, tp_u);
2484 set_method_param_type(binop_tp_s, 3, tp_s);
2485 set_method_res_type(binop_tp_s, 0, tp_u);
2486 set_method_res_type(binop_tp_s, 1, tp_s);
2488 if (! shiftop_tp_u) {
2489 shiftop_tp_u = new_type_method(3, 2);
2490 set_method_param_type(shiftop_tp_u, 0, tp_u);
2491 set_method_param_type(shiftop_tp_u, 1, tp_u);
2492 set_method_param_type(shiftop_tp_u, 2, tp_u);
2493 set_method_res_type(shiftop_tp_u, 0, tp_u);
2494 set_method_res_type(shiftop_tp_u, 1, tp_u);
2496 if (! shiftop_tp_s) {
2497 shiftop_tp_s = new_type_method(3, 2);
2498 set_method_param_type(shiftop_tp_s, 0, tp_u);
2499 set_method_param_type(shiftop_tp_s, 1, tp_s);
2500 set_method_param_type(shiftop_tp_s, 2, tp_u);
2501 set_method_res_type(shiftop_tp_s, 0, tp_u);
2502 set_method_res_type(shiftop_tp_s, 1, tp_s);
2505 unop_tp_u = new_type_method(2, 2);
2506 set_method_param_type(unop_tp_u, 0, tp_u);
2507 set_method_param_type(unop_tp_u, 1, tp_u);
2508 set_method_res_type(unop_tp_u, 0, tp_u);
2509 set_method_res_type(unop_tp_u, 1, tp_u);
2512 unop_tp_s = new_type_method(2, 2);
2513 set_method_param_type(unop_tp_s, 0, tp_u);
2514 set_method_param_type(unop_tp_s, 1, tp_s);
2515 set_method_res_type(unop_tp_s, 0, tp_u);
2516 set_method_res_type(unop_tp_s, 1, tp_s);
2519 lenv.tv_mode_bytes = new_tarval_from_long(get_mode_size_bytes(param->low_unsigned), param->low_unsigned);
2520 lenv.tv_mode_bits = new_tarval_from_long(get_mode_size_bits(param->low_unsigned), param->low_unsigned);
2521 lenv.waitq = new_pdeq();
2522 lenv.params = param;
2523 lenv.first_id = new_id_from_chars(param->little_endian ? ".l" : ".h", 2);
2524 lenv.next_id = new_id_from_chars(param->little_endian ? ".h" : ".l", 2);
2526 /* first clear the generic function pointer for all ops */
2527 clear_irp_opcodes_generic_func();
2529 #define LOWER2(op, fkt) enter_lower_func(op_##op, fkt)
2530 #define LOWER(op) LOWER2(op, lower_##op)
2531 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2532 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2534 /* the table of all operations that must be lowered follows */
2572 /* transform all graphs */
2573 rem = current_ir_graph;
2574 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2575 ir_graph *irg = get_irp_irg(i);
2580 obstack_init(&lenv.obst);
2582 n_idx = get_irg_last_idx(irg);
2583 n_idx = n_idx + (n_idx >> 2); /* add 25% */
2584 lenv.n_entries = n_idx;
2585 lenv.entries = NEW_ARR_F(node_entry_t *, n_idx);
2586 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2590 lenv.proj_2_block = pmap_create();
2591 lenv.value_param_tp = NULL;
2592 ir_reserve_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2594 ent = get_irg_entity(irg);
2595 mtp = get_entity_type(ent);
2597 if (mtp_must_to_lowered(mtp, &lenv)) {
2598 ir_type *ltp = lower_mtp(mtp, &lenv);
2599 lenv.flags |= MUST_BE_LOWERED;
2600 set_entity_type(ent, ltp);
2602 lenv.value_param_tp = get_method_value_param_type(mtp);
2605 /* first step: link all nodes and allocate data */
2606 irg_walk_graph(irg, firm_clear_node_and_phi_links, prepare_links_and_handle_rotl, &lenv);
2608 if (lenv.flags & MUST_BE_LOWERED) {
2609 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2611 /* must do some work */
2612 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2614 /* last step: all waiting nodes */
2615 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2616 current_ir_graph = irg;
2617 while (! pdeq_empty(lenv.waitq)) {
2618 ir_node *node = pdeq_getl(lenv.waitq);
2620 lower_ops(node, &lenv);
2623 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2625 /* outs are invalid, we changed the graph */
2626 set_irg_outs_inconsistent(irg);
2628 if (lenv.flags & CF_CHANGED) {
2629 /* control flow changed, dominance info is invalid */
2630 set_irg_doms_inconsistent(irg);
2631 set_irg_extblk_inconsistent(irg);
2632 set_irg_loopinfo_inconsistent(irg);
2635 ir_free_resources(irg, IR_RESOURCE_PHI_LIST | IR_RESOURCE_IRN_LINK);
2637 pmap_destroy(lenv.proj_2_block);
2638 DEL_ARR_F(lenv.entries);
2639 obstack_free(&lenv.obst, NULL);
2641 del_pdeq(lenv.waitq);
2642 current_ir_graph = rem;
2643 } /* lower_dw_ops */
2646 ir_prog_pass_t pass;
2647 const lwrdw_param_t *param;
2651 * Creates a wrapper around lower_dw_ops().
2653 static int pass_wrapper(ir_prog *irp, void *context)
2655 struct pass_t *pass = context;
2658 lower_dw_ops(pass->param);
2662 ir_prog_pass_t *lower_dw_ops_pass(const char *name, const lwrdw_param_t *param)
2664 struct pass_t *pass = XMALLOCZ(struct pass_t);
2666 pass->param = param;
2667 return def_prog_pass_constructor(
2668 &pass->pass, name ? name : "lower_dw", pass_wrapper);
2669 } /* lower_dw_ops_pass */
2671 /* Default implementation. */
2672 ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2673 const ir_mode *imode, const ir_mode *omode,
2681 if (imode == omode) {
2682 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2684 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2685 get_mode_name(imode), get_mode_name(omode));
2687 id = new_id_from_str(buf);
2689 ent = new_entity(get_glob_type(), id, method);
2690 set_entity_ld_ident(ent, get_entity_ident(ent));
2692 } /* def_create_intrinsic_fkt */