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"
39 #include "irbackedge_t.h"
43 #include "iredgekinds.h"
44 #include "iredges_t.h"
49 /* some constants fixing the positions of nodes predecessors
51 #define CALL_PARAM_OFFSET 2
52 #define FUNCCALL_PARAM_OFFSET 1
53 #define SEL_INDEX_OFFSET 2
54 #define RETURN_RESULT_OFFSET 1 /* mem is not a result */
55 #define END_KEEPALIVE_OFFSET 0
57 static const char *pnc_name_arr [] = {
58 "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
59 "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
60 "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
61 "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
65 * returns the pnc name from an pnc constant
67 const char *get_pnc_string(int pnc) {
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 ir_node *get_Block_MacroBlock(const ir_node *block) {
850 assert(is_Block(block));
851 return get_irn_n(block, -1);
855 get_End_n_keepalives(ir_node *end) {
856 assert(end->op == op_End);
857 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
861 get_End_keepalive(ir_node *end, int pos) {
862 assert(end->op == op_End);
863 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
867 add_End_keepalive(ir_node *end, ir_node *ka) {
868 assert(end->op == op_End);
869 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
874 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
875 assert(end->op == op_End);
876 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
879 /* Set new keep-alives */
880 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
882 ir_graph *irg = get_irn_irg(end);
884 /* notify that edges are deleted */
885 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
886 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
888 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
890 for (i = 0; i < n; ++i) {
891 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
892 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
896 /* Set new keep-alives from old keep-alives, skipping irn */
897 void remove_End_keepalive(ir_node *end, ir_node *irn) {
898 int n = get_End_n_keepalives(end);
902 NEW_ARR_A(ir_node *, in, n);
904 for (idx = i = 0; i < n; ++i) {
905 ir_node *old_ka = get_End_keepalive(end, i);
912 /* set new keep-alives */
913 set_End_keepalives(end, idx, in);
917 free_End (ir_node *end) {
918 assert(end->op == op_End);
921 end->in = NULL; /* @@@ make sure we get an error if we use the
922 in array afterwards ... */
925 /* Return the target address of an IJmp */
926 ir_node *get_IJmp_target(ir_node *ijmp) {
927 assert(ijmp->op == op_IJmp);
928 return get_irn_n(ijmp, 0);
931 /** Sets the target address of an IJmp */
932 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
933 assert(ijmp->op == op_IJmp);
934 set_irn_n(ijmp, 0, tgt);
938 > Implementing the case construct (which is where the constant Proj node is
939 > important) involves far more than simply determining the constant values.
940 > We could argue that this is more properly a function of the translator from
941 > Firm to the target machine. That could be done if there was some way of
942 > projecting "default" out of the Cond node.
943 I know it's complicated.
944 Basically there are two proglems:
945 - determining the gaps between the projs
946 - determining the biggest case constant to know the proj number for
948 I see several solutions:
949 1. Introduce a ProjDefault node. Solves both problems.
950 This means to extend all optimizations executed during construction.
951 2. Give the Cond node for switch two flavors:
952 a) there are no gaps in the projs (existing flavor)
953 b) gaps may exist, default proj is still the Proj with the largest
954 projection number. This covers also the gaps.
955 3. Fix the semantic of the Cond to that of 2b)
957 Solution 2 seems to be the best:
958 Computing the gaps in the Firm representation is not too hard, i.e.,
959 libFIRM can implement a routine that transforms between the two
960 flavours. This is also possible for 1) but 2) does not require to
961 change any existing optimization.
962 Further it should be far simpler to determine the biggest constant than
964 I don't want to choose 3) as 2a) seems to have advantages for
965 dataflow analysis and 3) does not allow to convert the representation to
969 get_Cond_selector(ir_node *node) {
970 assert(node->op == op_Cond);
971 return get_irn_n(node, 0);
975 set_Cond_selector(ir_node *node, ir_node *selector) {
976 assert(node->op == op_Cond);
977 set_irn_n(node, 0, selector);
981 get_Cond_kind(ir_node *node) {
982 assert(node->op == op_Cond);
983 return node->attr.cond.kind;
987 set_Cond_kind(ir_node *node, cond_kind kind) {
988 assert(node->op == op_Cond);
989 node->attr.cond.kind = kind;
993 get_Cond_defaultProj(ir_node *node) {
994 assert(node->op == op_Cond);
995 return node->attr.cond.default_proj;
999 get_Return_mem(ir_node *node) {
1000 assert(node->op == op_Return);
1001 return get_irn_n(node, 0);
1005 set_Return_mem(ir_node *node, ir_node *mem) {
1006 assert(node->op == op_Return);
1007 set_irn_n(node, 0, mem);
1011 get_Return_n_ress(ir_node *node) {
1012 assert(node->op == op_Return);
1013 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1017 get_Return_res_arr (ir_node *node) {
1018 assert((node->op == op_Return));
1019 if (get_Return_n_ress(node) > 0)
1020 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1027 set_Return_n_res(ir_node *node, int results) {
1028 assert(node->op == op_Return);
1033 get_Return_res(ir_node *node, int pos) {
1034 assert(node->op == op_Return);
1035 assert(get_Return_n_ress(node) > pos);
1036 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1040 set_Return_res(ir_node *node, int pos, ir_node *res){
1041 assert(node->op == op_Return);
1042 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1045 tarval *(get_Const_tarval)(const ir_node *node) {
1046 return _get_Const_tarval(node);
1050 set_Const_tarval(ir_node *node, tarval *con) {
1051 assert(node->op == op_Const);
1052 node->attr.con.tv = con;
1055 cnst_classify_t (classify_Const)(ir_node *node) {
1056 return _classify_Const(node);
1060 /* The source language type. Must be an atomic type. Mode of type must
1061 be mode of node. For tarvals from entities type must be pointer to
1064 get_Const_type(ir_node *node) {
1065 assert(node->op == op_Const);
1066 return node->attr.con.tp;
1070 set_Const_type(ir_node *node, ir_type *tp) {
1071 assert(node->op == op_Const);
1072 if (tp != firm_unknown_type) {
1073 assert(is_atomic_type(tp));
1074 assert(get_type_mode(tp) == get_irn_mode(node));
1076 node->attr.con.tp = tp;
1081 get_SymConst_kind(const ir_node *node) {
1082 assert(node->op == op_SymConst);
1083 return node->attr.symc.num;
1087 set_SymConst_kind(ir_node *node, symconst_kind num) {
1088 assert(node->op == op_SymConst);
1089 node->attr.symc.num = num;
1093 get_SymConst_type(ir_node *node) {
1094 assert((node->op == op_SymConst) &&
1095 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1096 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1100 set_SymConst_type(ir_node *node, ir_type *tp) {
1101 assert((node->op == op_SymConst) &&
1102 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1103 node->attr.symc.sym.type_p = tp;
1107 get_SymConst_name(const ir_node *node) {
1108 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1109 return node->attr.symc.sym.ident_p;
1113 set_SymConst_name(ir_node *node, ident *name) {
1114 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1115 node->attr.symc.sym.ident_p = name;
1119 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1120 ir_entity *get_SymConst_entity(const ir_node *node) {
1121 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1122 return node->attr.symc.sym.entity_p;
1125 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1126 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1127 node->attr.symc.sym.entity_p = ent;
1130 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1131 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1132 return node->attr.symc.sym.enum_p;
1135 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1136 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1137 node->attr.symc.sym.enum_p = ec;
1140 union symconst_symbol
1141 get_SymConst_symbol(const ir_node *node) {
1142 assert(node->op == op_SymConst);
1143 return node->attr.symc.sym;
1147 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1148 assert(node->op == op_SymConst);
1149 node->attr.symc.sym = sym;
1153 get_SymConst_value_type(ir_node *node) {
1154 assert(node->op == op_SymConst);
1155 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1156 return node->attr.symc.tp;
1160 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1161 assert(node->op == op_SymConst);
1162 node->attr.symc.tp = tp;
1166 get_Sel_mem(ir_node *node) {
1167 assert(node->op == op_Sel);
1168 return get_irn_n(node, 0);
1172 set_Sel_mem(ir_node *node, ir_node *mem) {
1173 assert(node->op == op_Sel);
1174 set_irn_n(node, 0, mem);
1178 get_Sel_ptr(ir_node *node) {
1179 assert(node->op == op_Sel);
1180 return get_irn_n(node, 1);
1184 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1185 assert(node->op == op_Sel);
1186 set_irn_n(node, 1, ptr);
1190 get_Sel_n_indexs(ir_node *node) {
1191 assert(node->op == op_Sel);
1192 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1196 get_Sel_index_arr(ir_node *node) {
1197 assert((node->op == op_Sel));
1198 if (get_Sel_n_indexs(node) > 0)
1199 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1205 get_Sel_index(ir_node *node, int pos) {
1206 assert(node->op == op_Sel);
1207 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1211 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1212 assert(node->op == op_Sel);
1213 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1217 get_Sel_entity(ir_node *node) {
1218 assert(node->op == op_Sel);
1219 return node->attr.sel.ent;
1223 set_Sel_entity(ir_node *node, ir_entity *ent) {
1224 assert(node->op == op_Sel);
1225 node->attr.sel.ent = ent;
1229 /* For unary and binary arithmetic operations the access to the
1230 operands can be factored out. Left is the first, right the
1231 second arithmetic value as listed in tech report 0999-33.
1232 unops are: Minus, Abs, Not, Conv, Cast
1233 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1234 Shr, Shrs, Rotate, Cmp */
1238 get_Call_mem(ir_node *node) {
1239 assert(node->op == op_Call);
1240 return get_irn_n(node, 0);
1244 set_Call_mem(ir_node *node, ir_node *mem) {
1245 assert(node->op == op_Call);
1246 set_irn_n(node, 0, mem);
1250 get_Call_ptr(ir_node *node) {
1251 assert(node->op == op_Call);
1252 return get_irn_n(node, 1);
1256 set_Call_ptr(ir_node *node, ir_node *ptr) {
1257 assert(node->op == op_Call);
1258 set_irn_n(node, 1, ptr);
1262 get_Call_param_arr(ir_node *node) {
1263 assert(node->op == op_Call);
1264 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1268 get_Call_n_params(ir_node *node) {
1269 assert(node->op == op_Call);
1270 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1274 get_Call_arity(ir_node *node) {
1275 assert(node->op == op_Call);
1276 return get_Call_n_params(node);
1280 set_Call_arity(ir_node *node, ir_node *arity) {
1281 assert(node->op == op_Call);
1286 get_Call_param(ir_node *node, int pos) {
1287 assert(node->op == op_Call);
1288 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1292 set_Call_param(ir_node *node, int pos, ir_node *param) {
1293 assert(node->op == op_Call);
1294 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1298 get_Call_type(ir_node *node) {
1299 assert(node->op == op_Call);
1300 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1304 set_Call_type(ir_node *node, ir_type *tp) {
1305 assert(node->op == op_Call);
1306 assert((get_unknown_type() == tp) || is_Method_type(tp));
1307 node->attr.call.cld_tp = tp;
1310 int Call_has_callees(ir_node *node) {
1311 assert(node && node->op == op_Call);
1312 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1313 (node->attr.call.callee_arr != NULL));
1316 int get_Call_n_callees(ir_node * node) {
1317 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1318 return ARR_LEN(node->attr.call.callee_arr);
1321 ir_entity * get_Call_callee(ir_node * node, int pos) {
1322 assert(pos >= 0 && pos < get_Call_n_callees(node));
1323 return node->attr.call.callee_arr[pos];
1326 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1327 assert(node->op == op_Call);
1328 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1329 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1331 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1334 void remove_Call_callee_arr(ir_node * node) {
1335 assert(node->op == op_Call);
1336 node->attr.call.callee_arr = NULL;
1339 ir_node * get_CallBegin_ptr(ir_node *node) {
1340 assert(node->op == op_CallBegin);
1341 return get_irn_n(node, 0);
1344 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1345 assert(node->op == op_CallBegin);
1346 set_irn_n(node, 0, ptr);
1349 ir_node * get_CallBegin_call(ir_node *node) {
1350 assert(node->op == op_CallBegin);
1351 return node->attr.callbegin.call;
1354 void set_CallBegin_call(ir_node *node, ir_node *call) {
1355 assert(node->op == op_CallBegin);
1356 node->attr.callbegin.call = call;
1361 ir_node * get_##OP##_left(const ir_node *node) { \
1362 assert(node->op == op_##OP); \
1363 return get_irn_n(node, node->op->op_index); \
1365 void set_##OP##_left(ir_node *node, ir_node *left) { \
1366 assert(node->op == op_##OP); \
1367 set_irn_n(node, node->op->op_index, left); \
1369 ir_node *get_##OP##_right(const ir_node *node) { \
1370 assert(node->op == op_##OP); \
1371 return get_irn_n(node, node->op->op_index + 1); \
1373 void set_##OP##_right(ir_node *node, ir_node *right) { \
1374 assert(node->op == op_##OP); \
1375 set_irn_n(node, node->op->op_index + 1, right); \
1379 ir_node *get_##OP##_op(const ir_node *node) { \
1380 assert(node->op == op_##OP); \
1381 return get_irn_n(node, node->op->op_index); \
1383 void set_##OP##_op (ir_node *node, ir_node *op) { \
1384 assert(node->op == op_##OP); \
1385 set_irn_n(node, node->op->op_index, op); \
1388 #define BINOP_MEM(OP) \
1392 get_##OP##_mem(ir_node *node) { \
1393 assert(node->op == op_##OP); \
1394 return get_irn_n(node, 0); \
1398 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1399 assert(node->op == op_##OP); \
1400 set_irn_n(node, 0, mem); \
1406 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1407 assert(node->op == op_##OP); \
1408 return node->attr.divmod.res_mode; \
1411 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1412 assert(node->op == op_##OP); \
1413 node->attr.divmod.res_mode = mode; \
1438 int get_Conv_strict(ir_node *node) {
1439 assert(node->op == op_Conv);
1440 return node->attr.conv.strict;
1443 void set_Conv_strict(ir_node *node, int strict_flag) {
1444 assert(node->op == op_Conv);
1445 node->attr.conv.strict = (char)strict_flag;
1449 get_Cast_type(ir_node *node) {
1450 assert(node->op == op_Cast);
1451 return node->attr.cast.totype;
1455 set_Cast_type(ir_node *node, ir_type *to_tp) {
1456 assert(node->op == op_Cast);
1457 node->attr.cast.totype = to_tp;
1461 /* Checks for upcast.
1463 * Returns true if the Cast node casts a class type to a super type.
1465 int is_Cast_upcast(ir_node *node) {
1466 ir_type *totype = get_Cast_type(node);
1467 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1468 ir_graph *myirg = get_irn_irg(node);
1470 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1473 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1474 totype = get_pointer_points_to_type(totype);
1475 fromtype = get_pointer_points_to_type(fromtype);
1480 if (!is_Class_type(totype)) return 0;
1481 return is_SubClass_of(fromtype, totype);
1484 /* Checks for downcast.
1486 * Returns true if the Cast node casts a class type to a sub type.
1488 int is_Cast_downcast(ir_node *node) {
1489 ir_type *totype = get_Cast_type(node);
1490 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1492 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1495 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1496 totype = get_pointer_points_to_type(totype);
1497 fromtype = get_pointer_points_to_type(fromtype);
1502 if (!is_Class_type(totype)) return 0;
1503 return is_SubClass_of(totype, fromtype);
1507 (is_unop)(const ir_node *node) {
1508 return _is_unop(node);
1512 get_unop_op(const ir_node *node) {
1513 if (node->op->opar == oparity_unary)
1514 return get_irn_n(node, node->op->op_index);
1516 assert(node->op->opar == oparity_unary);
1521 set_unop_op(ir_node *node, ir_node *op) {
1522 if (node->op->opar == oparity_unary)
1523 set_irn_n(node, node->op->op_index, op);
1525 assert(node->op->opar == oparity_unary);
1529 (is_binop)(const ir_node *node) {
1530 return _is_binop(node);
1534 get_binop_left(const ir_node *node) {
1535 assert(node->op->opar == oparity_binary);
1536 return get_irn_n(node, node->op->op_index);
1540 set_binop_left(ir_node *node, ir_node *left) {
1541 assert(node->op->opar == oparity_binary);
1542 set_irn_n(node, node->op->op_index, left);
1546 get_binop_right(const ir_node *node) {
1547 assert(node->op->opar == oparity_binary);
1548 return get_irn_n(node, node->op->op_index + 1);
1552 set_binop_right(ir_node *node, ir_node *right) {
1553 assert(node->op->opar == oparity_binary);
1554 set_irn_n(node, node->op->op_index + 1, right);
1557 int is_Phi(const ir_node *n) {
1563 if (op == op_Filter) return get_interprocedural_view();
1566 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1567 (get_irn_arity(n) > 0));
1572 int is_Phi0(const ir_node *n) {
1575 return ((get_irn_op(n) == op_Phi) &&
1576 (get_irn_arity(n) == 0) &&
1577 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1581 get_Phi_preds_arr(ir_node *node) {
1582 assert(node->op == op_Phi);
1583 return (ir_node **)&(get_irn_in(node)[1]);
1587 get_Phi_n_preds(const ir_node *node) {
1588 assert(is_Phi(node) || is_Phi0(node));
1589 return (get_irn_arity(node));
1593 void set_Phi_n_preds(ir_node *node, int n_preds) {
1594 assert(node->op == op_Phi);
1599 get_Phi_pred(const ir_node *node, int pos) {
1600 assert(is_Phi(node) || is_Phi0(node));
1601 return get_irn_n(node, pos);
1605 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1606 assert(is_Phi(node) || is_Phi0(node));
1607 set_irn_n(node, pos, pred);
1611 int is_memop(ir_node *node) {
1612 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1615 ir_node *get_memop_mem(ir_node *node) {
1616 assert(is_memop(node));
1617 return get_irn_n(node, 0);
1620 void set_memop_mem(ir_node *node, ir_node *mem) {
1621 assert(is_memop(node));
1622 set_irn_n(node, 0, mem);
1625 ir_node *get_memop_ptr(ir_node *node) {
1626 assert(is_memop(node));
1627 return get_irn_n(node, 1);
1630 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1631 assert(is_memop(node));
1632 set_irn_n(node, 1, ptr);
1636 get_Load_mem(ir_node *node) {
1637 assert(node->op == op_Load);
1638 return get_irn_n(node, 0);
1642 set_Load_mem(ir_node *node, ir_node *mem) {
1643 assert(node->op == op_Load);
1644 set_irn_n(node, 0, mem);
1648 get_Load_ptr(ir_node *node) {
1649 assert(node->op == op_Load);
1650 return get_irn_n(node, 1);
1654 set_Load_ptr(ir_node *node, ir_node *ptr) {
1655 assert(node->op == op_Load);
1656 set_irn_n(node, 1, ptr);
1660 get_Load_mode(ir_node *node) {
1661 assert(node->op == op_Load);
1662 return node->attr.load.load_mode;
1666 set_Load_mode(ir_node *node, ir_mode *mode) {
1667 assert(node->op == op_Load);
1668 node->attr.load.load_mode = mode;
1672 get_Load_volatility(ir_node *node) {
1673 assert(node->op == op_Load);
1674 return node->attr.load.volatility;
1678 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1679 assert(node->op == op_Load);
1680 node->attr.load.volatility = volatility;
1685 get_Store_mem(ir_node *node) {
1686 assert(node->op == op_Store);
1687 return get_irn_n(node, 0);
1691 set_Store_mem(ir_node *node, ir_node *mem) {
1692 assert(node->op == op_Store);
1693 set_irn_n(node, 0, mem);
1697 get_Store_ptr(ir_node *node) {
1698 assert(node->op == op_Store);
1699 return get_irn_n(node, 1);
1703 set_Store_ptr(ir_node *node, ir_node *ptr) {
1704 assert(node->op == op_Store);
1705 set_irn_n(node, 1, ptr);
1709 get_Store_value(ir_node *node) {
1710 assert(node->op == op_Store);
1711 return get_irn_n(node, 2);
1715 set_Store_value(ir_node *node, ir_node *value) {
1716 assert(node->op == op_Store);
1717 set_irn_n(node, 2, value);
1721 get_Store_volatility(ir_node *node) {
1722 assert(node->op == op_Store);
1723 return node->attr.store.volatility;
1727 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1728 assert(node->op == op_Store);
1729 node->attr.store.volatility = volatility;
1734 get_Alloc_mem(ir_node *node) {
1735 assert(node->op == op_Alloc);
1736 return get_irn_n(node, 0);
1740 set_Alloc_mem(ir_node *node, ir_node *mem) {
1741 assert(node->op == op_Alloc);
1742 set_irn_n(node, 0, mem);
1746 get_Alloc_size(ir_node *node) {
1747 assert(node->op == op_Alloc);
1748 return get_irn_n(node, 1);
1752 set_Alloc_size(ir_node *node, ir_node *size) {
1753 assert(node->op == op_Alloc);
1754 set_irn_n(node, 1, size);
1758 get_Alloc_type(ir_node *node) {
1759 assert(node->op == op_Alloc);
1760 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1764 set_Alloc_type(ir_node *node, ir_type *tp) {
1765 assert(node->op == op_Alloc);
1766 node->attr.alloc.type = tp;
1770 get_Alloc_where(ir_node *node) {
1771 assert(node->op == op_Alloc);
1772 return node->attr.alloc.where;
1776 set_Alloc_where(ir_node *node, where_alloc where) {
1777 assert(node->op == op_Alloc);
1778 node->attr.alloc.where = where;
1783 get_Free_mem(ir_node *node) {
1784 assert(node->op == op_Free);
1785 return get_irn_n(node, 0);
1789 set_Free_mem(ir_node *node, ir_node *mem) {
1790 assert(node->op == op_Free);
1791 set_irn_n(node, 0, mem);
1795 get_Free_ptr(ir_node *node) {
1796 assert(node->op == op_Free);
1797 return get_irn_n(node, 1);
1801 set_Free_ptr(ir_node *node, ir_node *ptr) {
1802 assert(node->op == op_Free);
1803 set_irn_n(node, 1, ptr);
1807 get_Free_size(ir_node *node) {
1808 assert(node->op == op_Free);
1809 return get_irn_n(node, 2);
1813 set_Free_size(ir_node *node, ir_node *size) {
1814 assert(node->op == op_Free);
1815 set_irn_n(node, 2, size);
1819 get_Free_type(ir_node *node) {
1820 assert(node->op == op_Free);
1821 return node->attr.free.type = skip_tid(node->attr.free.type);
1825 set_Free_type(ir_node *node, ir_type *tp) {
1826 assert(node->op == op_Free);
1827 node->attr.free.type = tp;
1831 get_Free_where(ir_node *node) {
1832 assert(node->op == op_Free);
1833 return node->attr.free.where;
1837 set_Free_where(ir_node *node, where_alloc where) {
1838 assert(node->op == op_Free);
1839 node->attr.free.where = where;
1842 ir_node **get_Sync_preds_arr(ir_node *node) {
1843 assert(node->op == op_Sync);
1844 return (ir_node **)&(get_irn_in(node)[1]);
1847 int get_Sync_n_preds(ir_node *node) {
1848 assert(node->op == op_Sync);
1849 return (get_irn_arity(node));
1853 void set_Sync_n_preds(ir_node *node, int n_preds) {
1854 assert(node->op == op_Sync);
1858 ir_node *get_Sync_pred(ir_node *node, int pos) {
1859 assert(node->op == op_Sync);
1860 return get_irn_n(node, pos);
1863 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1864 assert(node->op == op_Sync);
1865 set_irn_n(node, pos, pred);
1868 /* Add a new Sync predecessor */
1869 void add_Sync_pred(ir_node *node, ir_node *pred) {
1870 assert(node->op == op_Sync);
1871 add_irn_n(node, pred);
1874 /* Returns the source language type of a Proj node. */
1875 ir_type *get_Proj_type(ir_node *n) {
1876 ir_type *tp = firm_unknown_type;
1877 ir_node *pred = get_Proj_pred(n);
1879 switch (get_irn_opcode(pred)) {
1882 /* Deal with Start / Call here: we need to know the Proj Nr. */
1883 assert(get_irn_mode(pred) == mode_T);
1884 pred_pred = get_Proj_pred(pred);
1885 if (get_irn_op(pred_pred) == op_Start) {
1886 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1887 tp = get_method_param_type(mtp, get_Proj_proj(n));
1888 } else if (get_irn_op(pred_pred) == op_Call) {
1889 ir_type *mtp = get_Call_type(pred_pred);
1890 tp = get_method_res_type(mtp, get_Proj_proj(n));
1893 case iro_Start: break;
1894 case iro_Call: break;
1896 ir_node *a = get_Load_ptr(pred);
1898 tp = get_entity_type(get_Sel_entity(a));
1907 get_Proj_pred(const ir_node *node) {
1908 assert(is_Proj(node));
1909 return get_irn_n(node, 0);
1913 set_Proj_pred(ir_node *node, ir_node *pred) {
1914 assert(is_Proj(node));
1915 set_irn_n(node, 0, pred);
1918 long get_VProj_proj(const ir_node *node)
1920 return node->attr.proj;
1923 void set_VProj_proj(ir_node *node, long value)
1925 node->attr.proj = value;
1929 get_Proj_proj(const ir_node *node) {
1930 assert(is_Proj(node));
1931 if (get_irn_opcode(node) == iro_Proj) {
1932 return node->attr.proj;
1934 assert(get_irn_opcode(node) == iro_Filter);
1935 return node->attr.filter.proj;
1940 set_Proj_proj(ir_node *node, long proj) {
1941 assert(node->op == op_Proj);
1942 node->attr.proj = proj;
1946 get_Tuple_preds_arr(ir_node *node) {
1947 assert(node->op == op_Tuple);
1948 return (ir_node **)&(get_irn_in(node)[1]);
1952 get_Tuple_n_preds(ir_node *node) {
1953 assert(node->op == op_Tuple);
1954 return (get_irn_arity(node));
1959 set_Tuple_n_preds(ir_node *node, int n_preds) {
1960 assert(node->op == op_Tuple);
1965 get_Tuple_pred (ir_node *node, int pos) {
1966 assert(node->op == op_Tuple);
1967 return get_irn_n(node, pos);
1971 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
1972 assert(node->op == op_Tuple);
1973 set_irn_n(node, pos, pred);
1977 get_Id_pred(ir_node *node) {
1978 assert(node->op == op_Id);
1979 return get_irn_n(node, 0);
1983 set_Id_pred(ir_node *node, ir_node *pred) {
1984 assert(node->op == op_Id);
1985 set_irn_n(node, 0, pred);
1988 ir_node *get_Confirm_value(ir_node *node) {
1989 assert(node->op == op_Confirm);
1990 return get_irn_n(node, 0);
1993 void set_Confirm_value(ir_node *node, ir_node *value) {
1994 assert(node->op == op_Confirm);
1995 set_irn_n(node, 0, value);
1998 ir_node *get_Confirm_bound(ir_node *node) {
1999 assert(node->op == op_Confirm);
2000 return get_irn_n(node, 1);
2003 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2004 assert(node->op == op_Confirm);
2005 set_irn_n(node, 0, bound);
2008 pn_Cmp get_Confirm_cmp(ir_node *node) {
2009 assert(node->op == op_Confirm);
2010 return node->attr.confirm_cmp;
2013 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2014 assert(node->op == op_Confirm);
2015 node->attr.confirm_cmp = cmp;
2020 get_Filter_pred(ir_node *node) {
2021 assert(node->op == op_Filter);
2026 set_Filter_pred(ir_node *node, ir_node *pred) {
2027 assert(node->op == op_Filter);
2032 get_Filter_proj(ir_node *node) {
2033 assert(node->op == op_Filter);
2034 return node->attr.filter.proj;
2038 set_Filter_proj(ir_node *node, long proj) {
2039 assert(node->op == op_Filter);
2040 node->attr.filter.proj = proj;
2043 /* Don't use get_irn_arity, get_irn_n in implementation as access
2044 shall work independent of view!!! */
2045 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2046 assert(node->op == op_Filter);
2047 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2048 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2049 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2050 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2051 node->attr.filter.in_cg[0] = node->in[0];
2053 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2056 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2057 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2058 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2059 node->attr.filter.in_cg[pos + 1] = pred;
2062 int get_Filter_n_cg_preds(ir_node *node) {
2063 assert(node->op == op_Filter && node->attr.filter.in_cg);
2064 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2067 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2069 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2071 arity = ARR_LEN(node->attr.filter.in_cg);
2072 assert(pos < arity - 1);
2073 return node->attr.filter.in_cg[pos + 1];
2077 ir_node *get_Mux_sel(ir_node *node) {
2078 if (node->op == op_Psi) {
2079 assert(get_irn_arity(node) == 3);
2080 return get_Psi_cond(node, 0);
2082 assert(node->op == op_Mux);
2086 void set_Mux_sel(ir_node *node, ir_node *sel) {
2087 if (node->op == op_Psi) {
2088 assert(get_irn_arity(node) == 3);
2089 set_Psi_cond(node, 0, sel);
2091 assert(node->op == op_Mux);
2096 ir_node *get_Mux_false(ir_node *node) {
2097 if (node->op == op_Psi) {
2098 assert(get_irn_arity(node) == 3);
2099 return get_Psi_default(node);
2101 assert(node->op == op_Mux);
2105 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2106 if (node->op == op_Psi) {
2107 assert(get_irn_arity(node) == 3);
2108 set_Psi_default(node, ir_false);
2110 assert(node->op == op_Mux);
2111 node->in[2] = ir_false;
2115 ir_node *get_Mux_true(ir_node *node) {
2116 if (node->op == op_Psi) {
2117 assert(get_irn_arity(node) == 3);
2118 return get_Psi_val(node, 0);
2120 assert(node->op == op_Mux);
2124 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2125 if (node->op == op_Psi) {
2126 assert(get_irn_arity(node) == 3);
2127 set_Psi_val(node, 0, ir_true);
2129 assert(node->op == op_Mux);
2130 node->in[3] = ir_true;
2135 ir_node *get_Psi_cond(ir_node *node, int pos) {
2136 int num_conds = get_Psi_n_conds(node);
2137 assert(node->op == op_Psi);
2138 assert(pos < num_conds);
2139 return get_irn_n(node, 2 * pos);
2142 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2143 int num_conds = get_Psi_n_conds(node);
2144 assert(node->op == op_Psi);
2145 assert(pos < num_conds);
2146 set_irn_n(node, 2 * pos, cond);
2149 ir_node *get_Psi_val(ir_node *node, int pos) {
2150 int num_vals = get_Psi_n_conds(node);
2151 assert(node->op == op_Psi);
2152 assert(pos < num_vals);
2153 return get_irn_n(node, 2 * pos + 1);
2156 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2157 int num_vals = get_Psi_n_conds(node);
2158 assert(node->op == op_Psi);
2159 assert(pos < num_vals);
2160 set_irn_n(node, 2 * pos + 1, val);
2163 ir_node *get_Psi_default(ir_node *node) {
2164 int def_pos = get_irn_arity(node) - 1;
2165 assert(node->op == op_Psi);
2166 return get_irn_n(node, def_pos);
2169 void set_Psi_default(ir_node *node, ir_node *val) {
2170 int def_pos = get_irn_arity(node);
2171 assert(node->op == op_Psi);
2172 set_irn_n(node, def_pos, val);
2175 int (get_Psi_n_conds)(ir_node *node) {
2176 return _get_Psi_n_conds(node);
2180 ir_node *get_CopyB_mem(ir_node *node) {
2181 assert(node->op == op_CopyB);
2182 return get_irn_n(node, 0);
2185 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2186 assert(node->op == op_CopyB);
2187 set_irn_n(node, 0, mem);
2190 ir_node *get_CopyB_dst(ir_node *node) {
2191 assert(node->op == op_CopyB);
2192 return get_irn_n(node, 1);
2195 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2196 assert(node->op == op_CopyB);
2197 set_irn_n(node, 1, dst);
2200 ir_node *get_CopyB_src (ir_node *node) {
2201 assert(node->op == op_CopyB);
2202 return get_irn_n(node, 2);
2205 void set_CopyB_src(ir_node *node, ir_node *src) {
2206 assert(node->op == op_CopyB);
2207 set_irn_n(node, 2, src);
2210 ir_type *get_CopyB_type(ir_node *node) {
2211 assert(node->op == op_CopyB);
2212 return node->attr.copyb.data_type;
2215 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2216 assert(node->op == op_CopyB && data_type);
2217 node->attr.copyb.data_type = data_type;
2222 get_InstOf_type(ir_node *node) {
2223 assert(node->op = op_InstOf);
2224 return node->attr.instof.type;
2228 set_InstOf_type(ir_node *node, ir_type *type) {
2229 assert(node->op = op_InstOf);
2230 node->attr.instof.type = type;
2234 get_InstOf_store(ir_node *node) {
2235 assert(node->op = op_InstOf);
2236 return get_irn_n(node, 0);
2240 set_InstOf_store(ir_node *node, ir_node *obj) {
2241 assert(node->op = op_InstOf);
2242 set_irn_n(node, 0, obj);
2246 get_InstOf_obj(ir_node *node) {
2247 assert(node->op = op_InstOf);
2248 return get_irn_n(node, 1);
2252 set_InstOf_obj(ir_node *node, ir_node *obj) {
2253 assert(node->op = op_InstOf);
2254 set_irn_n(node, 1, obj);
2257 /* Returns the memory input of a Raise operation. */
2259 get_Raise_mem(ir_node *node) {
2260 assert(node->op == op_Raise);
2261 return get_irn_n(node, 0);
2265 set_Raise_mem(ir_node *node, ir_node *mem) {
2266 assert(node->op == op_Raise);
2267 set_irn_n(node, 0, mem);
2271 get_Raise_exo_ptr(ir_node *node) {
2272 assert(node->op == op_Raise);
2273 return get_irn_n(node, 1);
2277 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2278 assert(node->op == op_Raise);
2279 set_irn_n(node, 1, exo_ptr);
2284 /* Returns the memory input of a Bound operation. */
2285 ir_node *get_Bound_mem(ir_node *bound) {
2286 assert(bound->op == op_Bound);
2287 return get_irn_n(bound, 0);
2290 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2291 assert(bound->op == op_Bound);
2292 set_irn_n(bound, 0, mem);
2295 /* Returns the index input of a Bound operation. */
2296 ir_node *get_Bound_index(ir_node *bound) {
2297 assert(bound->op == op_Bound);
2298 return get_irn_n(bound, 1);
2301 void set_Bound_index(ir_node *bound, ir_node *idx) {
2302 assert(bound->op == op_Bound);
2303 set_irn_n(bound, 1, idx);
2306 /* Returns the lower bound input of a Bound operation. */
2307 ir_node *get_Bound_lower(ir_node *bound) {
2308 assert(bound->op == op_Bound);
2309 return get_irn_n(bound, 2);
2312 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2313 assert(bound->op == op_Bound);
2314 set_irn_n(bound, 2, lower);
2317 /* Returns the upper bound input of a Bound operation. */
2318 ir_node *get_Bound_upper(ir_node *bound) {
2319 assert(bound->op == op_Bound);
2320 return get_irn_n(bound, 3);
2323 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2324 assert(bound->op == op_Bound);
2325 set_irn_n(bound, 3, upper);
2328 /* Return the operand of a Pin node. */
2329 ir_node *get_Pin_op(const ir_node *pin) {
2330 assert(pin->op == op_Pin);
2331 return get_irn_n(pin, 0);
2334 void set_Pin_op(ir_node *pin, ir_node *node) {
2335 assert(pin->op == op_Pin);
2336 set_irn_n(pin, 0, node);
2339 /* Return the assembler text of an ASM pseudo node. */
2340 const char *get_ASM_text(const ir_node *node) {
2341 assert(node->op == op_ASM);
2342 return get_id_str(node->attr.assem.asm_text);
2345 /* Return the input constraints for an ASM node. This is a flexible array. */
2346 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2347 assert(node->op == op_ASM);
2348 return node->attr.assem.inputs;
2351 /** Return the output constraints for an ASM node. This is a flexible array. */
2352 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2353 assert(node->op == op_ASM);
2354 return node->attr.assem.outputs;
2357 /* returns the graph of a node */
2359 get_irn_irg(const ir_node *node) {
2361 * Do not use get_nodes_Block() here, because this
2362 * will check the pinned state.
2363 * However even a 'wrong' block is always in the proper
2366 if (! is_Block(node))
2367 node = get_irn_n(node, -1);
2368 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2369 node = get_irn_n(node, -1);
2370 assert(get_irn_op(node) == op_Block);
2371 return node->attr.block.irg;
2375 /*----------------------------------------------------------------*/
2376 /* Auxiliary routines */
2377 /*----------------------------------------------------------------*/
2380 skip_Proj(ir_node *node) {
2381 /* don't assert node !!! */
2386 node = get_Proj_pred(node);
2392 skip_Proj_const(const ir_node *node) {
2393 /* don't assert node !!! */
2398 node = get_Proj_pred(node);
2404 skip_Tuple(ir_node *node) {
2408 if (!get_opt_normalize()) return node;
2411 if (get_irn_op(node) == op_Proj) {
2412 pred = get_Proj_pred(node);
2413 op = get_irn_op(pred);
2416 * Looks strange but calls get_irn_op() only once
2417 * in most often cases.
2419 if (op == op_Proj) { /* nested Tuple ? */
2420 pred = skip_Tuple(pred);
2421 op = get_irn_op(pred);
2423 if (op == op_Tuple) {
2424 node = get_Tuple_pred(pred, get_Proj_proj(node));
2427 } else if (op == op_Tuple) {
2428 node = get_Tuple_pred(pred, get_Proj_proj(node));
2435 /* returns operand of node if node is a Cast */
2436 ir_node *skip_Cast(ir_node *node) {
2437 if (get_irn_op(node) == op_Cast)
2438 return get_Cast_op(node);
2442 /* returns operand of node if node is a Confirm */
2443 ir_node *skip_Confirm(ir_node *node) {
2444 if (get_irn_op(node) == op_Confirm)
2445 return get_Confirm_value(node);
2449 /* skip all high-level ops */
2450 ir_node *skip_HighLevel(ir_node *node) {
2451 if (is_op_highlevel(get_irn_op(node)))
2452 return get_irn_n(node, 0);
2457 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2458 * than any other approach, as Id chains are resolved and all point to the real node, or
2459 * all id's are self loops.
2461 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2462 * a little bit "hand optimized".
2464 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2467 skip_Id(ir_node *node) {
2469 /* don't assert node !!! */
2471 if (!node || (node->op != op_Id)) return node;
2473 /* Don't use get_Id_pred(): We get into an endless loop for
2474 self-referencing Ids. */
2475 pred = node->in[0+1];
2477 if (pred->op != op_Id) return pred;
2479 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2480 ir_node *rem_pred, *res;
2482 if (pred->op != op_Id) return pred; /* shortcut */
2485 assert(get_irn_arity (node) > 0);
2487 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2488 res = skip_Id(rem_pred);
2489 if (res->op == op_Id) /* self-loop */ return node;
2491 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2498 void skip_Id_and_store(ir_node **node) {
2501 if (!n || (n->op != op_Id)) return;
2503 /* Don't use get_Id_pred(): We get into an endless loop for
2504 self-referencing Ids. */
2509 (is_Bad)(const ir_node *node) {
2510 return _is_Bad(node);
2514 (is_NoMem)(const ir_node *node) {
2515 return _is_NoMem(node);
2519 (is_Mod)(const ir_node *node) {
2520 return _is_Mod(node);
2524 (is_Div)(const ir_node *node) {
2525 return _is_Div(node);
2529 (is_DivMod)(const ir_node *node) {
2530 return _is_DivMod(node);
2534 (is_Quot)(const ir_node *node) {
2535 return _is_Quot(node);
2539 (is_Add)(const ir_node *node) {
2540 return _is_Add(node);
2544 (is_Sub)(const ir_node *node) {
2545 return _is_Sub(node);
2549 (is_Start)(const ir_node *node) {
2550 return _is_Start(node);
2554 (is_End)(const ir_node *node) {
2555 return _is_End(node);
2559 (is_Const)(const ir_node *node) {
2560 return _is_Const(node);
2564 (is_Conv)(const ir_node *node) {
2565 return _is_Conv(node);
2569 (is_no_Block)(const ir_node *node) {
2570 return _is_no_Block(node);
2574 (is_Block)(const ir_node *node) {
2575 return _is_Block(node);
2578 /* returns true if node is an Unknown node. */
2580 (is_Unknown)(const ir_node *node) {
2581 return _is_Unknown(node);
2584 /* returns true if node is a Return node. */
2586 (is_Return)(const ir_node *node) {
2587 return _is_Return(node);
2590 /* returns true if node is a Call node. */
2592 (is_Call)(const ir_node *node) {
2593 return _is_Call(node);
2596 /* returns true if node is a Sel node. */
2598 (is_Sel)(const ir_node *node) {
2599 return _is_Sel(node);
2602 /* returns true if node is a Mux node or a Psi with only one condition. */
2604 (is_Mux)(const ir_node *node) {
2605 return _is_Mux(node);
2608 /* returns true if node is a Load node. */
2610 (is_Load)(const ir_node *node) {
2611 return _is_Load(node);
2614 /* returns true if node is a Load node. */
2616 (is_Store)(const ir_node *node) {
2617 return _is_Store(node);
2620 /* returns true if node is a Sync node. */
2622 (is_Sync)(const ir_node *node) {
2623 return _is_Sync(node);
2626 /* returns true if node is a Confirm node. */
2628 (is_Confirm)(const ir_node *node) {
2629 return _is_Confirm(node);
2632 /* returns true if node is a Pin node. */
2634 (is_Pin)(const ir_node *node) {
2635 return _is_Pin(node);
2638 /* returns true if node is a SymConst node. */
2640 (is_SymConst)(const ir_node *node) {
2641 return _is_SymConst(node);
2644 /* returns true if node is a Cond node. */
2646 (is_Cond)(const ir_node *node) {
2647 return _is_Cond(node);
2651 (is_CopyB)(const ir_node *node) {
2652 return _is_CopyB(node);
2655 /* returns true if node is a Cmp node. */
2657 (is_Cmp)(const ir_node *node) {
2658 return _is_Cmp(node);
2661 /* returns true if node is an Alloc node. */
2663 (is_Alloc)(const ir_node *node) {
2664 return _is_Alloc(node);
2667 /* returns true if a node is a Jmp node. */
2669 (is_Jmp)(const ir_node *node) {
2670 return _is_Jmp(node);
2673 /* returns true if a node is a Raise node. */
2675 (is_Raise)(const ir_node *node) {
2676 return _is_Raise(node);
2679 /* returns true if a node is an ASM node. */
2681 (is_ASM)(const ir_node *node) {
2682 return _is_ASM(node);
2686 is_Proj(const ir_node *node) {
2688 return node->op == op_Proj ||
2689 (!get_interprocedural_view() && node->op == op_Filter);
2692 /* Returns true if the operation manipulates control flow. */
2694 is_cfop(const ir_node *node) {
2695 return is_cfopcode(get_irn_op(node));
2698 /* Returns true if the operation manipulates interprocedural control flow:
2699 CallBegin, EndReg, EndExcept */
2700 int is_ip_cfop(const ir_node *node) {
2701 return is_ip_cfopcode(get_irn_op(node));
2704 /* Returns true if the operation can change the control flow because
2707 is_fragile_op(const ir_node *node) {
2708 return is_op_fragile(get_irn_op(node));
2711 /* Returns the memory operand of fragile operations. */
2712 ir_node *get_fragile_op_mem(ir_node *node) {
2713 assert(node && is_fragile_op(node));
2715 switch (get_irn_opcode(node)) {
2725 return get_irn_n(node, 0);
2730 assert(0 && "should not be reached");
2735 /* Returns the result mode of a Div operation. */
2736 ir_mode *get_divop_resmod(const ir_node *node) {
2737 switch (get_irn_opcode(node)) {
2738 case iro_Quot : return get_Quot_resmode(node);
2739 case iro_DivMod: return get_DivMod_resmode(node);
2740 case iro_Div : return get_Div_resmode(node);
2741 case iro_Mod : return get_Mod_resmode(node);
2743 assert(0 && "should not be reached");
2748 /* Returns true if the operation is a forking control flow operation. */
2749 int (is_irn_forking)(const ir_node *node) {
2750 return _is_irn_forking(node);
2753 /* Return the type associated with the value produced by n
2754 * if the node remarks this type as it is the case for
2755 * Cast, Const, SymConst and some Proj nodes. */
2756 ir_type *(get_irn_type)(ir_node *node) {
2757 return _get_irn_type(node);
2760 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2762 ir_type *(get_irn_type_attr)(ir_node *node) {
2763 return _get_irn_type_attr(node);
2766 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2767 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2768 return _get_irn_entity_attr(node);
2771 /* Returns non-zero for constant-like nodes. */
2772 int (is_irn_constlike)(const ir_node *node) {
2773 return _is_irn_constlike(node);
2777 * Returns non-zero for nodes that are allowed to have keep-alives and
2778 * are neither Block nor PhiM.
2780 int (is_irn_keep)(const ir_node *node) {
2781 return _is_irn_keep(node);
2785 * Returns non-zero for nodes that are always placed in the start block.
2787 int (is_irn_start_block_placed)(const ir_node *node) {
2788 return _is_irn_start_block_placed(node);
2791 /* Returns non-zero for nodes that are machine operations. */
2792 int (is_irn_machine_op)(const ir_node *node) {
2793 return _is_irn_machine_op(node);
2796 /* Returns non-zero for nodes that are machine operands. */
2797 int (is_irn_machine_operand)(const ir_node *node) {
2798 return _is_irn_machine_operand(node);
2801 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2802 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2803 return _is_irn_machine_user(node, n);
2807 /* Gets the string representation of the jump prediction .*/
2808 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2811 case COND_JMP_PRED_NONE: return "no prediction";
2812 case COND_JMP_PRED_TRUE: return "true taken";
2813 case COND_JMP_PRED_FALSE: return "false taken";
2817 /* Returns the conditional jump prediction of a Cond node. */
2818 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2819 return _get_Cond_jmp_pred(cond);
2822 /* Sets a new conditional jump prediction. */
2823 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2824 _set_Cond_jmp_pred(cond, pred);
2827 /** the get_type operation must be always implemented and return a firm type */
2828 static ir_type *get_Default_type(ir_node *n) {
2829 return get_unknown_type();
2832 /* Sets the get_type operation for an ir_op_ops. */
2833 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2835 case iro_Const: ops->get_type = get_Const_type; break;
2836 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2837 case iro_Cast: ops->get_type = get_Cast_type; break;
2838 case iro_Proj: ops->get_type = get_Proj_type; break;
2840 /* not allowed to be NULL */
2841 if (! ops->get_type)
2842 ops->get_type = get_Default_type;
2848 /** Return the attribute type of a SymConst node if exists */
2849 static ir_type *get_SymConst_attr_type(ir_node *self) {
2850 symconst_kind kind = get_SymConst_kind(self);
2851 if (SYMCONST_HAS_TYPE(kind))
2852 return get_SymConst_type(self);
2856 /** Return the attribute entity of a SymConst node if exists */
2857 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
2858 symconst_kind kind = get_SymConst_kind(self);
2859 if (SYMCONST_HAS_ENT(kind))
2860 return get_SymConst_entity(self);
2864 /** the get_type_attr operation must be always implemented */
2865 static ir_type *get_Null_type(ir_node *n) {
2866 return firm_unknown_type;
2869 /* Sets the get_type operation for an ir_op_ops. */
2870 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
2872 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2873 case iro_Call: ops->get_type_attr = get_Call_type; break;
2874 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2875 case iro_Free: ops->get_type_attr = get_Free_type; break;
2876 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2878 /* not allowed to be NULL */
2879 if (! ops->get_type_attr)
2880 ops->get_type_attr = get_Null_type;
2886 /** the get_entity_attr operation must be always implemented */
2887 static ir_entity *get_Null_ent(ir_node *n) {
2891 /* Sets the get_type operation for an ir_op_ops. */
2892 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
2894 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2895 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2897 /* not allowed to be NULL */
2898 if (! ops->get_entity_attr)
2899 ops->get_entity_attr = get_Null_ent;
2905 #ifdef DEBUG_libfirm
2906 void dump_irn(ir_node *n) {
2907 int i, arity = get_irn_arity(n);
2908 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2910 ir_node *pred = get_irn_n(n, -1);
2911 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2912 get_irn_node_nr(pred), (void *)pred);
2914 printf(" preds: \n");
2915 for (i = 0; i < arity; ++i) {
2916 ir_node *pred = get_irn_n(n, i);
2917 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2918 get_irn_node_nr(pred), (void *)pred);
2922 #else /* DEBUG_libfirm */
2923 void dump_irn(ir_node *n) {}
2924 #endif /* DEBUG_libfirm */