3 * File name: ir/ir/irnode.c
4 * Purpose: Representation of an intermediate operation.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier, Michael Beck
9 * Copyright: (c) 1998-2006 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
23 #include "irgraph_t.h"
26 #include "irbackedge_t.h"
30 #include "iredgekinds.h"
31 #include "iredges_t.h"
36 /* some constants fixing the positions of nodes predecessors
38 #define CALL_PARAM_OFFSET 2
39 #define FUNCCALL_PARAM_OFFSET 1
40 #define SEL_INDEX_OFFSET 2
41 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
42 #define END_KEEPALIVE_OFFSET 0
44 static const char *pnc_name_arr [] = {
45 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
46 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
47 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
48 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
52 * returns the pnc name from an pnc constant
54 const char *get_pnc_string(int pnc) {
55 return pnc_name_arr[pnc];
59 * Calculates the negated (Complement(R)) pnc condition.
61 int get_negated_pnc(int pnc, ir_mode *mode) {
64 /* do NOT add the Uo bit for non-floating point values */
65 if (! mode_is_float(mode))
71 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
73 get_inversed_pnc(int pnc) {
74 int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
75 int lesser = pnc & pn_Cmp_Lt;
76 int greater = pnc & pn_Cmp_Gt;
78 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
84 * Indicates, whether additional data can be registered to ir nodes.
85 * If set to 1, this is not possible anymore.
87 static int forbid_new_data = 0;
90 * The amount of additional space for custom data to be allocated upon
91 * creating a new node.
93 unsigned firm_add_node_size = 0;
96 /* register new space for every node */
97 unsigned register_additional_node_data(unsigned size) {
98 assert(!forbid_new_data && "Too late to register additional node data");
103 return firm_add_node_size += size;
109 /* Forbid the addition of new data to an ir node. */
114 * irnode constructor.
115 * Create a new irnode in irg, with an op, mode, arity and
116 * some incoming irnodes.
117 * If arity is negative, a node with a dynamic array is created.
120 new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
121 int arity, ir_node **in)
124 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
128 assert(irg && op && mode);
129 p = obstack_alloc (irg->obst, node_size);
130 memset(p, 0, node_size);
131 res = (ir_node *) (p + firm_add_node_size);
133 res->kind = k_ir_node;
137 res->node_idx = irg_register_node_idx(irg, res);
142 res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
144 res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
145 memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
149 set_irn_dbg_info(res, db);
153 res->node_nr = get_irp_new_node_nr();
156 for(i = 0; i < EDGE_KIND_LAST; ++i)
157 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
159 is_bl = is_Block(res);
160 for (i = is_bl; i <= arity; ++i)
161 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
163 hook_new_node(irg, res);
168 /*-- getting some parameters from ir_nodes --*/
171 (is_ir_node)(const void *thing) {
172 return _is_ir_node(thing);
176 (get_irn_intra_arity)(const ir_node *node) {
177 return _get_irn_intra_arity(node);
181 (get_irn_inter_arity)(const ir_node *node) {
182 return _get_irn_inter_arity(node);
185 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
188 (get_irn_arity)(const ir_node *node) {
189 return _get_irn_arity(node);
192 /* Returns the array with ins. This array is shifted with respect to the
193 array accessed by get_irn_n: The block operand is at position 0 not -1.
194 (@@@ This should be changed.)
195 The order of the predecessors in this array is not guaranteed, except that
196 lists of operands as predecessors of Block or arguments of a Call are
199 get_irn_in(const ir_node *node) {
201 if (get_interprocedural_view()) { /* handle Filter and Block specially */
202 if (get_irn_opcode(node) == iro_Filter) {
203 assert(node->attr.filter.in_cg);
204 return node->attr.filter.in_cg;
205 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
206 return node->attr.block.in_cg;
208 /* else fall through */
214 set_irn_in(ir_node *node, int arity, ir_node **in) {
217 ir_graph *irg = current_ir_graph;
219 if (get_interprocedural_view()) { /* handle Filter and Block specially */
220 if (get_irn_opcode(node) == iro_Filter) {
221 assert(node->attr.filter.in_cg);
222 arr = &node->attr.filter.in_cg;
223 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
224 arr = &node->attr.block.in_cg;
232 for (i = 0; i < arity; i++) {
233 if (i < ARR_LEN(*arr)-1)
234 edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
236 edges_notify_edge(node, i, in[i], NULL, irg);
238 for(;i < ARR_LEN(*arr)-1; i++) {
239 edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
242 if (arity != ARR_LEN(*arr) - 1) {
243 ir_node * block = (*arr)[0];
244 *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
247 fix_backedges(irg->obst, node);
249 memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
253 (get_irn_intra_n)(const ir_node *node, int n) {
254 return _get_irn_intra_n (node, n);
258 (get_irn_inter_n)(const ir_node *node, int n) {
259 return _get_irn_inter_n (node, n);
262 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
265 (get_irn_n)(const ir_node *node, int n) {
266 return _get_irn_n(node, n);
270 set_irn_n (ir_node *node, int n, ir_node *in) {
271 assert(node && node->kind == k_ir_node);
273 assert(n < get_irn_arity(node));
274 assert(in && in->kind == k_ir_node);
276 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
277 /* Change block pred in both views! */
278 node->in[n + 1] = in;
279 assert(node->attr.filter.in_cg);
280 node->attr.filter.in_cg[n + 1] = in;
283 if (get_interprocedural_view()) { /* handle Filter and Block specially */
284 if (get_irn_opcode(node) == iro_Filter) {
285 assert(node->attr.filter.in_cg);
286 node->attr.filter.in_cg[n + 1] = in;
288 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
289 node->attr.block.in_cg[n + 1] = in;
292 /* else fall through */
296 hook_set_irn_n(node, n, in, node->in[n + 1]);
298 /* Here, we rely on src and tgt being in the current ir graph */
299 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
301 node->in[n + 1] = in;
305 (get_irn_deps)(const ir_node *node)
307 return _get_irn_deps(node);
311 (get_irn_dep)(const ir_node *node, int pos)
313 return _get_irn_dep(node, pos);
317 (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
319 _set_irn_dep(node, pos, dep);
322 int add_irn_dep(ir_node *node, ir_node *dep)
326 if (node->deps == NULL) {
327 node->deps = NEW_ARR_F(ir_node *, 1);
333 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
334 if(node->deps[i] == NULL)
337 if(node->deps[i] == dep)
341 if (first_zero >= 0) {
342 node->deps[first_zero] = dep;
345 ARR_APP1(ir_node *, node->deps, dep);
350 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
355 void add_irn_deps(ir_node *tgt, ir_node *src)
359 for(i = 0, n = get_irn_deps(src); i < n; ++i)
360 add_irn_dep(tgt, get_irn_dep(src, i));
365 (get_irn_mode)(const ir_node *node) {
366 return _get_irn_mode(node);
370 (set_irn_mode)(ir_node *node, ir_mode *mode) {
371 _set_irn_mode(node, mode);
375 get_irn_modecode(const ir_node *node) {
377 return node->mode->code;
380 /** Gets the string representation of the mode .*/
382 get_irn_modename(const ir_node *node) {
384 return get_mode_name(node->mode);
388 get_irn_modeident(const ir_node *node) {
390 return get_mode_ident(node->mode);
394 (get_irn_op)(const ir_node *node) {
395 return _get_irn_op(node);
398 /* should be private to the library: */
400 (set_irn_op)(ir_node *node, ir_op *op) {
401 _set_irn_op(node, op);
405 (get_irn_opcode)(const ir_node *node) {
406 return _get_irn_opcode(node);
410 get_irn_opname(const ir_node *node) {
412 if ((get_irn_op((ir_node *)node) == op_Phi) &&
413 (get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
414 (get_irn_arity((ir_node *)node) == 0)) return "Phi0";
415 return get_id_str(node->op->name);
419 get_irn_opident(const ir_node *node) {
421 return node->op->name;
425 (get_irn_visited)(const ir_node *node) {
426 return _get_irn_visited(node);
430 (set_irn_visited)(ir_node *node, unsigned long visited) {
431 _set_irn_visited(node, visited);
435 (mark_irn_visited)(ir_node *node) {
436 _mark_irn_visited(node);
440 (irn_not_visited)(const ir_node *node) {
441 return _irn_not_visited(node);
445 (irn_visited)(const ir_node *node) {
446 return _irn_visited(node);
450 (set_irn_link)(ir_node *node, void *link) {
451 _set_irn_link(node, link);
455 (get_irn_link)(const ir_node *node) {
456 return _get_irn_link(node);
460 (get_irn_pinned)(const ir_node *node) {
461 return _get_irn_pinned(node);
465 (is_irn_pinned_in_irg) (const ir_node *node) {
466 return _is_irn_pinned_in_irg(node);
469 void set_irn_pinned(ir_node *node, op_pin_state state) {
470 /* due to optimization an opt may be turned into a Tuple */
471 if (get_irn_op(node) == op_Tuple)
474 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
475 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
477 node->attr.except.pin_state = state;
480 #ifdef DO_HEAPANALYSIS
481 /* Access the abstract interpretation information of a node.
482 Returns NULL if no such information is available. */
483 struct abstval *get_irn_abst_value(ir_node *n) {
486 /* Set the abstract interpretation information of a node. */
487 void set_irn_abst_value(ir_node *n, struct abstval *os) {
490 struct section *firm_get_irn_section(ir_node *n) {
493 void firm_set_irn_section(ir_node *n, struct section *s) {
497 /* Dummies needed for firmjni. */
498 struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
499 void set_irn_abst_value(ir_node *n, struct abstval *os) {}
500 struct section *firm_get_irn_section(ir_node *n) { return NULL; }
501 void firm_set_irn_section(ir_node *n, struct section *s) {}
502 #endif /* DO_HEAPANALYSIS */
505 /* Outputs a unique number for this node */
506 long get_irn_node_nr(const ir_node *node) {
509 return node->node_nr;
511 return (long)PTR_TO_INT(node);
516 get_irn_const_attr(ir_node *node) {
517 assert(node->op == op_Const);
518 return node->attr.con;
522 get_irn_proj_attr(ir_node *node) {
523 assert(node->op == op_Proj);
524 return node->attr.proj;
528 get_irn_alloc_attr(ir_node *node) {
529 assert(node->op == op_Alloc);
530 return node->attr.alloc;
534 get_irn_free_attr(ir_node *node) {
535 assert(node->op == op_Free);
536 return node->attr.free;
540 get_irn_symconst_attr(ir_node *node) {
541 assert(node->op == op_SymConst);
542 return node->attr.symc;
546 get_irn_call_attr(ir_node *node) {
547 assert(node->op == op_Call);
548 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
552 get_irn_sel_attr(ir_node *node) {
553 assert(node->op == op_Sel);
554 return node->attr.sel;
558 get_irn_phi_attr(ir_node *node) {
559 assert(node->op == op_Phi);
560 return node->attr.phi0_pos;
564 get_irn_block_attr(ir_node *node) {
565 assert(node->op == op_Block);
566 return node->attr.block;
570 get_irn_load_attr(ir_node *node)
572 assert(node->op == op_Load);
573 return node->attr.load;
577 get_irn_store_attr(ir_node *node)
579 assert(node->op == op_Store);
580 return node->attr.store;
584 get_irn_except_attr(ir_node *node) {
585 assert(node->op == op_Div || node->op == op_Quot ||
586 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
587 return node->attr.except;
591 get_irn_generic_attr(ir_node *node) {
595 unsigned (get_irn_idx)(const ir_node *node) {
596 assert(is_ir_node(node));
597 return _get_irn_idx(node);
600 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
602 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
603 if (get_irn_n(node, i) == arg)
609 /** manipulate fields of individual nodes **/
611 /* this works for all except Block */
613 get_nodes_block(const ir_node *node) {
614 assert(node->op != op_Block);
615 assert(is_irn_pinned_in_irg(node) && "block info may be incorrect");
616 return get_irn_n(node, -1);
620 set_nodes_block(ir_node *node, ir_node *block) {
621 assert(node->op != op_Block);
622 set_irn_n(node, -1, block);
625 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
626 * from Start. If so returns frame type, else Null. */
627 ir_type *is_frame_pointer(ir_node *n) {
628 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
629 ir_node *start = get_Proj_pred(n);
630 if (get_irn_op(start) == op_Start) {
631 return get_irg_frame_type(get_irn_irg(start));
637 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
638 * from Start. If so returns global type, else Null. */
639 ir_type *is_globals_pointer(ir_node *n) {
640 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
641 ir_node *start = get_Proj_pred(n);
642 if (get_irn_op(start) == op_Start) {
643 return get_glob_type();
649 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
650 * from Start. If so returns tls type, else Null. */
651 ir_type *is_tls_pointer(ir_node *n) {
652 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
653 ir_node *start = get_Proj_pred(n);
654 if (get_irn_op(start) == op_Start) {
655 return get_tls_type();
661 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
662 * from Start. If so returns 1, else 0. */
663 int is_value_arg_pointer(ir_node *n) {
664 if ((get_irn_op(n) == op_Proj) &&
665 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
666 (get_irn_op(get_Proj_pred(n)) == op_Start))
671 /* Returns an array with the predecessors of the Block. Depending on
672 the implementation of the graph data structure this can be a copy of
673 the internal representation of predecessors as well as the internal
674 array itself. Therefore writing to this array might obstruct the ir. */
676 get_Block_cfgpred_arr(ir_node *node) {
677 assert((node->op == op_Block));
678 return (ir_node **)&(get_irn_in(node)[1]);
682 (get_Block_n_cfgpreds)(const ir_node *node) {
683 return _get_Block_n_cfgpreds(node);
687 (get_Block_cfgpred)(ir_node *node, int pos) {
688 return _get_Block_cfgpred(node, pos);
692 set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
693 assert(node->op == op_Block);
694 set_irn_n(node, pos, pred);
698 (get_Block_cfgpred_block)(ir_node *node, int pos) {
699 return _get_Block_cfgpred_block(node, pos);
703 get_Block_matured(ir_node *node) {
704 assert(node->op == op_Block);
705 return (int)node->attr.block.matured;
709 set_Block_matured(ir_node *node, int matured) {
710 assert(node->op == op_Block);
711 node->attr.block.matured = matured;
715 (get_Block_block_visited)(ir_node *node) {
716 return _get_Block_block_visited(node);
720 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
721 _set_Block_block_visited(node, visit);
724 /* For this current_ir_graph must be set. */
726 (mark_Block_block_visited)(ir_node *node) {
727 _mark_Block_block_visited(node);
731 (Block_not_block_visited)(ir_node *node) {
732 return _Block_not_block_visited(node);
736 get_Block_graph_arr (ir_node *node, int pos) {
737 assert(node->op == op_Block);
738 return node->attr.block.graph_arr[pos+1];
742 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
743 assert(node->op == op_Block);
744 node->attr.block.graph_arr[pos+1] = value;
747 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
748 assert(node->op == op_Block);
749 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
750 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
751 node->attr.block.in_cg[0] = NULL;
752 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
754 /* Fix backedge array. fix_backedges() operates depending on
755 interprocedural_view. */
756 int ipv = get_interprocedural_view();
757 set_interprocedural_view(1);
758 fix_backedges(current_ir_graph->obst, node);
759 set_interprocedural_view(ipv);
762 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
765 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
766 assert(node->op == op_Block &&
767 node->attr.block.in_cg &&
768 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
769 node->attr.block.in_cg[pos + 1] = pred;
772 ir_node **get_Block_cg_cfgpred_arr(ir_node * node) {
773 assert(node->op == op_Block);
774 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
777 int get_Block_cg_n_cfgpreds(ir_node * node) {
778 assert(node->op == op_Block);
779 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
782 ir_node *get_Block_cg_cfgpred(ir_node * node, int pos) {
783 assert(node->op == op_Block && node->attr.block.in_cg);
784 return node->attr.block.in_cg[pos + 1];
787 void remove_Block_cg_cfgpred_arr(ir_node * node) {
788 assert(node->op == op_Block);
789 node->attr.block.in_cg = NULL;
792 ir_node *(set_Block_dead)(ir_node *block) {
793 return _set_Block_dead(block);
796 int (is_Block_dead)(const ir_node *block) {
797 return _is_Block_dead(block);
800 ir_extblk *get_Block_extbb(const ir_node *block) {
802 assert(is_Block(block));
803 res = block->attr.block.extblk;
804 assert(res == NULL || is_ir_extbb(res));
808 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
809 assert(is_Block(block));
810 assert(extblk == NULL || is_ir_extbb(extblk));
811 block->attr.block.extblk = extblk;
815 get_End_n_keepalives(ir_node *end) {
816 assert(end->op == op_End);
817 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
821 get_End_keepalive(ir_node *end, int pos) {
822 assert(end->op == op_End);
823 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
827 add_End_keepalive (ir_node *end, ir_node *ka) {
829 ir_graph *irg = get_irn_irg(end);
831 assert(end->op == op_End);
832 l = ARR_LEN(end->in);
833 ARR_APP1(ir_node *, end->in, ka);
834 #ifndef NO_KEEPALIVE_OUT_EDGES
835 edges_notify_edge(end, l, end->in[l], NULL, irg);
836 #endif /* NO_KEEPALIVE_OUT_EDGES */
840 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
841 assert(end->op == op_End);
842 end->in[pos + 1 + END_KEEPALIVE_OFFSET] = ka;
843 #ifndef NO_KEEPALIVE_OUT_EDGES
844 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
845 #endif /* NO_KEEPALIVE_OUT_EDGES */
848 /* Set new keep-alives */
849 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
851 ir_graph *irg = get_irn_irg(end);
853 #ifndef NO_KEEPALIVE_OUT_EDGES
854 /* notify that edges are deleted */
855 for (i = 1 + END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in); ++i) {
856 edges_notify_edge(end, i, NULL, end->in[i], irg);
858 #endif /* NO_KEEPALIVE_OUT_EDGES */
859 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
861 for (i = 0; i < n; ++i) {
862 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
863 #ifndef NO_KEEPALIVE_OUT_EDGES
864 edges_notify_edge(end, 1 + END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
865 #endif /* NO_KEEPALIVE_OUT_EDGES */
869 /* Set new keep-alives from old keep-alives, skipping irn */
870 void remove_End_keepalive(ir_node *end, ir_node *irn) {
871 int n = get_End_n_keepalives(end);
875 NEW_ARR_A(ir_node *, in, n);
877 for (idx = i = 0; i < n; ++i) {
878 ir_node *old_ka = get_End_keepalive(end, i);
885 /* set new keep-alives */
886 set_End_keepalives(end, idx, in);
890 free_End (ir_node *end) {
891 assert(end->op == op_End);
894 end->in = NULL; /* @@@ make sure we get an error if we use the
895 in array afterwards ... */
898 /* Return the target address of an IJmp */
899 ir_node *get_IJmp_target(ir_node *ijmp) {
900 assert(ijmp->op == op_IJmp);
901 return get_irn_n(ijmp, 0);
904 /** Sets the target address of an IJmp */
905 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
906 assert(ijmp->op == op_IJmp);
907 set_irn_n(ijmp, 0, tgt);
911 > Implementing the case construct (which is where the constant Proj node is
912 > important) involves far more than simply determining the constant values.
913 > We could argue that this is more properly a function of the translator from
914 > Firm to the target machine. That could be done if there was some way of
915 > projecting "default" out of the Cond node.
916 I know it's complicated.
917 Basically there are two proglems:
918 - determining the gaps between the projs
919 - determining the biggest case constant to know the proj number for
921 I see several solutions:
922 1. Introduce a ProjDefault node. Solves both problems.
923 This means to extend all optimizations executed during construction.
924 2. Give the Cond node for switch two flavors:
925 a) there are no gaps in the projs (existing flavor)
926 b) gaps may exist, default proj is still the Proj with the largest
927 projection number. This covers also the gaps.
928 3. Fix the semantic of the Cond to that of 2b)
930 Solution 2 seems to be the best:
931 Computing the gaps in the Firm representation is not too hard, i.e.,
932 libFIRM can implement a routine that transforms between the two
933 flavours. This is also possible for 1) but 2) does not require to
934 change any existing optimization.
935 Further it should be far simpler to determine the biggest constant than
937 I don't want to choose 3) as 2a) seems to have advantages for
938 dataflow analysis and 3) does not allow to convert the representation to
942 get_Cond_selector(ir_node *node) {
943 assert(node->op == op_Cond);
944 return get_irn_n(node, 0);
948 set_Cond_selector(ir_node *node, ir_node *selector) {
949 assert(node->op == op_Cond);
950 set_irn_n(node, 0, selector);
954 get_Cond_kind(ir_node *node) {
955 assert(node->op == op_Cond);
956 return node->attr.cond.kind;
960 set_Cond_kind(ir_node *node, cond_kind kind) {
961 assert(node->op == op_Cond);
962 node->attr.cond.kind = kind;
966 get_Cond_defaultProj(ir_node *node) {
967 assert(node->op == op_Cond);
968 return node->attr.cond.default_proj;
972 get_Return_mem(ir_node *node) {
973 assert(node->op == op_Return);
974 return get_irn_n(node, 0);
978 set_Return_mem(ir_node *node, ir_node *mem) {
979 assert(node->op == op_Return);
980 set_irn_n(node, 0, mem);
984 get_Return_n_ress(ir_node *node) {
985 assert(node->op == op_Return);
986 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
990 get_Return_res_arr (ir_node *node) {
991 assert((node->op == op_Return));
992 if (get_Return_n_ress(node) > 0)
993 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1000 set_Return_n_res(ir_node *node, int results) {
1001 assert(node->op == op_Return);
1006 get_Return_res(ir_node *node, int pos) {
1007 assert(node->op == op_Return);
1008 assert(get_Return_n_ress(node) > pos);
1009 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1013 set_Return_res(ir_node *node, int pos, ir_node *res){
1014 assert(node->op == op_Return);
1015 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1018 tarval *(get_Const_tarval)(ir_node *node) {
1019 return _get_Const_tarval(node);
1023 set_Const_tarval(ir_node *node, tarval *con) {
1024 assert(node->op == op_Const);
1025 node->attr.con.tv = con;
1028 cnst_classify_t (classify_Const)(ir_node *node) {
1029 return _classify_Const(node);
1033 /* The source language type. Must be an atomic type. Mode of type must
1034 be mode of node. For tarvals from entities type must be pointer to
1037 get_Const_type(ir_node *node) {
1038 assert(node->op == op_Const);
1039 return node->attr.con.tp;
1043 set_Const_type(ir_node *node, ir_type *tp) {
1044 assert(node->op == op_Const);
1045 if (tp != firm_unknown_type) {
1046 assert(is_atomic_type(tp));
1047 assert(get_type_mode(tp) == get_irn_mode(node));
1049 node->attr.con.tp = tp;
1054 get_SymConst_kind(const ir_node *node) {
1055 assert(node->op == op_SymConst);
1056 return node->attr.symc.num;
1060 set_SymConst_kind(ir_node *node, symconst_kind num) {
1061 assert(node->op == op_SymConst);
1062 node->attr.symc.num = num;
1066 get_SymConst_type(ir_node *node) {
1067 assert((node->op == op_SymConst) &&
1068 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1069 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1073 set_SymConst_type(ir_node *node, ir_type *tp) {
1074 assert((node->op == op_SymConst) &&
1075 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1076 node->attr.symc.sym.type_p = tp;
1080 get_SymConst_name(ir_node *node) {
1081 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1082 return node->attr.symc.sym.ident_p;
1086 set_SymConst_name(ir_node *node, ident *name) {
1087 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1088 node->attr.symc.sym.ident_p = name;
1092 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1093 ir_entity *get_SymConst_entity(ir_node *node) {
1094 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1095 return node->attr.symc.sym.entity_p;
1098 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1099 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1100 node->attr.symc.sym.entity_p = ent;
1103 ir_enum_const *get_SymConst_enum(ir_node *node) {
1104 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1105 return node->attr.symc.sym.enum_p;
1108 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1109 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1110 node->attr.symc.sym.enum_p = ec;
1113 union symconst_symbol
1114 get_SymConst_symbol(ir_node *node) {
1115 assert(node->op == op_SymConst);
1116 return node->attr.symc.sym;
1120 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1121 assert(node->op == op_SymConst);
1122 node->attr.symc.sym = sym;
1126 get_SymConst_value_type(ir_node *node) {
1127 assert(node->op == op_SymConst);
1128 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1129 return node->attr.symc.tp;
1133 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1134 assert(node->op == op_SymConst);
1135 node->attr.symc.tp = tp;
1139 get_Sel_mem(ir_node *node) {
1140 assert(node->op == op_Sel);
1141 return get_irn_n(node, 0);
1145 set_Sel_mem(ir_node *node, ir_node *mem) {
1146 assert(node->op == op_Sel);
1147 set_irn_n(node, 0, mem);
1151 get_Sel_ptr(ir_node *node) {
1152 assert(node->op == op_Sel);
1153 return get_irn_n(node, 1);
1157 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1158 assert(node->op == op_Sel);
1159 set_irn_n(node, 1, ptr);
1163 get_Sel_n_indexs(ir_node *node) {
1164 assert(node->op == op_Sel);
1165 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1169 get_Sel_index_arr(ir_node *node) {
1170 assert((node->op == op_Sel));
1171 if (get_Sel_n_indexs(node) > 0)
1172 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1178 get_Sel_index(ir_node *node, int pos) {
1179 assert(node->op == op_Sel);
1180 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1184 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1185 assert(node->op == op_Sel);
1186 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1190 get_Sel_entity(ir_node *node) {
1191 assert(node->op == op_Sel);
1192 return node->attr.sel.ent;
1196 set_Sel_entity(ir_node *node, ir_entity *ent) {
1197 assert(node->op == op_Sel);
1198 node->attr.sel.ent = ent;
1202 /* For unary and binary arithmetic operations the access to the
1203 operands can be factored out. Left is the first, right the
1204 second arithmetic value as listed in tech report 0999-33.
1205 unops are: Minus, Abs, Not, Conv, Cast
1206 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1207 Shr, Shrs, Rotate, Cmp */
1211 get_Call_mem(ir_node *node) {
1212 assert(node->op == op_Call);
1213 return get_irn_n(node, 0);
1217 set_Call_mem(ir_node *node, ir_node *mem) {
1218 assert(node->op == op_Call);
1219 set_irn_n(node, 0, mem);
1223 get_Call_ptr(ir_node *node) {
1224 assert(node->op == op_Call);
1225 return get_irn_n(node, 1);
1229 set_Call_ptr(ir_node *node, ir_node *ptr) {
1230 assert(node->op == op_Call);
1231 set_irn_n(node, 1, ptr);
1235 get_Call_param_arr(ir_node *node) {
1236 assert(node->op == op_Call);
1237 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1241 get_Call_n_params(ir_node *node) {
1242 assert(node->op == op_Call);
1243 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1247 get_Call_arity(ir_node *node) {
1248 assert(node->op == op_Call);
1249 return get_Call_n_params(node);
1253 set_Call_arity(ir_node *node, ir_node *arity) {
1254 assert(node->op == op_Call);
1259 get_Call_param(ir_node *node, int pos) {
1260 assert(node->op == op_Call);
1261 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1265 set_Call_param(ir_node *node, int pos, ir_node *param) {
1266 assert(node->op == op_Call);
1267 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1271 get_Call_type(ir_node *node) {
1272 assert(node->op == op_Call);
1273 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1277 set_Call_type(ir_node *node, ir_type *tp) {
1278 assert(node->op == op_Call);
1279 assert((get_unknown_type() == tp) || is_Method_type(tp));
1280 node->attr.call.cld_tp = tp;
1283 int Call_has_callees(ir_node *node) {
1284 assert(node && node->op == op_Call);
1285 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1286 (node->attr.call.callee_arr != NULL));
1289 int get_Call_n_callees(ir_node * node) {
1290 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1291 return ARR_LEN(node->attr.call.callee_arr);
1294 ir_entity * get_Call_callee(ir_node * node, int pos) {
1295 assert(pos >= 0 && pos < get_Call_n_callees(node));
1296 return node->attr.call.callee_arr[pos];
1299 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1300 assert(node->op == op_Call);
1301 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1302 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1304 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1307 void remove_Call_callee_arr(ir_node * node) {
1308 assert(node->op == op_Call);
1309 node->attr.call.callee_arr = NULL;
1312 ir_node * get_CallBegin_ptr(ir_node *node) {
1313 assert(node->op == op_CallBegin);
1314 return get_irn_n(node, 0);
1317 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1318 assert(node->op == op_CallBegin);
1319 set_irn_n(node, 0, ptr);
1322 ir_node * get_CallBegin_call(ir_node *node) {
1323 assert(node->op == op_CallBegin);
1324 return node->attr.callbegin.call;
1327 void set_CallBegin_call(ir_node *node, ir_node *call) {
1328 assert(node->op == op_CallBegin);
1329 node->attr.callbegin.call = call;
1334 ir_node * get_##OP##_left(ir_node *node) { \
1335 assert(node->op == op_##OP); \
1336 return get_irn_n(node, node->op->op_index); \
1338 void set_##OP##_left(ir_node *node, ir_node *left) { \
1339 assert(node->op == op_##OP); \
1340 set_irn_n(node, node->op->op_index, left); \
1342 ir_node *get_##OP##_right(ir_node *node) { \
1343 assert(node->op == op_##OP); \
1344 return get_irn_n(node, node->op->op_index + 1); \
1346 void set_##OP##_right(ir_node *node, ir_node *right) { \
1347 assert(node->op == op_##OP); \
1348 set_irn_n(node, node->op->op_index + 1, right); \
1352 ir_node *get_##OP##_op(ir_node *node) { \
1353 assert(node->op == op_##OP); \
1354 return get_irn_n(node, node->op->op_index); \
1356 void set_##OP##_op (ir_node *node, ir_node *op) { \
1357 assert(node->op == op_##OP); \
1358 set_irn_n(node, node->op->op_index, op); \
1361 #define BINOP_MEM(OP) \
1365 get_##OP##_mem(ir_node *node) { \
1366 assert(node->op == op_##OP); \
1367 return get_irn_n(node, 0); \
1371 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1372 assert(node->op == op_##OP); \
1373 set_irn_n(node, 0, mem); \
1397 int get_Conv_strict(ir_node *node) {
1398 assert(node->op == op_Conv);
1399 return node->attr.conv.strict;
1402 void set_Conv_strict(ir_node *node, int strict_flag) {
1403 assert(node->op == op_Conv);
1404 node->attr.conv.strict = (char)strict_flag;
1408 get_Cast_type(ir_node *node) {
1409 assert(node->op == op_Cast);
1410 return node->attr.cast.totype;
1414 set_Cast_type(ir_node *node, ir_type *to_tp) {
1415 assert(node->op == op_Cast);
1416 node->attr.cast.totype = to_tp;
1420 /* Checks for upcast.
1422 * Returns true if the Cast node casts a class type to a super type.
1424 int is_Cast_upcast(ir_node *node) {
1425 ir_type *totype = get_Cast_type(node);
1426 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1427 ir_graph *myirg = get_irn_irg(node);
1429 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1432 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1433 totype = get_pointer_points_to_type(totype);
1434 fromtype = get_pointer_points_to_type(fromtype);
1439 if (!is_Class_type(totype)) return 0;
1440 return is_SubClass_of(fromtype, totype);
1443 /* Checks for downcast.
1445 * Returns true if the Cast node casts a class type to a sub type.
1447 int is_Cast_downcast(ir_node *node) {
1448 ir_type *totype = get_Cast_type(node);
1449 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1451 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1454 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1455 totype = get_pointer_points_to_type(totype);
1456 fromtype = get_pointer_points_to_type(fromtype);
1461 if (!is_Class_type(totype)) return 0;
1462 return is_SubClass_of(totype, fromtype);
1466 (is_unop)(const ir_node *node) {
1467 return _is_unop(node);
1471 get_unop_op(ir_node *node) {
1472 if (node->op->opar == oparity_unary)
1473 return get_irn_n(node, node->op->op_index);
1475 assert(node->op->opar == oparity_unary);
1480 set_unop_op(ir_node *node, ir_node *op) {
1481 if (node->op->opar == oparity_unary)
1482 set_irn_n(node, node->op->op_index, op);
1484 assert(node->op->opar == oparity_unary);
1488 (is_binop)(const ir_node *node) {
1489 return _is_binop(node);
1493 get_binop_left(ir_node *node) {
1494 assert(node->op->opar == oparity_binary);
1495 return get_irn_n(node, node->op->op_index);
1499 set_binop_left(ir_node *node, ir_node *left) {
1500 assert(node->op->opar == oparity_binary);
1501 set_irn_n(node, node->op->op_index, left);
1505 get_binop_right(ir_node *node) {
1506 assert(node->op->opar == oparity_binary);
1507 return get_irn_n(node, node->op->op_index + 1);
1511 set_binop_right(ir_node *node, ir_node *right) {
1512 assert(node->op->opar == oparity_binary);
1513 set_irn_n(node, node->op->op_index + 1, right);
1516 int is_Phi(const ir_node *n) {
1522 if (op == op_Filter) return get_interprocedural_view();
1525 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1526 (get_irn_arity(n) > 0));
1531 int is_Phi0(const ir_node *n) {
1534 return ((get_irn_op(n) == op_Phi) &&
1535 (get_irn_arity(n) == 0) &&
1536 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1540 get_Phi_preds_arr(ir_node *node) {
1541 assert(node->op == op_Phi);
1542 return (ir_node **)&(get_irn_in(node)[1]);
1546 get_Phi_n_preds(ir_node *node) {
1547 assert(is_Phi(node) || is_Phi0(node));
1548 return (get_irn_arity(node));
1552 void set_Phi_n_preds(ir_node *node, int n_preds) {
1553 assert(node->op == op_Phi);
1558 get_Phi_pred(ir_node *node, int pos) {
1559 assert(is_Phi(node) || is_Phi0(node));
1560 return get_irn_n(node, pos);
1564 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1565 assert(is_Phi(node) || is_Phi0(node));
1566 set_irn_n(node, pos, pred);
1570 int is_memop(ir_node *node) {
1571 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1574 ir_node *get_memop_mem(ir_node *node) {
1575 assert(is_memop(node));
1576 return get_irn_n(node, 0);
1579 void set_memop_mem(ir_node *node, ir_node *mem) {
1580 assert(is_memop(node));
1581 set_irn_n(node, 0, mem);
1584 ir_node *get_memop_ptr(ir_node *node) {
1585 assert(is_memop(node));
1586 return get_irn_n(node, 1);
1589 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1590 assert(is_memop(node));
1591 set_irn_n(node, 1, ptr);
1595 get_Load_mem(ir_node *node) {
1596 assert(node->op == op_Load);
1597 return get_irn_n(node, 0);
1601 set_Load_mem(ir_node *node, ir_node *mem) {
1602 assert(node->op == op_Load);
1603 set_irn_n(node, 0, mem);
1607 get_Load_ptr(ir_node *node) {
1608 assert(node->op == op_Load);
1609 return get_irn_n(node, 1);
1613 set_Load_ptr(ir_node *node, ir_node *ptr) {
1614 assert(node->op == op_Load);
1615 set_irn_n(node, 1, ptr);
1619 get_Load_mode(ir_node *node) {
1620 assert(node->op == op_Load);
1621 return node->attr.load.load_mode;
1625 set_Load_mode(ir_node *node, ir_mode *mode) {
1626 assert(node->op == op_Load);
1627 node->attr.load.load_mode = mode;
1631 get_Load_volatility(ir_node *node) {
1632 assert(node->op == op_Load);
1633 return node->attr.load.volatility;
1637 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1638 assert(node->op == op_Load);
1639 node->attr.load.volatility = volatility;
1644 get_Store_mem(ir_node *node) {
1645 assert(node->op == op_Store);
1646 return get_irn_n(node, 0);
1650 set_Store_mem(ir_node *node, ir_node *mem) {
1651 assert(node->op == op_Store);
1652 set_irn_n(node, 0, mem);
1656 get_Store_ptr(ir_node *node) {
1657 assert(node->op == op_Store);
1658 return get_irn_n(node, 1);
1662 set_Store_ptr(ir_node *node, ir_node *ptr) {
1663 assert(node->op == op_Store);
1664 set_irn_n(node, 1, ptr);
1668 get_Store_value(ir_node *node) {
1669 assert(node->op == op_Store);
1670 return get_irn_n(node, 2);
1674 set_Store_value(ir_node *node, ir_node *value) {
1675 assert(node->op == op_Store);
1676 set_irn_n(node, 2, value);
1680 get_Store_volatility(ir_node *node) {
1681 assert(node->op == op_Store);
1682 return node->attr.store.volatility;
1686 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1687 assert(node->op == op_Store);
1688 node->attr.store.volatility = volatility;
1693 get_Alloc_mem(ir_node *node) {
1694 assert(node->op == op_Alloc);
1695 return get_irn_n(node, 0);
1699 set_Alloc_mem(ir_node *node, ir_node *mem) {
1700 assert(node->op == op_Alloc);
1701 set_irn_n(node, 0, mem);
1705 get_Alloc_size(ir_node *node) {
1706 assert(node->op == op_Alloc);
1707 return get_irn_n(node, 1);
1711 set_Alloc_size(ir_node *node, ir_node *size) {
1712 assert(node->op == op_Alloc);
1713 set_irn_n(node, 1, size);
1717 get_Alloc_type(ir_node *node) {
1718 assert(node->op == op_Alloc);
1719 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1723 set_Alloc_type(ir_node *node, ir_type *tp) {
1724 assert(node->op == op_Alloc);
1725 node->attr.alloc.type = tp;
1729 get_Alloc_where(ir_node *node) {
1730 assert(node->op == op_Alloc);
1731 return node->attr.alloc.where;
1735 set_Alloc_where(ir_node *node, where_alloc where) {
1736 assert(node->op == op_Alloc);
1737 node->attr.alloc.where = where;
1742 get_Free_mem(ir_node *node) {
1743 assert(node->op == op_Free);
1744 return get_irn_n(node, 0);
1748 set_Free_mem(ir_node *node, ir_node *mem) {
1749 assert(node->op == op_Free);
1750 set_irn_n(node, 0, mem);
1754 get_Free_ptr(ir_node *node) {
1755 assert(node->op == op_Free);
1756 return get_irn_n(node, 1);
1760 set_Free_ptr(ir_node *node, ir_node *ptr) {
1761 assert(node->op == op_Free);
1762 set_irn_n(node, 1, ptr);
1766 get_Free_size(ir_node *node) {
1767 assert(node->op == op_Free);
1768 return get_irn_n(node, 2);
1772 set_Free_size(ir_node *node, ir_node *size) {
1773 assert(node->op == op_Free);
1774 set_irn_n(node, 2, size);
1778 get_Free_type(ir_node *node) {
1779 assert(node->op == op_Free);
1780 return node->attr.free.type = skip_tid(node->attr.free.type);
1784 set_Free_type(ir_node *node, ir_type *tp) {
1785 assert(node->op == op_Free);
1786 node->attr.free.type = tp;
1790 get_Free_where(ir_node *node) {
1791 assert(node->op == op_Free);
1792 return node->attr.free.where;
1796 set_Free_where(ir_node *node, where_alloc where) {
1797 assert(node->op == op_Free);
1798 node->attr.free.where = where;
1801 ir_node **get_Sync_preds_arr(ir_node *node) {
1802 assert(node->op == op_Sync);
1803 return (ir_node **)&(get_irn_in(node)[1]);
1806 int get_Sync_n_preds(ir_node *node) {
1807 assert(node->op == op_Sync);
1808 return (get_irn_arity(node));
1812 void set_Sync_n_preds(ir_node *node, int n_preds) {
1813 assert(node->op == op_Sync);
1817 ir_node *get_Sync_pred(ir_node *node, int pos) {
1818 assert(node->op == op_Sync);
1819 return get_irn_n(node, pos);
1822 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1823 assert(node->op == op_Sync);
1824 set_irn_n(node, pos, pred);
1827 /* Add a new Sync predecessor */
1828 void add_Sync_pred(ir_node *node, ir_node *pred) {
1830 ir_graph *irg = get_irn_irg(node);
1832 assert(node->op == op_Sync);
1833 l = ARR_LEN(node->in);
1834 ARR_APP1(ir_node *, node->in, pred);
1835 edges_notify_edge(node, l, node->in[l], NULL, irg);
1838 /* Returns the source language type of a Proj node. */
1839 ir_type *get_Proj_type(ir_node *n) {
1840 ir_type *tp = firm_unknown_type;
1841 ir_node *pred = get_Proj_pred(n);
1843 switch (get_irn_opcode(pred)) {
1846 /* Deal with Start / Call here: we need to know the Proj Nr. */
1847 assert(get_irn_mode(pred) == mode_T);
1848 pred_pred = get_Proj_pred(pred);
1849 if (get_irn_op(pred_pred) == op_Start) {
1850 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1851 tp = get_method_param_type(mtp, get_Proj_proj(n));
1852 } else if (get_irn_op(pred_pred) == op_Call) {
1853 ir_type *mtp = get_Call_type(pred_pred);
1854 tp = get_method_res_type(mtp, get_Proj_proj(n));
1857 case iro_Start: break;
1858 case iro_Call: break;
1860 ir_node *a = get_Load_ptr(pred);
1862 tp = get_entity_type(get_Sel_entity(a));
1871 get_Proj_pred(const ir_node *node) {
1872 assert(is_Proj(node));
1873 return get_irn_n(node, 0);
1877 set_Proj_pred(ir_node *node, ir_node *pred) {
1878 assert(is_Proj(node));
1879 set_irn_n(node, 0, pred);
1883 get_Proj_proj(const ir_node *node) {
1884 assert(is_Proj(node));
1885 if (get_irn_opcode(node) == iro_Proj) {
1886 return node->attr.proj;
1888 assert(get_irn_opcode(node) == iro_Filter);
1889 return node->attr.filter.proj;
1894 set_Proj_proj(ir_node *node, long proj) {
1895 assert(node->op == op_Proj);
1896 node->attr.proj = proj;
1900 get_Tuple_preds_arr(ir_node *node) {
1901 assert(node->op == op_Tuple);
1902 return (ir_node **)&(get_irn_in(node)[1]);
1906 get_Tuple_n_preds(ir_node *node) {
1907 assert(node->op == op_Tuple);
1908 return (get_irn_arity(node));
1913 set_Tuple_n_preds(ir_node *node, int n_preds) {
1914 assert(node->op == op_Tuple);
1919 get_Tuple_pred (ir_node *node, int pos) {
1920 assert(node->op == op_Tuple);
1921 return get_irn_n(node, pos);
1925 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
1926 assert(node->op == op_Tuple);
1927 set_irn_n(node, pos, pred);
1931 get_Id_pred(ir_node *node) {
1932 assert(node->op == op_Id);
1933 return get_irn_n(node, 0);
1937 set_Id_pred(ir_node *node, ir_node *pred) {
1938 assert(node->op == op_Id);
1939 set_irn_n(node, 0, pred);
1942 ir_node *get_Confirm_value(ir_node *node) {
1943 assert(node->op == op_Confirm);
1944 return get_irn_n(node, 0);
1947 void set_Confirm_value(ir_node *node, ir_node *value) {
1948 assert(node->op == op_Confirm);
1949 set_irn_n(node, 0, value);
1952 ir_node *get_Confirm_bound(ir_node *node) {
1953 assert(node->op == op_Confirm);
1954 return get_irn_n(node, 1);
1957 void set_Confirm_bound(ir_node *node, ir_node *bound) {
1958 assert(node->op == op_Confirm);
1959 set_irn_n(node, 0, bound);
1962 pn_Cmp get_Confirm_cmp(ir_node *node) {
1963 assert(node->op == op_Confirm);
1964 return node->attr.confirm_cmp;
1967 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
1968 assert(node->op == op_Confirm);
1969 node->attr.confirm_cmp = cmp;
1974 get_Filter_pred(ir_node *node) {
1975 assert(node->op == op_Filter);
1980 set_Filter_pred(ir_node *node, ir_node *pred) {
1981 assert(node->op == op_Filter);
1986 get_Filter_proj(ir_node *node) {
1987 assert(node->op == op_Filter);
1988 return node->attr.filter.proj;
1992 set_Filter_proj(ir_node *node, long proj) {
1993 assert(node->op == op_Filter);
1994 node->attr.filter.proj = proj;
1997 /* Don't use get_irn_arity, get_irn_n in implementation as access
1998 shall work independent of view!!! */
1999 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2000 assert(node->op == op_Filter);
2001 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2002 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2003 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2004 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2005 node->attr.filter.in_cg[0] = node->in[0];
2007 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2010 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2011 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2012 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2013 node->attr.filter.in_cg[pos + 1] = pred;
2016 int get_Filter_n_cg_preds(ir_node *node) {
2017 assert(node->op == op_Filter && node->attr.filter.in_cg);
2018 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2021 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2023 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2025 arity = ARR_LEN(node->attr.filter.in_cg);
2026 assert(pos < arity - 1);
2027 return node->attr.filter.in_cg[pos + 1];
2031 ir_node *get_Mux_sel(ir_node *node) {
2032 if (node->op == op_Psi) {
2033 assert(get_irn_arity(node) == 3);
2034 return get_Psi_cond(node, 0);
2036 assert(node->op == op_Mux);
2040 void set_Mux_sel(ir_node *node, ir_node *sel) {
2041 if (node->op == op_Psi) {
2042 assert(get_irn_arity(node) == 3);
2043 set_Psi_cond(node, 0, sel);
2045 assert(node->op == op_Mux);
2050 ir_node *get_Mux_false(ir_node *node) {
2051 if (node->op == op_Psi) {
2052 assert(get_irn_arity(node) == 3);
2053 return get_Psi_default(node);
2055 assert(node->op == op_Mux);
2059 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2060 if (node->op == op_Psi) {
2061 assert(get_irn_arity(node) == 3);
2062 set_Psi_default(node, ir_false);
2064 assert(node->op == op_Mux);
2065 node->in[2] = ir_false;
2069 ir_node *get_Mux_true(ir_node *node) {
2070 if (node->op == op_Psi) {
2071 assert(get_irn_arity(node) == 3);
2072 return get_Psi_val(node, 0);
2074 assert(node->op == op_Mux);
2078 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2079 if (node->op == op_Psi) {
2080 assert(get_irn_arity(node) == 3);
2081 set_Psi_val(node, 0, ir_true);
2083 assert(node->op == op_Mux);
2084 node->in[3] = ir_true;
2089 ir_node *get_Psi_cond(ir_node *node, int pos) {
2090 int num_conds = get_Psi_n_conds(node);
2091 assert(node->op == op_Psi);
2092 assert(pos < num_conds);
2093 return get_irn_n(node, 2 * pos);
2096 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2097 int num_conds = get_Psi_n_conds(node);
2098 assert(node->op == op_Psi);
2099 assert(pos < num_conds);
2100 set_irn_n(node, 2 * pos, cond);
2103 ir_node *get_Psi_val(ir_node *node, int pos) {
2104 int num_vals = get_Psi_n_conds(node);
2105 assert(node->op == op_Psi);
2106 assert(pos < num_vals);
2107 return get_irn_n(node, 2 * pos + 1);
2110 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2111 int num_vals = get_Psi_n_conds(node);
2112 assert(node->op == op_Psi);
2113 assert(pos < num_vals);
2114 set_irn_n(node, 2 * pos + 1, val);
2117 ir_node *get_Psi_default(ir_node *node) {
2118 int def_pos = get_irn_arity(node) - 1;
2119 assert(node->op == op_Psi);
2120 return get_irn_n(node, def_pos);
2123 void set_Psi_default(ir_node *node, ir_node *val) {
2124 int def_pos = get_irn_arity(node);
2125 assert(node->op == op_Psi);
2126 set_irn_n(node, def_pos, val);
2129 int (get_Psi_n_conds)(ir_node *node) {
2130 return _get_Psi_n_conds(node);
2134 ir_node *get_CopyB_mem(ir_node *node) {
2135 assert(node->op == op_CopyB);
2136 return get_irn_n(node, 0);
2139 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2140 assert(node->op == op_CopyB);
2141 set_irn_n(node, 0, mem);
2144 ir_node *get_CopyB_dst(ir_node *node) {
2145 assert(node->op == op_CopyB);
2146 return get_irn_n(node, 1);
2149 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2150 assert(node->op == op_CopyB);
2151 set_irn_n(node, 1, dst);
2154 ir_node *get_CopyB_src (ir_node *node) {
2155 assert(node->op == op_CopyB);
2156 return get_irn_n(node, 2);
2159 void set_CopyB_src(ir_node *node, ir_node *src) {
2160 assert(node->op == op_CopyB);
2161 set_irn_n(node, 2, src);
2164 ir_type *get_CopyB_type(ir_node *node) {
2165 assert(node->op == op_CopyB);
2166 return node->attr.copyb.data_type;
2169 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2170 assert(node->op == op_CopyB && data_type);
2171 node->attr.copyb.data_type = data_type;
2176 get_InstOf_type(ir_node *node) {
2177 assert(node->op = op_InstOf);
2178 return node->attr.instof.type;
2182 set_InstOf_type(ir_node *node, ir_type *type) {
2183 assert(node->op = op_InstOf);
2184 node->attr.instof.type = type;
2188 get_InstOf_store(ir_node *node) {
2189 assert(node->op = op_InstOf);
2190 return get_irn_n(node, 0);
2194 set_InstOf_store(ir_node *node, ir_node *obj) {
2195 assert(node->op = op_InstOf);
2196 set_irn_n(node, 0, obj);
2200 get_InstOf_obj(ir_node *node) {
2201 assert(node->op = op_InstOf);
2202 return get_irn_n(node, 1);
2206 set_InstOf_obj(ir_node *node, ir_node *obj) {
2207 assert(node->op = op_InstOf);
2208 set_irn_n(node, 1, obj);
2211 /* Returns the memory input of a Raise operation. */
2213 get_Raise_mem(ir_node *node) {
2214 assert(node->op == op_Raise);
2215 return get_irn_n(node, 0);
2219 set_Raise_mem(ir_node *node, ir_node *mem) {
2220 assert(node->op == op_Raise);
2221 set_irn_n(node, 0, mem);
2225 get_Raise_exo_ptr(ir_node *node) {
2226 assert(node->op == op_Raise);
2227 return get_irn_n(node, 1);
2231 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2232 assert(node->op == op_Raise);
2233 set_irn_n(node, 1, exo_ptr);
2238 /* Returns the memory input of a Bound operation. */
2239 ir_node *get_Bound_mem(ir_node *bound) {
2240 assert(bound->op == op_Bound);
2241 return get_irn_n(bound, 0);
2244 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2245 assert(bound->op == op_Bound);
2246 set_irn_n(bound, 0, mem);
2249 /* Returns the index input of a Bound operation. */
2250 ir_node *get_Bound_index(ir_node *bound) {
2251 assert(bound->op == op_Bound);
2252 return get_irn_n(bound, 1);
2255 void set_Bound_index(ir_node *bound, ir_node *idx) {
2256 assert(bound->op == op_Bound);
2257 set_irn_n(bound, 1, idx);
2260 /* Returns the lower bound input of a Bound operation. */
2261 ir_node *get_Bound_lower(ir_node *bound) {
2262 assert(bound->op == op_Bound);
2263 return get_irn_n(bound, 2);
2266 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2267 assert(bound->op == op_Bound);
2268 set_irn_n(bound, 2, lower);
2271 /* Returns the upper bound input of a Bound operation. */
2272 ir_node *get_Bound_upper(ir_node *bound) {
2273 assert(bound->op == op_Bound);
2274 return get_irn_n(bound, 3);
2277 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2278 assert(bound->op == op_Bound);
2279 set_irn_n(bound, 3, upper);
2282 /* Return the operand of a Pin node. */
2283 ir_node *get_Pin_op(ir_node *pin) {
2284 assert(pin->op == op_Pin);
2285 return get_irn_n(pin, 0);
2288 void set_Pin_op(ir_node *pin, ir_node *node) {
2289 assert(pin->op == op_Pin);
2290 set_irn_n(pin, 0, node);
2294 /* returns the graph of a node */
2296 get_irn_irg(const ir_node *node) {
2298 * Do not use get_nodes_Block() here, because this
2299 * will check the pinned state.
2300 * However even a 'wrong' block is always in the proper
2303 if (! is_Block(node))
2304 node = get_irn_n(node, -1);
2305 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2306 node = get_irn_n(node, -1);
2307 assert(get_irn_op(node) == op_Block);
2308 return node->attr.block.irg;
2312 /*----------------------------------------------------------------*/
2313 /* Auxiliary routines */
2314 /*----------------------------------------------------------------*/
2317 skip_Proj(ir_node *node) {
2318 /* don't assert node !!! */
2323 node = get_Proj_pred(node);
2329 skip_Proj_const(const ir_node *node) {
2330 /* don't assert node !!! */
2335 node = get_Proj_pred(node);
2341 skip_Tuple(ir_node *node) {
2345 if (!get_opt_normalize()) return node;
2348 if (get_irn_op(node) == op_Proj) {
2349 pred = get_Proj_pred(node);
2350 op = get_irn_op(pred);
2353 * Looks strange but calls get_irn_op() only once
2354 * in most often cases.
2356 if (op == op_Proj) { /* nested Tuple ? */
2357 pred = skip_Tuple(pred);
2358 op = get_irn_op(pred);
2360 if (op == op_Tuple) {
2361 node = get_Tuple_pred(pred, get_Proj_proj(node));
2364 } else if (op == op_Tuple) {
2365 node = get_Tuple_pred(pred, get_Proj_proj(node));
2372 /* returns operand of node if node is a Cast */
2373 ir_node *skip_Cast(ir_node *node) {
2374 if (get_irn_op(node) == op_Cast)
2375 return get_Cast_op(node);
2379 /* returns operand of node if node is a Confirm */
2380 ir_node *skip_Confirm(ir_node *node) {
2381 if (get_irn_op(node) == op_Confirm)
2382 return get_Confirm_value(node);
2386 /* skip all high-level ops */
2387 ir_node *skip_HighLevel(ir_node *node) {
2388 if (is_op_highlevel(get_irn_op(node)))
2389 return get_irn_n(node, 0);
2394 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2395 * than any other approach, as Id chains are resolved and all point to the real node, or
2396 * all id's are self loops.
2398 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2399 * a little bit "hand optimized".
2401 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2404 skip_Id(ir_node *node) {
2406 /* don't assert node !!! */
2408 if (!node || (node->op != op_Id)) return node;
2410 /* Don't use get_Id_pred(): We get into an endless loop for
2411 self-referencing Ids. */
2412 pred = node->in[0+1];
2414 if (pred->op != op_Id) return pred;
2416 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2417 ir_node *rem_pred, *res;
2419 if (pred->op != op_Id) return pred; /* shortcut */
2422 assert(get_irn_arity (node) > 0);
2424 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2425 res = skip_Id(rem_pred);
2426 if (res->op == op_Id) /* self-loop */ return node;
2428 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2435 void skip_Id_and_store(ir_node **node) {
2438 if (!n || (n->op != op_Id)) return;
2440 /* Don't use get_Id_pred(): We get into an endless loop for
2441 self-referencing Ids. */
2446 (is_Bad)(const ir_node *node) {
2447 return _is_Bad(node);
2451 (is_NoMem)(const ir_node *node) {
2452 return _is_NoMem(node);
2456 (is_Mod)(const ir_node *node) {
2457 return _is_Mod(node);
2461 (is_Div)(const ir_node *node) {
2462 return _is_Div(node);
2466 (is_DivMod)(const ir_node *node) {
2467 return _is_DivMod(node);
2471 (is_Quot)(const ir_node *node) {
2472 return _is_Quot(node);
2476 (is_Start)(const ir_node *node) {
2477 return _is_Start(node);
2481 (is_End)(const ir_node *node) {
2482 return _is_End(node);
2486 (is_Const)(const ir_node *node) {
2487 return _is_Const(node);
2491 (is_no_Block)(const ir_node *node) {
2492 return _is_no_Block(node);
2496 (is_Block)(const ir_node *node) {
2497 return _is_Block(node);
2500 /* returns true if node is an Unknown node. */
2502 (is_Unknown)(const ir_node *node) {
2503 return _is_Unknown(node);
2506 /* returns true if node is a Return node. */
2508 (is_Return)(const ir_node *node) {
2509 return _is_Return(node);
2512 /* returns true if node is a Call node. */
2514 (is_Call)(const ir_node *node) {
2515 return _is_Call(node);
2518 /* returns true if node is a Sel node. */
2520 (is_Sel)(const ir_node *node) {
2521 return _is_Sel(node);
2524 /* returns true if node is a Mux node or a Psi with only one condition. */
2526 (is_Mux)(const ir_node *node) {
2527 return _is_Mux(node);
2530 /* returns true if node is a Load node. */
2532 (is_Load)(const ir_node *node) {
2533 return _is_Load(node);
2536 /* returns true if node is a Load node. */
2538 (is_Store)(const ir_node *node) {
2539 return _is_Store(node);
2542 /* returns true if node is a Sync node. */
2544 (is_Sync)(const ir_node *node) {
2545 return _is_Sync(node);
2548 /* returns true if node is a Confirm node. */
2550 (is_Confirm)(const ir_node *node) {
2551 return _is_Confirm(node);
2554 /* returns true if node is a Pin node. */
2556 (is_Pin)(const ir_node *node) {
2557 return _is_Pin(node);
2560 /* returns true if node is a SymConst node. */
2562 (is_SymConst)(const ir_node *node) {
2563 return _is_SymConst(node);
2566 /* returns true if node is a Cond node. */
2568 (is_Cond)(const ir_node *node) {
2569 return _is_Cond(node);
2573 (is_CopyB)(const ir_node *node) {
2574 return _is_CopyB(node);
2577 /* returns true if node is a Cmp node. */
2579 (is_Cmp)(const ir_node *node) {
2580 return _is_Cmp(node);
2583 /* returns true if node is an Alloc node. */
2585 (is_Alloc)(const ir_node *node) {
2586 return _is_Alloc(node);
2589 /* returns true if a node is a Jmp node. */
2591 (is_Jmp)(const ir_node *node) {
2592 return _is_Jmp(node);
2595 /* returns true if a node is a Raise node. */
2597 (is_Raise)(const ir_node *node) {
2598 return _is_Raise(node);
2602 is_Proj(const ir_node *node) {
2604 return node->op == op_Proj ||
2605 (!get_interprocedural_view() && node->op == op_Filter);
2608 /* Returns true if the operation manipulates control flow. */
2610 is_cfop(const ir_node *node) {
2611 return is_cfopcode(get_irn_op(node));
2614 /* Returns true if the operation manipulates interprocedural control flow:
2615 CallBegin, EndReg, EndExcept */
2616 int is_ip_cfop(const ir_node *node) {
2617 return is_ip_cfopcode(get_irn_op(node));
2620 /* Returns true if the operation can change the control flow because
2623 is_fragile_op(const ir_node *node) {
2624 return is_op_fragile(get_irn_op(node));
2627 /* Returns the memory operand of fragile operations. */
2628 ir_node *get_fragile_op_mem(ir_node *node) {
2629 assert(node && is_fragile_op(node));
2631 switch (get_irn_opcode (node)) {
2641 return get_irn_n(node, 0);
2646 assert(0 && "should not be reached");
2651 /* Returns true if the operation is a forking control flow operation. */
2652 int (is_irn_forking)(const ir_node *node) {
2653 return _is_irn_forking(node);
2656 /* Return the type associated with the value produced by n
2657 * if the node remarks this type as it is the case for
2658 * Cast, Const, SymConst and some Proj nodes. */
2659 ir_type *(get_irn_type)(ir_node *node) {
2660 return _get_irn_type(node);
2663 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2665 ir_type *(get_irn_type_attr)(ir_node *node) {
2666 return _get_irn_type_attr(node);
2669 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2670 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2671 return _get_irn_entity_attr(node);
2674 /* Returns non-zero for constant-like nodes. */
2675 int (is_irn_constlike)(const ir_node *node) {
2676 return _is_irn_constlike(node);
2680 * Returns non-zero for nodes that are allowed to have keep-alives and
2681 * are neither Block nor PhiM.
2683 int (is_irn_keep)(const ir_node *node) {
2684 return _is_irn_keep(node);
2688 * Returns non-zero for nodes that are always placed in the start block.
2690 int (is_irn_start_block_placed)(const ir_node *node) {
2691 return _is_irn_start_block_placed(node);
2694 /* Returns non-zero for nodes that are machine operations. */
2695 int (is_irn_machine_op)(const ir_node *node) {
2696 return _is_irn_machine_op(node);
2699 /* Returns non-zero for nodes that are machine operands. */
2700 int (is_irn_machine_operand)(const ir_node *node) {
2701 return _is_irn_machine_operand(node);
2704 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2705 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2706 return _is_irn_machine_user(node, n);
2710 /* Gets the string representation of the jump prediction .*/
2711 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2714 case COND_JMP_PRED_NONE: return "no prediction";
2715 case COND_JMP_PRED_TRUE: return "true taken";
2716 case COND_JMP_PRED_FALSE: return "false taken";
2720 /* Returns the conditional jump prediction of a Cond node. */
2721 cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
2722 return _get_Cond_jmp_pred(cond);
2725 /* Sets a new conditional jump prediction. */
2726 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2727 _set_Cond_jmp_pred(cond, pred);
2730 /** the get_type operation must be always implemented and return a firm type */
2731 static ir_type *get_Default_type(ir_node *n) {
2732 return get_unknown_type();
2735 /* Sets the get_type operation for an ir_op_ops. */
2736 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2738 case iro_Const: ops->get_type = get_Const_type; break;
2739 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2740 case iro_Cast: ops->get_type = get_Cast_type; break;
2741 case iro_Proj: ops->get_type = get_Proj_type; break;
2743 /* not allowed to be NULL */
2744 if (! ops->get_type)
2745 ops->get_type = get_Default_type;
2751 /** Return the attribute type of a SymConst node if exists */
2752 static ir_type *get_SymConst_attr_type(ir_node *self) {
2753 symconst_kind kind = get_SymConst_kind(self);
2754 if (SYMCONST_HAS_TYPE(kind))
2755 return get_SymConst_type(self);
2759 /** Return the attribute entity of a SymConst node if exists */
2760 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
2761 symconst_kind kind = get_SymConst_kind(self);
2762 if (SYMCONST_HAS_ENT(kind))
2763 return get_SymConst_entity(self);
2767 /** the get_type_attr operation must be always implemented */
2768 static ir_type *get_Null_type(ir_node *n) {
2769 return firm_unknown_type;
2772 /* Sets the get_type operation for an ir_op_ops. */
2773 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
2775 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2776 case iro_Call: ops->get_type_attr = get_Call_type; break;
2777 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2778 case iro_Free: ops->get_type_attr = get_Free_type; break;
2779 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2781 /* not allowed to be NULL */
2782 if (! ops->get_type_attr)
2783 ops->get_type_attr = get_Null_type;
2789 /** the get_entity_attr operation must be always implemented */
2790 static ir_entity *get_Null_ent(ir_node *n) {
2794 /* Sets the get_type operation for an ir_op_ops. */
2795 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
2797 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2798 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2800 /* not allowed to be NULL */
2801 if (! ops->get_entity_attr)
2802 ops->get_entity_attr = get_Null_ent;
2808 #ifdef DEBUG_libfirm
2809 void dump_irn(ir_node *n) {
2810 int i, arity = get_irn_arity(n);
2811 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2813 ir_node *pred = get_irn_n(n, -1);
2814 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2815 get_irn_node_nr(pred), (void *)pred);
2817 printf(" preds: \n");
2818 for (i = 0; i < arity; ++i) {
2819 ir_node *pred = get_irn_n(n, i);
2820 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2821 get_irn_node_nr(pred), (void *)pred);
2825 #else /* DEBUG_libfirm */
2826 void dump_irn(ir_node *n) {}
2827 #endif /* DEBUG_libfirm */