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 < sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0]));
68 return pnc_name_arr[pnc];
72 * Calculates the negated (Complement(R)) pnc condition.
74 int get_negated_pnc(int pnc, ir_mode *mode) {
77 /* do NOT add the Uo bit for non-floating point values */
78 if (! mode_is_float(mode))
84 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
86 get_inversed_pnc(int pnc) {
87 int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
88 int lesser = pnc & pn_Cmp_Lt;
89 int 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 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) { return NULL; }
526 void set_irn_abst_value(ir_node *n, struct abstval *os) {}
527 struct section *firm_get_irn_section(ir_node *n) { return NULL; }
528 void firm_set_irn_section(ir_node *n, struct section *s) {}
529 #endif /* DO_HEAPANALYSIS */
532 /* Outputs a unique number for this node */
533 long get_irn_node_nr(const ir_node *node) {
536 return node->node_nr;
538 return (long)PTR_TO_INT(node);
543 get_irn_const_attr(ir_node *node) {
544 assert(node->op == op_Const);
545 return node->attr.con;
549 get_irn_proj_attr(ir_node *node) {
550 assert(node->op == op_Proj);
551 return node->attr.proj;
555 get_irn_alloc_attr(ir_node *node) {
556 assert(node->op == op_Alloc);
557 return node->attr.alloc;
561 get_irn_free_attr(ir_node *node) {
562 assert(node->op == op_Free);
563 return node->attr.free;
567 get_irn_symconst_attr(ir_node *node) {
568 assert(node->op == op_SymConst);
569 return node->attr.symc;
573 get_irn_call_attr(ir_node *node) {
574 assert(node->op == op_Call);
575 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
579 get_irn_sel_attr(ir_node *node) {
580 assert(node->op == op_Sel);
581 return node->attr.sel;
585 get_irn_phi0_attr(ir_node *node) {
586 assert(is_Phi0(node));
587 return node->attr.phi0.pos;
591 get_irn_block_attr(ir_node *node) {
592 assert(node->op == op_Block);
593 return node->attr.block;
597 get_irn_load_attr(ir_node *node) {
598 assert(node->op == op_Load);
599 return node->attr.load;
603 get_irn_store_attr(ir_node *node) {
604 assert(node->op == op_Store);
605 return node->attr.store;
609 get_irn_except_attr(ir_node *node) {
610 assert(node->op == op_Div || node->op == op_Quot ||
611 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
612 return node->attr.except;
615 void *(get_irn_generic_attr)(ir_node *node) {
616 assert(is_ir_node(node));
617 return _get_irn_generic_attr(node);
620 const void *(get_irn_generic_attr_const)(const ir_node *node) {
621 assert(is_ir_node(node));
622 return _get_irn_generic_attr_const(node);
625 unsigned (get_irn_idx)(const ir_node *node) {
626 assert(is_ir_node(node));
627 return _get_irn_idx(node);
630 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
632 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
633 if (get_irn_n(node, i) == arg)
639 /** manipulate fields of individual nodes **/
641 /* this works for all except Block */
643 get_nodes_block(const ir_node *node) {
644 assert(node->op != op_Block);
645 assert(is_irn_pinned_in_irg(node) && "block info may be incorrect");
646 return get_irn_n(node, -1);
650 set_nodes_block(ir_node *node, ir_node *block) {
651 assert(node->op != op_Block);
652 set_irn_n(node, -1, block);
655 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
656 * from Start. If so returns frame type, else Null. */
657 ir_type *is_frame_pointer(ir_node *n) {
658 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
659 ir_node *start = get_Proj_pred(n);
660 if (get_irn_op(start) == op_Start) {
661 return get_irg_frame_type(get_irn_irg(start));
667 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
668 * from Start. If so returns global type, else Null. */
669 ir_type *is_globals_pointer(ir_node *n) {
670 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
671 ir_node *start = get_Proj_pred(n);
672 if (get_irn_op(start) == op_Start) {
673 return get_glob_type();
679 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
680 * from Start. If so returns tls type, else Null. */
681 ir_type *is_tls_pointer(ir_node *n) {
682 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
683 ir_node *start = get_Proj_pred(n);
684 if (get_irn_op(start) == op_Start) {
685 return get_tls_type();
691 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
692 * from Start. If so returns 1, else 0. */
693 int is_value_arg_pointer(ir_node *n) {
694 if ((get_irn_op(n) == op_Proj) &&
695 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
696 (get_irn_op(get_Proj_pred(n)) == op_Start))
701 /* Returns an array with the predecessors of the Block. Depending on
702 the implementation of the graph data structure this can be a copy of
703 the internal representation of predecessors as well as the internal
704 array itself. Therefore writing to this array might obstruct the ir. */
706 get_Block_cfgpred_arr(ir_node *node) {
707 assert((node->op == op_Block));
708 return (ir_node **)&(get_irn_in(node)[1]);
712 (get_Block_n_cfgpreds)(const ir_node *node) {
713 return _get_Block_n_cfgpreds(node);
717 (get_Block_cfgpred)(ir_node *node, int pos) {
718 return _get_Block_cfgpred(node, pos);
722 set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
723 assert(node->op == op_Block);
724 set_irn_n(node, pos, pred);
728 (get_Block_cfgpred_block)(ir_node *node, int pos) {
729 return _get_Block_cfgpred_block(node, pos);
733 get_Block_matured(ir_node *node) {
734 assert(node->op == op_Block);
735 return (int)node->attr.block.is_matured;
739 set_Block_matured(ir_node *node, int matured) {
740 assert(node->op == op_Block);
741 node->attr.block.is_matured = matured;
745 (get_Block_block_visited)(const ir_node *node) {
746 return _get_Block_block_visited(node);
750 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
751 _set_Block_block_visited(node, visit);
754 /* For this current_ir_graph must be set. */
756 (mark_Block_block_visited)(ir_node *node) {
757 _mark_Block_block_visited(node);
761 (Block_not_block_visited)(const ir_node *node) {
762 return _Block_not_block_visited(node);
766 (Block_block_visited)(const ir_node *node) {
767 return _Block_block_visited(node);
771 get_Block_graph_arr (ir_node *node, int pos) {
772 assert(node->op == op_Block);
773 return node->attr.block.graph_arr[pos+1];
777 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
778 assert(node->op == op_Block);
779 node->attr.block.graph_arr[pos+1] = value;
782 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
783 assert(node->op == op_Block);
784 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
785 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
786 node->attr.block.in_cg[0] = NULL;
787 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
789 /* Fix backedge array. fix_backedges() operates depending on
790 interprocedural_view. */
791 int ipv = get_interprocedural_view();
792 set_interprocedural_view(1);
793 fix_backedges(current_ir_graph->obst, node);
794 set_interprocedural_view(ipv);
797 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
800 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
801 assert(node->op == op_Block &&
802 node->attr.block.in_cg &&
803 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
804 node->attr.block.in_cg[pos + 1] = pred;
807 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
808 assert(node->op == op_Block);
809 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
812 int get_Block_cg_n_cfgpreds(ir_node *node) {
813 assert(node->op == op_Block);
814 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
817 ir_node *get_Block_cg_cfgpred(ir_node *node, int pos) {
818 assert(node->op == op_Block && node->attr.block.in_cg);
819 return node->attr.block.in_cg[pos + 1];
822 void remove_Block_cg_cfgpred_arr(ir_node *node) {
823 assert(node->op == op_Block);
824 node->attr.block.in_cg = NULL;
827 ir_node *(set_Block_dead)(ir_node *block) {
828 return _set_Block_dead(block);
831 int (is_Block_dead)(const ir_node *block) {
832 return _is_Block_dead(block);
835 ir_extblk *get_Block_extbb(const ir_node *block) {
837 assert(is_Block(block));
838 res = block->attr.block.extblk;
839 assert(res == NULL || is_ir_extbb(res));
843 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
844 assert(is_Block(block));
845 assert(extblk == NULL || is_ir_extbb(extblk));
846 block->attr.block.extblk = extblk;
849 /* returns the macro block header of a block. */
850 ir_node *get_Block_MacroBlock(const ir_node *block) {
851 assert(is_Block(block));
852 return get_irn_n(block, -1);
855 /* returns the graph of a Block. */
856 ir_graph *get_Block_irg(const ir_node *block) {
857 assert(is_Block(block));
858 return block->attr.block.irg;
862 get_End_n_keepalives(ir_node *end) {
863 assert(end->op == op_End);
864 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
868 get_End_keepalive(ir_node *end, int pos) {
869 assert(end->op == op_End);
870 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
874 add_End_keepalive(ir_node *end, ir_node *ka) {
875 assert(end->op == op_End);
876 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
881 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
882 assert(end->op == op_End);
883 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
886 /* Set new keep-alives */
887 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
889 ir_graph *irg = get_irn_irg(end);
891 /* notify that edges are deleted */
892 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
893 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
895 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
897 for (i = 0; i < n; ++i) {
898 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
899 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
903 /* Set new keep-alives from old keep-alives, skipping irn */
904 void remove_End_keepalive(ir_node *end, ir_node *irn) {
905 int n = get_End_n_keepalives(end);
909 NEW_ARR_A(ir_node *, in, n);
911 for (idx = i = 0; i < n; ++i) {
912 ir_node *old_ka = get_End_keepalive(end, i);
919 /* set new keep-alives */
920 set_End_keepalives(end, idx, in);
924 free_End (ir_node *end) {
925 assert(end->op == op_End);
928 end->in = NULL; /* @@@ make sure we get an error if we use the
929 in array afterwards ... */
932 /* Return the target address of an IJmp */
933 ir_node *get_IJmp_target(ir_node *ijmp) {
934 assert(ijmp->op == op_IJmp);
935 return get_irn_n(ijmp, 0);
938 /** Sets the target address of an IJmp */
939 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
940 assert(ijmp->op == op_IJmp);
941 set_irn_n(ijmp, 0, tgt);
945 > Implementing the case construct (which is where the constant Proj node is
946 > important) involves far more than simply determining the constant values.
947 > We could argue that this is more properly a function of the translator from
948 > Firm to the target machine. That could be done if there was some way of
949 > projecting "default" out of the Cond node.
950 I know it's complicated.
951 Basically there are two proglems:
952 - determining the gaps between the projs
953 - determining the biggest case constant to know the proj number for
955 I see several solutions:
956 1. Introduce a ProjDefault node. Solves both problems.
957 This means to extend all optimizations executed during construction.
958 2. Give the Cond node for switch two flavors:
959 a) there are no gaps in the projs (existing flavor)
960 b) gaps may exist, default proj is still the Proj with the largest
961 projection number. This covers also the gaps.
962 3. Fix the semantic of the Cond to that of 2b)
964 Solution 2 seems to be the best:
965 Computing the gaps in the Firm representation is not too hard, i.e.,
966 libFIRM can implement a routine that transforms between the two
967 flavours. This is also possible for 1) but 2) does not require to
968 change any existing optimization.
969 Further it should be far simpler to determine the biggest constant than
971 I don't want to choose 3) as 2a) seems to have advantages for
972 dataflow analysis and 3) does not allow to convert the representation to
976 get_Cond_selector(ir_node *node) {
977 assert(node->op == op_Cond);
978 return get_irn_n(node, 0);
982 set_Cond_selector(ir_node *node, ir_node *selector) {
983 assert(node->op == op_Cond);
984 set_irn_n(node, 0, selector);
988 get_Cond_kind(ir_node *node) {
989 assert(node->op == op_Cond);
990 return node->attr.cond.kind;
994 set_Cond_kind(ir_node *node, cond_kind kind) {
995 assert(node->op == op_Cond);
996 node->attr.cond.kind = kind;
1000 get_Cond_defaultProj(ir_node *node) {
1001 assert(node->op == op_Cond);
1002 return node->attr.cond.default_proj;
1006 get_Return_mem(ir_node *node) {
1007 assert(node->op == op_Return);
1008 return get_irn_n(node, 0);
1012 set_Return_mem(ir_node *node, ir_node *mem) {
1013 assert(node->op == op_Return);
1014 set_irn_n(node, 0, mem);
1018 get_Return_n_ress(ir_node *node) {
1019 assert(node->op == op_Return);
1020 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1024 get_Return_res_arr (ir_node *node) {
1025 assert((node->op == op_Return));
1026 if (get_Return_n_ress(node) > 0)
1027 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1034 set_Return_n_res(ir_node *node, int results) {
1035 assert(node->op == op_Return);
1040 get_Return_res(ir_node *node, int pos) {
1041 assert(node->op == op_Return);
1042 assert(get_Return_n_ress(node) > pos);
1043 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1047 set_Return_res(ir_node *node, int pos, ir_node *res){
1048 assert(node->op == op_Return);
1049 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1052 tarval *(get_Const_tarval)(const ir_node *node) {
1053 return _get_Const_tarval(node);
1057 set_Const_tarval(ir_node *node, tarval *con) {
1058 assert(node->op == op_Const);
1059 node->attr.con.tv = con;
1062 cnst_classify_t (classify_Const)(ir_node *node) {
1063 return _classify_Const(node);
1067 /* The source language type. Must be an atomic type. Mode of type must
1068 be mode of node. For tarvals from entities type must be pointer to
1071 get_Const_type(ir_node *node) {
1072 assert(node->op == op_Const);
1073 return node->attr.con.tp;
1077 set_Const_type(ir_node *node, ir_type *tp) {
1078 assert(node->op == op_Const);
1079 if (tp != firm_unknown_type) {
1080 assert(is_atomic_type(tp));
1081 assert(get_type_mode(tp) == get_irn_mode(node));
1083 node->attr.con.tp = tp;
1088 get_SymConst_kind(const ir_node *node) {
1089 assert(node->op == op_SymConst);
1090 return node->attr.symc.num;
1094 set_SymConst_kind(ir_node *node, symconst_kind num) {
1095 assert(node->op == op_SymConst);
1096 node->attr.symc.num = num;
1100 get_SymConst_type(ir_node *node) {
1101 assert((node->op == op_SymConst) &&
1102 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1103 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1107 set_SymConst_type(ir_node *node, ir_type *tp) {
1108 assert((node->op == op_SymConst) &&
1109 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1110 node->attr.symc.sym.type_p = tp;
1114 get_SymConst_name(const ir_node *node) {
1115 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1116 return node->attr.symc.sym.ident_p;
1120 set_SymConst_name(ir_node *node, ident *name) {
1121 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1122 node->attr.symc.sym.ident_p = name;
1126 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1127 ir_entity *get_SymConst_entity(const ir_node *node) {
1128 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1129 return node->attr.symc.sym.entity_p;
1132 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1133 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1134 node->attr.symc.sym.entity_p = ent;
1137 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1138 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1139 return node->attr.symc.sym.enum_p;
1142 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1143 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1144 node->attr.symc.sym.enum_p = ec;
1147 union symconst_symbol
1148 get_SymConst_symbol(const ir_node *node) {
1149 assert(node->op == op_SymConst);
1150 return node->attr.symc.sym;
1154 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1155 assert(node->op == op_SymConst);
1156 node->attr.symc.sym = sym;
1160 get_SymConst_value_type(ir_node *node) {
1161 assert(node->op == op_SymConst);
1162 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1163 return node->attr.symc.tp;
1167 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1168 assert(node->op == op_SymConst);
1169 node->attr.symc.tp = tp;
1173 get_Sel_mem(ir_node *node) {
1174 assert(node->op == op_Sel);
1175 return get_irn_n(node, 0);
1179 set_Sel_mem(ir_node *node, ir_node *mem) {
1180 assert(node->op == op_Sel);
1181 set_irn_n(node, 0, mem);
1185 get_Sel_ptr(ir_node *node) {
1186 assert(node->op == op_Sel);
1187 return get_irn_n(node, 1);
1191 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1192 assert(node->op == op_Sel);
1193 set_irn_n(node, 1, ptr);
1197 get_Sel_n_indexs(ir_node *node) {
1198 assert(node->op == op_Sel);
1199 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1203 get_Sel_index_arr(ir_node *node) {
1204 assert((node->op == op_Sel));
1205 if (get_Sel_n_indexs(node) > 0)
1206 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1212 get_Sel_index(ir_node *node, int pos) {
1213 assert(node->op == op_Sel);
1214 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1218 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1219 assert(node->op == op_Sel);
1220 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1224 get_Sel_entity(ir_node *node) {
1225 assert(node->op == op_Sel);
1226 return node->attr.sel.ent;
1230 set_Sel_entity(ir_node *node, ir_entity *ent) {
1231 assert(node->op == op_Sel);
1232 node->attr.sel.ent = ent;
1236 /* For unary and binary arithmetic operations the access to the
1237 operands can be factored out. Left is the first, right the
1238 second arithmetic value as listed in tech report 0999-33.
1239 unops are: Minus, Abs, Not, Conv, Cast
1240 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1241 Shr, Shrs, Rotate, Cmp */
1245 get_Call_mem(ir_node *node) {
1246 assert(node->op == op_Call);
1247 return get_irn_n(node, 0);
1251 set_Call_mem(ir_node *node, ir_node *mem) {
1252 assert(node->op == op_Call);
1253 set_irn_n(node, 0, mem);
1257 get_Call_ptr(ir_node *node) {
1258 assert(node->op == op_Call);
1259 return get_irn_n(node, 1);
1263 set_Call_ptr(ir_node *node, ir_node *ptr) {
1264 assert(node->op == op_Call);
1265 set_irn_n(node, 1, ptr);
1269 get_Call_param_arr(ir_node *node) {
1270 assert(node->op == op_Call);
1271 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1275 get_Call_n_params(ir_node *node) {
1276 assert(node->op == op_Call);
1277 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1281 get_Call_arity(ir_node *node) {
1282 assert(node->op == op_Call);
1283 return get_Call_n_params(node);
1287 set_Call_arity(ir_node *node, ir_node *arity) {
1288 assert(node->op == op_Call);
1293 get_Call_param(ir_node *node, int pos) {
1294 assert(node->op == op_Call);
1295 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1299 set_Call_param(ir_node *node, int pos, ir_node *param) {
1300 assert(node->op == op_Call);
1301 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1305 get_Call_type(ir_node *node) {
1306 assert(node->op == op_Call);
1307 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1311 set_Call_type(ir_node *node, ir_type *tp) {
1312 assert(node->op == op_Call);
1313 assert((get_unknown_type() == tp) || is_Method_type(tp));
1314 node->attr.call.cld_tp = tp;
1317 int Call_has_callees(ir_node *node) {
1318 assert(node && node->op == op_Call);
1319 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1320 (node->attr.call.callee_arr != NULL));
1323 int get_Call_n_callees(ir_node * node) {
1324 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1325 return ARR_LEN(node->attr.call.callee_arr);
1328 ir_entity * get_Call_callee(ir_node * node, int pos) {
1329 assert(pos >= 0 && pos < get_Call_n_callees(node));
1330 return node->attr.call.callee_arr[pos];
1333 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1334 assert(node->op == op_Call);
1335 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1336 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1338 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1341 void remove_Call_callee_arr(ir_node * node) {
1342 assert(node->op == op_Call);
1343 node->attr.call.callee_arr = NULL;
1346 ir_node * get_CallBegin_ptr(ir_node *node) {
1347 assert(node->op == op_CallBegin);
1348 return get_irn_n(node, 0);
1351 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1352 assert(node->op == op_CallBegin);
1353 set_irn_n(node, 0, ptr);
1356 ir_node * get_CallBegin_call(ir_node *node) {
1357 assert(node->op == op_CallBegin);
1358 return node->attr.callbegin.call;
1361 void set_CallBegin_call(ir_node *node, ir_node *call) {
1362 assert(node->op == op_CallBegin);
1363 node->attr.callbegin.call = call;
1368 ir_node * get_##OP##_left(const ir_node *node) { \
1369 assert(node->op == op_##OP); \
1370 return get_irn_n(node, node->op->op_index); \
1372 void set_##OP##_left(ir_node *node, ir_node *left) { \
1373 assert(node->op == op_##OP); \
1374 set_irn_n(node, node->op->op_index, left); \
1376 ir_node *get_##OP##_right(const ir_node *node) { \
1377 assert(node->op == op_##OP); \
1378 return get_irn_n(node, node->op->op_index + 1); \
1380 void set_##OP##_right(ir_node *node, ir_node *right) { \
1381 assert(node->op == op_##OP); \
1382 set_irn_n(node, node->op->op_index + 1, right); \
1386 ir_node *get_##OP##_op(const ir_node *node) { \
1387 assert(node->op == op_##OP); \
1388 return get_irn_n(node, node->op->op_index); \
1390 void set_##OP##_op (ir_node *node, ir_node *op) { \
1391 assert(node->op == op_##OP); \
1392 set_irn_n(node, node->op->op_index, op); \
1395 #define BINOP_MEM(OP) \
1399 get_##OP##_mem(ir_node *node) { \
1400 assert(node->op == op_##OP); \
1401 return get_irn_n(node, 0); \
1405 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1406 assert(node->op == op_##OP); \
1407 set_irn_n(node, 0, mem); \
1413 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1414 assert(node->op == op_##OP); \
1415 return node->attr.divmod.res_mode; \
1418 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1419 assert(node->op == op_##OP); \
1420 node->attr.divmod.res_mode = mode; \
1445 int get_Conv_strict(ir_node *node) {
1446 assert(node->op == op_Conv);
1447 return node->attr.conv.strict;
1450 void set_Conv_strict(ir_node *node, int strict_flag) {
1451 assert(node->op == op_Conv);
1452 node->attr.conv.strict = (char)strict_flag;
1456 get_Cast_type(ir_node *node) {
1457 assert(node->op == op_Cast);
1458 return node->attr.cast.totype;
1462 set_Cast_type(ir_node *node, ir_type *to_tp) {
1463 assert(node->op == op_Cast);
1464 node->attr.cast.totype = to_tp;
1468 /* Checks for upcast.
1470 * Returns true if the Cast node casts a class type to a super type.
1472 int is_Cast_upcast(ir_node *node) {
1473 ir_type *totype = get_Cast_type(node);
1474 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1475 ir_graph *myirg = get_irn_irg(node);
1477 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1480 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1481 totype = get_pointer_points_to_type(totype);
1482 fromtype = get_pointer_points_to_type(fromtype);
1487 if (!is_Class_type(totype)) return 0;
1488 return is_SubClass_of(fromtype, totype);
1491 /* Checks for downcast.
1493 * Returns true if the Cast node casts a class type to a sub type.
1495 int is_Cast_downcast(ir_node *node) {
1496 ir_type *totype = get_Cast_type(node);
1497 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1499 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1502 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1503 totype = get_pointer_points_to_type(totype);
1504 fromtype = get_pointer_points_to_type(fromtype);
1509 if (!is_Class_type(totype)) return 0;
1510 return is_SubClass_of(totype, fromtype);
1514 (is_unop)(const ir_node *node) {
1515 return _is_unop(node);
1519 get_unop_op(const ir_node *node) {
1520 if (node->op->opar == oparity_unary)
1521 return get_irn_n(node, node->op->op_index);
1523 assert(node->op->opar == oparity_unary);
1528 set_unop_op(ir_node *node, ir_node *op) {
1529 if (node->op->opar == oparity_unary)
1530 set_irn_n(node, node->op->op_index, op);
1532 assert(node->op->opar == oparity_unary);
1536 (is_binop)(const ir_node *node) {
1537 return _is_binop(node);
1541 get_binop_left(const ir_node *node) {
1542 assert(node->op->opar == oparity_binary);
1543 return get_irn_n(node, node->op->op_index);
1547 set_binop_left(ir_node *node, ir_node *left) {
1548 assert(node->op->opar == oparity_binary);
1549 set_irn_n(node, node->op->op_index, left);
1553 get_binop_right(const ir_node *node) {
1554 assert(node->op->opar == oparity_binary);
1555 return get_irn_n(node, node->op->op_index + 1);
1559 set_binop_right(ir_node *node, ir_node *right) {
1560 assert(node->op->opar == oparity_binary);
1561 set_irn_n(node, node->op->op_index + 1, right);
1564 int is_Phi(const ir_node *n) {
1570 if (op == op_Filter) return get_interprocedural_view();
1573 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1574 (get_irn_arity(n) > 0));
1579 int is_Phi0(const ir_node *n) {
1582 return ((get_irn_op(n) == op_Phi) &&
1583 (get_irn_arity(n) == 0) &&
1584 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1588 get_Phi_preds_arr(ir_node *node) {
1589 assert(node->op == op_Phi);
1590 return (ir_node **)&(get_irn_in(node)[1]);
1594 get_Phi_n_preds(const ir_node *node) {
1595 assert(is_Phi(node) || is_Phi0(node));
1596 return (get_irn_arity(node));
1600 void set_Phi_n_preds(ir_node *node, int n_preds) {
1601 assert(node->op == op_Phi);
1606 get_Phi_pred(const ir_node *node, int pos) {
1607 assert(is_Phi(node) || is_Phi0(node));
1608 return get_irn_n(node, pos);
1612 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1613 assert(is_Phi(node) || is_Phi0(node));
1614 set_irn_n(node, pos, pred);
1618 int is_memop(ir_node *node) {
1619 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1622 ir_node *get_memop_mem(ir_node *node) {
1623 assert(is_memop(node));
1624 return get_irn_n(node, 0);
1627 void set_memop_mem(ir_node *node, ir_node *mem) {
1628 assert(is_memop(node));
1629 set_irn_n(node, 0, mem);
1632 ir_node *get_memop_ptr(ir_node *node) {
1633 assert(is_memop(node));
1634 return get_irn_n(node, 1);
1637 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1638 assert(is_memop(node));
1639 set_irn_n(node, 1, ptr);
1643 get_Load_mem(ir_node *node) {
1644 assert(node->op == op_Load);
1645 return get_irn_n(node, 0);
1649 set_Load_mem(ir_node *node, ir_node *mem) {
1650 assert(node->op == op_Load);
1651 set_irn_n(node, 0, mem);
1655 get_Load_ptr(ir_node *node) {
1656 assert(node->op == op_Load);
1657 return get_irn_n(node, 1);
1661 set_Load_ptr(ir_node *node, ir_node *ptr) {
1662 assert(node->op == op_Load);
1663 set_irn_n(node, 1, ptr);
1667 get_Load_mode(ir_node *node) {
1668 assert(node->op == op_Load);
1669 return node->attr.load.load_mode;
1673 set_Load_mode(ir_node *node, ir_mode *mode) {
1674 assert(node->op == op_Load);
1675 node->attr.load.load_mode = mode;
1679 get_Load_volatility(ir_node *node) {
1680 assert(node->op == op_Load);
1681 return node->attr.load.volatility;
1685 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1686 assert(node->op == op_Load);
1687 node->attr.load.volatility = volatility;
1692 get_Store_mem(ir_node *node) {
1693 assert(node->op == op_Store);
1694 return get_irn_n(node, 0);
1698 set_Store_mem(ir_node *node, ir_node *mem) {
1699 assert(node->op == op_Store);
1700 set_irn_n(node, 0, mem);
1704 get_Store_ptr(ir_node *node) {
1705 assert(node->op == op_Store);
1706 return get_irn_n(node, 1);
1710 set_Store_ptr(ir_node *node, ir_node *ptr) {
1711 assert(node->op == op_Store);
1712 set_irn_n(node, 1, ptr);
1716 get_Store_value(ir_node *node) {
1717 assert(node->op == op_Store);
1718 return get_irn_n(node, 2);
1722 set_Store_value(ir_node *node, ir_node *value) {
1723 assert(node->op == op_Store);
1724 set_irn_n(node, 2, value);
1728 get_Store_volatility(ir_node *node) {
1729 assert(node->op == op_Store);
1730 return node->attr.store.volatility;
1734 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1735 assert(node->op == op_Store);
1736 node->attr.store.volatility = volatility;
1741 get_Alloc_mem(ir_node *node) {
1742 assert(node->op == op_Alloc);
1743 return get_irn_n(node, 0);
1747 set_Alloc_mem(ir_node *node, ir_node *mem) {
1748 assert(node->op == op_Alloc);
1749 set_irn_n(node, 0, mem);
1753 get_Alloc_size(ir_node *node) {
1754 assert(node->op == op_Alloc);
1755 return get_irn_n(node, 1);
1759 set_Alloc_size(ir_node *node, ir_node *size) {
1760 assert(node->op == op_Alloc);
1761 set_irn_n(node, 1, size);
1765 get_Alloc_type(ir_node *node) {
1766 assert(node->op == op_Alloc);
1767 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1771 set_Alloc_type(ir_node *node, ir_type *tp) {
1772 assert(node->op == op_Alloc);
1773 node->attr.alloc.type = tp;
1777 get_Alloc_where(ir_node *node) {
1778 assert(node->op == op_Alloc);
1779 return node->attr.alloc.where;
1783 set_Alloc_where(ir_node *node, where_alloc where) {
1784 assert(node->op == op_Alloc);
1785 node->attr.alloc.where = where;
1790 get_Free_mem(ir_node *node) {
1791 assert(node->op == op_Free);
1792 return get_irn_n(node, 0);
1796 set_Free_mem(ir_node *node, ir_node *mem) {
1797 assert(node->op == op_Free);
1798 set_irn_n(node, 0, mem);
1802 get_Free_ptr(ir_node *node) {
1803 assert(node->op == op_Free);
1804 return get_irn_n(node, 1);
1808 set_Free_ptr(ir_node *node, ir_node *ptr) {
1809 assert(node->op == op_Free);
1810 set_irn_n(node, 1, ptr);
1814 get_Free_size(ir_node *node) {
1815 assert(node->op == op_Free);
1816 return get_irn_n(node, 2);
1820 set_Free_size(ir_node *node, ir_node *size) {
1821 assert(node->op == op_Free);
1822 set_irn_n(node, 2, size);
1826 get_Free_type(ir_node *node) {
1827 assert(node->op == op_Free);
1828 return node->attr.free.type = skip_tid(node->attr.free.type);
1832 set_Free_type(ir_node *node, ir_type *tp) {
1833 assert(node->op == op_Free);
1834 node->attr.free.type = tp;
1838 get_Free_where(ir_node *node) {
1839 assert(node->op == op_Free);
1840 return node->attr.free.where;
1844 set_Free_where(ir_node *node, where_alloc where) {
1845 assert(node->op == op_Free);
1846 node->attr.free.where = where;
1849 ir_node **get_Sync_preds_arr(ir_node *node) {
1850 assert(node->op == op_Sync);
1851 return (ir_node **)&(get_irn_in(node)[1]);
1854 int get_Sync_n_preds(ir_node *node) {
1855 assert(node->op == op_Sync);
1856 return (get_irn_arity(node));
1860 void set_Sync_n_preds(ir_node *node, int n_preds) {
1861 assert(node->op == op_Sync);
1865 ir_node *get_Sync_pred(ir_node *node, int pos) {
1866 assert(node->op == op_Sync);
1867 return get_irn_n(node, pos);
1870 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1871 assert(node->op == op_Sync);
1872 set_irn_n(node, pos, pred);
1875 /* Add a new Sync predecessor */
1876 void add_Sync_pred(ir_node *node, ir_node *pred) {
1877 assert(node->op == op_Sync);
1878 add_irn_n(node, pred);
1881 /* Returns the source language type of a Proj node. */
1882 ir_type *get_Proj_type(ir_node *n) {
1883 ir_type *tp = firm_unknown_type;
1884 ir_node *pred = get_Proj_pred(n);
1886 switch (get_irn_opcode(pred)) {
1889 /* Deal with Start / Call here: we need to know the Proj Nr. */
1890 assert(get_irn_mode(pred) == mode_T);
1891 pred_pred = get_Proj_pred(pred);
1892 if (get_irn_op(pred_pred) == op_Start) {
1893 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1894 tp = get_method_param_type(mtp, get_Proj_proj(n));
1895 } else if (get_irn_op(pred_pred) == op_Call) {
1896 ir_type *mtp = get_Call_type(pred_pred);
1897 tp = get_method_res_type(mtp, get_Proj_proj(n));
1900 case iro_Start: break;
1901 case iro_Call: break;
1903 ir_node *a = get_Load_ptr(pred);
1905 tp = get_entity_type(get_Sel_entity(a));
1914 get_Proj_pred(const ir_node *node) {
1915 assert(is_Proj(node));
1916 return get_irn_n(node, 0);
1920 set_Proj_pred(ir_node *node, ir_node *pred) {
1921 assert(is_Proj(node));
1922 set_irn_n(node, 0, pred);
1926 get_Proj_proj(const ir_node *node) {
1927 assert(is_Proj(node));
1928 if (get_irn_opcode(node) == iro_Proj) {
1929 return node->attr.proj;
1931 assert(get_irn_opcode(node) == iro_Filter);
1932 return node->attr.filter.proj;
1937 set_Proj_proj(ir_node *node, long proj) {
1938 assert(node->op == op_Proj);
1939 node->attr.proj = proj;
1942 long get_VProj_proj(const ir_node *node) {
1943 return node->attr.proj;
1946 void set_VProj_proj(ir_node *node, long value) {
1947 node->attr.proj = value;
1951 get_Tuple_preds_arr(ir_node *node) {
1952 assert(node->op == op_Tuple);
1953 return (ir_node **)&(get_irn_in(node)[1]);
1957 get_Tuple_n_preds(ir_node *node) {
1958 assert(node->op == op_Tuple);
1959 return (get_irn_arity(node));
1964 set_Tuple_n_preds(ir_node *node, int n_preds) {
1965 assert(node->op == op_Tuple);
1970 get_Tuple_pred (ir_node *node, int pos) {
1971 assert(node->op == op_Tuple);
1972 return get_irn_n(node, pos);
1976 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
1977 assert(node->op == op_Tuple);
1978 set_irn_n(node, pos, pred);
1982 get_Id_pred(ir_node *node) {
1983 assert(node->op == op_Id);
1984 return get_irn_n(node, 0);
1988 set_Id_pred(ir_node *node, ir_node *pred) {
1989 assert(node->op == op_Id);
1990 set_irn_n(node, 0, pred);
1993 ir_node *get_Confirm_value(ir_node *node) {
1994 assert(node->op == op_Confirm);
1995 return get_irn_n(node, 0);
1998 void set_Confirm_value(ir_node *node, ir_node *value) {
1999 assert(node->op == op_Confirm);
2000 set_irn_n(node, 0, value);
2003 ir_node *get_Confirm_bound(ir_node *node) {
2004 assert(node->op == op_Confirm);
2005 return get_irn_n(node, 1);
2008 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2009 assert(node->op == op_Confirm);
2010 set_irn_n(node, 0, bound);
2013 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2014 assert(node->op == op_Confirm);
2015 return node->attr.confirm.cmp;
2018 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2019 assert(node->op == op_Confirm);
2020 node->attr.confirm.cmp = cmp;
2024 get_Filter_pred(ir_node *node) {
2025 assert(node->op == op_Filter);
2030 set_Filter_pred(ir_node *node, ir_node *pred) {
2031 assert(node->op == op_Filter);
2036 get_Filter_proj(ir_node *node) {
2037 assert(node->op == op_Filter);
2038 return node->attr.filter.proj;
2042 set_Filter_proj(ir_node *node, long proj) {
2043 assert(node->op == op_Filter);
2044 node->attr.filter.proj = proj;
2047 /* Don't use get_irn_arity, get_irn_n in implementation as access
2048 shall work independent of view!!! */
2049 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2050 assert(node->op == op_Filter);
2051 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2052 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2053 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2054 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2055 node->attr.filter.in_cg[0] = node->in[0];
2057 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2060 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2061 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2062 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2063 node->attr.filter.in_cg[pos + 1] = pred;
2066 int get_Filter_n_cg_preds(ir_node *node) {
2067 assert(node->op == op_Filter && node->attr.filter.in_cg);
2068 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2071 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2073 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2075 arity = ARR_LEN(node->attr.filter.in_cg);
2076 assert(pos < arity - 1);
2077 return node->attr.filter.in_cg[pos + 1];
2081 ir_node *get_Mux_sel(ir_node *node) {
2082 if (node->op == op_Psi) {
2083 assert(get_irn_arity(node) == 3);
2084 return get_Psi_cond(node, 0);
2086 assert(node->op == op_Mux);
2090 void set_Mux_sel(ir_node *node, ir_node *sel) {
2091 if (node->op == op_Psi) {
2092 assert(get_irn_arity(node) == 3);
2093 set_Psi_cond(node, 0, sel);
2095 assert(node->op == op_Mux);
2100 ir_node *get_Mux_false(ir_node *node) {
2101 if (node->op == op_Psi) {
2102 assert(get_irn_arity(node) == 3);
2103 return get_Psi_default(node);
2105 assert(node->op == op_Mux);
2109 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2110 if (node->op == op_Psi) {
2111 assert(get_irn_arity(node) == 3);
2112 set_Psi_default(node, ir_false);
2114 assert(node->op == op_Mux);
2115 node->in[2] = ir_false;
2119 ir_node *get_Mux_true(ir_node *node) {
2120 if (node->op == op_Psi) {
2121 assert(get_irn_arity(node) == 3);
2122 return get_Psi_val(node, 0);
2124 assert(node->op == op_Mux);
2128 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2129 if (node->op == op_Psi) {
2130 assert(get_irn_arity(node) == 3);
2131 set_Psi_val(node, 0, ir_true);
2133 assert(node->op == op_Mux);
2134 node->in[3] = ir_true;
2139 ir_node *get_Psi_cond(ir_node *node, int pos) {
2140 int num_conds = get_Psi_n_conds(node);
2141 assert(node->op == op_Psi);
2142 assert(pos < num_conds);
2143 return get_irn_n(node, 2 * pos);
2146 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2147 int num_conds = get_Psi_n_conds(node);
2148 assert(node->op == op_Psi);
2149 assert(pos < num_conds);
2150 set_irn_n(node, 2 * pos, cond);
2153 ir_node *get_Psi_val(ir_node *node, int pos) {
2154 int num_vals = get_Psi_n_conds(node);
2155 assert(node->op == op_Psi);
2156 assert(pos < num_vals);
2157 return get_irn_n(node, 2 * pos + 1);
2160 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2161 int num_vals = get_Psi_n_conds(node);
2162 assert(node->op == op_Psi);
2163 assert(pos < num_vals);
2164 set_irn_n(node, 2 * pos + 1, val);
2167 ir_node *get_Psi_default(ir_node *node) {
2168 int def_pos = get_irn_arity(node) - 1;
2169 assert(node->op == op_Psi);
2170 return get_irn_n(node, def_pos);
2173 void set_Psi_default(ir_node *node, ir_node *val) {
2174 int def_pos = get_irn_arity(node);
2175 assert(node->op == op_Psi);
2176 set_irn_n(node, def_pos, val);
2179 int (get_Psi_n_conds)(ir_node *node) {
2180 return _get_Psi_n_conds(node);
2184 ir_node *get_CopyB_mem(ir_node *node) {
2185 assert(node->op == op_CopyB);
2186 return get_irn_n(node, 0);
2189 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2190 assert(node->op == op_CopyB);
2191 set_irn_n(node, 0, mem);
2194 ir_node *get_CopyB_dst(ir_node *node) {
2195 assert(node->op == op_CopyB);
2196 return get_irn_n(node, 1);
2199 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2200 assert(node->op == op_CopyB);
2201 set_irn_n(node, 1, dst);
2204 ir_node *get_CopyB_src (ir_node *node) {
2205 assert(node->op == op_CopyB);
2206 return get_irn_n(node, 2);
2209 void set_CopyB_src(ir_node *node, ir_node *src) {
2210 assert(node->op == op_CopyB);
2211 set_irn_n(node, 2, src);
2214 ir_type *get_CopyB_type(ir_node *node) {
2215 assert(node->op == op_CopyB);
2216 return node->attr.copyb.data_type;
2219 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2220 assert(node->op == op_CopyB && data_type);
2221 node->attr.copyb.data_type = data_type;
2226 get_InstOf_type(ir_node *node) {
2227 assert(node->op = op_InstOf);
2228 return node->attr.instof.type;
2232 set_InstOf_type(ir_node *node, ir_type *type) {
2233 assert(node->op = op_InstOf);
2234 node->attr.instof.type = type;
2238 get_InstOf_store(ir_node *node) {
2239 assert(node->op = op_InstOf);
2240 return get_irn_n(node, 0);
2244 set_InstOf_store(ir_node *node, ir_node *obj) {
2245 assert(node->op = op_InstOf);
2246 set_irn_n(node, 0, obj);
2250 get_InstOf_obj(ir_node *node) {
2251 assert(node->op = op_InstOf);
2252 return get_irn_n(node, 1);
2256 set_InstOf_obj(ir_node *node, ir_node *obj) {
2257 assert(node->op = op_InstOf);
2258 set_irn_n(node, 1, obj);
2261 /* Returns the memory input of a Raise operation. */
2263 get_Raise_mem(ir_node *node) {
2264 assert(node->op == op_Raise);
2265 return get_irn_n(node, 0);
2269 set_Raise_mem(ir_node *node, ir_node *mem) {
2270 assert(node->op == op_Raise);
2271 set_irn_n(node, 0, mem);
2275 get_Raise_exo_ptr(ir_node *node) {
2276 assert(node->op == op_Raise);
2277 return get_irn_n(node, 1);
2281 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2282 assert(node->op == op_Raise);
2283 set_irn_n(node, 1, exo_ptr);
2288 /* Returns the memory input of a Bound operation. */
2289 ir_node *get_Bound_mem(ir_node *bound) {
2290 assert(bound->op == op_Bound);
2291 return get_irn_n(bound, 0);
2294 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2295 assert(bound->op == op_Bound);
2296 set_irn_n(bound, 0, mem);
2299 /* Returns the index input of a Bound operation. */
2300 ir_node *get_Bound_index(ir_node *bound) {
2301 assert(bound->op == op_Bound);
2302 return get_irn_n(bound, 1);
2305 void set_Bound_index(ir_node *bound, ir_node *idx) {
2306 assert(bound->op == op_Bound);
2307 set_irn_n(bound, 1, idx);
2310 /* Returns the lower bound input of a Bound operation. */
2311 ir_node *get_Bound_lower(ir_node *bound) {
2312 assert(bound->op == op_Bound);
2313 return get_irn_n(bound, 2);
2316 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2317 assert(bound->op == op_Bound);
2318 set_irn_n(bound, 2, lower);
2321 /* Returns the upper bound input of a Bound operation. */
2322 ir_node *get_Bound_upper(ir_node *bound) {
2323 assert(bound->op == op_Bound);
2324 return get_irn_n(bound, 3);
2327 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2328 assert(bound->op == op_Bound);
2329 set_irn_n(bound, 3, upper);
2332 /* Return the operand of a Pin node. */
2333 ir_node *get_Pin_op(const ir_node *pin) {
2334 assert(pin->op == op_Pin);
2335 return get_irn_n(pin, 0);
2338 void set_Pin_op(ir_node *pin, ir_node *node) {
2339 assert(pin->op == op_Pin);
2340 set_irn_n(pin, 0, node);
2343 /* Return the assembler text of an ASM pseudo node. */
2344 ident *get_ASM_text(const ir_node *node) {
2345 assert(node->op == op_ASM);
2346 return node->attr.assem.asm_text;
2349 /* Return the number of input constraints for an ASM node. */
2350 int get_ASM_n_input_constraints(const ir_node *node) {
2351 assert(node->op == op_ASM);
2352 return ARR_LEN(node->attr.assem.inputs);
2355 /* Return the input constraints for an ASM node. This is a flexible array. */
2356 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2357 assert(node->op == op_ASM);
2358 return node->attr.assem.inputs;
2361 /* Return the number of output constraints for an ASM node. */
2362 int get_ASM_n_output_constraints(const ir_node *node) {
2363 assert(node->op == op_ASM);
2364 return ARR_LEN(node->attr.assem.outputs);
2367 /* Return the output constraints for an ASM node. */
2368 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2369 assert(node->op == op_ASM);
2370 return node->attr.assem.outputs;
2373 /* Return the number of clobbered registers for an ASM node. */
2374 int get_ASM_n_clobbers(const ir_node *node) {
2375 assert(node->op == op_ASM);
2376 return ARR_LEN(node->attr.assem.clobber);
2379 /* Return the list of clobbered registers for an ASM node. */
2380 ident **get_ASM_clobbers(const ir_node *node) {
2381 assert(node->op == op_ASM);
2382 return node->attr.assem.clobber;
2385 /* returns the graph of a node */
2387 get_irn_irg(const ir_node *node) {
2389 * Do not use get_nodes_Block() here, because this
2390 * will check the pinned state.
2391 * However even a 'wrong' block is always in the proper
2394 if (! is_Block(node))
2395 node = get_irn_n(node, -1);
2396 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2397 node = get_irn_n(node, -1);
2398 assert(get_irn_op(node) == op_Block);
2399 return node->attr.block.irg;
2403 /*----------------------------------------------------------------*/
2404 /* Auxiliary routines */
2405 /*----------------------------------------------------------------*/
2408 skip_Proj(ir_node *node) {
2409 /* don't assert node !!! */
2414 node = get_Proj_pred(node);
2420 skip_Proj_const(const ir_node *node) {
2421 /* don't assert node !!! */
2426 node = get_Proj_pred(node);
2432 skip_Tuple(ir_node *node) {
2436 if (!get_opt_normalize()) return node;
2439 if (get_irn_op(node) == op_Proj) {
2440 pred = get_Proj_pred(node);
2441 op = get_irn_op(pred);
2444 * Looks strange but calls get_irn_op() only once
2445 * in most often cases.
2447 if (op == op_Proj) { /* nested Tuple ? */
2448 pred = skip_Tuple(pred);
2449 op = get_irn_op(pred);
2451 if (op == op_Tuple) {
2452 node = get_Tuple_pred(pred, get_Proj_proj(node));
2455 } else if (op == op_Tuple) {
2456 node = get_Tuple_pred(pred, get_Proj_proj(node));
2463 /* returns operand of node if node is a Cast */
2464 ir_node *skip_Cast(ir_node *node) {
2465 if (get_irn_op(node) == op_Cast)
2466 return get_Cast_op(node);
2470 /* returns operand of node if node is a Confirm */
2471 ir_node *skip_Confirm(ir_node *node) {
2472 if (get_irn_op(node) == op_Confirm)
2473 return get_Confirm_value(node);
2477 /* skip all high-level ops */
2478 ir_node *skip_HighLevel(ir_node *node) {
2479 if (is_op_highlevel(get_irn_op(node)))
2480 return get_irn_n(node, 0);
2485 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2486 * than any other approach, as Id chains are resolved and all point to the real node, or
2487 * all id's are self loops.
2489 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2490 * a little bit "hand optimized".
2492 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2495 skip_Id(ir_node *node) {
2497 /* don't assert node !!! */
2499 if (!node || (node->op != op_Id)) return node;
2501 /* Don't use get_Id_pred(): We get into an endless loop for
2502 self-referencing Ids. */
2503 pred = node->in[0+1];
2505 if (pred->op != op_Id) return pred;
2507 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2508 ir_node *rem_pred, *res;
2510 if (pred->op != op_Id) return pred; /* shortcut */
2513 assert(get_irn_arity (node) > 0);
2515 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2516 res = skip_Id(rem_pred);
2517 if (res->op == op_Id) /* self-loop */ return node;
2519 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2526 void skip_Id_and_store(ir_node **node) {
2529 if (!n || (n->op != op_Id)) return;
2531 /* Don't use get_Id_pred(): We get into an endless loop for
2532 self-referencing Ids. */
2537 (is_Bad)(const ir_node *node) {
2538 return _is_Bad(node);
2542 (is_NoMem)(const ir_node *node) {
2543 return _is_NoMem(node);
2547 (is_Minus)(const ir_node *node) {
2548 return _is_Minus(node);
2552 (is_Mod)(const ir_node *node) {
2553 return _is_Mod(node);
2557 (is_Div)(const ir_node *node) {
2558 return _is_Div(node);
2562 (is_DivMod)(const ir_node *node) {
2563 return _is_DivMod(node);
2567 (is_Quot)(const ir_node *node) {
2568 return _is_Quot(node);
2572 (is_Add)(const ir_node *node) {
2573 return _is_Add(node);
2577 (is_Sub)(const ir_node *node) {
2578 return _is_Sub(node);
2582 (is_Tuple)(const ir_node *node) {
2583 return _is_Tuple(node);
2587 (is_Start)(const ir_node *node) {
2588 return _is_Start(node);
2592 (is_End)(const ir_node *node) {
2593 return _is_End(node);
2597 (is_Const)(const ir_node *node) {
2598 return _is_Const(node);
2602 (is_Conv)(const ir_node *node) {
2603 return _is_Conv(node);
2607 (is_no_Block)(const ir_node *node) {
2608 return _is_no_Block(node);
2612 (is_Block)(const ir_node *node) {
2613 return _is_Block(node);
2616 /* returns true if node is an Unknown node. */
2618 (is_Unknown)(const ir_node *node) {
2619 return _is_Unknown(node);
2622 /* returns true if node is a Return node. */
2624 (is_Return)(const ir_node *node) {
2625 return _is_Return(node);
2628 /* returns true if node is a Call node. */
2630 (is_Call)(const ir_node *node) {
2631 return _is_Call(node);
2634 /* returns true if node is a Sel node. */
2636 (is_Sel)(const ir_node *node) {
2637 return _is_Sel(node);
2640 /* returns true if node is a Mux node or a Psi with only one condition. */
2642 (is_Mux)(const ir_node *node) {
2643 return _is_Mux(node);
2646 /* returns true if node is a Load node. */
2648 (is_Load)(const ir_node *node) {
2649 return _is_Load(node);
2652 /* returns true if node is a Load node. */
2654 (is_Store)(const ir_node *node) {
2655 return _is_Store(node);
2658 /* returns true if node is a Sync node. */
2660 (is_Sync)(const ir_node *node) {
2661 return _is_Sync(node);
2664 /* returns true if node is a Confirm node. */
2666 (is_Confirm)(const ir_node *node) {
2667 return _is_Confirm(node);
2670 /* returns true if node is a Pin node. */
2672 (is_Pin)(const ir_node *node) {
2673 return _is_Pin(node);
2676 /* returns true if node is a SymConst node. */
2678 (is_SymConst)(const ir_node *node) {
2679 return _is_SymConst(node);
2682 /* returns true if node is a Cond node. */
2684 (is_Cond)(const ir_node *node) {
2685 return _is_Cond(node);
2689 (is_CopyB)(const ir_node *node) {
2690 return _is_CopyB(node);
2693 /* returns true if node is a Cmp node. */
2695 (is_Cmp)(const ir_node *node) {
2696 return _is_Cmp(node);
2699 /* returns true if node is an Alloc node. */
2701 (is_Alloc)(const ir_node *node) {
2702 return _is_Alloc(node);
2705 /* returns true if a node is a Jmp node. */
2707 (is_Jmp)(const ir_node *node) {
2708 return _is_Jmp(node);
2711 /* returns true if a node is a Raise node. */
2713 (is_Raise)(const ir_node *node) {
2714 return _is_Raise(node);
2717 /* returns true if a node is an ASM node. */
2719 (is_ASM)(const ir_node *node) {
2720 return _is_ASM(node);
2724 is_Proj(const ir_node *node) {
2726 return node->op == op_Proj ||
2727 (!get_interprocedural_view() && node->op == op_Filter);
2730 /* Returns true if the operation manipulates control flow. */
2732 is_cfop(const ir_node *node) {
2733 return is_cfopcode(get_irn_op(node));
2736 /* Returns true if the operation manipulates interprocedural control flow:
2737 CallBegin, EndReg, EndExcept */
2738 int is_ip_cfop(const ir_node *node) {
2739 return is_ip_cfopcode(get_irn_op(node));
2742 /* Returns true if the operation can change the control flow because
2745 is_fragile_op(const ir_node *node) {
2746 return is_op_fragile(get_irn_op(node));
2749 /* Returns the memory operand of fragile operations. */
2750 ir_node *get_fragile_op_mem(ir_node *node) {
2751 assert(node && is_fragile_op(node));
2753 switch (get_irn_opcode(node)) {
2763 return get_irn_n(node, 0);
2768 assert(0 && "should not be reached");
2773 /* Returns the result mode of a Div operation. */
2774 ir_mode *get_divop_resmod(const ir_node *node) {
2775 switch (get_irn_opcode(node)) {
2776 case iro_Quot : return get_Quot_resmode(node);
2777 case iro_DivMod: return get_DivMod_resmode(node);
2778 case iro_Div : return get_Div_resmode(node);
2779 case iro_Mod : return get_Mod_resmode(node);
2781 assert(0 && "should not be reached");
2786 /* Returns true if the operation is a forking control flow operation. */
2787 int (is_irn_forking)(const ir_node *node) {
2788 return _is_irn_forking(node);
2791 /* Return the type associated with the value produced by n
2792 * if the node remarks this type as it is the case for
2793 * Cast, Const, SymConst and some Proj nodes. */
2794 ir_type *(get_irn_type)(ir_node *node) {
2795 return _get_irn_type(node);
2798 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2800 ir_type *(get_irn_type_attr)(ir_node *node) {
2801 return _get_irn_type_attr(node);
2804 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2805 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2806 return _get_irn_entity_attr(node);
2809 /* Returns non-zero for constant-like nodes. */
2810 int (is_irn_constlike)(const ir_node *node) {
2811 return _is_irn_constlike(node);
2815 * Returns non-zero for nodes that are allowed to have keep-alives and
2816 * are neither Block nor PhiM.
2818 int (is_irn_keep)(const ir_node *node) {
2819 return _is_irn_keep(node);
2823 * Returns non-zero for nodes that are always placed in the start block.
2825 int (is_irn_start_block_placed)(const ir_node *node) {
2826 return _is_irn_start_block_placed(node);
2829 /* Returns non-zero for nodes that are machine operations. */
2830 int (is_irn_machine_op)(const ir_node *node) {
2831 return _is_irn_machine_op(node);
2834 /* Returns non-zero for nodes that are machine operands. */
2835 int (is_irn_machine_operand)(const ir_node *node) {
2836 return _is_irn_machine_operand(node);
2839 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2840 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2841 return _is_irn_machine_user(node, n);
2845 /* Gets the string representation of the jump prediction .*/
2846 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2849 case COND_JMP_PRED_NONE: return "no prediction";
2850 case COND_JMP_PRED_TRUE: return "true taken";
2851 case COND_JMP_PRED_FALSE: return "false taken";
2855 /* Returns the conditional jump prediction of a Cond node. */
2856 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2857 return _get_Cond_jmp_pred(cond);
2860 /* Sets a new conditional jump prediction. */
2861 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2862 _set_Cond_jmp_pred(cond, pred);
2865 /** the get_type operation must be always implemented and return a firm type */
2866 static ir_type *get_Default_type(ir_node *n) {
2867 return get_unknown_type();
2870 /* Sets the get_type operation for an ir_op_ops. */
2871 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2873 case iro_Const: ops->get_type = get_Const_type; break;
2874 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2875 case iro_Cast: ops->get_type = get_Cast_type; break;
2876 case iro_Proj: ops->get_type = get_Proj_type; break;
2878 /* not allowed to be NULL */
2879 if (! ops->get_type)
2880 ops->get_type = get_Default_type;
2886 /** Return the attribute type of a SymConst node if exists */
2887 static ir_type *get_SymConst_attr_type(ir_node *self) {
2888 symconst_kind kind = get_SymConst_kind(self);
2889 if (SYMCONST_HAS_TYPE(kind))
2890 return get_SymConst_type(self);
2894 /** Return the attribute entity of a SymConst node if exists */
2895 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
2896 symconst_kind kind = get_SymConst_kind(self);
2897 if (SYMCONST_HAS_ENT(kind))
2898 return get_SymConst_entity(self);
2902 /** the get_type_attr operation must be always implemented */
2903 static ir_type *get_Null_type(ir_node *n) {
2904 return firm_unknown_type;
2907 /* Sets the get_type operation for an ir_op_ops. */
2908 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
2910 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2911 case iro_Call: ops->get_type_attr = get_Call_type; break;
2912 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2913 case iro_Free: ops->get_type_attr = get_Free_type; break;
2914 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2916 /* not allowed to be NULL */
2917 if (! ops->get_type_attr)
2918 ops->get_type_attr = get_Null_type;
2924 /** the get_entity_attr operation must be always implemented */
2925 static ir_entity *get_Null_ent(ir_node *n) {
2929 /* Sets the get_type operation for an ir_op_ops. */
2930 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
2932 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2933 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2935 /* not allowed to be NULL */
2936 if (! ops->get_entity_attr)
2937 ops->get_entity_attr = get_Null_ent;
2943 #ifdef DEBUG_libfirm
2944 void dump_irn(ir_node *n) {
2945 int i, arity = get_irn_arity(n);
2946 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2948 ir_node *pred = get_irn_n(n, -1);
2949 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2950 get_irn_node_nr(pred), (void *)pred);
2952 printf(" preds: \n");
2953 for (i = 0; i < arity; ++i) {
2954 ir_node *pred = get_irn_n(n, i);
2955 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2956 get_irn_node_nr(pred), (void *)pred);
2960 #else /* DEBUG_libfirm */
2961 void dump_irn(ir_node *n) {}
2962 #endif /* DEBUG_libfirm */