2 * Copyright (C) 1995-2008 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 pn_Cmp get_negated_pnc(long 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., "<" --> ">" */
86 pn_Cmp get_inversed_pnc(long pnc) {
87 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
88 long lesser = pnc & pn_Cmp_Lt;
89 long greater = pnc & pn_Cmp_Gt;
91 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
97 * Indicates, whether additional data can be registered to ir nodes.
98 * If set to 1, this is not possible anymore.
100 static int forbid_new_data = 0;
103 * The amount of additional space for custom data to be allocated upon
104 * creating a new node.
106 unsigned firm_add_node_size = 0;
109 /* register new space for every node */
110 unsigned firm_register_additional_node_data(unsigned size) {
111 assert(!forbid_new_data && "Too late to register additional node data");
116 return firm_add_node_size += size;
122 /* Forbid the addition of new data to an ir node. */
127 * irnode constructor.
128 * Create a new irnode in irg, with an op, mode, arity and
129 * some incoming irnodes.
130 * If arity is negative, a node with a dynamic array is created.
133 new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
134 int arity, ir_node **in)
137 size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
141 assert(irg && op && mode);
142 p = obstack_alloc(irg->obst, node_size);
143 memset(p, 0, node_size);
144 res = (ir_node *)(p + firm_add_node_size);
146 res->kind = k_ir_node;
150 res->node_idx = irg_register_node_idx(irg, res);
155 res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */
157 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
158 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
162 set_irn_dbg_info(res, db);
166 res->node_nr = get_irp_new_node_nr();
169 for (i = 0; i < EDGE_KIND_LAST; ++i)
170 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
172 /* don't put this into the for loop, arity is -1 for some nodes! */
173 edges_notify_edge(res, -1, res->in[0], NULL, irg);
174 for (i = 1; i <= arity; ++i)
175 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
177 hook_new_node(irg, res);
182 /*-- getting some parameters from ir_nodes --*/
185 (is_ir_node)(const void *thing) {
186 return _is_ir_node(thing);
190 (get_irn_intra_arity)(const ir_node *node) {
191 return _get_irn_intra_arity(node);
195 (get_irn_inter_arity)(const ir_node *node) {
196 return _get_irn_inter_arity(node);
199 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
202 (get_irn_arity)(const ir_node *node) {
203 return _get_irn_arity(node);
206 /* Returns the array with ins. This array is shifted with respect to the
207 array accessed by get_irn_n: The block operand is at position 0 not -1.
208 (@@@ This should be changed.)
209 The order of the predecessors in this array is not guaranteed, except that
210 lists of operands as predecessors of Block or arguments of a Call are
213 get_irn_in(const ir_node *node) {
215 if (get_interprocedural_view()) { /* handle Filter and Block specially */
216 if (get_irn_opcode(node) == iro_Filter) {
217 assert(node->attr.filter.in_cg);
218 return node->attr.filter.in_cg;
219 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
220 return node->attr.block.in_cg;
222 /* else fall through */
228 set_irn_in(ir_node *node, int arity, ir_node **in) {
231 ir_graph *irg = current_ir_graph;
233 if (get_interprocedural_view()) { /* handle Filter and Block specially */
234 if (get_irn_opcode(node) == iro_Filter) {
235 assert(node->attr.filter.in_cg);
236 arr = &node->attr.filter.in_cg;
237 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
238 arr = &node->attr.block.in_cg;
246 for (i = 0; i < arity; i++) {
247 if (i < ARR_LEN(*arr)-1)
248 edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
250 edges_notify_edge(node, i, in[i], NULL, irg);
252 for(;i < ARR_LEN(*arr)-1; i++) {
253 edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
256 if (arity != ARR_LEN(*arr) - 1) {
257 ir_node * block = (*arr)[0];
258 *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
261 fix_backedges(irg->obst, node);
263 memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
267 (get_irn_intra_n)(const ir_node *node, int n) {
268 return _get_irn_intra_n (node, n);
272 (get_irn_inter_n)(const ir_node *node, int n) {
273 return _get_irn_inter_n (node, n);
276 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
279 (get_irn_n)(const ir_node *node, int n) {
280 return _get_irn_n(node, n);
284 set_irn_n (ir_node *node, int n, ir_node *in) {
285 assert(node && node->kind == k_ir_node);
287 assert(n < get_irn_arity(node));
288 assert(in && in->kind == k_ir_node);
290 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
291 /* Change block pred in both views! */
292 node->in[n + 1] = in;
293 assert(node->attr.filter.in_cg);
294 node->attr.filter.in_cg[n + 1] = in;
297 if (get_interprocedural_view()) { /* handle Filter and Block specially */
298 if (get_irn_opcode(node) == iro_Filter) {
299 assert(node->attr.filter.in_cg);
300 node->attr.filter.in_cg[n + 1] = in;
302 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
303 node->attr.block.in_cg[n + 1] = in;
306 /* else fall through */
310 hook_set_irn_n(node, n, in, node->in[n + 1]);
312 /* Here, we rely on src and tgt being in the current ir graph */
313 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
315 node->in[n + 1] = in;
318 int add_irn_n(ir_node *node, ir_node *in)
321 ir_graph *irg = get_irn_irg(node);
323 assert(node->op->opar == oparity_dynamic);
324 pos = ARR_LEN(node->in) - 1;
325 ARR_APP1(ir_node *, node->in, in);
326 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
329 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
335 (get_irn_deps)(const ir_node *node)
337 return _get_irn_deps(node);
341 (get_irn_dep)(const ir_node *node, int pos)
343 return _get_irn_dep(node, pos);
347 (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
349 _set_irn_dep(node, pos, dep);
352 int add_irn_dep(ir_node *node, ir_node *dep)
356 if (node->deps == NULL) {
357 node->deps = NEW_ARR_F(ir_node *, 1);
363 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
364 if(node->deps[i] == NULL)
367 if(node->deps[i] == dep)
371 if (first_zero >= 0) {
372 node->deps[first_zero] = dep;
375 ARR_APP1(ir_node *, node->deps, dep);
380 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
385 void add_irn_deps(ir_node *tgt, ir_node *src) {
388 for (i = 0, n = get_irn_deps(src); i < n; ++i)
389 add_irn_dep(tgt, get_irn_dep(src, i));
394 (get_irn_mode)(const ir_node *node) {
395 return _get_irn_mode(node);
399 (set_irn_mode)(ir_node *node, ir_mode *mode) {
400 _set_irn_mode(node, mode);
404 get_irn_modecode(const ir_node *node) {
406 return node->mode->code;
409 /** Gets the string representation of the mode .*/
411 get_irn_modename(const ir_node *node) {
413 return get_mode_name(node->mode);
417 get_irn_modeident(const ir_node *node) {
419 return get_mode_ident(node->mode);
423 (get_irn_op)(const ir_node *node) {
424 return _get_irn_op(node);
427 /* should be private to the library: */
429 (set_irn_op)(ir_node *node, ir_op *op) {
430 _set_irn_op(node, op);
434 (get_irn_opcode)(const ir_node *node) {
435 return _get_irn_opcode(node);
439 get_irn_opname(const ir_node *node) {
441 if (is_Phi0(node)) return "Phi0";
442 return get_id_str(node->op->name);
446 get_irn_opident(const ir_node *node) {
448 return node->op->name;
452 (get_irn_visited)(const ir_node *node) {
453 return _get_irn_visited(node);
457 (set_irn_visited)(ir_node *node, unsigned long visited) {
458 _set_irn_visited(node, visited);
462 (mark_irn_visited)(ir_node *node) {
463 _mark_irn_visited(node);
467 (irn_not_visited)(const ir_node *node) {
468 return _irn_not_visited(node);
472 (irn_visited)(const ir_node *node) {
473 return _irn_visited(node);
477 (set_irn_link)(ir_node *node, void *link) {
478 _set_irn_link(node, link);
482 (get_irn_link)(const ir_node *node) {
483 return _get_irn_link(node);
487 (get_irn_pinned)(const ir_node *node) {
488 return _get_irn_pinned(node);
492 (is_irn_pinned_in_irg) (const ir_node *node) {
493 return _is_irn_pinned_in_irg(node);
496 void set_irn_pinned(ir_node *node, op_pin_state state) {
497 /* due to optimization an opt may be turned into a Tuple */
498 if (get_irn_op(node) == op_Tuple)
501 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
502 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
504 node->attr.except.pin_state = state;
507 #ifdef DO_HEAPANALYSIS
508 /* Access the abstract interpretation information of a node.
509 Returns NULL if no such information is available. */
510 struct abstval *get_irn_abst_value(ir_node *n) {
513 /* Set the abstract interpretation information of a node. */
514 void set_irn_abst_value(ir_node *n, struct abstval *os) {
517 struct section *firm_get_irn_section(ir_node *n) {
520 void firm_set_irn_section(ir_node *n, struct section *s) {
524 /* Dummies needed for firmjni. */
525 struct abstval *get_irn_abst_value(ir_node *n) {
529 void set_irn_abst_value(ir_node *n, struct abstval *os) {
533 struct section *firm_get_irn_section(ir_node *n) {
537 void firm_set_irn_section(ir_node *n, struct section *s) {
541 #endif /* DO_HEAPANALYSIS */
544 /* Outputs a unique number for this node */
545 long get_irn_node_nr(const ir_node *node) {
548 return node->node_nr;
550 return (long)PTR_TO_INT(node);
555 get_irn_const_attr(ir_node *node) {
556 assert(node->op == op_Const);
557 return &node->attr.con;
561 get_irn_proj_attr(ir_node *node) {
562 assert(node->op == op_Proj);
563 return node->attr.proj;
567 get_irn_alloc_attr(ir_node *node) {
568 assert(node->op == op_Alloc);
569 return &node->attr.alloc;
573 get_irn_free_attr(ir_node *node) {
574 assert(node->op == op_Free);
575 return &node->attr.free;
579 get_irn_symconst_attr(ir_node *node) {
580 assert(node->op == op_SymConst);
581 return &node->attr.symc;
585 get_irn_call_attr(ir_node *node) {
586 assert(node->op == op_Call);
587 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
591 get_irn_sel_attr(ir_node *node) {
592 assert(node->op == op_Sel);
593 return &node->attr.sel;
597 get_irn_phi0_attr(ir_node *node) {
598 assert(is_Phi0(node));
599 return node->attr.phi0.pos;
603 get_irn_block_attr(ir_node *node) {
604 assert(node->op == op_Block);
605 return &node->attr.block;
609 get_irn_load_attr(ir_node *node) {
610 assert(node->op == op_Load);
611 return &node->attr.load;
615 get_irn_store_attr(ir_node *node) {
616 assert(node->op == op_Store);
617 return &node->attr.store;
621 get_irn_except_attr(ir_node *node) {
622 assert(node->op == op_Div || node->op == op_Quot ||
623 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
624 return &node->attr.except;
627 void *(get_irn_generic_attr)(ir_node *node) {
628 assert(is_ir_node(node));
629 return _get_irn_generic_attr(node);
632 const void *(get_irn_generic_attr_const)(const ir_node *node) {
633 assert(is_ir_node(node));
634 return _get_irn_generic_attr_const(node);
637 unsigned (get_irn_idx)(const ir_node *node) {
638 assert(is_ir_node(node));
639 return _get_irn_idx(node);
642 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
644 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
645 if (get_irn_n(node, i) == arg)
651 /** manipulate fields of individual nodes **/
653 /* this works for all except Block */
655 get_nodes_block(const ir_node *node) {
656 assert(node->op != op_Block);
657 return get_irn_n(node, -1);
661 set_nodes_block(ir_node *node, ir_node *block) {
662 assert(node->op != op_Block);
663 set_irn_n(node, -1, block);
666 /* this works for all except Block */
668 get_nodes_MacroBlock(const ir_node *node) {
669 assert(node->op != op_Block);
670 return get_Block_MacroBlock(get_irn_n(node, -1));
673 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
674 * from Start. If so returns frame type, else Null. */
675 ir_type *is_frame_pointer(const ir_node *n) {
676 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
677 ir_node *start = get_Proj_pred(n);
678 if (is_Start(start)) {
679 return get_irg_frame_type(get_irn_irg(start));
685 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
686 * from Start. If so returns global type, else Null. */
687 ir_type *is_globals_pointer(const ir_node *n) {
688 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
689 ir_node *start = get_Proj_pred(n);
690 if (is_Start(start)) {
691 return get_glob_type();
697 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
698 * from Start. If so returns tls type, else Null. */
699 ir_type *is_tls_pointer(const ir_node *n) {
700 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
701 ir_node *start = get_Proj_pred(n);
702 if (is_Start(start)) {
703 return get_tls_type();
709 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
710 * from Start. If so returns 1, else 0. */
711 int is_value_arg_pointer(const ir_node *n) {
713 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
714 is_Start(get_Proj_pred(n)))
719 /* Returns an array with the predecessors of the Block. Depending on
720 the implementation of the graph data structure this can be a copy of
721 the internal representation of predecessors as well as the internal
722 array itself. Therefore writing to this array might obstruct the ir. */
724 get_Block_cfgpred_arr(ir_node *node) {
725 assert((node->op == op_Block));
726 return (ir_node **)&(get_irn_in(node)[1]);
730 (get_Block_n_cfgpreds)(const ir_node *node) {
731 return _get_Block_n_cfgpreds(node);
735 (get_Block_cfgpred)(const ir_node *node, int pos) {
736 return _get_Block_cfgpred(node, pos);
740 set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
741 assert(node->op == op_Block);
742 set_irn_n(node, pos, pred);
746 (get_Block_cfgpred_block)(const ir_node *node, int pos) {
747 return _get_Block_cfgpred_block(node, pos);
751 get_Block_matured(const ir_node *node) {
752 assert(node->op == op_Block);
753 return (int)node->attr.block.is_matured;
757 set_Block_matured(ir_node *node, int matured) {
758 assert(node->op == op_Block);
759 node->attr.block.is_matured = matured;
763 (get_Block_block_visited)(const ir_node *node) {
764 return _get_Block_block_visited(node);
768 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
769 _set_Block_block_visited(node, visit);
772 /* For this current_ir_graph must be set. */
774 (mark_Block_block_visited)(ir_node *node) {
775 _mark_Block_block_visited(node);
779 (Block_not_block_visited)(const ir_node *node) {
780 return _Block_not_block_visited(node);
784 (Block_block_visited)(const ir_node *node) {
785 return _Block_block_visited(node);
789 get_Block_graph_arr(ir_node *node, int pos) {
790 assert(node->op == op_Block);
791 return node->attr.block.graph_arr[pos+1];
795 set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
796 assert(node->op == op_Block);
797 node->attr.block.graph_arr[pos+1] = value;
800 #ifdef INTERPROCEDURAL_VIEW
801 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
802 assert(node->op == op_Block);
803 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
804 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
805 node->attr.block.in_cg[0] = NULL;
806 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
808 /* Fix backedge array. fix_backedges() operates depending on
809 interprocedural_view. */
810 int ipv = get_interprocedural_view();
811 set_interprocedural_view(1);
812 fix_backedges(current_ir_graph->obst, node);
813 set_interprocedural_view(ipv);
816 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
819 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
820 assert(node->op == op_Block &&
821 node->attr.block.in_cg &&
822 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
823 node->attr.block.in_cg[pos + 1] = pred;
826 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
827 assert(node->op == op_Block);
828 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
831 int get_Block_cg_n_cfgpreds(const ir_node *node) {
832 assert(node->op == op_Block);
833 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
836 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
837 assert(node->op == op_Block && node->attr.block.in_cg);
838 return node->attr.block.in_cg[pos + 1];
841 void remove_Block_cg_cfgpred_arr(ir_node *node) {
842 assert(node->op == op_Block);
843 node->attr.block.in_cg = NULL;
847 ir_node *(set_Block_dead)(ir_node *block) {
848 return _set_Block_dead(block);
851 int (is_Block_dead)(const ir_node *block) {
852 return _is_Block_dead(block);
855 ir_extblk *get_Block_extbb(const ir_node *block) {
857 assert(is_Block(block));
858 res = block->attr.block.extblk;
859 assert(res == NULL || is_ir_extbb(res));
863 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
864 assert(is_Block(block));
865 assert(extblk == NULL || is_ir_extbb(extblk));
866 block->attr.block.extblk = extblk;
869 /* returns the macro block header of a block. */
870 ir_node *get_Block_MacroBlock(const ir_node *block) {
872 assert(is_Block(block));
873 mbh = get_irn_n(block, -1);
874 /* once macro block header is respected by all optimizations,
875 this assert can be removed */
880 /* returns the macro block header of a node. */
881 ir_node *get_irn_MacroBlock(const ir_node *n) {
883 n = get_nodes_block(n);
884 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
888 return get_Block_MacroBlock(n);
891 /* returns the graph of a Block. */
892 ir_graph *get_Block_irg(const ir_node *block) {
893 assert(is_Block(block));
894 return block->attr.block.irg;
897 int has_Block_label(const ir_node *block) {
898 assert(is_Block(block));
899 return block->attr.block.has_label;
902 ir_label_t get_Block_label(const ir_node *block) {
903 assert(is_Block(block));
904 return block->attr.block.label;
907 void set_Block_label(ir_node *block, ir_label_t label) {
908 assert(is_Block(block));
909 block->attr.block.has_label = 1;
910 block->attr.block.label = label;
914 get_End_n_keepalives(const ir_node *end) {
915 assert(end->op == op_End);
916 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
920 get_End_keepalive(const ir_node *end, int pos) {
921 assert(end->op == op_End);
922 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
926 add_End_keepalive(ir_node *end, ir_node *ka) {
927 assert(end->op == op_End);
928 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
933 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
934 assert(end->op == op_End);
935 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
938 /* Set new keep-alives */
939 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
941 ir_graph *irg = get_irn_irg(end);
943 /* notify that edges are deleted */
944 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
945 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
947 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
949 for (i = 0; i < n; ++i) {
950 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
951 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
955 /* Set new keep-alives from old keep-alives, skipping irn */
956 void remove_End_keepalive(ir_node *end, ir_node *irn) {
957 int n = get_End_n_keepalives(end);
961 NEW_ARR_A(ir_node *, in, n);
963 for (idx = i = 0; i < n; ++i) {
964 ir_node *old_ka = get_End_keepalive(end, i);
971 /* set new keep-alives */
972 set_End_keepalives(end, idx, in);
976 free_End(ir_node *end) {
977 assert(end->op == op_End);
980 end->in = NULL; /* @@@ make sure we get an error if we use the
981 in array afterwards ... */
984 /* Return the target address of an IJmp */
985 ir_node *get_IJmp_target(const ir_node *ijmp) {
986 assert(ijmp->op == op_IJmp);
987 return get_irn_n(ijmp, 0);
990 /** Sets the target address of an IJmp */
991 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
992 assert(ijmp->op == op_IJmp);
993 set_irn_n(ijmp, 0, tgt);
997 > Implementing the case construct (which is where the constant Proj node is
998 > important) involves far more than simply determining the constant values.
999 > We could argue that this is more properly a function of the translator from
1000 > Firm to the target machine. That could be done if there was some way of
1001 > projecting "default" out of the Cond node.
1002 I know it's complicated.
1003 Basically there are two problems:
1004 - determining the gaps between the Projs
1005 - determining the biggest case constant to know the proj number for
1007 I see several solutions:
1008 1. Introduce a ProjDefault node. Solves both problems.
1009 This means to extend all optimizations executed during construction.
1010 2. Give the Cond node for switch two flavors:
1011 a) there are no gaps in the Projs (existing flavor)
1012 b) gaps may exist, default proj is still the Proj with the largest
1013 projection number. This covers also the gaps.
1014 3. Fix the semantic of the Cond to that of 2b)
1016 Solution 2 seems to be the best:
1017 Computing the gaps in the Firm representation is not too hard, i.e.,
1018 libFIRM can implement a routine that transforms between the two
1019 flavours. This is also possible for 1) but 2) does not require to
1020 change any existing optimization.
1021 Further it should be far simpler to determine the biggest constant than
1022 to compute all gaps.
1023 I don't want to choose 3) as 2a) seems to have advantages for
1024 dataflow analysis and 3) does not allow to convert the representation to
1028 get_Cond_selector(const ir_node *node) {
1029 assert(node->op == op_Cond);
1030 return get_irn_n(node, 0);
1034 set_Cond_selector(ir_node *node, ir_node *selector) {
1035 assert(node->op == op_Cond);
1036 set_irn_n(node, 0, selector);
1040 get_Cond_kind(const ir_node *node) {
1041 assert(node->op == op_Cond);
1042 return node->attr.cond.kind;
1046 set_Cond_kind(ir_node *node, cond_kind kind) {
1047 assert(node->op == op_Cond);
1048 node->attr.cond.kind = kind;
1052 get_Cond_defaultProj(const ir_node *node) {
1053 assert(node->op == op_Cond);
1054 return node->attr.cond.default_proj;
1058 get_Return_mem(const ir_node *node) {
1059 assert(node->op == op_Return);
1060 return get_irn_n(node, 0);
1064 set_Return_mem(ir_node *node, ir_node *mem) {
1065 assert(node->op == op_Return);
1066 set_irn_n(node, 0, mem);
1070 get_Return_n_ress(const ir_node *node) {
1071 assert(node->op == op_Return);
1072 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1076 get_Return_res_arr(ir_node *node) {
1077 assert((node->op == op_Return));
1078 if (get_Return_n_ress(node) > 0)
1079 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1086 set_Return_n_res(ir_node *node, int results) {
1087 assert(node->op == op_Return);
1092 get_Return_res(const ir_node *node, int pos) {
1093 assert(node->op == op_Return);
1094 assert(get_Return_n_ress(node) > pos);
1095 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1099 set_Return_res(ir_node *node, int pos, ir_node *res){
1100 assert(node->op == op_Return);
1101 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1104 tarval *(get_Const_tarval)(const ir_node *node) {
1105 return _get_Const_tarval(node);
1109 set_Const_tarval(ir_node *node, tarval *con) {
1110 assert(node->op == op_Const);
1111 node->attr.con.tv = con;
1114 int (is_Const_null)(const ir_node *node) {
1115 return _is_Const_null(node);
1118 int (is_Const_one)(const ir_node *node) {
1119 return _is_Const_one(node);
1122 int (is_Const_all_one)(const ir_node *node) {
1123 return _is_Const_all_one(node);
1127 /* The source language type. Must be an atomic type. Mode of type must
1128 be mode of node. For tarvals from entities type must be pointer to
1131 get_Const_type(ir_node *node) {
1132 assert(node->op == op_Const);
1133 node->attr.con.tp = skip_tid(node->attr.con.tp);
1134 return node->attr.con.tp;
1138 set_Const_type(ir_node *node, ir_type *tp) {
1139 assert(node->op == op_Const);
1140 if (tp != firm_unknown_type) {
1141 assert(is_atomic_type(tp));
1142 assert(get_type_mode(tp) == get_irn_mode(node));
1144 node->attr.con.tp = tp;
1149 get_SymConst_kind(const ir_node *node) {
1150 assert(node->op == op_SymConst);
1151 return node->attr.symc.num;
1155 set_SymConst_kind(ir_node *node, symconst_kind num) {
1156 assert(node->op == op_SymConst);
1157 node->attr.symc.num = num;
1161 get_SymConst_type(ir_node *node) {
1162 assert((node->op == op_SymConst) &&
1163 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1164 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1168 set_SymConst_type(ir_node *node, ir_type *tp) {
1169 assert((node->op == op_SymConst) &&
1170 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1171 node->attr.symc.sym.type_p = tp;
1175 get_SymConst_name(const ir_node *node) {
1176 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1177 return node->attr.symc.sym.ident_p;
1181 set_SymConst_name(ir_node *node, ident *name) {
1182 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1183 node->attr.symc.sym.ident_p = name;
1187 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1188 ir_entity *get_SymConst_entity(const ir_node *node) {
1189 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1190 return node->attr.symc.sym.entity_p;
1193 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1194 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1195 node->attr.symc.sym.entity_p = ent;
1198 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1199 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1200 return node->attr.symc.sym.enum_p;
1203 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1204 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1205 node->attr.symc.sym.enum_p = ec;
1208 union symconst_symbol
1209 get_SymConst_symbol(const ir_node *node) {
1210 assert(node->op == op_SymConst);
1211 return node->attr.symc.sym;
1215 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1216 assert(node->op == op_SymConst);
1217 node->attr.symc.sym = sym;
1220 ir_label_t get_SymConst_label(const ir_node *node) {
1221 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1222 return node->attr.symc.sym.label;
1225 void set_SymConst_label(ir_node *node, ir_label_t label) {
1226 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1227 node->attr.symc.sym.label = label;
1231 get_SymConst_value_type(ir_node *node) {
1232 assert(node->op == op_SymConst);
1233 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1234 return node->attr.symc.tp;
1238 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1239 assert(node->op == op_SymConst);
1240 node->attr.symc.tp = tp;
1244 get_Sel_mem(const ir_node *node) {
1245 assert(node->op == op_Sel);
1246 return get_irn_n(node, 0);
1250 set_Sel_mem(ir_node *node, ir_node *mem) {
1251 assert(node->op == op_Sel);
1252 set_irn_n(node, 0, mem);
1256 get_Sel_ptr(const ir_node *node) {
1257 assert(node->op == op_Sel);
1258 return get_irn_n(node, 1);
1262 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1263 assert(node->op == op_Sel);
1264 set_irn_n(node, 1, ptr);
1268 get_Sel_n_indexs(const ir_node *node) {
1269 assert(node->op == op_Sel);
1270 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1274 get_Sel_index_arr(ir_node *node) {
1275 assert((node->op == op_Sel));
1276 if (get_Sel_n_indexs(node) > 0)
1277 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1283 get_Sel_index(const ir_node *node, int pos) {
1284 assert(node->op == op_Sel);
1285 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1289 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1290 assert(node->op == op_Sel);
1291 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1295 get_Sel_entity(const ir_node *node) {
1296 assert(node->op == op_Sel);
1297 return node->attr.sel.ent;
1300 ir_entity *_get_Sel_entity(ir_node *node) {
1301 return get_Sel_entity(node);
1305 set_Sel_entity(ir_node *node, ir_entity *ent) {
1306 assert(node->op == op_Sel);
1307 node->attr.sel.ent = ent;
1311 /* For unary and binary arithmetic operations the access to the
1312 operands can be factored out. Left is the first, right the
1313 second arithmetic value as listed in tech report 0999-33.
1314 unops are: Minus, Abs, Not, Conv, Cast
1315 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1316 Shr, Shrs, Rotate, Cmp */
1320 get_Call_mem(const ir_node *node) {
1321 assert(node->op == op_Call);
1322 return get_irn_n(node, 0);
1326 set_Call_mem(ir_node *node, ir_node *mem) {
1327 assert(node->op == op_Call);
1328 set_irn_n(node, 0, mem);
1332 get_Call_ptr(const ir_node *node) {
1333 assert(node->op == op_Call);
1334 return get_irn_n(node, 1);
1338 set_Call_ptr(ir_node *node, ir_node *ptr) {
1339 assert(node->op == op_Call);
1340 set_irn_n(node, 1, ptr);
1344 get_Call_param_arr(ir_node *node) {
1345 assert(node->op == op_Call);
1346 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1350 get_Call_n_params(const ir_node *node) {
1351 assert(node->op == op_Call);
1352 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1356 get_Call_arity(const ir_node *node) {
1357 assert(node->op == op_Call);
1358 return get_Call_n_params(node);
1362 set_Call_arity(ir_node *node, ir_node *arity) {
1363 assert(node->op == op_Call);
1368 get_Call_param(const ir_node *node, int pos) {
1369 assert(node->op == op_Call);
1370 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1374 set_Call_param(ir_node *node, int pos, ir_node *param) {
1375 assert(node->op == op_Call);
1376 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1380 get_Call_type(ir_node *node) {
1381 assert(node->op == op_Call);
1382 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1386 set_Call_type(ir_node *node, ir_type *tp) {
1387 assert(node->op == op_Call);
1388 assert((get_unknown_type() == tp) || is_Method_type(tp));
1389 node->attr.call.cld_tp = tp;
1392 int Call_has_callees(const ir_node *node) {
1393 assert(node && node->op == op_Call);
1394 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1395 (node->attr.call.callee_arr != NULL));
1398 int get_Call_n_callees(const ir_node *node) {
1399 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1400 return ARR_LEN(node->attr.call.callee_arr);
1403 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1404 assert(pos >= 0 && pos < get_Call_n_callees(node));
1405 return node->attr.call.callee_arr[pos];
1408 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1409 assert(node->op == op_Call);
1410 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1411 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1413 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1416 void remove_Call_callee_arr(ir_node *node) {
1417 assert(node->op == op_Call);
1418 node->attr.call.callee_arr = NULL;
1421 ir_node *get_CallBegin_ptr(const ir_node *node) {
1422 assert(node->op == op_CallBegin);
1423 return get_irn_n(node, 0);
1426 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1427 assert(node->op == op_CallBegin);
1428 set_irn_n(node, 0, ptr);
1431 ir_node *get_CallBegin_call(const ir_node *node) {
1432 assert(node->op == op_CallBegin);
1433 return node->attr.callbegin.call;
1436 void set_CallBegin_call(ir_node *node, ir_node *call) {
1437 assert(node->op == op_CallBegin);
1438 node->attr.callbegin.call = call;
1443 ir_node * get_##OP##_left(const ir_node *node) { \
1444 assert(node->op == op_##OP); \
1445 return get_irn_n(node, node->op->op_index); \
1447 void set_##OP##_left(ir_node *node, ir_node *left) { \
1448 assert(node->op == op_##OP); \
1449 set_irn_n(node, node->op->op_index, left); \
1451 ir_node *get_##OP##_right(const ir_node *node) { \
1452 assert(node->op == op_##OP); \
1453 return get_irn_n(node, node->op->op_index + 1); \
1455 void set_##OP##_right(ir_node *node, ir_node *right) { \
1456 assert(node->op == op_##OP); \
1457 set_irn_n(node, node->op->op_index + 1, right); \
1461 ir_node *get_##OP##_op(const ir_node *node) { \
1462 assert(node->op == op_##OP); \
1463 return get_irn_n(node, node->op->op_index); \
1465 void set_##OP##_op(ir_node *node, ir_node *op) { \
1466 assert(node->op == op_##OP); \
1467 set_irn_n(node, node->op->op_index, op); \
1470 #define BINOP_MEM(OP) \
1474 get_##OP##_mem(const ir_node *node) { \
1475 assert(node->op == op_##OP); \
1476 return get_irn_n(node, 0); \
1480 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1481 assert(node->op == op_##OP); \
1482 set_irn_n(node, 0, mem); \
1488 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1489 assert(node->op == op_##OP); \
1490 return node->attr.divmod.res_mode; \
1493 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1494 assert(node->op == op_##OP); \
1495 node->attr.divmod.res_mode = mode; \
1521 int get_Conv_strict(const ir_node *node) {
1522 assert(node->op == op_Conv);
1523 return node->attr.conv.strict;
1526 void set_Conv_strict(ir_node *node, int strict_flag) {
1527 assert(node->op == op_Conv);
1528 node->attr.conv.strict = (char)strict_flag;
1532 get_Cast_type(ir_node *node) {
1533 assert(node->op == op_Cast);
1534 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1535 return node->attr.cast.totype;
1539 set_Cast_type(ir_node *node, ir_type *to_tp) {
1540 assert(node->op == op_Cast);
1541 node->attr.cast.totype = to_tp;
1545 /* Checks for upcast.
1547 * Returns true if the Cast node casts a class type to a super type.
1549 int is_Cast_upcast(ir_node *node) {
1550 ir_type *totype = get_Cast_type(node);
1551 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1553 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1556 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1557 totype = get_pointer_points_to_type(totype);
1558 fromtype = get_pointer_points_to_type(fromtype);
1563 if (!is_Class_type(totype)) return 0;
1564 return is_SubClass_of(fromtype, totype);
1567 /* Checks for downcast.
1569 * Returns true if the Cast node casts a class type to a sub type.
1571 int is_Cast_downcast(ir_node *node) {
1572 ir_type *totype = get_Cast_type(node);
1573 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1575 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1578 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1579 totype = get_pointer_points_to_type(totype);
1580 fromtype = get_pointer_points_to_type(fromtype);
1585 if (!is_Class_type(totype)) return 0;
1586 return is_SubClass_of(totype, fromtype);
1590 (is_unop)(const ir_node *node) {
1591 return _is_unop(node);
1595 get_unop_op(const ir_node *node) {
1596 if (node->op->opar == oparity_unary)
1597 return get_irn_n(node, node->op->op_index);
1599 assert(node->op->opar == oparity_unary);
1604 set_unop_op(ir_node *node, ir_node *op) {
1605 if (node->op->opar == oparity_unary)
1606 set_irn_n(node, node->op->op_index, op);
1608 assert(node->op->opar == oparity_unary);
1612 (is_binop)(const ir_node *node) {
1613 return _is_binop(node);
1617 get_binop_left(const ir_node *node) {
1618 assert(node->op->opar == oparity_binary);
1619 return get_irn_n(node, node->op->op_index);
1623 set_binop_left(ir_node *node, ir_node *left) {
1624 assert(node->op->opar == oparity_binary);
1625 set_irn_n(node, node->op->op_index, left);
1629 get_binop_right(const ir_node *node) {
1630 assert(node->op->opar == oparity_binary);
1631 return get_irn_n(node, node->op->op_index + 1);
1635 set_binop_right(ir_node *node, ir_node *right) {
1636 assert(node->op->opar == oparity_binary);
1637 set_irn_n(node, node->op->op_index + 1, right);
1641 (is_Phi)(const ir_node *n) {
1645 int is_Phi0(const ir_node *n) {
1648 return ((get_irn_op(n) == op_Phi) &&
1649 (get_irn_arity(n) == 0) &&
1650 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1654 get_Phi_preds_arr(ir_node *node) {
1655 assert(node->op == op_Phi);
1656 return (ir_node **)&(get_irn_in(node)[1]);
1660 get_Phi_n_preds(const ir_node *node) {
1661 assert(is_Phi(node) || is_Phi0(node));
1662 return (get_irn_arity(node));
1666 void set_Phi_n_preds(ir_node *node, int n_preds) {
1667 assert(node->op == op_Phi);
1672 get_Phi_pred(const ir_node *node, int pos) {
1673 assert(is_Phi(node) || is_Phi0(node));
1674 return get_irn_n(node, pos);
1678 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1679 assert(is_Phi(node) || is_Phi0(node));
1680 set_irn_n(node, pos, pred);
1684 int is_memop(const ir_node *node) {
1685 ir_opcode code = get_irn_opcode(node);
1686 return (code == iro_Load || code == iro_Store);
1689 ir_node *get_memop_mem(const ir_node *node) {
1690 assert(is_memop(node));
1691 return get_irn_n(node, 0);
1694 void set_memop_mem(ir_node *node, ir_node *mem) {
1695 assert(is_memop(node));
1696 set_irn_n(node, 0, mem);
1699 ir_node *get_memop_ptr(const ir_node *node) {
1700 assert(is_memop(node));
1701 return get_irn_n(node, 1);
1704 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1705 assert(is_memop(node));
1706 set_irn_n(node, 1, ptr);
1710 get_Load_mem(const ir_node *node) {
1711 assert(node->op == op_Load);
1712 return get_irn_n(node, 0);
1716 set_Load_mem(ir_node *node, ir_node *mem) {
1717 assert(node->op == op_Load);
1718 set_irn_n(node, 0, mem);
1722 get_Load_ptr(const ir_node *node) {
1723 assert(node->op == op_Load);
1724 return get_irn_n(node, 1);
1728 set_Load_ptr(ir_node *node, ir_node *ptr) {
1729 assert(node->op == op_Load);
1730 set_irn_n(node, 1, ptr);
1734 get_Load_mode(const ir_node *node) {
1735 assert(node->op == op_Load);
1736 return node->attr.load.load_mode;
1740 set_Load_mode(ir_node *node, ir_mode *mode) {
1741 assert(node->op == op_Load);
1742 node->attr.load.load_mode = mode;
1746 get_Load_volatility(const ir_node *node) {
1747 assert(node->op == op_Load);
1748 return node->attr.load.volatility;
1752 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1753 assert(node->op == op_Load);
1754 node->attr.load.volatility = volatility;
1758 get_Load_align(const ir_node *node) {
1759 assert(node->op == op_Load);
1760 return node->attr.load.aligned;
1764 set_Load_align(ir_node *node, ir_align align) {
1765 assert(node->op == op_Load);
1766 node->attr.load.aligned = align;
1771 get_Store_mem(const ir_node *node) {
1772 assert(node->op == op_Store);
1773 return get_irn_n(node, 0);
1777 set_Store_mem(ir_node *node, ir_node *mem) {
1778 assert(node->op == op_Store);
1779 set_irn_n(node, 0, mem);
1783 get_Store_ptr(const ir_node *node) {
1784 assert(node->op == op_Store);
1785 return get_irn_n(node, 1);
1789 set_Store_ptr(ir_node *node, ir_node *ptr) {
1790 assert(node->op == op_Store);
1791 set_irn_n(node, 1, ptr);
1795 get_Store_value(const ir_node *node) {
1796 assert(node->op == op_Store);
1797 return get_irn_n(node, 2);
1801 set_Store_value(ir_node *node, ir_node *value) {
1802 assert(node->op == op_Store);
1803 set_irn_n(node, 2, value);
1807 get_Store_volatility(const ir_node *node) {
1808 assert(node->op == op_Store);
1809 return node->attr.store.volatility;
1813 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1814 assert(node->op == op_Store);
1815 node->attr.store.volatility = volatility;
1819 get_Store_align(const ir_node *node) {
1820 assert(node->op == op_Store);
1821 return node->attr.store.aligned;
1825 set_Store_align(ir_node *node, ir_align align) {
1826 assert(node->op == op_Store);
1827 node->attr.store.aligned = align;
1832 get_Alloc_mem(const ir_node *node) {
1833 assert(node->op == op_Alloc);
1834 return get_irn_n(node, 0);
1838 set_Alloc_mem(ir_node *node, ir_node *mem) {
1839 assert(node->op == op_Alloc);
1840 set_irn_n(node, 0, mem);
1844 get_Alloc_size(const ir_node *node) {
1845 assert(node->op == op_Alloc);
1846 return get_irn_n(node, 1);
1850 set_Alloc_size(ir_node *node, ir_node *size) {
1851 assert(node->op == op_Alloc);
1852 set_irn_n(node, 1, size);
1856 get_Alloc_type(ir_node *node) {
1857 assert(node->op == op_Alloc);
1858 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1862 set_Alloc_type(ir_node *node, ir_type *tp) {
1863 assert(node->op == op_Alloc);
1864 node->attr.alloc.type = tp;
1868 get_Alloc_where(const ir_node *node) {
1869 assert(node->op == op_Alloc);
1870 return node->attr.alloc.where;
1874 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1875 assert(node->op == op_Alloc);
1876 node->attr.alloc.where = where;
1881 get_Free_mem(const ir_node *node) {
1882 assert(node->op == op_Free);
1883 return get_irn_n(node, 0);
1887 set_Free_mem(ir_node *node, ir_node *mem) {
1888 assert(node->op == op_Free);
1889 set_irn_n(node, 0, mem);
1893 get_Free_ptr(const ir_node *node) {
1894 assert(node->op == op_Free);
1895 return get_irn_n(node, 1);
1899 set_Free_ptr(ir_node *node, ir_node *ptr) {
1900 assert(node->op == op_Free);
1901 set_irn_n(node, 1, ptr);
1905 get_Free_size(const ir_node *node) {
1906 assert(node->op == op_Free);
1907 return get_irn_n(node, 2);
1911 set_Free_size(ir_node *node, ir_node *size) {
1912 assert(node->op == op_Free);
1913 set_irn_n(node, 2, size);
1917 get_Free_type(ir_node *node) {
1918 assert(node->op == op_Free);
1919 return node->attr.free.type = skip_tid(node->attr.free.type);
1923 set_Free_type(ir_node *node, ir_type *tp) {
1924 assert(node->op == op_Free);
1925 node->attr.free.type = tp;
1929 get_Free_where(const ir_node *node) {
1930 assert(node->op == op_Free);
1931 return node->attr.free.where;
1935 set_Free_where(ir_node *node, ir_where_alloc where) {
1936 assert(node->op == op_Free);
1937 node->attr.free.where = where;
1940 ir_node **get_Sync_preds_arr(ir_node *node) {
1941 assert(node->op == op_Sync);
1942 return (ir_node **)&(get_irn_in(node)[1]);
1945 int get_Sync_n_preds(const ir_node *node) {
1946 assert(node->op == op_Sync);
1947 return (get_irn_arity(node));
1951 void set_Sync_n_preds(ir_node *node, int n_preds) {
1952 assert(node->op == op_Sync);
1956 ir_node *get_Sync_pred(const ir_node *node, int pos) {
1957 assert(node->op == op_Sync);
1958 return get_irn_n(node, pos);
1961 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1962 assert(node->op == op_Sync);
1963 set_irn_n(node, pos, pred);
1966 /* Add a new Sync predecessor */
1967 void add_Sync_pred(ir_node *node, ir_node *pred) {
1968 assert(node->op == op_Sync);
1969 add_irn_n(node, pred);
1972 /* Returns the source language type of a Proj node. */
1973 ir_type *get_Proj_type(ir_node *n) {
1974 ir_type *tp = firm_unknown_type;
1975 ir_node *pred = get_Proj_pred(n);
1977 switch (get_irn_opcode(pred)) {
1980 /* Deal with Start / Call here: we need to know the Proj Nr. */
1981 assert(get_irn_mode(pred) == mode_T);
1982 pred_pred = get_Proj_pred(pred);
1983 if (get_irn_op(pred_pred) == op_Start) {
1984 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1985 tp = get_method_param_type(mtp, get_Proj_proj(n));
1986 } else if (get_irn_op(pred_pred) == op_Call) {
1987 ir_type *mtp = get_Call_type(pred_pred);
1988 tp = get_method_res_type(mtp, get_Proj_proj(n));
1991 case iro_Start: break;
1992 case iro_Call: break;
1994 ir_node *a = get_Load_ptr(pred);
1996 tp = get_entity_type(get_Sel_entity(a));
2005 get_Proj_pred(const ir_node *node) {
2006 assert(is_Proj(node));
2007 return get_irn_n(node, 0);
2011 set_Proj_pred(ir_node *node, ir_node *pred) {
2012 assert(is_Proj(node));
2013 set_irn_n(node, 0, pred);
2017 get_Proj_proj(const ir_node *node) {
2018 assert(is_Proj(node));
2019 if (get_irn_opcode(node) == iro_Proj) {
2020 return node->attr.proj;
2022 assert(get_irn_opcode(node) == iro_Filter);
2023 return node->attr.filter.proj;
2028 set_Proj_proj(ir_node *node, long proj) {
2029 assert(node->op == op_Proj);
2030 node->attr.proj = proj;
2034 get_Tuple_preds_arr(ir_node *node) {
2035 assert(node->op == op_Tuple);
2036 return (ir_node **)&(get_irn_in(node)[1]);
2040 get_Tuple_n_preds(const ir_node *node) {
2041 assert(node->op == op_Tuple);
2042 return (get_irn_arity(node));
2047 set_Tuple_n_preds(ir_node *node, int n_preds) {
2048 assert(node->op == op_Tuple);
2053 get_Tuple_pred(const ir_node *node, int pos) {
2054 assert(node->op == op_Tuple);
2055 return get_irn_n(node, pos);
2059 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2060 assert(node->op == op_Tuple);
2061 set_irn_n(node, pos, pred);
2065 get_Id_pred(const ir_node *node) {
2066 assert(node->op == op_Id);
2067 return get_irn_n(node, 0);
2071 set_Id_pred(ir_node *node, ir_node *pred) {
2072 assert(node->op == op_Id);
2073 set_irn_n(node, 0, pred);
2076 ir_node *get_Confirm_value(const ir_node *node) {
2077 assert(node->op == op_Confirm);
2078 return get_irn_n(node, 0);
2081 void set_Confirm_value(ir_node *node, ir_node *value) {
2082 assert(node->op == op_Confirm);
2083 set_irn_n(node, 0, value);
2086 ir_node *get_Confirm_bound(const ir_node *node) {
2087 assert(node->op == op_Confirm);
2088 return get_irn_n(node, 1);
2091 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2092 assert(node->op == op_Confirm);
2093 set_irn_n(node, 0, bound);
2096 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2097 assert(node->op == op_Confirm);
2098 return node->attr.confirm.cmp;
2101 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2102 assert(node->op == op_Confirm);
2103 node->attr.confirm.cmp = cmp;
2107 get_Filter_pred(ir_node *node) {
2108 assert(node->op == op_Filter);
2113 set_Filter_pred(ir_node *node, ir_node *pred) {
2114 assert(node->op == op_Filter);
2119 get_Filter_proj(ir_node *node) {
2120 assert(node->op == op_Filter);
2121 return node->attr.filter.proj;
2125 set_Filter_proj(ir_node *node, long proj) {
2126 assert(node->op == op_Filter);
2127 node->attr.filter.proj = proj;
2130 /* Don't use get_irn_arity, get_irn_n in implementation as access
2131 shall work independent of view!!! */
2132 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2133 assert(node->op == op_Filter);
2134 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2135 ir_graph *irg = get_irn_irg(node);
2136 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2137 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2138 node->attr.filter.in_cg[0] = node->in[0];
2140 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2143 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2144 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2145 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2146 node->attr.filter.in_cg[pos + 1] = pred;
2149 int get_Filter_n_cg_preds(ir_node *node) {
2150 assert(node->op == op_Filter && node->attr.filter.in_cg);
2151 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2154 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2156 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2158 arity = ARR_LEN(node->attr.filter.in_cg);
2159 assert(pos < arity - 1);
2160 return node->attr.filter.in_cg[pos + 1];
2164 ir_node *get_Mux_sel(const ir_node *node) {
2165 if (node->op == op_Psi) {
2166 assert(get_irn_arity(node) == 3);
2167 return get_Psi_cond(node, 0);
2169 assert(node->op == op_Mux);
2173 void set_Mux_sel(ir_node *node, ir_node *sel) {
2174 if (node->op == op_Psi) {
2175 assert(get_irn_arity(node) == 3);
2176 set_Psi_cond(node, 0, sel);
2178 assert(node->op == op_Mux);
2183 ir_node *get_Mux_false(const ir_node *node) {
2184 if (node->op == op_Psi) {
2185 assert(get_irn_arity(node) == 3);
2186 return get_Psi_default(node);
2188 assert(node->op == op_Mux);
2192 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2193 if (node->op == op_Psi) {
2194 assert(get_irn_arity(node) == 3);
2195 set_Psi_default(node, ir_false);
2197 assert(node->op == op_Mux);
2198 node->in[2] = ir_false;
2202 ir_node *get_Mux_true(const ir_node *node) {
2203 if (node->op == op_Psi) {
2204 assert(get_irn_arity(node) == 3);
2205 return get_Psi_val(node, 0);
2207 assert(node->op == op_Mux);
2211 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2212 if (node->op == op_Psi) {
2213 assert(get_irn_arity(node) == 3);
2214 set_Psi_val(node, 0, ir_true);
2216 assert(node->op == op_Mux);
2217 node->in[3] = ir_true;
2222 ir_node *get_Psi_cond(const ir_node *node, int pos) {
2223 assert(node->op == op_Psi);
2224 assert(pos < get_Psi_n_conds(node));
2225 return get_irn_n(node, 2 * pos);
2228 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2229 assert(node->op == op_Psi);
2230 assert(pos < get_Psi_n_conds(node));
2231 set_irn_n(node, 2 * pos, cond);
2234 ir_node *get_Psi_val(const ir_node *node, int pos) {
2235 assert(node->op == op_Psi);
2236 assert(pos < get_Psi_n_conds(node));
2237 return get_irn_n(node, 2 * pos + 1);
2240 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2241 assert(node->op == op_Psi);
2242 assert(pos < get_Psi_n_conds(node));
2243 set_irn_n(node, 2 * pos + 1, val);
2246 ir_node *get_Psi_default(const ir_node *node) {
2247 int def_pos = get_irn_arity(node) - 1;
2248 assert(node->op == op_Psi);
2249 return get_irn_n(node, def_pos);
2252 void set_Psi_default(ir_node *node, ir_node *val) {
2253 int def_pos = get_irn_arity(node);
2254 assert(node->op == op_Psi);
2255 set_irn_n(node, def_pos, val);
2258 int (get_Psi_n_conds)(const ir_node *node) {
2259 return _get_Psi_n_conds(node);
2263 ir_node *get_CopyB_mem(const ir_node *node) {
2264 assert(node->op == op_CopyB);
2265 return get_irn_n(node, 0);
2268 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2269 assert(node->op == op_CopyB);
2270 set_irn_n(node, 0, mem);
2273 ir_node *get_CopyB_dst(const ir_node *node) {
2274 assert(node->op == op_CopyB);
2275 return get_irn_n(node, 1);
2278 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2279 assert(node->op == op_CopyB);
2280 set_irn_n(node, 1, dst);
2283 ir_node *get_CopyB_src(const ir_node *node) {
2284 assert(node->op == op_CopyB);
2285 return get_irn_n(node, 2);
2288 void set_CopyB_src(ir_node *node, ir_node *src) {
2289 assert(node->op == op_CopyB);
2290 set_irn_n(node, 2, src);
2293 ir_type *get_CopyB_type(ir_node *node) {
2294 assert(node->op == op_CopyB);
2295 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2298 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2299 assert(node->op == op_CopyB && data_type);
2300 node->attr.copyb.data_type = data_type;
2305 get_InstOf_type(ir_node *node) {
2306 assert(node->op == op_InstOf);
2307 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2311 set_InstOf_type(ir_node *node, ir_type *type) {
2312 assert(node->op == op_InstOf);
2313 node->attr.instof.type = type;
2317 get_InstOf_store(const ir_node *node) {
2318 assert(node->op == op_InstOf);
2319 return get_irn_n(node, 0);
2323 set_InstOf_store(ir_node *node, ir_node *obj) {
2324 assert(node->op == op_InstOf);
2325 set_irn_n(node, 0, obj);
2329 get_InstOf_obj(const ir_node *node) {
2330 assert(node->op == op_InstOf);
2331 return get_irn_n(node, 1);
2335 set_InstOf_obj(ir_node *node, ir_node *obj) {
2336 assert(node->op == op_InstOf);
2337 set_irn_n(node, 1, obj);
2340 /* Returns the memory input of a Raise operation. */
2342 get_Raise_mem(const ir_node *node) {
2343 assert(node->op == op_Raise);
2344 return get_irn_n(node, 0);
2348 set_Raise_mem(ir_node *node, ir_node *mem) {
2349 assert(node->op == op_Raise);
2350 set_irn_n(node, 0, mem);
2354 get_Raise_exo_ptr(const ir_node *node) {
2355 assert(node->op == op_Raise);
2356 return get_irn_n(node, 1);
2360 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2361 assert(node->op == op_Raise);
2362 set_irn_n(node, 1, exo_ptr);
2367 /* Returns the memory input of a Bound operation. */
2368 ir_node *get_Bound_mem(const ir_node *bound) {
2369 assert(bound->op == op_Bound);
2370 return get_irn_n(bound, 0);
2373 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2374 assert(bound->op == op_Bound);
2375 set_irn_n(bound, 0, mem);
2378 /* Returns the index input of a Bound operation. */
2379 ir_node *get_Bound_index(const ir_node *bound) {
2380 assert(bound->op == op_Bound);
2381 return get_irn_n(bound, 1);
2384 void set_Bound_index(ir_node *bound, ir_node *idx) {
2385 assert(bound->op == op_Bound);
2386 set_irn_n(bound, 1, idx);
2389 /* Returns the lower bound input of a Bound operation. */
2390 ir_node *get_Bound_lower(const ir_node *bound) {
2391 assert(bound->op == op_Bound);
2392 return get_irn_n(bound, 2);
2395 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2396 assert(bound->op == op_Bound);
2397 set_irn_n(bound, 2, lower);
2400 /* Returns the upper bound input of a Bound operation. */
2401 ir_node *get_Bound_upper(const ir_node *bound) {
2402 assert(bound->op == op_Bound);
2403 return get_irn_n(bound, 3);
2406 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2407 assert(bound->op == op_Bound);
2408 set_irn_n(bound, 3, upper);
2411 /* Return the operand of a Pin node. */
2412 ir_node *get_Pin_op(const ir_node *pin) {
2413 assert(pin->op == op_Pin);
2414 return get_irn_n(pin, 0);
2417 void set_Pin_op(ir_node *pin, ir_node *node) {
2418 assert(pin->op == op_Pin);
2419 set_irn_n(pin, 0, node);
2422 /* Return the assembler text of an ASM pseudo node. */
2423 ident *get_ASM_text(const ir_node *node) {
2424 assert(node->op == op_ASM);
2425 return node->attr.assem.asm_text;
2428 /* Return the number of input constraints for an ASM node. */
2429 int get_ASM_n_input_constraints(const ir_node *node) {
2430 assert(node->op == op_ASM);
2431 return ARR_LEN(node->attr.assem.inputs);
2434 /* Return the input constraints for an ASM node. This is a flexible array. */
2435 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2436 assert(node->op == op_ASM);
2437 return node->attr.assem.inputs;
2440 /* Return the number of output constraints for an ASM node. */
2441 int get_ASM_n_output_constraints(const ir_node *node) {
2442 assert(node->op == op_ASM);
2443 return ARR_LEN(node->attr.assem.outputs);
2446 /* Return the output constraints for an ASM node. */
2447 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2448 assert(node->op == op_ASM);
2449 return node->attr.assem.outputs;
2452 /* Return the number of clobbered registers for an ASM node. */
2453 int get_ASM_n_clobbers(const ir_node *node) {
2454 assert(node->op == op_ASM);
2455 return ARR_LEN(node->attr.assem.clobber);
2458 /* Return the list of clobbered registers for an ASM node. */
2459 ident **get_ASM_clobbers(const ir_node *node) {
2460 assert(node->op == op_ASM);
2461 return node->attr.assem.clobber;
2464 /* returns the graph of a node */
2466 get_irn_irg(const ir_node *node) {
2468 * Do not use get_nodes_Block() here, because this
2469 * will check the pinned state.
2470 * However even a 'wrong' block is always in the proper
2473 if (! is_Block(node))
2474 node = get_irn_n(node, -1);
2475 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2476 node = get_irn_n(node, -1);
2477 assert(get_irn_op(node) == op_Block);
2478 return node->attr.block.irg;
2482 /*----------------------------------------------------------------*/
2483 /* Auxiliary routines */
2484 /*----------------------------------------------------------------*/
2487 skip_Proj(ir_node *node) {
2488 /* don't assert node !!! */
2493 node = get_Proj_pred(node);
2499 skip_Proj_const(const ir_node *node) {
2500 /* don't assert node !!! */
2505 node = get_Proj_pred(node);
2511 skip_Tuple(ir_node *node) {
2515 if (!get_opt_normalize()) return node;
2518 if (get_irn_op(node) == op_Proj) {
2519 pred = get_Proj_pred(node);
2520 op = get_irn_op(pred);
2523 * Looks strange but calls get_irn_op() only once
2524 * in most often cases.
2526 if (op == op_Proj) { /* nested Tuple ? */
2527 pred = skip_Tuple(pred);
2528 op = get_irn_op(pred);
2530 if (op == op_Tuple) {
2531 node = get_Tuple_pred(pred, get_Proj_proj(node));
2534 } else if (op == op_Tuple) {
2535 node = get_Tuple_pred(pred, get_Proj_proj(node));
2542 /* returns operand of node if node is a Cast */
2543 ir_node *skip_Cast(ir_node *node) {
2544 if (get_irn_op(node) == op_Cast)
2545 return get_Cast_op(node);
2549 /* returns operand of node if node is a Confirm */
2550 ir_node *skip_Confirm(ir_node *node) {
2551 if (get_irn_op(node) == op_Confirm)
2552 return get_Confirm_value(node);
2556 /* skip all high-level ops */
2557 ir_node *skip_HighLevel_ops(ir_node *node) {
2558 while (is_op_highlevel(get_irn_op(node))) {
2559 node = get_irn_n(node, 0);
2565 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2566 * than any other approach, as Id chains are resolved and all point to the real node, or
2567 * all id's are self loops.
2569 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2570 * a little bit "hand optimized".
2572 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2575 skip_Id(ir_node *node) {
2577 /* don't assert node !!! */
2579 if (!node || (node->op != op_Id)) return node;
2581 /* Don't use get_Id_pred(): We get into an endless loop for
2582 self-referencing Ids. */
2583 pred = node->in[0+1];
2585 if (pred->op != op_Id) return pred;
2587 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2588 ir_node *rem_pred, *res;
2590 if (pred->op != op_Id) return pred; /* shortcut */
2593 assert(get_irn_arity (node) > 0);
2595 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2596 res = skip_Id(rem_pred);
2597 if (res->op == op_Id) /* self-loop */ return node;
2599 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2606 void skip_Id_and_store(ir_node **node) {
2609 if (!n || (n->op != op_Id)) return;
2611 /* Don't use get_Id_pred(): We get into an endless loop for
2612 self-referencing Ids. */
2617 (is_Bad)(const ir_node *node) {
2618 return _is_Bad(node);
2622 (is_NoMem)(const ir_node *node) {
2623 return _is_NoMem(node);
2627 (is_Minus)(const ir_node *node) {
2628 return _is_Minus(node);
2632 (is_Mod)(const ir_node *node) {
2633 return _is_Mod(node);
2637 (is_Div)(const ir_node *node) {
2638 return _is_Div(node);
2642 (is_DivMod)(const ir_node *node) {
2643 return _is_DivMod(node);
2647 (is_Quot)(const ir_node *node) {
2648 return _is_Quot(node);
2652 (is_Add)(const ir_node *node) {
2653 return _is_Add(node);
2657 (is_And)(const ir_node *node) {
2658 return _is_And(node);
2662 (is_Or)(const ir_node *node) {
2663 return _is_Or(node);
2667 (is_Eor)(const ir_node *node) {
2668 return _is_Eor(node);
2672 (is_Sub)(const ir_node *node) {
2673 return _is_Sub(node);
2677 (is_Shl)(const ir_node *node) {
2678 return _is_Shl(node);
2682 (is_Shr)(const ir_node *node) {
2683 return _is_Shr(node);
2687 (is_Shrs)(const ir_node *node) {
2688 return _is_Shrs(node);
2692 (is_Rot)(const ir_node *node) {
2693 return _is_Rot(node);
2697 (is_Not)(const ir_node *node) {
2698 return _is_Not(node);
2702 (is_Psi)(const ir_node *node) {
2703 return _is_Psi(node);
2707 (is_Tuple)(const ir_node *node) {
2708 return _is_Tuple(node);
2712 (is_Start)(const ir_node *node) {
2713 return _is_Start(node);
2717 (is_End)(const ir_node *node) {
2718 return _is_End(node);
2722 (is_Const)(const ir_node *node) {
2723 return _is_Const(node);
2727 (is_Conv)(const ir_node *node) {
2728 return _is_Conv(node);
2732 (is_strictConv)(const ir_node *node) {
2733 return _is_strictConv(node);
2737 (is_Cast)(const ir_node *node) {
2738 return _is_Cast(node);
2742 (is_no_Block)(const ir_node *node) {
2743 return _is_no_Block(node);
2747 (is_Block)(const ir_node *node) {
2748 return _is_Block(node);
2751 /* returns true if node is an Unknown node. */
2753 (is_Unknown)(const ir_node *node) {
2754 return _is_Unknown(node);
2757 /* returns true if node is a Return node. */
2759 (is_Return)(const ir_node *node) {
2760 return _is_Return(node);
2763 /* returns true if node is a Call node. */
2765 (is_Call)(const ir_node *node) {
2766 return _is_Call(node);
2769 /* returns true if node is a Sel node. */
2771 (is_Sel)(const ir_node *node) {
2772 return _is_Sel(node);
2775 /* returns true if node is a Mux node or a Psi with only one condition. */
2777 (is_Mux)(const ir_node *node) {
2778 return _is_Mux(node);
2781 /* returns true if node is a Load node. */
2783 (is_Load)(const ir_node *node) {
2784 return _is_Load(node);
2787 /* returns true if node is a Load node. */
2789 (is_Store)(const ir_node *node) {
2790 return _is_Store(node);
2793 /* returns true if node is a Sync node. */
2795 (is_Sync)(const ir_node *node) {
2796 return _is_Sync(node);
2799 /* Returns true if node is a Confirm node. */
2801 (is_Confirm)(const ir_node *node) {
2802 return _is_Confirm(node);
2805 /* Returns true if node is a Pin node. */
2807 (is_Pin)(const ir_node *node) {
2808 return _is_Pin(node);
2811 /* Returns true if node is a SymConst node. */
2813 (is_SymConst)(const ir_node *node) {
2814 return _is_SymConst(node);
2817 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2819 (is_SymConst_addr_ent)(const ir_node *node) {
2820 return _is_SymConst_addr_ent(node);
2823 /* Returns true if node is a Cond node. */
2825 (is_Cond)(const ir_node *node) {
2826 return _is_Cond(node);
2830 (is_CopyB)(const ir_node *node) {
2831 return _is_CopyB(node);
2834 /* returns true if node is a Cmp node. */
2836 (is_Cmp)(const ir_node *node) {
2837 return _is_Cmp(node);
2840 /* returns true if node is an Alloc node. */
2842 (is_Alloc)(const ir_node *node) {
2843 return _is_Alloc(node);
2846 /* returns true if a node is a Jmp node. */
2848 (is_Jmp)(const ir_node *node) {
2849 return _is_Jmp(node);
2852 /* returns true if a node is a Raise node. */
2854 (is_Raise)(const ir_node *node) {
2855 return _is_Raise(node);
2858 /* returns true if a node is an ASM node. */
2860 (is_ASM)(const ir_node *node) {
2861 return _is_ASM(node);
2865 (is_Proj)(const ir_node *node) {
2867 return node->op == op_Proj ||
2868 (!get_interprocedural_view() && node->op == op_Filter);
2871 /* Returns true if the operation manipulates control flow. */
2872 int is_cfop(const ir_node *node) {
2873 return is_op_cfopcode(get_irn_op(node));
2876 /* Returns true if the operation manipulates interprocedural control flow:
2877 CallBegin, EndReg, EndExcept */
2878 int is_ip_cfop(const ir_node *node) {
2879 return is_ip_cfopcode(get_irn_op(node));
2882 /* Returns true if the operation can change the control flow because
2885 is_fragile_op(const ir_node *node) {
2886 return is_op_fragile(get_irn_op(node));
2889 /* Returns the memory operand of fragile operations. */
2890 ir_node *get_fragile_op_mem(ir_node *node) {
2891 assert(node && is_fragile_op(node));
2893 switch (get_irn_opcode(node)) {
2904 return get_irn_n(node, pn_Generic_M_regular);
2909 assert(0 && "should not be reached");
2914 /* Returns the result mode of a Div operation. */
2915 ir_mode *get_divop_resmod(const ir_node *node) {
2916 switch (get_irn_opcode(node)) {
2917 case iro_Quot : return get_Quot_resmode(node);
2918 case iro_DivMod: return get_DivMod_resmode(node);
2919 case iro_Div : return get_Div_resmode(node);
2920 case iro_Mod : return get_Mod_resmode(node);
2922 assert(0 && "should not be reached");
2927 /* Returns true if the operation is a forking control flow operation. */
2928 int (is_irn_forking)(const ir_node *node) {
2929 return _is_irn_forking(node);
2932 /* Return the type associated with the value produced by n
2933 * if the node remarks this type as it is the case for
2934 * Cast, Const, SymConst and some Proj nodes. */
2935 ir_type *(get_irn_type)(ir_node *node) {
2936 return _get_irn_type(node);
2939 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2941 ir_type *(get_irn_type_attr)(ir_node *node) {
2942 return _get_irn_type_attr(node);
2945 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2946 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2947 return _get_irn_entity_attr(node);
2950 /* Returns non-zero for constant-like nodes. */
2951 int (is_irn_constlike)(const ir_node *node) {
2952 return _is_irn_constlike(node);
2956 * Returns non-zero for nodes that are allowed to have keep-alives and
2957 * are neither Block nor PhiM.
2959 int (is_irn_keep)(const ir_node *node) {
2960 return _is_irn_keep(node);
2964 * Returns non-zero for nodes that are always placed in the start block.
2966 int (is_irn_start_block_placed)(const ir_node *node) {
2967 return _is_irn_start_block_placed(node);
2970 /* Returns non-zero for nodes that are machine operations. */
2971 int (is_irn_machine_op)(const ir_node *node) {
2972 return _is_irn_machine_op(node);
2975 /* Returns non-zero for nodes that are machine operands. */
2976 int (is_irn_machine_operand)(const ir_node *node) {
2977 return _is_irn_machine_operand(node);
2980 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2981 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2982 return _is_irn_machine_user(node, n);
2986 /* Gets the string representation of the jump prediction .*/
2987 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2990 case COND_JMP_PRED_NONE: return "no prediction";
2991 case COND_JMP_PRED_TRUE: return "true taken";
2992 case COND_JMP_PRED_FALSE: return "false taken";
2996 /* Returns the conditional jump prediction of a Cond node. */
2997 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2998 return _get_Cond_jmp_pred(cond);
3001 /* Sets a new conditional jump prediction. */
3002 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
3003 _set_Cond_jmp_pred(cond, pred);
3006 /** the get_type operation must be always implemented and return a firm type */
3007 static ir_type *get_Default_type(ir_node *n) {
3009 return get_unknown_type();
3012 /* Sets the get_type operation for an ir_op_ops. */
3013 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3015 case iro_Const: ops->get_type = get_Const_type; break;
3016 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3017 case iro_Cast: ops->get_type = get_Cast_type; break;
3018 case iro_Proj: ops->get_type = get_Proj_type; break;
3020 /* not allowed to be NULL */
3021 if (! ops->get_type)
3022 ops->get_type = get_Default_type;
3028 /** Return the attribute type of a SymConst node if exists */
3029 static ir_type *get_SymConst_attr_type(ir_node *self) {
3030 symconst_kind kind = get_SymConst_kind(self);
3031 if (SYMCONST_HAS_TYPE(kind))
3032 return get_SymConst_type(self);
3036 /** Return the attribute entity of a SymConst node if exists */
3037 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3038 symconst_kind kind = get_SymConst_kind(self);
3039 if (SYMCONST_HAS_ENT(kind))
3040 return get_SymConst_entity(self);
3044 /** the get_type_attr operation must be always implemented */
3045 static ir_type *get_Null_type(ir_node *n) {
3047 return firm_unknown_type;
3050 /* Sets the get_type operation for an ir_op_ops. */
3051 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3053 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3054 case iro_Call: ops->get_type_attr = get_Call_type; break;
3055 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3056 case iro_Free: ops->get_type_attr = get_Free_type; break;
3057 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3059 /* not allowed to be NULL */
3060 if (! ops->get_type_attr)
3061 ops->get_type_attr = get_Null_type;
3067 /** the get_entity_attr operation must be always implemented */
3068 static ir_entity *get_Null_ent(ir_node *n) {
3073 /* Sets the get_type operation for an ir_op_ops. */
3074 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3076 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3077 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3079 /* not allowed to be NULL */
3080 if (! ops->get_entity_attr)
3081 ops->get_entity_attr = get_Null_ent;
3087 /* Sets the debug information of a node. */
3088 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3089 _set_irn_dbg_info(n, db);
3093 * Returns the debug information of an node.
3095 * @param n The node.
3097 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3098 return _get_irn_dbg_info(n);
3103 #ifdef DEBUG_libfirm
3104 void dump_irn(const ir_node *n) {
3105 int i, arity = get_irn_arity(n);
3106 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
3108 ir_node *pred = get_irn_n(n, -1);
3109 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3110 get_irn_node_nr(pred), (void *)pred);
3112 printf(" preds: \n");
3113 for (i = 0; i < arity; ++i) {
3114 ir_node *pred = get_irn_n(n, i);
3115 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3116 get_irn_node_nr(pred), (void *)pred);
3120 #else /* DEBUG_libfirm */
3121 void dump_irn(const ir_node *n) { (void) n; }
3122 #endif /* DEBUG_libfirm */