2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Lower Double word operations, ie 64bit -> 32bit, 32bit -> 16bit etc.
24 * @author Michael Beck
36 #include "irgraph_t.h"
41 #include "dbginfo_t.h"
42 #include "iropt_dbg.h"
57 /** A map from (op, imode, omode) to Intrinsic functions entities. */
58 static set *intrinsic_fkt;
60 /** A map from (imode, omode) to conv function types. */
61 static set *conv_types;
63 /** A map from a method type to its lowered type. */
64 static pmap *lowered_type;
66 /** The types for the binop and unop intrinsics. */
67 static ir_type *binop_tp_u, *binop_tp_s, *unop_tp_u, *unop_tp_s, *shiftop_tp_u, *shiftop_tp_s, *tp_s, *tp_u;
69 /** the debug handle */
70 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
73 * An entry in the (op, imode, omode) -> entity map.
75 typedef struct op_mode_entry {
76 const ir_op *op; /**< the op */
77 const ir_mode *imode; /**< the input mode */
78 const ir_mode *omode; /**< the output mode */
79 ir_entity *ent; /**< the associated entity of this (op, imode, omode) triple */
83 * An entry in the (imode, omode) -> tp map.
85 typedef struct conv_tp_entry {
86 const ir_mode *imode; /**< the input mode */
87 const ir_mode *omode; /**< the output mode */
88 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
92 * Every double word node will be replaced,
93 * we need some store to hold the replacement:
95 typedef struct node_entry_t {
96 ir_node *low_word; /**< the low word */
97 ir_node *high_word; /**< the high word */
101 MUST_BE_LOWERED = 1, /**< graph must be lowered */
102 CF_CHANGED = 2, /**< control flow was changed */
106 * The lower environment.
108 typedef struct lower_env_t {
109 node_entry_t **entries; /**< entries per node */
110 struct obstack obst; /**< an obstack holding the temporary data */
111 ir_type *l_mtp; /**< lowered method type of the current method */
112 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
113 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
114 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
115 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
116 ident *first_id; /**< .l for little and .h for big endian */
117 ident *next_id; /**< .h for little and .l for big endian */
118 const lwrdw_param_t *params; /**< transformation parameter */
119 unsigned flags; /**< some flags */
120 int n_entries; /**< number of entries */
121 ir_type *value_param_tp; /**< the old value param type */
125 * Create a method type for a Conv emulation from imode to omode.
127 static ir_type *get_conv_type(ir_mode *imode, ir_mode *omode, lower_env_t *env)
129 conv_tp_entry_t key, *entry;
136 entry = set_insert(conv_types, &key, sizeof(key), HASH_PTR(imode) ^ HASH_PTR(omode));
138 int n_param = 1, n_res = 1;
140 if (imode == env->params->high_signed || imode == env->params->high_unsigned)
142 if (omode == env->params->high_signed || omode == env->params->high_unsigned)
145 /* create a new one */
146 mtd = new_type_method(n_param, n_res);
148 /* set param types and result types */
150 if (imode == env->params->high_signed) {
151 set_method_param_type(mtd, n_param++, tp_u);
152 set_method_param_type(mtd, n_param++, tp_s);
153 } else if (imode == env->params->high_unsigned) {
154 set_method_param_type(mtd, n_param++, tp_u);
155 set_method_param_type(mtd, n_param++, tp_u);
157 ir_type *tp = get_type_for_mode(imode);
158 set_method_param_type(mtd, n_param++, tp);
162 if (omode == env->params->high_signed) {
163 set_method_res_type(mtd, n_res++, tp_u);
164 set_method_res_type(mtd, n_res++, tp_s);
165 } else if (omode == env->params->high_unsigned) {
166 set_method_res_type(mtd, n_res++, tp_u);
167 set_method_res_type(mtd, n_res++, tp_u);
169 ir_type *tp = get_type_for_mode(omode);
170 set_method_res_type(mtd, n_res++, tp);
177 } /* get_conv_type */
180 * Add an additional control flow input to a block.
181 * Patch all Phi nodes. The new Phi inputs are copied from
182 * old input number nr.
184 static void add_block_cf_input_nr(ir_node *block, int nr, ir_node *cf)
186 int i, arity = get_irn_arity(block);
191 NEW_ARR_A(ir_node *, in, arity + 1);
192 for (i = 0; i < arity; ++i)
193 in[i] = get_irn_n(block, i);
196 set_irn_in(block, i + 1, in);
198 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
199 for (i = 0; i < arity; ++i)
200 in[i] = get_irn_n(phi, i);
202 set_irn_in(phi, i + 1, in);
204 } /* add_block_cf_input_nr */
207 * Add an additional control flow input to a block.
208 * Patch all Phi nodes. The new Phi inputs are copied from
209 * old input from cf tmpl.
211 static void add_block_cf_input(ir_node *block, ir_node *tmpl, ir_node *cf)
213 int i, arity = get_irn_arity(block);
216 for (i = 0; i < arity; ++i) {
217 if (get_irn_n(block, i) == tmpl) {
223 add_block_cf_input_nr(block, nr, cf);
224 } /* add_block_cf_input */
227 * Return the "operational" mode of a Firm node.
229 static ir_mode *get_irn_op_mode(ir_node *node)
231 switch (get_irn_opcode(node)) {
233 return get_Load_mode(node);
235 return get_irn_mode(get_Store_value(node));
237 return get_irn_mode(get_DivMod_left(node));
239 return get_irn_mode(get_Div_left(node));
241 return get_irn_mode(get_Mod_left(node));
243 return get_irn_mode(get_Cmp_left(node));
245 return get_irn_mode(node);
247 } /* get_irn_op_mode */
250 * Walker, prepare the node links.
252 static void prepare_links(ir_node *node, void *env)
254 lower_env_t *lenv = env;
255 ir_mode *mode = get_irn_op_mode(node);
259 if (mode == lenv->params->high_signed ||
260 mode == lenv->params->high_unsigned) {
261 /* ok, found a node that will be lowered */
262 link = OALLOCZ(&lenv->obst, node_entry_t);
264 idx = get_irn_idx(node);
265 if (idx >= lenv->n_entries) {
266 /* enlarge: this happens only for Rotl nodes which is RARELY */
267 int old = lenv->n_entries;
268 int n_idx = idx + (idx >> 3);
270 ARR_RESIZE(node_entry_t *, lenv->entries, n_idx);
271 memset(&lenv->entries[old], 0, (n_idx - old) * sizeof(lenv->entries[0]));
272 lenv->n_entries = n_idx;
274 lenv->entries[idx] = link;
275 lenv->flags |= MUST_BE_LOWERED;
276 } else if (is_Conv(node)) {
277 /* Conv nodes have two modes */
278 ir_node *pred = get_Conv_op(node);
279 mode = get_irn_mode(pred);
281 if (mode == lenv->params->high_signed ||
282 mode == lenv->params->high_unsigned) {
283 /* must lower this node either but don't need a link */
284 lenv->flags |= MUST_BE_LOWERED;
290 /* link all Proj nodes to its predecessor:
291 Note that Tuple Proj's and its Projs are linked either. */
292 ir_node *pred = get_Proj_pred(node);
294 set_irn_link(node, get_irn_link(pred));
295 set_irn_link(pred, node);
296 } else if (is_Phi(node)) {
297 /* link all Phi nodes to its block */
298 ir_node *block = get_nodes_block(node);
299 add_Block_phi(block, node);
300 } else if (is_Block(node)) {
301 /* fill the Proj -> Block map */
302 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
303 ir_node *pred = get_Block_cfgpred(node, i);
306 pmap_insert(lenv->proj_2_block, pred, node);
309 } /* prepare_links */
312 * Translate a Constant: create two.
314 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env)
316 tarval *tv, *tv_l, *tv_h;
318 dbg_info *dbg = get_irn_dbg_info(node);
320 ir_graph *irg = current_ir_graph;
321 ir_mode *low_mode = env->params->low_unsigned;
323 tv = get_Const_tarval(node);
325 tv_l = tarval_convert_to(tv, low_mode);
326 low = new_rd_Const(dbg, irg, tv_l);
328 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
329 high = new_rd_Const(dbg, irg, tv_h);
331 idx = get_irn_idx(node);
332 assert(idx < env->n_entries);
333 env->entries[idx]->low_word = low;
334 env->entries[idx]->high_word = high;
338 * Translate a Load: create two.
340 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env)
342 ir_mode *low_mode = env->params->low_unsigned;
343 ir_graph *irg = current_ir_graph;
344 ir_node *adr = get_Load_ptr(node);
345 ir_node *mem = get_Load_mem(node);
346 ir_node *low, *high, *proj;
348 ir_node *block = get_nodes_block(node);
350 ir_cons_flags volatility = get_Load_volatility(node) == volatility_is_volatile
353 if (env->params->little_endian) {
355 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
357 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
361 /* create two loads */
362 dbg = get_irn_dbg_info(node);
363 low = new_rd_Load(dbg, block, mem, low, low_mode, volatility);
364 proj = new_r_Proj(low, mode_M, pn_Load_M);
365 high = new_rd_Load(dbg, block, proj, high, mode, volatility);
367 idx = get_irn_idx(node);
368 assert(idx < env->n_entries);
369 env->entries[idx]->low_word = low;
370 env->entries[idx]->high_word = high;
372 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
373 idx = get_irn_idx(proj);
375 switch (get_Proj_proj(proj)) {
376 case pn_Load_M: /* Memory result. */
377 /* put it to the second one */
378 set_Proj_pred(proj, high);
380 case pn_Load_X_except: /* Execution result if exception occurred. */
381 /* put it to the first one */
382 set_Proj_pred(proj, low);
384 case pn_Load_res: /* Result of load operation. */
385 assert(idx < env->n_entries);
386 env->entries[idx]->low_word = new_r_Proj(low, low_mode, pn_Load_res);
387 env->entries[idx]->high_word = new_r_Proj(high, mode, pn_Load_res);
390 assert(0 && "unexpected Proj number");
392 /* mark this proj: we have handled it already, otherwise we might fall into
394 mark_irn_visited(proj);
399 * Translate a Store: create two.
401 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env)
404 ir_node *block, *adr, *mem;
405 ir_node *low, *high, *irn, *proj;
409 ir_cons_flags volatility = get_Store_volatility(node) == volatility_is_volatile
413 irn = get_Store_value(node);
414 entry = env->entries[get_irn_idx(irn)];
417 if (! entry->low_word) {
418 /* not ready yet, wait */
419 pdeq_putr(env->waitq, node);
423 irg = current_ir_graph;
424 adr = get_Store_ptr(node);
425 mem = get_Store_mem(node);
426 block = get_nodes_block(node);
428 if (env->params->little_endian) {
430 high = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
432 low = new_r_Add(block, adr, new_r_Const(irg, env->tv_mode_bytes), get_irn_mode(adr));
436 /* create two Stores */
437 dbg = get_irn_dbg_info(node);
438 low = new_rd_Store(dbg, block, mem, low, entry->low_word, volatility);
439 proj = new_r_Proj(low, mode_M, pn_Store_M);
440 high = new_rd_Store(dbg, block, proj, high, entry->high_word, volatility);
442 idx = get_irn_idx(node);
443 assert(idx < env->n_entries);
444 env->entries[idx]->low_word = low;
445 env->entries[idx]->high_word = high;
447 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
448 idx = get_irn_idx(proj);
450 switch (get_Proj_proj(proj)) {
451 case pn_Store_M: /* Memory result. */
452 /* put it to the second one */
453 set_Proj_pred(proj, high);
455 case pn_Store_X_except: /* Execution result if exception occurred. */
456 /* put it to the first one */
457 set_Proj_pred(proj, low);
460 assert(0 && "unexpected Proj number");
462 /* mark this proj: we have handled it already, otherwise we might fall into
464 mark_irn_visited(proj);
469 * Return a node containing the address of the intrinsic emulation function.
471 * @param method the method type of the emulation function
472 * @param op the emulated ir_op
473 * @param imode the input mode of the emulated opcode
474 * @param omode the output mode of the emulated opcode
475 * @param env the lower environment
477 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
478 ir_mode *imode, ir_mode *omode,
483 op_mode_entry_t key, *entry;
490 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
491 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
493 /* create a new one */
494 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
496 assert(ent && "Intrinsic creator must return an entity");
502 return new_r_SymConst(current_ir_graph, mode_P_code, sym, symconst_addr_ent);
503 } /* get_intrinsic_address */
508 * Create an intrinsic Call.
510 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env)
512 ir_node *block, *irn, *call, *proj;
520 irn = get_Div_left(node);
521 entry = env->entries[get_irn_idx(irn)];
524 if (! entry->low_word) {
525 /* not ready yet, wait */
526 pdeq_putr(env->waitq, node);
530 in[0] = entry->low_word;
531 in[1] = entry->high_word;
533 irn = get_Div_right(node);
534 entry = env->entries[get_irn_idx(irn)];
537 if (! entry->low_word) {
538 /* not ready yet, wait */
539 pdeq_putr(env->waitq, node);
543 in[2] = entry->low_word;
544 in[3] = entry->high_word;
546 dbg = get_irn_dbg_info(node);
547 block = get_nodes_block(node);
549 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
550 opmode = get_irn_op_mode(node);
551 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
552 call = new_rd_Call(dbg, block, get_Div_mem(node), irn, 4, in, mtp);
553 set_irn_pinned(call, get_irn_pinned(node));
554 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
556 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
557 switch (get_Proj_proj(proj)) {
558 case pn_Div_M: /* Memory result. */
559 /* reroute to the call */
560 set_Proj_pred(proj, call);
561 set_Proj_proj(proj, pn_Call_M);
563 case pn_Div_X_except: /* Execution result if exception occurred. */
564 /* reroute to the call */
565 set_Proj_pred(proj, call);
566 set_Proj_proj(proj, pn_Call_X_except);
568 case pn_Div_res: /* Result of computation. */
569 idx = get_irn_idx(proj);
570 assert(idx < env->n_entries);
571 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
572 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
575 assert(0 && "unexpected Proj number");
577 /* mark this proj: we have handled it already, otherwise we might fall into
579 mark_irn_visited(proj);
586 * Create an intrinsic Call.
588 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env)
590 ir_node *block, *proj, *irn, *call;
598 irn = get_Mod_left(node);
599 entry = env->entries[get_irn_idx(irn)];
602 if (! entry->low_word) {
603 /* not ready yet, wait */
604 pdeq_putr(env->waitq, node);
608 in[0] = entry->low_word;
609 in[1] = entry->high_word;
611 irn = get_Mod_right(node);
612 entry = env->entries[get_irn_idx(irn)];
615 if (! entry->low_word) {
616 /* not ready yet, wait */
617 pdeq_putr(env->waitq, node);
621 in[2] = entry->low_word;
622 in[3] = entry->high_word;
624 dbg = get_irn_dbg_info(node);
625 block = get_nodes_block(node);
627 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
628 opmode = get_irn_op_mode(node);
629 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, env);
630 call = new_rd_Call(dbg, block, get_Mod_mem(node), irn, 4, in, mtp);
631 set_irn_pinned(call, get_irn_pinned(node));
632 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
634 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
635 switch (get_Proj_proj(proj)) {
636 case pn_Mod_M: /* Memory result. */
637 /* reroute to the call */
638 set_Proj_pred(proj, call);
639 set_Proj_proj(proj, pn_Call_M);
641 case pn_Mod_X_except: /* Execution result if exception occurred. */
642 /* reroute to the call */
643 set_Proj_pred(proj, call);
644 set_Proj_proj(proj, pn_Call_X_except);
646 case pn_Mod_res: /* Result of computation. */
647 idx = get_irn_idx(proj);
648 assert(idx < env->n_entries);
649 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
650 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
653 assert(0 && "unexpected Proj number");
655 /* mark this proj: we have handled it already, otherwise we might fall into
657 mark_irn_visited(proj);
662 * Translate a DivMod.
664 * Create two intrinsic Calls.
666 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env)
668 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod;
669 ir_node *resDiv = NULL;
670 ir_node *resMod = NULL;
679 /* check if both results are needed */
680 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
681 switch (get_Proj_proj(proj)) {
682 case pn_DivMod_res_div: flags |= 1; break;
683 case pn_DivMod_res_mod: flags |= 2; break;
688 irn = get_DivMod_left(node);
689 entry = env->entries[get_irn_idx(irn)];
692 if (! entry->low_word) {
693 /* not ready yet, wait */
694 pdeq_putr(env->waitq, node);
698 in[0] = entry->low_word;
699 in[1] = entry->high_word;
701 irn = get_DivMod_right(node);
702 entry = env->entries[get_irn_idx(irn)];
705 if (! entry->low_word) {
706 /* not ready yet, wait */
707 pdeq_putr(env->waitq, node);
711 in[2] = entry->low_word;
712 in[3] = entry->high_word;
714 dbg = get_irn_dbg_info(node);
715 block = get_nodes_block(node);
717 mem = get_DivMod_mem(node);
719 callDiv = callMod = NULL;
720 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
722 opmode = get_irn_op_mode(node);
723 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, env);
724 callDiv = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
725 set_irn_pinned(callDiv, get_irn_pinned(node));
726 resDiv = new_r_Proj(callDiv, mode_T, pn_Call_T_result);
730 mem = new_r_Proj(callDiv, mode_M, pn_Call_M);
731 opmode = get_irn_op_mode(node);
732 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, env);
733 callMod = new_rd_Call(dbg, block, mem, irn, 4, in, mtp);
734 set_irn_pinned(callMod, get_irn_pinned(node));
735 resMod = new_r_Proj(callMod, mode_T, pn_Call_T_result);
738 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
739 switch (get_Proj_proj(proj)) {
740 case pn_DivMod_M: /* Memory result. */
741 /* reroute to the first call */
742 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
743 set_Proj_proj(proj, pn_Call_M);
745 case pn_DivMod_X_except: /* Execution result if exception occurred. */
746 /* reroute to the first call */
747 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
748 set_Proj_proj(proj, pn_Call_X_except);
750 case pn_DivMod_res_div: /* Result of Div. */
751 idx = get_irn_idx(proj);
752 assert(idx < env->n_entries);
753 env->entries[idx]->low_word = new_r_Proj(resDiv, env->params->low_unsigned, 0);
754 env->entries[idx]->high_word = new_r_Proj(resDiv, mode, 1);
756 case pn_DivMod_res_mod: /* Result of Mod. */
757 idx = get_irn_idx(proj);
758 env->entries[idx]->low_word = new_r_Proj(resMod, env->params->low_unsigned, 0);
759 env->entries[idx]->high_word = new_r_Proj(resMod, mode, 1);
762 assert(0 && "unexpected Proj number");
764 /* mark this proj: we have handled it already, otherwise we might fall into
766 mark_irn_visited(proj);
773 * Create an intrinsic Call.
775 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env)
777 ir_node *block, *irn;
785 irn = get_binop_left(node);
786 entry = env->entries[get_irn_idx(irn)];
789 if (! entry->low_word) {
790 /* not ready yet, wait */
791 pdeq_putr(env->waitq, node);
795 in[0] = entry->low_word;
796 in[1] = entry->high_word;
798 irn = get_binop_right(node);
799 entry = env->entries[get_irn_idx(irn)];
802 if (! entry->low_word) {
803 /* not ready yet, wait */
804 pdeq_putr(env->waitq, node);
808 in[2] = entry->low_word;
809 in[3] = entry->high_word;
811 dbg = get_irn_dbg_info(node);
812 block = get_nodes_block(node);
813 irg = current_ir_graph;
815 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
816 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
817 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
819 set_irn_pinned(irn, get_irn_pinned(node));
820 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
822 idx = get_irn_idx(node);
823 assert(idx < env->n_entries);
824 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
825 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
829 * Translate a Shiftop.
831 * Create an intrinsic Call.
833 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env)
835 ir_node *block, *irn;
843 irn = get_binop_left(node);
844 entry = env->entries[get_irn_idx(irn)];
847 if (! entry->low_word) {
848 /* not ready yet, wait */
849 pdeq_putr(env->waitq, node);
853 in[0] = entry->low_word;
854 in[1] = entry->high_word;
856 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
857 in[2] = get_binop_right(node);
858 assert(get_irn_mode(in[2]) != env->params->high_signed
859 && get_irn_mode(in[2]) != env->params->high_unsigned);
861 dbg = get_irn_dbg_info(node);
862 block = get_nodes_block(node);
863 irg = current_ir_graph;
865 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
866 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
867 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
869 set_irn_pinned(irn, get_irn_pinned(node));
870 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
872 idx = get_irn_idx(node);
873 assert(idx < env->n_entries);
874 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
875 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
876 } /* lower_Shiftop */
879 * Translate a Shr and handle special cases.
881 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env)
883 ir_node *right = get_Shr_right(node);
884 ir_graph *irg = current_ir_graph;
886 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
887 tarval *tv = get_Const_tarval(right);
889 if (tarval_is_long(tv) &&
890 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
891 ir_node *block = get_nodes_block(node);
892 ir_node *left = get_Shr_left(node);
893 ir_mode *low_unsigned = env->params->low_unsigned;
895 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
896 int idx = get_irn_idx(left);
898 left = env->entries[idx]->high_word;
900 /* not ready yet, wait */
901 pdeq_putr(env->waitq, node);
905 idx = get_irn_idx(node);
906 /* convert high word into low_unsigned mode if necessary */
907 if (get_irn_mode(left) != low_unsigned)
908 left = new_r_Conv(block, left, low_unsigned);
911 ir_mode *low_unsigned = env->params->low_unsigned;
912 c = new_r_Const_long(irg, low_unsigned, shf_cnt);
913 env->entries[idx]->low_word = new_r_Shr(block, left, c,
916 env->entries[idx]->low_word = left;
918 env->entries[idx]->high_word = new_r_Const(irg, get_mode_null(mode));
923 lower_Shiftop(node, mode, env);
927 * Translate a Shl and handle special cases.
929 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env)
931 ir_node *right = get_Shl_right(node);
932 ir_graph *irg = current_ir_graph;
934 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
935 tarval *tv = get_Const_tarval(right);
937 if (tarval_is_long(tv) &&
938 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
940 ir_node *block = get_nodes_block(node);
941 ir_node *left = get_Shl_left(node);
943 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
944 int idx = get_irn_idx(left);
946 left = env->entries[idx]->low_word;
948 /* not ready yet, wait */
949 pdeq_putr(env->waitq, node);
953 left = new_r_Conv(block, left, mode);
954 idx = get_irn_idx(node);
956 mode_l = env->params->low_unsigned;
958 c = new_r_Const_long(irg, mode_l, shf_cnt);
959 env->entries[idx]->high_word = new_r_Shl(block, left, c, mode);
961 env->entries[idx]->high_word = left;
963 env->entries[idx]->low_word = new_r_Const(irg, get_mode_null(mode_l));
968 lower_Shiftop(node, mode, env);
972 * Translate a Shrs and handle special cases.
974 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env)
976 ir_node *right = get_Shrs_right(node);
977 ir_graph *irg = current_ir_graph;
979 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
980 tarval *tv = get_Const_tarval(right);
982 if (tarval_is_long(tv) &&
983 get_tarval_long(tv) >= (long)get_mode_size_bits(mode)) {
984 ir_node *block = get_nodes_block(node);
985 ir_node *left = get_Shrs_left(node);
986 ir_mode *low_unsigned = env->params->low_unsigned;
987 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
988 int idx = get_irn_idx(left);
989 ir_node *left_unsigned = left;
993 left = env->entries[idx]->high_word;
995 /* not ready yet, wait */
996 pdeq_putr(env->waitq, node);
1000 idx = get_irn_idx(node);
1001 /* convert high word into low_unsigned mode if necessary */
1002 if (get_irn_mode(left_unsigned) != low_unsigned)
1003 left_unsigned = new_r_Conv(block, left, low_unsigned);
1006 c = new_r_Const_long(irg, low_unsigned, shf_cnt);
1007 low = new_r_Shrs(block, left_unsigned, c, low_unsigned);
1009 low = left_unsigned;
1011 /* low word is expected to have low_unsigned */
1012 env->entries[idx]->low_word = new_r_Conv(block, low, low_unsigned);
1014 c = new_r_Const_long(irg, low_unsigned,
1015 get_mode_size_bits(mode) - 1);
1016 env->entries[idx]->high_word = new_r_Shrs(block, left, c, mode);
1021 lower_Shiftop(node, mode, env);
1025 * Rebuild Rotl nodes into Or(Shl, Shr) and prepare all nodes.
1027 static void prepare_links_and_handle_rotl(ir_node *node, void *env)
1029 lower_env_t *lenv = env;
1031 if (is_Rotl(node)) {
1032 ir_mode *mode = get_irn_op_mode(node);
1033 if (mode == lenv->params->high_signed ||
1034 mode == lenv->params->high_unsigned) {
1035 ir_node *right = get_Rotl_right(node);
1036 ir_node *left, *shl, *shr, *or, *block, *sub, *c;
1037 ir_mode *omode, *rmode;
1039 optimization_state_t state;
1041 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1042 tarval *tv = get_Const_tarval(right);
1044 if (tarval_is_long(tv) &&
1045 get_tarval_long(tv) == (long)get_mode_size_bits(mode)) {
1046 /* will be optimized in lower_Rotl() */
1051 /* replace the Rotl(x,y) by an Or(Shl(x,y), Shr(x,64-y)) and lower those */
1052 dbg = get_irn_dbg_info(node);
1053 omode = get_irn_mode(node);
1054 left = get_Rotl_left(node);
1055 block = get_nodes_block(node);
1056 shl = new_rd_Shl(dbg, block, left, right, omode);
1057 rmode = get_irn_mode(right);
1058 c = new_Const_long(rmode, get_mode_size_bits(omode));
1059 sub = new_rd_Sub(dbg, block, c, right, rmode);
1060 shr = new_rd_Shr(dbg, block, left, sub, omode);
1062 /* optimization must be switched off here, or we will get the Rotl back */
1063 save_optimization_state(&state);
1064 set_opt_algebraic_simplification(0);
1065 or = new_rd_Or(dbg, block, shl, shr, omode);
1066 restore_optimization_state(&state);
1070 /* do lowering on the new nodes */
1071 prepare_links(shl, env);
1072 prepare_links(c, env);
1073 prepare_links(sub, env);
1074 prepare_links(shr, env);
1075 prepare_links(or, env);
1078 prepare_links(node, env);
1083 * Translate a special case Rotl(x, sizeof(w)).
1085 static void lower_Rotl(ir_node *node, ir_mode *mode, lower_env_t *env)
1087 ir_node *right = get_Rotl_right(node);
1088 ir_node *left = get_Rotl_left(node);
1090 int idx = get_irn_idx(left);
1094 assert(get_mode_arithmetic(mode) == irma_twos_complement &&
1095 is_Const(right) && tarval_is_long(get_Const_tarval(right)) &&
1096 get_tarval_long(get_Const_tarval(right)) == (long)get_mode_size_bits(mode));
1098 l = env->entries[idx]->low_word;
1099 h = env->entries[idx]->high_word;
1100 idx = get_irn_idx(node);
1102 env->entries[idx]->low_word = h;
1103 env->entries[idx]->high_word = l;
1107 * Translate an Unop.
1109 * Create an intrinsic Call.
1111 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env)
1113 ir_node *block, *irn;
1118 node_entry_t *entry;
1120 irn = get_unop_op(node);
1121 entry = env->entries[get_irn_idx(irn)];
1124 if (! entry->low_word) {
1125 /* not ready yet, wait */
1126 pdeq_putr(env->waitq, node);
1130 in[0] = entry->low_word;
1131 in[1] = entry->high_word;
1133 dbg = get_irn_dbg_info(node);
1134 block = get_nodes_block(node);
1136 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1137 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, env);
1138 irn = new_rd_Call(dbg, block, get_irg_no_mem(current_ir_graph),
1140 set_irn_pinned(irn, get_irn_pinned(node));
1141 irn = new_r_Proj(irn, mode_T, pn_Call_T_result);
1143 idx = get_irn_idx(node);
1144 assert(idx < env->n_entries);
1145 env->entries[idx]->low_word = new_r_Proj(irn, env->params->low_unsigned, 0);
1146 env->entries[idx]->high_word = new_r_Proj(irn, mode, 1);
1150 * Translate a logical Binop.
1152 * Create two logical Binops.
1154 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1155 ir_node *(*constr_rd)(dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1156 ir_node *block, *irn;
1157 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1161 node_entry_t *entry;
1163 irn = get_binop_left(node);
1164 entry = env->entries[get_irn_idx(irn)];
1167 if (! entry->low_word) {
1168 /* not ready yet, wait */
1169 pdeq_putr(env->waitq, node);
1173 lop_l = entry->low_word;
1174 lop_h = entry->high_word;
1176 irn = get_binop_right(node);
1177 entry = env->entries[get_irn_idx(irn)];
1180 if (! entry->low_word) {
1181 /* not ready yet, wait */
1182 pdeq_putr(env->waitq, node);
1186 rop_l = entry->low_word;
1187 rop_h = entry->high_word;
1189 dbg = get_irn_dbg_info(node);
1190 block = get_nodes_block(node);
1192 idx = get_irn_idx(node);
1193 assert(idx < env->n_entries);
1194 irg = current_ir_graph;
1195 env->entries[idx]->low_word = constr_rd(dbg, block, lop_l, rop_l, env->params->low_unsigned);
1196 env->entries[idx]->high_word = constr_rd(dbg, block, lop_h, rop_h, mode);
1197 } /* lower_Binop_logical */
1199 /** create a logical operation transformation */
1200 #define lower_logical(op) \
1201 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1202 lower_Binop_logical(node, mode, env, new_rd_##op); \
1212 * Create two logical Nots.
1214 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env)
1216 ir_node *block, *irn;
1217 ir_node *op_l, *op_h;
1220 node_entry_t *entry;
1222 irn = get_Not_op(node);
1223 entry = env->entries[get_irn_idx(irn)];
1226 if (! entry->low_word) {
1227 /* not ready yet, wait */
1228 pdeq_putr(env->waitq, node);
1232 op_l = entry->low_word;
1233 op_h = entry->high_word;
1235 dbg = get_irn_dbg_info(node);
1236 block = get_nodes_block(node);
1238 idx = get_irn_idx(node);
1239 assert(idx < env->n_entries);
1240 env->entries[idx]->low_word = new_rd_Not(dbg, block, op_l, env->params->low_unsigned);
1241 env->entries[idx]->high_word = new_rd_Not(dbg, block, op_h, mode);
1247 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env)
1249 ir_node *cmp, *left, *right, *block;
1250 ir_node *sel = get_Cond_selector(node);
1251 ir_mode *m = get_irn_mode(sel);
1256 node_entry_t *lentry, *rentry;
1257 ir_node *proj, *projT = NULL, *projF = NULL;
1258 ir_node *new_bl, *cmpH, *cmpL, *irn;
1259 ir_node *projHF, *projHT;
1268 cmp = get_Proj_pred(sel);
1272 left = get_Cmp_left(cmp);
1273 idx = get_irn_idx(left);
1274 lentry = env->entries[idx];
1281 right = get_Cmp_right(cmp);
1282 idx = get_irn_idx(right);
1283 rentry = env->entries[idx];
1286 if (! lentry->low_word || !rentry->low_word) {
1288 pdeq_putr(env->waitq, node);
1292 /* all right, build the code */
1293 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1294 long proj_nr = get_Proj_proj(proj);
1296 if (proj_nr == pn_Cond_true) {
1297 assert(projT == NULL && "more than one Proj(true)");
1300 assert(proj_nr == pn_Cond_false);
1301 assert(projF == NULL && "more than one Proj(false)");
1304 mark_irn_visited(proj);
1306 assert(projT && projF);
1308 /* create a new high compare */
1309 block = get_nodes_block(node);
1310 irg = get_Block_irg(block);
1311 dbg = get_irn_dbg_info(cmp);
1312 pnc = get_Proj_proj(sel);
1314 if (is_Const(right) && is_Const_null(right)) {
1315 if (pnc == pn_Cmp_Eq || pnc == pn_Cmp_Lg) {
1316 /* x ==/!= 0 ==> or(low,high) ==/!= 0 */
1317 ir_mode *mode = env->params->low_unsigned;
1318 ir_node *low = new_r_Conv(block, lentry->low_word, mode);
1319 ir_node *high = new_r_Conv(block, lentry->high_word, mode);
1320 ir_node *or = new_rd_Or(dbg, block, low, high, mode);
1321 ir_node *cmp = new_rd_Cmp(dbg, block, or, new_Const_long(mode, 0));
1323 ir_node *proj = new_r_Proj(cmp, mode_b, pnc);
1324 set_Cond_selector(node, proj);
1329 cmpH = new_rd_Cmp(dbg, block, lentry->high_word, rentry->high_word);
1331 if (pnc == pn_Cmp_Eq) {
1332 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1333 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1336 dst_blk = entry->value;
1338 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1339 dbg = get_irn_dbg_info(node);
1340 irn = new_rd_Cond(dbg, block, irn);
1342 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1343 mark_irn_visited(projHF);
1344 exchange(projF, projHF);
1346 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1347 mark_irn_visited(projHT);
1349 new_bl = new_r_Block(irg, 1, &projHT);
1351 dbg = get_irn_dbg_info(cmp);
1352 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1353 irn = new_r_Proj(cmpL, mode_b, pn_Cmp_Eq);
1354 dbg = get_irn_dbg_info(node);
1355 irn = new_rd_Cond(dbg, new_bl, irn);
1357 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1358 mark_irn_visited(proj);
1359 add_block_cf_input(dst_blk, projHF, proj);
1361 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1362 mark_irn_visited(proj);
1363 exchange(projT, proj);
1364 } else if (pnc == pn_Cmp_Lg) {
1365 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1366 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1369 dst_blk = entry->value;
1371 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Lg);
1372 dbg = get_irn_dbg_info(node);
1373 irn = new_rd_Cond(dbg, block, irn);
1375 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1376 mark_irn_visited(projHT);
1377 exchange(projT, projHT);
1379 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1380 mark_irn_visited(projHF);
1382 new_bl = new_r_Block(irg, 1, &projHF);
1384 dbg = get_irn_dbg_info(cmp);
1385 cmpL = new_rd_Cmp(dbg, new_bl, lentry->low_word, rentry->low_word);
1386 irn = new_r_Proj(cmpL, mode_b, pn_Cmp_Lg);
1387 dbg = get_irn_dbg_info(node);
1388 irn = new_rd_Cond(dbg, new_bl, irn);
1390 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1391 mark_irn_visited(proj);
1392 add_block_cf_input(dst_blk, projHT, proj);
1394 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1395 mark_irn_visited(proj);
1396 exchange(projF, proj);
1398 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1399 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1402 entry = pmap_find(env->proj_2_block, projT);
1404 dstT = entry->value;
1406 entry = pmap_find(env->proj_2_block, projF);
1408 dstF = entry->value;
1410 irn = new_r_Proj(cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1411 dbg = get_irn_dbg_info(node);
1412 irn = new_rd_Cond(dbg, block, irn);
1414 projHT = new_r_Proj(irn, mode_X, pn_Cond_true);
1415 mark_irn_visited(projHT);
1416 exchange(projT, projHT);
1419 projHF = new_r_Proj(irn, mode_X, pn_Cond_false);
1420 mark_irn_visited(projHF);
1422 newbl_eq = new_r_Block(irg, 1, &projHF);
1424 irn = new_r_Proj(cmpH, mode_b, pn_Cmp_Eq);
1425 irn = new_rd_Cond(dbg, newbl_eq, irn);
1427 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1428 mark_irn_visited(proj);
1429 exchange(projF, proj);
1432 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1433 mark_irn_visited(proj);
1435 newbl_l = new_r_Block(irg, 1, &proj);
1437 dbg = get_irn_dbg_info(cmp);
1438 cmpL = new_rd_Cmp(dbg, newbl_l, lentry->low_word, rentry->low_word);
1439 irn = new_r_Proj(cmpL, mode_b, pnc);
1440 dbg = get_irn_dbg_info(node);
1441 irn = new_rd_Cond(dbg, newbl_l, irn);
1443 proj = new_r_Proj(irn, mode_X, pn_Cond_true);
1444 mark_irn_visited(proj);
1445 add_block_cf_input(dstT, projT, proj);
1447 proj = new_r_Proj(irn, mode_X, pn_Cond_false);
1448 mark_irn_visited(proj);
1449 add_block_cf_input(dstF, projF, proj);
1452 /* we have changed the control flow */
1453 env->flags |= CF_CHANGED;
1455 idx = get_irn_idx(sel);
1457 if (env->entries[idx]) {
1459 Bad, a jump-table with double-word index.
1460 This should not happen, but if it does we handle
1461 it like a Conv were between (in other words, ignore
1465 if (! env->entries[idx]->low_word) {
1466 /* not ready yet, wait */
1467 pdeq_putr(env->waitq, node);
1470 set_Cond_selector(node, env->entries[idx]->low_word);
1476 * Translate a Conv to higher_signed
1478 static void lower_Conv_to_Ll(ir_node *node, lower_env_t *env)
1480 ir_mode *omode = get_irn_mode(node);
1481 ir_node *op = get_Conv_op(node);
1482 ir_mode *imode = get_irn_mode(op);
1483 int idx = get_irn_idx(node);
1484 ir_graph *irg = current_ir_graph;
1485 ir_node *block = get_nodes_block(node);
1486 dbg_info *dbg = get_irn_dbg_info(node);
1487 node_entry_t *entry = env->entries[idx];
1488 ir_mode *low_unsigned = env->params->low_unsigned;
1490 = mode_is_signed(omode) ? env->params->low_signed : low_unsigned;
1492 assert(idx < env->n_entries);
1494 if (mode_is_int(imode) || mode_is_reference(imode)) {
1495 if (imode == env->params->high_signed
1496 || imode == env->params->high_unsigned) {
1497 /* a Conv from Lu to Ls or Ls to Lu */
1498 int op_idx = get_irn_idx(op);
1499 node_entry_t *op_entry = env->entries[op_idx];
1501 if (! op_entry->low_word) {
1502 /* not ready yet, wait */
1503 pdeq_putr(env->waitq, node);
1506 entry->low_word = op_entry->low_word;
1507 entry->high_word = new_rd_Conv(dbg, block, op_entry->high_word,
1510 /* simple case: create a high word */
1511 if (imode != low_unsigned)
1512 op = new_rd_Conv(dbg, block, op, low_unsigned);
1514 entry->low_word = op;
1516 if (mode_is_signed(imode)) {
1517 int c = get_mode_size_bits(low_signed) - 1;
1518 ir_node *cnst = new_Const_long(low_unsigned, c);
1519 if (get_irn_mode(op) != low_signed)
1520 op = new_rd_Conv(dbg, block, op, low_signed);
1521 entry->high_word = new_rd_Shrs(dbg, block, op, cnst,
1524 entry->high_word = new_Const(get_mode_null(low_signed));
1527 } else if (imode == mode_b) {
1528 entry->low_word = new_rd_Conv(dbg, block, op, low_unsigned);
1529 entry->high_word = new_Const(get_mode_null(low_signed));
1531 ir_node *irn, *call;
1532 ir_type *mtp = get_conv_type(imode, omode, env);
1534 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1535 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1536 set_irn_pinned(call, get_irn_pinned(node));
1537 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1539 entry->low_word = new_r_Proj(irn, low_unsigned, 0);
1540 entry->high_word = new_r_Proj(irn, low_signed, 1);
1545 * Translate a Conv from higher_unsigned
1547 static void lower_Conv_from_Ll(ir_node *node, lower_env_t *env)
1549 ir_node *op = get_Conv_op(node);
1550 ir_mode *omode = get_irn_mode(node);
1551 ir_node *block = get_nodes_block(node);
1552 dbg_info *dbg = get_irn_dbg_info(node);
1553 int idx = get_irn_idx(op);
1554 ir_graph *irg = current_ir_graph;
1555 node_entry_t *entry = env->entries[idx];
1557 assert(idx < env->n_entries);
1559 if (! entry->low_word) {
1560 /* not ready yet, wait */
1561 pdeq_putr(env->waitq, node);
1565 if (mode_is_int(omode) || mode_is_reference(omode)) {
1566 op = entry->low_word;
1568 /* simple case: create a high word */
1569 if (omode != env->params->low_unsigned)
1570 op = new_rd_Conv(dbg, block, op, omode);
1572 set_Conv_op(node, op);
1573 } else if (omode == mode_b) {
1574 /* llu ? true : false <=> (low|high) ? true : false */
1575 ir_mode *mode = env->params->low_unsigned;
1576 ir_node *or = new_rd_Or(dbg, block, entry->low_word, entry->high_word,
1578 set_Conv_op(node, or);
1580 ir_node *irn, *call, *in[2];
1581 ir_mode *imode = get_irn_mode(op);
1582 ir_type *mtp = get_conv_type(imode, omode, env);
1584 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, env);
1585 in[0] = entry->low_word;
1586 in[1] = entry->high_word;
1588 call = new_rd_Call(dbg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1589 set_irn_pinned(call, get_irn_pinned(node));
1590 irn = new_r_Proj(call, mode_T, pn_Call_T_result);
1592 exchange(node, new_r_Proj(irn, omode, 0));
1599 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env)
1601 mode = get_irn_mode(node);
1603 if (mode == env->params->high_signed
1604 || mode == env->params->high_unsigned) {
1605 lower_Conv_to_Ll(node, env);
1607 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1609 if (mode == env->params->high_signed
1610 || mode == env->params->high_unsigned) {
1611 lower_Conv_from_Ll(node, env);
1617 * Lower the method type.
1619 * @param mtp the method type to lower
1620 * @param ent the lower environment
1622 * @return the lowered type
1624 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env)
1628 ir_type *res, *value_type;
1630 if (is_lowered_type(mtp))
1633 entry = pmap_find(lowered_type, mtp);
1635 int i, n, r, n_param, n_res;
1637 /* count new number of params */
1638 n_param = n = get_method_n_params(mtp);
1639 for (i = n_param - 1; i >= 0; --i) {
1640 ir_type *tp = get_method_param_type(mtp, i);
1642 if (is_Primitive_type(tp)) {
1643 ir_mode *mode = get_type_mode(tp);
1645 if (mode == env->params->high_signed ||
1646 mode == env->params->high_unsigned)
1651 /* count new number of results */
1652 n_res = r = get_method_n_ress(mtp);
1653 for (i = n_res - 1; i >= 0; --i) {
1654 ir_type *tp = get_method_res_type(mtp, i);
1656 if (is_Primitive_type(tp)) {
1657 ir_mode *mode = get_type_mode(tp);
1659 if (mode == env->params->high_signed ||
1660 mode == env->params->high_unsigned)
1665 res = new_type_method(n_param, n_res);
1667 /* set param types and result types */
1668 for (i = n_param = 0; i < n; ++i) {
1669 ir_type *tp = get_method_param_type(mtp, i);
1671 if (is_Primitive_type(tp)) {
1672 ir_mode *mode = get_type_mode(tp);
1674 if (mode == env->params->high_signed) {
1675 set_method_param_type(res, n_param++, tp_u);
1676 set_method_param_type(res, n_param++, tp_s);
1677 } else if (mode == env->params->high_unsigned) {
1678 set_method_param_type(res, n_param++, tp_u);
1679 set_method_param_type(res, n_param++, tp_u);
1681 set_method_param_type(res, n_param++, tp);
1684 set_method_param_type(res, n_param++, tp);
1687 for (i = n_res = 0; i < r; ++i) {
1688 ir_type *tp = get_method_res_type(mtp, i);
1690 if (is_Primitive_type(tp)) {
1691 ir_mode *mode = get_type_mode(tp);
1693 if (mode == env->params->high_signed) {
1694 set_method_res_type(res, n_res++, tp_u);
1695 set_method_res_type(res, n_res++, tp_s);
1696 } else if (mode == env->params->high_unsigned) {
1697 set_method_res_type(res, n_res++, tp_u);
1698 set_method_res_type(res, n_res++, tp_u);
1700 set_method_res_type(res, n_res++, tp);
1703 set_method_res_type(res, n_res++, tp);
1706 set_lowered_type(mtp, res);
1707 pmap_insert(lowered_type, mtp, res);
1709 value_type = get_method_value_param_type(mtp);
1710 if (value_type != NULL) {
1711 /* this creates a new value parameter type */
1712 (void)get_method_value_param_ent(res, 0);
1714 /* set new param positions */
1715 for (i = n_param = 0; i < n; ++i) {
1716 ir_type *tp = get_method_param_type(mtp, i);
1717 ident *id = get_method_param_ident(mtp, i);
1718 ir_entity *ent = get_method_value_param_ent(mtp, i);
1720 set_entity_link(ent, INT_TO_PTR(n_param));
1721 if (is_Primitive_type(tp)) {
1722 ir_mode *mode = get_type_mode(tp);
1724 if (mode == env->params->high_signed || mode == env->params->high_unsigned) {
1726 lid = id_mangle(id, env->first_id);
1727 set_method_param_ident(res, n_param, lid);
1728 set_entity_ident(get_method_value_param_ent(res, n_param), lid);
1729 lid = id_mangle(id, env->next_id);
1730 set_method_param_ident(res, n_param + 1, lid);
1731 set_entity_ident(get_method_value_param_ent(res, n_param + 1), lid);
1738 set_method_param_ident(res, n_param, id);
1739 set_entity_ident(get_method_value_param_ent(res, n_param), id);
1744 set_lowered_type(value_type, get_method_value_param_type(res));
1753 * Translate a Return.
1755 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env)
1757 ir_graph *irg = current_ir_graph;
1758 ir_entity *ent = get_irg_entity(irg);
1759 ir_type *mtp = get_entity_type(ent);
1765 /* check if this return must be lowered */
1766 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1767 ir_node *pred = get_Return_res(node, i);
1768 ir_mode *mode = get_irn_op_mode(pred);
1770 if (mode == env->params->high_signed ||
1771 mode == env->params->high_unsigned) {
1772 idx = get_irn_idx(pred);
1773 if (! env->entries[idx]->low_word) {
1774 /* not ready yet, wait */
1775 pdeq_putr(env->waitq, node);
1784 ent = get_irg_entity(irg);
1785 mtp = get_entity_type(ent);
1787 mtp = lower_mtp(mtp, env);
1788 set_entity_type(ent, mtp);
1790 /* create a new in array */
1791 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1792 in[0] = get_Return_mem(node);
1794 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1795 ir_node *pred = get_Return_res(node, i);
1797 idx = get_irn_idx(pred);
1798 assert(idx < env->n_entries);
1800 if (env->entries[idx]) {
1801 in[++j] = env->entries[idx]->low_word;
1802 in[++j] = env->entries[idx]->high_word;
1808 set_irn_in(node, j+1, in);
1809 } /* lower_Return */
1812 * Translate the parameters.
1814 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env)
1816 ir_graph *irg = get_irn_irg(node);
1817 ir_entity *ent = get_irg_entity(irg);
1818 ir_type *tp = get_entity_type(ent);
1821 int i, j, n_params, rem;
1822 ir_node *proj, *args;
1825 if (is_lowered_type(tp)) {
1826 mtp = get_associated_type(tp);
1830 assert(! is_lowered_type(mtp));
1832 n_params = get_method_n_params(mtp);
1836 NEW_ARR_A(long, new_projs, n_params);
1838 /* first check if we have parameters that must be fixed */
1839 for (i = j = 0; i < n_params; ++i, ++j) {
1840 ir_type *tp = get_method_param_type(mtp, i);
1843 if (is_Primitive_type(tp)) {
1844 ir_mode *mode = get_type_mode(tp);
1846 if (mode == env->params->high_signed ||
1847 mode == env->params->high_unsigned)
1854 mtp = lower_mtp(mtp, env);
1855 set_entity_type(ent, mtp);
1857 /* switch off optimization for new Proj nodes or they might be CSE'ed
1858 with not patched one's */
1859 rem = get_optimize();
1862 /* ok, fix all Proj's and create new ones */
1863 args = get_irg_args(irg);
1864 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1865 ir_node *pred = get_Proj_pred(proj);
1871 /* do not visit this node again */
1872 mark_irn_visited(proj);
1877 proj_nr = get_Proj_proj(proj);
1878 set_Proj_proj(proj, new_projs[proj_nr]);
1880 idx = get_irn_idx(proj);
1881 if (env->entries[idx]) {
1882 ir_mode *low_mode = env->params->low_unsigned;
1884 mode = get_irn_mode(proj);
1886 if (mode == env->params->high_signed) {
1887 mode = env->params->low_signed;
1889 mode = env->params->low_unsigned;
1892 dbg = get_irn_dbg_info(proj);
1893 env->entries[idx]->low_word =
1894 new_rd_Proj(dbg, args, low_mode, new_projs[proj_nr]);
1895 env->entries[idx]->high_word =
1896 new_rd_Proj(dbg, args, mode, new_projs[proj_nr] + 1);
1905 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env)
1907 ir_type *tp = get_Call_type(node);
1909 ir_node **in, *proj, *results;
1910 int n_params, n_res, need_lower = 0;
1912 long *res_numbers = NULL;
1915 if (is_lowered_type(tp)) {
1916 call_tp = get_associated_type(tp);
1921 assert(! is_lowered_type(call_tp));
1923 n_params = get_method_n_params(call_tp);
1924 for (i = 0; i < n_params; ++i) {
1925 ir_type *tp = get_method_param_type(call_tp, i);
1927 if (is_Primitive_type(tp)) {
1928 ir_mode *mode = get_type_mode(tp);
1930 if (mode == env->params->high_signed ||
1931 mode == env->params->high_unsigned) {
1937 n_res = get_method_n_ress(call_tp);
1939 NEW_ARR_A(long, res_numbers, n_res);
1941 for (i = j = 0; i < n_res; ++i, ++j) {
1942 ir_type *tp = get_method_res_type(call_tp, i);
1945 if (is_Primitive_type(tp)) {
1946 ir_mode *mode = get_type_mode(tp);
1948 if (mode == env->params->high_signed ||
1949 mode == env->params->high_unsigned) {
1960 /* let's lower it */
1961 call_tp = lower_mtp(call_tp, env);
1962 set_Call_type(node, call_tp);
1964 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
1966 in[0] = get_Call_mem(node);
1967 in[1] = get_Call_ptr(node);
1969 for (j = 2, i = 0; i < n_params; ++i) {
1970 ir_node *pred = get_Call_param(node, i);
1971 int idx = get_irn_idx(pred);
1973 if (env->entries[idx]) {
1974 if (! env->entries[idx]->low_word) {
1975 /* not ready yet, wait */
1976 pdeq_putr(env->waitq, node);
1979 in[j++] = env->entries[idx]->low_word;
1980 in[j++] = env->entries[idx]->high_word;
1986 set_irn_in(node, j, in);
1988 /* fix the results */
1990 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1991 long proj_nr = get_Proj_proj(proj);
1993 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
1994 /* found the result proj */
2000 if (results) { /* there are results */
2001 int rem = get_optimize();
2003 /* switch off optimization for new Proj nodes or they might be CSE'ed
2004 with not patched one's */
2006 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
2007 if (get_Proj_pred(proj) == results) {
2008 long proj_nr = get_Proj_proj(proj);
2011 /* found a result */
2012 set_Proj_proj(proj, res_numbers[proj_nr]);
2013 idx = get_irn_idx(proj);
2014 if (env->entries[idx]) {
2015 ir_mode *mode = get_irn_mode(proj);
2016 ir_mode *low_mode = env->params->low_unsigned;
2019 if (mode == env->params->high_signed) {
2020 mode = env->params->low_signed;
2022 mode = env->params->low_unsigned;
2025 dbg = get_irn_dbg_info(proj);
2026 env->entries[idx]->low_word =
2027 new_rd_Proj(dbg, results, low_mode, res_numbers[proj_nr]);
2028 env->entries[idx]->high_word =
2029 new_rd_Proj(dbg, results, mode, res_numbers[proj_nr] + 1);
2031 mark_irn_visited(proj);
2039 * Translate an Unknown into two.
2041 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env)
2043 int idx = get_irn_idx(node);
2044 ir_graph *irg = get_irn_irg(node);
2045 ir_mode *low_mode = env->params->low_unsigned;
2047 env->entries[idx]->low_word = new_r_Unknown(irg, low_mode);
2048 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
2049 } /* lower_Unknown */
2054 * First step: just create two templates
2056 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env)
2058 ir_mode *mode_l = env->params->low_unsigned;
2059 ir_graph *irg = get_irn_irg(phi);
2060 ir_node *block, *unk_l, *unk_h, *phi_l, *phi_h;
2061 ir_node **inl, **inh;
2063 int idx, i, arity = get_Phi_n_preds(phi);
2066 idx = get_irn_idx(phi);
2067 if (env->entries[idx]->low_word) {
2068 /* Phi nodes already build, check for inputs */
2069 ir_node *phil = env->entries[idx]->low_word;
2070 ir_node *phih = env->entries[idx]->high_word;
2072 for (i = 0; i < arity; ++i) {
2073 ir_node *pred = get_Phi_pred(phi, i);
2074 int idx = get_irn_idx(pred);
2076 if (env->entries[idx]->low_word) {
2077 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2078 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2080 /* still not ready */
2081 pdeq_putr(env->waitq, phi);
2087 /* first create a new in array */
2088 NEW_ARR_A(ir_node *, inl, arity);
2089 NEW_ARR_A(ir_node *, inh, arity);
2090 unk_l = new_r_Unknown(irg, mode_l);
2091 unk_h = new_r_Unknown(irg, mode);
2093 for (i = 0; i < arity; ++i) {
2094 ir_node *pred = get_Phi_pred(phi, i);
2095 int idx = get_irn_idx(pred);
2097 if (env->entries[idx]->low_word) {
2098 inl[i] = env->entries[idx]->low_word;
2099 inh[i] = env->entries[idx]->high_word;
2107 dbg = get_irn_dbg_info(phi);
2108 block = get_nodes_block(phi);
2110 idx = get_irn_idx(phi);
2111 assert(idx < env->n_entries);
2112 env->entries[idx]->low_word = phi_l = new_rd_Phi(dbg, block, arity, inl, mode_l);
2113 env->entries[idx]->high_word = phi_h = new_rd_Phi(dbg, block, arity, inh, mode);
2115 /* Don't forget to link the new Phi nodes into the block.
2116 * Beware that some Phis might be optimized away. */
2118 add_Block_phi(block, phi_l);
2120 add_Block_phi(block, phi_h);
2123 /* not yet finished */
2124 pdeq_putr(env->waitq, phi);
2131 static void lower_Mux(ir_node *mux, ir_mode *mode, lower_env_t *env)
2133 ir_node *block, *val;
2134 ir_node *true_l, *true_h, *false_l, *false_h, *sel;
2138 val = get_Mux_true(mux);
2139 idx = get_irn_idx(val);
2140 if (env->entries[idx]->low_word) {
2141 /* Values already build */
2142 true_l = env->entries[idx]->low_word;
2143 true_h = env->entries[idx]->high_word;
2145 /* still not ready */
2146 pdeq_putr(env->waitq, mux);
2150 val = get_Mux_false(mux);
2151 idx = get_irn_idx(val);
2152 if (env->entries[idx]->low_word) {
2153 /* Values already build */
2154 false_l = env->entries[idx]->low_word;
2155 false_h = env->entries[idx]->high_word;
2157 /* still not ready */
2158 pdeq_putr(env->waitq, mux);
2163 sel = get_Mux_sel(mux);
2165 dbg = get_irn_dbg_info(mux);
2166 block = get_nodes_block(mux);
2168 idx = get_irn_idx(mux);
2169 assert(idx < env->n_entries);
2170 env->entries[idx]->low_word = new_rd_Mux(dbg, block, sel, false_l, true_l, env->params->low_unsigned);
2171 env->entries[idx]->high_word = new_rd_Mux(dbg, block, sel, false_h, true_h, mode);
2175 * Translate an ASM node.
2177 static void lower_ASM(ir_node *asmn, ir_mode *mode, lower_env_t *env)
2179 ir_mode *his = env->params->high_signed;
2180 ir_mode *hiu = env->params->high_unsigned;
2186 for (i = get_irn_arity(asmn) - 1; i >= 0; --i) {
2187 ir_mode *op_mode = get_irn_mode(get_irn_n(asmn, i));
2188 if (op_mode == his || op_mode == hiu) {
2189 panic("lowering ASM unimplemented");
2196 n = get_irn_link(n);
2200 proj_mode = get_irn_mode(n);
2201 if (proj_mode == his || proj_mode == hiu) {
2202 panic("lowering ASM unimplemented");
2208 * Translate a Sel node.
2210 static void lower_Sel(ir_node *sel, ir_mode *mode, lower_env_t *env)
2214 /* we must only lower value parameter Sels if we change the
2215 value parameter type. */
2216 if (env->value_param_tp != NULL) {
2217 ir_entity *ent = get_Sel_entity(sel);
2218 if (get_entity_owner(ent) == env->value_param_tp) {
2219 int pos = PTR_TO_INT(get_entity_link(ent));
2221 ent = get_method_value_param_ent(env->l_mtp, pos);
2222 set_Sel_entity(sel, ent);
2228 * check for opcodes that must always be lowered.
2230 static int always_lower(ir_opcode code)
2245 } /* always_lower */
2248 * lower boolean Proj(Cmp)
2250 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env)
2253 ir_node *l, *r, *low, *high, *t, *res;
2258 l = get_Cmp_left(cmp);
2259 lidx = get_irn_idx(l);
2260 if (! env->entries[lidx]->low_word) {
2261 /* still not ready */
2265 r = get_Cmp_right(cmp);
2266 ridx = get_irn_idx(r);
2267 if (! env->entries[ridx]->low_word) {
2268 /* still not ready */
2272 pnc = get_Proj_proj(proj);
2273 blk = get_nodes_block(cmp);
2274 db = get_irn_dbg_info(cmp);
2275 low = new_rd_Cmp(db, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2276 high = new_rd_Cmp(db, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2278 if (pnc == pn_Cmp_Eq) {
2279 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2280 res = new_rd_And(db, blk,
2281 new_r_Proj(low, mode_b, pnc),
2282 new_r_Proj(high, mode_b, pnc),
2284 } else if (pnc == pn_Cmp_Lg) {
2285 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2286 res = new_rd_Or(db, blk,
2287 new_r_Proj(low, mode_b, pnc),
2288 new_r_Proj(high, mode_b, pnc),
2291 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2292 t = new_rd_And(db, blk,
2293 new_r_Proj(low, mode_b, pnc),
2294 new_r_Proj(high, mode_b, pn_Cmp_Eq),
2296 res = new_rd_Or(db, blk,
2297 new_r_Proj(high, mode_b, pnc & ~pn_Cmp_Eq),
2302 } /* lower_boolean_Proj_Cmp */
2305 * The type of a lower function.
2307 * @param node the node to be lowered
2308 * @param mode the low mode for the destination node
2309 * @param env the lower environment
2311 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2316 static void lower_ops(ir_node *node, void *env)
2318 lower_env_t *lenv = env;
2319 node_entry_t *entry;
2320 int idx = get_irn_idx(node);
2321 ir_mode *mode = get_irn_mode(node);
2323 if (mode == mode_b || is_Mux(node) || is_Conv(node)) {
2326 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2327 ir_node *proj = get_irn_n(node, i);
2329 if (is_Proj(proj)) {
2330 ir_node *cmp = get_Proj_pred(proj);
2333 ir_node *arg = get_Cmp_left(cmp);
2335 mode = get_irn_mode(arg);
2336 if (mode == lenv->params->high_signed ||
2337 mode == lenv->params->high_unsigned) {
2338 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2341 /* could not lower because predecessors not ready */
2342 waitq_put(lenv->waitq, node);
2345 set_irn_n(node, i, res);
2352 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2353 if (entry || always_lower(get_irn_opcode(node))) {
2354 ir_op *op = get_irn_op(node);
2355 lower_func func = (lower_func)op->ops.generic;
2358 mode = get_irn_op_mode(node);
2360 if (mode == lenv->params->high_signed)
2361 mode = lenv->params->low_signed;
2363 mode = lenv->params->low_unsigned;
2365 DB((dbg, LEVEL_1, " %+F\n", node));
2366 func(node, mode, lenv);
2371 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2374 * Compare two op_mode_entry_t's.
2376 static int cmp_op_mode(const void *elt, const void *key, size_t size)
2378 const op_mode_entry_t *e1 = elt;
2379 const op_mode_entry_t *e2 = key;
2382 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2386 * Compare two conv_tp_entry_t's.
2388 static int cmp_conv_tp(const void *elt, const void *key, size_t size)
2390 const conv_tp_entry_t *e1 = elt;
2391 const conv_tp_entry_t *e2 = key;
2394 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2398 * Enter a lowering function into an ir_op.
2400 static void enter_lower_func(ir_op *op, lower_func func)
2402 op->ops.generic = (op_func)func;
2403 } /* enter_lower_func */
2406 * Returns non-zero if a method type must be lowered.
2408 * @param mtp the method type
2410 static int mtp_must_to_lowered(ir_type *mtp, lower_env_t *env)
2414 n_params = get_method_n_params(mtp);
2418 /* first check if we have parameters that must be fixed */
2419 for (i = 0; i < n_params; ++i) {
2420 ir_type *tp = get_method_param_type(mtp, i);
2422 if (is_Primitive_type(tp)) {
2423 ir_mode *mode = get_type_mode(tp);
2425 if (mode == env->params->high_signed ||
2426 mode == env->params->high_unsigned)
2431 } /* mtp_must_to_lowered */
2436 void lower_dw_ops(const lwrdw_param_t *param)
2445 if (! param->enable)
2448 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2450 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2451 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2452 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2454 /* create the necessary maps */
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_type_for_mode(param->low_unsigned);
2466 tp_s = get_type_for_mode(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 */