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.matured;
739 set_Block_matured(ir_node *node, int matured) {
740 assert(node->op == op_Block);
741 node->attr.block.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;
850 get_End_n_keepalives(ir_node *end) {
851 assert(end->op == op_End);
852 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
856 get_End_keepalive(ir_node *end, int pos) {
857 assert(end->op == op_End);
858 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
862 add_End_keepalive (ir_node *end, ir_node *ka) {
863 assert(end->op == op_End);
864 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
869 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
870 assert(end->op == op_End);
871 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
874 /* Set new keep-alives */
875 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
877 ir_graph *irg = get_irn_irg(end);
879 /* notify that edges are deleted */
880 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
881 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
883 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
885 for (i = 0; i < n; ++i) {
886 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
887 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
891 /* Set new keep-alives from old keep-alives, skipping irn */
892 void remove_End_keepalive(ir_node *end, ir_node *irn) {
893 int n = get_End_n_keepalives(end);
897 NEW_ARR_A(ir_node *, in, n);
899 for (idx = i = 0; i < n; ++i) {
900 ir_node *old_ka = get_End_keepalive(end, i);
907 /* set new keep-alives */
908 set_End_keepalives(end, idx, in);
912 free_End (ir_node *end) {
913 assert(end->op == op_End);
916 end->in = NULL; /* @@@ make sure we get an error if we use the
917 in array afterwards ... */
920 /* Return the target address of an IJmp */
921 ir_node *get_IJmp_target(ir_node *ijmp) {
922 assert(ijmp->op == op_IJmp);
923 return get_irn_n(ijmp, 0);
926 /** Sets the target address of an IJmp */
927 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
928 assert(ijmp->op == op_IJmp);
929 set_irn_n(ijmp, 0, tgt);
933 > Implementing the case construct (which is where the constant Proj node is
934 > important) involves far more than simply determining the constant values.
935 > We could argue that this is more properly a function of the translator from
936 > Firm to the target machine. That could be done if there was some way of
937 > projecting "default" out of the Cond node.
938 I know it's complicated.
939 Basically there are two proglems:
940 - determining the gaps between the projs
941 - determining the biggest case constant to know the proj number for
943 I see several solutions:
944 1. Introduce a ProjDefault node. Solves both problems.
945 This means to extend all optimizations executed during construction.
946 2. Give the Cond node for switch two flavors:
947 a) there are no gaps in the projs (existing flavor)
948 b) gaps may exist, default proj is still the Proj with the largest
949 projection number. This covers also the gaps.
950 3. Fix the semantic of the Cond to that of 2b)
952 Solution 2 seems to be the best:
953 Computing the gaps in the Firm representation is not too hard, i.e.,
954 libFIRM can implement a routine that transforms between the two
955 flavours. This is also possible for 1) but 2) does not require to
956 change any existing optimization.
957 Further it should be far simpler to determine the biggest constant than
959 I don't want to choose 3) as 2a) seems to have advantages for
960 dataflow analysis and 3) does not allow to convert the representation to
964 get_Cond_selector(ir_node *node) {
965 assert(node->op == op_Cond);
966 return get_irn_n(node, 0);
970 set_Cond_selector(ir_node *node, ir_node *selector) {
971 assert(node->op == op_Cond);
972 set_irn_n(node, 0, selector);
976 get_Cond_kind(ir_node *node) {
977 assert(node->op == op_Cond);
978 return node->attr.cond.kind;
982 set_Cond_kind(ir_node *node, cond_kind kind) {
983 assert(node->op == op_Cond);
984 node->attr.cond.kind = kind;
988 get_Cond_defaultProj(ir_node *node) {
989 assert(node->op == op_Cond);
990 return node->attr.cond.default_proj;
994 get_Return_mem(ir_node *node) {
995 assert(node->op == op_Return);
996 return get_irn_n(node, 0);
1000 set_Return_mem(ir_node *node, ir_node *mem) {
1001 assert(node->op == op_Return);
1002 set_irn_n(node, 0, mem);
1006 get_Return_n_ress(ir_node *node) {
1007 assert(node->op == op_Return);
1008 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1012 get_Return_res_arr (ir_node *node) {
1013 assert((node->op == op_Return));
1014 if (get_Return_n_ress(node) > 0)
1015 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1022 set_Return_n_res(ir_node *node, int results) {
1023 assert(node->op == op_Return);
1028 get_Return_res(ir_node *node, int pos) {
1029 assert(node->op == op_Return);
1030 assert(get_Return_n_ress(node) > pos);
1031 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1035 set_Return_res(ir_node *node, int pos, ir_node *res){
1036 assert(node->op == op_Return);
1037 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1040 tarval *(get_Const_tarval)(const ir_node *node) {
1041 return _get_Const_tarval(node);
1045 set_Const_tarval(ir_node *node, tarval *con) {
1046 assert(node->op == op_Const);
1047 node->attr.con.tv = con;
1050 cnst_classify_t (classify_Const)(ir_node *node) {
1051 return _classify_Const(node);
1055 /* The source language type. Must be an atomic type. Mode of type must
1056 be mode of node. For tarvals from entities type must be pointer to
1059 get_Const_type(ir_node *node) {
1060 assert(node->op == op_Const);
1061 return node->attr.con.tp;
1065 set_Const_type(ir_node *node, ir_type *tp) {
1066 assert(node->op == op_Const);
1067 if (tp != firm_unknown_type) {
1068 assert(is_atomic_type(tp));
1069 assert(get_type_mode(tp) == get_irn_mode(node));
1071 node->attr.con.tp = tp;
1076 get_SymConst_kind(const ir_node *node) {
1077 assert(node->op == op_SymConst);
1078 return node->attr.symc.num;
1082 set_SymConst_kind(ir_node *node, symconst_kind num) {
1083 assert(node->op == op_SymConst);
1084 node->attr.symc.num = num;
1088 get_SymConst_type(ir_node *node) {
1089 assert((node->op == op_SymConst) &&
1090 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1091 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1095 set_SymConst_type(ir_node *node, ir_type *tp) {
1096 assert((node->op == op_SymConst) &&
1097 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1098 node->attr.symc.sym.type_p = tp;
1102 get_SymConst_name(const ir_node *node) {
1103 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1104 return node->attr.symc.sym.ident_p;
1108 set_SymConst_name(ir_node *node, ident *name) {
1109 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1110 node->attr.symc.sym.ident_p = name;
1114 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1115 ir_entity *get_SymConst_entity(const ir_node *node) {
1116 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1117 return node->attr.symc.sym.entity_p;
1120 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1121 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1122 node->attr.symc.sym.entity_p = ent;
1125 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1126 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1127 return node->attr.symc.sym.enum_p;
1130 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1131 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1132 node->attr.symc.sym.enum_p = ec;
1135 union symconst_symbol
1136 get_SymConst_symbol(const ir_node *node) {
1137 assert(node->op == op_SymConst);
1138 return node->attr.symc.sym;
1142 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1143 assert(node->op == op_SymConst);
1144 node->attr.symc.sym = sym;
1148 get_SymConst_value_type(ir_node *node) {
1149 assert(node->op == op_SymConst);
1150 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1151 return node->attr.symc.tp;
1155 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1156 assert(node->op == op_SymConst);
1157 node->attr.symc.tp = tp;
1161 get_Sel_mem(ir_node *node) {
1162 assert(node->op == op_Sel);
1163 return get_irn_n(node, 0);
1167 set_Sel_mem(ir_node *node, ir_node *mem) {
1168 assert(node->op == op_Sel);
1169 set_irn_n(node, 0, mem);
1173 get_Sel_ptr(ir_node *node) {
1174 assert(node->op == op_Sel);
1175 return get_irn_n(node, 1);
1179 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1180 assert(node->op == op_Sel);
1181 set_irn_n(node, 1, ptr);
1185 get_Sel_n_indexs(ir_node *node) {
1186 assert(node->op == op_Sel);
1187 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1191 get_Sel_index_arr(ir_node *node) {
1192 assert((node->op == op_Sel));
1193 if (get_Sel_n_indexs(node) > 0)
1194 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1200 get_Sel_index(ir_node *node, int pos) {
1201 assert(node->op == op_Sel);
1202 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1206 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1207 assert(node->op == op_Sel);
1208 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1212 get_Sel_entity(ir_node *node) {
1213 assert(node->op == op_Sel);
1214 return node->attr.sel.ent;
1218 set_Sel_entity(ir_node *node, ir_entity *ent) {
1219 assert(node->op == op_Sel);
1220 node->attr.sel.ent = ent;
1224 /* For unary and binary arithmetic operations the access to the
1225 operands can be factored out. Left is the first, right the
1226 second arithmetic value as listed in tech report 0999-33.
1227 unops are: Minus, Abs, Not, Conv, Cast
1228 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1229 Shr, Shrs, Rotate, Cmp */
1233 get_Call_mem(ir_node *node) {
1234 assert(node->op == op_Call);
1235 return get_irn_n(node, 0);
1239 set_Call_mem(ir_node *node, ir_node *mem) {
1240 assert(node->op == op_Call);
1241 set_irn_n(node, 0, mem);
1245 get_Call_ptr(ir_node *node) {
1246 assert(node->op == op_Call);
1247 return get_irn_n(node, 1);
1251 set_Call_ptr(ir_node *node, ir_node *ptr) {
1252 assert(node->op == op_Call);
1253 set_irn_n(node, 1, ptr);
1257 get_Call_param_arr(ir_node *node) {
1258 assert(node->op == op_Call);
1259 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1263 get_Call_n_params(ir_node *node) {
1264 assert(node->op == op_Call);
1265 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1269 get_Call_arity(ir_node *node) {
1270 assert(node->op == op_Call);
1271 return get_Call_n_params(node);
1275 set_Call_arity(ir_node *node, ir_node *arity) {
1276 assert(node->op == op_Call);
1281 get_Call_param(ir_node *node, int pos) {
1282 assert(node->op == op_Call);
1283 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1287 set_Call_param(ir_node *node, int pos, ir_node *param) {
1288 assert(node->op == op_Call);
1289 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1293 get_Call_type(ir_node *node) {
1294 assert(node->op == op_Call);
1295 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1299 set_Call_type(ir_node *node, ir_type *tp) {
1300 assert(node->op == op_Call);
1301 assert((get_unknown_type() == tp) || is_Method_type(tp));
1302 node->attr.call.cld_tp = tp;
1305 int Call_has_callees(ir_node *node) {
1306 assert(node && node->op == op_Call);
1307 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1308 (node->attr.call.callee_arr != NULL));
1311 int get_Call_n_callees(ir_node * node) {
1312 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1313 return ARR_LEN(node->attr.call.callee_arr);
1316 ir_entity * get_Call_callee(ir_node * node, int pos) {
1317 assert(pos >= 0 && pos < get_Call_n_callees(node));
1318 return node->attr.call.callee_arr[pos];
1321 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1322 assert(node->op == op_Call);
1323 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1324 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1326 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1329 void remove_Call_callee_arr(ir_node * node) {
1330 assert(node->op == op_Call);
1331 node->attr.call.callee_arr = NULL;
1334 ir_node * get_CallBegin_ptr(ir_node *node) {
1335 assert(node->op == op_CallBegin);
1336 return get_irn_n(node, 0);
1339 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1340 assert(node->op == op_CallBegin);
1341 set_irn_n(node, 0, ptr);
1344 ir_node * get_CallBegin_call(ir_node *node) {
1345 assert(node->op == op_CallBegin);
1346 return node->attr.callbegin.call;
1349 void set_CallBegin_call(ir_node *node, ir_node *call) {
1350 assert(node->op == op_CallBegin);
1351 node->attr.callbegin.call = call;
1356 ir_node * get_##OP##_left(const ir_node *node) { \
1357 assert(node->op == op_##OP); \
1358 return get_irn_n(node, node->op->op_index); \
1360 void set_##OP##_left(ir_node *node, ir_node *left) { \
1361 assert(node->op == op_##OP); \
1362 set_irn_n(node, node->op->op_index, left); \
1364 ir_node *get_##OP##_right(const ir_node *node) { \
1365 assert(node->op == op_##OP); \
1366 return get_irn_n(node, node->op->op_index + 1); \
1368 void set_##OP##_right(ir_node *node, ir_node *right) { \
1369 assert(node->op == op_##OP); \
1370 set_irn_n(node, node->op->op_index + 1, right); \
1374 ir_node *get_##OP##_op(const ir_node *node) { \
1375 assert(node->op == op_##OP); \
1376 return get_irn_n(node, node->op->op_index); \
1378 void set_##OP##_op (ir_node *node, ir_node *op) { \
1379 assert(node->op == op_##OP); \
1380 set_irn_n(node, node->op->op_index, op); \
1383 #define BINOP_MEM(OP) \
1387 get_##OP##_mem(ir_node *node) { \
1388 assert(node->op == op_##OP); \
1389 return get_irn_n(node, 0); \
1393 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1394 assert(node->op == op_##OP); \
1395 set_irn_n(node, 0, mem); \
1401 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1402 assert(node->op == op_##OP); \
1403 return node->attr.divmod.res_mode; \
1406 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1407 assert(node->op == op_##OP); \
1408 node->attr.divmod.res_mode = mode; \
1433 int get_Conv_strict(ir_node *node) {
1434 assert(node->op == op_Conv);
1435 return node->attr.conv.strict;
1438 void set_Conv_strict(ir_node *node, int strict_flag) {
1439 assert(node->op == op_Conv);
1440 node->attr.conv.strict = (char)strict_flag;
1444 get_Cast_type(ir_node *node) {
1445 assert(node->op == op_Cast);
1446 return node->attr.cast.totype;
1450 set_Cast_type(ir_node *node, ir_type *to_tp) {
1451 assert(node->op == op_Cast);
1452 node->attr.cast.totype = to_tp;
1456 /* Checks for upcast.
1458 * Returns true if the Cast node casts a class type to a super type.
1460 int is_Cast_upcast(ir_node *node) {
1461 ir_type *totype = get_Cast_type(node);
1462 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1463 ir_graph *myirg = get_irn_irg(node);
1465 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1468 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1469 totype = get_pointer_points_to_type(totype);
1470 fromtype = get_pointer_points_to_type(fromtype);
1475 if (!is_Class_type(totype)) return 0;
1476 return is_SubClass_of(fromtype, totype);
1479 /* Checks for downcast.
1481 * Returns true if the Cast node casts a class type to a sub type.
1483 int is_Cast_downcast(ir_node *node) {
1484 ir_type *totype = get_Cast_type(node);
1485 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1487 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1490 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1491 totype = get_pointer_points_to_type(totype);
1492 fromtype = get_pointer_points_to_type(fromtype);
1497 if (!is_Class_type(totype)) return 0;
1498 return is_SubClass_of(totype, fromtype);
1502 (is_unop)(const ir_node *node) {
1503 return _is_unop(node);
1507 get_unop_op(const ir_node *node) {
1508 if (node->op->opar == oparity_unary)
1509 return get_irn_n(node, node->op->op_index);
1511 assert(node->op->opar == oparity_unary);
1516 set_unop_op(ir_node *node, ir_node *op) {
1517 if (node->op->opar == oparity_unary)
1518 set_irn_n(node, node->op->op_index, op);
1520 assert(node->op->opar == oparity_unary);
1524 (is_binop)(const ir_node *node) {
1525 return _is_binop(node);
1529 get_binop_left(const ir_node *node) {
1530 assert(node->op->opar == oparity_binary);
1531 return get_irn_n(node, node->op->op_index);
1535 set_binop_left(ir_node *node, ir_node *left) {
1536 assert(node->op->opar == oparity_binary);
1537 set_irn_n(node, node->op->op_index, left);
1541 get_binop_right(const ir_node *node) {
1542 assert(node->op->opar == oparity_binary);
1543 return get_irn_n(node, node->op->op_index + 1);
1547 set_binop_right(ir_node *node, ir_node *right) {
1548 assert(node->op->opar == oparity_binary);
1549 set_irn_n(node, node->op->op_index + 1, right);
1552 int is_Phi(const ir_node *n) {
1558 if (op == op_Filter) return get_interprocedural_view();
1561 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1562 (get_irn_arity(n) > 0));
1567 int is_Phi0(const ir_node *n) {
1570 return ((get_irn_op(n) == op_Phi) &&
1571 (get_irn_arity(n) == 0) &&
1572 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1576 get_Phi_preds_arr(ir_node *node) {
1577 assert(node->op == op_Phi);
1578 return (ir_node **)&(get_irn_in(node)[1]);
1582 get_Phi_n_preds(const ir_node *node) {
1583 assert(is_Phi(node) || is_Phi0(node));
1584 return (get_irn_arity(node));
1588 void set_Phi_n_preds(ir_node *node, int n_preds) {
1589 assert(node->op == op_Phi);
1594 get_Phi_pred(const ir_node *node, int pos) {
1595 assert(is_Phi(node) || is_Phi0(node));
1596 return get_irn_n(node, pos);
1600 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1601 assert(is_Phi(node) || is_Phi0(node));
1602 set_irn_n(node, pos, pred);
1606 int is_memop(ir_node *node) {
1607 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1610 ir_node *get_memop_mem(ir_node *node) {
1611 assert(is_memop(node));
1612 return get_irn_n(node, 0);
1615 void set_memop_mem(ir_node *node, ir_node *mem) {
1616 assert(is_memop(node));
1617 set_irn_n(node, 0, mem);
1620 ir_node *get_memop_ptr(ir_node *node) {
1621 assert(is_memop(node));
1622 return get_irn_n(node, 1);
1625 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1626 assert(is_memop(node));
1627 set_irn_n(node, 1, ptr);
1631 get_Load_mem(ir_node *node) {
1632 assert(node->op == op_Load);
1633 return get_irn_n(node, 0);
1637 set_Load_mem(ir_node *node, ir_node *mem) {
1638 assert(node->op == op_Load);
1639 set_irn_n(node, 0, mem);
1643 get_Load_ptr(ir_node *node) {
1644 assert(node->op == op_Load);
1645 return get_irn_n(node, 1);
1649 set_Load_ptr(ir_node *node, ir_node *ptr) {
1650 assert(node->op == op_Load);
1651 set_irn_n(node, 1, ptr);
1655 get_Load_mode(ir_node *node) {
1656 assert(node->op == op_Load);
1657 return node->attr.load.load_mode;
1661 set_Load_mode(ir_node *node, ir_mode *mode) {
1662 assert(node->op == op_Load);
1663 node->attr.load.load_mode = mode;
1667 get_Load_volatility(ir_node *node) {
1668 assert(node->op == op_Load);
1669 return node->attr.load.volatility;
1673 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1674 assert(node->op == op_Load);
1675 node->attr.load.volatility = volatility;
1680 get_Store_mem(ir_node *node) {
1681 assert(node->op == op_Store);
1682 return get_irn_n(node, 0);
1686 set_Store_mem(ir_node *node, ir_node *mem) {
1687 assert(node->op == op_Store);
1688 set_irn_n(node, 0, mem);
1692 get_Store_ptr(ir_node *node) {
1693 assert(node->op == op_Store);
1694 return get_irn_n(node, 1);
1698 set_Store_ptr(ir_node *node, ir_node *ptr) {
1699 assert(node->op == op_Store);
1700 set_irn_n(node, 1, ptr);
1704 get_Store_value(ir_node *node) {
1705 assert(node->op == op_Store);
1706 return get_irn_n(node, 2);
1710 set_Store_value(ir_node *node, ir_node *value) {
1711 assert(node->op == op_Store);
1712 set_irn_n(node, 2, value);
1716 get_Store_volatility(ir_node *node) {
1717 assert(node->op == op_Store);
1718 return node->attr.store.volatility;
1722 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1723 assert(node->op == op_Store);
1724 node->attr.store.volatility = volatility;
1729 get_Alloc_mem(ir_node *node) {
1730 assert(node->op == op_Alloc);
1731 return get_irn_n(node, 0);
1735 set_Alloc_mem(ir_node *node, ir_node *mem) {
1736 assert(node->op == op_Alloc);
1737 set_irn_n(node, 0, mem);
1741 get_Alloc_size(ir_node *node) {
1742 assert(node->op == op_Alloc);
1743 return get_irn_n(node, 1);
1747 set_Alloc_size(ir_node *node, ir_node *size) {
1748 assert(node->op == op_Alloc);
1749 set_irn_n(node, 1, size);
1753 get_Alloc_type(ir_node *node) {
1754 assert(node->op == op_Alloc);
1755 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1759 set_Alloc_type(ir_node *node, ir_type *tp) {
1760 assert(node->op == op_Alloc);
1761 node->attr.alloc.type = tp;
1765 get_Alloc_where(ir_node *node) {
1766 assert(node->op == op_Alloc);
1767 return node->attr.alloc.where;
1771 set_Alloc_where(ir_node *node, where_alloc where) {
1772 assert(node->op == op_Alloc);
1773 node->attr.alloc.where = where;
1778 get_Free_mem(ir_node *node) {
1779 assert(node->op == op_Free);
1780 return get_irn_n(node, 0);
1784 set_Free_mem(ir_node *node, ir_node *mem) {
1785 assert(node->op == op_Free);
1786 set_irn_n(node, 0, mem);
1790 get_Free_ptr(ir_node *node) {
1791 assert(node->op == op_Free);
1792 return get_irn_n(node, 1);
1796 set_Free_ptr(ir_node *node, ir_node *ptr) {
1797 assert(node->op == op_Free);
1798 set_irn_n(node, 1, ptr);
1802 get_Free_size(ir_node *node) {
1803 assert(node->op == op_Free);
1804 return get_irn_n(node, 2);
1808 set_Free_size(ir_node *node, ir_node *size) {
1809 assert(node->op == op_Free);
1810 set_irn_n(node, 2, size);
1814 get_Free_type(ir_node *node) {
1815 assert(node->op == op_Free);
1816 return node->attr.free.type = skip_tid(node->attr.free.type);
1820 set_Free_type(ir_node *node, ir_type *tp) {
1821 assert(node->op == op_Free);
1822 node->attr.free.type = tp;
1826 get_Free_where(ir_node *node) {
1827 assert(node->op == op_Free);
1828 return node->attr.free.where;
1832 set_Free_where(ir_node *node, where_alloc where) {
1833 assert(node->op == op_Free);
1834 node->attr.free.where = where;
1837 ir_node **get_Sync_preds_arr(ir_node *node) {
1838 assert(node->op == op_Sync);
1839 return (ir_node **)&(get_irn_in(node)[1]);
1842 int get_Sync_n_preds(ir_node *node) {
1843 assert(node->op == op_Sync);
1844 return (get_irn_arity(node));
1848 void set_Sync_n_preds(ir_node *node, int n_preds) {
1849 assert(node->op == op_Sync);
1853 ir_node *get_Sync_pred(ir_node *node, int pos) {
1854 assert(node->op == op_Sync);
1855 return get_irn_n(node, pos);
1858 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1859 assert(node->op == op_Sync);
1860 set_irn_n(node, pos, pred);
1863 /* Add a new Sync predecessor */
1864 void add_Sync_pred(ir_node *node, ir_node *pred) {
1865 assert(node->op == op_Sync);
1866 add_irn_n(node, pred);
1869 /* Returns the source language type of a Proj node. */
1870 ir_type *get_Proj_type(ir_node *n) {
1871 ir_type *tp = firm_unknown_type;
1872 ir_node *pred = get_Proj_pred(n);
1874 switch (get_irn_opcode(pred)) {
1877 /* Deal with Start / Call here: we need to know the Proj Nr. */
1878 assert(get_irn_mode(pred) == mode_T);
1879 pred_pred = get_Proj_pred(pred);
1880 if (get_irn_op(pred_pred) == op_Start) {
1881 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1882 tp = get_method_param_type(mtp, get_Proj_proj(n));
1883 } else if (get_irn_op(pred_pred) == op_Call) {
1884 ir_type *mtp = get_Call_type(pred_pred);
1885 tp = get_method_res_type(mtp, get_Proj_proj(n));
1888 case iro_Start: break;
1889 case iro_Call: break;
1891 ir_node *a = get_Load_ptr(pred);
1893 tp = get_entity_type(get_Sel_entity(a));
1902 get_Proj_pred(const ir_node *node) {
1903 assert(is_Proj(node));
1904 return get_irn_n(node, 0);
1908 set_Proj_pred(ir_node *node, ir_node *pred) {
1909 assert(is_Proj(node));
1910 set_irn_n(node, 0, pred);
1913 long get_VProj_proj(const ir_node *node)
1915 return node->attr.proj;
1918 void set_VProj_proj(ir_node *node, long value)
1920 node->attr.proj = value;
1924 get_Proj_proj(const ir_node *node) {
1925 assert(is_Proj(node));
1926 if (get_irn_opcode(node) == iro_Proj) {
1927 return node->attr.proj;
1929 assert(get_irn_opcode(node) == iro_Filter);
1930 return node->attr.filter.proj;
1935 set_Proj_proj(ir_node *node, long proj) {
1936 assert(node->op == op_Proj);
1937 node->attr.proj = proj;
1941 get_Tuple_preds_arr(ir_node *node) {
1942 assert(node->op == op_Tuple);
1943 return (ir_node **)&(get_irn_in(node)[1]);
1947 get_Tuple_n_preds(ir_node *node) {
1948 assert(node->op == op_Tuple);
1949 return (get_irn_arity(node));
1954 set_Tuple_n_preds(ir_node *node, int n_preds) {
1955 assert(node->op == op_Tuple);
1960 get_Tuple_pred (ir_node *node, int pos) {
1961 assert(node->op == op_Tuple);
1962 return get_irn_n(node, pos);
1966 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
1967 assert(node->op == op_Tuple);
1968 set_irn_n(node, pos, pred);
1972 get_Id_pred(ir_node *node) {
1973 assert(node->op == op_Id);
1974 return get_irn_n(node, 0);
1978 set_Id_pred(ir_node *node, ir_node *pred) {
1979 assert(node->op == op_Id);
1980 set_irn_n(node, 0, pred);
1983 ir_node *get_Confirm_value(ir_node *node) {
1984 assert(node->op == op_Confirm);
1985 return get_irn_n(node, 0);
1988 void set_Confirm_value(ir_node *node, ir_node *value) {
1989 assert(node->op == op_Confirm);
1990 set_irn_n(node, 0, value);
1993 ir_node *get_Confirm_bound(ir_node *node) {
1994 assert(node->op == op_Confirm);
1995 return get_irn_n(node, 1);
1998 void set_Confirm_bound(ir_node *node, ir_node *bound) {
1999 assert(node->op == op_Confirm);
2000 set_irn_n(node, 0, bound);
2003 pn_Cmp get_Confirm_cmp(ir_node *node) {
2004 assert(node->op == op_Confirm);
2005 return node->attr.confirm_cmp;
2008 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2009 assert(node->op == op_Confirm);
2010 node->attr.confirm_cmp = cmp;
2015 get_Filter_pred(ir_node *node) {
2016 assert(node->op == op_Filter);
2021 set_Filter_pred(ir_node *node, ir_node *pred) {
2022 assert(node->op == op_Filter);
2027 get_Filter_proj(ir_node *node) {
2028 assert(node->op == op_Filter);
2029 return node->attr.filter.proj;
2033 set_Filter_proj(ir_node *node, long proj) {
2034 assert(node->op == op_Filter);
2035 node->attr.filter.proj = proj;
2038 /* Don't use get_irn_arity, get_irn_n in implementation as access
2039 shall work independent of view!!! */
2040 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2041 assert(node->op == op_Filter);
2042 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2043 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2044 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2045 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2046 node->attr.filter.in_cg[0] = node->in[0];
2048 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2051 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2052 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2053 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2054 node->attr.filter.in_cg[pos + 1] = pred;
2057 int get_Filter_n_cg_preds(ir_node *node) {
2058 assert(node->op == op_Filter && node->attr.filter.in_cg);
2059 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2062 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2064 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2066 arity = ARR_LEN(node->attr.filter.in_cg);
2067 assert(pos < arity - 1);
2068 return node->attr.filter.in_cg[pos + 1];
2072 ir_node *get_Mux_sel(ir_node *node) {
2073 if (node->op == op_Psi) {
2074 assert(get_irn_arity(node) == 3);
2075 return get_Psi_cond(node, 0);
2077 assert(node->op == op_Mux);
2081 void set_Mux_sel(ir_node *node, ir_node *sel) {
2082 if (node->op == op_Psi) {
2083 assert(get_irn_arity(node) == 3);
2084 set_Psi_cond(node, 0, sel);
2086 assert(node->op == op_Mux);
2091 ir_node *get_Mux_false(ir_node *node) {
2092 if (node->op == op_Psi) {
2093 assert(get_irn_arity(node) == 3);
2094 return get_Psi_default(node);
2096 assert(node->op == op_Mux);
2100 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2101 if (node->op == op_Psi) {
2102 assert(get_irn_arity(node) == 3);
2103 set_Psi_default(node, ir_false);
2105 assert(node->op == op_Mux);
2106 node->in[2] = ir_false;
2110 ir_node *get_Mux_true(ir_node *node) {
2111 if (node->op == op_Psi) {
2112 assert(get_irn_arity(node) == 3);
2113 return get_Psi_val(node, 0);
2115 assert(node->op == op_Mux);
2119 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2120 if (node->op == op_Psi) {
2121 assert(get_irn_arity(node) == 3);
2122 set_Psi_val(node, 0, ir_true);
2124 assert(node->op == op_Mux);
2125 node->in[3] = ir_true;
2130 ir_node *get_Psi_cond(ir_node *node, int pos) {
2131 int num_conds = get_Psi_n_conds(node);
2132 assert(node->op == op_Psi);
2133 assert(pos < num_conds);
2134 return get_irn_n(node, 2 * pos);
2137 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2138 int num_conds = get_Psi_n_conds(node);
2139 assert(node->op == op_Psi);
2140 assert(pos < num_conds);
2141 set_irn_n(node, 2 * pos, cond);
2144 ir_node *get_Psi_val(ir_node *node, int pos) {
2145 int num_vals = get_Psi_n_conds(node);
2146 assert(node->op == op_Psi);
2147 assert(pos < num_vals);
2148 return get_irn_n(node, 2 * pos + 1);
2151 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2152 int num_vals = get_Psi_n_conds(node);
2153 assert(node->op == op_Psi);
2154 assert(pos < num_vals);
2155 set_irn_n(node, 2 * pos + 1, val);
2158 ir_node *get_Psi_default(ir_node *node) {
2159 int def_pos = get_irn_arity(node) - 1;
2160 assert(node->op == op_Psi);
2161 return get_irn_n(node, def_pos);
2164 void set_Psi_default(ir_node *node, ir_node *val) {
2165 int def_pos = get_irn_arity(node);
2166 assert(node->op == op_Psi);
2167 set_irn_n(node, def_pos, val);
2170 int (get_Psi_n_conds)(ir_node *node) {
2171 return _get_Psi_n_conds(node);
2175 ir_node *get_CopyB_mem(ir_node *node) {
2176 assert(node->op == op_CopyB);
2177 return get_irn_n(node, 0);
2180 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2181 assert(node->op == op_CopyB);
2182 set_irn_n(node, 0, mem);
2185 ir_node *get_CopyB_dst(ir_node *node) {
2186 assert(node->op == op_CopyB);
2187 return get_irn_n(node, 1);
2190 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2191 assert(node->op == op_CopyB);
2192 set_irn_n(node, 1, dst);
2195 ir_node *get_CopyB_src (ir_node *node) {
2196 assert(node->op == op_CopyB);
2197 return get_irn_n(node, 2);
2200 void set_CopyB_src(ir_node *node, ir_node *src) {
2201 assert(node->op == op_CopyB);
2202 set_irn_n(node, 2, src);
2205 ir_type *get_CopyB_type(ir_node *node) {
2206 assert(node->op == op_CopyB);
2207 return node->attr.copyb.data_type;
2210 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2211 assert(node->op == op_CopyB && data_type);
2212 node->attr.copyb.data_type = data_type;
2217 get_InstOf_type(ir_node *node) {
2218 assert(node->op = op_InstOf);
2219 return node->attr.instof.type;
2223 set_InstOf_type(ir_node *node, ir_type *type) {
2224 assert(node->op = op_InstOf);
2225 node->attr.instof.type = type;
2229 get_InstOf_store(ir_node *node) {
2230 assert(node->op = op_InstOf);
2231 return get_irn_n(node, 0);
2235 set_InstOf_store(ir_node *node, ir_node *obj) {
2236 assert(node->op = op_InstOf);
2237 set_irn_n(node, 0, obj);
2241 get_InstOf_obj(ir_node *node) {
2242 assert(node->op = op_InstOf);
2243 return get_irn_n(node, 1);
2247 set_InstOf_obj(ir_node *node, ir_node *obj) {
2248 assert(node->op = op_InstOf);
2249 set_irn_n(node, 1, obj);
2252 /* Returns the memory input of a Raise operation. */
2254 get_Raise_mem(ir_node *node) {
2255 assert(node->op == op_Raise);
2256 return get_irn_n(node, 0);
2260 set_Raise_mem(ir_node *node, ir_node *mem) {
2261 assert(node->op == op_Raise);
2262 set_irn_n(node, 0, mem);
2266 get_Raise_exo_ptr(ir_node *node) {
2267 assert(node->op == op_Raise);
2268 return get_irn_n(node, 1);
2272 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2273 assert(node->op == op_Raise);
2274 set_irn_n(node, 1, exo_ptr);
2279 /* Returns the memory input of a Bound operation. */
2280 ir_node *get_Bound_mem(ir_node *bound) {
2281 assert(bound->op == op_Bound);
2282 return get_irn_n(bound, 0);
2285 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2286 assert(bound->op == op_Bound);
2287 set_irn_n(bound, 0, mem);
2290 /* Returns the index input of a Bound operation. */
2291 ir_node *get_Bound_index(ir_node *bound) {
2292 assert(bound->op == op_Bound);
2293 return get_irn_n(bound, 1);
2296 void set_Bound_index(ir_node *bound, ir_node *idx) {
2297 assert(bound->op == op_Bound);
2298 set_irn_n(bound, 1, idx);
2301 /* Returns the lower bound input of a Bound operation. */
2302 ir_node *get_Bound_lower(ir_node *bound) {
2303 assert(bound->op == op_Bound);
2304 return get_irn_n(bound, 2);
2307 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2308 assert(bound->op == op_Bound);
2309 set_irn_n(bound, 2, lower);
2312 /* Returns the upper bound input of a Bound operation. */
2313 ir_node *get_Bound_upper(ir_node *bound) {
2314 assert(bound->op == op_Bound);
2315 return get_irn_n(bound, 3);
2318 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2319 assert(bound->op == op_Bound);
2320 set_irn_n(bound, 3, upper);
2323 /* Return the operand of a Pin node. */
2324 ir_node *get_Pin_op(const ir_node *pin) {
2325 assert(pin->op == op_Pin);
2326 return get_irn_n(pin, 0);
2329 void set_Pin_op(ir_node *pin, ir_node *node) {
2330 assert(pin->op == op_Pin);
2331 set_irn_n(pin, 0, node);
2335 /* returns the graph of a node */
2337 get_irn_irg(const ir_node *node) {
2339 * Do not use get_nodes_Block() here, because this
2340 * will check the pinned state.
2341 * However even a 'wrong' block is always in the proper
2344 if (! is_Block(node))
2345 node = get_irn_n(node, -1);
2346 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2347 node = get_irn_n(node, -1);
2348 assert(get_irn_op(node) == op_Block);
2349 return node->attr.block.irg;
2353 /*----------------------------------------------------------------*/
2354 /* Auxiliary routines */
2355 /*----------------------------------------------------------------*/
2358 skip_Proj(ir_node *node) {
2359 /* don't assert node !!! */
2364 node = get_Proj_pred(node);
2370 skip_Proj_const(const ir_node *node) {
2371 /* don't assert node !!! */
2376 node = get_Proj_pred(node);
2382 skip_Tuple(ir_node *node) {
2386 if (!get_opt_normalize()) return node;
2389 if (get_irn_op(node) == op_Proj) {
2390 pred = get_Proj_pred(node);
2391 op = get_irn_op(pred);
2394 * Looks strange but calls get_irn_op() only once
2395 * in most often cases.
2397 if (op == op_Proj) { /* nested Tuple ? */
2398 pred = skip_Tuple(pred);
2399 op = get_irn_op(pred);
2401 if (op == op_Tuple) {
2402 node = get_Tuple_pred(pred, get_Proj_proj(node));
2405 } else if (op == op_Tuple) {
2406 node = get_Tuple_pred(pred, get_Proj_proj(node));
2413 /* returns operand of node if node is a Cast */
2414 ir_node *skip_Cast(ir_node *node) {
2415 if (get_irn_op(node) == op_Cast)
2416 return get_Cast_op(node);
2420 /* returns operand of node if node is a Confirm */
2421 ir_node *skip_Confirm(ir_node *node) {
2422 if (get_irn_op(node) == op_Confirm)
2423 return get_Confirm_value(node);
2427 /* skip all high-level ops */
2428 ir_node *skip_HighLevel(ir_node *node) {
2429 if (is_op_highlevel(get_irn_op(node)))
2430 return get_irn_n(node, 0);
2435 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2436 * than any other approach, as Id chains are resolved and all point to the real node, or
2437 * all id's are self loops.
2439 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2440 * a little bit "hand optimized".
2442 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2445 skip_Id(ir_node *node) {
2447 /* don't assert node !!! */
2449 if (!node || (node->op != op_Id)) return node;
2451 /* Don't use get_Id_pred(): We get into an endless loop for
2452 self-referencing Ids. */
2453 pred = node->in[0+1];
2455 if (pred->op != op_Id) return pred;
2457 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2458 ir_node *rem_pred, *res;
2460 if (pred->op != op_Id) return pred; /* shortcut */
2463 assert(get_irn_arity (node) > 0);
2465 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2466 res = skip_Id(rem_pred);
2467 if (res->op == op_Id) /* self-loop */ return node;
2469 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2476 void skip_Id_and_store(ir_node **node) {
2479 if (!n || (n->op != op_Id)) return;
2481 /* Don't use get_Id_pred(): We get into an endless loop for
2482 self-referencing Ids. */
2487 (is_Bad)(const ir_node *node) {
2488 return _is_Bad(node);
2492 (is_NoMem)(const ir_node *node) {
2493 return _is_NoMem(node);
2497 (is_Mod)(const ir_node *node) {
2498 return _is_Mod(node);
2502 (is_Div)(const ir_node *node) {
2503 return _is_Div(node);
2507 (is_DivMod)(const ir_node *node) {
2508 return _is_DivMod(node);
2512 (is_Quot)(const ir_node *node) {
2513 return _is_Quot(node);
2517 (is_Add)(const ir_node *node) {
2518 return _is_Add(node);
2522 (is_Sub)(const ir_node *node) {
2523 return _is_Sub(node);
2527 (is_Start)(const ir_node *node) {
2528 return _is_Start(node);
2532 (is_End)(const ir_node *node) {
2533 return _is_End(node);
2537 (is_Const)(const ir_node *node) {
2538 return _is_Const(node);
2542 (is_Conv)(const ir_node *node) {
2543 return _is_Conv(node);
2547 (is_no_Block)(const ir_node *node) {
2548 return _is_no_Block(node);
2552 (is_Block)(const ir_node *node) {
2553 return _is_Block(node);
2556 /* returns true if node is an Unknown node. */
2558 (is_Unknown)(const ir_node *node) {
2559 return _is_Unknown(node);
2562 /* returns true if node is a Return node. */
2564 (is_Return)(const ir_node *node) {
2565 return _is_Return(node);
2568 /* returns true if node is a Call node. */
2570 (is_Call)(const ir_node *node) {
2571 return _is_Call(node);
2574 /* returns true if node is a Sel node. */
2576 (is_Sel)(const ir_node *node) {
2577 return _is_Sel(node);
2580 /* returns true if node is a Mux node or a Psi with only one condition. */
2582 (is_Mux)(const ir_node *node) {
2583 return _is_Mux(node);
2586 /* returns true if node is a Load node. */
2588 (is_Load)(const ir_node *node) {
2589 return _is_Load(node);
2592 /* returns true if node is a Load node. */
2594 (is_Store)(const ir_node *node) {
2595 return _is_Store(node);
2598 /* returns true if node is a Sync node. */
2600 (is_Sync)(const ir_node *node) {
2601 return _is_Sync(node);
2604 /* returns true if node is a Confirm node. */
2606 (is_Confirm)(const ir_node *node) {
2607 return _is_Confirm(node);
2610 /* returns true if node is a Pin node. */
2612 (is_Pin)(const ir_node *node) {
2613 return _is_Pin(node);
2616 /* returns true if node is a SymConst node. */
2618 (is_SymConst)(const ir_node *node) {
2619 return _is_SymConst(node);
2622 /* returns true if node is a Cond node. */
2624 (is_Cond)(const ir_node *node) {
2625 return _is_Cond(node);
2629 (is_CopyB)(const ir_node *node) {
2630 return _is_CopyB(node);
2633 /* returns true if node is a Cmp node. */
2635 (is_Cmp)(const ir_node *node) {
2636 return _is_Cmp(node);
2639 /* returns true if node is an Alloc node. */
2641 (is_Alloc)(const ir_node *node) {
2642 return _is_Alloc(node);
2645 /* returns true if a node is a Jmp node. */
2647 (is_Jmp)(const ir_node *node) {
2648 return _is_Jmp(node);
2651 /* returns true if a node is a Raise node. */
2653 (is_Raise)(const ir_node *node) {
2654 return _is_Raise(node);
2658 is_Proj(const ir_node *node) {
2660 return node->op == op_Proj ||
2661 (!get_interprocedural_view() && node->op == op_Filter);
2664 /* Returns true if the operation manipulates control flow. */
2666 is_cfop(const ir_node *node) {
2667 return is_cfopcode(get_irn_op(node));
2670 /* Returns true if the operation manipulates interprocedural control flow:
2671 CallBegin, EndReg, EndExcept */
2672 int is_ip_cfop(const ir_node *node) {
2673 return is_ip_cfopcode(get_irn_op(node));
2676 /* Returns true if the operation can change the control flow because
2679 is_fragile_op(const ir_node *node) {
2680 return is_op_fragile(get_irn_op(node));
2683 /* Returns the memory operand of fragile operations. */
2684 ir_node *get_fragile_op_mem(ir_node *node) {
2685 assert(node && is_fragile_op(node));
2687 switch (get_irn_opcode (node)) {
2697 return get_irn_n(node, 0);
2702 assert(0 && "should not be reached");
2707 /* Returns true if the operation is a forking control flow operation. */
2708 int (is_irn_forking)(const ir_node *node) {
2709 return _is_irn_forking(node);
2712 /* Return the type associated with the value produced by n
2713 * if the node remarks this type as it is the case for
2714 * Cast, Const, SymConst and some Proj nodes. */
2715 ir_type *(get_irn_type)(ir_node *node) {
2716 return _get_irn_type(node);
2719 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2721 ir_type *(get_irn_type_attr)(ir_node *node) {
2722 return _get_irn_type_attr(node);
2725 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2726 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2727 return _get_irn_entity_attr(node);
2730 /* Returns non-zero for constant-like nodes. */
2731 int (is_irn_constlike)(const ir_node *node) {
2732 return _is_irn_constlike(node);
2736 * Returns non-zero for nodes that are allowed to have keep-alives and
2737 * are neither Block nor PhiM.
2739 int (is_irn_keep)(const ir_node *node) {
2740 return _is_irn_keep(node);
2744 * Returns non-zero for nodes that are always placed in the start block.
2746 int (is_irn_start_block_placed)(const ir_node *node) {
2747 return _is_irn_start_block_placed(node);
2750 /* Returns non-zero for nodes that are machine operations. */
2751 int (is_irn_machine_op)(const ir_node *node) {
2752 return _is_irn_machine_op(node);
2755 /* Returns non-zero for nodes that are machine operands. */
2756 int (is_irn_machine_operand)(const ir_node *node) {
2757 return _is_irn_machine_operand(node);
2760 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2761 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2762 return _is_irn_machine_user(node, n);
2766 /* Gets the string representation of the jump prediction .*/
2767 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2770 case COND_JMP_PRED_NONE: return "no prediction";
2771 case COND_JMP_PRED_TRUE: return "true taken";
2772 case COND_JMP_PRED_FALSE: return "false taken";
2776 /* Returns the conditional jump prediction of a Cond node. */
2777 cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
2778 return _get_Cond_jmp_pred(cond);
2781 /* Sets a new conditional jump prediction. */
2782 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2783 _set_Cond_jmp_pred(cond, pred);
2786 /** the get_type operation must be always implemented and return a firm type */
2787 static ir_type *get_Default_type(ir_node *n) {
2788 return get_unknown_type();
2791 /* Sets the get_type operation for an ir_op_ops. */
2792 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2794 case iro_Const: ops->get_type = get_Const_type; break;
2795 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2796 case iro_Cast: ops->get_type = get_Cast_type; break;
2797 case iro_Proj: ops->get_type = get_Proj_type; break;
2799 /* not allowed to be NULL */
2800 if (! ops->get_type)
2801 ops->get_type = get_Default_type;
2807 /** Return the attribute type of a SymConst node if exists */
2808 static ir_type *get_SymConst_attr_type(ir_node *self) {
2809 symconst_kind kind = get_SymConst_kind(self);
2810 if (SYMCONST_HAS_TYPE(kind))
2811 return get_SymConst_type(self);
2815 /** Return the attribute entity of a SymConst node if exists */
2816 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
2817 symconst_kind kind = get_SymConst_kind(self);
2818 if (SYMCONST_HAS_ENT(kind))
2819 return get_SymConst_entity(self);
2823 /** the get_type_attr operation must be always implemented */
2824 static ir_type *get_Null_type(ir_node *n) {
2825 return firm_unknown_type;
2828 /* Sets the get_type operation for an ir_op_ops. */
2829 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
2831 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2832 case iro_Call: ops->get_type_attr = get_Call_type; break;
2833 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2834 case iro_Free: ops->get_type_attr = get_Free_type; break;
2835 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2837 /* not allowed to be NULL */
2838 if (! ops->get_type_attr)
2839 ops->get_type_attr = get_Null_type;
2845 /** the get_entity_attr operation must be always implemented */
2846 static ir_entity *get_Null_ent(ir_node *n) {
2850 /* Sets the get_type operation for an ir_op_ops. */
2851 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
2853 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2854 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2856 /* not allowed to be NULL */
2857 if (! ops->get_entity_attr)
2858 ops->get_entity_attr = get_Null_ent;
2864 #ifdef DEBUG_libfirm
2865 void dump_irn(ir_node *n) {
2866 int i, arity = get_irn_arity(n);
2867 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2869 ir_node *pred = get_irn_n(n, -1);
2870 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2871 get_irn_node_nr(pred), (void *)pred);
2873 printf(" preds: \n");
2874 for (i = 0; i < arity; ++i) {
2875 ir_node *pred = get_irn_n(n, i);
2876 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2877 get_irn_node_nr(pred), (void *)pred);
2881 #else /* DEBUG_libfirm */
2882 void dump_irn(ir_node *n) {}
2883 #endif /* DEBUG_libfirm */