3 * File name: ir/lower/lower_dw.c
4 * Purpose: Lower Double word operations, ie Mode L -> I.
8 * Copyright: (c) 1998-2006 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
31 #include "irgraph_t.h"
36 #include "dbginfo_t.h"
37 #include "iropt_dbg.h"
51 /** A map from mode to a primitive type. */
52 static pmap *prim_types;
54 /** A map from (op, imode, omode) to Intrinsic functions entities. */
55 static set *intrinsic_fkt;
57 /** A map from (imode, omode) to conv function types. */
58 static set *conv_types;
60 /** A map from a method type to its lowered type. */
61 static pmap *lowered_type;
63 /** The types for the binop and unop intrinsics. */
64 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;
66 /** the debug handle */
67 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
70 * An entry in the (op, imode, omode) -> entity map.
72 typedef struct _op_mode_entry {
73 const ir_op *op; /**< the op */
74 const ir_mode *imode; /**< the input mode */
75 const ir_mode *omode; /**< the output mode */
76 entity *ent; /**< the associated entity of this (op, imode, omode) triple */
80 * An entry in the (imode, omode) -> tp map.
82 typedef struct _conv_tp_entry {
83 const ir_mode *imode; /**< the input mode */
84 const ir_mode *omode; /**< the output mode */
85 ir_type *mtd; /**< the associated method type of this (imode, omode) pair */
89 * Every double word node will be replaced,
90 * we need some store to hold the replacement:
92 typedef struct _node_entry_t {
93 ir_node *low_word; /**< the low word */
94 ir_node *high_word; /**< the high word */
98 MUST_BE_LOWERED = 1, /**< graph must be lowered */
99 CF_CHANGED = 2, /**< control flow was changed */
103 * The lower environment.
105 typedef struct _lower_env_t {
106 node_entry_t **entries; /**< entries per node */
107 struct obstack obst; /**< an obstack holding the temporary data */
108 tarval *tv_mode_bytes; /**< a tarval containing the number of bytes in the lowered modes */
109 tarval *tv_mode_bits; /**< a tarval containing the number of bits in the lowered modes */
110 pdeq *waitq; /**< a wait queue of all nodes that must be handled later */
111 pmap *proj_2_block; /**< a map from ProjX to its destination blocks */
112 const lwrdw_param_t *params; /**< transformation parameter */
113 unsigned flags; /**< some flags */
114 int n_entries; /**< number of entries */
118 * Get a primitive mode for a mode.
120 static ir_type *get_primitive_type(ir_mode *mode) {
121 pmap_entry *entry = pmap_find(prim_types, mode);
128 snprintf(buf, sizeof(buf), "_prim_%s", get_mode_name(mode));
129 tp = new_type_primitive(new_id_from_str(buf), mode);
131 pmap_insert(prim_types, mode, tp);
133 } /* get_primitive_type */
136 * Create a method type for a Conv emulation from imode to omode.
138 static ir_type *get_conv_type(ir_mode *imode, ir_mode *omode, lower_env_t *env) {
139 conv_tp_entry_t key, *entry;
146 entry = set_insert(conv_types, &key, sizeof(key), HASH_PTR(imode) ^ HASH_PTR(omode));
148 int n_param = 1, n_res = 1;
151 if (imode == env->params->high_signed || imode == env->params->high_unsigned)
153 if (omode == env->params->high_signed || omode == env->params->high_unsigned)
156 /* create a new one */
157 snprintf(buf, sizeof(buf), "LConv%s%s", get_mode_name(imode), get_mode_name(omode));
158 mtd = new_type_method(new_id_from_str(buf), n_param, n_res);
160 /* set param types and result types */
162 if (imode == env->params->high_signed) {
163 set_method_param_type(mtd, n_param++, tp_s);
164 set_method_param_type(mtd, n_param++, tp_s);
165 } else if (imode == env->params->high_unsigned) {
166 set_method_param_type(mtd, n_param++, tp_u);
167 set_method_param_type(mtd, n_param++, tp_u);
169 ir_type *tp = get_primitive_type(imode);
170 set_method_param_type(mtd, n_param++, tp);
174 if (omode == env->params->high_signed) {
175 set_method_res_type(mtd, n_res++, tp_s);
176 set_method_res_type(mtd, n_res++, tp_s);
177 } else if (omode == env->params->high_unsigned) {
178 set_method_res_type(mtd, n_res++, tp_u);
179 set_method_res_type(mtd, n_res++, tp_u);
181 ir_type *tp = get_primitive_type(omode);
182 set_method_res_type(mtd, n_res++, tp);
189 } /* get_conv_type */
192 * Add an additional control flow input to a block.
193 * Patch all Phi nodes. The new Phi inputs are copied from
194 * old input number nr.
196 static void add_block_cf_input_nr(ir_node *block, int nr, ir_node *cf)
198 int i, arity = get_irn_arity(block);
203 NEW_ARR_A(ir_node *, in, arity + 1);
204 for (i = 0; i < arity; ++i)
205 in[i] = get_irn_n(block, i);
208 set_irn_in(block, i + 1, in);
210 for (phi = get_irn_link(block); phi; phi = get_irn_link(phi)) {
211 for (i = 0; i < arity; ++i)
212 in[i] = get_irn_n(phi, i);
214 set_irn_in(phi, i + 1, in);
216 } /* add_block_cf_input_nr */
219 * Add an additional control flow input to a block.
220 * Patch all Phi nodes. The new Phi inputs are copied from
221 * old input from cf tmpl.
223 static void add_block_cf_input(ir_node *block, ir_node *tmpl, ir_node *cf)
225 int i, arity = get_irn_arity(block);
228 for (i = 0; i < arity; ++i) {
229 if (get_irn_n(block, i) == tmpl) {
235 add_block_cf_input_nr(block, nr, cf);
236 } /* add_block_cf_input */
239 * Return the "operational" mode of a Firm node.
241 static ir_mode *get_irn_op_mode(ir_node *node)
243 switch (get_irn_opcode(node)) {
245 return get_Load_mode(node);
247 return get_irn_mode(get_Store_value(node));
249 return get_irn_mode(get_DivMod_left(node));
251 return get_irn_mode(get_Div_left(node));
253 return get_irn_mode(get_Mod_left(node));
255 return get_irn_mode(get_Cmp_left(node));
257 return get_irn_mode(node);
259 } /* get_irn_op_mode */
262 * Walker, prepare the node links.
264 static void prepare_links(ir_node *node, void *env)
266 lower_env_t *lenv = env;
267 ir_mode *mode = get_irn_op_mode(node);
271 if (mode == lenv->params->high_signed ||
272 mode == lenv->params->high_unsigned) {
273 /* ok, found a node that will be lowered */
274 link = obstack_alloc(&lenv->obst, sizeof(*link));
276 memset(link, 0, sizeof(*link));
278 lenv->entries[get_irn_idx(node)] = link;
279 lenv->flags |= MUST_BE_LOWERED;
280 } else if (get_irn_op(node) == op_Conv) {
281 /* Conv nodes have two modes */
282 ir_node *pred = get_Conv_op(node);
283 mode = get_irn_mode(pred);
285 if (mode == lenv->params->high_signed ||
286 mode == lenv->params->high_unsigned) {
287 /* must lower this node either but don't need a link */
288 lenv->flags |= MUST_BE_LOWERED;
294 /* link all Proj nodes to its predecessor:
295 Note that Tuple Proj's and its Projs are linked either. */
296 ir_node *pred = get_Proj_pred(node);
298 set_irn_link(node, get_irn_link(pred));
299 set_irn_link(pred, node);
300 } else if (is_Phi(node)) {
301 /* link all Phi nodes to its block */
302 ir_node *block = get_nodes_block(node);
304 set_irn_link(node, get_irn_link(block));
305 set_irn_link(block, node);
306 } else if (is_Block(node)) {
307 /* fill the Proj -> Block map */
308 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
309 ir_node *pred = get_Block_cfgpred(node, i);
312 pmap_insert(lenv->proj_2_block, pred, node);
315 } /* prepare_links */
318 * Translate a Constant: create two.
320 static void lower_Const(ir_node *node, ir_mode *mode, lower_env_t *env) {
321 tarval *tv, *tv_l, *tv_h;
323 dbg_info *dbg = get_irn_dbg_info(node);
324 ir_node *block = get_nodes_block(node);
326 ir_graph *irg = current_ir_graph;
328 tv = get_Const_tarval(node);
330 tv_l = tarval_convert_to(tv, mode);
331 low = new_rd_Const(dbg, irg, block, mode, tv_l);
333 tv_h = tarval_convert_to(tarval_shrs(tv, env->tv_mode_bits), mode);
334 high = new_rd_Const(dbg, irg, block, mode, tv_h);
336 idx = get_irn_idx(node);
337 assert(idx < env->n_entries);
338 env->entries[idx]->low_word = low;
339 env->entries[idx]->high_word = high;
343 * Translate a Load: create two.
345 static void lower_Load(ir_node *node, ir_mode *mode, lower_env_t *env) {
346 ir_graph *irg = current_ir_graph;
347 ir_node *adr = get_Load_ptr(node);
348 ir_node *mem = get_Load_mem(node);
349 ir_node *low, *high, *proj;
351 ir_node *block = get_nodes_block(node);
354 if (env->params->little_endian) {
356 high = new_r_Add(irg, block, adr,
357 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
360 low = new_r_Add(irg, block, adr,
361 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
366 /* create two loads */
367 dbg = get_irn_dbg_info(node);
368 low = new_rd_Load(dbg, irg, block, mem, low, mode);
369 proj = new_r_Proj(irg, block, low, mode_M, pn_Load_M);
370 high = new_rd_Load(dbg, irg, block, proj, high, mode);
372 set_Load_volatility(low, get_Load_volatility(node));
373 set_Load_volatility(high, get_Load_volatility(node));
375 idx = get_irn_idx(node);
376 assert(idx < env->n_entries);
377 env->entries[idx]->low_word = low;
378 env->entries[idx]->high_word = high;
380 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
381 idx = get_irn_idx(proj);
383 switch (get_Proj_proj(proj)) {
384 case pn_Load_M: /* Memory result. */
385 /* put it to the second one */
386 set_Proj_pred(proj, high);
388 case pn_Load_X_except: /* Execution result if exception occurred. */
389 /* put it to the first one */
390 set_Proj_pred(proj, low);
392 case pn_Load_res: /* Result of load operation. */
393 assert(idx < env->n_entries);
394 env->entries[idx]->low_word = new_r_Proj(irg, block, low, mode, pn_Load_res);
395 env->entries[idx]->high_word = new_r_Proj(irg, block, high, mode, pn_Load_res);
398 assert(0 && "unexpected Proj number");
400 /* mark this proj: we have handled it already, otherwise we might fall into
402 mark_irn_visited(proj);
407 * Translate a Store: create two.
409 static void lower_Store(ir_node *node, ir_mode *mode, lower_env_t *env) {
411 ir_node *block, *adr, *mem;
412 ir_node *low, *high, *irn, *proj;
417 irn = get_Store_value(node);
418 entry = env->entries[get_irn_idx(irn)];
421 if (! entry->low_word) {
422 /* not ready yet, wait */
423 pdeq_putr(env->waitq, node);
427 irg = current_ir_graph;
428 adr = get_Store_ptr(node);
429 mem = get_Store_mem(node);
430 block = get_nodes_block(node);
432 if (env->params->little_endian) {
434 high = new_r_Add(irg, block, adr,
435 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
438 low = new_r_Add(irg, block, adr,
439 new_r_Const(irg, block, get_tarval_mode(env->tv_mode_bytes), env->tv_mode_bytes),
444 /* create two Stores */
445 dbg = get_irn_dbg_info(node);
446 low = new_rd_Store(dbg, irg, block, mem, low, entry->low_word);
447 proj = new_r_Proj(irg, block, low, mode_M, pn_Store_M);
448 high = new_rd_Store(dbg, irg, block, proj, high, entry->high_word);
450 set_Store_volatility(low, get_Store_volatility(node));
451 set_Store_volatility(high, get_Store_volatility(node));
453 idx = get_irn_idx(node);
454 assert(idx < env->n_entries);
455 env->entries[idx]->low_word = low;
456 env->entries[idx]->high_word = high;
458 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
459 idx = get_irn_idx(proj);
461 switch (get_Proj_proj(proj)) {
462 case pn_Store_M: /* Memory result. */
463 /* put it to the second one */
464 set_Proj_pred(proj, high);
466 case pn_Store_X_except: /* Execution result if exception occurred. */
467 /* put it to the first one */
468 set_Proj_pred(proj, low);
471 assert(0 && "unexpected Proj number");
473 /* mark this proj: we have handled it already, otherwise we might fall into
475 mark_irn_visited(proj);
480 * Return a node containing the address of the intrinsic emulation function.
482 * @param method the method type of the emulation function
483 * @param op the emulated ir_op
484 * @param imode the input mode of the emulated opcode
485 * @param omode the output mode of the emulated opcode
486 * @param block where the new mode is created
487 * @param env the lower environment
489 static ir_node *get_intrinsic_address(ir_type *method, ir_op *op,
490 ir_mode *imode, ir_mode *omode,
491 ir_node *block, lower_env_t *env) {
494 op_mode_entry_t key, *entry;
501 entry = set_insert(intrinsic_fkt, &key, sizeof(key),
502 HASH_PTR(op) ^ HASH_PTR(imode) ^ (HASH_PTR(omode) << 8));
504 /* create a new one */
505 ent = env->params->create_intrinsic(method, op, imode, omode, env->params->ctx);
507 assert(ent && "Intrinsic creator must return an entity");
513 return new_r_SymConst(current_ir_graph, block, sym, symconst_addr_ent);
514 } /* get_intrinsic_address */
519 * Create an intrinsic Call.
521 static void lower_Div(ir_node *node, ir_mode *mode, lower_env_t *env) {
522 ir_node *block, *irn, *call, *proj;
531 irn = get_Div_left(node);
532 entry = env->entries[get_irn_idx(irn)];
535 if (! entry->low_word) {
536 /* not ready yet, wait */
537 pdeq_putr(env->waitq, node);
541 in[0] = entry->low_word;
542 in[1] = entry->high_word;
544 irn = get_Div_right(node);
545 entry = env->entries[get_irn_idx(irn)];
548 if (! entry->low_word) {
549 /* not ready yet, wait */
550 pdeq_putr(env->waitq, node);
554 in[2] = entry->low_word;
555 in[3] = entry->high_word;
557 dbg = get_irn_dbg_info(node);
558 block = get_nodes_block(node);
559 irg = current_ir_graph;
561 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
562 opmode = get_irn_op_mode(node);
563 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, block, env);
564 call = new_rd_Call(dbg, irg, block, get_Div_mem(node),
566 set_irn_pinned(call, get_irn_pinned(node));
567 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
569 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
570 switch (get_Proj_proj(proj)) {
571 case pn_Div_M: /* Memory result. */
572 /* reroute to the call */
573 set_Proj_pred(proj, call);
574 set_Proj_proj(proj, pn_Call_M_except);
576 case pn_Div_X_except: /* Execution result if exception occurred. */
577 /* reroute to the call */
578 set_Proj_pred(proj, call);
579 set_Proj_proj(proj, pn_Call_X_except);
581 case pn_Div_res: /* Result of computation. */
582 idx = get_irn_idx(proj);
583 assert(idx < env->n_entries);
584 env->entries[idx]->low_word = new_r_Proj(current_ir_graph, block, irn, mode, 0);
585 env->entries[idx]->high_word = new_r_Proj(current_ir_graph, block, irn, mode, 1);
588 assert(0 && "unexpected Proj number");
590 /* mark this proj: we have handled it already, otherwise we might fall into
592 mark_irn_visited(proj);
599 * Create an intrinsic Call.
601 static void lower_Mod(ir_node *node, ir_mode *mode, lower_env_t *env) {
602 ir_node *block, *proj, *irn, *call;
611 irn = get_Mod_left(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[0] = entry->low_word;
622 in[1] = entry->high_word;
624 irn = get_Mod_right(node);
625 entry = env->entries[get_irn_idx(irn)];
628 if (! entry->low_word) {
629 /* not ready yet, wait */
630 pdeq_putr(env->waitq, node);
634 in[2] = entry->low_word;
635 in[3] = entry->high_word;
637 dbg = get_irn_dbg_info(node);
638 block = get_nodes_block(node);
639 irg = current_ir_graph;
641 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
642 opmode = get_irn_op_mode(node);
643 irn = get_intrinsic_address(mtp, get_irn_op(node), opmode, opmode, block, env);
644 call = new_rd_Call(dbg, irg, block, get_Mod_mem(node),
646 set_irn_pinned(call, get_irn_pinned(node));
647 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
649 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
650 switch (get_Proj_proj(proj)) {
651 case pn_Mod_M: /* Memory result. */
652 /* reroute to the call */
653 set_Proj_pred(proj, call);
654 set_Proj_proj(proj, pn_Call_M_except);
656 case pn_Mod_X_except: /* Execution result if exception occurred. */
657 /* reroute to the call */
658 set_Proj_pred(proj, call);
659 set_Proj_proj(proj, pn_Call_X_except);
661 case pn_Mod_res: /* Result of computation. */
662 idx = get_irn_idx(proj);
663 assert(idx < env->n_entries);
664 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, mode, 0);
665 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
668 assert(0 && "unexpected Proj number");
670 /* mark this proj: we have handled it already, otherwise we might fall into
672 mark_irn_visited(proj);
677 * Translate a DivMod.
679 * Create two intrinsic Calls.
681 static void lower_DivMod(ir_node *node, ir_mode *mode, lower_env_t *env) {
682 ir_node *block, *proj, *irn, *mem, *callDiv, *callMod, *resDiv, *resMod;
692 /* check if both results are needed */
693 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
694 switch (get_Proj_proj(proj)) {
695 case pn_DivMod_res_div: flags |= 1; break;
696 case pn_DivMod_res_mod: flags |= 2; break;
701 irn = get_DivMod_left(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[0] = entry->low_word;
712 in[1] = entry->high_word;
714 irn = get_DivMod_right(node);
715 entry = env->entries[get_irn_idx(irn)];
718 if (! entry->low_word) {
719 /* not ready yet, wait */
720 pdeq_putr(env->waitq, node);
724 in[2] = entry->low_word;
725 in[3] = entry->high_word;
727 dbg = get_irn_dbg_info(node);
728 block = get_nodes_block(node);
729 irg = current_ir_graph;
731 mem = get_DivMod_mem(node);
733 callDiv = callMod = NULL;
734 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
736 opmode = get_irn_op_mode(node);
737 irn = get_intrinsic_address(mtp, op_Div, opmode, opmode, block, env);
738 callDiv = new_rd_Call(dbg, irg, block, mem,
740 set_irn_pinned(callDiv, get_irn_pinned(node));
741 resDiv = new_r_Proj(irg, block, callDiv, mode_T, pn_Call_T_result);
745 mem = new_r_Proj(irg, block, callDiv, mode_M, pn_Call_M);
746 opmode = get_irn_op_mode(node);
747 irn = get_intrinsic_address(mtp, op_Mod, opmode, opmode, block, env);
748 callMod = new_rd_Call(dbg, irg, block, mem,
750 set_irn_pinned(callMod, get_irn_pinned(node));
751 resMod = new_r_Proj(irg, block, callMod, mode_T, pn_Call_T_result);
754 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
755 switch (get_Proj_proj(proj)) {
756 case pn_DivMod_M: /* Memory result. */
757 /* reroute to the first call */
758 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
759 set_Proj_proj(proj, pn_Call_M_except);
761 case pn_DivMod_X_except: /* Execution result if exception occurred. */
762 /* reroute to the first call */
763 set_Proj_pred(proj, callDiv ? callDiv : (callMod ? callMod : mem));
764 set_Proj_proj(proj, pn_Call_X_except);
766 case pn_DivMod_res_div: /* Result of Div. */
767 idx = get_irn_idx(proj);
768 assert(idx < env->n_entries);
769 env->entries[idx]->low_word = new_r_Proj(irg, block, resDiv, mode, 0);
770 env->entries[idx]->high_word = new_r_Proj(irg, block, resDiv, mode, 1);
772 case pn_DivMod_res_mod: /* Result of Mod. */
773 idx = get_irn_idx(proj);
774 env->entries[idx]->low_word = new_r_Proj(irg, block, resMod, mode, 0);
775 env->entries[idx]->high_word = new_r_Proj(irg, block, resMod, mode, 1);
778 assert(0 && "unexpected Proj number");
780 /* mark this proj: we have handled it already, otherwise we might fall into
782 mark_irn_visited(proj);
789 * Create an intrinsic Call.
791 static void lower_Binop(ir_node *node, ir_mode *mode, lower_env_t *env) {
792 ir_node *block, *irn;
800 irn = get_binop_left(node);
801 entry = env->entries[get_irn_idx(irn)];
804 if (! entry->low_word) {
805 /* not ready yet, wait */
806 pdeq_putr(env->waitq, node);
810 in[0] = entry->low_word;
811 in[1] = entry->high_word;
813 irn = get_binop_right(node);
814 entry = env->entries[get_irn_idx(irn)];
817 if (! entry->low_word) {
818 /* not ready yet, wait */
819 pdeq_putr(env->waitq, node);
823 in[2] = entry->low_word;
824 in[3] = entry->high_word;
826 dbg = get_irn_dbg_info(node);
827 block = get_nodes_block(node);
828 irg = current_ir_graph;
830 mtp = mode_is_signed(mode) ? binop_tp_s : binop_tp_u;
831 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
832 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
834 set_irn_pinned(irn, get_irn_pinned(node));
835 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
837 idx = get_irn_idx(node);
838 assert(idx < env->n_entries);
839 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, mode, 0);
840 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
844 * Translate a Shiftop.
846 * Create an intrinsic Call.
848 static void lower_Shiftop(ir_node *node, ir_mode *mode, lower_env_t *env) {
849 ir_node *block, *irn;
857 irn = get_binop_left(node);
858 entry = env->entries[get_irn_idx(irn)];
861 if (! entry->low_word) {
862 /* not ready yet, wait */
863 pdeq_putr(env->waitq, node);
867 in[0] = entry->low_word;
868 in[1] = entry->high_word;
870 /* The shift count is always mode_Iu in firm, so there is no need for lowering */
871 in[2] = get_binop_right(node);
873 dbg = get_irn_dbg_info(node);
874 block = get_nodes_block(node);
875 irg = current_ir_graph;
877 mtp = mode_is_signed(mode) ? shiftop_tp_s : shiftop_tp_u;
878 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
879 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
881 set_irn_pinned(irn, get_irn_pinned(node));
882 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
884 idx = get_irn_idx(node);
885 assert(idx < env->n_entries);
886 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, mode, 0);
887 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
888 } /* lower_Shiftop */
891 * Translate a Shr and handle special cases.
893 static void lower_Shr(ir_node *node, ir_mode *mode, lower_env_t *env) {
894 ir_node *right = get_Shr_right(node);
895 ir_graph *irg = current_ir_graph;
897 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
898 tarval *tv = get_Const_tarval(right);
900 if (tarval_is_long(tv) &&
901 get_tarval_long(tv) >= get_mode_size_bits(mode)) {
902 ir_node *block = get_nodes_block(node);
903 ir_node *left = get_Shr_left(node);
905 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
906 int idx = get_irn_idx(left);
908 left = env->entries[idx]->high_word;
909 idx = get_irn_idx(node);
912 c = new_r_Const_long(irg, block, mode_Iu, shf_cnt);
913 env->entries[idx]->low_word = new_r_Shr(irg, block, left, c, mode);
915 env->entries[idx]->low_word = left;
917 env->entries[idx]->high_word = new_r_Const(irg, block, mode, get_mode_null(mode));
922 lower_Shiftop(node, mode, env);
926 * Translate a Shl and handle special cases.
928 static void lower_Shl(ir_node *node, ir_mode *mode, lower_env_t *env) {
929 ir_node *right = get_Shl_right(node);
930 ir_graph *irg = current_ir_graph;
932 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
933 tarval *tv = get_Const_tarval(right);
935 if (tarval_is_long(tv) &&
936 get_tarval_long(tv) >= get_mode_size_bits(mode)) {
937 ir_node *block = get_nodes_block(node);
938 ir_node *left = get_Shl_left(node);
940 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
941 int idx = get_irn_idx(left);
943 left = env->entries[idx]->low_word;
944 idx = get_irn_idx(node);
947 c = new_r_Const_long(irg, block, mode_Iu, shf_cnt);
948 env->entries[idx]->high_word = new_r_Shl(irg, block, left, c, mode);
950 env->entries[idx]->high_word = left;
952 env->entries[idx]->low_word = new_r_Const(irg, block, mode, get_mode_null(mode));
957 lower_Shiftop(node, mode, env);
961 * Translate a Shrs and handle special cases.
963 static void lower_Shrs(ir_node *node, ir_mode *mode, lower_env_t *env) {
964 ir_node *right = get_Shrs_right(node);
965 ir_graph *irg = current_ir_graph;
967 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
968 tarval *tv = get_Const_tarval(right);
970 if (tarval_is_long(tv) &&
971 get_tarval_long(tv) >= get_mode_size_bits(mode)) {
972 ir_node *block = get_nodes_block(node);
973 ir_node *left = get_Shrs_left(node);
974 long shf_cnt = get_tarval_long(tv) - get_mode_size_bits(mode);
976 int idx = get_irn_idx(left);
978 left = env->entries[idx]->high_word;
979 idx = get_irn_idx(node);
982 c = new_r_Const_long(irg, block, mode_Iu, shf_cnt);
983 env->entries[idx]->low_word = new_r_Shrs(irg, block, left, c, mode);
985 env->entries[idx]->low_word = left;
987 c = new_r_Const_long(irg, block, mode_Iu, get_mode_size_bits(mode) - 1);
988 env->entries[idx]->high_word = new_r_Shrs(irg, block, left, c, mode);
993 lower_Shiftop(node, mode, env);
997 * Translate a Rot and handle special cases.
999 static void lower_Rot(ir_node *node, ir_mode *mode, lower_env_t *env) {
1000 ir_node *right = get_Rot_right(node);
1002 if (get_mode_arithmetic(mode) == irma_twos_complement && is_Const(right)) {
1003 tarval *tv = get_Const_tarval(right);
1005 if (tarval_is_long(tv) &&
1006 get_tarval_long(tv) == get_mode_size_bits(mode)) {
1007 ir_node *left = get_Rot_left(node);
1009 int idx = get_irn_idx(left);
1011 l = env->entries[idx]->low_word;
1012 h = env->entries[idx]->high_word;
1013 idx = get_irn_idx(node);
1015 env->entries[idx]->low_word = h;
1016 env->entries[idx]->high_word = l;
1021 lower_Shiftop(node, mode, env);
1025 * Translate an Unop.
1027 * Create an intrinsic Call.
1029 static void lower_Unop(ir_node *node, ir_mode *mode, lower_env_t *env) {
1030 ir_node *block, *irn;
1036 node_entry_t *entry;
1038 irn = get_unop_op(node);
1039 entry = env->entries[get_irn_idx(irn)];
1042 if (! entry->low_word) {
1043 /* not ready yet, wait */
1044 pdeq_putr(env->waitq, node);
1048 in[0] = entry->low_word;
1049 in[1] = entry->high_word;
1051 dbg = get_irn_dbg_info(node);
1052 block = get_nodes_block(node);
1053 irg = current_ir_graph;
1055 mtp = mode_is_signed(mode) ? unop_tp_s : unop_tp_u;
1056 irn = get_intrinsic_address(mtp, get_irn_op(node), mode, mode, block, env);
1057 irn = new_rd_Call(dbg, irg, block, get_irg_no_mem(current_ir_graph),
1059 set_irn_pinned(irn, get_irn_pinned(node));
1060 irn = new_r_Proj(irg, block, irn, mode_T, pn_Call_T_result);
1062 idx = get_irn_idx(node);
1063 assert(idx < env->n_entries);
1064 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, mode, 0);
1065 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, mode, 1);
1069 * Translate a logical Binop.
1071 * Create two logical Binops.
1073 static void lower_Binop_logical(ir_node *node, ir_mode *mode, lower_env_t *env,
1074 ir_node *(*constr_rd)(dbg_info *db, ir_graph *irg, ir_node *block, ir_node *op1, ir_node *op2, ir_mode *mode) ) {
1075 ir_node *block, *irn;
1076 ir_node *lop_l, *lop_h, *rop_l, *rop_h;
1080 node_entry_t *entry;
1082 irn = get_binop_left(node);
1083 entry = env->entries[get_irn_idx(irn)];
1086 if (! entry->low_word) {
1087 /* not ready yet, wait */
1088 pdeq_putr(env->waitq, node);
1092 lop_l = entry->low_word;
1093 lop_h = entry->high_word;
1095 irn = get_binop_right(node);
1096 entry = env->entries[get_irn_idx(irn)];
1099 if (! entry->low_word) {
1100 /* not ready yet, wait */
1101 pdeq_putr(env->waitq, node);
1105 rop_l = entry->low_word;
1106 rop_h = entry->high_word;
1108 dbg = get_irn_dbg_info(node);
1109 block = get_nodes_block(node);
1111 idx = get_irn_idx(node);
1112 assert(idx < env->n_entries);
1113 irg = current_ir_graph;
1114 env->entries[idx]->low_word = constr_rd(dbg, irg, block, lop_l, rop_l, mode);
1115 env->entries[idx]->high_word = constr_rd(dbg, irg, block, lop_h, rop_h, mode);
1116 } /* lower_Binop_logical */
1118 /** create a logical operation tranformation */
1119 #define lower_logical(op) \
1120 static void lower_##op(ir_node *node, ir_mode *mode, lower_env_t *env) { \
1121 lower_Binop_logical(node, mode, env, new_rd_##op); \
1131 * Create two logical Nots.
1133 static void lower_Not(ir_node *node, ir_mode *mode, lower_env_t *env) {
1134 ir_node *block, *irn;
1135 ir_node *op_l, *op_h;
1139 node_entry_t *entry;
1141 irn = get_Not_op(node);
1142 entry = env->entries[get_irn_idx(irn)];
1145 if (! entry->low_word) {
1146 /* not ready yet, wait */
1147 pdeq_putr(env->waitq, node);
1151 op_l = entry->low_word;
1152 op_h = entry->high_word;
1154 dbg = get_irn_dbg_info(node);
1155 block = get_nodes_block(node);
1156 irg = current_ir_graph;
1158 idx = get_irn_idx(node);
1159 assert(idx < env->n_entries);
1160 env->entries[idx]->low_word = new_rd_Not(dbg, current_ir_graph, block, op_l, mode);
1161 env->entries[idx]->high_word = new_rd_Not(dbg, current_ir_graph, block, op_h, mode);
1165 * Translate a Minus.
1167 * Create two Minus'.
1169 static void lower_Minus(ir_node *node, ir_mode *mode, lower_env_t *env) {
1170 ir_node *block, *irn;
1171 ir_node *op_l, *op_h;
1175 node_entry_t *entry;
1177 irn = get_Minus_op(node);
1178 entry = env->entries[get_irn_idx(irn)];
1181 if (! entry->low_word) {
1182 /* not ready yet, wait */
1183 pdeq_putr(env->waitq, node);
1187 op_l = entry->low_word;
1188 op_h = entry->high_word;
1190 dbg = get_irn_dbg_info(node);
1191 block = get_nodes_block(node);
1192 irg = current_ir_graph;
1194 idx = get_irn_idx(node);
1195 assert(idx < env->n_entries);
1196 env->entries[idx]->low_word = new_rd_Minus(dbg, current_ir_graph, block, op_l, mode);
1197 env->entries[idx]->high_word = new_rd_Minus(dbg, current_ir_graph, block, op_h, mode);
1203 static void lower_Cond(ir_node *node, ir_mode *mode, lower_env_t *env) {
1204 ir_node *cmp, *left, *right, *block;
1205 ir_node *sel = get_Cond_selector(node);
1206 ir_mode *m = get_irn_mode(sel);
1210 node_entry_t *lentry, *rentry;
1211 ir_node *proj, *projT = NULL, *projF = NULL;
1212 ir_node *new_bl, *cmpH, *cmpL, *irn;
1213 ir_node *projHF, *projHT;
1219 cmp = get_Proj_pred(sel);
1220 left = get_Cmp_left(cmp);
1221 idx = get_irn_idx(left);
1222 lentry = env->entries[idx];
1229 right = get_Cmp_right(cmp);
1230 idx = get_irn_idx(right);
1231 rentry = env->entries[idx];
1234 if (! lentry->low_word || !rentry->low_word) {
1236 pdeq_putr(env->waitq, node);
1240 /* all right, build the code */
1241 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1242 long proj_nr = get_Proj_proj(proj);
1244 if (proj_nr == pn_Cond_true) {
1245 assert(projT == NULL && "more than one Proj(true)");
1248 assert(proj_nr == pn_Cond_false);
1249 assert(projF == NULL && "more than one Proj(false)");
1252 mark_irn_visited(proj);
1254 assert(projT && projF);
1256 /* create a new high compare */
1257 block = get_nodes_block(cmp);
1258 dbg = get_irn_dbg_info(cmp);
1259 irg = current_ir_graph;
1261 cmpH = new_rd_Cmp(dbg, irg, block, lentry->high_word, rentry->high_word);
1263 pnc = get_Proj_proj(sel);
1264 if (pnc == pn_Cmp_Eq) {
1265 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
1266 pmap_entry *entry = pmap_find(env->proj_2_block, projF);
1269 dst_blk = entry->value;
1271 irn = new_r_Proj(irg, block, cmpH, mode_b, pn_Cmp_Eq);
1272 dbg = get_irn_dbg_info(node);
1273 irn = new_rd_Cond(dbg, irg, block, irn);
1275 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1276 mark_irn_visited(projHF);
1277 exchange(projF, projHF);
1279 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1280 mark_irn_visited(projHT);
1282 new_bl = new_r_Block(irg, 1, &projHT);
1284 dbg = get_irn_dbg_info(cmp);
1285 cmpL = new_rd_Cmp(dbg, irg, new_bl, lentry->low_word, rentry->low_word);
1286 irn = new_r_Proj(irg, new_bl, cmpL, mode_b, pn_Cmp_Eq);
1287 dbg = get_irn_dbg_info(node);
1288 irn = new_rd_Cond(dbg, irg, new_bl, irn);
1290 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_false);
1291 mark_irn_visited(proj);
1292 add_block_cf_input(dst_blk, projHF, proj);
1294 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_true);
1295 mark_irn_visited(proj);
1296 exchange(projT, proj);
1297 } else if (pnc == pn_Cmp_Lg) {
1298 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
1299 pmap_entry *entry = pmap_find(env->proj_2_block, projT);
1302 dst_blk = entry->value;
1304 irn = new_r_Proj(irg, block, cmpH, mode_b, pn_Cmp_Lg);
1305 dbg = get_irn_dbg_info(node);
1306 irn = new_rd_Cond(dbg, irg, block, irn);
1308 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1309 mark_irn_visited(projHT);
1310 exchange(projT, projHT);
1312 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1313 mark_irn_visited(projHF);
1315 new_bl = new_r_Block(irg, 1, &projHF);
1317 dbg = get_irn_dbg_info(cmp);
1318 cmpL = new_rd_Cmp(dbg, irg, new_bl, lentry->low_word, rentry->low_word);
1319 irn = new_r_Proj(irg, new_bl, cmpL, mode_b, pn_Cmp_Lg);
1320 dbg = get_irn_dbg_info(node);
1321 irn = new_rd_Cond(dbg, irg, new_bl, irn);
1323 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_true);
1324 mark_irn_visited(proj);
1325 add_block_cf_input(dst_blk, projHT, proj);
1327 proj = new_r_Proj(irg, new_bl, irn, mode_X, pn_Cond_false);
1328 mark_irn_visited(proj);
1329 exchange(projF, proj);
1331 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
1332 ir_node *dstT, *dstF, *newbl_eq, *newbl_l;
1335 entry = pmap_find(env->proj_2_block, projT);
1337 dstT = entry->value;
1339 entry = pmap_find(env->proj_2_block, projF);
1341 dstF = entry->value;
1343 irn = new_r_Proj(irg, block, cmpH, mode_b, pnc & ~pn_Cmp_Eq);
1344 dbg = get_irn_dbg_info(node);
1345 irn = new_rd_Cond(dbg, irg, block, irn);
1347 projHT = new_r_Proj(irg, block, irn, mode_X, pn_Cond_true);
1348 mark_irn_visited(projHT);
1349 exchange(projT, projHT);
1352 projHF = new_r_Proj(irg, block, irn, mode_X, pn_Cond_false);
1353 mark_irn_visited(projHF);
1355 newbl_eq = new_r_Block(irg, 1, &projHF);
1357 irn = new_r_Proj(irg, newbl_eq, cmpH, mode_b, pn_Cmp_Eq);
1358 irn = new_rd_Cond(dbg, irg, newbl_eq, irn);
1360 proj = new_r_Proj(irg, newbl_eq, irn, mode_X, pn_Cond_false);
1361 mark_irn_visited(proj);
1362 exchange(projF, proj);
1365 proj = new_r_Proj(irg, newbl_eq, irn, mode_X, pn_Cond_true);
1366 mark_irn_visited(proj);
1368 newbl_l = new_r_Block(irg, 1, &proj);
1370 dbg = get_irn_dbg_info(cmp);
1371 cmpL = new_rd_Cmp(dbg, irg, newbl_l, lentry->low_word, rentry->low_word);
1372 irn = new_r_Proj(irg, newbl_l, cmpL, mode_b, pnc);
1373 dbg = get_irn_dbg_info(node);
1374 irn = new_rd_Cond(dbg, irg, newbl_l, irn);
1376 proj = new_r_Proj(irg, newbl_l, irn, mode_X, pn_Cond_true);
1377 mark_irn_visited(proj);
1378 add_block_cf_input(dstT, projT, proj);
1380 proj = new_r_Proj(irg, newbl_l, irn, mode_X, pn_Cond_false);
1381 mark_irn_visited(proj);
1382 add_block_cf_input(dstF, projF, proj);
1385 /* we have changed the control flow */
1386 env->flags |= CF_CHANGED;
1388 idx = get_irn_idx(sel);
1390 if (env->entries[idx]) {
1392 Bad, a jump-table with double-word index.
1393 This should not happen, but if it does we handle
1394 it like a Conv were between (in other words, ignore
1398 if (! env->entries[idx]->low_word) {
1399 /* not ready yet, wait */
1400 pdeq_putr(env->waitq, node);
1403 set_Cond_selector(node, env->entries[idx]->low_word);
1409 * Translate a Conv to higher_signed
1411 static void lower_Conv_to_Ls(ir_node *node, lower_env_t *env) {
1412 ir_node *op = get_Conv_op(node);
1413 ir_mode *imode = get_irn_mode(op);
1414 ir_mode *dst_mode = env->params->low_signed;
1415 int idx = get_irn_idx(node);
1416 ir_graph *irg = current_ir_graph;
1417 ir_node *block = get_nodes_block(node);
1418 dbg_info *dbg = get_irn_dbg_info(node);
1420 assert(idx < env->n_entries);
1422 if (mode_is_int(imode) || mode_is_reference(imode)) {
1423 if (imode == env->params->high_unsigned) {
1424 /* a Conv from Lu to Ls */
1425 int op_idx = get_irn_idx(op);
1427 if (! env->entries[op_idx]->low_word) {
1428 /* not ready yet, wait */
1429 pdeq_putr(env->waitq, node);
1432 env->entries[idx]->low_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->low_word, dst_mode);
1433 env->entries[idx]->high_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->high_word, dst_mode);
1435 /* simple case: create a high word */
1436 if (imode != dst_mode)
1437 op = new_rd_Conv(dbg, irg, block, op, dst_mode);
1439 env->entries[idx]->low_word = op;
1440 env->entries[idx]->high_word = new_rd_Shrs(dbg, irg, block, op,
1441 new_Const_long(mode_Iu, get_mode_size_bits(dst_mode) - 1), dst_mode);
1444 ir_node *irn, *call;
1445 ir_mode *omode = env->params->high_signed;
1446 ir_type *mtp = get_conv_type(imode, omode, env);
1448 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1449 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1450 set_irn_pinned(call, get_irn_pinned(node));
1451 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1453 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, dst_mode, 0);
1454 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, dst_mode, 1);
1456 } /* lower_Conv_to_Ls */
1459 * Translate a Conv to higher_unsigned
1461 static void lower_Conv_to_Lu(ir_node *node, lower_env_t *env) {
1462 ir_node *op = get_Conv_op(node);
1463 ir_mode *imode = get_irn_mode(op);
1464 ir_mode *dst_mode = env->params->low_unsigned;
1465 int idx = get_irn_idx(node);
1466 ir_graph *irg = current_ir_graph;
1467 ir_node *block = get_nodes_block(node);
1468 dbg_info *dbg = get_irn_dbg_info(node);
1470 assert(idx < env->n_entries);
1472 if (mode_is_int(imode) || mode_is_reference(imode)) {
1473 if (imode == env->params->high_signed) {
1474 /* a Conv from Ls to Lu */
1475 int op_idx = get_irn_idx(op);
1477 if (! env->entries[op_idx]->low_word) {
1478 /* not ready yet, wait */
1479 pdeq_putr(env->waitq, node);
1482 env->entries[idx]->low_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->low_word, dst_mode);
1483 env->entries[idx]->high_word = new_rd_Conv(dbg, irg, block, env->entries[op_idx]->high_word, dst_mode);
1485 /* simple case: create a high word */
1486 if (imode != dst_mode)
1487 op = new_rd_Conv(dbg, irg, block, op, dst_mode);
1489 env->entries[idx]->low_word = op;
1490 env->entries[idx]->high_word = new_Const(dst_mode, get_mode_null(dst_mode));
1493 ir_node *irn, *call;
1494 ir_mode *omode = env->params->high_unsigned;
1495 ir_type *mtp = get_conv_type(imode, omode, env);
1497 /* do an intrinsic call */
1498 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1499 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 1, &op, mtp);
1500 set_irn_pinned(call, get_irn_pinned(node));
1501 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1503 env->entries[idx]->low_word = new_r_Proj(irg, block, irn, dst_mode, 0);
1504 env->entries[idx]->high_word = new_r_Proj(irg, block, irn, dst_mode, 1);
1506 } /* lower_Conv_to_Lu */
1509 * Translate a Conv from higher_signed
1511 static void lower_Conv_from_Ls(ir_node *node, lower_env_t *env) {
1512 ir_node *op = get_Conv_op(node);
1513 ir_mode *omode = get_irn_mode(node);
1514 ir_node *block = get_nodes_block(node);
1515 dbg_info *dbg = get_irn_dbg_info(node);
1516 int idx = get_irn_idx(op);
1517 ir_graph *irg = current_ir_graph;
1519 assert(idx < env->n_entries);
1521 if (mode_is_int(omode) || mode_is_reference(omode)) {
1522 op = env->entries[idx]->low_word;
1524 /* simple case: create a high word */
1525 if (omode != env->params->low_signed)
1526 op = new_rd_Conv(dbg, irg, block, op, omode);
1528 set_Conv_op(node, op);
1530 ir_node *irn, *call, *in[2];
1531 ir_mode *imode = env->params->high_signed;
1532 ir_type *mtp = get_conv_type(imode, omode, env);
1534 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1535 in[0] = env->entries[idx]->low_word;
1536 in[1] = env->entries[idx]->high_word;
1538 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1539 set_irn_pinned(call, get_irn_pinned(node));
1540 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1542 exchange(node, new_r_Proj(irg, block, irn, omode, 0));
1544 } /* lower_Conv_from_Ls */
1547 * Translate a Conv from higher_unsigned
1549 static void lower_Conv_from_Lu(ir_node *node, lower_env_t *env) {
1550 ir_node *op = get_Conv_op(node);
1551 ir_mode *omode = get_irn_mode(node);
1552 ir_node *block = get_nodes_block(node);
1553 dbg_info *dbg = get_irn_dbg_info(node);
1554 int idx = get_irn_idx(op);
1555 ir_graph *irg = current_ir_graph;
1557 assert(idx < env->n_entries);
1559 if (mode_is_int(omode) || mode_is_reference(omode)) {
1560 op = env->entries[idx]->low_word;
1562 /* simple case: create a high word */
1563 if (omode != env->params->low_unsigned)
1564 op = new_rd_Conv(dbg, irg, block, op, omode);
1566 set_Conv_op(node, op);
1568 ir_node *irn, *call, *in[2];
1569 ir_mode *imode = env->params->high_unsigned;
1570 ir_type *mtp = get_conv_type(imode, omode, env);
1572 irn = get_intrinsic_address(mtp, get_irn_op(node), imode, omode, block, env);
1573 in[0] = env->entries[idx]->low_word;
1574 in[1] = env->entries[idx]->high_word;
1576 call = new_rd_Call(dbg, irg, block, get_irg_no_mem(irg), irn, 2, in, mtp);
1577 set_irn_pinned(call, get_irn_pinned(node));
1578 irn = new_r_Proj(irg, block, call, mode_T, pn_Call_T_result);
1580 exchange(node, new_r_Proj(irg, block, irn, omode, 0));
1582 } /* lower_Conv_from_Lu */
1587 static void lower_Conv(ir_node *node, ir_mode *mode, lower_env_t *env) {
1588 mode = get_irn_mode(node);
1590 if (mode == env->params->high_signed) {
1591 lower_Conv_to_Ls(node, env);
1592 } else if (mode == env->params->high_unsigned) {
1593 lower_Conv_to_Lu(node, env);
1595 ir_mode *mode = get_irn_mode(get_Conv_op(node));
1597 if (mode == env->params->high_signed) {
1598 lower_Conv_from_Ls(node, env);
1599 } else if (mode == env->params->high_unsigned) {
1600 lower_Conv_from_Lu(node, env);
1606 * Lower the method type.
1608 static ir_type *lower_mtp(ir_type *mtp, lower_env_t *env) {
1613 if (is_lowered_type(mtp))
1616 entry = pmap_find(lowered_type, mtp);
1618 int i, n, r, n_param, n_res;
1620 /* count new number of params */
1621 n_param = n = get_method_n_params(mtp);
1622 for (i = n_param - 1; i >= 0; --i) {
1623 ir_type *tp = get_method_param_type(mtp, i);
1625 if (is_Primitive_type(tp)) {
1626 ir_mode *mode = get_type_mode(tp);
1628 if (mode == env->params->high_signed ||
1629 mode == env->params->high_unsigned)
1634 /* count new number of results */
1635 n_res = r = get_method_n_ress(mtp);
1636 for (i = n_res - 1; i >= 0; --i) {
1637 ir_type *tp = get_method_res_type(mtp, i);
1639 if (is_Primitive_type(tp)) {
1640 ir_mode *mode = get_type_mode(tp);
1642 if (mode == env->params->high_signed ||
1643 mode == env->params->high_unsigned)
1648 id = mangle_u(new_id_from_chars("L", 1), get_type_ident(mtp));
1649 res = new_type_method(id, n_param, n_res);
1651 /* set param types and result types */
1652 for (i = n_param = 0; i < n; ++i) {
1653 ir_type *tp = get_method_param_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 set_method_param_type(res, n_param++, tp_s);
1660 set_method_param_type(res, n_param++, tp_s);
1661 } else if (mode == env->params->high_unsigned) {
1662 set_method_param_type(res, n_param++, tp_u);
1663 set_method_param_type(res, n_param++, tp_u);
1665 set_method_param_type(res, n_param++, tp);
1668 set_method_param_type(res, n_param++, tp);
1671 for (i = n_res = 0; i < r; ++i) {
1672 ir_type *tp = get_method_res_type(mtp, i);
1674 if (is_Primitive_type(tp)) {
1675 ir_mode *mode = get_type_mode(tp);
1677 if (mode == env->params->high_signed) {
1678 set_method_res_type(res, n_res++, tp_s);
1679 set_method_res_type(res, n_res++, tp_s);
1680 } else if (mode == env->params->high_unsigned) {
1681 set_method_res_type(res, n_res++, tp_u);
1682 set_method_res_type(res, n_res++, tp_u);
1684 set_method_res_type(res, n_res++, tp);
1687 set_method_res_type(res, n_res++, tp);
1690 set_lowered_type(mtp, res);
1691 pmap_insert(lowered_type, mtp, res);
1699 * Translate a Return.
1701 static void lower_Return(ir_node *node, ir_mode *mode, lower_env_t *env) {
1702 ir_graph *irg = current_ir_graph;
1703 entity *ent = get_irg_entity(irg);
1704 ir_type *mtp = get_entity_type(ent);
1709 /* check if this return must be lowered */
1710 for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1711 ir_node *pred = get_Return_res(node, i);
1712 ir_mode *mode = get_irn_op_mode(pred);
1714 if (mode == env->params->high_signed ||
1715 mode == env->params->high_unsigned) {
1716 idx = get_irn_idx(pred);
1717 if (! env->entries[idx]->low_word) {
1718 /* not ready yet, wait */
1719 pdeq_putr(env->waitq, node);
1728 ent = get_irg_entity(irg);
1729 mtp = get_entity_type(ent);
1731 mtp = lower_mtp(mtp, env);
1732 set_entity_type(ent, mtp);
1734 /* create a new in array */
1735 NEW_ARR_A(ir_node *, in, get_method_n_ress(mtp) + 1);
1736 in[0] = get_Return_mem(node);
1738 for (j = i = 0, n = get_Return_n_ress(node); i < n; ++i) {
1739 ir_node *pred = get_Return_res(node, i);
1741 idx = get_irn_idx(pred);
1742 assert(idx < env->n_entries);
1744 if (env->entries[idx]) {
1745 in[++j] = env->entries[idx]->low_word;
1746 in[++j] = env->entries[idx]->high_word;
1752 set_irn_in(node, j+1, in);
1753 } /* lower_Return */
1756 * Translate the parameters.
1758 static void lower_Start(ir_node *node, ir_mode *mode, lower_env_t *env) {
1759 ir_graph *irg = current_ir_graph;
1760 entity *ent = get_irg_entity(irg);
1761 ir_type *tp = get_entity_type(ent);
1764 int i, j, n_params, rem;
1765 ir_node *proj, *args;
1767 if (is_lowered_type(tp)) {
1768 mtp = get_associated_type(tp);
1772 assert(! is_lowered_type(mtp));
1774 n_params = get_method_n_params(mtp);
1778 NEW_ARR_A(long, new_projs, n_params);
1780 /* first check if we have parameters that must be fixed */
1781 for (i = j = 0; i < n_params; ++i, ++j) {
1782 ir_type *tp = get_method_param_type(mtp, i);
1785 if (is_Primitive_type(tp)) {
1786 ir_mode *mode = get_type_mode(tp);
1788 if (mode == env->params->high_signed ||
1789 mode == env->params->high_unsigned)
1796 mtp = lower_mtp(mtp, env);
1797 set_entity_type(ent, mtp);
1799 /* switch off optimization for new Proj nodes or they might be CSE'ed
1800 with not patched one's */
1801 rem = get_optimize();
1804 /* ok, fix all Proj's and create new ones */
1805 args = get_irg_args(irg);
1806 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1807 ir_node *pred = get_Proj_pred(proj);
1813 /* do not visit this node again */
1814 mark_irn_visited(proj);
1819 proj_nr = get_Proj_proj(proj);
1820 set_Proj_proj(proj, new_projs[proj_nr]);
1822 idx = get_irn_idx(proj);
1823 if (env->entries[idx]) {
1824 mode = get_irn_mode(proj);
1826 if (mode == env->params->high_signed) {
1827 mode = env->params->low_signed;
1829 mode = env->params->low_unsigned;
1832 dbg = get_irn_dbg_info(proj);
1833 env->entries[idx]->low_word =
1834 new_rd_Proj(dbg, irg, get_nodes_block(proj), args, mode, new_projs[proj_nr]);
1835 env->entries[idx]->high_word =
1836 new_rd_Proj(dbg, irg, get_nodes_block(proj), args, mode, new_projs[proj_nr] + 1);
1845 static void lower_Call(ir_node *node, ir_mode *mode, lower_env_t *env) {
1846 ir_graph *irg = current_ir_graph;
1847 ir_type *tp = get_Call_type(node);
1849 ir_node **in, *proj, *results;
1850 int n_params, n_res, need_lower = 0;
1852 long *res_numbers = NULL;
1854 if (is_lowered_type(tp)) {
1855 call_tp = get_associated_type(tp);
1860 assert(! is_lowered_type(call_tp));
1862 n_params = get_method_n_params(call_tp);
1863 for (i = 0; i < n_params; ++i) {
1864 ir_type *tp = get_method_param_type(call_tp, i);
1866 if (is_Primitive_type(tp)) {
1867 ir_mode *mode = get_type_mode(tp);
1869 if (mode == env->params->high_signed ||
1870 mode == env->params->high_unsigned) {
1876 n_res = get_method_n_ress(call_tp);
1878 NEW_ARR_A(long, res_numbers, n_res);
1880 for (i = j = 0; i < n_res; ++i, ++j) {
1881 ir_type *tp = get_method_res_type(call_tp, i);
1884 if (is_Primitive_type(tp)) {
1885 ir_mode *mode = get_type_mode(tp);
1887 if (mode == env->params->high_signed ||
1888 mode == env->params->high_unsigned) {
1899 /* let's lower it */
1900 call_tp = lower_mtp(call_tp, env);
1901 set_Call_type(node, call_tp);
1903 NEW_ARR_A(ir_node *, in, get_method_n_params(call_tp) + 2);
1905 in[0] = get_Call_mem(node);
1906 in[1] = get_Call_ptr(node);
1908 for (j = 2, i = 0; i < n_params; ++i) {
1909 ir_node *pred = get_Call_param(node, i);
1910 int idx = get_irn_idx(pred);
1912 if (env->entries[idx]) {
1913 if (! env->entries[idx]->low_word) {
1914 /* not ready yet, wait */
1915 pdeq_putr(env->waitq, node);
1918 in[j++] = env->entries[idx]->low_word;
1919 in[j++] = env->entries[idx]->high_word;
1925 set_irn_in(node, j, in);
1927 /* fix the results */
1929 for (proj = get_irn_link(node); proj; proj = get_irn_link(proj)) {
1930 long proj_nr = get_Proj_proj(proj);
1932 if (proj_nr == pn_Call_T_result && get_Proj_pred(proj) == node) {
1933 /* found the result proj */
1939 if (results) { /* there are results */
1940 int rem = get_optimize();
1942 /* switch off optimization for new Proj nodes or they might be CSE'ed
1943 with not patched one's */
1945 for (i = j = 0, proj = get_irn_link(results); proj; proj = get_irn_link(proj), ++i, ++j) {
1946 if (get_Proj_pred(proj) == results) {
1947 long proj_nr = get_Proj_proj(proj);
1950 /* found a result */
1951 set_Proj_proj(proj, res_numbers[proj_nr]);
1952 idx = get_irn_idx(proj);
1953 if (env->entries[idx]) {
1954 ir_mode *mode = get_irn_mode(proj);
1957 if (mode == env->params->high_signed) {
1958 mode = env->params->low_signed;
1960 mode = env->params->low_unsigned;
1963 dbg = get_irn_dbg_info(proj);
1964 env->entries[idx]->low_word =
1965 new_rd_Proj(dbg, irg, get_nodes_block(proj), results, mode, res_numbers[proj_nr]);
1966 env->entries[idx]->high_word =
1967 new_rd_Proj(dbg, irg, get_nodes_block(proj), results, mode, res_numbers[proj_nr] + 1);
1969 mark_irn_visited(proj);
1977 * Translate an Unknown into two.
1979 static void lower_Unknown(ir_node *node, ir_mode *mode, lower_env_t *env) {
1980 int idx = get_irn_idx(node);
1981 ir_graph *irg = current_ir_graph;
1983 env->entries[idx]->low_word =
1984 env->entries[idx]->high_word = new_r_Unknown(irg, mode);
1985 } /* lower_Unknown */
1990 * First step: just create two templates
1992 static void lower_Phi(ir_node *phi, ir_mode *mode, lower_env_t *env) {
1993 ir_graph *irg = current_ir_graph;
1994 ir_node *block, *unk;
1995 ir_node **inl, **inh;
1997 int idx, i, arity = get_Phi_n_preds(phi);
2000 idx = get_irn_idx(phi);
2001 if (env->entries[idx]->low_word) {
2002 /* Phi nodes already build, check for inputs */
2003 ir_node *phil = env->entries[idx]->low_word;
2004 ir_node *phih = env->entries[idx]->high_word;
2006 for (i = 0; i < arity; ++i) {
2007 ir_node *pred = get_Phi_pred(phi, i);
2008 int idx = get_irn_idx(pred);
2010 if (env->entries[idx]->low_word) {
2011 set_Phi_pred(phil, i, env->entries[idx]->low_word);
2012 set_Phi_pred(phih, i, env->entries[idx]->high_word);
2014 /* still not ready */
2015 pdeq_putr(env->waitq, phi);
2021 /* first create a new in array */
2022 NEW_ARR_A(ir_node *, inl, arity);
2023 NEW_ARR_A(ir_node *, inh, arity);
2024 unk = new_r_Unknown(irg, mode);
2026 for (i = 0; i < arity; ++i) {
2027 ir_node *pred = get_Phi_pred(phi, i);
2028 int idx = get_irn_idx(pred);
2030 if (env->entries[idx]->low_word) {
2031 inl[i] = env->entries[idx]->low_word;
2032 inh[i] = env->entries[idx]->high_word;
2040 dbg = get_irn_dbg_info(phi);
2041 block = get_nodes_block(phi);
2043 idx = get_irn_idx(phi);
2044 assert(idx < env->n_entries);
2045 env->entries[idx]->low_word = new_rd_Phi(dbg, irg, block, arity, inl, mode);
2046 env->entries[idx]->high_word = new_rd_Phi(dbg, irg, block, arity, inh, mode);
2049 /* not yet finished */
2050 pdeq_putr(env->waitq, phi);
2057 static void lower_Psi(ir_node *psi, ir_mode *mode, lower_env_t *env) {
2058 ir_graph *irg = current_ir_graph;
2059 ir_node *block, *val;
2060 ir_node **valsl, **valsh, **conds;
2062 int idx, i, n_conds = get_Psi_n_conds(psi);
2064 /* first create a new in array */
2065 NEW_ARR_A(ir_node *, valsl, n_conds + 1);
2066 NEW_ARR_A(ir_node *, valsh, n_conds + 1);
2068 for (i = 0; i < n_conds; ++i) {
2069 val = get_Psi_val(psi, i);
2070 idx = get_irn_idx(val);
2071 if (env->entries[idx]->low_word) {
2072 /* Values already build */
2073 valsl[i] = env->entries[idx]->low_word;
2074 valsh[i] = env->entries[idx]->high_word;
2076 /* still not ready */
2077 pdeq_putr(env->waitq, psi);
2081 val = get_Psi_default(psi);
2082 idx = get_irn_idx(val);
2083 if (env->entries[idx]->low_word) {
2084 /* Values already build */
2085 valsl[i] = env->entries[idx]->low_word;
2086 valsh[i] = env->entries[idx]->high_word;
2088 /* still not ready */
2089 pdeq_putr(env->waitq, psi);
2094 NEW_ARR_A(ir_node *, conds, n_conds);
2095 for (i = 0; i < n_conds; ++i) {
2096 conds[i] = get_Psi_cond(psi, i);
2099 dbg = get_irn_dbg_info(psi);
2100 block = get_nodes_block(psi);
2102 idx = get_irn_idx(psi);
2103 assert(idx < env->n_entries);
2104 env->entries[idx]->low_word = new_rd_Psi(dbg, irg, block, n_conds, conds, valsl, mode);
2105 env->entries[idx]->high_word = new_rd_Psi(dbg, irg, block, n_conds, conds, valsh, mode);
2109 * check for opcodes that must always be lowered.
2111 static int always_lower(opcode code) {
2123 } /* always_lower */
2126 * lower boolean Proj(Cmp)
2128 static ir_node *lower_boolean_Proj_Cmp(ir_node *proj, ir_node *cmp, lower_env_t *env) {
2130 ir_node *l, *r, *low, *high, *t, *res;
2133 ir_graph *irg = current_ir_graph;
2136 l = get_Cmp_left(cmp);
2137 lidx = get_irn_idx(l);
2138 if (! env->entries[lidx]->low_word) {
2139 /* still not ready */
2143 r = get_Cmp_right(cmp);
2144 ridx = get_irn_idx(r);
2145 if (! env->entries[ridx]->low_word) {
2146 /* still not ready */
2150 pnc = get_Proj_proj(proj);
2151 blk = get_nodes_block(cmp);
2152 db = get_irn_dbg_info(cmp);
2153 low = new_rd_Cmp(db, irg, blk, env->entries[lidx]->low_word, env->entries[ridx]->low_word);
2154 high = new_rd_Cmp(db, irg, blk, env->entries[lidx]->high_word, env->entries[ridx]->high_word);
2156 if (pnc == pn_Cmp_Eq) {
2157 /* simple case:a == b <==> a_h == b_h && a_l == b_l */
2158 res = new_rd_And(db, irg, blk,
2159 new_r_Proj(irg, blk, low, mode_b, pnc),
2160 new_r_Proj(irg, blk, high, mode_b, pnc),
2162 } else if (pnc == pn_Cmp_Lg) {
2163 /* simple case:a != b <==> a_h != b_h || a_l != b_l */
2164 res = new_rd_Or(db, irg, blk,
2165 new_r_Proj(irg, blk, low, mode_b, pnc),
2166 new_r_Proj(irg, blk, high, mode_b, pnc),
2169 /* a rel b <==> a_h REL b_h || (a_h == b_h && a_l rel b_l) */
2170 t = new_rd_And(db, irg, blk,
2171 new_r_Proj(irg, blk, low, mode_b, pnc),
2172 new_r_Proj(irg, blk, high, mode_b, pn_Cmp_Eq),
2174 res = new_rd_Or(db, irg, blk,
2175 new_r_Proj(irg, blk, high, mode_b, pnc & ~pn_Cmp_Eq),
2180 } /* lower_boolean_Proj_Cmp */
2183 * The type of a lower function.
2185 * @param node the node to be lowered
2186 * @param mode the low mode for the destination node
2187 * @param env the lower environment
2189 typedef void (*lower_func)(ir_node *node, ir_mode *mode, lower_env_t *env);
2194 static void lower_ops(ir_node *node, void *env)
2196 lower_env_t *lenv = env;
2197 node_entry_t *entry;
2198 int idx = get_irn_idx(node);
2199 ir_mode *mode = get_irn_mode(node);
2201 if (mode == mode_b || get_irn_op(node) == op_Psi) {
2204 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
2205 ir_node *proj = get_irn_n(node, i);
2207 if (is_Proj(proj)) {
2208 ir_node *cmp = get_Proj_pred(proj);
2211 ir_node *arg = get_Cmp_left(cmp);
2213 mode = get_irn_mode(arg);
2214 if (mode == lenv->params->high_signed ||
2215 mode == lenv->params->high_unsigned) {
2216 ir_node *res = lower_boolean_Proj_Cmp(proj, cmp, lenv);
2219 /* could not lower because predecessors not ready */
2220 waitq_put(lenv->waitq, node);
2223 set_irn_n(node, i, res);
2230 entry = idx < lenv->n_entries ? lenv->entries[idx] : NULL;
2231 if (entry || always_lower(get_irn_opcode(node))) {
2232 ir_op *op = get_irn_op(node);
2233 lower_func func = (lower_func)op->ops.generic;
2236 mode = get_irn_op_mode(node);
2238 if (mode == lenv->params->high_signed)
2239 mode = lenv->params->low_signed;
2241 mode = lenv->params->low_unsigned;
2243 DB((dbg, LEVEL_1, " %+F\n", node));
2244 func(node, mode, lenv);
2249 #define IDENT(s) new_id_from_chars(s, sizeof(s)-1)
2252 * Compare two op_mode_entry_t's.
2254 static int cmp_op_mode(const void *elt, const void *key, size_t size) {
2255 const op_mode_entry_t *e1 = elt;
2256 const op_mode_entry_t *e2 = key;
2258 return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
2262 * Compare two conv_tp_entry_t's.
2264 static int cmp_conv_tp(const void *elt, const void *key, size_t size) {
2265 const conv_tp_entry_t *e1 = elt;
2266 const conv_tp_entry_t *e2 = key;
2268 return (e1->imode - e2->imode) | (e1->omode - e2->omode);
2269 } /* static int cmp_conv_tp */
2274 void lower_dw_ops(const lwrdw_param_t *param)
2283 if (! param->enable)
2286 FIRM_DBG_REGISTER(dbg, "firm.lower.dw");
2288 assert(2 * get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->high_signed));
2289 assert(2 * get_mode_size_bits(param->low_unsigned) == get_mode_size_bits(param->high_unsigned));
2290 assert(get_mode_size_bits(param->low_signed) == get_mode_size_bits(param->low_unsigned));
2292 /* create the necessary maps */
2294 prim_types = pmap_create();
2295 if (! intrinsic_fkt)
2296 intrinsic_fkt = new_set(cmp_op_mode, iro_MaxOpcode);
2298 conv_types = new_set(cmp_conv_tp, 16);
2300 lowered_type = pmap_create();
2302 /* create a primitive unsigned and signed type */
2304 tp_u = get_primitive_type(param->low_unsigned);
2306 tp_s = get_primitive_type(param->low_signed);
2308 /* create method types for the created binop calls */
2310 binop_tp_u = new_type_method(IDENT("binop_u_intrinsic"), 4, 2);
2311 set_method_param_type(binop_tp_u, 0, tp_u);
2312 set_method_param_type(binop_tp_u, 1, tp_u);
2313 set_method_param_type(binop_tp_u, 2, tp_u);
2314 set_method_param_type(binop_tp_u, 3, tp_u);
2315 set_method_res_type(binop_tp_u, 0, tp_u);
2316 set_method_res_type(binop_tp_u, 1, tp_u);
2319 binop_tp_s = new_type_method(IDENT("binop_s_intrinsic"), 4, 2);
2320 set_method_param_type(binop_tp_s, 0, tp_s);
2321 set_method_param_type(binop_tp_s, 1, tp_s);
2322 set_method_param_type(binop_tp_s, 2, tp_s);
2323 set_method_param_type(binop_tp_s, 3, tp_s);
2324 set_method_res_type(binop_tp_s, 0, tp_s);
2325 set_method_res_type(binop_tp_s, 1, tp_s);
2327 if (! shiftop_tp_u) {
2328 shiftop_tp_u = new_type_method(IDENT("shiftop_u_intrinsic"), 3, 2);
2329 set_method_param_type(shiftop_tp_u, 0, tp_u);
2330 set_method_param_type(shiftop_tp_u, 1, tp_u);
2331 set_method_param_type(shiftop_tp_u, 2, tp_u);
2332 set_method_res_type(shiftop_tp_u, 0, tp_u);
2333 set_method_res_type(shiftop_tp_u, 1, tp_u);
2335 if (! shiftop_tp_s) {
2336 shiftop_tp_s = new_type_method(IDENT("shiftop_s_intrinsic"), 3, 2);
2337 set_method_param_type(shiftop_tp_s, 0, tp_s);
2338 set_method_param_type(shiftop_tp_s, 1, tp_s);
2339 /* beware: shift count is always mode_Iu */
2340 set_method_param_type(shiftop_tp_s, 2, tp_u);
2341 set_method_res_type(shiftop_tp_s, 0, tp_s);
2342 set_method_res_type(shiftop_tp_s, 1, tp_s);
2345 unop_tp_u = new_type_method(IDENT("unop_u_intrinsic"), 2, 2);
2346 set_method_param_type(unop_tp_u, 0, tp_u);
2347 set_method_param_type(unop_tp_u, 1, tp_u);
2348 set_method_res_type(unop_tp_u, 0, tp_u);
2349 set_method_res_type(unop_tp_u, 1, tp_u);
2352 unop_tp_s = new_type_method(IDENT("unop_s_intrinsic"), 2, 2);
2353 set_method_param_type(unop_tp_s, 0, tp_s);
2354 set_method_param_type(unop_tp_s, 1, tp_s);
2355 set_method_res_type(unop_tp_s, 0, tp_s);
2356 set_method_res_type(unop_tp_s, 1, tp_s);
2359 lenv.tv_mode_bytes = new_tarval_from_long(get_mode_size_bytes(param->low_unsigned), mode_Iu);
2360 lenv.tv_mode_bits = new_tarval_from_long(get_mode_size_bits(param->low_unsigned), mode_Iu);
2361 lenv.waitq = new_pdeq();
2362 lenv.params = param;
2364 /* first clear the generic function pointer for all ops */
2365 clear_irp_opcodes_generic_func();
2367 #define LOWER2(op, fkt) op_##op->ops.generic = (op_func)fkt
2368 #define LOWER(op) LOWER2(op, lower_##op)
2369 #define LOWER_BIN(op) LOWER2(op, lower_Binop)
2370 #define LOWER_UN(op) LOWER2(op, lower_Unop)
2372 /* the table of all operations that must be lowered follows */
2408 /* transform all graphs */
2409 rem = current_ir_graph;
2410 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
2411 ir_graph *irg = get_irp_irg(i);
2414 obstack_init(&lenv.obst);
2416 n_idx = get_irg_last_idx(irg);
2417 lenv.n_entries = n_idx;
2418 lenv.entries = xmalloc(n_idx * sizeof(lenv.entries[0]));
2419 memset(lenv.entries, 0, n_idx * sizeof(lenv.entries[0]));
2421 /* first step: link all nodes and allocate data */
2423 lenv.proj_2_block = pmap_create();
2424 irg_walk_graph(irg, firm_clear_link, prepare_links, &lenv);
2426 if (lenv.flags & MUST_BE_LOWERED) {
2427 DB((dbg, LEVEL_1, "Lowering graph %+F\n", irg));
2429 /* must do some work */
2430 irg_walk_graph(irg, NULL, lower_ops, &lenv);
2432 /* last step: all waiting nodes */
2433 DB((dbg, LEVEL_1, "finishing waiting nodes:\n"));
2434 current_ir_graph = irg;
2435 while (! pdeq_empty(lenv.waitq)) {
2436 ir_node *node = pdeq_getl(lenv.waitq);
2438 lower_ops(node, &lenv);
2441 /* outs are invalid, we changed the graph */
2442 set_irg_outs_inconsistent(irg);
2444 if (lenv.flags & CF_CHANGED) {
2445 /* control flow changed, dominance info is invalid */
2446 set_irg_doms_inconsistent(irg);
2447 set_irg_extblk_inconsistent(irg);
2448 set_irg_loopinfo_inconsistent(irg);
2451 dump_ir_block_graph(irg, "-dw");
2453 pmap_destroy(lenv.proj_2_block);
2455 obstack_free(&lenv.obst, NULL);
2457 del_pdeq(lenv.waitq);
2458 current_ir_graph = rem;
2459 } /* lower_dw_ops */
2461 /* Default implementation. */
2462 entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
2463 const ir_mode *imode, const ir_mode *omode,
2470 if (imode == omode) {
2471 snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
2473 snprintf(buf, sizeof(buf), "__l%s%s%s", get_op_name(op),
2474 get_mode_name(imode), get_mode_name(omode));
2476 id = new_id_from_str(buf);
2478 ent = new_entity(get_glob_type(), id, method);
2479 set_entity_ld_ident(ent, get_entity_ident(ent));
2480 set_entity_visibility(ent, visibility_external_allocated);
2482 } /* def_create_intrinsic_fkt */