3 * File name: ir/ir/ircons.c
4 * Purpose: Various irnode constructors. Automatic construction
5 * of SSA representation.
6 * Author: Martin Trapp, Christian Schaefer
7 * Modified by: Goetz Lindenmaier, Boris Boesler
10 * Copyright: (c) 1998-2003 Universität Karlsruhe
11 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
28 # include "irprog_t.h"
29 # include "irgraph_t.h"
30 # include "irnode_t.h"
31 # include "irmode_t.h"
32 # include "ircons_t.h"
33 # include "firm_common_t.h"
39 # include "irbackedge_t.h"
40 # include "irflag_t.h"
41 # include "iredges_t.h"
43 #if USE_EXPLICIT_PHI_IN_STACK
44 /* A stack needed for the automatic Phi node construction in constructor
45 Phi_in. Redefinition in irgraph.c!! */
50 typedef struct Phi_in_stack Phi_in_stack;
53 /* when we need verifying */
55 # define IRN_VRFY_IRG(res, irg)
57 # define IRN_VRFY_IRG(res, irg) irn_vrfy_irg(res, irg)
61 * Language dependent variable initialization callback.
63 static uninitialized_local_variable_func_t *default_initialize_local_variable = NULL;
65 /* creates a bd constructor for a binop */
66 #define NEW_BD_BINOP(instr) \
68 new_bd_##instr (dbg_info *db, ir_node *block, \
69 ir_node *op1, ir_node *op2, ir_mode *mode) \
73 ir_graph *irg = current_ir_graph; \
76 res = new_ir_node(db, irg, block, op_##instr, mode, 2, in); \
77 res = optimize_node(res); \
78 IRN_VRFY_IRG(res, irg); \
82 /* creates a bd constructor for an unop */
83 #define NEW_BD_UNOP(instr) \
85 new_bd_##instr (dbg_info *db, ir_node *block, \
86 ir_node *op, ir_mode *mode) \
89 ir_graph *irg = current_ir_graph; \
90 res = new_ir_node(db, irg, block, op_##instr, mode, 1, &op); \
91 res = optimize_node(res); \
92 IRN_VRFY_IRG(res, irg); \
96 /* creates a bd constructor for an divop */
97 #define NEW_BD_DIVOP(instr) \
99 new_bd_##instr (dbg_info *db, ir_node *block, \
100 ir_node *memop, ir_node *op1, ir_node *op2) \
104 ir_graph *irg = current_ir_graph; \
108 res = new_ir_node(db, irg, block, op_##instr, mode_T, 3, in); \
109 res = optimize_node(res); \
110 IRN_VRFY_IRG(res, irg); \
114 /* creates a rd constructor for a binop */
115 #define NEW_RD_BINOP(instr) \
117 new_rd_##instr (dbg_info *db, ir_graph *irg, ir_node *block, \
118 ir_node *op1, ir_node *op2, ir_mode *mode) \
121 ir_graph *rem = current_ir_graph; \
122 current_ir_graph = irg; \
123 res = new_bd_##instr(db, block, op1, op2, mode); \
124 current_ir_graph = rem; \
128 /* creates a rd constructor for an unop */
129 #define NEW_RD_UNOP(instr) \
131 new_rd_##instr (dbg_info *db, ir_graph *irg, ir_node *block, \
132 ir_node *op, ir_mode *mode) \
135 ir_graph *rem = current_ir_graph; \
136 current_ir_graph = irg; \
137 res = new_bd_##instr(db, block, op, mode); \
138 current_ir_graph = rem; \
142 /* creates a rd constructor for an divop */
143 #define NEW_RD_DIVOP(instr) \
145 new_rd_##instr (dbg_info *db, ir_graph *irg, ir_node *block, \
146 ir_node *memop, ir_node *op1, ir_node *op2) \
149 ir_graph *rem = current_ir_graph; \
150 current_ir_graph = irg; \
151 res = new_bd_##instr(db, block, memop, op1, op2); \
152 current_ir_graph = rem; \
156 /* creates a d constructor for an binop */
157 #define NEW_D_BINOP(instr) \
159 new_d_##instr (dbg_info *db, ir_node *op1, ir_node *op2, ir_mode *mode) { \
160 return new_bd_##instr(db, current_ir_graph->current_block, op1, op2, mode); \
163 /* creates a d constructor for an unop */
164 #define NEW_D_UNOP(instr) \
166 new_d_##instr (dbg_info *db, ir_node *op, ir_mode *mode) { \
167 return new_bd_##instr(db, current_ir_graph->current_block, op, mode); \
171 /* Constructs a Block with a fixed number of predecessors.
172 Does not set current_block. Can not be used with automatic
173 Phi node construction. */
175 new_bd_Block (dbg_info *db, int arity, ir_node **in)
178 ir_graph *irg = current_ir_graph;
180 res = new_ir_node (db, irg, NULL, op_Block, mode_BB, arity, in);
181 set_Block_matured(res, 1);
182 set_Block_block_visited(res, 0);
184 /* res->attr.block.exc = exc_normal; */
185 /* res->attr.block.handler_entry = 0; */
186 res->attr.block.dead = 0;
187 res->attr.block.irg = irg;
188 res->attr.block.backedge = new_backedge_arr(irg->obst, arity);
189 res->attr.block.in_cg = NULL;
190 res->attr.block.cg_backedge = NULL;
191 res->attr.block.extblk = NULL;
193 IRN_VRFY_IRG(res, irg);
198 new_bd_Start (dbg_info *db, ir_node *block)
201 ir_graph *irg = current_ir_graph;
203 res = new_ir_node(db, irg, block, op_Start, mode_T, 0, NULL);
204 /* res->attr.start.irg = irg; */
206 IRN_VRFY_IRG(res, irg);
211 new_bd_End (dbg_info *db, ir_node *block)
214 ir_graph *irg = current_ir_graph;
216 res = new_ir_node(db, irg, block, op_End, mode_X, -1, NULL);
218 IRN_VRFY_IRG(res, irg);
222 /* Creates a Phi node with all predecessors. Calling this constructor
223 is only allowed if the corresponding block is mature. */
225 new_bd_Phi (dbg_info *db, ir_node *block, int arity, ir_node **in, ir_mode *mode)
228 ir_graph *irg = current_ir_graph;
232 /* Don't assert that block matured: the use of this constructor is strongly
234 if ( get_Block_matured(block) )
235 assert( get_irn_arity(block) == arity );
237 res = new_ir_node(db, irg, block, op_Phi, mode, arity, in);
239 res->attr.phi_backedge = new_backedge_arr(irg->obst, arity);
241 for (i = arity-1; i >= 0; i--)
242 if (get_irn_op(in[i]) == op_Unknown) {
247 if (!has_unknown) res = optimize_node (res);
248 IRN_VRFY_IRG(res, irg);
250 /* Memory Phis in endless loops must be kept alive.
251 As we can't distinguish these easily we keep all of them alive. */
252 if ((res->op == op_Phi) && (mode == mode_M))
253 add_End_keepalive(get_irg_end(irg), res);
258 new_bd_Const_type (dbg_info *db, ir_node *block, ir_mode *mode, tarval *con, ir_type *tp)
261 ir_graph *irg = current_ir_graph;
263 res = new_ir_node (db, irg, get_irg_start_block(irg), op_Const, mode, 0, NULL);
264 res->attr.con.tv = con;
265 set_Const_type(res, tp); /* Call method because of complex assertion. */
266 res = optimize_node (res);
267 assert(get_Const_type(res) == tp);
268 IRN_VRFY_IRG(res, irg);
274 new_bd_Const (dbg_info *db, ir_node *block, ir_mode *mode, tarval *con)
276 ir_graph *irg = current_ir_graph;
278 return new_rd_Const_type (db, irg, block, mode, con, firm_unknown_type);
282 new_bd_Const_long (dbg_info *db, ir_node *block, ir_mode *mode, long value)
284 ir_graph *irg = current_ir_graph;
286 return new_rd_Const(db, irg, block, mode, new_tarval_from_long(value, mode));
290 new_bd_Id (dbg_info *db, ir_node *block, ir_node *val, ir_mode *mode)
293 ir_graph *irg = current_ir_graph;
295 res = new_ir_node(db, irg, block, op_Id, mode, 1, &val);
296 res = optimize_node(res);
297 IRN_VRFY_IRG(res, irg);
302 new_bd_Proj (dbg_info *db, ir_node *block, ir_node *arg, ir_mode *mode,
306 ir_graph *irg = current_ir_graph;
308 res = new_ir_node (db, irg, block, op_Proj, mode, 1, &arg);
309 res->attr.proj = proj;
312 assert(get_Proj_pred(res));
313 assert(get_nodes_block(get_Proj_pred(res)));
315 res = optimize_node(res);
317 IRN_VRFY_IRG(res, irg);
323 new_bd_defaultProj (dbg_info *db, ir_node *block, ir_node *arg,
327 ir_graph *irg = current_ir_graph;
329 assert(arg->op == op_Cond);
330 arg->attr.c.kind = fragmentary;
331 arg->attr.c.default_proj = max_proj;
332 res = new_rd_Proj (db, irg, block, arg, mode_X, max_proj);
337 new_bd_Conv (dbg_info *db, ir_node *block, ir_node *op, ir_mode *mode)
340 ir_graph *irg = current_ir_graph;
342 res = new_ir_node(db, irg, block, op_Conv, mode, 1, &op);
343 res = optimize_node(res);
344 IRN_VRFY_IRG(res, irg);
349 new_bd_Cast (dbg_info *db, ir_node *block, ir_node *op, ir_type *to_tp)
352 ir_graph *irg = current_ir_graph;
354 assert(is_atomic_type(to_tp));
356 res = new_ir_node(db, irg, block, op_Cast, get_irn_mode(op), 1, &op);
357 res->attr.cast.totype = to_tp;
358 res = optimize_node(res);
359 IRN_VRFY_IRG(res, irg);
364 new_bd_Tuple (dbg_info *db, ir_node *block, int arity, ir_node **in)
367 ir_graph *irg = current_ir_graph;
369 res = new_ir_node(db, irg, block, op_Tuple, mode_T, arity, in);
370 res = optimize_node (res);
371 IRN_VRFY_IRG(res, irg);
396 new_bd_Cmp (dbg_info *db, ir_node *block, ir_node *op1, ir_node *op2)
400 ir_graph *irg = current_ir_graph;
403 res = new_ir_node(db, irg, block, op_Cmp, mode_T, 2, in);
404 res = optimize_node(res);
405 IRN_VRFY_IRG(res, irg);
410 new_bd_Jmp (dbg_info *db, ir_node *block)
413 ir_graph *irg = current_ir_graph;
415 res = new_ir_node (db, irg, block, op_Jmp, mode_X, 0, NULL);
416 res = optimize_node (res);
417 IRN_VRFY_IRG (res, irg);
422 new_bd_IJmp (dbg_info *db, ir_node *block, ir_node *tgt)
425 ir_graph *irg = current_ir_graph;
427 res = new_ir_node (db, irg, block, op_IJmp, mode_X, 1, &tgt);
428 res = optimize_node (res);
429 IRN_VRFY_IRG (res, irg);
431 if (get_irn_op(res) == op_IJmp) /* still an IJmp */
437 new_bd_Cond (dbg_info *db, ir_node *block, ir_node *c)
440 ir_graph *irg = current_ir_graph;
442 res = new_ir_node (db, irg, block, op_Cond, mode_T, 1, &c);
443 res->attr.c.kind = dense;
444 res->attr.c.default_proj = 0;
445 res->attr.c.pred = COND_JMP_PRED_NONE;
446 res = optimize_node (res);
447 IRN_VRFY_IRG(res, irg);
452 new_bd_Call (dbg_info *db, ir_node *block, ir_node *store,
453 ir_node *callee, int arity, ir_node **in, ir_type *tp)
458 ir_graph *irg = current_ir_graph;
461 NEW_ARR_A(ir_node *, r_in, r_arity);
464 memcpy(&r_in[2], in, sizeof(ir_node *) * arity);
466 res = new_ir_node(db, irg, block, op_Call, mode_T, r_arity, r_in);
468 assert((get_unknown_type() == tp) || is_Method_type(tp));
469 set_Call_type(res, tp);
470 res->attr.call.exc.pin_state = op_pin_state_pinned;
471 res->attr.call.callee_arr = NULL;
472 res = optimize_node(res);
473 IRN_VRFY_IRG(res, irg);
478 new_bd_Return (dbg_info *db, ir_node *block,
479 ir_node *store, int arity, ir_node **in)
484 ir_graph *irg = current_ir_graph;
487 NEW_ARR_A (ir_node *, r_in, r_arity);
489 memcpy(&r_in[1], in, sizeof(ir_node *) * arity);
490 res = new_ir_node(db, irg, block, op_Return, mode_X, r_arity, r_in);
491 res = optimize_node(res);
492 IRN_VRFY_IRG(res, irg);
497 new_bd_Load (dbg_info *db, ir_node *block,
498 ir_node *store, ir_node *adr, ir_mode *mode)
502 ir_graph *irg = current_ir_graph;
506 res = new_ir_node(db, irg, block, op_Load, mode_T, 2, in);
507 res->attr.load.exc.pin_state = op_pin_state_pinned;
508 res->attr.load.load_mode = mode;
509 res->attr.load.volatility = volatility_non_volatile;
510 res = optimize_node(res);
511 IRN_VRFY_IRG(res, irg);
516 new_bd_Store (dbg_info *db, ir_node *block,
517 ir_node *store, ir_node *adr, ir_node *val)
521 ir_graph *irg = current_ir_graph;
526 res = new_ir_node(db, irg, block, op_Store, mode_T, 3, in);
527 res->attr.store.exc.pin_state = op_pin_state_pinned;
528 res->attr.store.volatility = volatility_non_volatile;
529 res = optimize_node(res);
530 IRN_VRFY_IRG(res, irg);
535 new_bd_Alloc (dbg_info *db, ir_node *block, ir_node *store,
536 ir_node *size, ir_type *alloc_type, where_alloc where)
540 ir_graph *irg = current_ir_graph;
544 res = new_ir_node(db, irg, block, op_Alloc, mode_T, 2, in);
545 res->attr.a.exc.pin_state = op_pin_state_pinned;
546 res->attr.a.where = where;
547 res->attr.a.type = alloc_type;
548 res = optimize_node(res);
549 IRN_VRFY_IRG(res, irg);
554 new_bd_Free (dbg_info *db, ir_node *block, ir_node *store,
555 ir_node *ptr, ir_node *size, ir_type *free_type, where_alloc where)
559 ir_graph *irg = current_ir_graph;
564 res = new_ir_node (db, irg, block, op_Free, mode_M, 3, in);
565 res->attr.f.where = where;
566 res->attr.f.type = free_type;
567 res = optimize_node(res);
568 IRN_VRFY_IRG(res, irg);
573 new_bd_Sel (dbg_info *db, ir_node *block, ir_node *store, ir_node *objptr,
574 int arity, ir_node **in, entity *ent)
579 ir_graph *irg = current_ir_graph;
581 assert(ent != NULL && is_entity(ent) && "entity expected in Sel construction");
584 NEW_ARR_A(ir_node *, r_in, r_arity); /* uses alloca */
587 memcpy(&r_in[2], in, sizeof(ir_node *) * arity);
589 * FIXM: Sel's can select functions which should be of mode mode_P_code.
591 res = new_ir_node(db, irg, block, op_Sel, mode_P_data, r_arity, r_in);
592 res->attr.s.ent = ent;
593 res = optimize_node(res);
594 IRN_VRFY_IRG(res, irg);
599 new_bd_SymConst_type (dbg_info *db, ir_node *block, symconst_symbol value,
600 symconst_kind symkind, ir_type *tp) {
603 ir_graph *irg = current_ir_graph;
605 if ((symkind == symconst_addr_name) || (symkind == symconst_addr_ent))
606 mode = mode_P_data; /* FIXME: can be mode_P_code */
610 res = new_ir_node(db, irg, block, op_SymConst, mode, 0, NULL);
612 res->attr.i.num = symkind;
613 res->attr.i.sym = value;
616 res = optimize_node(res);
617 IRN_VRFY_IRG(res, irg);
622 new_bd_SymConst (dbg_info *db, ir_node *block, symconst_symbol value,
623 symconst_kind symkind)
625 ir_graph *irg = current_ir_graph;
627 ir_node *res = new_rd_SymConst_type(db, irg, block, value, symkind, firm_unknown_type);
632 new_bd_Sync (dbg_info *db, ir_node *block, int arity, ir_node **in)
635 ir_graph *irg = current_ir_graph;
637 res = new_ir_node(db, irg, block, op_Sync, mode_M, arity, in);
638 res = optimize_node(res);
639 IRN_VRFY_IRG(res, irg);
644 new_bd_Confirm (dbg_info *db, ir_node *block, ir_node *val, ir_node *bound, pn_Cmp cmp)
646 ir_node *in[2], *res;
647 ir_graph *irg = current_ir_graph;
651 res = new_ir_node (db, irg, block, op_Confirm, get_irn_mode(val), 2, in);
652 res->attr.confirm_cmp = cmp;
653 res = optimize_node (res);
654 IRN_VRFY_IRG(res, irg);
658 /* this function is often called with current_ir_graph unset */
660 new_bd_Unknown (ir_mode *m)
663 ir_graph *irg = current_ir_graph;
665 res = new_ir_node(NULL, irg, get_irg_start_block(irg), op_Unknown, m, 0, NULL);
666 res = optimize_node(res);
671 new_bd_CallBegin (dbg_info *db, ir_node *block, ir_node *call)
675 ir_graph *irg = current_ir_graph;
677 in[0] = get_Call_ptr(call);
678 res = new_ir_node(db, irg, block, op_CallBegin, mode_T, 1, in);
679 /* res->attr.callbegin.irg = irg; */
680 res->attr.callbegin.call = call;
681 res = optimize_node(res);
682 IRN_VRFY_IRG(res, irg);
687 new_bd_EndReg (dbg_info *db, ir_node *block)
690 ir_graph *irg = current_ir_graph;
692 res = new_ir_node(db, irg, block, op_EndReg, mode_T, -1, NULL);
693 set_irg_end_reg(irg, res);
694 IRN_VRFY_IRG(res, irg);
699 new_bd_EndExcept (dbg_info *db, ir_node *block)
702 ir_graph *irg = current_ir_graph;
704 res = new_ir_node(db, irg, block, op_EndExcept, mode_T, -1, NULL);
705 set_irg_end_except(irg, res);
706 IRN_VRFY_IRG (res, irg);
711 new_bd_Break (dbg_info *db, ir_node *block)
714 ir_graph *irg = current_ir_graph;
716 res = new_ir_node(db, irg, block, op_Break, mode_X, 0, NULL);
717 res = optimize_node(res);
718 IRN_VRFY_IRG(res, irg);
723 new_bd_Filter (dbg_info *db, ir_node *block, ir_node *arg, ir_mode *mode,
727 ir_graph *irg = current_ir_graph;
729 res = new_ir_node(db, irg, block, op_Filter, mode, 1, &arg);
730 res->attr.filter.proj = proj;
731 res->attr.filter.in_cg = NULL;
732 res->attr.filter.backedge = NULL;
735 assert(get_Proj_pred(res));
736 assert(get_nodes_block(get_Proj_pred(res)));
738 res = optimize_node(res);
739 IRN_VRFY_IRG(res, irg);
744 new_bd_Mux (dbg_info *db, ir_node *block,
745 ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode)
749 ir_graph *irg = current_ir_graph;
755 res = new_ir_node(db, irg, block, op_Mux, mode, 3, in);
758 res = optimize_node(res);
759 IRN_VRFY_IRG(res, irg);
764 new_bd_Psi (dbg_info *db, ir_node *block,
765 int arity, ir_node *cond[], ir_node *vals[], ir_mode *mode)
769 ir_graph *irg = current_ir_graph;
772 NEW_ARR_A(ir_node *, in, 2 * arity + 1);
774 for (i = 0; i < arity; ++i) {
776 in[2 * i + 1] = vals[i];
780 res = new_ir_node(db, irg, block, op_Psi, mode, 2 * arity + 1, in);
783 res = optimize_node(res);
784 IRN_VRFY_IRG(res, irg);
789 new_bd_CopyB (dbg_info *db, ir_node *block,
790 ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type)
794 ir_graph *irg = current_ir_graph;
800 res = new_ir_node(db, irg, block, op_CopyB, mode_T, 3, in);
802 res->attr.copyb.exc.pin_state = op_pin_state_pinned;
803 res->attr.copyb.data_type = data_type;
804 res = optimize_node(res);
805 IRN_VRFY_IRG(res, irg);
810 new_bd_InstOf (dbg_info *db, ir_node *block, ir_node *store,
811 ir_node *objptr, ir_type *type)
815 ir_graph *irg = current_ir_graph;
819 res = new_ir_node(db, irg, block, op_Sel, mode_T, 2, in);
820 res->attr.io.type = type;
821 res = optimize_node(res);
822 IRN_VRFY_IRG(res, irg);
827 new_bd_Raise (dbg_info *db, ir_node *block, ir_node *store, ir_node *obj)
831 ir_graph *irg = current_ir_graph;
835 res = new_ir_node(db, irg, block, op_Raise, mode_T, 2, in);
836 res = optimize_node(res);
837 IRN_VRFY_IRG(res, irg);
842 new_bd_Bound (dbg_info *db, ir_node *block,
843 ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper)
847 ir_graph *irg = current_ir_graph;
853 res = new_ir_node(db, irg, block, op_Bound, mode_T, 4, in);
854 res->attr.bound.exc.pin_state = op_pin_state_pinned;
855 res = optimize_node(res);
856 IRN_VRFY_IRG(res, irg);
860 /* --------------------------------------------- */
861 /* private interfaces, for professional use only */
862 /* --------------------------------------------- */
864 /* Constructs a Block with a fixed number of predecessors.
865 Does not set current_block. Can not be used with automatic
866 Phi node construction. */
868 new_rd_Block (dbg_info *db, ir_graph *irg, int arity, ir_node **in)
870 ir_graph *rem = current_ir_graph;
873 current_ir_graph = irg;
874 res = new_bd_Block (db, arity, in);
875 current_ir_graph = rem;
881 new_rd_Start (dbg_info *db, ir_graph *irg, ir_node *block)
883 ir_graph *rem = current_ir_graph;
886 current_ir_graph = irg;
887 res = new_bd_Start (db, block);
888 current_ir_graph = rem;
894 new_rd_End (dbg_info *db, ir_graph *irg, ir_node *block)
897 ir_graph *rem = current_ir_graph;
899 current_ir_graph = rem;
900 res = new_bd_End (db, block);
901 current_ir_graph = rem;
906 /* Creates a Phi node with all predecessors. Calling this constructor
907 is only allowed if the corresponding block is mature. */
909 new_rd_Phi (dbg_info *db, ir_graph *irg, ir_node *block, int arity, ir_node **in, ir_mode *mode)
912 ir_graph *rem = current_ir_graph;
914 current_ir_graph = irg;
915 res = new_bd_Phi (db, block,arity, in, mode);
916 current_ir_graph = rem;
922 new_rd_Const_type (dbg_info *db, ir_graph *irg, ir_node *block, ir_mode *mode, tarval *con, ir_type *tp)
925 ir_graph *rem = current_ir_graph;
927 current_ir_graph = irg;
928 res = new_bd_Const_type (db, block, mode, con, tp);
929 current_ir_graph = rem;
935 new_rd_Const (dbg_info *db, ir_graph *irg, ir_node *block, ir_mode *mode, tarval *con)
938 ir_graph *rem = current_ir_graph;
940 current_ir_graph = irg;
941 res = new_bd_Const_type (db, block, mode, con, firm_unknown_type);
942 current_ir_graph = rem;
948 new_rd_Const_long (dbg_info *db, ir_graph *irg, ir_node *block, ir_mode *mode, long value)
950 return new_rd_Const(db, irg, block, mode, new_tarval_from_long(value, mode));
954 new_rd_Id (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *val, ir_mode *mode)
957 ir_graph *rem = current_ir_graph;
959 current_ir_graph = irg;
960 res = new_bd_Id(db, block, val, mode);
961 current_ir_graph = rem;
967 new_rd_Proj (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode,
971 ir_graph *rem = current_ir_graph;
973 current_ir_graph = irg;
974 res = new_bd_Proj(db, block, arg, mode, proj);
975 current_ir_graph = rem;
981 new_rd_defaultProj (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *arg,
985 ir_graph *rem = current_ir_graph;
987 current_ir_graph = irg;
988 res = new_bd_defaultProj(db, block, arg, max_proj);
989 current_ir_graph = rem;
995 new_rd_Conv (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode)
998 ir_graph *rem = current_ir_graph;
1000 current_ir_graph = irg;
1001 res = new_bd_Conv(db, block, op, mode);
1002 current_ir_graph = rem;
1008 new_rd_Cast (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *op, ir_type *to_tp)
1011 ir_graph *rem = current_ir_graph;
1013 current_ir_graph = irg;
1014 res = new_bd_Cast(db, block, op, to_tp);
1015 current_ir_graph = rem;
1021 new_rd_Tuple (dbg_info *db, ir_graph *irg, ir_node *block, int arity, ir_node **in)
1024 ir_graph *rem = current_ir_graph;
1026 current_ir_graph = irg;
1027 res = new_bd_Tuple(db, block, arity, in);
1028 current_ir_graph = rem;
1038 NEW_RD_DIVOP(DivMod)
1051 NEW_RD_BINOP(Borrow)
1054 new_rd_Cmp (dbg_info *db, ir_graph *irg, ir_node *block,
1055 ir_node *op1, ir_node *op2)
1058 ir_graph *rem = current_ir_graph;
1060 current_ir_graph = irg;
1061 res = new_bd_Cmp(db, block, op1, op2);
1062 current_ir_graph = rem;
1068 new_rd_Jmp (dbg_info *db, ir_graph *irg, ir_node *block)
1071 ir_graph *rem = current_ir_graph;
1073 current_ir_graph = irg;
1074 res = new_bd_Jmp(db, block);
1075 current_ir_graph = rem;
1081 new_rd_IJmp (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *tgt)
1084 ir_graph *rem = current_ir_graph;
1086 current_ir_graph = irg;
1087 res = new_bd_IJmp(db, block, tgt);
1088 current_ir_graph = rem;
1094 new_rd_Cond (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *c)
1097 ir_graph *rem = current_ir_graph;
1099 current_ir_graph = irg;
1100 res = new_bd_Cond(db, block, c);
1101 current_ir_graph = rem;
1107 new_rd_Call (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
1108 ir_node *callee, int arity, ir_node **in, ir_type *tp)
1111 ir_graph *rem = current_ir_graph;
1113 current_ir_graph = irg;
1114 res = new_bd_Call(db, block, store, callee, arity, in, tp);
1115 current_ir_graph = rem;
1121 new_rd_Return (dbg_info *db, ir_graph *irg, ir_node *block,
1122 ir_node *store, int arity, ir_node **in)
1125 ir_graph *rem = current_ir_graph;
1127 current_ir_graph = irg;
1128 res = new_bd_Return(db, block, store, arity, in);
1129 current_ir_graph = rem;
1135 new_rd_Load (dbg_info *db, ir_graph *irg, ir_node *block,
1136 ir_node *store, ir_node *adr, ir_mode *mode)
1139 ir_graph *rem = current_ir_graph;
1141 current_ir_graph = irg;
1142 res = new_bd_Load(db, block, store, adr, mode);
1143 current_ir_graph = rem;
1149 new_rd_Store (dbg_info *db, ir_graph *irg, ir_node *block,
1150 ir_node *store, ir_node *adr, ir_node *val)
1153 ir_graph *rem = current_ir_graph;
1155 current_ir_graph = irg;
1156 res = new_bd_Store(db, block, store, adr, val);
1157 current_ir_graph = rem;
1163 new_rd_Alloc (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
1164 ir_node *size, ir_type *alloc_type, where_alloc where)
1167 ir_graph *rem = current_ir_graph;
1169 current_ir_graph = irg;
1170 res = new_bd_Alloc (db, block, store, size, alloc_type, where);
1171 current_ir_graph = rem;
1177 new_rd_Free (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
1178 ir_node *ptr, ir_node *size, ir_type *free_type, where_alloc where)
1181 ir_graph *rem = current_ir_graph;
1183 current_ir_graph = irg;
1184 res = new_bd_Free(db, block, store, ptr, size, free_type, where);
1185 current_ir_graph = rem;
1191 new_rd_simpleSel (dbg_info *db, ir_graph *irg, ir_node *block,
1192 ir_node *store, ir_node *objptr, entity *ent)
1195 ir_graph *rem = current_ir_graph;
1197 current_ir_graph = irg;
1198 res = new_bd_Sel(db, block, store, objptr, 0, NULL, ent);
1199 current_ir_graph = rem;
1205 new_rd_Sel (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, ir_node *objptr,
1206 int arity, ir_node **in, entity *ent)
1209 ir_graph *rem = current_ir_graph;
1211 current_ir_graph = irg;
1212 res = new_bd_Sel(db, block, store, objptr, arity, in, ent);
1213 current_ir_graph = rem;
1219 new_rd_SymConst_type (dbg_info *db, ir_graph *irg, ir_node *block, symconst_symbol value,
1220 symconst_kind symkind, ir_type *tp)
1223 ir_graph *rem = current_ir_graph;
1225 current_ir_graph = irg;
1226 res = new_bd_SymConst_type(db, block, value, symkind, tp);
1227 current_ir_graph = rem;
1233 new_rd_SymConst (dbg_info *db, ir_graph *irg, ir_node *block, symconst_symbol value,
1234 symconst_kind symkind)
1236 ir_node *res = new_rd_SymConst_type(db, irg, block, value, symkind, firm_unknown_type);
1240 ir_node *new_rd_SymConst_addr_ent (dbg_info *db, ir_graph *irg, entity *symbol, ir_type *tp)
1242 symconst_symbol sym = {(ir_type *)symbol};
1243 return new_rd_SymConst_type(db, irg, get_irg_start_block(irg), sym, symconst_addr_ent, tp);
1246 ir_node *new_rd_SymConst_addr_name (dbg_info *db, ir_graph *irg, ident *symbol, ir_type *tp) {
1247 symconst_symbol sym = {(ir_type *)symbol};
1248 return new_rd_SymConst_type(db, irg, get_irg_start_block(irg), sym, symconst_addr_name, tp);
1251 ir_node *new_rd_SymConst_type_tag (dbg_info *db, ir_graph *irg, ir_type *symbol, ir_type *tp) {
1252 symconst_symbol sym = {symbol};
1253 return new_rd_SymConst_type(db, irg, get_irg_start_block(irg), sym, symconst_type_tag, tp);
1256 ir_node *new_rd_SymConst_size (dbg_info *db, ir_graph *irg, ir_type *symbol, ir_type *tp) {
1257 symconst_symbol sym = {symbol};
1258 return new_rd_SymConst_type(db, irg, get_irg_start_block(irg), sym, symconst_size, tp);
1262 new_rd_Sync (dbg_info *db, ir_graph *irg, ir_node *block, int arity, ir_node **in)
1265 ir_graph *rem = current_ir_graph;
1267 current_ir_graph = irg;
1268 res = new_bd_Sync(db, block, arity, in);
1269 current_ir_graph = rem;
1275 new_rd_Bad (ir_graph *irg) {
1276 return get_irg_bad(irg);
1280 new_rd_Confirm (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *val, ir_node *bound, pn_Cmp cmp)
1283 ir_graph *rem = current_ir_graph;
1285 current_ir_graph = irg;
1286 res = new_bd_Confirm(db, block, val, bound, cmp);
1287 current_ir_graph = rem;
1292 /* this function is often called with current_ir_graph unset */
1294 new_rd_Unknown (ir_graph *irg, ir_mode *m)
1297 ir_graph *rem = current_ir_graph;
1299 current_ir_graph = irg;
1300 res = new_bd_Unknown(m);
1301 current_ir_graph = rem;
1307 new_rd_CallBegin (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *call)
1310 ir_graph *rem = current_ir_graph;
1312 current_ir_graph = irg;
1313 res = new_bd_CallBegin(db, block, call);
1314 current_ir_graph = rem;
1320 new_rd_EndReg (dbg_info *db, ir_graph *irg, ir_node *block)
1324 res = new_ir_node(db, irg, block, op_EndReg, mode_T, -1, NULL);
1325 set_irg_end_reg(irg, res);
1326 IRN_VRFY_IRG(res, irg);
1331 new_rd_EndExcept (dbg_info *db, ir_graph *irg, ir_node *block)
1335 res = new_ir_node(db, irg, block, op_EndExcept, mode_T, -1, NULL);
1336 set_irg_end_except(irg, res);
1337 IRN_VRFY_IRG (res, irg);
1342 new_rd_Break (dbg_info *db, ir_graph *irg, ir_node *block)
1345 ir_graph *rem = current_ir_graph;
1347 current_ir_graph = irg;
1348 res = new_bd_Break(db, block);
1349 current_ir_graph = rem;
1355 new_rd_Filter (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode,
1359 ir_graph *rem = current_ir_graph;
1361 current_ir_graph = irg;
1362 res = new_bd_Filter(db, block, arg, mode, proj);
1363 current_ir_graph = rem;
1369 new_rd_NoMem (ir_graph *irg) {
1370 return get_irg_no_mem(irg);
1374 new_rd_Mux (dbg_info *db, ir_graph *irg, ir_node *block,
1375 ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode)
1378 ir_graph *rem = current_ir_graph;
1380 current_ir_graph = irg;
1381 res = new_bd_Mux(db, block, sel, ir_false, ir_true, mode);
1382 current_ir_graph = rem;
1388 new_rd_Psi (dbg_info *db, ir_graph *irg, ir_node *block,
1389 int arity, ir_node *cond[], ir_node *vals[], ir_mode *mode)
1392 ir_graph *rem = current_ir_graph;
1394 current_ir_graph = irg;
1395 res = new_bd_Psi(db, block, arity, cond, vals, mode);
1396 current_ir_graph = rem;
1401 ir_node *new_rd_CopyB(dbg_info *db, ir_graph *irg, ir_node *block,
1402 ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type)
1405 ir_graph *rem = current_ir_graph;
1407 current_ir_graph = irg;
1408 res = new_bd_CopyB(db, block, store, dst, src, data_type);
1409 current_ir_graph = rem;
1415 new_rd_InstOf (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store,
1416 ir_node *objptr, ir_type *type)
1419 ir_graph *rem = current_ir_graph;
1421 current_ir_graph = irg;
1422 res = new_bd_InstOf(db, block, store, objptr, type);
1423 current_ir_graph = rem;
1429 new_rd_Raise (dbg_info *db, ir_graph *irg, ir_node *block, ir_node *store, ir_node *obj)
1432 ir_graph *rem = current_ir_graph;
1434 current_ir_graph = irg;
1435 res = new_bd_Raise(db, block, store, obj);
1436 current_ir_graph = rem;
1441 ir_node *new_rd_Bound(dbg_info *db, ir_graph *irg, ir_node *block,
1442 ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper)
1445 ir_graph *rem = current_ir_graph;
1447 current_ir_graph = irg;
1448 res = new_bd_Bound(db, block, store, idx, lower, upper);
1449 current_ir_graph = rem;
1454 ir_node *new_r_Block (ir_graph *irg, int arity, ir_node **in) {
1455 return new_rd_Block(NULL, irg, arity, in);
1457 ir_node *new_r_Start (ir_graph *irg, ir_node *block) {
1458 return new_rd_Start(NULL, irg, block);
1460 ir_node *new_r_End (ir_graph *irg, ir_node *block) {
1461 return new_rd_End(NULL, irg, block);
1463 ir_node *new_r_Jmp (ir_graph *irg, ir_node *block) {
1464 return new_rd_Jmp(NULL, irg, block);
1466 ir_node *new_r_IJmp (ir_graph *irg, ir_node *block, ir_node *tgt) {
1467 return new_rd_IJmp(NULL, irg, block, tgt);
1469 ir_node *new_r_Cond (ir_graph *irg, ir_node *block, ir_node *c) {
1470 return new_rd_Cond(NULL, irg, block, c);
1472 ir_node *new_r_Return (ir_graph *irg, ir_node *block,
1473 ir_node *store, int arity, ir_node **in) {
1474 return new_rd_Return(NULL, irg, block, store, arity, in);
1476 ir_node *new_r_Const (ir_graph *irg, ir_node *block,
1477 ir_mode *mode, tarval *con) {
1478 return new_rd_Const(NULL, irg, block, mode, con);
1480 ir_node *new_r_Const_long(ir_graph *irg, ir_node *block,
1481 ir_mode *mode, long value) {
1482 return new_rd_Const_long(NULL, irg, block, mode, value);
1484 ir_node *new_r_Const_type(ir_graph *irg, ir_node *block,
1485 ir_mode *mode, tarval *con, ir_type *tp) {
1486 return new_rd_Const_type(NULL, irg, block, mode, con, tp);
1488 ir_node *new_r_SymConst (ir_graph *irg, ir_node *block,
1489 symconst_symbol value, symconst_kind symkind) {
1490 return new_rd_SymConst(NULL, irg, block, value, symkind);
1492 ir_node *new_r_simpleSel(ir_graph *irg, ir_node *block, ir_node *store,
1493 ir_node *objptr, entity *ent) {
1494 return new_rd_Sel(NULL, irg, block, store, objptr, 0, NULL, ent);
1496 ir_node *new_r_Sel (ir_graph *irg, ir_node *block, ir_node *store,
1497 ir_node *objptr, int n_index, ir_node **index,
1499 return new_rd_Sel(NULL, irg, block, store, objptr, n_index, index, ent);
1501 ir_node *new_r_Call (ir_graph *irg, ir_node *block, ir_node *store,
1502 ir_node *callee, int arity, ir_node **in,
1504 return new_rd_Call(NULL, irg, block, store, callee, arity, in, tp);
1506 ir_node *new_r_Add (ir_graph *irg, ir_node *block,
1507 ir_node *op1, ir_node *op2, ir_mode *mode) {
1508 return new_rd_Add(NULL, irg, block, op1, op2, mode);
1510 ir_node *new_r_Sub (ir_graph *irg, ir_node *block,
1511 ir_node *op1, ir_node *op2, ir_mode *mode) {
1512 return new_rd_Sub(NULL, irg, block, op1, op2, mode);
1514 ir_node *new_r_Minus (ir_graph *irg, ir_node *block,
1515 ir_node *op, ir_mode *mode) {
1516 return new_rd_Minus(NULL, irg, block, op, mode);
1518 ir_node *new_r_Mul (ir_graph *irg, ir_node *block,
1519 ir_node *op1, ir_node *op2, ir_mode *mode) {
1520 return new_rd_Mul(NULL, irg, block, op1, op2, mode);
1522 ir_node *new_r_Quot (ir_graph *irg, ir_node *block,
1523 ir_node *memop, ir_node *op1, ir_node *op2) {
1524 return new_rd_Quot(NULL, irg, block, memop, op1, op2);
1526 ir_node *new_r_DivMod (ir_graph *irg, ir_node *block,
1527 ir_node *memop, ir_node *op1, ir_node *op2) {
1528 return new_rd_DivMod(NULL, irg, block, memop, op1, op2);
1530 ir_node *new_r_Div (ir_graph *irg, ir_node *block,
1531 ir_node *memop, ir_node *op1, ir_node *op2) {
1532 return new_rd_Div(NULL, irg, block, memop, op1, op2);
1534 ir_node *new_r_Mod (ir_graph *irg, ir_node *block,
1535 ir_node *memop, ir_node *op1, ir_node *op2) {
1536 return new_rd_Mod(NULL, irg, block, memop, op1, op2);
1538 ir_node *new_r_Abs (ir_graph *irg, ir_node *block,
1539 ir_node *op, ir_mode *mode) {
1540 return new_rd_Abs(NULL, irg, block, op, mode);
1542 ir_node *new_r_And (ir_graph *irg, ir_node *block,
1543 ir_node *op1, ir_node *op2, ir_mode *mode) {
1544 return new_rd_And(NULL, irg, block, op1, op2, mode);
1546 ir_node *new_r_Or (ir_graph *irg, ir_node *block,
1547 ir_node *op1, ir_node *op2, ir_mode *mode) {
1548 return new_rd_Or(NULL, irg, block, op1, op2, mode);
1550 ir_node *new_r_Eor (ir_graph *irg, ir_node *block,
1551 ir_node *op1, ir_node *op2, ir_mode *mode) {
1552 return new_rd_Eor(NULL, irg, block, op1, op2, mode);
1554 ir_node *new_r_Not (ir_graph *irg, ir_node *block,
1555 ir_node *op, ir_mode *mode) {
1556 return new_rd_Not(NULL, irg, block, op, mode);
1558 ir_node *new_r_Shl (ir_graph *irg, ir_node *block,
1559 ir_node *op, ir_node *k, ir_mode *mode) {
1560 return new_rd_Shl(NULL, irg, block, op, k, mode);
1562 ir_node *new_r_Shr (ir_graph *irg, ir_node *block,
1563 ir_node *op, ir_node *k, ir_mode *mode) {
1564 return new_rd_Shr(NULL, irg, block, op, k, mode);
1566 ir_node *new_r_Shrs (ir_graph *irg, ir_node *block,
1567 ir_node *op, ir_node *k, ir_mode *mode) {
1568 return new_rd_Shrs(NULL, irg, block, op, k, mode);
1570 ir_node *new_r_Rot (ir_graph *irg, ir_node *block,
1571 ir_node *op, ir_node *k, ir_mode *mode) {
1572 return new_rd_Rot(NULL, irg, block, op, k, mode);
1574 ir_node *new_r_Carry (ir_graph *irg, ir_node *block,
1575 ir_node *op, ir_node *k, ir_mode *mode) {
1576 return new_rd_Carry(NULL, irg, block, op, k, mode);
1578 ir_node *new_r_Borrow (ir_graph *irg, ir_node *block,
1579 ir_node *op, ir_node *k, ir_mode *mode) {
1580 return new_rd_Borrow(NULL, irg, block, op, k, mode);
1582 ir_node *new_r_Cmp (ir_graph *irg, ir_node *block,
1583 ir_node *op1, ir_node *op2) {
1584 return new_rd_Cmp(NULL, irg, block, op1, op2);
1586 ir_node *new_r_Conv (ir_graph *irg, ir_node *block,
1587 ir_node *op, ir_mode *mode) {
1588 return new_rd_Conv(NULL, irg, block, op, mode);
1590 ir_node *new_r_Cast (ir_graph *irg, ir_node *block, ir_node *op, ir_type *to_tp) {
1591 return new_rd_Cast(NULL, irg, block, op, to_tp);
1593 ir_node *new_r_Phi (ir_graph *irg, ir_node *block, int arity,
1594 ir_node **in, ir_mode *mode) {
1595 return new_rd_Phi(NULL, irg, block, arity, in, mode);
1597 ir_node *new_r_Load (ir_graph *irg, ir_node *block,
1598 ir_node *store, ir_node *adr, ir_mode *mode) {
1599 return new_rd_Load(NULL, irg, block, store, adr, mode);
1601 ir_node *new_r_Store (ir_graph *irg, ir_node *block,
1602 ir_node *store, ir_node *adr, ir_node *val) {
1603 return new_rd_Store(NULL, irg, block, store, adr, val);
1605 ir_node *new_r_Alloc (ir_graph *irg, ir_node *block, ir_node *store,
1606 ir_node *size, ir_type *alloc_type, where_alloc where) {
1607 return new_rd_Alloc(NULL, irg, block, store, size, alloc_type, where);
1609 ir_node *new_r_Free (ir_graph *irg, ir_node *block, ir_node *store,
1610 ir_node *ptr, ir_node *size, ir_type *free_type, where_alloc where) {
1611 return new_rd_Free(NULL, irg, block, store, ptr, size, free_type, where);
1613 ir_node *new_r_Sync (ir_graph *irg, ir_node *block, int arity, ir_node **in) {
1614 return new_rd_Sync(NULL, irg, block, arity, in);
1616 ir_node *new_r_Proj (ir_graph *irg, ir_node *block, ir_node *arg,
1617 ir_mode *mode, long proj) {
1618 return new_rd_Proj(NULL, irg, block, arg, mode, proj);
1620 ir_node *new_r_defaultProj (ir_graph *irg, ir_node *block, ir_node *arg,
1622 return new_rd_defaultProj(NULL, irg, block, arg, max_proj);
1624 ir_node *new_r_Tuple (ir_graph *irg, ir_node *block,
1625 int arity, ir_node **in) {
1626 return new_rd_Tuple(NULL, irg, block, arity, in );
1628 ir_node *new_r_Id (ir_graph *irg, ir_node *block,
1629 ir_node *val, ir_mode *mode) {
1630 return new_rd_Id(NULL, irg, block, val, mode);
1632 ir_node *new_r_Bad (ir_graph *irg) {
1633 return new_rd_Bad(irg);
1635 ir_node *new_r_Confirm (ir_graph *irg, ir_node *block, ir_node *val, ir_node *bound, pn_Cmp cmp) {
1636 return new_rd_Confirm (NULL, irg, block, val, bound, cmp);
1638 ir_node *new_r_Unknown (ir_graph *irg, ir_mode *m) {
1639 return new_rd_Unknown(irg, m);
1641 ir_node *new_r_CallBegin (ir_graph *irg, ir_node *block, ir_node *callee) {
1642 return new_rd_CallBegin(NULL, irg, block, callee);
1644 ir_node *new_r_EndReg (ir_graph *irg, ir_node *block) {
1645 return new_rd_EndReg(NULL, irg, block);
1647 ir_node *new_r_EndExcept (ir_graph *irg, ir_node *block) {
1648 return new_rd_EndExcept(NULL, irg, block);
1650 ir_node *new_r_Break (ir_graph *irg, ir_node *block) {
1651 return new_rd_Break(NULL, irg, block);
1653 ir_node *new_r_Filter (ir_graph *irg, ir_node *block, ir_node *arg,
1654 ir_mode *mode, long proj) {
1655 return new_rd_Filter(NULL, irg, block, arg, mode, proj);
1657 ir_node *new_r_NoMem (ir_graph *irg) {
1658 return new_rd_NoMem(irg);
1660 ir_node *new_r_Mux (ir_graph *irg, ir_node *block,
1661 ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode) {
1662 return new_rd_Mux(NULL, irg, block, sel, ir_false, ir_true, mode);
1664 ir_node *new_r_Psi (ir_graph *irg, ir_node *block,
1665 int arity, ir_node *conds[], ir_node *vals[], ir_mode *mode) {
1666 return new_rd_Psi(NULL, irg, block, arity, conds, vals, mode);
1668 ir_node *new_r_CopyB(ir_graph *irg, ir_node *block,
1669 ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type) {
1670 return new_rd_CopyB(NULL, irg, block, store, dst, src, data_type);
1672 ir_node *new_r_InstOf (ir_graph *irg, ir_node *block, ir_node *store, ir_node *objptr,
1674 return (new_rd_InstOf (NULL, irg, block, store, objptr, type));
1676 ir_node *new_r_Raise (ir_graph *irg, ir_node *block,
1677 ir_node *store, ir_node *obj) {
1678 return new_rd_Raise(NULL, irg, block, store, obj);
1680 ir_node *new_r_Bound(ir_graph *irg, ir_node *block,
1681 ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper) {
1682 return new_rd_Bound(NULL, irg, block, store, idx, lower, upper);
1685 /** ********************/
1686 /** public interfaces */
1687 /** construction tools */
1691 * - create a new Start node in the current block
1693 * @return s - pointer to the created Start node
1698 new_d_Start (dbg_info *db)
1702 res = new_ir_node (db, current_ir_graph, current_ir_graph->current_block,
1703 op_Start, mode_T, 0, NULL);
1704 /* res->attr.start.irg = current_ir_graph; */
1706 res = optimize_node(res);
1707 IRN_VRFY_IRG(res, current_ir_graph);
1712 new_d_End (dbg_info *db)
1715 res = new_ir_node(db, current_ir_graph, current_ir_graph->current_block,
1716 op_End, mode_X, -1, NULL);
1717 res = optimize_node(res);
1718 IRN_VRFY_IRG(res, current_ir_graph);
1723 /* Constructs a Block with a fixed number of predecessors.
1724 Does set current_block. Can be used with automatic Phi
1725 node construction. */
1727 new_d_Block (dbg_info *db, int arity, ir_node **in)
1731 int has_unknown = 0;
1733 res = new_bd_Block(db, arity, in);
1735 /* Create and initialize array for Phi-node construction. */
1736 if (get_irg_phase_state(current_ir_graph) == phase_building) {
1737 res->attr.block.graph_arr = NEW_ARR_D(ir_node *, current_ir_graph->obst,
1738 current_ir_graph->n_loc);
1739 memset(res->attr.block.graph_arr, 0, sizeof(ir_node *)*current_ir_graph->n_loc);
1742 for (i = arity-1; i >= 0; i--)
1743 if (get_irn_op(in[i]) == op_Unknown) {
1748 if (!has_unknown) res = optimize_node(res);
1749 current_ir_graph->current_block = res;
1751 IRN_VRFY_IRG(res, current_ir_graph);
1756 /* ***********************************************************************/
1757 /* Methods necessary for automatic Phi node creation */
1759 ir_node *phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
1760 ir_node *get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
1761 ir_node *new_rd_Phi0 (ir_graph *irg, ir_node *block, ir_mode *mode)
1762 ir_node *new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode, ir_node **in, int ins)
1764 Call Graph: ( A ---> B == A "calls" B)
1766 get_value mature_immBlock
1774 get_r_value_internal |
1778 new_rd_Phi0 new_rd_Phi_in
1780 * *************************************************************************** */
1782 /** Creates a Phi node with 0 predecessors */
1783 static INLINE ir_node *
1784 new_rd_Phi0 (ir_graph *irg, ir_node *block, ir_mode *mode)
1788 res = new_ir_node(NULL, irg, block, op_Phi, mode, 0, NULL);
1789 IRN_VRFY_IRG(res, irg);
1793 /* There are two implementations of the Phi node construction. The first
1794 is faster, but does not work for blocks with more than 2 predecessors.
1795 The second works always but is slower and causes more unnecessary Phi
1797 Select the implementations by the following preprocessor flag set in
1799 #if USE_FAST_PHI_CONSTRUCTION
1801 /* This is a stack used for allocating and deallocating nodes in
1802 new_rd_Phi_in. The original implementation used the obstack
1803 to model this stack, now it is explicit. This reduces side effects.
1805 #if USE_EXPLICIT_PHI_IN_STACK
1807 new_Phi_in_stack(void) {
1810 res = (Phi_in_stack *) malloc ( sizeof (Phi_in_stack));
1812 res->stack = NEW_ARR_F (ir_node *, 0);
1819 free_Phi_in_stack(Phi_in_stack *s) {
1820 DEL_ARR_F(s->stack);
1824 free_to_Phi_in_stack(ir_node *phi) {
1825 if (ARR_LEN(current_ir_graph->Phi_in_stack->stack) ==
1826 current_ir_graph->Phi_in_stack->pos)
1827 ARR_APP1 (ir_node *, current_ir_graph->Phi_in_stack->stack, phi);
1829 current_ir_graph->Phi_in_stack->stack[current_ir_graph->Phi_in_stack->pos] = phi;
1831 (current_ir_graph->Phi_in_stack->pos)++;
1834 static INLINE ir_node *
1835 alloc_or_pop_from_Phi_in_stack(ir_graph *irg, ir_node *block, ir_mode *mode,
1836 int arity, ir_node **in) {
1838 ir_node **stack = current_ir_graph->Phi_in_stack->stack;
1839 int pos = current_ir_graph->Phi_in_stack->pos;
1843 /* We need to allocate a new node */
1844 res = new_ir_node (db, irg, block, op_Phi, mode, arity, in);
1845 res->attr.phi_backedge = new_backedge_arr(irg->obst, arity);
1847 /* reuse the old node and initialize it again. */
1850 assert (res->kind == k_ir_node);
1851 assert (res->op == op_Phi);
1855 assert (arity >= 0);
1856 /* ???!!! How to free the old in array?? Not at all: on obstack ?!! */
1857 res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
1859 memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
1861 (current_ir_graph->Phi_in_stack->pos)--;
1865 #endif /* USE_EXPLICIT_PHI_IN_STACK */
1867 /* Creates a Phi node with a given, fixed array **in of predecessors.
1868 If the Phi node is unnecessary, as the same value reaches the block
1869 through all control flow paths, it is eliminated and the value
1870 returned directly. This constructor is only intended for use in
1871 the automatic Phi node generation triggered by get_value or mature.
1872 The implementation is quite tricky and depends on the fact, that
1873 the nodes are allocated on a stack:
1874 The in array contains predecessors and NULLs. The NULLs appear,
1875 if get_r_value_internal, that computed the predecessors, reached
1876 the same block on two paths. In this case the same value reaches
1877 this block on both paths, there is no definition in between. We need
1878 not allocate a Phi where these path's merge, but we have to communicate
1879 this fact to the caller. This happens by returning a pointer to the
1880 node the caller _will_ allocate. (Yes, we predict the address. We can
1881 do so because the nodes are allocated on the obstack.) The caller then
1882 finds a pointer to itself and, when this routine is called again,
1885 static INLINE ir_node *
1886 new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode, ir_node **in, int ins)
1889 ir_node *res, *known;
1891 /* Allocate a new node on the obstack. This can return a node to
1892 which some of the pointers in the in-array already point.
1893 Attention: the constructor copies the in array, i.e., the later
1894 changes to the array in this routine do not affect the
1895 constructed node! If the in array contains NULLs, there will be
1896 missing predecessors in the returned node. Is this a possible
1897 internal state of the Phi node generation? */
1898 #if USE_EXPLICIT_PHI_IN_STACK
1899 res = known = alloc_or_pop_from_Phi_in_stack(irg, block, mode, ins, in);
1901 res = known = new_ir_node (NULL, irg, block, op_Phi, mode, ins, in);
1902 res->attr.phi_backedge = new_backedge_arr(irg->obst, ins);
1905 /* The in-array can contain NULLs. These were returned by
1906 get_r_value_internal if it reached the same block/definition on a
1907 second path. The NULLs are replaced by the node itself to
1908 simplify the test in the next loop. */
1909 for (i = 0; i < ins; ++i) {
1914 /* This loop checks whether the Phi has more than one predecessor.
1915 If so, it is a real Phi node and we break the loop. Else the Phi
1916 node merges the same definition on several paths and therefore is
1918 for (i = 0; i < ins; ++i) {
1919 if (in[i] == res || in[i] == known)
1928 /* i==ins: there is at most one predecessor, we don't need a phi node. */
1930 #if USE_EXPLICIT_PHI_IN_STACK
1931 free_to_Phi_in_stack(res);
1933 edges_node_deleted(res, current_ir_graph);
1934 obstack_free(current_ir_graph->obst, res);
1938 res = optimize_node (res);
1939 IRN_VRFY_IRG(res, irg);
1942 /* return the pointer to the Phi node. This node might be deallocated! */
1947 get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
1950 allocates and returns this node. The routine called to allocate the
1951 node might optimize it away and return a real value, or even a pointer
1952 to a deallocated Phi node on top of the obstack!
1953 This function is called with an in-array of proper size. **/
1955 phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
1957 ir_node *prevBlock, *res;
1960 /* This loop goes to all predecessor blocks of the block the Phi node is in
1961 and there finds the operands of the Phi node by calling
1962 get_r_value_internal. */
1963 for (i = 1; i <= ins; ++i) {
1964 assert (block->in[i]);
1965 prevBlock = block->in[i]->in[0]; /* go past control flow op to prev block */
1967 nin[i-1] = get_r_value_internal (prevBlock, pos, mode);
1970 /* After collecting all predecessors into the array nin a new Phi node
1971 with these predecessors is created. This constructor contains an
1972 optimization: If all predecessors of the Phi node are identical it
1973 returns the only operand instead of a new Phi node. If the value
1974 passes two different control flow edges without being defined, and
1975 this is the second path treated, a pointer to the node that will be
1976 allocated for the first path (recursion) is returned. We already
1977 know the address of this node, as it is the next node to be allocated
1978 and will be placed on top of the obstack. (The obstack is a _stack_!) */
1979 res = new_rd_Phi_in (current_ir_graph, block, mode, nin, ins);
1981 /* Now we now the value for "pos" and can enter it in the array with
1982 all known local variables. Attention: this might be a pointer to
1983 a node, that later will be allocated!!! See new_rd_Phi_in.
1984 If this is called in mature, after some set_value in the same block,
1985 the proper value must not be overwritten:
1987 get_value (makes Phi0, put's it into graph_arr)
1988 set_value (overwrites Phi0 in graph_arr)
1989 mature_immBlock (upgrades Phi0, puts it again into graph_arr, overwriting
1992 if (!block->attr.block.graph_arr[pos]) {
1993 block->attr.block.graph_arr[pos] = res;
1995 /* printf(" value already computed by %s\n",
1996 get_id_str(block->attr.block.graph_arr[pos]->op->name)); */
2002 /* This function returns the last definition of a variable. In case
2003 this variable was last defined in a previous block, Phi nodes are
2004 inserted. If the part of the firm graph containing the definition
2005 is not yet constructed, a dummy Phi node is returned. */
2007 get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
2010 /* There are 4 cases to treat.
2012 1. The block is not mature and we visit it the first time. We can not
2013 create a proper Phi node, therefore a Phi0, i.e., a Phi without
2014 predecessors is returned. This node is added to the linked list (field
2015 "link") of the containing block to be completed when this block is
2016 matured. (Completion will add a new Phi and turn the Phi0 into an Id
2019 2. The value is already known in this block, graph_arr[pos] is set and we
2020 visit the block the first time. We can return the value without
2021 creating any new nodes.
2023 3. The block is mature and we visit it the first time. A Phi node needs
2024 to be created (phi_merge). If the Phi is not needed, as all it's
2025 operands are the same value reaching the block through different
2026 paths, it's optimized away and the value itself is returned.
2028 4. The block is mature, and we visit it the second time. Now two
2029 subcases are possible:
2030 * The value was computed completely the last time we were here. This
2031 is the case if there is no loop. We can return the proper value.
2032 * The recursion that visited this node and set the flag did not
2033 return yet. We are computing a value in a loop and need to
2034 break the recursion without knowing the result yet.
2035 @@@ strange case. Straight forward we would create a Phi before
2036 starting the computation of it's predecessors. In this case we will
2037 find a Phi here in any case. The problem is that this implementation
2038 only creates a Phi after computing the predecessors, so that it is
2039 hard to compute self references of this Phi. @@@
2040 There is no simple check for the second subcase. Therefore we check
2041 for a second visit and treat all such cases as the second subcase.
2042 Anyways, the basic situation is the same: we reached a block
2043 on two paths without finding a definition of the value: No Phi
2044 nodes are needed on both paths.
2045 We return this information "Two paths, no Phi needed" by a very tricky
2046 implementation that relies on the fact that an obstack is a stack and
2047 will return a node with the same address on different allocations.
2048 Look also at phi_merge and new_rd_phi_in to understand this.
2049 @@@ Unfortunately this does not work, see testprogram
2050 three_cfpred_example.
2054 /* case 4 -- already visited. */
2055 if (get_irn_visited(block) == get_irg_visited(current_ir_graph)) return NULL;
2057 /* visited the first time */
2058 set_irn_visited(block, get_irg_visited(current_ir_graph));
2060 /* Get the local valid value */
2061 res = block->attr.block.graph_arr[pos];
2063 /* case 2 -- If the value is actually computed, return it. */
2064 if (res) return res;
2066 if (block->attr.block.matured) { /* case 3 */
2068 /* The Phi has the same amount of ins as the corresponding block. */
2069 int ins = get_irn_arity(block);
2071 NEW_ARR_A (ir_node *, nin, ins);
2073 /* Phi merge collects the predecessors and then creates a node. */
2074 res = phi_merge (block, pos, mode, nin, ins);
2076 } else { /* case 1 */
2077 /* The block is not mature, we don't know how many in's are needed. A Phi
2078 with zero predecessors is created. Such a Phi node is called Phi0
2079 node. (There is also an obsolete Phi0 opcode.) The Phi0 is then added
2080 to the list of Phi0 nodes in this block to be matured by mature_immBlock
2082 The Phi0 has to remember the pos of it's internal value. If the real
2083 Phi is computed, pos is used to update the array with the local
2086 res = new_rd_Phi0 (current_ir_graph, block, mode);
2087 res->attr.phi0_pos = pos;
2088 res->link = block->link;
2092 /* If we get here, the frontend missed a use-before-definition error */
2095 printf("Error: no value set. Use of undefined variable. Initializing to zero.\n");
2096 assert (mode->code >= irm_F && mode->code <= irm_P);
2097 res = new_rd_Const (NULL, current_ir_graph, block, mode,
2098 tarval_mode_null[mode->code]);
2101 /* The local valid value is available now. */
2102 block->attr.block.graph_arr[pos] = res;
2110 it starts the recursion. This causes an Id at the entry of
2111 every block that has no definition of the value! **/
2113 #if USE_EXPLICIT_PHI_IN_STACK
2115 Phi_in_stack * new_Phi_in_stack() { return NULL; }
2116 void free_Phi_in_stack(Phi_in_stack *s) { }
2119 static INLINE ir_node *
2120 new_rd_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
2121 ir_node **in, int ins, ir_node *phi0)
2124 ir_node *res, *known;
2126 /* Allocate a new node on the obstack. The allocation copies the in
2128 res = new_ir_node (NULL, irg, block, op_Phi, mode, ins, in);
2129 res->attr.phi_backedge = new_backedge_arr(irg->obst, ins);
2131 /* This loop checks whether the Phi has more than one predecessor.
2132 If so, it is a real Phi node and we break the loop. Else the
2133 Phi node merges the same definition on several paths and therefore
2134 is not needed. Don't consider Bad nodes! */
2136 for (i=0; i < ins; ++i)
2140 in[i] = skip_Id(in[i]); /* increases the number of freed Phis. */
2142 /* Optimize self referencing Phis: We can't detect them yet properly, as
2143 they still refer to the Phi0 they will replace. So replace right now. */
2144 if (phi0 && in[i] == phi0) in[i] = res;
2146 if (in[i]==res || in[i]==known || is_Bad(in[i])) continue;
2154 /* i==ins: there is at most one predecessor, we don't need a phi node. */
2157 edges_node_deleted(res, current_ir_graph);
2158 obstack_free (current_ir_graph->obst, res);
2159 if (is_Phi(known)) {
2160 /* If pred is a phi node we want to optimize it: If loops are matured in a bad
2161 order, an enclosing Phi know may get superfluous. */
2162 res = optimize_in_place_2(known);
2164 exchange(known, res);
2170 /* A undefined value, e.g., in unreachable code. */
2174 res = optimize_node (res); /* This is necessary to add the node to the hash table for cse. */
2175 IRN_VRFY_IRG(res, irg);
2176 /* Memory Phis in endless loops must be kept alive.
2177 As we can't distinguish these easily we keep all of them alive. */
2178 if ((res->op == op_Phi) && (mode == mode_M))
2179 add_End_keepalive(get_irg_end(irg), res);
2186 get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
2188 #if PRECISE_EXC_CONTEXT
2190 phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins);
2192 /* Construct a new frag_array for node n.
2193 Copy the content from the current graph_arr of the corresponding block:
2194 this is the current state.
2195 Set ProjM(n) as current memory state.
2196 Further the last entry in frag_arr of current block points to n. This
2197 constructs a chain block->last_frag_op-> ... first_frag_op of all frag ops in the block.
2199 static INLINE ir_node ** new_frag_arr (ir_node *n)
2204 arr = NEW_ARR_D (ir_node *, current_ir_graph->obst, current_ir_graph->n_loc);
2205 memcpy(arr, current_ir_graph->current_block->attr.block.graph_arr,
2206 sizeof(ir_node *)*current_ir_graph->n_loc);
2208 /* turn off optimization before allocating Proj nodes, as res isn't
2210 opt = get_opt_optimize(); set_optimize(0);
2211 /* Here we rely on the fact that all frag ops have Memory as first result! */
2212 if (get_irn_op(n) == op_Call)
2213 arr[0] = new_Proj(n, mode_M, pn_Call_M_except);
2214 else if (get_irn_op(n) == op_CopyB)
2215 arr[0] = new_Proj(n, mode_M, pn_CopyB_M_except);
2216 else if (get_irn_op(n) == op_Bound)
2217 arr[0] = new_Proj(n, mode_M, pn_Bound_M_except);
2219 assert((pn_Quot_M == pn_DivMod_M) &&
2220 (pn_Quot_M == pn_Div_M) &&
2221 (pn_Quot_M == pn_Mod_M) &&
2222 (pn_Quot_M == pn_Load_M) &&
2223 (pn_Quot_M == pn_Store_M) &&
2224 (pn_Quot_M == pn_Alloc_M) );
2225 arr[0] = new_Proj(n, mode_M, pn_Alloc_M);
2229 current_ir_graph->current_block->attr.block.graph_arr[current_ir_graph->n_loc-1] = n;
2234 * returns the frag_arr from a node
2236 static INLINE ir_node **
2237 get_frag_arr (ir_node *n) {
2238 switch (get_irn_opcode(n)) {
2240 return n->attr.call.exc.frag_arr;
2242 return n->attr.a.exc.frag_arr;
2244 return n->attr.load.exc.frag_arr;
2246 return n->attr.store.exc.frag_arr;
2248 return n->attr.except.frag_arr;
2253 set_frag_value(ir_node **frag_arr, int pos, ir_node *val) {
2255 if (!frag_arr[pos]) frag_arr[pos] = val;
2256 if (frag_arr[current_ir_graph->n_loc - 1]) {
2257 ir_node **arr = get_frag_arr(frag_arr[current_ir_graph->n_loc - 1]);
2258 assert(arr != frag_arr && "Endless recursion detected");
2259 set_frag_value(arr, pos, val);
2264 for (i = 0; i < 1000; ++i) {
2265 if (!frag_arr[pos]) {
2266 frag_arr[pos] = val;
2268 if (frag_arr[current_ir_graph->n_loc - 1]) {
2269 ir_node **arr = get_frag_arr(frag_arr[current_ir_graph->n_loc - 1]);
2275 assert(0 && "potential endless recursion");
2280 get_r_frag_value_internal (ir_node *block, ir_node *cfOp, int pos, ir_mode *mode) {
2284 assert(is_fragile_op(cfOp) && (get_irn_op(cfOp) != op_Bad));
2286 frag_arr = get_frag_arr(cfOp);
2287 res = frag_arr[pos];
2289 if (block->attr.block.graph_arr[pos]) {
2290 /* There was a set_value after the cfOp and no get_value before that
2291 set_value. We must build a Phi node now. */
2292 if (block->attr.block.matured) {
2293 int ins = get_irn_arity(block);
2295 NEW_ARR_A (ir_node *, nin, ins);
2296 res = phi_merge(block, pos, mode, nin, ins);
2298 res = new_rd_Phi0 (current_ir_graph, block, mode);
2299 res->attr.phi0_pos = pos;
2300 res->link = block->link;
2304 /* @@@ tested by Flo: set_frag_value(frag_arr, pos, res);
2305 but this should be better: (remove comment if this works) */
2306 /* It's a Phi, we can write this into all graph_arrs with NULL */
2307 set_frag_value(block->attr.block.graph_arr, pos, res);
2309 res = get_r_value_internal(block, pos, mode);
2310 set_frag_value(block->attr.block.graph_arr, pos, res);
2315 #endif /* PRECISE_EXC_CONTEXT */
2318 computes the predecessors for the real phi node, and then
2319 allocates and returns this node. The routine called to allocate the
2320 node might optimize it away and return a real value.
2321 This function must be called with an in-array of proper size. **/
2323 phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
2325 ir_node *prevBlock, *prevCfOp, *res, *phi0, *phi0_all;
2328 /* If this block has no value at pos create a Phi0 and remember it
2329 in graph_arr to break recursions.
2330 Else we may not set graph_arr as there a later value is remembered. */
2332 if (!block->attr.block.graph_arr[pos]) {
2333 if (block == get_irg_start_block(current_ir_graph)) {
2334 /* Collapsing to Bad tarvals is no good idea.
2335 So we call a user-supplied routine here that deals with this case as
2336 appropriate for the given language. Sorrily the only help we can give
2337 here is the position.
2339 Even if all variables are defined before use, it can happen that
2340 we get to the start block, if a Cond has been replaced by a tuple
2341 (bad, jmp). In this case we call the function needlessly, eventually
2342 generating an non existent error.
2343 However, this SHOULD NOT HAPPEN, as bad control flow nodes are intercepted
2346 if (default_initialize_local_variable) {
2347 ir_node *rem = get_cur_block();
2349 set_cur_block(block);
2350 block->attr.block.graph_arr[pos] = default_initialize_local_variable(current_ir_graph, mode, pos - 1);
2354 block->attr.block.graph_arr[pos] = new_Const(mode, tarval_bad);
2355 /* We don't need to care about exception ops in the start block.
2356 There are none by definition. */
2357 return block->attr.block.graph_arr[pos];
2359 phi0 = new_rd_Phi0(current_ir_graph, block, mode);
2360 block->attr.block.graph_arr[pos] = phi0;
2361 #if PRECISE_EXC_CONTEXT
2362 if (get_opt_precise_exc_context()) {
2363 /* Set graph_arr for fragile ops. Also here we should break recursion.
2364 We could choose a cyclic path through an cfop. But the recursion would
2365 break at some point. */
2366 set_frag_value(block->attr.block.graph_arr, pos, phi0);
2372 /* This loop goes to all predecessor blocks of the block the Phi node
2373 is in and there finds the operands of the Phi node by calling
2374 get_r_value_internal. */
2375 for (i = 1; i <= ins; ++i) {
2376 prevCfOp = skip_Proj(block->in[i]);
2378 if (is_Bad(prevCfOp)) {
2379 /* In case a Cond has been optimized we would get right to the start block
2380 with an invalid definition. */
2381 nin[i-1] = new_Bad();
2384 prevBlock = block->in[i]->in[0]; /* go past control flow op to prev block */
2386 if (!is_Bad(prevBlock)) {
2387 #if PRECISE_EXC_CONTEXT
2388 if (get_opt_precise_exc_context() &&
2389 is_fragile_op(prevCfOp) && (get_irn_op (prevCfOp) != op_Bad)) {
2390 assert(get_r_frag_value_internal (prevBlock, prevCfOp, pos, mode));
2391 nin[i-1] = get_r_frag_value_internal (prevBlock, prevCfOp, pos, mode);
2394 nin[i-1] = get_r_value_internal (prevBlock, pos, mode);
2396 nin[i-1] = new_Bad();
2400 /* We want to pass the Phi0 node to the constructor: this finds additional
2401 optimization possibilities.
2402 The Phi0 node either is allocated in this function, or it comes from
2403 a former call to get_r_value_internal. In this case we may not yet
2404 exchange phi0, as this is done in mature_immBlock. */
2406 phi0_all = block->attr.block.graph_arr[pos];
2407 if (!((get_irn_op(phi0_all) == op_Phi) &&
2408 (get_irn_arity(phi0_all) == 0) &&
2409 (get_nodes_block(phi0_all) == block)))
2415 /* After collecting all predecessors into the array nin a new Phi node
2416 with these predecessors is created. This constructor contains an
2417 optimization: If all predecessors of the Phi node are identical it
2418 returns the only operand instead of a new Phi node. */
2419 res = new_rd_Phi_in (current_ir_graph, block, mode, nin, ins, phi0_all);
2421 /* In case we allocated a Phi0 node at the beginning of this procedure,
2422 we need to exchange this Phi0 with the real Phi. */
2424 exchange(phi0, res);
2425 block->attr.block.graph_arr[pos] = res;
2426 /* Don't set_frag_value as it does not overwrite. Doesn't matter, is
2427 only an optimization. */
2433 /* This function returns the last definition of a variable. In case
2434 this variable was last defined in a previous block, Phi nodes are
2435 inserted. If the part of the firm graph containing the definition
2436 is not yet constructed, a dummy Phi node is returned. */
2438 get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
2441 /* There are 4 cases to treat.
2443 1. The block is not mature and we visit it the first time. We can not
2444 create a proper Phi node, therefore a Phi0, i.e., a Phi without
2445 predecessors is returned. This node is added to the linked list (field
2446 "link") of the containing block to be completed when this block is
2447 matured. (Completion will add a new Phi and turn the Phi0 into an Id
2450 2. The value is already known in this block, graph_arr[pos] is set and we
2451 visit the block the first time. We can return the value without
2452 creating any new nodes.
2454 3. The block is mature and we visit it the first time. A Phi node needs
2455 to be created (phi_merge). If the Phi is not needed, as all it's
2456 operands are the same value reaching the block through different
2457 paths, it's optimized away and the value itself is returned.
2459 4. The block is mature, and we visit it the second time. Now two
2460 subcases are possible:
2461 * The value was computed completely the last time we were here. This
2462 is the case if there is no loop. We can return the proper value.
2463 * The recursion that visited this node and set the flag did not
2464 return yet. We are computing a value in a loop and need to
2465 break the recursion. This case only happens if we visited
2466 the same block with phi_merge before, which inserted a Phi0.
2467 So we return the Phi0.
2470 /* case 4 -- already visited. */
2471 if (get_irn_visited(block) == get_irg_visited(current_ir_graph)) {
2472 /* As phi_merge allocates a Phi0 this value is always defined. Here
2473 is the critical difference of the two algorithms. */
2474 assert(block->attr.block.graph_arr[pos]);
2475 return block->attr.block.graph_arr[pos];
2478 /* visited the first time */
2479 set_irn_visited(block, get_irg_visited(current_ir_graph));
2481 /* Get the local valid value */
2482 res = block->attr.block.graph_arr[pos];
2484 /* case 2 -- If the value is actually computed, return it. */
2485 if (res) { return res; };
2487 if (block->attr.block.matured) { /* case 3 */
2489 /* The Phi has the same amount of ins as the corresponding block. */
2490 int ins = get_irn_arity(block);
2492 NEW_ARR_A (ir_node *, nin, ins);
2494 /* Phi merge collects the predecessors and then creates a node. */
2495 res = phi_merge (block, pos, mode, nin, ins);
2497 } else { /* case 1 */
2498 /* The block is not mature, we don't know how many in's are needed. A Phi
2499 with zero predecessors is created. Such a Phi node is called Phi0
2500 node. The Phi0 is then added to the list of Phi0 nodes in this block
2501 to be matured by mature_immBlock later.
2502 The Phi0 has to remember the pos of it's internal value. If the real
2503 Phi is computed, pos is used to update the array with the local
2505 res = new_rd_Phi0 (current_ir_graph, block, mode);
2506 res->attr.phi0_pos = pos;
2507 res->link = block->link;
2511 /* If we get here, the frontend missed a use-before-definition error */
2514 printf("Error: no value set. Use of undefined variable. Initializing to zero.\n");
2515 assert (mode->code >= irm_F && mode->code <= irm_P);
2516 res = new_rd_Const (NULL, current_ir_graph, block, mode,
2517 get_mode_null(mode));
2520 /* The local valid value is available now. */
2521 block->attr.block.graph_arr[pos] = res;
2526 #endif /* USE_FAST_PHI_CONSTRUCTION */
2528 /* ************************************************************************** */
2531 * Finalize a Block node, when all control flows are known.
2532 * Acceptable parameters are only Block nodes.
2535 mature_immBlock (ir_node *block)
2541 assert (get_irn_opcode(block) == iro_Block);
2542 /* @@@ should be commented in
2543 assert (!get_Block_matured(block) && "Block already matured"); */
2545 if (!get_Block_matured(block)) {
2546 ins = ARR_LEN (block->in)-1;
2547 /* Fix block parameters */
2548 block->attr.block.backedge = new_backedge_arr(current_ir_graph->obst, ins);
2550 /* An array for building the Phi nodes. */
2551 NEW_ARR_A (ir_node *, nin, ins);
2553 /* Traverse a chain of Phi nodes attached to this block and mature
2555 for (n = block->link; n; n=next) {
2556 inc_irg_visited(current_ir_graph);
2558 exchange (n, phi_merge (block, n->attr.phi0_pos, n->mode, nin, ins));
2561 block->attr.block.matured = 1;
2563 /* Now, as the block is a finished firm node, we can optimize it.
2564 Since other nodes have been allocated since the block was created
2565 we can not free the node on the obstack. Therefore we have to call
2567 Unfortunately the optimization does not change a lot, as all allocated
2568 nodes refer to the unoptimized node.
2569 We can call _2, as global cse has no effect on blocks. */
2570 block = optimize_in_place_2(block);
2571 IRN_VRFY_IRG(block, current_ir_graph);
2576 new_d_Phi (dbg_info *db, int arity, ir_node **in, ir_mode *mode)
2578 return new_bd_Phi(db, current_ir_graph->current_block, arity, in, mode);
2582 new_d_Const (dbg_info *db, ir_mode *mode, tarval *con)
2584 return new_bd_Const(db, get_irg_start_block(current_ir_graph), mode, con);
2588 new_d_Const_long(dbg_info *db, ir_mode *mode, long value)
2590 return new_bd_Const_long(db, get_irg_start_block(current_ir_graph), mode, value);
2594 new_d_Const_type (dbg_info *db, ir_mode *mode, tarval *con, ir_type *tp)
2596 return new_bd_Const_type(db, get_irg_start_block(current_ir_graph), mode, con, tp);
2601 new_d_Id (dbg_info *db, ir_node *val, ir_mode *mode)
2603 return new_bd_Id(db, current_ir_graph->current_block, val, mode);
2607 new_d_Proj (dbg_info *db, ir_node *arg, ir_mode *mode, long proj)
2609 return new_bd_Proj(db, current_ir_graph->current_block, arg, mode, proj);
2613 new_d_defaultProj (dbg_info *db, ir_node *arg, long max_proj)
2616 assert(arg->op == op_Cond);
2617 arg->attr.c.kind = fragmentary;
2618 arg->attr.c.default_proj = max_proj;
2619 res = new_Proj (arg, mode_X, max_proj);
2624 new_d_Conv (dbg_info *db, ir_node *op, ir_mode *mode)
2626 return new_bd_Conv(db, current_ir_graph->current_block, op, mode);
2630 new_d_Cast (dbg_info *db, ir_node *op, ir_type *to_tp)
2632 return new_bd_Cast(db, current_ir_graph->current_block, op, to_tp);
2636 new_d_Tuple (dbg_info *db, int arity, ir_node **in)
2638 return new_bd_Tuple(db, current_ir_graph->current_block, arity, in);
2647 * allocate the frag array
2649 static void allocate_frag_arr(ir_node *res, ir_op *op, ir_node ***frag_store) {
2650 if (get_opt_precise_exc_context()) {
2651 if ((current_ir_graph->phase_state == phase_building) &&
2652 (get_irn_op(res) == op) && /* Could be optimized away. */
2653 !*frag_store) /* Could be a cse where the arr is already set. */ {
2654 *frag_store = new_frag_arr(res);
2660 new_d_Quot (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2)
2663 res = new_bd_Quot (db, current_ir_graph->current_block, memop, op1, op2);
2664 res->attr.except.pin_state = op_pin_state_pinned;
2665 #if PRECISE_EXC_CONTEXT
2666 allocate_frag_arr(res, op_Quot, &res->attr.except.frag_arr); /* Could be optimized away. */
2673 new_d_DivMod (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2)
2676 res = new_bd_DivMod (db, current_ir_graph->current_block, memop, op1, op2);
2677 res->attr.except.pin_state = op_pin_state_pinned;
2678 #if PRECISE_EXC_CONTEXT
2679 allocate_frag_arr(res, op_DivMod, &res->attr.except.frag_arr); /* Could be optimized away. */
2686 new_d_Div (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2)
2689 res = new_bd_Div (db, current_ir_graph->current_block, memop, op1, op2);
2690 res->attr.except.pin_state = op_pin_state_pinned;
2691 #if PRECISE_EXC_CONTEXT
2692 allocate_frag_arr(res, op_Div, &res->attr.except.frag_arr); /* Could be optimized away. */
2699 new_d_Mod (dbg_info *db, ir_node *memop, ir_node *op1, ir_node *op2)
2702 res = new_bd_Mod (db, current_ir_graph->current_block, memop, op1, op2);
2703 res->attr.except.pin_state = op_pin_state_pinned;
2704 #if PRECISE_EXC_CONTEXT
2705 allocate_frag_arr(res, op_Mod, &res->attr.except.frag_arr); /* Could be optimized away. */
2724 new_d_Cmp (dbg_info *db, ir_node *op1, ir_node *op2)
2726 return new_bd_Cmp(db, current_ir_graph->current_block, op1, op2);
2730 new_d_Jmp (dbg_info *db)
2732 return new_bd_Jmp (db, current_ir_graph->current_block);
2736 new_d_IJmp (dbg_info *db, ir_node *tgt)
2738 return new_bd_IJmp (db, current_ir_graph->current_block, tgt);
2742 new_d_Cond (dbg_info *db, ir_node *c)
2744 return new_bd_Cond (db, current_ir_graph->current_block, c);
2748 new_d_Call (dbg_info *db, ir_node *store, ir_node *callee, int arity, ir_node **in,
2752 res = new_bd_Call (db, current_ir_graph->current_block,
2753 store, callee, arity, in, tp);
2754 #if PRECISE_EXC_CONTEXT
2755 allocate_frag_arr(res, op_Call, &res->attr.call.exc.frag_arr); /* Could be optimized away. */
2762 new_d_Return (dbg_info *db, ir_node* store, int arity, ir_node **in)
2764 return new_bd_Return (db, current_ir_graph->current_block,
2769 new_d_Load (dbg_info *db, ir_node *store, ir_node *addr, ir_mode *mode)
2772 res = new_bd_Load (db, current_ir_graph->current_block,
2774 #if PRECISE_EXC_CONTEXT
2775 allocate_frag_arr(res, op_Load, &res->attr.load.exc.frag_arr); /* Could be optimized away. */
2782 new_d_Store (dbg_info *db, ir_node *store, ir_node *addr, ir_node *val)
2785 res = new_bd_Store (db, current_ir_graph->current_block,
2787 #if PRECISE_EXC_CONTEXT
2788 allocate_frag_arr(res, op_Store, &res->attr.store.exc.frag_arr); /* Could be optimized away. */
2795 new_d_Alloc (dbg_info *db, ir_node *store, ir_node *size, ir_type *alloc_type,
2799 res = new_bd_Alloc (db, current_ir_graph->current_block,
2800 store, size, alloc_type, where);
2801 #if PRECISE_EXC_CONTEXT
2802 allocate_frag_arr(res, op_Alloc, &res->attr.a.exc.frag_arr); /* Could be optimized away. */
2809 new_d_Free (dbg_info *db, ir_node *store, ir_node *ptr,
2810 ir_node *size, ir_type *free_type, where_alloc where)
2812 return new_bd_Free (db, current_ir_graph->current_block,
2813 store, ptr, size, free_type, where);
2817 new_d_simpleSel (dbg_info *db, ir_node *store, ir_node *objptr, entity *ent)
2818 /* GL: objptr was called frame before. Frame was a bad choice for the name
2819 as the operand could as well be a pointer to a dynamic object. */
2821 return new_bd_Sel (db, current_ir_graph->current_block,
2822 store, objptr, 0, NULL, ent);
2826 new_d_Sel (dbg_info *db, ir_node *store, ir_node *objptr, int n_index, ir_node **index, entity *sel)
2828 return new_bd_Sel (db, current_ir_graph->current_block,
2829 store, objptr, n_index, index, sel);
2833 new_d_SymConst_type (dbg_info *db, symconst_symbol value, symconst_kind kind, ir_type *tp)
2835 return new_bd_SymConst_type (db, get_irg_start_block(current_ir_graph),
2840 new_d_SymConst (dbg_info *db, symconst_symbol value, symconst_kind kind)
2842 return new_bd_SymConst (db, get_irg_start_block(current_ir_graph),
2847 new_d_Sync (dbg_info *db, int arity, ir_node** in)
2849 return new_bd_Sync (db, current_ir_graph->current_block, arity, in);
2855 return _new_d_Bad();
2859 new_d_Confirm (dbg_info *db, ir_node *val, ir_node *bound, pn_Cmp cmp)
2861 return new_bd_Confirm (db, current_ir_graph->current_block,
2866 new_d_Unknown (ir_mode *m)
2868 return new_bd_Unknown(m);
2872 new_d_CallBegin (dbg_info *db, ir_node *call)
2875 res = new_bd_CallBegin (db, current_ir_graph->current_block, call);
2880 new_d_EndReg (dbg_info *db)
2883 res = new_bd_EndReg(db, current_ir_graph->current_block);
2888 new_d_EndExcept (dbg_info *db)
2891 res = new_bd_EndExcept(db, current_ir_graph->current_block);
2896 new_d_Break (dbg_info *db)
2898 return new_bd_Break (db, current_ir_graph->current_block);
2902 new_d_Filter (dbg_info *db, ir_node *arg, ir_mode *mode, long proj)
2904 return new_bd_Filter (db, current_ir_graph->current_block,
2911 return _new_d_NoMem();
2915 new_d_Mux (dbg_info *db, ir_node *sel, ir_node *ir_false,
2916 ir_node *ir_true, ir_mode *mode) {
2917 return new_bd_Mux (db, current_ir_graph->current_block,
2918 sel, ir_false, ir_true, mode);
2922 new_d_Psi (dbg_info *db,int arity, ir_node *conds[], ir_node *vals[], ir_mode *mode) {
2923 return new_bd_Psi (db, current_ir_graph->current_block,
2924 arity, conds, vals, mode);
2927 ir_node *new_d_CopyB(dbg_info *db,ir_node *store,
2928 ir_node *dst, ir_node *src, ir_type *data_type) {
2930 res = new_bd_CopyB(db, current_ir_graph->current_block,
2931 store, dst, src, data_type);
2932 #if PRECISE_EXC_CONTEXT
2933 allocate_frag_arr(res, op_CopyB, &res->attr.copyb.exc.frag_arr);
2939 new_d_InstOf (dbg_info *db, ir_node *store, ir_node *objptr, ir_type *type)
2941 return new_bd_InstOf (db, current_ir_graph->current_block,
2942 store, objptr, type);
2946 new_d_Raise (dbg_info *db, ir_node *store, ir_node *obj)
2948 return new_bd_Raise (db, current_ir_graph->current_block,
2952 ir_node *new_d_Bound(dbg_info *db,ir_node *store,
2953 ir_node *idx, ir_node *lower, ir_node *upper) {
2955 res = new_bd_Bound(db, current_ir_graph->current_block,
2956 store, idx, lower, upper);
2957 #if PRECISE_EXC_CONTEXT
2958 allocate_frag_arr(res, op_Bound, &res->attr.bound.exc.frag_arr);
2963 /* ********************************************************************* */
2964 /* Comfortable interface with automatic Phi node construction. */
2965 /* (Uses also constructors of ?? interface, except new_Block. */
2966 /* ********************************************************************* */
2968 /* Block construction */
2969 /* immature Block without predecessors */
2970 ir_node *new_d_immBlock (dbg_info *db) {
2973 assert(get_irg_phase_state (current_ir_graph) == phase_building);
2974 /* creates a new dynamic in-array as length of in is -1 */
2975 res = new_ir_node (db, current_ir_graph, NULL, op_Block, mode_BB, -1, NULL);
2976 current_ir_graph->current_block = res;
2977 res->attr.block.matured = 0;
2978 res->attr.block.dead = 0;
2979 /* res->attr.block.exc = exc_normal; */
2980 /* res->attr.block.handler_entry = 0; */
2981 res->attr.block.irg = current_ir_graph;
2982 res->attr.block.backedge = NULL;
2983 res->attr.block.in_cg = NULL;
2984 res->attr.block.cg_backedge = NULL;
2985 set_Block_block_visited(res, 0);
2987 /* Create and initialize array for Phi-node construction. */
2988 res->attr.block.graph_arr = NEW_ARR_D (ir_node *, current_ir_graph->obst,
2989 current_ir_graph->n_loc);
2990 memset(res->attr.block.graph_arr, 0, sizeof(ir_node *)*current_ir_graph->n_loc);
2992 /* Immature block may not be optimized! */
2993 IRN_VRFY_IRG(res, current_ir_graph);
2999 new_immBlock (void) {
3000 return new_d_immBlock(NULL);
3003 /* add an edge to a jmp/control flow node */
3005 add_immBlock_pred (ir_node *block, ir_node *jmp)
3007 if (block->attr.block.matured) {
3008 assert(0 && "Error: Block already matured!\n");
3011 assert(jmp != NULL);
3012 ARR_APP1(ir_node *, block->in, jmp);
3016 /* changing the current block */
3018 set_cur_block (ir_node *target) {
3019 current_ir_graph->current_block = target;
3022 /* ************************ */
3023 /* parameter administration */
3025 /* get a value from the parameter array from the current block by its index */
3027 get_d_value (dbg_info *db, int pos, ir_mode *mode)
3029 assert(get_irg_phase_state (current_ir_graph) == phase_building);
3030 inc_irg_visited(current_ir_graph);
3032 return get_r_value_internal (current_ir_graph->current_block, pos + 1, mode);
3034 /* get a value from the parameter array from the current block by its index */
3036 get_value (int pos, ir_mode *mode)
3038 return get_d_value(NULL, pos, mode);
3041 /* set a value at position pos in the parameter array from the current block */
3043 set_value (int pos, ir_node *value)
3045 assert(get_irg_phase_state (current_ir_graph) == phase_building);
3046 assert(pos+1 < current_ir_graph->n_loc);
3047 current_ir_graph->current_block->attr.block.graph_arr[pos + 1] = value;
3051 find_value(ir_node *value)
3054 ir_node *bl = current_ir_graph->current_block;
3056 for (i = 1; i < ARR_LEN(bl->attr.block.graph_arr); ++i)
3057 if (bl->attr.block.graph_arr[i] == value)
3062 /* get the current store */
3066 assert(get_irg_phase_state (current_ir_graph) == phase_building);
3067 /* GL: one could call get_value instead */
3068 inc_irg_visited(current_ir_graph);
3069 return get_r_value_internal (current_ir_graph->current_block, 0, mode_M);
3072 /* set the current store */
3074 set_store (ir_node *store)
3076 /* GL: one could call set_value instead */
3077 assert(get_irg_phase_state (current_ir_graph) == phase_building);
3078 current_ir_graph->current_block->attr.block.graph_arr[0] = store;
3082 keep_alive (ir_node *ka) {
3083 add_End_keepalive(get_irg_end(current_ir_graph), ka);
3086 /* --- Useful access routines --- */
3087 /* Returns the current block of the current graph. To set the current
3088 block use set_cur_block. */
3089 ir_node *get_cur_block(void) {
3090 return get_irg_current_block(current_ir_graph);
3093 /* Returns the frame type of the current graph */
3094 ir_type *get_cur_frame_type(void) {
3095 return get_irg_frame_type(current_ir_graph);
3099 /* ********************************************************************* */
3102 /* call once for each run of the library */
3104 init_cons(uninitialized_local_variable_func_t *func)
3106 default_initialize_local_variable = func;
3110 irp_finalize_cons (void) {
3112 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
3113 irg_finalize_cons(get_irp_irg(i));
3115 irp->phase_state = phase_high;
3119 ir_node *new_Block(int arity, ir_node **in) {
3120 return new_d_Block(NULL, arity, in);
3122 ir_node *new_Start (void) {
3123 return new_d_Start(NULL);
3125 ir_node *new_End (void) {
3126 return new_d_End(NULL);
3128 ir_node *new_Jmp (void) {
3129 return new_d_Jmp(NULL);
3131 ir_node *new_IJmp (ir_node *tgt) {
3132 return new_d_IJmp(NULL, tgt);
3134 ir_node *new_Cond (ir_node *c) {
3135 return new_d_Cond(NULL, c);
3137 ir_node *new_Return (ir_node *store, int arity, ir_node *in[]) {
3138 return new_d_Return(NULL, store, arity, in);
3140 ir_node *new_Const (ir_mode *mode, tarval *con) {
3141 return new_d_Const(NULL, mode, con);
3144 ir_node *new_Const_long(ir_mode *mode, long value)
3146 return new_d_Const_long(NULL, mode, value);
3149 ir_node *new_Const_type(tarval *con, ir_type *tp) {
3150 return new_d_Const_type(NULL, get_type_mode(tp), con, tp);
3153 ir_node *new_SymConst (symconst_symbol value, symconst_kind kind) {
3154 return new_d_SymConst(NULL, value, kind);
3156 ir_node *new_simpleSel(ir_node *store, ir_node *objptr, entity *ent) {
3157 return new_d_simpleSel(NULL, store, objptr, ent);
3159 ir_node *new_Sel (ir_node *store, ir_node *objptr, int arity, ir_node **in,
3161 return new_d_Sel(NULL, store, objptr, arity, in, ent);
3163 ir_node *new_Call (ir_node *store, ir_node *callee, int arity, ir_node **in,
3165 return new_d_Call(NULL, store, callee, arity, in, tp);
3167 ir_node *new_Add (ir_node *op1, ir_node *op2, ir_mode *mode) {
3168 return new_d_Add(NULL, op1, op2, mode);
3170 ir_node *new_Sub (ir_node *op1, ir_node *op2, ir_mode *mode) {
3171 return new_d_Sub(NULL, op1, op2, mode);
3173 ir_node *new_Minus (ir_node *op, ir_mode *mode) {
3174 return new_d_Minus(NULL, op, mode);
3176 ir_node *new_Mul (ir_node *op1, ir_node *op2, ir_mode *mode) {
3177 return new_d_Mul(NULL, op1, op2, mode);
3179 ir_node *new_Quot (ir_node *memop, ir_node *op1, ir_node *op2) {
3180 return new_d_Quot(NULL, memop, op1, op2);
3182 ir_node *new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2) {
3183 return new_d_DivMod(NULL, memop, op1, op2);
3185 ir_node *new_Div (ir_node *memop, ir_node *op1, ir_node *op2) {
3186 return new_d_Div(NULL, memop, op1, op2);
3188 ir_node *new_Mod (ir_node *memop, ir_node *op1, ir_node *op2) {
3189 return new_d_Mod(NULL, memop, op1, op2);
3191 ir_node *new_Abs (ir_node *op, ir_mode *mode) {
3192 return new_d_Abs(NULL, op, mode);
3194 ir_node *new_And (ir_node *op1, ir_node *op2, ir_mode *mode) {
3195 return new_d_And(NULL, op1, op2, mode);
3197 ir_node *new_Or (ir_node *op1, ir_node *op2, ir_mode *mode) {
3198 return new_d_Or(NULL, op1, op2, mode);
3200 ir_node *new_Eor (ir_node *op1, ir_node *op2, ir_mode *mode) {
3201 return new_d_Eor(NULL, op1, op2, mode);
3203 ir_node *new_Not (ir_node *op, ir_mode *mode) {
3204 return new_d_Not(NULL, op, mode);
3206 ir_node *new_Shl (ir_node *op, ir_node *k, ir_mode *mode) {
3207 return new_d_Shl(NULL, op, k, mode);
3209 ir_node *new_Shr (ir_node *op, ir_node *k, ir_mode *mode) {
3210 return new_d_Shr(NULL, op, k, mode);
3212 ir_node *new_Shrs (ir_node *op, ir_node *k, ir_mode *mode) {
3213 return new_d_Shrs(NULL, op, k, mode);
3215 ir_node *new_Rot (ir_node *op, ir_node *k, ir_mode *mode) {
3216 return new_d_Rot(NULL, op, k, mode);
3218 ir_node *new_Carry (ir_node *op1, ir_node *op2, ir_mode *mode) {
3219 return new_d_Carry(NULL, op1, op2, mode);
3221 ir_node *new_Borrow (ir_node *op1, ir_node *op2, ir_mode *mode) {
3222 return new_d_Borrow(NULL, op1, op2, mode);
3224 ir_node *new_Cmp (ir_node *op1, ir_node *op2) {
3225 return new_d_Cmp(NULL, op1, op2);
3227 ir_node *new_Conv (ir_node *op, ir_mode *mode) {
3228 return new_d_Conv(NULL, op, mode);
3230 ir_node *new_Cast (ir_node *op, ir_type *to_tp) {
3231 return new_d_Cast(NULL, op, to_tp);
3233 ir_node *new_Phi (int arity, ir_node **in, ir_mode *mode) {
3234 return new_d_Phi(NULL, arity, in, mode);
3236 ir_node *new_Load (ir_node *store, ir_node *addr, ir_mode *mode) {
3237 return new_d_Load(NULL, store, addr, mode);
3239 ir_node *new_Store (ir_node *store, ir_node *addr, ir_node *val) {
3240 return new_d_Store(NULL, store, addr, val);
3242 ir_node *new_Alloc (ir_node *store, ir_node *size, ir_type *alloc_type,
3243 where_alloc where) {
3244 return new_d_Alloc(NULL, store, size, alloc_type, where);
3246 ir_node *new_Free (ir_node *store, ir_node *ptr, ir_node *size,
3247 ir_type *free_type, where_alloc where) {
3248 return new_d_Free(NULL, store, ptr, size, free_type, where);
3250 ir_node *new_Sync (int arity, ir_node **in) {
3251 return new_d_Sync(NULL, arity, in);
3253 ir_node *new_Proj (ir_node *arg, ir_mode *mode, long proj) {
3254 return new_d_Proj(NULL, arg, mode, proj);
3256 ir_node *new_defaultProj (ir_node *arg, long max_proj) {
3257 return new_d_defaultProj(NULL, arg, max_proj);
3259 ir_node *new_Tuple (int arity, ir_node **in) {
3260 return new_d_Tuple(NULL, arity, in);
3262 ir_node *new_Id (ir_node *val, ir_mode *mode) {
3263 return new_d_Id(NULL, val, mode);
3265 ir_node *new_Bad (void) {
3268 ir_node *new_Confirm (ir_node *val, ir_node *bound, pn_Cmp cmp) {
3269 return new_d_Confirm (NULL, val, bound, cmp);
3271 ir_node *new_Unknown(ir_mode *m) {
3272 return new_d_Unknown(m);
3274 ir_node *new_CallBegin (ir_node *callee) {
3275 return new_d_CallBegin(NULL, callee);
3277 ir_node *new_EndReg (void) {
3278 return new_d_EndReg(NULL);
3280 ir_node *new_EndExcept (void) {
3281 return new_d_EndExcept(NULL);
3283 ir_node *new_Break (void) {
3284 return new_d_Break(NULL);
3286 ir_node *new_Filter (ir_node *arg, ir_mode *mode, long proj) {
3287 return new_d_Filter(NULL, arg, mode, proj);
3289 ir_node *new_NoMem (void) {
3290 return new_d_NoMem();
3292 ir_node *new_Mux (ir_node *sel, ir_node *ir_false, ir_node *ir_true, ir_mode *mode) {
3293 return new_d_Mux(NULL, sel, ir_false, ir_true, mode);
3295 ir_node *new_Psi (int arity, ir_node *conds[], ir_node *vals[], ir_mode *mode) {
3296 return new_d_Psi(NULL, arity, conds, vals, mode);
3298 ir_node *new_CopyB(ir_node *store, ir_node *dst, ir_node *src, ir_type *data_type) {
3299 return new_d_CopyB(NULL, store, dst, src, data_type);
3301 ir_node *new_InstOf (ir_node *store, ir_node *objptr, ir_type *ent) {
3302 return new_d_InstOf (NULL, store, objptr, ent);
3304 ir_node *new_Raise (ir_node *store, ir_node *obj) {
3305 return new_d_Raise(NULL, store, obj);
3307 ir_node *new_Bound(ir_node *store, ir_node *idx, ir_node *lower, ir_node *upper) {
3308 return new_d_Bound(NULL, store, idx, lower, upper);