2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of an intermediate operation.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
36 #include "irgraph_t.h"
38 #include "irbackedge_t.h"
42 #include "iredgekinds.h"
43 #include "iredges_t.h"
48 /* some constants fixing the positions of nodes predecessors
50 #define CALL_PARAM_OFFSET 2
51 #define FUNCCALL_PARAM_OFFSET 1
52 #define SEL_INDEX_OFFSET 2
53 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
54 #define END_KEEPALIVE_OFFSET 0
56 static const char *pnc_name_arr [] = {
57 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
58 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
59 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
60 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
64 * returns the pnc name from an pnc constant
66 const char *get_pnc_string(int pnc) {
67 assert(pnc >= 0 && pnc <
68 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
69 return pnc_name_arr[pnc];
73 * Calculates the negated (Complement(R)) pnc condition.
75 int get_negated_pnc(int pnc, ir_mode *mode) {
78 /* do NOT add the Uo bit for non-floating point values */
79 if (! mode_is_float(mode))
85 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
87 get_inversed_pnc(int pnc) {
88 int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
89 int lesser = pnc & pn_Cmp_Lt;
90 int greater = pnc & pn_Cmp_Gt;
92 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
98 * Indicates, whether additional data can be registered to ir nodes.
99 * If set to 1, this is not possible anymore.
101 static int forbid_new_data = 0;
104 * The amount of additional space for custom data to be allocated upon
105 * creating a new node.
107 unsigned firm_add_node_size = 0;
110 /* register new space for every node */
111 unsigned firm_register_additional_node_data(unsigned size) {
112 assert(!forbid_new_data && "Too late to register additional node data");
117 return firm_add_node_size += size;
123 /* Forbid the addition of new data to an ir node. */
128 * irnode constructor.
129 * Create a new irnode in irg, with an op, mode, arity and
130 * some incoming irnodes.
131 * If arity is negative, a node with a dynamic array is created.
134 new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
135 int arity, ir_node **in)
138 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
142 assert(irg && op && mode);
143 p = obstack_alloc(irg->obst, node_size);
144 memset(p, 0, node_size);
145 res = (ir_node *)(p + firm_add_node_size);
147 res->kind = k_ir_node;
151 res->node_idx = irg_register_node_idx(irg, res);
156 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
158 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
159 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
163 set_irn_dbg_info(res, db);
167 res->node_nr = get_irp_new_node_nr();
170 for (i = 0; i < EDGE_KIND_LAST; ++i)
171 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
173 /* don't put this into the for loop, arity is -1 for some nodes! */
174 edges_notify_edge(res, -1, res->in[0], NULL, irg);
175 for (i = 1; i <= arity; ++i)
176 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
178 hook_new_node(irg, res);
183 /*-- getting some parameters from ir_nodes --*/
186 (is_ir_node)(const void *thing) {
187 return _is_ir_node(thing);
191 (get_irn_intra_arity)(const ir_node *node) {
192 return _get_irn_intra_arity(node);
196 (get_irn_inter_arity)(const ir_node *node) {
197 return _get_irn_inter_arity(node);
200 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
203 (get_irn_arity)(const ir_node *node) {
204 return _get_irn_arity(node);
207 /* Returns the array with ins. This array is shifted with respect to the
208 array accessed by get_irn_n: The block operand is at position 0 not -1.
209 (@@@ This should be changed.)
210 The order of the predecessors in this array is not guaranteed, except that
211 lists of operands as predecessors of Block or arguments of a Call are
214 get_irn_in(const ir_node *node) {
216 if (get_interprocedural_view()) { /* handle Filter and Block specially */
217 if (get_irn_opcode(node) == iro_Filter) {
218 assert(node->attr.filter.in_cg);
219 return node->attr.filter.in_cg;
220 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
221 return node->attr.block.in_cg;
223 /* else fall through */
229 set_irn_in(ir_node *node, int arity, ir_node **in) {
232 ir_graph *irg = current_ir_graph;
234 if (get_interprocedural_view()) { /* handle Filter and Block specially */
235 if (get_irn_opcode(node) == iro_Filter) {
236 assert(node->attr.filter.in_cg);
237 arr = &node->attr.filter.in_cg;
238 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
239 arr = &node->attr.block.in_cg;
247 for (i = 0; i < arity; i++) {
248 if (i < ARR_LEN(*arr)-1)
249 edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
251 edges_notify_edge(node, i, in[i], NULL, irg);
253 for(;i < ARR_LEN(*arr)-1; i++) {
254 edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
257 if (arity != ARR_LEN(*arr) - 1) {
258 ir_node * block = (*arr)[0];
259 *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
262 fix_backedges(irg->obst, node);
264 memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
268 (get_irn_intra_n)(const ir_node *node, int n) {
269 return _get_irn_intra_n (node, n);
273 (get_irn_inter_n)(const ir_node *node, int n) {
274 return _get_irn_inter_n (node, n);
277 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
280 (get_irn_n)(const ir_node *node, int n) {
281 return _get_irn_n(node, n);
285 set_irn_n (ir_node *node, int n, ir_node *in) {
286 assert(node && node->kind == k_ir_node);
288 assert(n < get_irn_arity(node));
289 assert(in && in->kind == k_ir_node);
291 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
292 /* Change block pred in both views! */
293 node->in[n + 1] = in;
294 assert(node->attr.filter.in_cg);
295 node->attr.filter.in_cg[n + 1] = in;
298 if (get_interprocedural_view()) { /* handle Filter and Block specially */
299 if (get_irn_opcode(node) == iro_Filter) {
300 assert(node->attr.filter.in_cg);
301 node->attr.filter.in_cg[n + 1] = in;
303 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
304 node->attr.block.in_cg[n + 1] = in;
307 /* else fall through */
311 hook_set_irn_n(node, n, in, node->in[n + 1]);
313 /* Here, we rely on src and tgt being in the current ir graph */
314 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
316 node->in[n + 1] = in;
319 int add_irn_n(ir_node *node, ir_node *in)
322 ir_graph *irg = get_irn_irg(node);
324 assert(node->op->opar == oparity_dynamic);
325 pos = ARR_LEN(node->in) - 1;
326 ARR_APP1(ir_node *, node->in, in);
327 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
330 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
336 (get_irn_deps)(const ir_node *node)
338 return _get_irn_deps(node);
342 (get_irn_dep)(const ir_node *node, int pos)
344 return _get_irn_dep(node, pos);
348 (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
350 _set_irn_dep(node, pos, dep);
353 int add_irn_dep(ir_node *node, ir_node *dep)
357 if (node->deps == NULL) {
358 node->deps = NEW_ARR_F(ir_node *, 1);
364 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
365 if(node->deps[i] == NULL)
368 if(node->deps[i] == dep)
372 if (first_zero >= 0) {
373 node->deps[first_zero] = dep;
376 ARR_APP1(ir_node *, node->deps, dep);
381 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
386 void add_irn_deps(ir_node *tgt, ir_node *src) {
389 for (i = 0, n = get_irn_deps(src); i < n; ++i)
390 add_irn_dep(tgt, get_irn_dep(src, i));
395 (get_irn_mode)(const ir_node *node) {
396 return _get_irn_mode(node);
400 (set_irn_mode)(ir_node *node, ir_mode *mode) {
401 _set_irn_mode(node, mode);
405 get_irn_modecode(const ir_node *node) {
407 return node->mode->code;
410 /** Gets the string representation of the mode .*/
412 get_irn_modename(const ir_node *node) {
414 return get_mode_name(node->mode);
418 get_irn_modeident(const ir_node *node) {
420 return get_mode_ident(node->mode);
424 (get_irn_op)(const ir_node *node) {
425 return _get_irn_op(node);
428 /* should be private to the library: */
430 (set_irn_op)(ir_node *node, ir_op *op) {
431 _set_irn_op(node, op);
435 (get_irn_opcode)(const ir_node *node) {
436 return _get_irn_opcode(node);
440 get_irn_opname(const ir_node *node) {
442 if (is_Phi0(node)) return "Phi0";
443 return get_id_str(node->op->name);
447 get_irn_opident(const ir_node *node) {
449 return node->op->name;
453 (get_irn_visited)(const ir_node *node) {
454 return _get_irn_visited(node);
458 (set_irn_visited)(ir_node *node, unsigned long visited) {
459 _set_irn_visited(node, visited);
463 (mark_irn_visited)(ir_node *node) {
464 _mark_irn_visited(node);
468 (irn_not_visited)(const ir_node *node) {
469 return _irn_not_visited(node);
473 (irn_visited)(const ir_node *node) {
474 return _irn_visited(node);
478 (set_irn_link)(ir_node *node, void *link) {
479 _set_irn_link(node, link);
483 (get_irn_link)(const ir_node *node) {
484 return _get_irn_link(node);
488 (get_irn_pinned)(const ir_node *node) {
489 return _get_irn_pinned(node);
493 (is_irn_pinned_in_irg) (const ir_node *node) {
494 return _is_irn_pinned_in_irg(node);
497 void set_irn_pinned(ir_node *node, op_pin_state state) {
498 /* due to optimization an opt may be turned into a Tuple */
499 if (get_irn_op(node) == op_Tuple)
502 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
503 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
505 node->attr.except.pin_state = state;
508 #ifdef DO_HEAPANALYSIS
509 /* Access the abstract interpretation information of a node.
510 Returns NULL if no such information is available. */
511 struct abstval *get_irn_abst_value(ir_node *n) {
514 /* Set the abstract interpretation information of a node. */
515 void set_irn_abst_value(ir_node *n, struct abstval *os) {
518 struct section *firm_get_irn_section(ir_node *n) {
521 void firm_set_irn_section(ir_node *n, struct section *s) {
525 /* Dummies needed for firmjni. */
526 struct abstval *get_irn_abst_value(ir_node *n) {
530 void set_irn_abst_value(ir_node *n, struct abstval *os) {
534 struct section *firm_get_irn_section(ir_node *n) {
538 void firm_set_irn_section(ir_node *n, struct section *s) {
542 #endif /* DO_HEAPANALYSIS */
545 /* Outputs a unique number for this node */
546 long get_irn_node_nr(const ir_node *node) {
549 return node->node_nr;
551 return (long)PTR_TO_INT(node);
556 get_irn_const_attr(ir_node *node) {
557 assert(node->op == op_Const);
558 return &node->attr.con;
562 get_irn_proj_attr(ir_node *node) {
563 assert(node->op == op_Proj);
564 return node->attr.proj;
568 get_irn_alloc_attr(ir_node *node) {
569 assert(node->op == op_Alloc);
570 return &node->attr.alloc;
574 get_irn_free_attr(ir_node *node) {
575 assert(node->op == op_Free);
576 return &node->attr.free;
580 get_irn_symconst_attr(ir_node *node) {
581 assert(node->op == op_SymConst);
582 return &node->attr.symc;
586 get_irn_call_attr(ir_node *node) {
587 assert(node->op == op_Call);
588 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
592 get_irn_sel_attr(ir_node *node) {
593 assert(node->op == op_Sel);
594 return &node->attr.sel;
598 get_irn_phi0_attr(ir_node *node) {
599 assert(is_Phi0(node));
600 return node->attr.phi0.pos;
604 get_irn_block_attr(ir_node *node) {
605 assert(node->op == op_Block);
606 return &node->attr.block;
610 get_irn_load_attr(ir_node *node) {
611 assert(node->op == op_Load);
612 return &node->attr.load;
616 get_irn_store_attr(ir_node *node) {
617 assert(node->op == op_Store);
618 return &node->attr.store;
622 get_irn_except_attr(ir_node *node) {
623 assert(node->op == op_Div || node->op == op_Quot ||
624 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
625 return &node->attr.except;
628 void *(get_irn_generic_attr)(ir_node *node) {
629 assert(is_ir_node(node));
630 return _get_irn_generic_attr(node);
633 const void *(get_irn_generic_attr_const)(const ir_node *node) {
634 assert(is_ir_node(node));
635 return _get_irn_generic_attr_const(node);
638 unsigned (get_irn_idx)(const ir_node *node) {
639 assert(is_ir_node(node));
640 return _get_irn_idx(node);
643 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
645 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
646 if (get_irn_n(node, i) == arg)
652 /** manipulate fields of individual nodes **/
654 /* this works for all except Block */
656 get_nodes_block(const ir_node *node) {
657 assert(node->op != op_Block);
658 return get_irn_n(node, -1);
662 set_nodes_block(ir_node *node, ir_node *block) {
663 assert(node->op != op_Block);
664 set_irn_n(node, -1, block);
667 /* this works for all except Block */
669 get_nodes_MacroBlock(const ir_node *node) {
670 assert(node->op != op_Block);
671 return get_Block_MacroBlock(get_irn_n(node, -1));
674 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
675 * from Start. If so returns frame type, else Null. */
676 ir_type *is_frame_pointer(ir_node *n) {
677 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
678 ir_node *start = get_Proj_pred(n);
679 if (get_irn_op(start) == op_Start) {
680 return get_irg_frame_type(get_irn_irg(start));
686 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
687 * from Start. If so returns global type, else Null. */
688 ir_type *is_globals_pointer(ir_node *n) {
689 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
690 ir_node *start = get_Proj_pred(n);
691 if (get_irn_op(start) == op_Start) {
692 return get_glob_type();
698 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
699 * from Start. If so returns tls type, else Null. */
700 ir_type *is_tls_pointer(ir_node *n) {
701 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
702 ir_node *start = get_Proj_pred(n);
703 if (get_irn_op(start) == op_Start) {
704 return get_tls_type();
710 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
711 * from Start. If so returns 1, else 0. */
712 int is_value_arg_pointer(ir_node *n) {
713 if ((get_irn_op(n) == op_Proj) &&
714 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
715 (get_irn_op(get_Proj_pred(n)) == op_Start))
720 /* Returns an array with the predecessors of the Block. Depending on
721 the implementation of the graph data structure this can be a copy of
722 the internal representation of predecessors as well as the internal
723 array itself. Therefore writing to this array might obstruct the ir. */
725 get_Block_cfgpred_arr(ir_node *node) {
726 assert((node->op == op_Block));
727 return (ir_node **)&(get_irn_in(node)[1]);
731 (get_Block_n_cfgpreds)(const ir_node *node) {
732 return _get_Block_n_cfgpreds(node);
736 (get_Block_cfgpred)(ir_node *node, int pos) {
737 return _get_Block_cfgpred(node, pos);
741 set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
742 assert(node->op == op_Block);
743 set_irn_n(node, pos, pred);
747 (get_Block_cfgpred_block)(ir_node *node, int pos) {
748 return _get_Block_cfgpred_block(node, pos);
752 get_Block_matured(ir_node *node) {
753 assert(node->op == op_Block);
754 return (int)node->attr.block.is_matured;
758 set_Block_matured(ir_node *node, int matured) {
759 assert(node->op == op_Block);
760 node->attr.block.is_matured = matured;
764 (get_Block_block_visited)(const ir_node *node) {
765 return _get_Block_block_visited(node);
769 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
770 _set_Block_block_visited(node, visit);
773 /* For this current_ir_graph must be set. */
775 (mark_Block_block_visited)(ir_node *node) {
776 _mark_Block_block_visited(node);
780 (Block_not_block_visited)(const ir_node *node) {
781 return _Block_not_block_visited(node);
785 (Block_block_visited)(const ir_node *node) {
786 return _Block_block_visited(node);
790 get_Block_graph_arr (ir_node *node, int pos) {
791 assert(node->op == op_Block);
792 return node->attr.block.graph_arr[pos+1];
796 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
797 assert(node->op == op_Block);
798 node->attr.block.graph_arr[pos+1] = value;
801 #ifdef INTERPROCEDURAL_VIEW
802 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
803 assert(node->op == op_Block);
804 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
805 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
806 node->attr.block.in_cg[0] = NULL;
807 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
809 /* Fix backedge array. fix_backedges() operates depending on
810 interprocedural_view. */
811 int ipv = get_interprocedural_view();
812 set_interprocedural_view(1);
813 fix_backedges(current_ir_graph->obst, node);
814 set_interprocedural_view(ipv);
817 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
820 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
821 assert(node->op == op_Block &&
822 node->attr.block.in_cg &&
823 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
824 node->attr.block.in_cg[pos + 1] = pred;
827 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
828 assert(node->op == op_Block);
829 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
832 int get_Block_cg_n_cfgpreds(ir_node *node) {
833 assert(node->op == op_Block);
834 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
837 ir_node *get_Block_cg_cfgpred(ir_node *node, int pos) {
838 assert(node->op == op_Block && node->attr.block.in_cg);
839 return node->attr.block.in_cg[pos + 1];
842 void remove_Block_cg_cfgpred_arr(ir_node *node) {
843 assert(node->op == op_Block);
844 node->attr.block.in_cg = NULL;
848 ir_node *(set_Block_dead)(ir_node *block) {
849 return _set_Block_dead(block);
852 int (is_Block_dead)(const ir_node *block) {
853 return _is_Block_dead(block);
856 ir_extblk *get_Block_extbb(const ir_node *block) {
858 assert(is_Block(block));
859 res = block->attr.block.extblk;
860 assert(res == NULL || is_ir_extbb(res));
864 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
865 assert(is_Block(block));
866 assert(extblk == NULL || is_ir_extbb(extblk));
867 block->attr.block.extblk = extblk;
870 /* returns the macro block header of a block. */
871 ir_node *get_Block_MacroBlock(const ir_node *block) {
873 assert(is_Block(block));
874 mbh = get_irn_n(block, -1);
875 /* once macro block header is respected by all optimizations,
876 this assert can be removed */
881 /* returns the graph of a Block. */
882 ir_graph *get_Block_irg(const ir_node *block) {
883 assert(is_Block(block));
884 return block->attr.block.irg;
887 int has_Block_label(const ir_node *block) {
888 assert(is_Block(block));
889 return block->attr.block.has_label;
892 ir_label_t get_Block_label(const ir_node *block) {
893 assert(is_Block(block));
894 return block->attr.block.label;
897 void set_Block_label(ir_node *block, ir_label_t label) {
898 assert(is_Block(block));
899 block->attr.block.has_label = 1;
900 block->attr.block.label = label;
904 get_End_n_keepalives(ir_node *end) {
905 assert(end->op == op_End);
906 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
910 get_End_keepalive(ir_node *end, int pos) {
911 assert(end->op == op_End);
912 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
916 add_End_keepalive(ir_node *end, ir_node *ka) {
917 assert(end->op == op_End);
918 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
923 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
924 assert(end->op == op_End);
925 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
928 /* Set new keep-alives */
929 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
931 ir_graph *irg = get_irn_irg(end);
933 /* notify that edges are deleted */
934 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
935 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
937 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
939 for (i = 0; i < n; ++i) {
940 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
941 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
945 /* Set new keep-alives from old keep-alives, skipping irn */
946 void remove_End_keepalive(ir_node *end, ir_node *irn) {
947 int n = get_End_n_keepalives(end);
951 NEW_ARR_A(ir_node *, in, n);
953 for (idx = i = 0; i < n; ++i) {
954 ir_node *old_ka = get_End_keepalive(end, i);
961 /* set new keep-alives */
962 set_End_keepalives(end, idx, in);
966 free_End (ir_node *end) {
967 assert(end->op == op_End);
970 end->in = NULL; /* @@@ make sure we get an error if we use the
971 in array afterwards ... */
974 /* Return the target address of an IJmp */
975 ir_node *get_IJmp_target(ir_node *ijmp) {
976 assert(ijmp->op == op_IJmp);
977 return get_irn_n(ijmp, 0);
980 /** Sets the target address of an IJmp */
981 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
982 assert(ijmp->op == op_IJmp);
983 set_irn_n(ijmp, 0, tgt);
987 > Implementing the case construct (which is where the constant Proj node is
988 > important) involves far more than simply determining the constant values.
989 > We could argue that this is more properly a function of the translator from
990 > Firm to the target machine. That could be done if there was some way of
991 > projecting "default" out of the Cond node.
992 I know it's complicated.
993 Basically there are two proglems:
994 - determining the gaps between the projs
995 - determining the biggest case constant to know the proj number for
997 I see several solutions:
998 1. Introduce a ProjDefault node. Solves both problems.
999 This means to extend all optimizations executed during construction.
1000 2. Give the Cond node for switch two flavors:
1001 a) there are no gaps in the projs (existing flavor)
1002 b) gaps may exist, default proj is still the Proj with the largest
1003 projection number. This covers also the gaps.
1004 3. Fix the semantic of the Cond to that of 2b)
1006 Solution 2 seems to be the best:
1007 Computing the gaps in the Firm representation is not too hard, i.e.,
1008 libFIRM can implement a routine that transforms between the two
1009 flavours. This is also possible for 1) but 2) does not require to
1010 change any existing optimization.
1011 Further it should be far simpler to determine the biggest constant than
1012 to compute all gaps.
1013 I don't want to choose 3) as 2a) seems to have advantages for
1014 dataflow analysis and 3) does not allow to convert the representation to
1018 get_Cond_selector(ir_node *node) {
1019 assert(node->op == op_Cond);
1020 return get_irn_n(node, 0);
1024 set_Cond_selector(ir_node *node, ir_node *selector) {
1025 assert(node->op == op_Cond);
1026 set_irn_n(node, 0, selector);
1030 get_Cond_kind(ir_node *node) {
1031 assert(node->op == op_Cond);
1032 return node->attr.cond.kind;
1036 set_Cond_kind(ir_node *node, cond_kind kind) {
1037 assert(node->op == op_Cond);
1038 node->attr.cond.kind = kind;
1042 get_Cond_defaultProj(ir_node *node) {
1043 assert(node->op == op_Cond);
1044 return node->attr.cond.default_proj;
1048 get_Return_mem(ir_node *node) {
1049 assert(node->op == op_Return);
1050 return get_irn_n(node, 0);
1054 set_Return_mem(ir_node *node, ir_node *mem) {
1055 assert(node->op == op_Return);
1056 set_irn_n(node, 0, mem);
1060 get_Return_n_ress(ir_node *node) {
1061 assert(node->op == op_Return);
1062 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1066 get_Return_res_arr (ir_node *node) {
1067 assert((node->op == op_Return));
1068 if (get_Return_n_ress(node) > 0)
1069 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1076 set_Return_n_res(ir_node *node, int results) {
1077 assert(node->op == op_Return);
1082 get_Return_res(ir_node *node, int pos) {
1083 assert(node->op == op_Return);
1084 assert(get_Return_n_ress(node) > pos);
1085 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1089 set_Return_res(ir_node *node, int pos, ir_node *res){
1090 assert(node->op == op_Return);
1091 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1094 tarval *(get_Const_tarval)(const ir_node *node) {
1095 return _get_Const_tarval(node);
1099 set_Const_tarval(ir_node *node, tarval *con) {
1100 assert(node->op == op_Const);
1101 node->attr.con.tv = con;
1104 int (is_Const_null)(const ir_node *node) {
1105 return _is_Const_null(node);
1108 int (is_Const_one)(const ir_node *node) {
1109 return _is_Const_one(node);
1112 int (is_Const_all_one)(const ir_node *node) {
1113 return _is_Const_all_one(node);
1117 /* The source language type. Must be an atomic type. Mode of type must
1118 be mode of node. For tarvals from entities type must be pointer to
1121 get_Const_type(ir_node *node) {
1122 assert(node->op == op_Const);
1123 return node->attr.con.tp;
1127 set_Const_type(ir_node *node, ir_type *tp) {
1128 assert(node->op == op_Const);
1129 if (tp != firm_unknown_type) {
1130 assert(is_atomic_type(tp));
1131 assert(get_type_mode(tp) == get_irn_mode(node));
1133 node->attr.con.tp = tp;
1138 get_SymConst_kind(const ir_node *node) {
1139 assert(node->op == op_SymConst);
1140 return node->attr.symc.num;
1144 set_SymConst_kind(ir_node *node, symconst_kind num) {
1145 assert(node->op == op_SymConst);
1146 node->attr.symc.num = num;
1150 get_SymConst_type(ir_node *node) {
1151 assert((node->op == op_SymConst) &&
1152 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1153 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1157 set_SymConst_type(ir_node *node, ir_type *tp) {
1158 assert((node->op == op_SymConst) &&
1159 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1160 node->attr.symc.sym.type_p = tp;
1164 get_SymConst_name(const ir_node *node) {
1165 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1166 return node->attr.symc.sym.ident_p;
1170 set_SymConst_name(ir_node *node, ident *name) {
1171 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1172 node->attr.symc.sym.ident_p = name;
1176 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1177 ir_entity *get_SymConst_entity(const ir_node *node) {
1178 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1179 return node->attr.symc.sym.entity_p;
1182 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1183 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1184 node->attr.symc.sym.entity_p = ent;
1187 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1188 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1189 return node->attr.symc.sym.enum_p;
1192 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1193 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1194 node->attr.symc.sym.enum_p = ec;
1197 union symconst_symbol
1198 get_SymConst_symbol(const ir_node *node) {
1199 assert(node->op == op_SymConst);
1200 return node->attr.symc.sym;
1204 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1205 assert(node->op == op_SymConst);
1206 node->attr.symc.sym = sym;
1209 ir_label_t get_SymConst_label(const ir_node *node) {
1210 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1211 return node->attr.symc.sym.label;
1214 void set_SymConst_label(ir_node *node, ir_label_t label) {
1215 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1216 node->attr.symc.sym.label = label;
1220 get_SymConst_value_type(ir_node *node) {
1221 assert(node->op == op_SymConst);
1222 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1223 return node->attr.symc.tp;
1227 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1228 assert(node->op == op_SymConst);
1229 node->attr.symc.tp = tp;
1233 get_Sel_mem(ir_node *node) {
1234 assert(node->op == op_Sel);
1235 return get_irn_n(node, 0);
1239 set_Sel_mem(ir_node *node, ir_node *mem) {
1240 assert(node->op == op_Sel);
1241 set_irn_n(node, 0, mem);
1245 get_Sel_ptr(ir_node *node) {
1246 assert(node->op == op_Sel);
1247 return get_irn_n(node, 1);
1251 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1252 assert(node->op == op_Sel);
1253 set_irn_n(node, 1, ptr);
1257 get_Sel_n_indexs(ir_node *node) {
1258 assert(node->op == op_Sel);
1259 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1263 get_Sel_index_arr(ir_node *node) {
1264 assert((node->op == op_Sel));
1265 if (get_Sel_n_indexs(node) > 0)
1266 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1272 get_Sel_index(ir_node *node, int pos) {
1273 assert(node->op == op_Sel);
1274 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1278 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1279 assert(node->op == op_Sel);
1280 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1284 get_Sel_entity(ir_node *node) {
1285 assert(node->op == op_Sel);
1286 return node->attr.sel.ent;
1290 set_Sel_entity(ir_node *node, ir_entity *ent) {
1291 assert(node->op == op_Sel);
1292 node->attr.sel.ent = ent;
1296 /* For unary and binary arithmetic operations the access to the
1297 operands can be factored out. Left is the first, right the
1298 second arithmetic value as listed in tech report 0999-33.
1299 unops are: Minus, Abs, Not, Conv, Cast
1300 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1301 Shr, Shrs, Rotate, Cmp */
1305 get_Call_mem(ir_node *node) {
1306 assert(node->op == op_Call);
1307 return get_irn_n(node, 0);
1311 set_Call_mem(ir_node *node, ir_node *mem) {
1312 assert(node->op == op_Call);
1313 set_irn_n(node, 0, mem);
1317 get_Call_ptr(ir_node *node) {
1318 assert(node->op == op_Call);
1319 return get_irn_n(node, 1);
1323 set_Call_ptr(ir_node *node, ir_node *ptr) {
1324 assert(node->op == op_Call);
1325 set_irn_n(node, 1, ptr);
1329 get_Call_param_arr(ir_node *node) {
1330 assert(node->op == op_Call);
1331 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1335 get_Call_n_params(ir_node *node) {
1336 assert(node->op == op_Call);
1337 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1341 get_Call_arity(ir_node *node) {
1342 assert(node->op == op_Call);
1343 return get_Call_n_params(node);
1347 set_Call_arity(ir_node *node, ir_node *arity) {
1348 assert(node->op == op_Call);
1353 get_Call_param(ir_node *node, int pos) {
1354 assert(node->op == op_Call);
1355 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1359 set_Call_param(ir_node *node, int pos, ir_node *param) {
1360 assert(node->op == op_Call);
1361 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1365 get_Call_type(ir_node *node) {
1366 assert(node->op == op_Call);
1367 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1371 set_Call_type(ir_node *node, ir_type *tp) {
1372 assert(node->op == op_Call);
1373 assert((get_unknown_type() == tp) || is_Method_type(tp));
1374 node->attr.call.cld_tp = tp;
1377 int Call_has_callees(ir_node *node) {
1378 assert(node && node->op == op_Call);
1379 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1380 (node->attr.call.callee_arr != NULL));
1383 int get_Call_n_callees(ir_node * node) {
1384 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1385 return ARR_LEN(node->attr.call.callee_arr);
1388 ir_entity * get_Call_callee(ir_node * node, int pos) {
1389 assert(pos >= 0 && pos < get_Call_n_callees(node));
1390 return node->attr.call.callee_arr[pos];
1393 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1394 assert(node->op == op_Call);
1395 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1396 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1398 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1401 void remove_Call_callee_arr(ir_node * node) {
1402 assert(node->op == op_Call);
1403 node->attr.call.callee_arr = NULL;
1406 ir_node * get_CallBegin_ptr(ir_node *node) {
1407 assert(node->op == op_CallBegin);
1408 return get_irn_n(node, 0);
1411 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1412 assert(node->op == op_CallBegin);
1413 set_irn_n(node, 0, ptr);
1416 ir_node * get_CallBegin_call(ir_node *node) {
1417 assert(node->op == op_CallBegin);
1418 return node->attr.callbegin.call;
1421 void set_CallBegin_call(ir_node *node, ir_node *call) {
1422 assert(node->op == op_CallBegin);
1423 node->attr.callbegin.call = call;
1428 ir_node * get_##OP##_left(const ir_node *node) { \
1429 assert(node->op == op_##OP); \
1430 return get_irn_n(node, node->op->op_index); \
1432 void set_##OP##_left(ir_node *node, ir_node *left) { \
1433 assert(node->op == op_##OP); \
1434 set_irn_n(node, node->op->op_index, left); \
1436 ir_node *get_##OP##_right(const ir_node *node) { \
1437 assert(node->op == op_##OP); \
1438 return get_irn_n(node, node->op->op_index + 1); \
1440 void set_##OP##_right(ir_node *node, ir_node *right) { \
1441 assert(node->op == op_##OP); \
1442 set_irn_n(node, node->op->op_index + 1, right); \
1446 ir_node *get_##OP##_op(const ir_node *node) { \
1447 assert(node->op == op_##OP); \
1448 return get_irn_n(node, node->op->op_index); \
1450 void set_##OP##_op (ir_node *node, ir_node *op) { \
1451 assert(node->op == op_##OP); \
1452 set_irn_n(node, node->op->op_index, op); \
1455 #define BINOP_MEM(OP) \
1459 get_##OP##_mem(ir_node *node) { \
1460 assert(node->op == op_##OP); \
1461 return get_irn_n(node, 0); \
1465 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1466 assert(node->op == op_##OP); \
1467 set_irn_n(node, 0, mem); \
1473 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1474 assert(node->op == op_##OP); \
1475 return node->attr.divmod.res_mode; \
1478 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1479 assert(node->op == op_##OP); \
1480 node->attr.divmod.res_mode = mode; \
1506 int get_Conv_strict(ir_node *node) {
1507 assert(node->op == op_Conv);
1508 return node->attr.conv.strict;
1511 void set_Conv_strict(ir_node *node, int strict_flag) {
1512 assert(node->op == op_Conv);
1513 node->attr.conv.strict = (char)strict_flag;
1517 get_Cast_type(ir_node *node) {
1518 assert(node->op == op_Cast);
1519 return node->attr.cast.totype;
1523 set_Cast_type(ir_node *node, ir_type *to_tp) {
1524 assert(node->op == op_Cast);
1525 node->attr.cast.totype = to_tp;
1529 /* Checks for upcast.
1531 * Returns true if the Cast node casts a class type to a super type.
1533 int is_Cast_upcast(ir_node *node) {
1534 ir_type *totype = get_Cast_type(node);
1535 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1536 ir_graph *myirg = get_irn_irg(node);
1538 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1541 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1542 totype = get_pointer_points_to_type(totype);
1543 fromtype = get_pointer_points_to_type(fromtype);
1548 if (!is_Class_type(totype)) return 0;
1549 return is_SubClass_of(fromtype, totype);
1552 /* Checks for downcast.
1554 * Returns true if the Cast node casts a class type to a sub type.
1556 int is_Cast_downcast(ir_node *node) {
1557 ir_type *totype = get_Cast_type(node);
1558 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1560 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1563 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1564 totype = get_pointer_points_to_type(totype);
1565 fromtype = get_pointer_points_to_type(fromtype);
1570 if (!is_Class_type(totype)) return 0;
1571 return is_SubClass_of(totype, fromtype);
1575 (is_unop)(const ir_node *node) {
1576 return _is_unop(node);
1580 get_unop_op(const ir_node *node) {
1581 if (node->op->opar == oparity_unary)
1582 return get_irn_n(node, node->op->op_index);
1584 assert(node->op->opar == oparity_unary);
1589 set_unop_op(ir_node *node, ir_node *op) {
1590 if (node->op->opar == oparity_unary)
1591 set_irn_n(node, node->op->op_index, op);
1593 assert(node->op->opar == oparity_unary);
1597 (is_binop)(const ir_node *node) {
1598 return _is_binop(node);
1602 get_binop_left(const ir_node *node) {
1603 assert(node->op->opar == oparity_binary);
1604 return get_irn_n(node, node->op->op_index);
1608 set_binop_left(ir_node *node, ir_node *left) {
1609 assert(node->op->opar == oparity_binary);
1610 set_irn_n(node, node->op->op_index, left);
1614 get_binop_right(const ir_node *node) {
1615 assert(node->op->opar == oparity_binary);
1616 return get_irn_n(node, node->op->op_index + 1);
1620 set_binop_right(ir_node *node, ir_node *right) {
1621 assert(node->op->opar == oparity_binary);
1622 set_irn_n(node, node->op->op_index + 1, right);
1625 int is_Phi(const ir_node *n) {
1631 if (op == op_Filter) return get_interprocedural_view();
1634 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1635 (get_irn_arity(n) > 0));
1640 int is_Phi0(const ir_node *n) {
1643 return ((get_irn_op(n) == op_Phi) &&
1644 (get_irn_arity(n) == 0) &&
1645 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1649 get_Phi_preds_arr(ir_node *node) {
1650 assert(node->op == op_Phi);
1651 return (ir_node **)&(get_irn_in(node)[1]);
1655 get_Phi_n_preds(const ir_node *node) {
1656 assert(is_Phi(node) || is_Phi0(node));
1657 return (get_irn_arity(node));
1661 void set_Phi_n_preds(ir_node *node, int n_preds) {
1662 assert(node->op == op_Phi);
1667 get_Phi_pred(const ir_node *node, int pos) {
1668 assert(is_Phi(node) || is_Phi0(node));
1669 return get_irn_n(node, pos);
1673 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1674 assert(is_Phi(node) || is_Phi0(node));
1675 set_irn_n(node, pos, pred);
1679 int is_memop(ir_node *node) {
1680 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1683 ir_node *get_memop_mem(ir_node *node) {
1684 assert(is_memop(node));
1685 return get_irn_n(node, 0);
1688 void set_memop_mem(ir_node *node, ir_node *mem) {
1689 assert(is_memop(node));
1690 set_irn_n(node, 0, mem);
1693 ir_node *get_memop_ptr(ir_node *node) {
1694 assert(is_memop(node));
1695 return get_irn_n(node, 1);
1698 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1699 assert(is_memop(node));
1700 set_irn_n(node, 1, ptr);
1704 get_Load_mem(ir_node *node) {
1705 assert(node->op == op_Load);
1706 return get_irn_n(node, 0);
1710 set_Load_mem(ir_node *node, ir_node *mem) {
1711 assert(node->op == op_Load);
1712 set_irn_n(node, 0, mem);
1716 get_Load_ptr(ir_node *node) {
1717 assert(node->op == op_Load);
1718 return get_irn_n(node, 1);
1722 set_Load_ptr(ir_node *node, ir_node *ptr) {
1723 assert(node->op == op_Load);
1724 set_irn_n(node, 1, ptr);
1728 get_Load_mode(ir_node *node) {
1729 assert(node->op == op_Load);
1730 return node->attr.load.load_mode;
1734 set_Load_mode(ir_node *node, ir_mode *mode) {
1735 assert(node->op == op_Load);
1736 node->attr.load.load_mode = mode;
1740 get_Load_volatility(ir_node *node) {
1741 assert(node->op == op_Load);
1742 return node->attr.load.volatility;
1746 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1747 assert(node->op == op_Load);
1748 node->attr.load.volatility = volatility;
1752 get_Load_align(ir_node *node) {
1753 assert(node->op == op_Load);
1754 return node->attr.load.aligned;
1758 set_Load_align(ir_node *node, ir_align align) {
1759 assert(node->op == op_Load);
1760 node->attr.load.aligned = align;
1765 get_Store_mem(ir_node *node) {
1766 assert(node->op == op_Store);
1767 return get_irn_n(node, 0);
1771 set_Store_mem(ir_node *node, ir_node *mem) {
1772 assert(node->op == op_Store);
1773 set_irn_n(node, 0, mem);
1777 get_Store_ptr(ir_node *node) {
1778 assert(node->op == op_Store);
1779 return get_irn_n(node, 1);
1783 set_Store_ptr(ir_node *node, ir_node *ptr) {
1784 assert(node->op == op_Store);
1785 set_irn_n(node, 1, ptr);
1789 get_Store_value(ir_node *node) {
1790 assert(node->op == op_Store);
1791 return get_irn_n(node, 2);
1795 set_Store_value(ir_node *node, ir_node *value) {
1796 assert(node->op == op_Store);
1797 set_irn_n(node, 2, value);
1801 get_Store_volatility(ir_node *node) {
1802 assert(node->op == op_Store);
1803 return node->attr.store.volatility;
1807 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1808 assert(node->op == op_Store);
1809 node->attr.store.volatility = volatility;
1813 get_Store_align(ir_node *node) {
1814 assert(node->op == op_Store);
1815 return node->attr.store.aligned;
1819 set_Store_align(ir_node *node, ir_align align) {
1820 assert(node->op == op_Store);
1821 node->attr.store.aligned = align;
1826 get_Alloc_mem(ir_node *node) {
1827 assert(node->op == op_Alloc);
1828 return get_irn_n(node, 0);
1832 set_Alloc_mem(ir_node *node, ir_node *mem) {
1833 assert(node->op == op_Alloc);
1834 set_irn_n(node, 0, mem);
1838 get_Alloc_size(ir_node *node) {
1839 assert(node->op == op_Alloc);
1840 return get_irn_n(node, 1);
1844 set_Alloc_size(ir_node *node, ir_node *size) {
1845 assert(node->op == op_Alloc);
1846 set_irn_n(node, 1, size);
1850 get_Alloc_type(ir_node *node) {
1851 assert(node->op == op_Alloc);
1852 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1856 set_Alloc_type(ir_node *node, ir_type *tp) {
1857 assert(node->op == op_Alloc);
1858 node->attr.alloc.type = tp;
1862 get_Alloc_where(ir_node *node) {
1863 assert(node->op == op_Alloc);
1864 return node->attr.alloc.where;
1868 set_Alloc_where(ir_node *node, where_alloc where) {
1869 assert(node->op == op_Alloc);
1870 node->attr.alloc.where = where;
1875 get_Free_mem(ir_node *node) {
1876 assert(node->op == op_Free);
1877 return get_irn_n(node, 0);
1881 set_Free_mem(ir_node *node, ir_node *mem) {
1882 assert(node->op == op_Free);
1883 set_irn_n(node, 0, mem);
1887 get_Free_ptr(ir_node *node) {
1888 assert(node->op == op_Free);
1889 return get_irn_n(node, 1);
1893 set_Free_ptr(ir_node *node, ir_node *ptr) {
1894 assert(node->op == op_Free);
1895 set_irn_n(node, 1, ptr);
1899 get_Free_size(ir_node *node) {
1900 assert(node->op == op_Free);
1901 return get_irn_n(node, 2);
1905 set_Free_size(ir_node *node, ir_node *size) {
1906 assert(node->op == op_Free);
1907 set_irn_n(node, 2, size);
1911 get_Free_type(ir_node *node) {
1912 assert(node->op == op_Free);
1913 return node->attr.free.type = skip_tid(node->attr.free.type);
1917 set_Free_type(ir_node *node, ir_type *tp) {
1918 assert(node->op == op_Free);
1919 node->attr.free.type = tp;
1923 get_Free_where(ir_node *node) {
1924 assert(node->op == op_Free);
1925 return node->attr.free.where;
1929 set_Free_where(ir_node *node, where_alloc where) {
1930 assert(node->op == op_Free);
1931 node->attr.free.where = where;
1934 ir_node **get_Sync_preds_arr(ir_node *node) {
1935 assert(node->op == op_Sync);
1936 return (ir_node **)&(get_irn_in(node)[1]);
1939 int get_Sync_n_preds(ir_node *node) {
1940 assert(node->op == op_Sync);
1941 return (get_irn_arity(node));
1945 void set_Sync_n_preds(ir_node *node, int n_preds) {
1946 assert(node->op == op_Sync);
1950 ir_node *get_Sync_pred(ir_node *node, int pos) {
1951 assert(node->op == op_Sync);
1952 return get_irn_n(node, pos);
1955 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1956 assert(node->op == op_Sync);
1957 set_irn_n(node, pos, pred);
1960 /* Add a new Sync predecessor */
1961 void add_Sync_pred(ir_node *node, ir_node *pred) {
1962 assert(node->op == op_Sync);
1963 add_irn_n(node, pred);
1966 /* Returns the source language type of a Proj node. */
1967 ir_type *get_Proj_type(ir_node *n) {
1968 ir_type *tp = firm_unknown_type;
1969 ir_node *pred = get_Proj_pred(n);
1971 switch (get_irn_opcode(pred)) {
1974 /* Deal with Start / Call here: we need to know the Proj Nr. */
1975 assert(get_irn_mode(pred) == mode_T);
1976 pred_pred = get_Proj_pred(pred);
1977 if (get_irn_op(pred_pred) == op_Start) {
1978 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1979 tp = get_method_param_type(mtp, get_Proj_proj(n));
1980 } else if (get_irn_op(pred_pred) == op_Call) {
1981 ir_type *mtp = get_Call_type(pred_pred);
1982 tp = get_method_res_type(mtp, get_Proj_proj(n));
1985 case iro_Start: break;
1986 case iro_Call: break;
1988 ir_node *a = get_Load_ptr(pred);
1990 tp = get_entity_type(get_Sel_entity(a));
1999 get_Proj_pred(const ir_node *node) {
2000 assert(is_Proj(node));
2001 return get_irn_n(node, 0);
2005 set_Proj_pred(ir_node *node, ir_node *pred) {
2006 assert(is_Proj(node));
2007 set_irn_n(node, 0, pred);
2011 get_Proj_proj(const ir_node *node) {
2012 assert(is_Proj(node));
2013 if (get_irn_opcode(node) == iro_Proj) {
2014 return node->attr.proj;
2016 assert(get_irn_opcode(node) == iro_Filter);
2017 return node->attr.filter.proj;
2022 set_Proj_proj(ir_node *node, long proj) {
2023 assert(node->op == op_Proj);
2024 node->attr.proj = proj;
2028 get_Tuple_preds_arr(ir_node *node) {
2029 assert(node->op == op_Tuple);
2030 return (ir_node **)&(get_irn_in(node)[1]);
2034 get_Tuple_n_preds(ir_node *node) {
2035 assert(node->op == op_Tuple);
2036 return (get_irn_arity(node));
2041 set_Tuple_n_preds(ir_node *node, int n_preds) {
2042 assert(node->op == op_Tuple);
2047 get_Tuple_pred (ir_node *node, int pos) {
2048 assert(node->op == op_Tuple);
2049 return get_irn_n(node, pos);
2053 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2054 assert(node->op == op_Tuple);
2055 set_irn_n(node, pos, pred);
2059 get_Id_pred(ir_node *node) {
2060 assert(node->op == op_Id);
2061 return get_irn_n(node, 0);
2065 set_Id_pred(ir_node *node, ir_node *pred) {
2066 assert(node->op == op_Id);
2067 set_irn_n(node, 0, pred);
2070 ir_node *get_Confirm_value(ir_node *node) {
2071 assert(node->op == op_Confirm);
2072 return get_irn_n(node, 0);
2075 void set_Confirm_value(ir_node *node, ir_node *value) {
2076 assert(node->op == op_Confirm);
2077 set_irn_n(node, 0, value);
2080 ir_node *get_Confirm_bound(ir_node *node) {
2081 assert(node->op == op_Confirm);
2082 return get_irn_n(node, 1);
2085 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2086 assert(node->op == op_Confirm);
2087 set_irn_n(node, 0, bound);
2090 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2091 assert(node->op == op_Confirm);
2092 return node->attr.confirm.cmp;
2095 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2096 assert(node->op == op_Confirm);
2097 node->attr.confirm.cmp = cmp;
2101 get_Filter_pred(ir_node *node) {
2102 assert(node->op == op_Filter);
2107 set_Filter_pred(ir_node *node, ir_node *pred) {
2108 assert(node->op == op_Filter);
2113 get_Filter_proj(ir_node *node) {
2114 assert(node->op == op_Filter);
2115 return node->attr.filter.proj;
2119 set_Filter_proj(ir_node *node, long proj) {
2120 assert(node->op == op_Filter);
2121 node->attr.filter.proj = proj;
2124 /* Don't use get_irn_arity, get_irn_n in implementation as access
2125 shall work independent of view!!! */
2126 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2127 assert(node->op == op_Filter);
2128 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2129 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2130 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2131 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2132 node->attr.filter.in_cg[0] = node->in[0];
2134 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2137 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2138 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2139 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2140 node->attr.filter.in_cg[pos + 1] = pred;
2143 int get_Filter_n_cg_preds(ir_node *node) {
2144 assert(node->op == op_Filter && node->attr.filter.in_cg);
2145 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2148 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2150 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2152 arity = ARR_LEN(node->attr.filter.in_cg);
2153 assert(pos < arity - 1);
2154 return node->attr.filter.in_cg[pos + 1];
2158 ir_node *get_Mux_sel(ir_node *node) {
2159 if (node->op == op_Psi) {
2160 assert(get_irn_arity(node) == 3);
2161 return get_Psi_cond(node, 0);
2163 assert(node->op == op_Mux);
2167 void set_Mux_sel(ir_node *node, ir_node *sel) {
2168 if (node->op == op_Psi) {
2169 assert(get_irn_arity(node) == 3);
2170 set_Psi_cond(node, 0, sel);
2172 assert(node->op == op_Mux);
2177 ir_node *get_Mux_false(ir_node *node) {
2178 if (node->op == op_Psi) {
2179 assert(get_irn_arity(node) == 3);
2180 return get_Psi_default(node);
2182 assert(node->op == op_Mux);
2186 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2187 if (node->op == op_Psi) {
2188 assert(get_irn_arity(node) == 3);
2189 set_Psi_default(node, ir_false);
2191 assert(node->op == op_Mux);
2192 node->in[2] = ir_false;
2196 ir_node *get_Mux_true(ir_node *node) {
2197 if (node->op == op_Psi) {
2198 assert(get_irn_arity(node) == 3);
2199 return get_Psi_val(node, 0);
2201 assert(node->op == op_Mux);
2205 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2206 if (node->op == op_Psi) {
2207 assert(get_irn_arity(node) == 3);
2208 set_Psi_val(node, 0, ir_true);
2210 assert(node->op == op_Mux);
2211 node->in[3] = ir_true;
2216 ir_node *get_Psi_cond(ir_node *node, int pos) {
2217 int num_conds = get_Psi_n_conds(node);
2218 assert(node->op == op_Psi);
2219 assert(pos < num_conds);
2220 return get_irn_n(node, 2 * pos);
2223 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2224 int num_conds = get_Psi_n_conds(node);
2225 assert(node->op == op_Psi);
2226 assert(pos < num_conds);
2227 set_irn_n(node, 2 * pos, cond);
2230 ir_node *get_Psi_val(ir_node *node, int pos) {
2231 int num_vals = get_Psi_n_conds(node);
2232 assert(node->op == op_Psi);
2233 assert(pos < num_vals);
2234 return get_irn_n(node, 2 * pos + 1);
2237 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2238 int num_vals = get_Psi_n_conds(node);
2239 assert(node->op == op_Psi);
2240 assert(pos < num_vals);
2241 set_irn_n(node, 2 * pos + 1, val);
2244 ir_node *get_Psi_default(ir_node *node) {
2245 int def_pos = get_irn_arity(node) - 1;
2246 assert(node->op == op_Psi);
2247 return get_irn_n(node, def_pos);
2250 void set_Psi_default(ir_node *node, ir_node *val) {
2251 int def_pos = get_irn_arity(node);
2252 assert(node->op == op_Psi);
2253 set_irn_n(node, def_pos, val);
2256 int (get_Psi_n_conds)(ir_node *node) {
2257 return _get_Psi_n_conds(node);
2261 ir_node *get_CopyB_mem(ir_node *node) {
2262 assert(node->op == op_CopyB);
2263 return get_irn_n(node, 0);
2266 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2267 assert(node->op == op_CopyB);
2268 set_irn_n(node, 0, mem);
2271 ir_node *get_CopyB_dst(ir_node *node) {
2272 assert(node->op == op_CopyB);
2273 return get_irn_n(node, 1);
2276 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2277 assert(node->op == op_CopyB);
2278 set_irn_n(node, 1, dst);
2281 ir_node *get_CopyB_src (ir_node *node) {
2282 assert(node->op == op_CopyB);
2283 return get_irn_n(node, 2);
2286 void set_CopyB_src(ir_node *node, ir_node *src) {
2287 assert(node->op == op_CopyB);
2288 set_irn_n(node, 2, src);
2291 ir_type *get_CopyB_type(ir_node *node) {
2292 assert(node->op == op_CopyB);
2293 return node->attr.copyb.data_type;
2296 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2297 assert(node->op == op_CopyB && data_type);
2298 node->attr.copyb.data_type = data_type;
2303 get_InstOf_type(ir_node *node) {
2304 assert(node->op = op_InstOf);
2305 return node->attr.instof.type;
2309 set_InstOf_type(ir_node *node, ir_type *type) {
2310 assert(node->op = op_InstOf);
2311 node->attr.instof.type = type;
2315 get_InstOf_store(ir_node *node) {
2316 assert(node->op = op_InstOf);
2317 return get_irn_n(node, 0);
2321 set_InstOf_store(ir_node *node, ir_node *obj) {
2322 assert(node->op = op_InstOf);
2323 set_irn_n(node, 0, obj);
2327 get_InstOf_obj(ir_node *node) {
2328 assert(node->op = op_InstOf);
2329 return get_irn_n(node, 1);
2333 set_InstOf_obj(ir_node *node, ir_node *obj) {
2334 assert(node->op = op_InstOf);
2335 set_irn_n(node, 1, obj);
2338 /* Returns the memory input of a Raise operation. */
2340 get_Raise_mem(ir_node *node) {
2341 assert(node->op == op_Raise);
2342 return get_irn_n(node, 0);
2346 set_Raise_mem(ir_node *node, ir_node *mem) {
2347 assert(node->op == op_Raise);
2348 set_irn_n(node, 0, mem);
2352 get_Raise_exo_ptr(ir_node *node) {
2353 assert(node->op == op_Raise);
2354 return get_irn_n(node, 1);
2358 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2359 assert(node->op == op_Raise);
2360 set_irn_n(node, 1, exo_ptr);
2365 /* Returns the memory input of a Bound operation. */
2366 ir_node *get_Bound_mem(ir_node *bound) {
2367 assert(bound->op == op_Bound);
2368 return get_irn_n(bound, 0);
2371 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2372 assert(bound->op == op_Bound);
2373 set_irn_n(bound, 0, mem);
2376 /* Returns the index input of a Bound operation. */
2377 ir_node *get_Bound_index(ir_node *bound) {
2378 assert(bound->op == op_Bound);
2379 return get_irn_n(bound, 1);
2382 void set_Bound_index(ir_node *bound, ir_node *idx) {
2383 assert(bound->op == op_Bound);
2384 set_irn_n(bound, 1, idx);
2387 /* Returns the lower bound input of a Bound operation. */
2388 ir_node *get_Bound_lower(ir_node *bound) {
2389 assert(bound->op == op_Bound);
2390 return get_irn_n(bound, 2);
2393 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2394 assert(bound->op == op_Bound);
2395 set_irn_n(bound, 2, lower);
2398 /* Returns the upper bound input of a Bound operation. */
2399 ir_node *get_Bound_upper(ir_node *bound) {
2400 assert(bound->op == op_Bound);
2401 return get_irn_n(bound, 3);
2404 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2405 assert(bound->op == op_Bound);
2406 set_irn_n(bound, 3, upper);
2409 /* Return the operand of a Pin node. */
2410 ir_node *get_Pin_op(const ir_node *pin) {
2411 assert(pin->op == op_Pin);
2412 return get_irn_n(pin, 0);
2415 void set_Pin_op(ir_node *pin, ir_node *node) {
2416 assert(pin->op == op_Pin);
2417 set_irn_n(pin, 0, node);
2420 /* Return the assembler text of an ASM pseudo node. */
2421 ident *get_ASM_text(const ir_node *node) {
2422 assert(node->op == op_ASM);
2423 return node->attr.assem.asm_text;
2426 /* Return the number of input constraints for an ASM node. */
2427 int get_ASM_n_input_constraints(const ir_node *node) {
2428 assert(node->op == op_ASM);
2429 return ARR_LEN(node->attr.assem.inputs);
2432 /* Return the input constraints for an ASM node. This is a flexible array. */
2433 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2434 assert(node->op == op_ASM);
2435 return node->attr.assem.inputs;
2438 /* Return the number of output constraints for an ASM node. */
2439 int get_ASM_n_output_constraints(const ir_node *node) {
2440 assert(node->op == op_ASM);
2441 return ARR_LEN(node->attr.assem.outputs);
2444 /* Return the output constraints for an ASM node. */
2445 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2446 assert(node->op == op_ASM);
2447 return node->attr.assem.outputs;
2450 /* Return the number of clobbered registers for an ASM node. */
2451 int get_ASM_n_clobbers(const ir_node *node) {
2452 assert(node->op == op_ASM);
2453 return ARR_LEN(node->attr.assem.clobber);
2456 /* Return the list of clobbered registers for an ASM node. */
2457 ident **get_ASM_clobbers(const ir_node *node) {
2458 assert(node->op == op_ASM);
2459 return node->attr.assem.clobber;
2462 /* returns the graph of a node */
2464 get_irn_irg(const ir_node *node) {
2466 * Do not use get_nodes_Block() here, because this
2467 * will check the pinned state.
2468 * However even a 'wrong' block is always in the proper
2471 if (! is_Block(node))
2472 node = get_irn_n(node, -1);
2473 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2474 node = get_irn_n(node, -1);
2475 assert(get_irn_op(node) == op_Block);
2476 return node->attr.block.irg;
2480 /*----------------------------------------------------------------*/
2481 /* Auxiliary routines */
2482 /*----------------------------------------------------------------*/
2485 skip_Proj(ir_node *node) {
2486 /* don't assert node !!! */
2491 node = get_Proj_pred(node);
2497 skip_Proj_const(const ir_node *node) {
2498 /* don't assert node !!! */
2503 node = get_Proj_pred(node);
2509 skip_Tuple(ir_node *node) {
2513 if (!get_opt_normalize()) return node;
2516 if (get_irn_op(node) == op_Proj) {
2517 pred = get_Proj_pred(node);
2518 op = get_irn_op(pred);
2521 * Looks strange but calls get_irn_op() only once
2522 * in most often cases.
2524 if (op == op_Proj) { /* nested Tuple ? */
2525 pred = skip_Tuple(pred);
2526 op = get_irn_op(pred);
2528 if (op == op_Tuple) {
2529 node = get_Tuple_pred(pred, get_Proj_proj(node));
2532 } else if (op == op_Tuple) {
2533 node = get_Tuple_pred(pred, get_Proj_proj(node));
2540 /* returns operand of node if node is a Cast */
2541 ir_node *skip_Cast(ir_node *node) {
2542 if (get_irn_op(node) == op_Cast)
2543 return get_Cast_op(node);
2547 /* returns operand of node if node is a Confirm */
2548 ir_node *skip_Confirm(ir_node *node) {
2549 if (get_irn_op(node) == op_Confirm)
2550 return get_Confirm_value(node);
2554 /* skip all high-level ops */
2555 ir_node *skip_HighLevel(ir_node *node) {
2556 if (is_op_highlevel(get_irn_op(node)))
2557 return get_irn_n(node, 0);
2562 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2563 * than any other approach, as Id chains are resolved and all point to the real node, or
2564 * all id's are self loops.
2566 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2567 * a little bit "hand optimized".
2569 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2572 skip_Id(ir_node *node) {
2574 /* don't assert node !!! */
2576 if (!node || (node->op != op_Id)) return node;
2578 /* Don't use get_Id_pred(): We get into an endless loop for
2579 self-referencing Ids. */
2580 pred = node->in[0+1];
2582 if (pred->op != op_Id) return pred;
2584 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2585 ir_node *rem_pred, *res;
2587 if (pred->op != op_Id) return pred; /* shortcut */
2590 assert(get_irn_arity (node) > 0);
2592 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2593 res = skip_Id(rem_pred);
2594 if (res->op == op_Id) /* self-loop */ return node;
2596 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2603 void skip_Id_and_store(ir_node **node) {
2606 if (!n || (n->op != op_Id)) return;
2608 /* Don't use get_Id_pred(): We get into an endless loop for
2609 self-referencing Ids. */
2614 (is_Bad)(const ir_node *node) {
2615 return _is_Bad(node);
2619 (is_NoMem)(const ir_node *node) {
2620 return _is_NoMem(node);
2624 (is_Minus)(const ir_node *node) {
2625 return _is_Minus(node);
2629 (is_Mod)(const ir_node *node) {
2630 return _is_Mod(node);
2634 (is_Div)(const ir_node *node) {
2635 return _is_Div(node);
2639 (is_DivMod)(const ir_node *node) {
2640 return _is_DivMod(node);
2644 (is_Quot)(const ir_node *node) {
2645 return _is_Quot(node);
2649 (is_Add)(const ir_node *node) {
2650 return _is_Add(node);
2654 (is_And)(const ir_node *node) {
2655 return _is_And(node);
2659 (is_Or)(const ir_node *node) {
2660 return _is_Or(node);
2664 (is_Eor)(const ir_node *node) {
2665 return _is_Eor(node);
2669 (is_Sub)(const ir_node *node) {
2670 return _is_Sub(node);
2674 (is_Shl)(const ir_node *node) {
2675 return _is_Shl(node);
2679 (is_Shr)(const ir_node *node) {
2680 return _is_Shr(node);
2684 (is_Shrs)(const ir_node *node) {
2685 return _is_Shrs(node);
2689 (is_Rot)(const ir_node *node) {
2690 return _is_Rot(node);
2694 (is_Not)(const ir_node *node) {
2695 return _is_Not(node);
2699 (is_Psi)(const ir_node *node) {
2700 return _is_Psi(node);
2704 (is_Tuple)(const ir_node *node) {
2705 return _is_Tuple(node);
2709 (is_Start)(const ir_node *node) {
2710 return _is_Start(node);
2714 (is_End)(const ir_node *node) {
2715 return _is_End(node);
2719 (is_Const)(const ir_node *node) {
2720 return _is_Const(node);
2724 (is_Conv)(const ir_node *node) {
2725 return _is_Conv(node);
2729 (is_Cast)(const ir_node *node) {
2730 return _is_Cast(node);
2734 (is_no_Block)(const ir_node *node) {
2735 return _is_no_Block(node);
2739 (is_Block)(const ir_node *node) {
2740 return _is_Block(node);
2743 /* returns true if node is an Unknown node. */
2745 (is_Unknown)(const ir_node *node) {
2746 return _is_Unknown(node);
2749 /* returns true if node is a Return node. */
2751 (is_Return)(const ir_node *node) {
2752 return _is_Return(node);
2755 /* returns true if node is a Call node. */
2757 (is_Call)(const ir_node *node) {
2758 return _is_Call(node);
2761 /* returns true if node is a Sel node. */
2763 (is_Sel)(const ir_node *node) {
2764 return _is_Sel(node);
2767 /* returns true if node is a Mux node or a Psi with only one condition. */
2769 (is_Mux)(const ir_node *node) {
2770 return _is_Mux(node);
2773 /* returns true if node is a Load node. */
2775 (is_Load)(const ir_node *node) {
2776 return _is_Load(node);
2779 /* returns true if node is a Load node. */
2781 (is_Store)(const ir_node *node) {
2782 return _is_Store(node);
2785 /* returns true if node is a Sync node. */
2787 (is_Sync)(const ir_node *node) {
2788 return _is_Sync(node);
2791 /* returns true if node is a Confirm node. */
2793 (is_Confirm)(const ir_node *node) {
2794 return _is_Confirm(node);
2797 /* returns true if node is a Pin node. */
2799 (is_Pin)(const ir_node *node) {
2800 return _is_Pin(node);
2803 /* returns true if node is a SymConst node. */
2805 (is_SymConst)(const ir_node *node) {
2806 return _is_SymConst(node);
2809 /* returns true if node is a Cond node. */
2811 (is_Cond)(const ir_node *node) {
2812 return _is_Cond(node);
2816 (is_CopyB)(const ir_node *node) {
2817 return _is_CopyB(node);
2820 /* returns true if node is a Cmp node. */
2822 (is_Cmp)(const ir_node *node) {
2823 return _is_Cmp(node);
2826 /* returns true if node is an Alloc node. */
2828 (is_Alloc)(const ir_node *node) {
2829 return _is_Alloc(node);
2832 /* returns true if a node is a Jmp node. */
2834 (is_Jmp)(const ir_node *node) {
2835 return _is_Jmp(node);
2838 /* returns true if a node is a Raise node. */
2840 (is_Raise)(const ir_node *node) {
2841 return _is_Raise(node);
2844 /* returns true if a node is an ASM node. */
2846 (is_ASM)(const ir_node *node) {
2847 return _is_ASM(node);
2851 is_Proj(const ir_node *node) {
2853 return node->op == op_Proj ||
2854 (!get_interprocedural_view() && node->op == op_Filter);
2857 /* Returns true if the operation manipulates control flow. */
2859 is_cfop(const ir_node *node) {
2860 return is_cfopcode(get_irn_op(node));
2863 /* Returns true if the operation manipulates interprocedural control flow:
2864 CallBegin, EndReg, EndExcept */
2865 int is_ip_cfop(const ir_node *node) {
2866 return is_ip_cfopcode(get_irn_op(node));
2869 /* Returns true if the operation can change the control flow because
2872 is_fragile_op(const ir_node *node) {
2873 return is_op_fragile(get_irn_op(node));
2876 /* Returns the memory operand of fragile operations. */
2877 ir_node *get_fragile_op_mem(ir_node *node) {
2878 assert(node && is_fragile_op(node));
2880 switch (get_irn_opcode(node)) {
2890 return get_irn_n(node, 0);
2895 assert(0 && "should not be reached");
2900 /* Returns the result mode of a Div operation. */
2901 ir_mode *get_divop_resmod(const ir_node *node) {
2902 switch (get_irn_opcode(node)) {
2903 case iro_Quot : return get_Quot_resmode(node);
2904 case iro_DivMod: return get_DivMod_resmode(node);
2905 case iro_Div : return get_Div_resmode(node);
2906 case iro_Mod : return get_Mod_resmode(node);
2908 assert(0 && "should not be reached");
2913 /* Returns true if the operation is a forking control flow operation. */
2914 int (is_irn_forking)(const ir_node *node) {
2915 return _is_irn_forking(node);
2918 /* Return the type associated with the value produced by n
2919 * if the node remarks this type as it is the case for
2920 * Cast, Const, SymConst and some Proj nodes. */
2921 ir_type *(get_irn_type)(ir_node *node) {
2922 return _get_irn_type(node);
2925 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2927 ir_type *(get_irn_type_attr)(ir_node *node) {
2928 return _get_irn_type_attr(node);
2931 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2932 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2933 return _get_irn_entity_attr(node);
2936 /* Returns non-zero for constant-like nodes. */
2937 int (is_irn_constlike)(const ir_node *node) {
2938 return _is_irn_constlike(node);
2942 * Returns non-zero for nodes that are allowed to have keep-alives and
2943 * are neither Block nor PhiM.
2945 int (is_irn_keep)(const ir_node *node) {
2946 return _is_irn_keep(node);
2950 * Returns non-zero for nodes that are always placed in the start block.
2952 int (is_irn_start_block_placed)(const ir_node *node) {
2953 return _is_irn_start_block_placed(node);
2956 /* Returns non-zero for nodes that are machine operations. */
2957 int (is_irn_machine_op)(const ir_node *node) {
2958 return _is_irn_machine_op(node);
2961 /* Returns non-zero for nodes that are machine operands. */
2962 int (is_irn_machine_operand)(const ir_node *node) {
2963 return _is_irn_machine_operand(node);
2966 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2967 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2968 return _is_irn_machine_user(node, n);
2972 /* Gets the string representation of the jump prediction .*/
2973 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2976 case COND_JMP_PRED_NONE: return "no prediction";
2977 case COND_JMP_PRED_TRUE: return "true taken";
2978 case COND_JMP_PRED_FALSE: return "false taken";
2982 /* Returns the conditional jump prediction of a Cond node. */
2983 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2984 return _get_Cond_jmp_pred(cond);
2987 /* Sets a new conditional jump prediction. */
2988 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2989 _set_Cond_jmp_pred(cond, pred);
2992 /** the get_type operation must be always implemented and return a firm type */
2993 static ir_type *get_Default_type(ir_node *n) {
2995 return get_unknown_type();
2998 /* Sets the get_type operation for an ir_op_ops. */
2999 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3001 case iro_Const: ops->get_type = get_Const_type; break;
3002 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3003 case iro_Cast: ops->get_type = get_Cast_type; break;
3004 case iro_Proj: ops->get_type = get_Proj_type; break;
3006 /* not allowed to be NULL */
3007 if (! ops->get_type)
3008 ops->get_type = get_Default_type;
3014 /** Return the attribute type of a SymConst node if exists */
3015 static ir_type *get_SymConst_attr_type(ir_node *self) {
3016 symconst_kind kind = get_SymConst_kind(self);
3017 if (SYMCONST_HAS_TYPE(kind))
3018 return get_SymConst_type(self);
3022 /** Return the attribute entity of a SymConst node if exists */
3023 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3024 symconst_kind kind = get_SymConst_kind(self);
3025 if (SYMCONST_HAS_ENT(kind))
3026 return get_SymConst_entity(self);
3030 /** the get_type_attr operation must be always implemented */
3031 static ir_type *get_Null_type(ir_node *n) {
3033 return firm_unknown_type;
3036 /* Sets the get_type operation for an ir_op_ops. */
3037 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3039 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3040 case iro_Call: ops->get_type_attr = get_Call_type; break;
3041 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3042 case iro_Free: ops->get_type_attr = get_Free_type; break;
3043 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3045 /* not allowed to be NULL */
3046 if (! ops->get_type_attr)
3047 ops->get_type_attr = get_Null_type;
3053 /** the get_entity_attr operation must be always implemented */
3054 static ir_entity *get_Null_ent(ir_node *n) {
3059 /* Sets the get_type operation for an ir_op_ops. */
3060 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3062 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3063 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
3065 /* not allowed to be NULL */
3066 if (! ops->get_entity_attr)
3067 ops->get_entity_attr = get_Null_ent;
3073 /* Sets the debug information of a node. */
3074 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3075 _set_irn_dbg_info(n, db);
3079 * Returns the debug information of an node.
3081 * @param n The node.
3083 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3084 return _get_irn_dbg_info(n);
3089 #ifdef DEBUG_libfirm
3090 void dump_irn(ir_node *n) {
3091 int i, arity = get_irn_arity(n);
3092 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
3094 ir_node *pred = get_irn_n(n, -1);
3095 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3096 get_irn_node_nr(pred), (void *)pred);
3098 printf(" preds: \n");
3099 for (i = 0; i < arity; ++i) {
3100 ir_node *pred = get_irn_n(n, i);
3101 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3102 get_irn_node_nr(pred), (void *)pred);
3106 #else /* DEBUG_libfirm */
3107 void dump_irn(ir_node *n) {}
3108 #endif /* DEBUG_libfirm */