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
9 * Copyright: (c) 1998-2003 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 "iredges_t.h"
35 /* some constants fixing the positions of nodes predecessors
37 #define CALL_PARAM_OFFSET 2
38 #define FUNCCALL_PARAM_OFFSET 1
39 #define SEL_INDEX_OFFSET 2
40 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
41 #define END_KEEPALIVE_OFFSET 0
43 static const char *pnc_name_arr [] = {
44 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
45 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
46 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
47 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
51 * returns the pnc name from an pnc constant
53 const char *get_pnc_string(int pnc) {
54 return pnc_name_arr[pnc];
58 * Calculates the negated (Complement(R)) pnc condition.
60 int get_negated_pnc(int pnc, ir_mode *mode) {
63 /* do NOT add the Uo bit for non-floating point values */
64 if (! mode_is_float(mode))
70 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
72 get_inversed_pnc(int pnc) {
73 int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
74 int lesser = pnc & pn_Cmp_Lt;
75 int greater = pnc & pn_Cmp_Gt;
77 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
82 const char *pns_name_arr [] = {
83 "initial_exec", "global_store",
84 "frame_base", "globals", "args"
87 const char *symconst_name_arr [] = {
88 "type_tag", "size", "addr_name", "addr_ent"
92 * Indicates, whether additional data can be registered to ir nodes.
93 * If set to 1, this is not possible anymore.
95 static int forbid_new_data = 0;
98 * The amount of additional space for custom data to be allocated upon
99 * creating a new node.
101 unsigned firm_add_node_size = 0;
104 /* register new space for every node */
105 unsigned register_additional_node_data(unsigned size) {
106 assert(!forbid_new_data && "Too late to register additional node data");
111 return firm_add_node_size += size;
117 /* Forbid the addition of new data to an ir node. */
122 * irnode constructor.
123 * Create a new irnode in irg, with an op, mode, arity and
124 * some incoming irnodes.
125 * If arity is negative, a node with a dynamic array is created.
128 new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
129 int arity, ir_node **in)
132 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
135 assert(irg && op && mode);
136 p = obstack_alloc (irg->obst, node_size);
137 memset(p, 0, node_size);
138 res = (ir_node *) (p + firm_add_node_size);
140 res->kind = k_ir_node;
146 res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
148 res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
149 memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
153 set_irn_dbg_info(res, db);
157 res->node_nr = get_irp_new_node_nr();
160 #if FIRM_EDGES_INPLACE
163 int not_a_block = is_no_Block(res);
165 INIT_LIST_HEAD(&res->edge_info.outs_head);
167 INIT_LIST_HEAD(&res->attr.block.succ_head);
170 for (i = 0, n = arity + not_a_block; i < n; ++i)
171 edges_notify_edge(res, i - not_a_block, res->in[i], NULL, irg);
175 hook_new_node(irg, res);
180 /*-- getting some parameters from ir_nodes --*/
183 (is_ir_node)(const void *thing) {
184 return _is_ir_node(thing);
188 (get_irn_intra_arity)(const ir_node *node) {
189 return _get_irn_intra_arity(node);
193 (get_irn_inter_arity)(const ir_node *node) {
194 return _get_irn_inter_arity(node);
197 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
200 (get_irn_arity)(const ir_node *node) {
201 return _get_irn_arity(node);
204 /* Returns the array with ins. This array is shifted with respect to the
205 array accessed by get_irn_n: The block operand is at position 0 not -1.
206 (@@@ This should be changed.)
207 The order of the predecessors in this array is not guaranteed, except that
208 lists of operands as predecessors of Block or arguments of a Call are
211 get_irn_in (const ir_node *node) {
213 if (get_interprocedural_view()) { /* handle Filter and Block specially */
214 if (get_irn_opcode(node) == iro_Filter) {
215 assert(node->attr.filter.in_cg);
216 return node->attr.filter.in_cg;
217 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
218 return node->attr.block.in_cg;
220 /* else fall through */
226 set_irn_in (ir_node *node, int arity, ir_node **in) {
229 ir_graph *irg = current_ir_graph;
231 if (get_interprocedural_view()) { /* handle Filter and Block specially */
232 if (get_irn_opcode(node) == iro_Filter) {
233 assert(node->attr.filter.in_cg);
234 arr = &node->attr.filter.in_cg;
235 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
236 arr = &node->attr.block.in_cg;
244 for (i = 0; i < arity; i++) {
245 if (i < ARR_LEN(*arr)-1)
246 edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
248 edges_notify_edge(node, i, in[i], NULL, irg);
250 for(;i < ARR_LEN(*arr)-1; i++) {
251 edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
254 if (arity != ARR_LEN(*arr) - 1) {
255 ir_node * block = (*arr)[0];
256 *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
259 fix_backedges(irg->obst, node);
261 memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
265 (get_irn_intra_n)(const ir_node *node, int n) {
266 return _get_irn_intra_n (node, n);
270 (get_irn_inter_n)(const ir_node *node, int n) {
271 return _get_irn_inter_n (node, n);
274 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
277 (get_irn_n)(const ir_node *node, int n) {
278 return _get_irn_n(node, n);
282 set_irn_n (ir_node *node, int n, ir_node *in) {
283 assert(node && node->kind == k_ir_node);
285 assert(n < get_irn_arity(node));
286 assert(in && in->kind == k_ir_node);
288 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
289 /* Change block pred in both views! */
290 node->in[n + 1] = in;
291 assert(node->attr.filter.in_cg);
292 node->attr.filter.in_cg[n + 1] = in;
295 if (get_interprocedural_view()) { /* handle Filter and Block specially */
296 if (get_irn_opcode(node) == iro_Filter) {
297 assert(node->attr.filter.in_cg);
298 node->attr.filter.in_cg[n + 1] = in;
300 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
301 node->attr.block.in_cg[n + 1] = in;
304 /* else fall through */
308 hook_set_irn_n(node, n, in, node->in[n + 1]);
310 /* Here, we rely on src and tgt being in the current ir graph */
311 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
313 node->in[n + 1] = in;
317 (get_irn_mode)(const ir_node *node) {
318 return _get_irn_mode(node);
322 (set_irn_mode)(ir_node *node, ir_mode *mode)
324 _set_irn_mode(node, mode);
328 get_irn_modecode (const ir_node *node)
331 return node->mode->code;
334 /** Gets the string representation of the mode .*/
336 get_irn_modename (const ir_node *node)
339 return get_mode_name(node->mode);
343 get_irn_modeident (const ir_node *node)
346 return get_mode_ident(node->mode);
350 (get_irn_op)(const ir_node *node)
352 return _get_irn_op(node);
355 /* should be private to the library: */
357 set_irn_op (ir_node *node, ir_op *op)
364 (get_irn_opcode)(const ir_node *node)
366 return _get_irn_opcode(node);
370 get_irn_opname (const ir_node *node)
373 if ((get_irn_op((ir_node *)node) == op_Phi) &&
374 (get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
375 (get_irn_arity((ir_node *)node) == 0)) return "Phi0";
376 return get_id_str(node->op->name);
380 get_irn_opident (const ir_node *node)
383 return node->op->name;
387 (get_irn_visited)(const ir_node *node)
389 return _get_irn_visited(node);
393 (set_irn_visited)(ir_node *node, unsigned long visited)
395 _set_irn_visited(node, visited);
399 (mark_irn_visited)(ir_node *node) {
400 _mark_irn_visited(node);
404 (irn_not_visited)(const ir_node *node) {
405 return _irn_not_visited(node);
409 (irn_visited)(const ir_node *node) {
410 return _irn_visited(node);
414 (set_irn_link)(ir_node *node, void *link) {
415 _set_irn_link(node, link);
419 (get_irn_link)(const ir_node *node) {
420 return _get_irn_link(node);
424 (get_irn_pinned)(const ir_node *node) {
425 return _get_irn_pinned(node);
429 (is_irn_pinned_in_irg) (const ir_node *node) {
430 return _is_irn_pinned_in_irg(node);
433 void set_irn_pinned(ir_node *node, op_pin_state state) {
434 /* due to optimization an opt may be turned into a Tuple */
435 if (get_irn_op(node) == op_Tuple)
438 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
439 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
441 node->attr.except.pin_state = state;
444 #ifdef DO_HEAPANALYSIS
445 /* Access the abstract interpretation information of a node.
446 Returns NULL if no such information is available. */
447 struct abstval *get_irn_abst_value(ir_node *n) {
450 /* Set the abstract interpretation information of a node. */
451 void set_irn_abst_value(ir_node *n, struct abstval *os) {
454 struct section *firm_get_irn_section(ir_node *n) {
457 void firm_set_irn_section(ir_node *n, struct section *s) {
461 /* Dummies needed for firmjni. */
462 struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
463 void set_irn_abst_value(ir_node *n, struct abstval *os) {}
464 struct section *firm_get_irn_section(ir_node *n) { return NULL; }
465 void firm_set_irn_section(ir_node *n, struct section *s) {}
466 #endif /* DO_HEAPANALYSIS */
469 /* Outputs a unique number for this node */
470 long get_irn_node_nr(const ir_node *node) {
473 return node->node_nr;
475 return (long)PTR_TO_INT(node);
480 get_irn_const_attr (ir_node *node)
482 assert (node->op == op_Const);
483 return node->attr.con;
487 get_irn_proj_attr (ir_node *node)
489 assert (node->op == op_Proj);
490 return node->attr.proj;
494 get_irn_alloc_attr (ir_node *node)
496 assert (node->op == op_Alloc);
501 get_irn_free_attr (ir_node *node)
503 assert (node->op == op_Free);
508 get_irn_symconst_attr (ir_node *node)
510 assert (node->op == op_SymConst);
515 get_irn_call_attr (ir_node *node)
517 assert (node->op == op_Call);
518 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
522 get_irn_sel_attr (ir_node *node)
524 assert (node->op == op_Sel);
529 get_irn_phi_attr (ir_node *node)
531 assert (node->op == op_Phi);
532 return node->attr.phi0_pos;
536 get_irn_block_attr (ir_node *node)
538 assert (node->op == op_Block);
539 return node->attr.block;
543 get_irn_load_attr (ir_node *node)
545 assert (node->op == op_Load);
546 return node->attr.load;
550 get_irn_store_attr (ir_node *node)
552 assert (node->op == op_Store);
553 return node->attr.store;
557 get_irn_except_attr (ir_node *node)
559 assert (node->op == op_Div || node->op == op_Quot ||
560 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
561 return node->attr.except;
565 get_irn_generic_attr (ir_node *node) {
569 /** manipulate fields of individual nodes **/
571 /* this works for all except Block */
573 get_nodes_block (const ir_node *node) {
574 assert (!(node->op == op_Block));
575 assert (is_irn_pinned_in_irg(node) && "block info may be incorrect");
576 return get_irn_n(node, -1);
580 set_nodes_block (ir_node *node, ir_node *block) {
581 assert (!(node->op == op_Block));
582 set_irn_n(node, -1, block);
585 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
586 * from Start. If so returns frame type, else Null. */
587 ir_type *is_frame_pointer(ir_node *n) {
588 if ((get_irn_op(n) == op_Proj) &&
589 (get_Proj_proj(n) == pn_Start_P_frame_base)) {
590 ir_node *start = get_Proj_pred(n);
591 if (get_irn_op(start) == op_Start) {
592 return get_irg_frame_type(get_irn_irg(start));
598 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
599 * from Start. If so returns global type, else Null. */
600 ir_type *is_globals_pointer(ir_node *n) {
601 if ((get_irn_op(n) == op_Proj) &&
602 (get_Proj_proj(n) == pn_Start_P_globals)) {
603 ir_node *start = get_Proj_pred(n);
604 if (get_irn_op(start) == op_Start) {
605 return get_glob_type();
611 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
612 * from Start. If so returns 1, else 0. */
613 int is_value_arg_pointer(ir_node *n) {
614 if ((get_irn_op(n) == op_Proj) &&
615 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
616 (get_irn_op(get_Proj_pred(n)) == op_Start))
621 /* Returns an array with the predecessors of the Block. Depending on
622 the implementation of the graph data structure this can be a copy of
623 the internal representation of predecessors as well as the internal
624 array itself. Therefore writing to this array might obstruct the ir. */
626 get_Block_cfgpred_arr (ir_node *node)
628 assert ((node->op == op_Block));
629 return (ir_node **)&(get_irn_in(node)[1]);
633 (get_Block_n_cfgpreds)(ir_node *node) {
634 return get_Block_n_cfgpreds(node);
638 (get_Block_cfgpred)(ir_node *node, int pos) {
639 return get_Block_cfgpred(node, pos);
643 set_Block_cfgpred (ir_node *node, int pos, ir_node *pred) {
644 assert (node->op == op_Block);
645 set_irn_n(node, pos, pred);
649 (get_Block_cfgpred_block)(ir_node *node, int pos) {
650 return _get_Block_cfgpred_block(node, pos);
654 get_Block_matured (ir_node *node) {
655 assert (node->op == op_Block);
656 return (int)node->attr.block.matured;
660 set_Block_matured (ir_node *node, int matured) {
661 assert (node->op == op_Block);
662 node->attr.block.matured = matured;
666 (get_Block_block_visited)(ir_node *node) {
667 return _get_Block_block_visited(node);
671 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
672 _set_Block_block_visited(node, visit);
675 /* For this current_ir_graph must be set. */
677 (mark_Block_block_visited)(ir_node *node) {
678 _mark_Block_block_visited(node);
682 (Block_not_block_visited)(ir_node *node) {
683 return _Block_not_block_visited(node);
687 get_Block_graph_arr (ir_node *node, int pos) {
688 assert (node->op == op_Block);
689 return node->attr.block.graph_arr[pos+1];
693 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
694 assert (node->op == op_Block);
695 node->attr.block.graph_arr[pos+1] = value;
698 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
699 assert(node->op == op_Block);
700 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
701 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
702 node->attr.block.in_cg[0] = NULL;
703 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
705 /* Fix backedge array. fix_backedges() operates depending on
706 interprocedural_view. */
707 int ipv = get_interprocedural_view();
708 set_interprocedural_view(1);
709 fix_backedges(current_ir_graph->obst, node);
710 set_interprocedural_view(ipv);
713 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
716 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
717 assert(node->op == op_Block &&
718 node->attr.block.in_cg &&
719 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
720 node->attr.block.in_cg[pos + 1] = pred;
723 ir_node ** get_Block_cg_cfgpred_arr(ir_node * node) {
724 assert(node->op == op_Block);
725 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
728 int get_Block_cg_n_cfgpreds(ir_node * node) {
729 assert(node->op == op_Block);
730 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
733 ir_node * get_Block_cg_cfgpred(ir_node * node, int pos) {
734 assert(node->op == op_Block && node->attr.block.in_cg);
735 return node->attr.block.in_cg[pos + 1];
738 void remove_Block_cg_cfgpred_arr(ir_node * node) {
739 assert(node->op == op_Block);
740 node->attr.block.in_cg = NULL;
743 ir_node *(set_Block_dead)(ir_node *block) {
744 return _set_Block_dead(block);
747 int (is_Block_dead)(const ir_node *block) {
748 return _is_Block_dead(block);
751 ir_extblk *get_Block_extbb(const ir_node *block) {
752 assert(is_Block(block));
753 return block->attr.block.extblk;
756 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
757 assert(is_Block(block));
758 block->attr.block.extblk = extblk;
762 set_Start_irg(ir_node *node, ir_graph *irg) {
763 assert(node->op == op_Start);
764 assert(is_ir_graph(irg));
765 assert(0 && " Why set irg? -- use set_irn_irg");
769 get_End_n_keepalives(ir_node *end) {
770 assert (end->op == op_End);
771 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
775 get_End_keepalive(ir_node *end, int pos) {
776 assert (end->op == op_End);
777 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
781 add_End_keepalive (ir_node *end, ir_node *ka) {
782 assert (end->op == op_End);
783 ARR_APP1 (ir_node *, end->in, ka);
787 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
788 assert (end->op == op_End);
789 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
793 free_End (ir_node *end) {
794 assert (end->op == op_End);
796 DEL_ARR_F(end->in); /* GL @@@ tut nicht ! */
797 end->in = NULL; /* @@@ make sure we get an error if we use the
798 in array afterwards ... */
801 /* Return the target address of an IJmp */
802 ir_node *get_IJmp_target(ir_node *ijmp) {
803 assert(ijmp->op == op_IJmp);
804 return get_irn_n(ijmp, 0);
807 /** Sets the target address of an IJmp */
808 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
809 assert(ijmp->op == op_IJmp);
810 set_irn_n(ijmp, 0, tgt);
814 > Implementing the case construct (which is where the constant Proj node is
815 > important) involves far more than simply determining the constant values.
816 > We could argue that this is more properly a function of the translator from
817 > Firm to the target machine. That could be done if there was some way of
818 > projecting "default" out of the Cond node.
819 I know it's complicated.
820 Basically there are two proglems:
821 - determining the gaps between the projs
822 - determining the biggest case constant to know the proj number for
824 I see several solutions:
825 1. Introduce a ProjDefault node. Solves both problems.
826 This means to extend all optimizations executed during construction.
827 2. Give the Cond node for switch two flavors:
828 a) there are no gaps in the projs (existing flavor)
829 b) gaps may exist, default proj is still the Proj with the largest
830 projection number. This covers also the gaps.
831 3. Fix the semantic of the Cond to that of 2b)
833 Solution 2 seems to be the best:
834 Computing the gaps in the Firm representation is not too hard, i.e.,
835 libFIRM can implement a routine that transforms between the two
836 flavours. This is also possible for 1) but 2) does not require to
837 change any existing optimization.
838 Further it should be far simpler to determine the biggest constant than
840 I don't want to choose 3) as 2a) seems to have advantages for
841 dataflow analysis and 3) does not allow to convert the representation to
845 get_Cond_selector (ir_node *node) {
846 assert (node->op == op_Cond);
847 return get_irn_n(node, 0);
851 set_Cond_selector (ir_node *node, ir_node *selector) {
852 assert (node->op == op_Cond);
853 set_irn_n(node, 0, selector);
857 get_Cond_kind (ir_node *node) {
858 assert (node->op == op_Cond);
859 return node->attr.c.kind;
863 set_Cond_kind (ir_node *node, cond_kind kind) {
864 assert (node->op == op_Cond);
865 node->attr.c.kind = kind;
869 get_Cond_defaultProj (ir_node *node) {
870 assert (node->op == op_Cond);
871 return node->attr.c.default_proj;
875 get_Return_mem (ir_node *node) {
876 assert (node->op == op_Return);
877 return get_irn_n(node, 0);
881 set_Return_mem (ir_node *node, ir_node *mem) {
882 assert (node->op == op_Return);
883 set_irn_n(node, 0, mem);
887 get_Return_n_ress (ir_node *node) {
888 assert (node->op == op_Return);
889 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
893 get_Return_res_arr (ir_node *node)
895 assert ((node->op == op_Return));
896 if (get_Return_n_ress(node) > 0)
897 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
904 set_Return_n_res (ir_node *node, int results) {
905 assert (node->op == op_Return);
910 get_Return_res (ir_node *node, int pos) {
911 assert (node->op == op_Return);
912 assert (get_Return_n_ress(node) > pos);
913 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
917 set_Return_res (ir_node *node, int pos, ir_node *res){
918 assert (node->op == op_Return);
919 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
922 tarval *(get_Const_tarval)(ir_node *node) {
923 return _get_Const_tarval(node);
927 set_Const_tarval (ir_node *node, tarval *con) {
928 assert (node->op == op_Const);
929 node->attr.con.tv = con;
932 cnst_classify_t (classify_Const)(ir_node *node)
934 return _classify_Const(node);
938 /* The source language type. Must be an atomic type. Mode of type must
939 be mode of node. For tarvals from entities type must be pointer to
942 get_Const_type (ir_node *node) {
943 assert (node->op == op_Const);
944 return node->attr.con.tp;
948 set_Const_type (ir_node *node, ir_type *tp) {
949 assert (node->op == op_Const);
950 if (tp != firm_unknown_type) {
951 assert (is_atomic_type(tp));
952 assert (get_type_mode(tp) == get_irn_mode(node));
954 node->attr.con.tp = tp;
959 get_SymConst_kind (const ir_node *node) {
960 assert (node->op == op_SymConst);
961 return node->attr.i.num;
965 set_SymConst_kind (ir_node *node, symconst_kind num) {
966 assert (node->op == op_SymConst);
967 node->attr.i.num = num;
971 get_SymConst_type (ir_node *node) {
972 assert ( (node->op == op_SymConst)
973 && ( get_SymConst_kind(node) == symconst_type_tag
974 || get_SymConst_kind(node) == symconst_size));
975 return node->attr.i.sym.type_p = skip_tid(node->attr.i.sym.type_p);
979 set_SymConst_type (ir_node *node, ir_type *tp) {
980 assert ( (node->op == op_SymConst)
981 && ( get_SymConst_kind(node) == symconst_type_tag
982 || get_SymConst_kind(node) == symconst_size));
983 node->attr.i.sym.type_p = tp;
987 get_SymConst_name (ir_node *node) {
988 assert ( (node->op == op_SymConst)
989 && (get_SymConst_kind(node) == symconst_addr_name));
990 return node->attr.i.sym.ident_p;
994 set_SymConst_name (ir_node *node, ident *name) {
995 assert ( (node->op == op_SymConst)
996 && (get_SymConst_kind(node) == symconst_addr_name));
997 node->attr.i.sym.ident_p = name;
1001 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1002 entity *get_SymConst_entity (ir_node *node) {
1003 assert ( (node->op == op_SymConst)
1004 && (get_SymConst_kind (node) == symconst_addr_ent));
1005 return node->attr.i.sym.entity_p;
1008 void set_SymConst_entity (ir_node *node, entity *ent) {
1009 assert ( (node->op == op_SymConst)
1010 && (get_SymConst_kind(node) == symconst_addr_ent));
1011 node->attr.i.sym.entity_p = ent;
1014 union symconst_symbol
1015 get_SymConst_symbol (ir_node *node) {
1016 assert (node->op == op_SymConst);
1017 return node->attr.i.sym;
1021 set_SymConst_symbol (ir_node *node, union symconst_symbol sym) {
1022 assert (node->op == op_SymConst);
1023 //memcpy (&(node->attr.i.sym), sym, sizeof(type_or_id));
1024 node->attr.i.sym = sym;
1028 get_SymConst_value_type (ir_node *node) {
1029 assert (node->op == op_SymConst);
1030 if (node->attr.i.tp) node->attr.i.tp = skip_tid(node->attr.i.tp);
1031 return node->attr.i.tp;
1035 set_SymConst_value_type (ir_node *node, ir_type *tp) {
1036 assert (node->op == op_SymConst);
1037 node->attr.i.tp = tp;
1041 get_Sel_mem (ir_node *node) {
1042 assert (node->op == op_Sel);
1043 return get_irn_n(node, 0);
1047 set_Sel_mem (ir_node *node, ir_node *mem) {
1048 assert (node->op == op_Sel);
1049 set_irn_n(node, 0, mem);
1053 get_Sel_ptr (ir_node *node) {
1054 assert (node->op == op_Sel);
1055 return get_irn_n(node, 1);
1059 set_Sel_ptr (ir_node *node, ir_node *ptr) {
1060 assert (node->op == op_Sel);
1061 set_irn_n(node, 1, ptr);
1065 get_Sel_n_indexs (ir_node *node) {
1066 assert (node->op == op_Sel);
1067 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1071 get_Sel_index_arr (ir_node *node)
1073 assert ((node->op == op_Sel));
1074 if (get_Sel_n_indexs(node) > 0)
1075 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1081 get_Sel_index (ir_node *node, int pos) {
1082 assert (node->op == op_Sel);
1083 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1087 set_Sel_index (ir_node *node, int pos, ir_node *index) {
1088 assert (node->op == op_Sel);
1089 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1093 get_Sel_entity (ir_node *node) {
1094 assert (node->op == op_Sel);
1095 return node->attr.s.ent;
1099 set_Sel_entity (ir_node *node, entity *ent) {
1100 assert (node->op == op_Sel);
1101 node->attr.s.ent = ent;
1105 /* For unary and binary arithmetic operations the access to the
1106 operands can be factored out. Left is the first, right the
1107 second arithmetic value as listed in tech report 0999-33.
1108 unops are: Minus, Abs, Not, Conv, Cast
1109 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1110 Shr, Shrs, Rotate, Cmp */
1114 get_Call_mem (ir_node *node) {
1115 assert (node->op == op_Call);
1116 return get_irn_n(node, 0);
1120 set_Call_mem (ir_node *node, ir_node *mem) {
1121 assert (node->op == op_Call);
1122 set_irn_n(node, 0, mem);
1126 get_Call_ptr (ir_node *node) {
1127 assert (node->op == op_Call);
1128 return get_irn_n(node, 1);
1132 set_Call_ptr (ir_node *node, ir_node *ptr) {
1133 assert (node->op == op_Call);
1134 set_irn_n(node, 1, ptr);
1138 get_Call_param_arr (ir_node *node) {
1139 assert (node->op == op_Call);
1140 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1144 get_Call_n_params (ir_node *node) {
1145 assert (node->op == op_Call);
1146 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1150 get_Call_arity (ir_node *node) {
1151 assert (node->op == op_Call);
1152 return get_Call_n_params(node);
1156 set_Call_arity (ir_node *node, ir_node *arity) {
1157 assert (node->op == op_Call);
1162 get_Call_param (ir_node *node, int pos) {
1163 assert (node->op == op_Call);
1164 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1168 set_Call_param (ir_node *node, int pos, ir_node *param) {
1169 assert (node->op == op_Call);
1170 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1174 get_Call_type (ir_node *node) {
1175 assert (node->op == op_Call);
1176 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1180 set_Call_type (ir_node *node, ir_type *tp) {
1181 assert (node->op == op_Call);
1182 assert ((get_unknown_type() == tp) || is_Method_type(tp));
1183 node->attr.call.cld_tp = tp;
1186 int Call_has_callees(ir_node *node) {
1187 assert(node && node->op == op_Call);
1188 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1189 (node->attr.call.callee_arr != NULL));
1192 int get_Call_n_callees(ir_node * node) {
1193 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1194 return ARR_LEN(node->attr.call.callee_arr);
1197 entity * get_Call_callee(ir_node * node, int pos) {
1198 assert(pos >= 0 && pos < get_Call_n_callees(node));
1199 return node->attr.call.callee_arr[pos];
1202 void set_Call_callee_arr(ir_node * node, const int n, entity ** arr) {
1203 assert(node->op == op_Call);
1204 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1205 node->attr.call.callee_arr = NEW_ARR_D(entity *, current_ir_graph->obst, n);
1207 memcpy(node->attr.call.callee_arr, arr, n * sizeof(entity *));
1210 void remove_Call_callee_arr(ir_node * node) {
1211 assert(node->op == op_Call);
1212 node->attr.call.callee_arr = NULL;
1215 ir_node * get_CallBegin_ptr (ir_node *node) {
1216 assert(node->op == op_CallBegin);
1217 return get_irn_n(node, 0);
1219 void set_CallBegin_ptr (ir_node *node, ir_node *ptr) {
1220 assert(node->op == op_CallBegin);
1221 set_irn_n(node, 0, ptr);
1223 ir_node * get_CallBegin_call (ir_node *node) {
1224 assert(node->op == op_CallBegin);
1225 return node->attr.callbegin.call;
1227 void set_CallBegin_call (ir_node *node, ir_node *call) {
1228 assert(node->op == op_CallBegin);
1229 node->attr.callbegin.call = call;
1234 ir_node * get_##OP##_left(ir_node *node) { \
1235 assert(node->op == op_##OP); \
1236 return get_irn_n(node, node->op->op_index); \
1238 void set_##OP##_left(ir_node *node, ir_node *left) { \
1239 assert(node->op == op_##OP); \
1240 set_irn_n(node, node->op->op_index, left); \
1242 ir_node *get_##OP##_right(ir_node *node) { \
1243 assert(node->op == op_##OP); \
1244 return get_irn_n(node, node->op->op_index + 1); \
1246 void set_##OP##_right(ir_node *node, ir_node *right) { \
1247 assert(node->op == op_##OP); \
1248 set_irn_n(node, node->op->op_index + 1, right); \
1252 ir_node *get_##OP##_op(ir_node *node) { \
1253 assert(node->op == op_##OP); \
1254 return get_irn_n(node, node->op->op_index); \
1256 void set_##OP##_op (ir_node *node, ir_node *op) { \
1257 assert(node->op == op_##OP); \
1258 set_irn_n(node, node->op->op_index, op); \
1268 get_Quot_mem (ir_node *node) {
1269 assert (node->op == op_Quot);
1270 return get_irn_n(node, 0);
1274 set_Quot_mem (ir_node *node, ir_node *mem) {
1275 assert (node->op == op_Quot);
1276 set_irn_n(node, 0, mem);
1282 get_DivMod_mem (ir_node *node) {
1283 assert (node->op == op_DivMod);
1284 return get_irn_n(node, 0);
1288 set_DivMod_mem (ir_node *node, ir_node *mem) {
1289 assert (node->op == op_DivMod);
1290 set_irn_n(node, 0, mem);
1296 get_Div_mem (ir_node *node) {
1297 assert (node->op == op_Div);
1298 return get_irn_n(node, 0);
1302 set_Div_mem (ir_node *node, ir_node *mem) {
1303 assert (node->op == op_Div);
1304 set_irn_n(node, 0, mem);
1310 get_Mod_mem (ir_node *node) {
1311 assert (node->op == op_Mod);
1312 return get_irn_n(node, 0);
1316 set_Mod_mem (ir_node *node, ir_node *mem) {
1317 assert (node->op == op_Mod);
1318 set_irn_n(node, 0, mem);
1335 get_Cast_type (ir_node *node) {
1336 assert (node->op == op_Cast);
1337 return node->attr.cast.totype;
1341 set_Cast_type (ir_node *node, ir_type *to_tp) {
1342 assert (node->op == op_Cast);
1343 node->attr.cast.totype = to_tp;
1347 /* Checks for upcast.
1349 * Returns true if the Cast node casts a class type to a super type.
1351 int is_Cast_upcast(ir_node *node) {
1352 ir_type *totype = get_Cast_type(node);
1353 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1354 ir_graph *myirg = get_irn_irg(node);
1356 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1359 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1360 totype = get_pointer_points_to_type(totype);
1361 fromtype = get_pointer_points_to_type(fromtype);
1366 if (!is_Class_type(totype)) return 0;
1367 return is_SubClass_of(fromtype, totype);
1370 /* Checks for downcast.
1372 * Returns true if the Cast node casts a class type to a sub type.
1374 int is_Cast_downcast(ir_node *node) {
1375 ir_type *totype = get_Cast_type(node);
1376 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1378 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1381 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1382 totype = get_pointer_points_to_type(totype);
1383 fromtype = get_pointer_points_to_type(fromtype);
1388 if (!is_Class_type(totype)) return 0;
1389 return is_SubClass_of(totype, fromtype);
1393 (is_unop)(const ir_node *node) {
1394 return _is_unop(node);
1398 get_unop_op (ir_node *node) {
1399 if (node->op->opar == oparity_unary)
1400 return get_irn_n(node, node->op->op_index);
1402 assert(node->op->opar == oparity_unary);
1407 set_unop_op (ir_node *node, ir_node *op) {
1408 if (node->op->opar == oparity_unary)
1409 set_irn_n(node, node->op->op_index, op);
1411 assert(node->op->opar == oparity_unary);
1415 (is_binop)(const ir_node *node) {
1416 return _is_binop(node);
1420 get_binop_left (ir_node *node) {
1421 if (node->op->opar == oparity_binary)
1422 return get_irn_n(node, node->op->op_index);
1424 assert(node->op->opar == oparity_binary);
1429 set_binop_left (ir_node *node, ir_node *left) {
1430 if (node->op->opar == oparity_binary)
1431 set_irn_n(node, node->op->op_index, left);
1433 assert (node->op->opar == oparity_binary);
1437 get_binop_right (ir_node *node) {
1438 if (node->op->opar == oparity_binary)
1439 return get_irn_n(node, node->op->op_index + 1);
1441 assert(node->op->opar == oparity_binary);
1446 set_binop_right (ir_node *node, ir_node *right) {
1447 if (node->op->opar == oparity_binary)
1448 set_irn_n(node, node->op->op_index + 1, right);
1450 assert (node->op->opar == oparity_binary);
1453 int is_Phi (const ir_node *n) {
1459 if (op == op_Filter) return get_interprocedural_view();
1462 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1463 (get_irn_arity(n) > 0));
1468 int is_Phi0 (const ir_node *n) {
1471 return ((get_irn_op(n) == op_Phi) &&
1472 (get_irn_arity(n) == 0) &&
1473 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1477 get_Phi_preds_arr (ir_node *node) {
1478 assert (node->op == op_Phi);
1479 return (ir_node **)&(get_irn_in(node)[1]);
1483 get_Phi_n_preds (ir_node *node) {
1484 assert (is_Phi(node) || is_Phi0(node));
1485 return (get_irn_arity(node));
1489 void set_Phi_n_preds (ir_node *node, int n_preds) {
1490 assert (node->op == op_Phi);
1495 get_Phi_pred (ir_node *node, int pos) {
1496 assert (is_Phi(node) || is_Phi0(node));
1497 return get_irn_n(node, pos);
1501 set_Phi_pred (ir_node *node, int pos, ir_node *pred) {
1502 assert (is_Phi(node) || is_Phi0(node));
1503 set_irn_n(node, pos, pred);
1507 int is_memop(ir_node *node) {
1508 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1511 ir_node *get_memop_mem (ir_node *node) {
1512 assert(is_memop(node));
1513 return get_irn_n(node, 0);
1516 void set_memop_mem (ir_node *node, ir_node *mem) {
1517 assert(is_memop(node));
1518 set_irn_n(node, 0, mem);
1521 ir_node *get_memop_ptr (ir_node *node) {
1522 assert(is_memop(node));
1523 return get_irn_n(node, 1);
1526 void set_memop_ptr (ir_node *node, ir_node *ptr) {
1527 assert(is_memop(node));
1528 set_irn_n(node, 1, ptr);
1532 get_Load_mem (ir_node *node) {
1533 assert (node->op == op_Load);
1534 return get_irn_n(node, 0);
1538 set_Load_mem (ir_node *node, ir_node *mem) {
1539 assert (node->op == op_Load);
1540 set_irn_n(node, 0, mem);
1544 get_Load_ptr (ir_node *node) {
1545 assert (node->op == op_Load);
1546 return get_irn_n(node, 1);
1550 set_Load_ptr (ir_node *node, ir_node *ptr) {
1551 assert (node->op == op_Load);
1552 set_irn_n(node, 1, ptr);
1556 get_Load_mode (ir_node *node) {
1557 assert (node->op == op_Load);
1558 return node->attr.load.load_mode;
1562 set_Load_mode (ir_node *node, ir_mode *mode) {
1563 assert (node->op == op_Load);
1564 node->attr.load.load_mode = mode;
1568 get_Load_volatility (ir_node *node) {
1569 assert (node->op == op_Load);
1570 return node->attr.load.volatility;
1574 set_Load_volatility (ir_node *node, ent_volatility volatility) {
1575 assert (node->op == op_Load);
1576 node->attr.load.volatility = volatility;
1581 get_Store_mem (ir_node *node) {
1582 assert (node->op == op_Store);
1583 return get_irn_n(node, 0);
1587 set_Store_mem (ir_node *node, ir_node *mem) {
1588 assert (node->op == op_Store);
1589 set_irn_n(node, 0, mem);
1593 get_Store_ptr (ir_node *node) {
1594 assert (node->op == op_Store);
1595 return get_irn_n(node, 1);
1599 set_Store_ptr (ir_node *node, ir_node *ptr) {
1600 assert (node->op == op_Store);
1601 set_irn_n(node, 1, ptr);
1605 get_Store_value (ir_node *node) {
1606 assert (node->op == op_Store);
1607 return get_irn_n(node, 2);
1611 set_Store_value (ir_node *node, ir_node *value) {
1612 assert (node->op == op_Store);
1613 set_irn_n(node, 2, value);
1617 get_Store_volatility (ir_node *node) {
1618 assert (node->op == op_Store);
1619 return node->attr.store.volatility;
1623 set_Store_volatility (ir_node *node, ent_volatility volatility) {
1624 assert (node->op == op_Store);
1625 node->attr.store.volatility = volatility;
1630 get_Alloc_mem (ir_node *node) {
1631 assert (node->op == op_Alloc);
1632 return get_irn_n(node, 0);
1636 set_Alloc_mem (ir_node *node, ir_node *mem) {
1637 assert (node->op == op_Alloc);
1638 set_irn_n(node, 0, mem);
1642 get_Alloc_size (ir_node *node) {
1643 assert (node->op == op_Alloc);
1644 return get_irn_n(node, 1);
1648 set_Alloc_size (ir_node *node, ir_node *size) {
1649 assert (node->op == op_Alloc);
1650 set_irn_n(node, 1, size);
1654 get_Alloc_type (ir_node *node) {
1655 assert (node->op == op_Alloc);
1656 return node->attr.a.type = skip_tid(node->attr.a.type);
1660 set_Alloc_type (ir_node *node, ir_type *tp) {
1661 assert (node->op == op_Alloc);
1662 node->attr.a.type = tp;
1666 get_Alloc_where (ir_node *node) {
1667 assert (node->op == op_Alloc);
1668 return node->attr.a.where;
1672 set_Alloc_where (ir_node *node, where_alloc where) {
1673 assert (node->op == op_Alloc);
1674 node->attr.a.where = where;
1679 get_Free_mem (ir_node *node) {
1680 assert (node->op == op_Free);
1681 return get_irn_n(node, 0);
1685 set_Free_mem (ir_node *node, ir_node *mem) {
1686 assert (node->op == op_Free);
1687 set_irn_n(node, 0, mem);
1691 get_Free_ptr (ir_node *node) {
1692 assert (node->op == op_Free);
1693 return get_irn_n(node, 1);
1697 set_Free_ptr (ir_node *node, ir_node *ptr) {
1698 assert (node->op == op_Free);
1699 set_irn_n(node, 1, ptr);
1703 get_Free_size (ir_node *node) {
1704 assert (node->op == op_Free);
1705 return get_irn_n(node, 2);
1709 set_Free_size (ir_node *node, ir_node *size) {
1710 assert (node->op == op_Free);
1711 set_irn_n(node, 2, size);
1715 get_Free_type (ir_node *node) {
1716 assert (node->op == op_Free);
1717 return node->attr.f.type = skip_tid(node->attr.f.type);
1721 set_Free_type (ir_node *node, ir_type *tp) {
1722 assert (node->op == op_Free);
1723 node->attr.f.type = tp;
1727 get_Free_where (ir_node *node) {
1728 assert (node->op == op_Free);
1729 return node->attr.f.where;
1733 set_Free_where (ir_node *node, where_alloc where) {
1734 assert (node->op == op_Free);
1735 node->attr.f.where = where;
1739 get_Sync_preds_arr (ir_node *node) {
1740 assert (node->op == op_Sync);
1741 return (ir_node **)&(get_irn_in(node)[1]);
1745 get_Sync_n_preds (ir_node *node) {
1746 assert (node->op == op_Sync);
1747 return (get_irn_arity(node));
1752 set_Sync_n_preds (ir_node *node, int n_preds) {
1753 assert (node->op == op_Sync);
1758 get_Sync_pred (ir_node *node, int pos) {
1759 assert (node->op == op_Sync);
1760 return get_irn_n(node, pos);
1764 set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
1765 assert (node->op == op_Sync);
1766 set_irn_n(node, pos, pred);
1769 ir_type *get_Proj_type(ir_node *n)
1772 ir_node *pred = get_Proj_pred(n);
1774 switch (get_irn_opcode(pred)) {
1777 /* Deal with Start / Call here: we need to know the Proj Nr. */
1778 assert(get_irn_mode(pred) == mode_T);
1779 pred_pred = get_Proj_pred(pred);
1780 if (get_irn_op(pred_pred) == op_Start) {
1781 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1782 tp = get_method_param_type(mtp, get_Proj_proj(n));
1783 } else if (get_irn_op(pred_pred) == op_Call) {
1784 ir_type *mtp = get_Call_type(pred_pred);
1785 tp = get_method_res_type(mtp, get_Proj_proj(n));
1788 case iro_Start: break;
1789 case iro_Call: break;
1791 ir_node *a = get_Load_ptr(pred);
1793 tp = get_entity_type(get_Sel_entity(a));
1802 get_Proj_pred (const ir_node *node) {
1803 assert (is_Proj(node));
1804 return get_irn_n(node, 0);
1808 set_Proj_pred (ir_node *node, ir_node *pred) {
1809 assert (is_Proj(node));
1810 set_irn_n(node, 0, pred);
1814 get_Proj_proj (const ir_node *node) {
1815 assert (is_Proj(node));
1816 if (get_irn_opcode(node) == iro_Proj) {
1817 return node->attr.proj;
1819 assert(get_irn_opcode(node) == iro_Filter);
1820 return node->attr.filter.proj;
1825 set_Proj_proj (ir_node *node, long proj) {
1826 assert (node->op == op_Proj);
1827 node->attr.proj = proj;
1831 get_Tuple_preds_arr (ir_node *node) {
1832 assert (node->op == op_Tuple);
1833 return (ir_node **)&(get_irn_in(node)[1]);
1837 get_Tuple_n_preds (ir_node *node) {
1838 assert (node->op == op_Tuple);
1839 return (get_irn_arity(node));
1844 set_Tuple_n_preds (ir_node *node, int n_preds) {
1845 assert (node->op == op_Tuple);
1850 get_Tuple_pred (ir_node *node, int pos) {
1851 assert (node->op == op_Tuple);
1852 return get_irn_n(node, pos);
1856 set_Tuple_pred (ir_node *node, int pos, ir_node *pred) {
1857 assert (node->op == op_Tuple);
1858 set_irn_n(node, pos, pred);
1862 get_Id_pred (ir_node *node) {
1863 assert (node->op == op_Id);
1864 return get_irn_n(node, 0);
1868 set_Id_pred (ir_node *node, ir_node *pred) {
1869 assert (node->op == op_Id);
1870 set_irn_n(node, 0, pred);
1873 ir_node *get_Confirm_value (ir_node *node) {
1874 assert (node->op == op_Confirm);
1875 return get_irn_n(node, 0);
1877 void set_Confirm_value (ir_node *node, ir_node *value) {
1878 assert (node->op == op_Confirm);
1879 set_irn_n(node, 0, value);
1881 ir_node *get_Confirm_bound (ir_node *node) {
1882 assert (node->op == op_Confirm);
1883 return get_irn_n(node, 1);
1885 void set_Confirm_bound (ir_node *node, ir_node *bound) {
1886 assert (node->op == op_Confirm);
1887 set_irn_n(node, 0, bound);
1889 pn_Cmp get_Confirm_cmp (ir_node *node) {
1890 assert (node->op == op_Confirm);
1891 return node->attr.confirm_cmp;
1893 void set_Confirm_cmp (ir_node *node, pn_Cmp cmp) {
1894 assert (node->op == op_Confirm);
1895 node->attr.confirm_cmp = cmp;
1900 get_Filter_pred (ir_node *node) {
1901 assert(node->op == op_Filter);
1905 set_Filter_pred (ir_node *node, ir_node *pred) {
1906 assert(node->op == op_Filter);
1910 get_Filter_proj(ir_node *node) {
1911 assert(node->op == op_Filter);
1912 return node->attr.filter.proj;
1915 set_Filter_proj (ir_node *node, long proj) {
1916 assert(node->op == op_Filter);
1917 node->attr.filter.proj = proj;
1920 /* Don't use get_irn_arity, get_irn_n in implementation as access
1921 shall work independent of view!!! */
1922 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
1923 assert(node->op == op_Filter);
1924 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
1925 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
1926 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
1927 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
1928 node->attr.filter.in_cg[0] = node->in[0];
1930 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
1933 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
1934 assert(node->op == op_Filter && node->attr.filter.in_cg &&
1935 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
1936 node->attr.filter.in_cg[pos + 1] = pred;
1938 int get_Filter_n_cg_preds(ir_node *node) {
1939 assert(node->op == op_Filter && node->attr.filter.in_cg);
1940 return (ARR_LEN(node->attr.filter.in_cg) - 1);
1942 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
1944 assert(node->op == op_Filter && node->attr.filter.in_cg &&
1946 arity = ARR_LEN(node->attr.filter.in_cg);
1947 assert(pos < arity - 1);
1948 return node->attr.filter.in_cg[pos + 1];
1952 ir_node *get_Mux_sel (ir_node *node) {
1953 assert(node->op == op_Mux);
1956 void set_Mux_sel (ir_node *node, ir_node *sel) {
1957 assert(node->op == op_Mux);
1961 ir_node *get_Mux_false (ir_node *node) {
1962 assert(node->op == op_Mux);
1965 void set_Mux_false (ir_node *node, ir_node *ir_false) {
1966 assert(node->op == op_Mux);
1967 node->in[2] = ir_false;
1970 ir_node *get_Mux_true (ir_node *node) {
1971 assert(node->op == op_Mux);
1974 void set_Mux_true (ir_node *node, ir_node *ir_true) {
1975 assert(node->op == op_Mux);
1976 node->in[3] = ir_true;
1980 ir_node *get_CopyB_mem (ir_node *node) {
1981 assert (node->op == op_CopyB);
1982 return get_irn_n(node, 0);
1985 void set_CopyB_mem (ir_node *node, ir_node *mem) {
1986 assert (node->op == op_CopyB);
1987 set_irn_n(node, 0, mem);
1990 ir_node *get_CopyB_dst (ir_node *node) {
1991 assert (node->op == op_CopyB);
1992 return get_irn_n(node, 1);
1995 void set_CopyB_dst (ir_node *node, ir_node *dst) {
1996 assert (node->op == op_CopyB);
1997 set_irn_n(node, 1, dst);
2000 ir_node *get_CopyB_src (ir_node *node) {
2001 assert (node->op == op_CopyB);
2002 return get_irn_n(node, 2);
2005 void set_CopyB_src (ir_node *node, ir_node *src) {
2006 assert (node->op == op_CopyB);
2007 set_irn_n(node, 2, src);
2010 ir_type *get_CopyB_type(ir_node *node) {
2011 assert (node->op == op_CopyB);
2012 return node->attr.copyb.data_type;
2015 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2016 assert (node->op == op_CopyB && data_type);
2017 node->attr.copyb.data_type = data_type;
2022 get_InstOf_type (ir_node *node) {
2023 assert (node->op = op_InstOf);
2024 return node->attr.io.type;
2028 set_InstOf_type (ir_node *node, ir_type *type) {
2029 assert (node->op = op_InstOf);
2030 node->attr.io.type = type;
2034 get_InstOf_store (ir_node *node) {
2035 assert (node->op = op_InstOf);
2036 return get_irn_n(node, 0);
2040 set_InstOf_store (ir_node *node, ir_node *obj) {
2041 assert (node->op = op_InstOf);
2042 set_irn_n(node, 0, obj);
2046 get_InstOf_obj (ir_node *node) {
2047 assert (node->op = op_InstOf);
2048 return get_irn_n(node, 1);
2052 set_InstOf_obj (ir_node *node, ir_node *obj) {
2053 assert (node->op = op_InstOf);
2054 set_irn_n(node, 1, obj);
2057 /* Returns the memory input of a Raise operation. */
2059 get_Raise_mem (ir_node *node) {
2060 assert (node->op == op_Raise);
2061 return get_irn_n(node, 0);
2065 set_Raise_mem (ir_node *node, ir_node *mem) {
2066 assert (node->op == op_Raise);
2067 set_irn_n(node, 0, mem);
2071 get_Raise_exo_ptr (ir_node *node) {
2072 assert (node->op == op_Raise);
2073 return get_irn_n(node, 1);
2077 set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) {
2078 assert (node->op == op_Raise);
2079 set_irn_n(node, 1, exo_ptr);
2084 /* Returns the memory input of a Bound operation. */
2085 ir_node *get_Bound_mem(ir_node *bound) {
2086 assert (bound->op == op_Bound);
2087 return get_irn_n(bound, 0);
2090 void set_Bound_mem (ir_node *bound, ir_node *mem) {
2091 assert (bound->op == op_Bound);
2092 set_irn_n(bound, 0, mem);
2095 /* Returns the index input of a Bound operation. */
2096 ir_node *get_Bound_index(ir_node *bound) {
2097 assert (bound->op == op_Bound);
2098 return get_irn_n(bound, 1);
2101 void set_Bound_index(ir_node *bound, ir_node *idx) {
2102 assert (bound->op == op_Bound);
2103 set_irn_n(bound, 1, idx);
2106 /* Returns the lower bound input of a Bound operation. */
2107 ir_node *get_Bound_lower(ir_node *bound) {
2108 assert (bound->op == op_Bound);
2109 return get_irn_n(bound, 2);
2112 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2113 assert (bound->op == op_Bound);
2114 set_irn_n(bound, 2, lower);
2117 /* Returns the upper bound input of a Bound operation. */
2118 ir_node *get_Bound_upper(ir_node *bound) {
2119 assert (bound->op == op_Bound);
2120 return get_irn_n(bound, 3);
2123 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2124 assert (bound->op == op_Bound);
2125 set_irn_n(bound, 3, upper);
2128 /* returns the graph of a node */
2130 get_irn_irg(const ir_node *node) {
2132 * Do not use get_nodes_Block() here, because this
2133 * will check the pinned state.
2134 * However even a 'wrong' block is always in the proper
2137 if (! is_Block(node))
2138 node = get_irn_n(node, -1);
2139 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2140 node = get_irn_n(node, -1);
2141 assert(get_irn_op(node) == op_Block);
2142 return node->attr.block.irg;
2146 /*----------------------------------------------------------------*/
2147 /* Auxiliary routines */
2148 /*----------------------------------------------------------------*/
2151 skip_Proj (ir_node *node) {
2152 /* don't assert node !!! */
2153 if (node && is_Proj(node)) {
2154 return get_Proj_pred(node);
2161 skip_Tuple (ir_node *node) {
2165 if (!get_opt_normalize()) return node;
2168 node = skip_Id(node);
2169 if (get_irn_op(node) == op_Proj) {
2170 pred = skip_Id(get_Proj_pred(node));
2171 op = get_irn_op(pred);
2174 * Looks strange but calls get_irn_op() only once
2175 * in most often cases.
2177 if (op == op_Proj) { /* nested Tuple ? */
2178 pred = skip_Id(skip_Tuple(pred));
2179 op = get_irn_op(pred);
2181 if (op == op_Tuple) {
2182 node = get_Tuple_pred(pred, get_Proj_proj(node));
2186 else if (op == op_Tuple) {
2187 node = get_Tuple_pred(pred, get_Proj_proj(node));
2194 /* returns operand of node if node is a Cast */
2195 ir_node *skip_Cast (ir_node *node) {
2196 if (node && get_irn_op(node) == op_Cast)
2197 return get_Cast_op(node);
2201 /* returns operand of node if node is a Confirm */
2202 ir_node *skip_Confirm (ir_node *node) {
2203 if (node && get_irn_op(node) == op_Confirm)
2204 return get_Confirm_value(node);
2208 /* skip all high-level ops */
2209 ir_node *skip_HighLevel(ir_node *node) {
2210 if (node && is_op_highlevel(get_irn_op(node)))
2211 return get_irn_n(node, 0);
2216 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2217 * than any other approach, as Id chains are resolved and all point to the real node, or
2218 * all id's are self loops.
2220 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2223 skip_Id (ir_node *node) {
2224 /* don't assert node !!! */
2226 /* Don't use get_Id_pred: We get into an endless loop for
2227 self-referencing Ids. */
2228 if (node && (node->op == op_Id) && (node != node->in[0+1])) {
2229 ir_node *rem_pred = node->in[0+1];
2232 assert (get_irn_arity (node) > 0);
2234 node->in[0+1] = node;
2235 res = skip_Id(rem_pred);
2236 if (res->op == op_Id) /* self-loop */ return node;
2238 node->in[0+1] = res;
2245 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2246 * than any other approach, as Id chains are resolved and all point to the real node, or
2247 * all id's are self loops.
2249 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2250 * a little bit "hand optimized".
2252 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2255 skip_Id (ir_node *node) {
2257 /* don't assert node !!! */
2259 if (!node || (node->op != op_Id)) return node;
2261 /* Don't use get_Id_pred(): We get into an endless loop for
2262 self-referencing Ids. */
2263 pred = node->in[0+1];
2265 if (pred->op != op_Id) return pred;
2267 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2268 ir_node *rem_pred, *res;
2270 if (pred->op != op_Id) return pred; /* shortcut */
2273 assert (get_irn_arity (node) > 0);
2275 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2276 res = skip_Id(rem_pred);
2277 if (res->op == op_Id) /* self-loop */ return node;
2279 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2287 void skip_Id_and_store(ir_node **node) {
2290 if (!n || (n->op != op_Id)) return;
2292 /* Don't use get_Id_pred(): We get into an endless loop for
2293 self-referencing Ids. */
2298 (is_Bad)(const ir_node *node) {
2299 return _is_Bad(node);
2303 (is_Const)(const ir_node *node) {
2304 return _is_Const(node);
2308 (is_no_Block)(const ir_node *node) {
2309 return _is_no_Block(node);
2313 (is_Block)(const ir_node *node) {
2314 return _is_Block(node);
2317 /* returns true if node is an Unknown node. */
2319 (is_Unknown)(const ir_node *node) {
2320 return _is_Unknown(node);
2323 /* returns true if node is a Return node. */
2325 (is_Return)(const ir_node *node) {
2326 return _is_Return(node);
2329 /* returns true if node is a Call node. */
2331 (is_Call)(const ir_node *node) {
2332 return _is_Call(node);
2335 /* returns true if node is a Sel node. */
2337 (is_Sel)(const ir_node *node) {
2338 return _is_Sel(node);
2342 is_Proj (const ir_node *node) {
2344 return node->op == op_Proj
2345 || (!get_interprocedural_view() && node->op == op_Filter);
2348 /* Returns true if the operation manipulates control flow. */
2350 is_cfop(const ir_node *node) {
2351 return is_cfopcode(get_irn_op(node));
2354 /* Returns true if the operation manipulates interprocedural control flow:
2355 CallBegin, EndReg, EndExcept */
2356 int is_ip_cfop(const ir_node *node) {
2357 return is_ip_cfopcode(get_irn_op(node));
2360 /* Returns true if the operation can change the control flow because
2363 is_fragile_op(const ir_node *node) {
2364 return is_op_fragile(get_irn_op(node));
2367 /* Returns the memory operand of fragile operations. */
2368 ir_node *get_fragile_op_mem(ir_node *node) {
2369 assert(node && is_fragile_op(node));
2371 switch (get_irn_opcode (node)) {
2380 return get_irn_n(node, 0);
2385 assert(0 && "should not be reached");
2390 /* Returns true if the operation is a forking control flow operation. */
2391 int (is_irn_forking)(const ir_node *node) {
2392 return _is_irn_forking(node);
2395 /* Return the type associated with the value produced by n
2396 * if the node remarks this type as it is the case for
2397 * Cast, Const, SymConst and some Proj nodes. */
2398 ir_type *(get_irn_type)(ir_node *node) {
2399 return _get_irn_type(node);
2402 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2404 ir_type *(get_irn_type_attr)(ir_node *node) {
2405 return _get_irn_type_attr(node);
2408 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2409 entity *(get_irn_entity_attr)(ir_node *node) {
2410 return _get_irn_entity_attr(node);
2413 /* Returns non-zero for constant-like nodes. */
2414 int (is_irn_constlike)(const ir_node *node) {
2415 return _is_irn_constlike(node);
2419 * Returns non-zero for nodes that are allowed to have keep-alives and
2420 * are neither Block nor PhiM.
2422 int (is_irn_keep)(const ir_node *node) {
2423 return _is_irn_keep(node);
2426 /* Gets the string representation of the jump prediction .*/
2427 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
2431 case COND_JMP_PRED_NONE: return "no prediction";
2432 case COND_JMP_PRED_TRUE: return "true taken";
2433 case COND_JMP_PRED_FALSE: return "false taken";
2437 /* Returns the conditional jump prediction of a Cond node. */
2438 cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
2439 return _get_Cond_jmp_pred(cond);
2442 /* Sets a new conditional jump prediction. */
2443 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2444 _set_Cond_jmp_pred(cond, pred);
2447 /** the get_type operation must be always implemented and return a firm type */
2448 static ir_type *get_Default_type(ir_node *n) {
2449 return get_unknown_type();
2452 /* Sets the get_type operation for an ir_op_ops. */
2453 ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops)
2456 case iro_Const: ops->get_type = get_Const_type; break;
2457 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2458 case iro_Cast: ops->get_type = get_Cast_type; break;
2459 case iro_Proj: ops->get_type = get_Proj_type; break;
2461 /* not allowed to be NULL */
2462 if (! ops->get_type)
2463 ops->get_type = get_Default_type;
2469 /** Return the attribute type of a SymConst node if exists */
2470 static ir_type *get_SymConst_attr_type(ir_node *self) {
2471 symconst_kind kind = get_SymConst_kind(self);
2472 if (kind == symconst_type_tag || kind == symconst_size)
2473 return get_SymConst_type(self);
2477 /** Return the attribute entity of a SymConst node if exists */
2478 static entity *get_SymConst_attr_entity(ir_node *self) {
2479 symconst_kind kind = get_SymConst_kind(self);
2480 if (kind == symconst_addr_ent)
2481 return get_SymConst_entity(self);
2485 /** the get_type_attr operation must be always implemented */
2486 static ir_type *get_Null_type(ir_node *n) {
2487 return firm_unknown_type;
2490 /* Sets the get_type operation for an ir_op_ops. */
2491 ir_op_ops *firm_set_default_get_type_attr(opcode code, ir_op_ops *ops)
2494 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2495 case iro_Call: ops->get_type_attr = get_Call_type; break;
2496 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2497 case iro_Free: ops->get_type_attr = get_Free_type; break;
2498 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2500 /* not allowed to be NULL */
2501 if (! ops->get_type_attr)
2502 ops->get_type_attr = get_Null_type;
2508 /** the get_entity_attr operation must be always implemented */
2509 static entity *get_Null_ent(ir_node *n) {
2513 /* Sets the get_type operation for an ir_op_ops. */
2514 ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops)
2517 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2518 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2520 /* not allowed to be NULL */
2521 if (! ops->get_entity_attr)
2522 ops->get_entity_attr = get_Null_ent;
2528 #ifdef DEBUG_libfirm
2529 void dump_irn (ir_node *n) {
2530 int i, arity = get_irn_arity(n);
2531 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2533 ir_node *pred = get_irn_n(n, -1);
2534 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2535 get_irn_node_nr(pred), (void *)pred);
2537 printf(" preds: \n");
2538 for (i = 0; i < arity; ++i) {
2539 ir_node *pred = get_irn_n(n, i);
2540 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2541 get_irn_node_nr(pred), (void *)pred);
2545 #else /* DEBUG_libfirm */
2546 void dump_irn (ir_node *n) {}
2547 #endif /* DEBUG_libfirm */