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"
34 /* some constants fixing the positions of nodes predecessors
36 #define CALL_PARAM_OFFSET 2
37 #define FUNCCALL_PARAM_OFFSET 1
38 #define SEL_INDEX_OFFSET 2
39 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
40 #define END_KEEPALIVE_OFFSET 0
42 static const char *pnc_name_arr [] = {
43 "False", "Eq", "Lt", "Le",
44 "Gt", "Ge", "Lg", "Leg", "Uo",
45 "Ue", "Ul", "Ule", "Ug", "Uge",
50 * returns the pnc name from an pnc constant
52 const char *get_pnc_string(int pnc) {
53 return pnc_name_arr[pnc];
57 * Calculates the negated (Complement(R)) pnc condition.
59 int get_negated_pnc(int pnc, ir_mode *mode) {
62 /* do NOT add the Uo bit for non-floating point values */
63 if (! mode_is_float(mode))
69 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
71 get_inversed_pnc(int pnc) {
72 int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
73 int lesser = pnc & pn_Cmp_Lt;
74 int greater = pnc & pn_Cmp_Gt;
76 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
81 const char *pns_name_arr [] = {
82 "initial_exec", "global_store",
83 "frame_base", "globals", "args"
86 const char *symconst_name_arr [] = {
87 "type_tag", "size", "addr_name", "addr_ent"
91 * Indicates, whether additional data can be registered to ir nodes.
92 * If set to 1, this is not possible anymore.
94 static int forbid_new_data = 0;
97 * The amount of additional space for custom data to be allocated upon
98 * creating a new node.
100 unsigned firm_add_node_size = 0;
103 /* register new space for every node */
104 unsigned register_additional_node_data(unsigned size) {
105 assert(!forbid_new_data && "Too late to register additional node data");
110 return firm_add_node_size += size;
116 /* Forbid the addition of new data to an ir node. */
121 * irnode constructor.
122 * Create a new irnode in irg, with an op, mode, arity and
123 * some incoming irnodes.
124 * If arity is negative, a node with a dynamic array is created.
127 new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
128 int arity, ir_node **in)
131 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
134 assert(irg && op && mode);
135 p = obstack_alloc (irg->obst, node_size);
136 memset(p, 0, node_size);
137 res = (ir_node *) (p + firm_add_node_size);
139 res->kind = k_ir_node;
145 res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
147 res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
148 memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
152 set_irn_dbg_info(res, db);
156 res->node_nr = get_irp_new_node_nr();
159 #if FIRM_EDGES_INPLACE
162 int not_a_block = is_no_Block(res);
164 INIT_LIST_HEAD(&res->edge_info.outs_head);
166 INIT_LIST_HEAD(&res->attr.block.succ_head);
169 for (i = 0, n = arity + not_a_block; i < n; ++i)
170 edges_notify_edge(res, i - not_a_block, res->in[i], NULL, irg);
174 hook_new_node(irg, res);
179 /*-- getting some parameters from ir_nodes --*/
182 (is_ir_node)(const void *thing) {
183 return _is_ir_node(thing);
187 (get_irn_intra_arity)(const ir_node *node) {
188 return _get_irn_intra_arity(node);
192 (get_irn_inter_arity)(const ir_node *node) {
193 return _get_irn_inter_arity(node);
196 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
199 (get_irn_arity)(const ir_node *node) {
200 return _get_irn_arity(node);
203 /* Returns the array with ins. This array is shifted with respect to the
204 array accessed by get_irn_n: The block operand is at position 0 not -1.
205 (@@@ This should be changed.)
206 The order of the predecessors in this array is not guaranteed, except that
207 lists of operands as predecessors of Block or arguments of a Call are
210 get_irn_in (const ir_node *node) {
212 if (get_interprocedural_view()) { /* handle Filter and Block specially */
213 if (get_irn_opcode(node) == iro_Filter) {
214 assert(node->attr.filter.in_cg);
215 return node->attr.filter.in_cg;
216 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
217 return node->attr.block.in_cg;
219 /* else fall through */
225 set_irn_in (ir_node *node, int arity, ir_node **in) {
229 if (get_interprocedural_view()) { /* handle Filter and Block specially */
230 if (get_irn_opcode(node) == iro_Filter) {
231 assert(node->attr.filter.in_cg);
232 arr = &node->attr.filter.in_cg;
233 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
234 arr = &node->attr.block.in_cg;
242 for (i = 0; i < arity; i++) {
243 if (i < ARR_LEN(*arr)-1)
244 edges_notify_edge(node, i, in[i], (*arr)[i+1], current_ir_graph);
246 edges_notify_edge(node, i, in[i], NULL, current_ir_graph);
248 for(;i < ARR_LEN(*arr)-1; i++) {
249 edges_notify_edge(node, i, NULL, (*arr)[i+1], current_ir_graph);
252 if (arity != ARR_LEN(*arr) - 1) {
253 ir_node * block = (*arr)[0];
254 *arr = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
257 fix_backedges(current_ir_graph->obst, node);
259 memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
263 (get_irn_intra_n)(const ir_node *node, int n) {
264 return _get_irn_intra_n (node, n);
268 (get_irn_inter_n)(const ir_node *node, int n) {
269 return _get_irn_inter_n (node, n);
272 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
275 (get_irn_n)(const ir_node *node, int n) {
276 return _get_irn_n(node, n);
280 set_irn_n (ir_node *node, int n, ir_node *in) {
281 assert(node && node->kind == k_ir_node);
283 assert(n < get_irn_arity(node));
284 assert(in && in->kind == k_ir_node);
286 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
287 /* Change block pred in both views! */
288 node->in[n + 1] = in;
289 assert(node->attr.filter.in_cg);
290 node->attr.filter.in_cg[n + 1] = in;
293 if (get_interprocedural_view()) { /* handle Filter and Block specially */
294 if (get_irn_opcode(node) == iro_Filter) {
295 assert(node->attr.filter.in_cg);
296 node->attr.filter.in_cg[n + 1] = in;
298 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
299 node->attr.block.in_cg[n + 1] = in;
302 /* else fall through */
306 hook_set_irn_n(node, n, in, node->in[n + 1]);
308 /* Here, we rely on src and tgt being in the current ir graph */
309 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
311 node->in[n + 1] = in;
315 (get_irn_mode)(const ir_node *node) {
316 return _get_irn_mode(node);
320 (set_irn_mode)(ir_node *node, ir_mode *mode)
322 _set_irn_mode(node, mode);
326 get_irn_modecode (const ir_node *node)
329 return node->mode->code;
332 /** Gets the string representation of the mode .*/
334 get_irn_modename (const ir_node *node)
337 return get_mode_name(node->mode);
341 get_irn_modeident (const ir_node *node)
344 return get_mode_ident(node->mode);
348 (get_irn_op)(const ir_node *node)
350 return _get_irn_op(node);
353 /* should be private to the library: */
355 set_irn_op (ir_node *node, ir_op *op)
362 (get_irn_opcode)(const ir_node *node)
364 return _get_irn_opcode(node);
368 get_irn_opname (const ir_node *node)
371 if ((get_irn_op((ir_node *)node) == op_Phi) &&
372 (get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
373 (get_irn_arity((ir_node *)node) == 0)) return "Phi0";
374 return get_id_str(node->op->name);
378 get_irn_opident (const ir_node *node)
381 return node->op->name;
385 (get_irn_visited)(const ir_node *node)
387 return _get_irn_visited(node);
391 (set_irn_visited)(ir_node *node, unsigned long visited)
393 _set_irn_visited(node, visited);
397 (mark_irn_visited)(ir_node *node) {
398 _mark_irn_visited(node);
402 (irn_not_visited)(const ir_node *node) {
403 return _irn_not_visited(node);
407 (irn_visited)(const ir_node *node) {
408 return _irn_visited(node);
412 (set_irn_link)(ir_node *node, void *link) {
413 _set_irn_link(node, link);
417 (get_irn_link)(const ir_node *node) {
418 return _get_irn_link(node);
422 (get_irn_pinned)(const ir_node *node) {
423 return _get_irn_pinned(node);
427 (is_irn_pinned_in_irg) (const ir_node *node) {
428 return _is_irn_pinned_in_irg(node);
431 void set_irn_pinned(ir_node *node, op_pin_state state) {
432 /* due to optimization an opt may be turned into a Tuple */
433 if (get_irn_op(node) == op_Tuple)
436 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
437 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
439 node->attr.except.pin_state = state;
442 #ifdef DO_HEAPANALYSIS
443 /* Access the abstract interpretation information of a node.
444 Returns NULL if no such information is available. */
445 struct abstval *get_irn_abst_value(ir_node *n) {
448 /* Set the abstract interpretation information of a node. */
449 void set_irn_abst_value(ir_node *n, struct abstval *os) {
452 struct section *firm_get_irn_section(ir_node *n) {
455 void firm_set_irn_section(ir_node *n, struct section *s) {
459 /* Dummies needed for firmjni. */
460 struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
461 void set_irn_abst_value(ir_node *n, struct abstval *os) {}
462 struct section *firm_get_irn_section(ir_node *n) { return NULL; }
463 void firm_set_irn_section(ir_node *n, struct section *s) {}
464 #endif /* DO_HEAPANALYSIS */
467 /* Outputs a unique number for this node */
469 get_irn_node_nr(const ir_node *node) {
472 return node->node_nr;
479 get_irn_const_attr (ir_node *node)
481 assert (node->op == op_Const);
482 return node->attr.con;
486 get_irn_proj_attr (ir_node *node)
488 assert (node->op == op_Proj);
489 return node->attr.proj;
493 get_irn_alloc_attr (ir_node *node)
495 assert (node->op == op_Alloc);
500 get_irn_free_attr (ir_node *node)
502 assert (node->op == op_Free);
507 get_irn_symconst_attr (ir_node *node)
509 assert (node->op == op_SymConst);
514 get_irn_call_attr (ir_node *node)
516 assert (node->op == op_Call);
517 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
521 get_irn_sel_attr (ir_node *node)
523 assert (node->op == op_Sel);
528 get_irn_phi_attr (ir_node *node)
530 assert (node->op == op_Phi);
531 return node->attr.phi0_pos;
535 get_irn_block_attr (ir_node *node)
537 assert (node->op == op_Block);
538 return node->attr.block;
542 get_irn_load_attr (ir_node *node)
544 assert (node->op == op_Load);
545 return node->attr.load;
549 get_irn_store_attr (ir_node *node)
551 assert (node->op == op_Store);
552 return node->attr.store;
556 get_irn_except_attr (ir_node *node)
558 assert (node->op == op_Div || node->op == op_Quot ||
559 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
560 return node->attr.except;
564 get_irn_generic_attr (ir_node *node) {
568 /** manipulate fields of individual nodes **/
570 /* this works for all except Block */
572 get_nodes_block (const ir_node *node) {
573 assert (!(node->op == op_Block));
574 assert (is_irn_pinned_in_irg(node) && "block info may be incorrect");
575 return get_irn_n(node, -1);
579 set_nodes_block (ir_node *node, ir_node *block) {
580 assert (!(node->op == op_Block));
581 set_irn_n(node, -1, block);
584 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
585 * from Start. If so returns frame type, else Null. */
586 ir_type *is_frame_pointer(ir_node *n) {
587 if ((get_irn_op(n) == op_Proj) &&
588 (get_Proj_proj(n) == pn_Start_P_frame_base)) {
589 ir_node *start = get_Proj_pred(n);
590 if (get_irn_op(start) == op_Start) {
591 return get_irg_frame_type(get_irn_irg(start));
597 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
598 * from Start. If so returns global type, else Null. */
599 ir_type *is_globals_pointer(ir_node *n) {
600 if ((get_irn_op(n) == op_Proj) &&
601 (get_Proj_proj(n) == pn_Start_P_globals)) {
602 ir_node *start = get_Proj_pred(n);
603 if (get_irn_op(start) == op_Start) {
604 return get_glob_type();
610 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
611 * from Start. If so returns 1, else 0. */
612 int is_value_arg_pointer(ir_node *n) {
613 if ((get_irn_op(n) == op_Proj) &&
614 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
615 (get_irn_op(get_Proj_pred(n)) == op_Start))
620 /* Returns an array with the predecessors of the Block. Depending on
621 the implementation of the graph data structure this can be a copy of
622 the internal representation of predecessors as well as the internal
623 array itself. Therefore writing to this array might obstruct the ir. */
625 get_Block_cfgpred_arr (ir_node *node)
627 assert ((node->op == op_Block));
628 return (ir_node **)&(get_irn_in(node)[1]);
632 (get_Block_n_cfgpreds)(ir_node *node) {
633 return get_Block_n_cfgpreds(node);
637 (get_Block_cfgpred)(ir_node *node, int pos) {
638 return get_Block_cfgpred(node, pos);
642 set_Block_cfgpred (ir_node *node, int pos, ir_node *pred) {
643 assert (node->op == op_Block);
644 set_irn_n(node, pos, pred);
648 (get_Block_cfgpred_block)(ir_node *node, int pos) {
649 return _get_Block_cfgpred_block(node, pos);
653 get_Block_matured (ir_node *node) {
654 assert (node->op == op_Block);
655 return (int)node->attr.block.matured;
659 set_Block_matured (ir_node *node, int matured) {
660 assert (node->op == op_Block);
661 node->attr.block.matured = matured;
665 (get_Block_block_visited)(ir_node *node) {
666 return _get_Block_block_visited(node);
670 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
671 _set_Block_block_visited(node, visit);
674 /* For this current_ir_graph must be set. */
676 (mark_Block_block_visited)(ir_node *node) {
677 _mark_Block_block_visited(node);
681 (Block_not_block_visited)(ir_node *node) {
682 return _Block_not_block_visited(node);
686 get_Block_graph_arr (ir_node *node, int pos) {
687 assert (node->op == op_Block);
688 return node->attr.block.graph_arr[pos+1];
692 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
693 assert (node->op == op_Block);
694 node->attr.block.graph_arr[pos+1] = value;
697 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
698 assert(node->op == op_Block);
699 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
700 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
701 node->attr.block.in_cg[0] = NULL;
702 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
704 /* Fix backedge array. fix_backedges() operates depending on
705 interprocedural_view. */
706 int ipv = get_interprocedural_view();
707 set_interprocedural_view(1);
708 fix_backedges(current_ir_graph->obst, node);
709 set_interprocedural_view(ipv);
712 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
715 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
716 assert(node->op == op_Block &&
717 node->attr.block.in_cg &&
718 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
719 node->attr.block.in_cg[pos + 1] = pred;
722 ir_node ** get_Block_cg_cfgpred_arr(ir_node * node) {
723 assert(node->op == op_Block);
724 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
727 int get_Block_cg_n_cfgpreds(ir_node * node) {
728 assert(node->op == op_Block);
729 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
732 ir_node * get_Block_cg_cfgpred(ir_node * node, int pos) {
733 assert(node->op == op_Block && node->attr.block.in_cg);
734 return node->attr.block.in_cg[pos + 1];
737 void remove_Block_cg_cfgpred_arr(ir_node * node) {
738 assert(node->op == op_Block);
739 node->attr.block.in_cg = NULL;
742 ir_node *(set_Block_dead)(ir_node *block) {
743 return _set_Block_dead(block);
746 int (is_Block_dead)(const ir_node *block) {
747 return _is_Block_dead(block);
750 ir_extblk *get_Block_extbb(const ir_node *block) {
751 assert(is_Block(block));
752 return block->attr.block.extblk;
755 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
756 assert(is_Block(block));
757 block->attr.block.extblk = extblk;
761 set_Start_irg(ir_node *node, ir_graph *irg) {
762 assert(node->op == op_Start);
763 assert(is_ir_graph(irg));
764 assert(0 && " Why set irg? -- use set_irn_irg");
768 get_End_n_keepalives(ir_node *end) {
769 assert (end->op == op_End);
770 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
774 get_End_keepalive(ir_node *end, int pos) {
775 assert (end->op == op_End);
776 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
780 add_End_keepalive (ir_node *end, ir_node *ka) {
781 assert (end->op == op_End);
782 ARR_APP1 (ir_node *, end->in, ka);
786 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
787 assert (end->op == op_End);
788 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
792 free_End (ir_node *end) {
793 assert (end->op == op_End);
795 DEL_ARR_F(end->in); /* GL @@@ tut nicht ! */
796 end->in = NULL; /* @@@ make sure we get an error if we use the
797 in array afterwards ... */
800 /* Return the target address of an IJmp */
801 ir_node *get_IJmp_target(ir_node *ijmp) {
802 assert(ijmp->op == op_IJmp);
803 return get_irn_n(ijmp, 0);
806 /** Sets the target address of an IJmp */
807 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
808 assert(ijmp->op == op_IJmp);
809 set_irn_n(ijmp, 0, tgt);
813 > Implementing the case construct (which is where the constant Proj node is
814 > important) involves far more than simply determining the constant values.
815 > We could argue that this is more properly a function of the translator from
816 > Firm to the target machine. That could be done if there was some way of
817 > projecting "default" out of the Cond node.
818 I know it's complicated.
819 Basically there are two proglems:
820 - determining the gaps between the projs
821 - determining the biggest case constant to know the proj number for
823 I see several solutions:
824 1. Introduce a ProjDefault node. Solves both problems.
825 This means to extend all optimizations executed during construction.
826 2. Give the Cond node for switch two flavors:
827 a) there are no gaps in the projs (existing flavor)
828 b) gaps may exist, default proj is still the Proj with the largest
829 projection number. This covers also the gaps.
830 3. Fix the semantic of the Cond to that of 2b)
832 Solution 2 seems to be the best:
833 Computing the gaps in the Firm representation is not too hard, i.e.,
834 libFIRM can implement a routine that transforms between the two
835 flavours. This is also possible for 1) but 2) does not require to
836 change any existing optimization.
837 Further it should be far simpler to determine the biggest constant than
839 I don't want to choose 3) as 2a) seems to have advantages for
840 dataflow analysis and 3) does not allow to convert the representation to
844 get_Cond_selector (ir_node *node) {
845 assert (node->op == op_Cond);
846 return get_irn_n(node, 0);
850 set_Cond_selector (ir_node *node, ir_node *selector) {
851 assert (node->op == op_Cond);
852 set_irn_n(node, 0, selector);
856 get_Cond_kind (ir_node *node) {
857 assert (node->op == op_Cond);
858 return node->attr.c.kind;
862 set_Cond_kind (ir_node *node, cond_kind kind) {
863 assert (node->op == op_Cond);
864 node->attr.c.kind = kind;
868 get_Cond_defaultProj (ir_node *node) {
869 assert (node->op == op_Cond);
870 return node->attr.c.default_proj;
874 get_Return_mem (ir_node *node) {
875 assert (node->op == op_Return);
876 return get_irn_n(node, 0);
880 set_Return_mem (ir_node *node, ir_node *mem) {
881 assert (node->op == op_Return);
882 set_irn_n(node, 0, mem);
886 get_Return_n_ress (ir_node *node) {
887 assert (node->op == op_Return);
888 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
892 get_Return_res_arr (ir_node *node)
894 assert ((node->op == op_Return));
895 if (get_Return_n_ress(node) > 0)
896 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
903 set_Return_n_res (ir_node *node, int results) {
904 assert (node->op == op_Return);
909 get_Return_res (ir_node *node, int pos) {
910 assert (node->op == op_Return);
911 assert (get_Return_n_ress(node) > pos);
912 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
916 set_Return_res (ir_node *node, int pos, ir_node *res){
917 assert (node->op == op_Return);
918 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
922 get_Raise_mem (ir_node *node) {
923 assert (node->op == op_Raise);
924 return get_irn_n(node, 0);
928 set_Raise_mem (ir_node *node, ir_node *mem) {
929 assert (node->op == op_Raise);
930 set_irn_n(node, 0, mem);
934 get_Raise_exo_ptr (ir_node *node) {
935 assert (node->op == op_Raise);
936 return get_irn_n(node, 1);
940 set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) {
941 assert (node->op == op_Raise);
942 set_irn_n(node, 1, exo_ptr);
945 tarval *(get_Const_tarval)(ir_node *node) {
946 return _get_Const_tarval(node);
950 set_Const_tarval (ir_node *node, tarval *con) {
951 assert (node->op == op_Const);
952 node->attr.con.tv = con;
955 cnst_classify_t (classify_Const)(ir_node *node)
957 return _classify_Const(node);
961 /* The source language type. Must be an atomic type. Mode of type must
962 be mode of node. For tarvals from entities type must be pointer to
965 get_Const_type (ir_node *node) {
966 assert (node->op == op_Const);
967 return node->attr.con.tp;
971 set_Const_type (ir_node *node, ir_type *tp) {
972 assert (node->op == op_Const);
973 if (tp != firm_unknown_type) {
974 assert (is_atomic_type(tp));
975 assert (get_type_mode(tp) == get_irn_mode(node));
977 node->attr.con.tp = tp;
982 get_SymConst_kind (const ir_node *node) {
983 assert (node->op == op_SymConst);
984 return node->attr.i.num;
988 set_SymConst_kind (ir_node *node, symconst_kind num) {
989 assert (node->op == op_SymConst);
990 node->attr.i.num = num;
994 get_SymConst_type (ir_node *node) {
995 assert ( (node->op == op_SymConst)
996 && ( get_SymConst_kind(node) == symconst_type_tag
997 || get_SymConst_kind(node) == symconst_size));
998 return node->attr.i.sym.type_p = skip_tid(node->attr.i.sym.type_p);
1002 set_SymConst_type (ir_node *node, ir_type *tp) {
1003 assert ( (node->op == op_SymConst)
1004 && ( get_SymConst_kind(node) == symconst_type_tag
1005 || get_SymConst_kind(node) == symconst_size));
1006 node->attr.i.sym.type_p = tp;
1010 get_SymConst_name (ir_node *node) {
1011 assert ( (node->op == op_SymConst)
1012 && (get_SymConst_kind(node) == symconst_addr_name));
1013 return node->attr.i.sym.ident_p;
1017 set_SymConst_name (ir_node *node, ident *name) {
1018 assert ( (node->op == op_SymConst)
1019 && (get_SymConst_kind(node) == symconst_addr_name));
1020 node->attr.i.sym.ident_p = name;
1024 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1025 entity *get_SymConst_entity (ir_node *node) {
1026 assert ( (node->op == op_SymConst)
1027 && (get_SymConst_kind (node) == symconst_addr_ent));
1028 return node->attr.i.sym.entity_p;
1031 void set_SymConst_entity (ir_node *node, entity *ent) {
1032 assert ( (node->op == op_SymConst)
1033 && (get_SymConst_kind(node) == symconst_addr_ent));
1034 node->attr.i.sym.entity_p = ent;
1037 union symconst_symbol
1038 get_SymConst_symbol (ir_node *node) {
1039 assert (node->op == op_SymConst);
1040 return node->attr.i.sym;
1044 set_SymConst_symbol (ir_node *node, union symconst_symbol sym) {
1045 assert (node->op == op_SymConst);
1046 //memcpy (&(node->attr.i.sym), sym, sizeof(type_or_id));
1047 node->attr.i.sym = sym;
1051 get_SymConst_value_type (ir_node *node) {
1052 assert (node->op == op_SymConst);
1053 if (node->attr.i.tp) node->attr.i.tp = skip_tid(node->attr.i.tp);
1054 return node->attr.i.tp;
1058 set_SymConst_value_type (ir_node *node, ir_type *tp) {
1059 assert (node->op == op_SymConst);
1060 node->attr.i.tp = tp;
1064 get_Sel_mem (ir_node *node) {
1065 assert (node->op == op_Sel);
1066 return get_irn_n(node, 0);
1070 set_Sel_mem (ir_node *node, ir_node *mem) {
1071 assert (node->op == op_Sel);
1072 set_irn_n(node, 0, mem);
1076 get_Sel_ptr (ir_node *node) {
1077 assert (node->op == op_Sel);
1078 return get_irn_n(node, 1);
1082 set_Sel_ptr (ir_node *node, ir_node *ptr) {
1083 assert (node->op == op_Sel);
1084 set_irn_n(node, 1, ptr);
1088 get_Sel_n_indexs (ir_node *node) {
1089 assert (node->op == op_Sel);
1090 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1094 get_Sel_index_arr (ir_node *node)
1096 assert ((node->op == op_Sel));
1097 if (get_Sel_n_indexs(node) > 0)
1098 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1104 get_Sel_index (ir_node *node, int pos) {
1105 assert (node->op == op_Sel);
1106 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1110 set_Sel_index (ir_node *node, int pos, ir_node *index) {
1111 assert (node->op == op_Sel);
1112 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1116 get_Sel_entity (ir_node *node) {
1117 assert (node->op == op_Sel);
1118 return node->attr.s.ent;
1122 set_Sel_entity (ir_node *node, entity *ent) {
1123 assert (node->op == op_Sel);
1124 node->attr.s.ent = ent;
1128 get_InstOf_type (ir_node *node) {
1129 assert (node->op = op_InstOf);
1130 return (node->attr.io.type);
1134 set_InstOf_type (ir_node *node, ir_type *type) {
1135 assert (node->op = op_InstOf);
1136 node->attr.io.type = type;
1140 get_InstOf_store (ir_node *node) {
1141 assert (node->op = op_InstOf);
1142 return (get_irn_n (node, 0));
1146 set_InstOf_store (ir_node *node, ir_node *obj) {
1147 assert (node->op = op_InstOf);
1148 set_irn_n (node, 0, obj);
1152 get_InstOf_obj (ir_node *node) {
1153 assert (node->op = op_InstOf);
1154 return (get_irn_n (node, 1));
1158 set_InstOf_obj (ir_node *node, ir_node *obj) {
1159 assert (node->op = op_InstOf);
1160 set_irn_n (node, 1, obj);
1164 /* For unary and binary arithmetic operations the access to the
1165 operands can be factored out. Left is the first, right the
1166 second arithmetic value as listed in tech report 0999-33.
1167 unops are: Minus, Abs, Not, Conv, Cast
1168 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1169 Shr, Shrs, Rotate, Cmp */
1173 get_Call_mem (ir_node *node) {
1174 assert (node->op == op_Call);
1175 return get_irn_n(node, 0);
1179 set_Call_mem (ir_node *node, ir_node *mem) {
1180 assert (node->op == op_Call);
1181 set_irn_n(node, 0, mem);
1185 get_Call_ptr (ir_node *node) {
1186 assert (node->op == op_Call);
1187 return get_irn_n(node, 1);
1191 set_Call_ptr (ir_node *node, ir_node *ptr) {
1192 assert (node->op == op_Call);
1193 set_irn_n(node, 1, ptr);
1197 get_Call_param_arr (ir_node *node) {
1198 assert (node->op == op_Call);
1199 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1203 get_Call_n_params (ir_node *node) {
1204 assert (node->op == op_Call);
1205 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1209 get_Call_arity (ir_node *node) {
1210 assert (node->op == op_Call);
1211 return get_Call_n_params(node);
1215 set_Call_arity (ir_node *node, ir_node *arity) {
1216 assert (node->op == op_Call);
1221 get_Call_param (ir_node *node, int pos) {
1222 assert (node->op == op_Call);
1223 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1227 set_Call_param (ir_node *node, int pos, ir_node *param) {
1228 assert (node->op == op_Call);
1229 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1233 get_Call_type (ir_node *node) {
1234 assert (node->op == op_Call);
1235 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1239 set_Call_type (ir_node *node, ir_type *tp) {
1240 assert (node->op == op_Call);
1241 assert ((get_unknown_type() == tp) || is_Method_type(tp));
1242 node->attr.call.cld_tp = tp;
1245 int Call_has_callees(ir_node *node) {
1246 assert(node && node->op == op_Call);
1247 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1248 (node->attr.call.callee_arr != NULL));
1251 int get_Call_n_callees(ir_node * node) {
1252 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1253 return ARR_LEN(node->attr.call.callee_arr);
1256 entity * get_Call_callee(ir_node * node, int pos) {
1257 assert(pos >= 0 && pos < get_Call_n_callees(node));
1258 return node->attr.call.callee_arr[pos];
1261 void set_Call_callee_arr(ir_node * node, const int n, entity ** arr) {
1262 assert(node->op == op_Call);
1263 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1264 node->attr.call.callee_arr = NEW_ARR_D(entity *, current_ir_graph->obst, n);
1266 memcpy(node->attr.call.callee_arr, arr, n * sizeof(entity *));
1269 void remove_Call_callee_arr(ir_node * node) {
1270 assert(node->op == op_Call);
1271 node->attr.call.callee_arr = NULL;
1274 ir_node * get_CallBegin_ptr (ir_node *node) {
1275 assert(node->op == op_CallBegin);
1276 return get_irn_n(node, 0);
1278 void set_CallBegin_ptr (ir_node *node, ir_node *ptr) {
1279 assert(node->op == op_CallBegin);
1280 set_irn_n(node, 0, ptr);
1282 ir_node * get_CallBegin_call (ir_node *node) {
1283 assert(node->op == op_CallBegin);
1284 return node->attr.callbegin.call;
1286 void set_CallBegin_call (ir_node *node, ir_node *call) {
1287 assert(node->op == op_CallBegin);
1288 node->attr.callbegin.call = call;
1293 ir_node * get_##OP##_left(ir_node *node) { \
1294 assert(node->op == op_##OP); \
1295 return get_irn_n(node, node->op->op_index); \
1297 void set_##OP##_left(ir_node *node, ir_node *left) { \
1298 assert(node->op == op_##OP); \
1299 set_irn_n(node, node->op->op_index, left); \
1301 ir_node *get_##OP##_right(ir_node *node) { \
1302 assert(node->op == op_##OP); \
1303 return get_irn_n(node, node->op->op_index + 1); \
1305 void set_##OP##_right(ir_node *node, ir_node *right) { \
1306 assert(node->op == op_##OP); \
1307 set_irn_n(node, node->op->op_index + 1, right); \
1311 ir_node *get_##OP##_op(ir_node *node) { \
1312 assert(node->op == op_##OP); \
1313 return get_irn_n(node, node->op->op_index); \
1315 void set_##OP##_op (ir_node *node, ir_node *op) { \
1316 assert(node->op == op_##OP); \
1317 set_irn_n(node, node->op->op_index, op); \
1327 get_Quot_mem (ir_node *node) {
1328 assert (node->op == op_Quot);
1329 return get_irn_n(node, 0);
1333 set_Quot_mem (ir_node *node, ir_node *mem) {
1334 assert (node->op == op_Quot);
1335 set_irn_n(node, 0, mem);
1341 get_DivMod_mem (ir_node *node) {
1342 assert (node->op == op_DivMod);
1343 return get_irn_n(node, 0);
1347 set_DivMod_mem (ir_node *node, ir_node *mem) {
1348 assert (node->op == op_DivMod);
1349 set_irn_n(node, 0, mem);
1355 get_Div_mem (ir_node *node) {
1356 assert (node->op == op_Div);
1357 return get_irn_n(node, 0);
1361 set_Div_mem (ir_node *node, ir_node *mem) {
1362 assert (node->op == op_Div);
1363 set_irn_n(node, 0, mem);
1369 get_Mod_mem (ir_node *node) {
1370 assert (node->op == op_Mod);
1371 return get_irn_n(node, 0);
1375 set_Mod_mem (ir_node *node, ir_node *mem) {
1376 assert (node->op == op_Mod);
1377 set_irn_n(node, 0, mem);
1394 get_Cast_type (ir_node *node) {
1395 assert (node->op == op_Cast);
1396 return node->attr.cast.totype;
1400 set_Cast_type (ir_node *node, ir_type *to_tp) {
1401 assert (node->op == op_Cast);
1402 node->attr.cast.totype = to_tp;
1406 /* Checks for upcast.
1408 * Returns true if the Cast node casts a class type to a super type.
1410 int is_Cast_upcast(ir_node *node) {
1411 ir_type *totype = get_Cast_type(node);
1412 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1413 ir_graph *myirg = get_irn_irg(node);
1415 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1418 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1419 totype = get_pointer_points_to_type(totype);
1420 fromtype = get_pointer_points_to_type(fromtype);
1425 if (!is_Class_type(totype)) return 0;
1426 return is_SubClass_of(fromtype, totype);
1429 /* Checks for downcast.
1431 * Returns true if the Cast node casts a class type to a sub type.
1433 int is_Cast_downcast(ir_node *node) {
1434 ir_type *totype = get_Cast_type(node);
1435 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1437 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1440 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1441 totype = get_pointer_points_to_type(totype);
1442 fromtype = get_pointer_points_to_type(fromtype);
1447 if (!is_Class_type(totype)) return 0;
1448 return is_SubClass_of(totype, fromtype);
1452 (is_unop)(const ir_node *node) {
1453 return _is_unop(node);
1457 get_unop_op (ir_node *node) {
1458 if (node->op->opar == oparity_unary)
1459 return get_irn_n(node, node->op->op_index);
1461 assert(node->op->opar == oparity_unary);
1466 set_unop_op (ir_node *node, ir_node *op) {
1467 if (node->op->opar == oparity_unary)
1468 set_irn_n(node, node->op->op_index, op);
1470 assert(node->op->opar == oparity_unary);
1474 (is_binop)(const ir_node *node) {
1475 return _is_binop(node);
1479 get_binop_left (ir_node *node) {
1480 if (node->op->opar == oparity_binary)
1481 return get_irn_n(node, node->op->op_index);
1483 assert(node->op->opar == oparity_binary);
1488 set_binop_left (ir_node *node, ir_node *left) {
1489 if (node->op->opar == oparity_binary)
1490 set_irn_n(node, node->op->op_index, left);
1492 assert (node->op->opar == oparity_binary);
1496 get_binop_right (ir_node *node) {
1497 if (node->op->opar == oparity_binary)
1498 return get_irn_n(node, node->op->op_index + 1);
1500 assert(node->op->opar == oparity_binary);
1505 set_binop_right (ir_node *node, ir_node *right) {
1506 if (node->op->opar == oparity_binary)
1507 set_irn_n(node, node->op->op_index + 1, right);
1509 assert (node->op->opar == oparity_binary);
1512 int is_Phi (const ir_node *n) {
1518 if (op == op_Filter) return get_interprocedural_view();
1521 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1522 (get_irn_arity(n) > 0));
1527 int is_Phi0 (const ir_node *n) {
1530 return ((get_irn_op(n) == op_Phi) &&
1531 (get_irn_arity(n) == 0) &&
1532 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1536 get_Phi_preds_arr (ir_node *node) {
1537 assert (node->op == op_Phi);
1538 return (ir_node **)&(get_irn_in(node)[1]);
1542 get_Phi_n_preds (ir_node *node) {
1543 assert (is_Phi(node) || is_Phi0(node));
1544 return (get_irn_arity(node));
1548 void set_Phi_n_preds (ir_node *node, int n_preds) {
1549 assert (node->op == op_Phi);
1554 get_Phi_pred (ir_node *node, int pos) {
1555 assert (is_Phi(node) || is_Phi0(node));
1556 return get_irn_n(node, pos);
1560 set_Phi_pred (ir_node *node, int pos, ir_node *pred) {
1561 assert (is_Phi(node) || is_Phi0(node));
1562 set_irn_n(node, pos, pred);
1566 int is_memop(ir_node *node) {
1567 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1570 ir_node *get_memop_mem (ir_node *node) {
1571 assert(is_memop(node));
1572 return get_irn_n(node, 0);
1575 void set_memop_mem (ir_node *node, ir_node *mem) {
1576 assert(is_memop(node));
1577 set_irn_n(node, 0, mem);
1580 ir_node *get_memop_ptr (ir_node *node) {
1581 assert(is_memop(node));
1582 return get_irn_n(node, 1);
1585 void set_memop_ptr (ir_node *node, ir_node *ptr) {
1586 assert(is_memop(node));
1587 set_irn_n(node, 1, ptr);
1591 get_Load_mem (ir_node *node) {
1592 assert (node->op == op_Load);
1593 return get_irn_n(node, 0);
1597 set_Load_mem (ir_node *node, ir_node *mem) {
1598 assert (node->op == op_Load);
1599 set_irn_n(node, 0, mem);
1603 get_Load_ptr (ir_node *node) {
1604 assert (node->op == op_Load);
1605 return get_irn_n(node, 1);
1609 set_Load_ptr (ir_node *node, ir_node *ptr) {
1610 assert (node->op == op_Load);
1611 set_irn_n(node, 1, ptr);
1615 get_Load_mode (ir_node *node) {
1616 assert (node->op == op_Load);
1617 return node->attr.load.load_mode;
1621 set_Load_mode (ir_node *node, ir_mode *mode) {
1622 assert (node->op == op_Load);
1623 node->attr.load.load_mode = mode;
1627 get_Load_volatility (ir_node *node) {
1628 assert (node->op == op_Load);
1629 return node->attr.load.volatility;
1633 set_Load_volatility (ir_node *node, ent_volatility volatility) {
1634 assert (node->op == op_Load);
1635 node->attr.load.volatility = volatility;
1640 get_Store_mem (ir_node *node) {
1641 assert (node->op == op_Store);
1642 return get_irn_n(node, 0);
1646 set_Store_mem (ir_node *node, ir_node *mem) {
1647 assert (node->op == op_Store);
1648 set_irn_n(node, 0, mem);
1652 get_Store_ptr (ir_node *node) {
1653 assert (node->op == op_Store);
1654 return get_irn_n(node, 1);
1658 set_Store_ptr (ir_node *node, ir_node *ptr) {
1659 assert (node->op == op_Store);
1660 set_irn_n(node, 1, ptr);
1664 get_Store_value (ir_node *node) {
1665 assert (node->op == op_Store);
1666 return get_irn_n(node, 2);
1670 set_Store_value (ir_node *node, ir_node *value) {
1671 assert (node->op == op_Store);
1672 set_irn_n(node, 2, value);
1676 get_Store_volatility (ir_node *node) {
1677 assert (node->op == op_Store);
1678 return node->attr.store.volatility;
1682 set_Store_volatility (ir_node *node, ent_volatility volatility) {
1683 assert (node->op == op_Store);
1684 node->attr.store.volatility = volatility;
1689 get_Alloc_mem (ir_node *node) {
1690 assert (node->op == op_Alloc);
1691 return get_irn_n(node, 0);
1695 set_Alloc_mem (ir_node *node, ir_node *mem) {
1696 assert (node->op == op_Alloc);
1697 set_irn_n(node, 0, mem);
1701 get_Alloc_size (ir_node *node) {
1702 assert (node->op == op_Alloc);
1703 return get_irn_n(node, 1);
1707 set_Alloc_size (ir_node *node, ir_node *size) {
1708 assert (node->op == op_Alloc);
1709 set_irn_n(node, 1, size);
1713 get_Alloc_type (ir_node *node) {
1714 assert (node->op == op_Alloc);
1715 return node->attr.a.type = skip_tid(node->attr.a.type);
1719 set_Alloc_type (ir_node *node, ir_type *tp) {
1720 assert (node->op == op_Alloc);
1721 node->attr.a.type = tp;
1725 get_Alloc_where (ir_node *node) {
1726 assert (node->op == op_Alloc);
1727 return node->attr.a.where;
1731 set_Alloc_where (ir_node *node, where_alloc where) {
1732 assert (node->op == op_Alloc);
1733 node->attr.a.where = where;
1738 get_Free_mem (ir_node *node) {
1739 assert (node->op == op_Free);
1740 return get_irn_n(node, 0);
1744 set_Free_mem (ir_node *node, ir_node *mem) {
1745 assert (node->op == op_Free);
1746 set_irn_n(node, 0, mem);
1750 get_Free_ptr (ir_node *node) {
1751 assert (node->op == op_Free);
1752 return get_irn_n(node, 1);
1756 set_Free_ptr (ir_node *node, ir_node *ptr) {
1757 assert (node->op == op_Free);
1758 set_irn_n(node, 1, ptr);
1762 get_Free_size (ir_node *node) {
1763 assert (node->op == op_Free);
1764 return get_irn_n(node, 2);
1768 set_Free_size (ir_node *node, ir_node *size) {
1769 assert (node->op == op_Free);
1770 set_irn_n(node, 2, size);
1774 get_Free_type (ir_node *node) {
1775 assert (node->op == op_Free);
1776 return node->attr.f.type = skip_tid(node->attr.f.type);
1780 set_Free_type (ir_node *node, ir_type *tp) {
1781 assert (node->op == op_Free);
1782 node->attr.f.type = tp;
1786 get_Free_where (ir_node *node) {
1787 assert (node->op == op_Free);
1788 return node->attr.f.where;
1792 set_Free_where (ir_node *node, where_alloc where) {
1793 assert (node->op == op_Free);
1794 node->attr.f.where = where;
1798 get_Sync_preds_arr (ir_node *node) {
1799 assert (node->op == op_Sync);
1800 return (ir_node **)&(get_irn_in(node)[1]);
1804 get_Sync_n_preds (ir_node *node) {
1805 assert (node->op == op_Sync);
1806 return (get_irn_arity(node));
1811 set_Sync_n_preds (ir_node *node, int n_preds) {
1812 assert (node->op == op_Sync);
1817 get_Sync_pred (ir_node *node, int pos) {
1818 assert (node->op == op_Sync);
1819 return get_irn_n(node, pos);
1823 set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
1824 assert (node->op == op_Sync);
1825 set_irn_n(node, pos, pred);
1828 ir_type *get_Proj_type(ir_node *n)
1831 ir_node *pred = get_Proj_pred(n);
1833 switch (get_irn_opcode(pred)) {
1836 /* Deal with Start / Call here: we need to know the Proj Nr. */
1837 assert(get_irn_mode(pred) == mode_T);
1838 pred_pred = get_Proj_pred(pred);
1839 if (get_irn_op(pred_pred) == op_Start) {
1840 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1841 tp = get_method_param_type(mtp, get_Proj_proj(n));
1842 } else if (get_irn_op(pred_pred) == op_Call) {
1843 ir_type *mtp = get_Call_type(pred_pred);
1844 tp = get_method_res_type(mtp, get_Proj_proj(n));
1847 case iro_Start: break;
1848 case iro_Call: break;
1850 ir_node *a = get_Load_ptr(pred);
1851 if (get_irn_op(a) == op_Sel)
1852 tp = get_entity_type(get_Sel_entity(a));
1861 get_Proj_pred (const ir_node *node) {
1862 assert (is_Proj(node));
1863 return get_irn_n(node, 0);
1867 set_Proj_pred (ir_node *node, ir_node *pred) {
1868 assert (is_Proj(node));
1869 set_irn_n(node, 0, pred);
1873 get_Proj_proj (const ir_node *node) {
1874 assert (is_Proj(node));
1875 if (get_irn_opcode(node) == iro_Proj) {
1876 return node->attr.proj;
1878 assert(get_irn_opcode(node) == iro_Filter);
1879 return node->attr.filter.proj;
1884 set_Proj_proj (ir_node *node, long proj) {
1885 assert (node->op == op_Proj);
1886 node->attr.proj = proj;
1890 get_Tuple_preds_arr (ir_node *node) {
1891 assert (node->op == op_Tuple);
1892 return (ir_node **)&(get_irn_in(node)[1]);
1896 get_Tuple_n_preds (ir_node *node) {
1897 assert (node->op == op_Tuple);
1898 return (get_irn_arity(node));
1903 set_Tuple_n_preds (ir_node *node, int n_preds) {
1904 assert (node->op == op_Tuple);
1909 get_Tuple_pred (ir_node *node, int pos) {
1910 assert (node->op == op_Tuple);
1911 return get_irn_n(node, pos);
1915 set_Tuple_pred (ir_node *node, int pos, ir_node *pred) {
1916 assert (node->op == op_Tuple);
1917 set_irn_n(node, pos, pred);
1921 get_Id_pred (ir_node *node) {
1922 assert (node->op == op_Id);
1923 return get_irn_n(node, 0);
1927 set_Id_pred (ir_node *node, ir_node *pred) {
1928 assert (node->op == op_Id);
1929 set_irn_n(node, 0, pred);
1932 ir_node *get_Confirm_value (ir_node *node) {
1933 assert (node->op == op_Confirm);
1934 return get_irn_n(node, 0);
1936 void set_Confirm_value (ir_node *node, ir_node *value) {
1937 assert (node->op == op_Confirm);
1938 set_irn_n(node, 0, value);
1940 ir_node *get_Confirm_bound (ir_node *node) {
1941 assert (node->op == op_Confirm);
1942 return get_irn_n(node, 1);
1944 void set_Confirm_bound (ir_node *node, ir_node *bound) {
1945 assert (node->op == op_Confirm);
1946 set_irn_n(node, 0, bound);
1948 pn_Cmp get_Confirm_cmp (ir_node *node) {
1949 assert (node->op == op_Confirm);
1950 return node->attr.confirm_cmp;
1952 void set_Confirm_cmp (ir_node *node, pn_Cmp cmp) {
1953 assert (node->op == op_Confirm);
1954 node->attr.confirm_cmp = cmp;
1959 get_Filter_pred (ir_node *node) {
1960 assert(node->op == op_Filter);
1964 set_Filter_pred (ir_node *node, ir_node *pred) {
1965 assert(node->op == op_Filter);
1969 get_Filter_proj(ir_node *node) {
1970 assert(node->op == op_Filter);
1971 return node->attr.filter.proj;
1974 set_Filter_proj (ir_node *node, long proj) {
1975 assert(node->op == op_Filter);
1976 node->attr.filter.proj = proj;
1979 /* Don't use get_irn_arity, get_irn_n in implementation as access
1980 shall work independent of view!!! */
1981 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
1982 assert(node->op == op_Filter);
1983 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
1984 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
1985 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
1986 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
1987 node->attr.filter.in_cg[0] = node->in[0];
1989 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
1992 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
1993 assert(node->op == op_Filter && node->attr.filter.in_cg &&
1994 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
1995 node->attr.filter.in_cg[pos + 1] = pred;
1997 int get_Filter_n_cg_preds(ir_node *node) {
1998 assert(node->op == op_Filter && node->attr.filter.in_cg);
1999 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2001 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2003 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2005 arity = ARR_LEN(node->attr.filter.in_cg);
2006 assert(pos < arity - 1);
2007 return node->attr.filter.in_cg[pos + 1];
2011 ir_node *get_Mux_sel (ir_node *node) {
2012 assert(node->op == op_Mux);
2015 void set_Mux_sel (ir_node *node, ir_node *sel) {
2016 assert(node->op == op_Mux);
2020 ir_node *get_Mux_false (ir_node *node) {
2021 assert(node->op == op_Mux);
2024 void set_Mux_false (ir_node *node, ir_node *ir_false) {
2025 assert(node->op == op_Mux);
2026 node->in[2] = ir_false;
2029 ir_node *get_Mux_true (ir_node *node) {
2030 assert(node->op == op_Mux);
2033 void set_Mux_true (ir_node *node, ir_node *ir_true) {
2034 assert(node->op == op_Mux);
2035 node->in[3] = ir_true;
2039 ir_node *get_CopyB_mem (ir_node *node) {
2040 assert (node->op == op_CopyB);
2041 return get_irn_n(node, 0);
2044 void set_CopyB_mem (ir_node *node, ir_node *mem) {
2045 assert (node->op == op_CopyB);
2046 set_irn_n(node, 0, mem);
2049 ir_node *get_CopyB_dst (ir_node *node) {
2050 assert (node->op == op_CopyB);
2051 return get_irn_n(node, 1);
2054 void set_CopyB_dst (ir_node *node, ir_node *dst) {
2055 assert (node->op == op_CopyB);
2056 set_irn_n(node, 1, dst);
2059 ir_node *get_CopyB_src (ir_node *node) {
2060 assert (node->op == op_CopyB);
2061 return get_irn_n(node, 2);
2064 void set_CopyB_src (ir_node *node, ir_node *src) {
2065 assert (node->op == op_CopyB);
2066 set_irn_n(node, 2, src);
2069 ir_type *get_CopyB_type(ir_node *node) {
2070 assert (node->op == op_CopyB);
2071 return node->attr.copyb.data_type;
2074 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2075 assert (node->op == op_CopyB && data_type);
2076 node->attr.copyb.data_type = data_type;
2081 /* Returns the memory input of a Bound operation. */
2082 ir_node *get_Bound_mem(ir_node *bound) {
2083 assert (bound->op == op_Bound);
2084 return get_irn_n(bound, 0);
2087 void set_Bound_mem (ir_node *bound, ir_node *mem) {
2088 assert (bound->op == op_Bound);
2089 set_irn_n(bound, 0, mem);
2092 /* Returns the index input of a Bound operation. */
2093 ir_node *get_Bound_index(ir_node *bound) {
2094 assert (bound->op == op_Bound);
2095 return get_irn_n(bound, 1);
2098 void set_Bound_index(ir_node *bound, ir_node *idx) {
2099 assert (bound->op == op_Bound);
2100 set_irn_n(bound, 1, idx);
2103 /* Returns the lower bound input of a Bound operation. */
2104 ir_node *get_Bound_lower(ir_node *bound) {
2105 assert (bound->op == op_Bound);
2106 return get_irn_n(bound, 2);
2109 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2110 assert (bound->op == op_Bound);
2111 set_irn_n(bound, 2, lower);
2114 /* Returns the upper bound input of a Bound operation. */
2115 ir_node *get_Bound_upper(ir_node *bound) {
2116 assert (bound->op == op_Bound);
2117 return get_irn_n(bound, 3);
2120 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2121 assert (bound->op == op_Bound);
2122 set_irn_n(bound, 3, upper);
2125 /* returns the graph of a node */
2127 get_irn_irg(const ir_node *node) {
2129 * Do not use get_nodes_Block() here, because this
2130 * will check the pinned state.
2131 * However even a 'wrong' block is always in the proper
2134 if (! is_Block(node))
2135 node = get_irn_n(node, -1);
2136 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2137 node = get_irn_n(node, -1);
2138 assert(get_irn_op(node) == op_Block);
2139 return node->attr.block.irg;
2143 /*----------------------------------------------------------------*/
2144 /* Auxiliary routines */
2145 /*----------------------------------------------------------------*/
2148 skip_Proj (ir_node *node) {
2149 /* don't assert node !!! */
2150 if (node && is_Proj(node)) {
2151 return get_Proj_pred(node);
2158 skip_Tuple (ir_node *node) {
2162 if (!get_opt_normalize()) return node;
2165 node = skip_Id(node);
2166 if (get_irn_op(node) == op_Proj) {
2167 pred = skip_Id(get_Proj_pred(node));
2168 op = get_irn_op(pred);
2171 * Looks strange but calls get_irn_op() only once
2172 * in most often cases.
2174 if (op == op_Proj) { /* nested Tuple ? */
2175 pred = skip_Id(skip_Tuple(pred));
2176 op = get_irn_op(pred);
2178 if (op == op_Tuple) {
2179 node = get_Tuple_pred(pred, get_Proj_proj(node));
2183 else if (op == op_Tuple) {
2184 node = get_Tuple_pred(pred, get_Proj_proj(node));
2191 /* returns operand of node if node is a Cast */
2192 ir_node *skip_Cast (ir_node *node) {
2193 if (node && get_irn_op(node) == op_Cast)
2194 return get_Cast_op(node);
2198 /* returns operand of node if node is a Confirm */
2199 ir_node *skip_Confirm (ir_node *node) {
2200 if (node && get_irn_op(node) == op_Confirm)
2201 return get_Confirm_value(node);
2205 /* skip all high-level ops */
2206 ir_node *skip_HighLevel(ir_node *node) {
2207 if (node && is_op_highlevel(get_irn_op(node)))
2208 return get_irn_n(node, 0);
2213 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2214 * than any other approach, as Id chains are resolved and all point to the real node, or
2215 * all id's are self loops.
2217 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2220 skip_Id (ir_node *node) {
2221 /* don't assert node !!! */
2223 /* Don't use get_Id_pred: We get into an endless loop for
2224 self-referencing Ids. */
2225 if (node && (node->op == op_Id) && (node != node->in[0+1])) {
2226 ir_node *rem_pred = node->in[0+1];
2229 assert (get_irn_arity (node) > 0);
2231 node->in[0+1] = node;
2232 res = skip_Id(rem_pred);
2233 if (res->op == op_Id) /* self-loop */ return node;
2235 node->in[0+1] = res;
2242 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2243 * than any other approach, as Id chains are resolved and all point to the real node, or
2244 * all id's are self loops.
2246 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2247 * a little bit "hand optimized".
2249 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2252 skip_Id (ir_node *node) {
2254 /* don't assert node !!! */
2256 if (!node || (node->op != op_Id)) return node;
2258 /* Don't use get_Id_pred(): We get into an endless loop for
2259 self-referencing Ids. */
2260 pred = node->in[0+1];
2262 if (pred->op != op_Id) return pred;
2264 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2265 ir_node *rem_pred, *res;
2267 if (pred->op != op_Id) return pred; /* shortcut */
2270 assert (get_irn_arity (node) > 0);
2272 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2273 res = skip_Id(rem_pred);
2274 if (res->op == op_Id) /* self-loop */ return node;
2276 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2284 void skip_Id_and_store(ir_node **node) {
2287 if (!n || (n->op != op_Id)) return;
2289 /* Don't use get_Id_pred(): We get into an endless loop for
2290 self-referencing Ids. */
2295 (is_Bad)(const ir_node *node) {
2296 return _is_Bad(node);
2300 (is_Const)(const ir_node *node) {
2301 return _is_Const(node);
2305 (is_no_Block)(const ir_node *node) {
2306 return _is_no_Block(node);
2310 (is_Block)(const ir_node *node) {
2311 return _is_Block(node);
2314 /* returns true if node is a Unknown node. */
2316 (is_Unknown)(const ir_node *node) {
2317 return _is_Unknown(node);
2321 is_Proj (const ir_node *node) {
2323 return node->op == op_Proj
2324 || (!get_interprocedural_view() && node->op == op_Filter);
2327 /* Returns true if the operation manipulates control flow. */
2329 is_cfop(const ir_node *node) {
2330 return is_cfopcode(get_irn_op(node));
2333 /* Returns true if the operation manipulates interprocedural control flow:
2334 CallBegin, EndReg, EndExcept */
2335 int is_ip_cfop(const ir_node *node) {
2336 return is_ip_cfopcode(get_irn_op(node));
2339 /* Returns true if the operation can change the control flow because
2342 is_fragile_op(const ir_node *node) {
2343 return is_op_fragile(get_irn_op(node));
2346 /* Returns the memory operand of fragile operations. */
2347 ir_node *get_fragile_op_mem(ir_node *node) {
2348 assert(node && is_fragile_op(node));
2350 switch (get_irn_opcode (node)) {
2359 return get_irn_n(node, 0);
2364 assert(0 && "should not be reached");
2369 /* Returns true if the operation is a forking control flow operation. */
2370 int (is_irn_forking)(const ir_node *node) {
2371 return _is_irn_forking(node);
2374 /* Return the type associated with the value produced by n
2375 * if the node remarks this type as it is the case for
2376 * Cast, Const, SymConst and some Proj nodes. */
2377 ir_type *(get_irn_type)(ir_node *node) {
2378 return _get_irn_type(node);
2381 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2383 ir_type *(get_irn_type_attr)(ir_node *node) {
2384 return _get_irn_type_attr(node);
2387 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2388 entity *(get_irn_entity_attr)(ir_node *node) {
2389 return _get_irn_entity_attr(node);
2392 /* Returns non-zero for constant-like nodes. */
2393 int (is_irn_constlike)(const ir_node *node) {
2394 return _is_irn_constlike(node);
2397 /* Gets the string representation of the jump prediction .*/
2398 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
2402 case COND_JMP_PRED_NONE: return "no prediction";
2403 case COND_JMP_PRED_TRUE: return "true taken";
2404 case COND_JMP_PRED_FALSE: return "false taken";
2408 /* Returns the conditional jump prediction of a Cond node. */
2409 cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
2410 return _get_Cond_jmp_pred(cond);
2413 /* Sets a new conditional jump prediction. */
2414 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2415 _set_Cond_jmp_pred(cond, pred);
2418 /** the get_type/get_type_attr operation must be always implemented */
2419 static ir_type *get_Null_type(ir_node *n) {
2423 /* Sets the get_type operation for an ir_op_ops. */
2424 ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops)
2427 case iro_Const: ops->get_type = get_Const_type; break;
2428 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2429 case iro_Cast: ops->get_type = get_Cast_type; break;
2430 case iro_Proj: ops->get_type = get_Proj_type; break;
2432 /* not allowed to be NULL */
2433 if (! ops->get_type)
2434 ops->get_type = get_Null_type;
2440 /** Return the attribute type of a SymConst node if exists */
2441 static ir_type *get_SymConst_attr_type(ir_node *self) {
2442 symconst_kind kind = get_SymConst_kind(self);
2443 if (kind == symconst_type_tag || kind == symconst_size)
2444 return get_SymConst_type(self);
2448 /** Return the attribute entity of a SymConst node if exists */
2449 static entity *get_SymConst_attr_entity(ir_node *self) {
2450 symconst_kind kind = get_SymConst_kind(self);
2451 if (kind == symconst_addr_ent)
2452 return get_SymConst_entity(self);
2456 /* Sets the get_type operation for an ir_op_ops. */
2457 ir_op_ops *firm_set_default_get_type_attr(opcode code, ir_op_ops *ops)
2460 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2461 case iro_Call: ops->get_type_attr = get_Call_type; break;
2462 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2463 case iro_Free: ops->get_type_attr = get_Free_type; break;
2464 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2466 /* not allowed to be NULL */
2467 if (! ops->get_type_attr)
2468 ops->get_type_attr = get_Null_type;
2474 /** the get_entity_attr operation must be always implemented */
2475 static entity *get_Null_ent(ir_node *n) {
2479 /* Sets the get_type operation for an ir_op_ops. */
2480 ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops)
2483 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2484 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2486 /* not allowed to be NULL */
2487 if (! ops->get_entity_attr)
2488 ops->get_entity_attr = get_Null_ent;
2494 #ifdef DEBUG_libfirm
2495 void dump_irn (ir_node *n) {
2496 int i, arity = get_irn_arity(n);
2497 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2499 ir_node *pred = get_irn_n(n, -1);
2500 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2501 get_irn_node_nr(pred), (void *)pred);
2503 printf(" preds: \n");
2504 for (i = 0; i < arity; ++i) {
2505 ir_node *pred = get_irn_n(n, i);
2506 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2507 get_irn_node_nr(pred), (void *)pred);
2511 #else /* DEBUG_libfirm */
2512 void dump_irn (ir_node *n) {}
2513 #endif /* DEBUG_libfirm */