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)
389 for(i = 0, n = get_irn_deps(src); i < n; ++i)
390 add_irn_dep(tgt, get_irn_dep(src, i));
395 (get_irn_mode)(const ir_node *node) {
396 return _get_irn_mode(node);
400 (set_irn_mode)(ir_node *node, ir_mode *mode) {
401 _set_irn_mode(node, mode);
405 get_irn_modecode(const ir_node *node) {
407 return node->mode->code;
410 /** Gets the string representation of the mode .*/
412 get_irn_modename(const ir_node *node) {
414 return get_mode_name(node->mode);
418 get_irn_modeident(const ir_node *node) {
420 return get_mode_ident(node->mode);
424 (get_irn_op)(const ir_node *node) {
425 return _get_irn_op(node);
428 /* should be private to the library: */
430 (set_irn_op)(ir_node *node, ir_op *op) {
431 _set_irn_op(node, op);
435 (get_irn_opcode)(const ir_node *node) {
436 return _get_irn_opcode(node);
440 get_irn_opname(const ir_node *node) {
442 if ((get_irn_op((ir_node *)node) == op_Phi) &&
443 (get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
444 (get_irn_arity((ir_node *)node) == 0)) return "Phi0";
445 return get_id_str(node->op->name);
449 get_irn_opident(const ir_node *node) {
451 return node->op->name;
455 (get_irn_visited)(const ir_node *node) {
456 return _get_irn_visited(node);
460 (set_irn_visited)(ir_node *node, unsigned long visited) {
461 _set_irn_visited(node, visited);
465 (mark_irn_visited)(ir_node *node) {
466 _mark_irn_visited(node);
470 (irn_not_visited)(const ir_node *node) {
471 return _irn_not_visited(node);
475 (irn_visited)(const ir_node *node) {
476 return _irn_visited(node);
480 (set_irn_link)(ir_node *node, void *link) {
481 _set_irn_link(node, link);
485 (get_irn_link)(const ir_node *node) {
486 return _get_irn_link(node);
490 (get_irn_pinned)(const ir_node *node) {
491 return _get_irn_pinned(node);
495 (is_irn_pinned_in_irg) (const ir_node *node) {
496 return _is_irn_pinned_in_irg(node);
499 void set_irn_pinned(ir_node *node, op_pin_state state) {
500 /* due to optimization an opt may be turned into a Tuple */
501 if (get_irn_op(node) == op_Tuple)
504 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
505 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
507 node->attr.except.pin_state = state;
510 #ifdef DO_HEAPANALYSIS
511 /* Access the abstract interpretation information of a node.
512 Returns NULL if no such information is available. */
513 struct abstval *get_irn_abst_value(ir_node *n) {
516 /* Set the abstract interpretation information of a node. */
517 void set_irn_abst_value(ir_node *n, struct abstval *os) {
520 struct section *firm_get_irn_section(ir_node *n) {
523 void firm_set_irn_section(ir_node *n, struct section *s) {
527 /* Dummies needed for firmjni. */
528 struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
529 void set_irn_abst_value(ir_node *n, struct abstval *os) {}
530 struct section *firm_get_irn_section(ir_node *n) { return NULL; }
531 void firm_set_irn_section(ir_node *n, struct section *s) {}
532 #endif /* DO_HEAPANALYSIS */
535 /* Outputs a unique number for this node */
536 long get_irn_node_nr(const ir_node *node) {
539 return node->node_nr;
541 return (long)PTR_TO_INT(node);
546 get_irn_const_attr(ir_node *node) {
547 assert(node->op == op_Const);
548 return node->attr.con;
552 get_irn_proj_attr(ir_node *node) {
553 assert(node->op == op_Proj);
554 return node->attr.proj;
558 get_irn_alloc_attr(ir_node *node) {
559 assert(node->op == op_Alloc);
560 return node->attr.alloc;
564 get_irn_free_attr(ir_node *node) {
565 assert(node->op == op_Free);
566 return node->attr.free;
570 get_irn_symconst_attr(ir_node *node) {
571 assert(node->op == op_SymConst);
572 return node->attr.symc;
576 get_irn_call_attr(ir_node *node) {
577 assert(node->op == op_Call);
578 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
582 get_irn_sel_attr(ir_node *node) {
583 assert(node->op == op_Sel);
584 return node->attr.sel;
588 get_irn_phi_attr(ir_node *node) {
589 assert(node->op == op_Phi);
590 return node->attr.phi0_pos;
594 get_irn_block_attr(ir_node *node) {
595 assert(node->op == op_Block);
596 return node->attr.block;
600 get_irn_load_attr(ir_node *node) {
601 assert(node->op == op_Load);
602 return node->attr.load;
606 get_irn_store_attr(ir_node *node) {
607 assert(node->op == op_Store);
608 return node->attr.store;
612 get_irn_except_attr(ir_node *node) {
613 assert(node->op == op_Div || node->op == op_Quot ||
614 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
615 return node->attr.except;
618 void *(get_irn_generic_attr)(ir_node *node) {
619 assert(is_ir_node(node));
620 return _get_irn_generic_attr(node);
623 const void *(get_irn_generic_attr_const)(const ir_node *node) {
624 assert(is_ir_node(node));
625 return _get_irn_generic_attr_const(node);
628 unsigned (get_irn_idx)(const ir_node *node) {
629 assert(is_ir_node(node));
630 return _get_irn_idx(node);
633 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
635 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
636 if (get_irn_n(node, i) == arg)
642 /** manipulate fields of individual nodes **/
644 /* this works for all except Block */
646 get_nodes_block(const ir_node *node) {
647 assert(node->op != op_Block);
648 assert(is_irn_pinned_in_irg(node) && "block info may be incorrect");
649 return get_irn_n(node, -1);
653 set_nodes_block(ir_node *node, ir_node *block) {
654 assert(node->op != op_Block);
655 set_irn_n(node, -1, block);
658 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
659 * from Start. If so returns frame type, else Null. */
660 ir_type *is_frame_pointer(ir_node *n) {
661 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
662 ir_node *start = get_Proj_pred(n);
663 if (get_irn_op(start) == op_Start) {
664 return get_irg_frame_type(get_irn_irg(start));
670 /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
671 * from Start. If so returns global type, else Null. */
672 ir_type *is_globals_pointer(ir_node *n) {
673 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
674 ir_node *start = get_Proj_pred(n);
675 if (get_irn_op(start) == op_Start) {
676 return get_glob_type();
682 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
683 * from Start. If so returns tls type, else Null. */
684 ir_type *is_tls_pointer(ir_node *n) {
685 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
686 ir_node *start = get_Proj_pred(n);
687 if (get_irn_op(start) == op_Start) {
688 return get_tls_type();
694 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
695 * from Start. If so returns 1, else 0. */
696 int is_value_arg_pointer(ir_node *n) {
697 if ((get_irn_op(n) == op_Proj) &&
698 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
699 (get_irn_op(get_Proj_pred(n)) == op_Start))
704 /* Returns an array with the predecessors of the Block. Depending on
705 the implementation of the graph data structure this can be a copy of
706 the internal representation of predecessors as well as the internal
707 array itself. Therefore writing to this array might obstruct the ir. */
709 get_Block_cfgpred_arr(ir_node *node) {
710 assert((node->op == op_Block));
711 return (ir_node **)&(get_irn_in(node)[1]);
715 (get_Block_n_cfgpreds)(const ir_node *node) {
716 return _get_Block_n_cfgpreds(node);
720 (get_Block_cfgpred)(ir_node *node, int pos) {
721 return _get_Block_cfgpred(node, pos);
725 set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
726 assert(node->op == op_Block);
727 set_irn_n(node, pos, pred);
731 (get_Block_cfgpred_block)(ir_node *node, int pos) {
732 return _get_Block_cfgpred_block(node, pos);
736 get_Block_matured(ir_node *node) {
737 assert(node->op == op_Block);
738 return (int)node->attr.block.matured;
742 set_Block_matured(ir_node *node, int matured) {
743 assert(node->op == op_Block);
744 node->attr.block.matured = matured;
748 (get_Block_block_visited)(const ir_node *node) {
749 return _get_Block_block_visited(node);
753 (set_Block_block_visited)(ir_node *node, unsigned long visit) {
754 _set_Block_block_visited(node, visit);
757 /* For this current_ir_graph must be set. */
759 (mark_Block_block_visited)(ir_node *node) {
760 _mark_Block_block_visited(node);
764 (Block_not_block_visited)(const ir_node *node) {
765 return _Block_not_block_visited(node);
769 (Block_block_visited)(const ir_node *node) {
770 return _Block_block_visited(node);
774 get_Block_graph_arr (ir_node *node, int pos) {
775 assert(node->op == op_Block);
776 return node->attr.block.graph_arr[pos+1];
780 set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
781 assert(node->op == op_Block);
782 node->attr.block.graph_arr[pos+1] = value;
785 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
786 assert(node->op == op_Block);
787 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
788 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
789 node->attr.block.in_cg[0] = NULL;
790 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
792 /* Fix backedge array. fix_backedges() operates depending on
793 interprocedural_view. */
794 int ipv = get_interprocedural_view();
795 set_interprocedural_view(1);
796 fix_backedges(current_ir_graph->obst, node);
797 set_interprocedural_view(ipv);
800 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
803 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
804 assert(node->op == op_Block &&
805 node->attr.block.in_cg &&
806 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
807 node->attr.block.in_cg[pos + 1] = pred;
810 ir_node **get_Block_cg_cfgpred_arr(ir_node * node) {
811 assert(node->op == op_Block);
812 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
815 int get_Block_cg_n_cfgpreds(ir_node * node) {
816 assert(node->op == op_Block);
817 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
820 ir_node *get_Block_cg_cfgpred(ir_node * node, int pos) {
821 assert(node->op == op_Block && node->attr.block.in_cg);
822 return node->attr.block.in_cg[pos + 1];
825 void remove_Block_cg_cfgpred_arr(ir_node * node) {
826 assert(node->op == op_Block);
827 node->attr.block.in_cg = NULL;
830 ir_node *(set_Block_dead)(ir_node *block) {
831 return _set_Block_dead(block);
834 int (is_Block_dead)(const ir_node *block) {
835 return _is_Block_dead(block);
838 ir_extblk *get_Block_extbb(const ir_node *block) {
840 assert(is_Block(block));
841 res = block->attr.block.extblk;
842 assert(res == NULL || is_ir_extbb(res));
846 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
847 assert(is_Block(block));
848 assert(extblk == NULL || is_ir_extbb(extblk));
849 block->attr.block.extblk = extblk;
853 get_End_n_keepalives(ir_node *end) {
854 assert(end->op == op_End);
855 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
859 get_End_keepalive(ir_node *end, int pos) {
860 assert(end->op == op_End);
861 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
865 add_End_keepalive (ir_node *end, ir_node *ka) {
866 assert(end->op == op_End);
871 set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
872 assert(end->op == op_End);
873 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
876 /* Set new keep-alives */
877 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
879 ir_graph *irg = get_irn_irg(end);
881 /* notify that edges are deleted */
882 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
883 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
885 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
887 for (i = 0; i < n; ++i) {
888 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
889 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
893 /* Set new keep-alives from old keep-alives, skipping irn */
894 void remove_End_keepalive(ir_node *end, ir_node *irn) {
895 int n = get_End_n_keepalives(end);
899 NEW_ARR_A(ir_node *, in, n);
901 for (idx = i = 0; i < n; ++i) {
902 ir_node *old_ka = get_End_keepalive(end, i);
909 /* set new keep-alives */
910 set_End_keepalives(end, idx, in);
914 free_End (ir_node *end) {
915 assert(end->op == op_End);
918 end->in = NULL; /* @@@ make sure we get an error if we use the
919 in array afterwards ... */
922 /* Return the target address of an IJmp */
923 ir_node *get_IJmp_target(ir_node *ijmp) {
924 assert(ijmp->op == op_IJmp);
925 return get_irn_n(ijmp, 0);
928 /** Sets the target address of an IJmp */
929 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
930 assert(ijmp->op == op_IJmp);
931 set_irn_n(ijmp, 0, tgt);
935 > Implementing the case construct (which is where the constant Proj node is
936 > important) involves far more than simply determining the constant values.
937 > We could argue that this is more properly a function of the translator from
938 > Firm to the target machine. That could be done if there was some way of
939 > projecting "default" out of the Cond node.
940 I know it's complicated.
941 Basically there are two proglems:
942 - determining the gaps between the projs
943 - determining the biggest case constant to know the proj number for
945 I see several solutions:
946 1. Introduce a ProjDefault node. Solves both problems.
947 This means to extend all optimizations executed during construction.
948 2. Give the Cond node for switch two flavors:
949 a) there are no gaps in the projs (existing flavor)
950 b) gaps may exist, default proj is still the Proj with the largest
951 projection number. This covers also the gaps.
952 3. Fix the semantic of the Cond to that of 2b)
954 Solution 2 seems to be the best:
955 Computing the gaps in the Firm representation is not too hard, i.e.,
956 libFIRM can implement a routine that transforms between the two
957 flavours. This is also possible for 1) but 2) does not require to
958 change any existing optimization.
959 Further it should be far simpler to determine the biggest constant than
961 I don't want to choose 3) as 2a) seems to have advantages for
962 dataflow analysis and 3) does not allow to convert the representation to
966 get_Cond_selector(ir_node *node) {
967 assert(node->op == op_Cond);
968 return get_irn_n(node, 0);
972 set_Cond_selector(ir_node *node, ir_node *selector) {
973 assert(node->op == op_Cond);
974 set_irn_n(node, 0, selector);
978 get_Cond_kind(ir_node *node) {
979 assert(node->op == op_Cond);
980 return node->attr.cond.kind;
984 set_Cond_kind(ir_node *node, cond_kind kind) {
985 assert(node->op == op_Cond);
986 node->attr.cond.kind = kind;
990 get_Cond_defaultProj(ir_node *node) {
991 assert(node->op == op_Cond);
992 return node->attr.cond.default_proj;
996 get_Return_mem(ir_node *node) {
997 assert(node->op == op_Return);
998 return get_irn_n(node, 0);
1002 set_Return_mem(ir_node *node, ir_node *mem) {
1003 assert(node->op == op_Return);
1004 set_irn_n(node, 0, mem);
1008 get_Return_n_ress(ir_node *node) {
1009 assert(node->op == op_Return);
1010 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1014 get_Return_res_arr (ir_node *node) {
1015 assert((node->op == op_Return));
1016 if (get_Return_n_ress(node) > 0)
1017 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1024 set_Return_n_res(ir_node *node, int results) {
1025 assert(node->op == op_Return);
1030 get_Return_res(ir_node *node, int pos) {
1031 assert(node->op == op_Return);
1032 assert(get_Return_n_ress(node) > pos);
1033 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1037 set_Return_res(ir_node *node, int pos, ir_node *res){
1038 assert(node->op == op_Return);
1039 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1042 tarval *(get_Const_tarval)(ir_node *node) {
1043 return _get_Const_tarval(node);
1047 set_Const_tarval(ir_node *node, tarval *con) {
1048 assert(node->op == op_Const);
1049 node->attr.con.tv = con;
1052 cnst_classify_t (classify_Const)(ir_node *node) {
1053 return _classify_Const(node);
1057 /* The source language type. Must be an atomic type. Mode of type must
1058 be mode of node. For tarvals from entities type must be pointer to
1061 get_Const_type(ir_node *node) {
1062 assert(node->op == op_Const);
1063 return node->attr.con.tp;
1067 set_Const_type(ir_node *node, ir_type *tp) {
1068 assert(node->op == op_Const);
1069 if (tp != firm_unknown_type) {
1070 assert(is_atomic_type(tp));
1071 assert(get_type_mode(tp) == get_irn_mode(node));
1073 node->attr.con.tp = tp;
1078 get_SymConst_kind(const ir_node *node) {
1079 assert(node->op == op_SymConst);
1080 return node->attr.symc.num;
1084 set_SymConst_kind(ir_node *node, symconst_kind num) {
1085 assert(node->op == op_SymConst);
1086 node->attr.symc.num = num;
1090 get_SymConst_type(ir_node *node) {
1091 assert((node->op == op_SymConst) &&
1092 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1093 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1097 set_SymConst_type(ir_node *node, ir_type *tp) {
1098 assert((node->op == op_SymConst) &&
1099 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1100 node->attr.symc.sym.type_p = tp;
1104 get_SymConst_name(const ir_node *node) {
1105 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1106 return node->attr.symc.sym.ident_p;
1110 set_SymConst_name(ir_node *node, ident *name) {
1111 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1112 node->attr.symc.sym.ident_p = name;
1116 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1117 ir_entity *get_SymConst_entity(const ir_node *node) {
1118 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1119 return node->attr.symc.sym.entity_p;
1122 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1123 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1124 node->attr.symc.sym.entity_p = ent;
1127 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1128 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1129 return node->attr.symc.sym.enum_p;
1132 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1133 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1134 node->attr.symc.sym.enum_p = ec;
1137 union symconst_symbol
1138 get_SymConst_symbol(const ir_node *node) {
1139 assert(node->op == op_SymConst);
1140 return node->attr.symc.sym;
1144 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1145 assert(node->op == op_SymConst);
1146 node->attr.symc.sym = sym;
1150 get_SymConst_value_type(ir_node *node) {
1151 assert(node->op == op_SymConst);
1152 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1153 return node->attr.symc.tp;
1157 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1158 assert(node->op == op_SymConst);
1159 node->attr.symc.tp = tp;
1163 get_Sel_mem(ir_node *node) {
1164 assert(node->op == op_Sel);
1165 return get_irn_n(node, 0);
1169 set_Sel_mem(ir_node *node, ir_node *mem) {
1170 assert(node->op == op_Sel);
1171 set_irn_n(node, 0, mem);
1175 get_Sel_ptr(ir_node *node) {
1176 assert(node->op == op_Sel);
1177 return get_irn_n(node, 1);
1181 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1182 assert(node->op == op_Sel);
1183 set_irn_n(node, 1, ptr);
1187 get_Sel_n_indexs(ir_node *node) {
1188 assert(node->op == op_Sel);
1189 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1193 get_Sel_index_arr(ir_node *node) {
1194 assert((node->op == op_Sel));
1195 if (get_Sel_n_indexs(node) > 0)
1196 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1202 get_Sel_index(ir_node *node, int pos) {
1203 assert(node->op == op_Sel);
1204 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1208 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1209 assert(node->op == op_Sel);
1210 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1214 get_Sel_entity(ir_node *node) {
1215 assert(node->op == op_Sel);
1216 return node->attr.sel.ent;
1220 set_Sel_entity(ir_node *node, ir_entity *ent) {
1221 assert(node->op == op_Sel);
1222 node->attr.sel.ent = ent;
1226 /* For unary and binary arithmetic operations the access to the
1227 operands can be factored out. Left is the first, right the
1228 second arithmetic value as listed in tech report 0999-33.
1229 unops are: Minus, Abs, Not, Conv, Cast
1230 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1231 Shr, Shrs, Rotate, Cmp */
1235 get_Call_mem(ir_node *node) {
1236 assert(node->op == op_Call);
1237 return get_irn_n(node, 0);
1241 set_Call_mem(ir_node *node, ir_node *mem) {
1242 assert(node->op == op_Call);
1243 set_irn_n(node, 0, mem);
1247 get_Call_ptr(ir_node *node) {
1248 assert(node->op == op_Call);
1249 return get_irn_n(node, 1);
1253 set_Call_ptr(ir_node *node, ir_node *ptr) {
1254 assert(node->op == op_Call);
1255 set_irn_n(node, 1, ptr);
1259 get_Call_param_arr(ir_node *node) {
1260 assert(node->op == op_Call);
1261 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1265 get_Call_n_params(ir_node *node) {
1266 assert(node->op == op_Call);
1267 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1271 get_Call_arity(ir_node *node) {
1272 assert(node->op == op_Call);
1273 return get_Call_n_params(node);
1277 set_Call_arity(ir_node *node, ir_node *arity) {
1278 assert(node->op == op_Call);
1283 get_Call_param(ir_node *node, int pos) {
1284 assert(node->op == op_Call);
1285 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1289 set_Call_param(ir_node *node, int pos, ir_node *param) {
1290 assert(node->op == op_Call);
1291 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1295 get_Call_type(ir_node *node) {
1296 assert(node->op == op_Call);
1297 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1301 set_Call_type(ir_node *node, ir_type *tp) {
1302 assert(node->op == op_Call);
1303 assert((get_unknown_type() == tp) || is_Method_type(tp));
1304 node->attr.call.cld_tp = tp;
1307 int Call_has_callees(ir_node *node) {
1308 assert(node && node->op == op_Call);
1309 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1310 (node->attr.call.callee_arr != NULL));
1313 int get_Call_n_callees(ir_node * node) {
1314 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1315 return ARR_LEN(node->attr.call.callee_arr);
1318 ir_entity * get_Call_callee(ir_node * node, int pos) {
1319 assert(pos >= 0 && pos < get_Call_n_callees(node));
1320 return node->attr.call.callee_arr[pos];
1323 void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) {
1324 assert(node->op == op_Call);
1325 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1326 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1328 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1331 void remove_Call_callee_arr(ir_node * node) {
1332 assert(node->op == op_Call);
1333 node->attr.call.callee_arr = NULL;
1336 ir_node * get_CallBegin_ptr(ir_node *node) {
1337 assert(node->op == op_CallBegin);
1338 return get_irn_n(node, 0);
1341 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1342 assert(node->op == op_CallBegin);
1343 set_irn_n(node, 0, ptr);
1346 ir_node * get_CallBegin_call(ir_node *node) {
1347 assert(node->op == op_CallBegin);
1348 return node->attr.callbegin.call;
1351 void set_CallBegin_call(ir_node *node, ir_node *call) {
1352 assert(node->op == op_CallBegin);
1353 node->attr.callbegin.call = call;
1358 ir_node * get_##OP##_left(const ir_node *node) { \
1359 assert(node->op == op_##OP); \
1360 return get_irn_n(node, node->op->op_index); \
1362 void set_##OP##_left(ir_node *node, ir_node *left) { \
1363 assert(node->op == op_##OP); \
1364 set_irn_n(node, node->op->op_index, left); \
1366 ir_node *get_##OP##_right(const ir_node *node) { \
1367 assert(node->op == op_##OP); \
1368 return get_irn_n(node, node->op->op_index + 1); \
1370 void set_##OP##_right(ir_node *node, ir_node *right) { \
1371 assert(node->op == op_##OP); \
1372 set_irn_n(node, node->op->op_index + 1, right); \
1376 ir_node *get_##OP##_op(const ir_node *node) { \
1377 assert(node->op == op_##OP); \
1378 return get_irn_n(node, node->op->op_index); \
1380 void set_##OP##_op (ir_node *node, ir_node *op) { \
1381 assert(node->op == op_##OP); \
1382 set_irn_n(node, node->op->op_index, op); \
1385 #define BINOP_MEM(OP) \
1389 get_##OP##_mem(ir_node *node) { \
1390 assert(node->op == op_##OP); \
1391 return get_irn_n(node, 0); \
1395 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1396 assert(node->op == op_##OP); \
1397 set_irn_n(node, 0, mem); \
1421 int get_Conv_strict(ir_node *node) {
1422 assert(node->op == op_Conv);
1423 return node->attr.conv.strict;
1426 void set_Conv_strict(ir_node *node, int strict_flag) {
1427 assert(node->op == op_Conv);
1428 node->attr.conv.strict = (char)strict_flag;
1432 get_Cast_type(ir_node *node) {
1433 assert(node->op == op_Cast);
1434 return node->attr.cast.totype;
1438 set_Cast_type(ir_node *node, ir_type *to_tp) {
1439 assert(node->op == op_Cast);
1440 node->attr.cast.totype = to_tp;
1444 /* Checks for upcast.
1446 * Returns true if the Cast node casts a class type to a super type.
1448 int is_Cast_upcast(ir_node *node) {
1449 ir_type *totype = get_Cast_type(node);
1450 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1451 ir_graph *myirg = get_irn_irg(node);
1453 assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
1456 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1457 totype = get_pointer_points_to_type(totype);
1458 fromtype = get_pointer_points_to_type(fromtype);
1463 if (!is_Class_type(totype)) return 0;
1464 return is_SubClass_of(fromtype, totype);
1467 /* Checks for downcast.
1469 * Returns true if the Cast node casts a class type to a sub type.
1471 int is_Cast_downcast(ir_node *node) {
1472 ir_type *totype = get_Cast_type(node);
1473 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1475 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1478 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1479 totype = get_pointer_points_to_type(totype);
1480 fromtype = get_pointer_points_to_type(fromtype);
1485 if (!is_Class_type(totype)) return 0;
1486 return is_SubClass_of(totype, fromtype);
1490 (is_unop)(const ir_node *node) {
1491 return _is_unop(node);
1495 get_unop_op(const ir_node *node) {
1496 if (node->op->opar == oparity_unary)
1497 return get_irn_n(node, node->op->op_index);
1499 assert(node->op->opar == oparity_unary);
1504 set_unop_op(ir_node *node, ir_node *op) {
1505 if (node->op->opar == oparity_unary)
1506 set_irn_n(node, node->op->op_index, op);
1508 assert(node->op->opar == oparity_unary);
1512 (is_binop)(const ir_node *node) {
1513 return _is_binop(node);
1517 get_binop_left(const ir_node *node) {
1518 assert(node->op->opar == oparity_binary);
1519 return get_irn_n(node, node->op->op_index);
1523 set_binop_left(ir_node *node, ir_node *left) {
1524 assert(node->op->opar == oparity_binary);
1525 set_irn_n(node, node->op->op_index, left);
1529 get_binop_right(const ir_node *node) {
1530 assert(node->op->opar == oparity_binary);
1531 return get_irn_n(node, node->op->op_index + 1);
1535 set_binop_right(ir_node *node, ir_node *right) {
1536 assert(node->op->opar == oparity_binary);
1537 set_irn_n(node, node->op->op_index + 1, right);
1540 int is_Phi(const ir_node *n) {
1546 if (op == op_Filter) return get_interprocedural_view();
1549 return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
1550 (get_irn_arity(n) > 0));
1555 int is_Phi0(const ir_node *n) {
1558 return ((get_irn_op(n) == op_Phi) &&
1559 (get_irn_arity(n) == 0) &&
1560 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1564 get_Phi_preds_arr(ir_node *node) {
1565 assert(node->op == op_Phi);
1566 return (ir_node **)&(get_irn_in(node)[1]);
1570 get_Phi_n_preds(ir_node *node) {
1571 assert(is_Phi(node) || is_Phi0(node));
1572 return (get_irn_arity(node));
1576 void set_Phi_n_preds(ir_node *node, int n_preds) {
1577 assert(node->op == op_Phi);
1582 get_Phi_pred(ir_node *node, int pos) {
1583 assert(is_Phi(node) || is_Phi0(node));
1584 return get_irn_n(node, pos);
1588 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1589 assert(is_Phi(node) || is_Phi0(node));
1590 set_irn_n(node, pos, pred);
1594 int is_memop(ir_node *node) {
1595 return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store));
1598 ir_node *get_memop_mem(ir_node *node) {
1599 assert(is_memop(node));
1600 return get_irn_n(node, 0);
1603 void set_memop_mem(ir_node *node, ir_node *mem) {
1604 assert(is_memop(node));
1605 set_irn_n(node, 0, mem);
1608 ir_node *get_memop_ptr(ir_node *node) {
1609 assert(is_memop(node));
1610 return get_irn_n(node, 1);
1613 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1614 assert(is_memop(node));
1615 set_irn_n(node, 1, ptr);
1619 get_Load_mem(ir_node *node) {
1620 assert(node->op == op_Load);
1621 return get_irn_n(node, 0);
1625 set_Load_mem(ir_node *node, ir_node *mem) {
1626 assert(node->op == op_Load);
1627 set_irn_n(node, 0, mem);
1631 get_Load_ptr(ir_node *node) {
1632 assert(node->op == op_Load);
1633 return get_irn_n(node, 1);
1637 set_Load_ptr(ir_node *node, ir_node *ptr) {
1638 assert(node->op == op_Load);
1639 set_irn_n(node, 1, ptr);
1643 get_Load_mode(ir_node *node) {
1644 assert(node->op == op_Load);
1645 return node->attr.load.load_mode;
1649 set_Load_mode(ir_node *node, ir_mode *mode) {
1650 assert(node->op == op_Load);
1651 node->attr.load.load_mode = mode;
1655 get_Load_volatility(ir_node *node) {
1656 assert(node->op == op_Load);
1657 return node->attr.load.volatility;
1661 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1662 assert(node->op == op_Load);
1663 node->attr.load.volatility = volatility;
1668 get_Store_mem(ir_node *node) {
1669 assert(node->op == op_Store);
1670 return get_irn_n(node, 0);
1674 set_Store_mem(ir_node *node, ir_node *mem) {
1675 assert(node->op == op_Store);
1676 set_irn_n(node, 0, mem);
1680 get_Store_ptr(ir_node *node) {
1681 assert(node->op == op_Store);
1682 return get_irn_n(node, 1);
1686 set_Store_ptr(ir_node *node, ir_node *ptr) {
1687 assert(node->op == op_Store);
1688 set_irn_n(node, 1, ptr);
1692 get_Store_value(ir_node *node) {
1693 assert(node->op == op_Store);
1694 return get_irn_n(node, 2);
1698 set_Store_value(ir_node *node, ir_node *value) {
1699 assert(node->op == op_Store);
1700 set_irn_n(node, 2, value);
1704 get_Store_volatility(ir_node *node) {
1705 assert(node->op == op_Store);
1706 return node->attr.store.volatility;
1710 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1711 assert(node->op == op_Store);
1712 node->attr.store.volatility = volatility;
1717 get_Alloc_mem(ir_node *node) {
1718 assert(node->op == op_Alloc);
1719 return get_irn_n(node, 0);
1723 set_Alloc_mem(ir_node *node, ir_node *mem) {
1724 assert(node->op == op_Alloc);
1725 set_irn_n(node, 0, mem);
1729 get_Alloc_size(ir_node *node) {
1730 assert(node->op == op_Alloc);
1731 return get_irn_n(node, 1);
1735 set_Alloc_size(ir_node *node, ir_node *size) {
1736 assert(node->op == op_Alloc);
1737 set_irn_n(node, 1, size);
1741 get_Alloc_type(ir_node *node) {
1742 assert(node->op == op_Alloc);
1743 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1747 set_Alloc_type(ir_node *node, ir_type *tp) {
1748 assert(node->op == op_Alloc);
1749 node->attr.alloc.type = tp;
1753 get_Alloc_where(ir_node *node) {
1754 assert(node->op == op_Alloc);
1755 return node->attr.alloc.where;
1759 set_Alloc_where(ir_node *node, where_alloc where) {
1760 assert(node->op == op_Alloc);
1761 node->attr.alloc.where = where;
1766 get_Free_mem(ir_node *node) {
1767 assert(node->op == op_Free);
1768 return get_irn_n(node, 0);
1772 set_Free_mem(ir_node *node, ir_node *mem) {
1773 assert(node->op == op_Free);
1774 set_irn_n(node, 0, mem);
1778 get_Free_ptr(ir_node *node) {
1779 assert(node->op == op_Free);
1780 return get_irn_n(node, 1);
1784 set_Free_ptr(ir_node *node, ir_node *ptr) {
1785 assert(node->op == op_Free);
1786 set_irn_n(node, 1, ptr);
1790 get_Free_size(ir_node *node) {
1791 assert(node->op == op_Free);
1792 return get_irn_n(node, 2);
1796 set_Free_size(ir_node *node, ir_node *size) {
1797 assert(node->op == op_Free);
1798 set_irn_n(node, 2, size);
1802 get_Free_type(ir_node *node) {
1803 assert(node->op == op_Free);
1804 return node->attr.free.type = skip_tid(node->attr.free.type);
1808 set_Free_type(ir_node *node, ir_type *tp) {
1809 assert(node->op == op_Free);
1810 node->attr.free.type = tp;
1814 get_Free_where(ir_node *node) {
1815 assert(node->op == op_Free);
1816 return node->attr.free.where;
1820 set_Free_where(ir_node *node, where_alloc where) {
1821 assert(node->op == op_Free);
1822 node->attr.free.where = where;
1825 ir_node **get_Sync_preds_arr(ir_node *node) {
1826 assert(node->op == op_Sync);
1827 return (ir_node **)&(get_irn_in(node)[1]);
1830 int get_Sync_n_preds(ir_node *node) {
1831 assert(node->op == op_Sync);
1832 return (get_irn_arity(node));
1836 void set_Sync_n_preds(ir_node *node, int n_preds) {
1837 assert(node->op == op_Sync);
1841 ir_node *get_Sync_pred(ir_node *node, int pos) {
1842 assert(node->op == op_Sync);
1843 return get_irn_n(node, pos);
1846 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1847 assert(node->op == op_Sync);
1848 set_irn_n(node, pos, pred);
1851 /* Add a new Sync predecessor */
1852 void add_Sync_pred(ir_node *node, ir_node *pred) {
1853 assert(node->op == op_Sync);
1854 add_irn_n(node, pred);
1857 /* Returns the source language type of a Proj node. */
1858 ir_type *get_Proj_type(ir_node *n) {
1859 ir_type *tp = firm_unknown_type;
1860 ir_node *pred = get_Proj_pred(n);
1862 switch (get_irn_opcode(pred)) {
1865 /* Deal with Start / Call here: we need to know the Proj Nr. */
1866 assert(get_irn_mode(pred) == mode_T);
1867 pred_pred = get_Proj_pred(pred);
1868 if (get_irn_op(pred_pred) == op_Start) {
1869 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1870 tp = get_method_param_type(mtp, get_Proj_proj(n));
1871 } else if (get_irn_op(pred_pred) == op_Call) {
1872 ir_type *mtp = get_Call_type(pred_pred);
1873 tp = get_method_res_type(mtp, get_Proj_proj(n));
1876 case iro_Start: break;
1877 case iro_Call: break;
1879 ir_node *a = get_Load_ptr(pred);
1881 tp = get_entity_type(get_Sel_entity(a));
1890 get_Proj_pred(const ir_node *node) {
1891 assert(is_Proj(node));
1892 return get_irn_n(node, 0);
1896 set_Proj_pred(ir_node *node, ir_node *pred) {
1897 assert(is_Proj(node));
1898 set_irn_n(node, 0, pred);
1901 long get_VProj_proj(const ir_node *node)
1903 return node->attr.proj;
1906 void set_VProj_proj(ir_node *node, long value)
1908 node->attr.proj = value;
1912 get_Proj_proj(const ir_node *node) {
1913 assert(is_Proj(node));
1914 if (get_irn_opcode(node) == iro_Proj) {
1915 return node->attr.proj;
1917 assert(get_irn_opcode(node) == iro_Filter);
1918 return node->attr.filter.proj;
1923 set_Proj_proj(ir_node *node, long proj) {
1924 assert(node->op == op_Proj);
1925 node->attr.proj = proj;
1929 get_Tuple_preds_arr(ir_node *node) {
1930 assert(node->op == op_Tuple);
1931 return (ir_node **)&(get_irn_in(node)[1]);
1935 get_Tuple_n_preds(ir_node *node) {
1936 assert(node->op == op_Tuple);
1937 return (get_irn_arity(node));
1942 set_Tuple_n_preds(ir_node *node, int n_preds) {
1943 assert(node->op == op_Tuple);
1948 get_Tuple_pred (ir_node *node, int pos) {
1949 assert(node->op == op_Tuple);
1950 return get_irn_n(node, pos);
1954 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
1955 assert(node->op == op_Tuple);
1956 set_irn_n(node, pos, pred);
1960 get_Id_pred(ir_node *node) {
1961 assert(node->op == op_Id);
1962 return get_irn_n(node, 0);
1966 set_Id_pred(ir_node *node, ir_node *pred) {
1967 assert(node->op == op_Id);
1968 set_irn_n(node, 0, pred);
1971 ir_node *get_Confirm_value(ir_node *node) {
1972 assert(node->op == op_Confirm);
1973 return get_irn_n(node, 0);
1976 void set_Confirm_value(ir_node *node, ir_node *value) {
1977 assert(node->op == op_Confirm);
1978 set_irn_n(node, 0, value);
1981 ir_node *get_Confirm_bound(ir_node *node) {
1982 assert(node->op == op_Confirm);
1983 return get_irn_n(node, 1);
1986 void set_Confirm_bound(ir_node *node, ir_node *bound) {
1987 assert(node->op == op_Confirm);
1988 set_irn_n(node, 0, bound);
1991 pn_Cmp get_Confirm_cmp(ir_node *node) {
1992 assert(node->op == op_Confirm);
1993 return node->attr.confirm_cmp;
1996 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
1997 assert(node->op == op_Confirm);
1998 node->attr.confirm_cmp = cmp;
2003 get_Filter_pred(ir_node *node) {
2004 assert(node->op == op_Filter);
2009 set_Filter_pred(ir_node *node, ir_node *pred) {
2010 assert(node->op == op_Filter);
2015 get_Filter_proj(ir_node *node) {
2016 assert(node->op == op_Filter);
2017 return node->attr.filter.proj;
2021 set_Filter_proj(ir_node *node, long proj) {
2022 assert(node->op == op_Filter);
2023 node->attr.filter.proj = proj;
2026 /* Don't use get_irn_arity, get_irn_n in implementation as access
2027 shall work independent of view!!! */
2028 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) {
2029 assert(node->op == op_Filter);
2030 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2031 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2032 node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
2033 memset(node->attr.filter.backedge, 0, sizeof(int) * arity);
2034 node->attr.filter.in_cg[0] = node->in[0];
2036 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2039 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2040 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2041 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2042 node->attr.filter.in_cg[pos + 1] = pred;
2045 int get_Filter_n_cg_preds(ir_node *node) {
2046 assert(node->op == op_Filter && node->attr.filter.in_cg);
2047 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2050 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2052 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2054 arity = ARR_LEN(node->attr.filter.in_cg);
2055 assert(pos < arity - 1);
2056 return node->attr.filter.in_cg[pos + 1];
2060 ir_node *get_Mux_sel(ir_node *node) {
2061 if (node->op == op_Psi) {
2062 assert(get_irn_arity(node) == 3);
2063 return get_Psi_cond(node, 0);
2065 assert(node->op == op_Mux);
2069 void set_Mux_sel(ir_node *node, ir_node *sel) {
2070 if (node->op == op_Psi) {
2071 assert(get_irn_arity(node) == 3);
2072 set_Psi_cond(node, 0, sel);
2074 assert(node->op == op_Mux);
2079 ir_node *get_Mux_false(ir_node *node) {
2080 if (node->op == op_Psi) {
2081 assert(get_irn_arity(node) == 3);
2082 return get_Psi_default(node);
2084 assert(node->op == op_Mux);
2088 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2089 if (node->op == op_Psi) {
2090 assert(get_irn_arity(node) == 3);
2091 set_Psi_default(node, ir_false);
2093 assert(node->op == op_Mux);
2094 node->in[2] = ir_false;
2098 ir_node *get_Mux_true(ir_node *node) {
2099 if (node->op == op_Psi) {
2100 assert(get_irn_arity(node) == 3);
2101 return get_Psi_val(node, 0);
2103 assert(node->op == op_Mux);
2107 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2108 if (node->op == op_Psi) {
2109 assert(get_irn_arity(node) == 3);
2110 set_Psi_val(node, 0, ir_true);
2112 assert(node->op == op_Mux);
2113 node->in[3] = ir_true;
2118 ir_node *get_Psi_cond(ir_node *node, int pos) {
2119 int num_conds = get_Psi_n_conds(node);
2120 assert(node->op == op_Psi);
2121 assert(pos < num_conds);
2122 return get_irn_n(node, 2 * pos);
2125 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2126 int num_conds = get_Psi_n_conds(node);
2127 assert(node->op == op_Psi);
2128 assert(pos < num_conds);
2129 set_irn_n(node, 2 * pos, cond);
2132 ir_node *get_Psi_val(ir_node *node, int pos) {
2133 int num_vals = get_Psi_n_conds(node);
2134 assert(node->op == op_Psi);
2135 assert(pos < num_vals);
2136 return get_irn_n(node, 2 * pos + 1);
2139 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2140 int num_vals = get_Psi_n_conds(node);
2141 assert(node->op == op_Psi);
2142 assert(pos < num_vals);
2143 set_irn_n(node, 2 * pos + 1, val);
2146 ir_node *get_Psi_default(ir_node *node) {
2147 int def_pos = get_irn_arity(node) - 1;
2148 assert(node->op == op_Psi);
2149 return get_irn_n(node, def_pos);
2152 void set_Psi_default(ir_node *node, ir_node *val) {
2153 int def_pos = get_irn_arity(node);
2154 assert(node->op == op_Psi);
2155 set_irn_n(node, def_pos, val);
2158 int (get_Psi_n_conds)(ir_node *node) {
2159 return _get_Psi_n_conds(node);
2163 ir_node *get_CopyB_mem(ir_node *node) {
2164 assert(node->op == op_CopyB);
2165 return get_irn_n(node, 0);
2168 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2169 assert(node->op == op_CopyB);
2170 set_irn_n(node, 0, mem);
2173 ir_node *get_CopyB_dst(ir_node *node) {
2174 assert(node->op == op_CopyB);
2175 return get_irn_n(node, 1);
2178 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2179 assert(node->op == op_CopyB);
2180 set_irn_n(node, 1, dst);
2183 ir_node *get_CopyB_src (ir_node *node) {
2184 assert(node->op == op_CopyB);
2185 return get_irn_n(node, 2);
2188 void set_CopyB_src(ir_node *node, ir_node *src) {
2189 assert(node->op == op_CopyB);
2190 set_irn_n(node, 2, src);
2193 ir_type *get_CopyB_type(ir_node *node) {
2194 assert(node->op == op_CopyB);
2195 return node->attr.copyb.data_type;
2198 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2199 assert(node->op == op_CopyB && data_type);
2200 node->attr.copyb.data_type = data_type;
2205 get_InstOf_type(ir_node *node) {
2206 assert(node->op = op_InstOf);
2207 return node->attr.instof.type;
2211 set_InstOf_type(ir_node *node, ir_type *type) {
2212 assert(node->op = op_InstOf);
2213 node->attr.instof.type = type;
2217 get_InstOf_store(ir_node *node) {
2218 assert(node->op = op_InstOf);
2219 return get_irn_n(node, 0);
2223 set_InstOf_store(ir_node *node, ir_node *obj) {
2224 assert(node->op = op_InstOf);
2225 set_irn_n(node, 0, obj);
2229 get_InstOf_obj(ir_node *node) {
2230 assert(node->op = op_InstOf);
2231 return get_irn_n(node, 1);
2235 set_InstOf_obj(ir_node *node, ir_node *obj) {
2236 assert(node->op = op_InstOf);
2237 set_irn_n(node, 1, obj);
2240 /* Returns the memory input of a Raise operation. */
2242 get_Raise_mem(ir_node *node) {
2243 assert(node->op == op_Raise);
2244 return get_irn_n(node, 0);
2248 set_Raise_mem(ir_node *node, ir_node *mem) {
2249 assert(node->op == op_Raise);
2250 set_irn_n(node, 0, mem);
2254 get_Raise_exo_ptr(ir_node *node) {
2255 assert(node->op == op_Raise);
2256 return get_irn_n(node, 1);
2260 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2261 assert(node->op == op_Raise);
2262 set_irn_n(node, 1, exo_ptr);
2267 /* Returns the memory input of a Bound operation. */
2268 ir_node *get_Bound_mem(ir_node *bound) {
2269 assert(bound->op == op_Bound);
2270 return get_irn_n(bound, 0);
2273 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2274 assert(bound->op == op_Bound);
2275 set_irn_n(bound, 0, mem);
2278 /* Returns the index input of a Bound operation. */
2279 ir_node *get_Bound_index(ir_node *bound) {
2280 assert(bound->op == op_Bound);
2281 return get_irn_n(bound, 1);
2284 void set_Bound_index(ir_node *bound, ir_node *idx) {
2285 assert(bound->op == op_Bound);
2286 set_irn_n(bound, 1, idx);
2289 /* Returns the lower bound input of a Bound operation. */
2290 ir_node *get_Bound_lower(ir_node *bound) {
2291 assert(bound->op == op_Bound);
2292 return get_irn_n(bound, 2);
2295 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2296 assert(bound->op == op_Bound);
2297 set_irn_n(bound, 2, lower);
2300 /* Returns the upper bound input of a Bound operation. */
2301 ir_node *get_Bound_upper(ir_node *bound) {
2302 assert(bound->op == op_Bound);
2303 return get_irn_n(bound, 3);
2306 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2307 assert(bound->op == op_Bound);
2308 set_irn_n(bound, 3, upper);
2311 /* Return the operand of a Pin node. */
2312 ir_node *get_Pin_op(const ir_node *pin) {
2313 assert(pin->op == op_Pin);
2314 return get_irn_n(pin, 0);
2317 void set_Pin_op(ir_node *pin, ir_node *node) {
2318 assert(pin->op == op_Pin);
2319 set_irn_n(pin, 0, node);
2323 /* returns the graph of a node */
2325 get_irn_irg(const ir_node *node) {
2327 * Do not use get_nodes_Block() here, because this
2328 * will check the pinned state.
2329 * However even a 'wrong' block is always in the proper
2332 if (! is_Block(node))
2333 node = get_irn_n(node, -1);
2334 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2335 node = get_irn_n(node, -1);
2336 assert(get_irn_op(node) == op_Block);
2337 return node->attr.block.irg;
2341 /*----------------------------------------------------------------*/
2342 /* Auxiliary routines */
2343 /*----------------------------------------------------------------*/
2346 skip_Proj(ir_node *node) {
2347 /* don't assert node !!! */
2352 node = get_Proj_pred(node);
2358 skip_Proj_const(const ir_node *node) {
2359 /* don't assert node !!! */
2364 node = get_Proj_pred(node);
2370 skip_Tuple(ir_node *node) {
2374 if (!get_opt_normalize()) return node;
2377 if (get_irn_op(node) == op_Proj) {
2378 pred = get_Proj_pred(node);
2379 op = get_irn_op(pred);
2382 * Looks strange but calls get_irn_op() only once
2383 * in most often cases.
2385 if (op == op_Proj) { /* nested Tuple ? */
2386 pred = skip_Tuple(pred);
2387 op = get_irn_op(pred);
2389 if (op == op_Tuple) {
2390 node = get_Tuple_pred(pred, get_Proj_proj(node));
2393 } else if (op == op_Tuple) {
2394 node = get_Tuple_pred(pred, get_Proj_proj(node));
2401 /* returns operand of node if node is a Cast */
2402 ir_node *skip_Cast(ir_node *node) {
2403 if (get_irn_op(node) == op_Cast)
2404 return get_Cast_op(node);
2408 /* returns operand of node if node is a Confirm */
2409 ir_node *skip_Confirm(ir_node *node) {
2410 if (get_irn_op(node) == op_Confirm)
2411 return get_Confirm_value(node);
2415 /* skip all high-level ops */
2416 ir_node *skip_HighLevel(ir_node *node) {
2417 if (is_op_highlevel(get_irn_op(node)))
2418 return get_irn_n(node, 0);
2423 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2424 * than any other approach, as Id chains are resolved and all point to the real node, or
2425 * all id's are self loops.
2427 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2428 * a little bit "hand optimized".
2430 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2433 skip_Id(ir_node *node) {
2435 /* don't assert node !!! */
2437 if (!node || (node->op != op_Id)) return node;
2439 /* Don't use get_Id_pred(): We get into an endless loop for
2440 self-referencing Ids. */
2441 pred = node->in[0+1];
2443 if (pred->op != op_Id) return pred;
2445 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2446 ir_node *rem_pred, *res;
2448 if (pred->op != op_Id) return pred; /* shortcut */
2451 assert(get_irn_arity (node) > 0);
2453 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2454 res = skip_Id(rem_pred);
2455 if (res->op == op_Id) /* self-loop */ return node;
2457 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2464 void skip_Id_and_store(ir_node **node) {
2467 if (!n || (n->op != op_Id)) return;
2469 /* Don't use get_Id_pred(): We get into an endless loop for
2470 self-referencing Ids. */
2475 (is_Bad)(const ir_node *node) {
2476 return _is_Bad(node);
2480 (is_NoMem)(const ir_node *node) {
2481 return _is_NoMem(node);
2485 (is_Mod)(const ir_node *node) {
2486 return _is_Mod(node);
2490 (is_Div)(const ir_node *node) {
2491 return _is_Div(node);
2495 (is_DivMod)(const ir_node *node) {
2496 return _is_DivMod(node);
2500 (is_Quot)(const ir_node *node) {
2501 return _is_Quot(node);
2505 (is_Add)(const ir_node *node) {
2506 return _is_Add(node);
2510 (is_Sub)(const ir_node *node) {
2511 return _is_Sub(node);
2515 (is_Start)(const ir_node *node) {
2516 return _is_Start(node);
2520 (is_End)(const ir_node *node) {
2521 return _is_End(node);
2525 (is_Const)(const ir_node *node) {
2526 return _is_Const(node);
2530 (is_Conv)(const ir_node *node) {
2531 return _is_Conv(node);
2535 (is_no_Block)(const ir_node *node) {
2536 return _is_no_Block(node);
2540 (is_Block)(const ir_node *node) {
2541 return _is_Block(node);
2544 /* returns true if node is an Unknown node. */
2546 (is_Unknown)(const ir_node *node) {
2547 return _is_Unknown(node);
2550 /* returns true if node is a Return node. */
2552 (is_Return)(const ir_node *node) {
2553 return _is_Return(node);
2556 /* returns true if node is a Call node. */
2558 (is_Call)(const ir_node *node) {
2559 return _is_Call(node);
2562 /* returns true if node is a Sel node. */
2564 (is_Sel)(const ir_node *node) {
2565 return _is_Sel(node);
2568 /* returns true if node is a Mux node or a Psi with only one condition. */
2570 (is_Mux)(const ir_node *node) {
2571 return _is_Mux(node);
2574 /* returns true if node is a Load node. */
2576 (is_Load)(const ir_node *node) {
2577 return _is_Load(node);
2580 /* returns true if node is a Load node. */
2582 (is_Store)(const ir_node *node) {
2583 return _is_Store(node);
2586 /* returns true if node is a Sync node. */
2588 (is_Sync)(const ir_node *node) {
2589 return _is_Sync(node);
2592 /* returns true if node is a Confirm node. */
2594 (is_Confirm)(const ir_node *node) {
2595 return _is_Confirm(node);
2598 /* returns true if node is a Pin node. */
2600 (is_Pin)(const ir_node *node) {
2601 return _is_Pin(node);
2604 /* returns true if node is a SymConst node. */
2606 (is_SymConst)(const ir_node *node) {
2607 return _is_SymConst(node);
2610 /* returns true if node is a Cond node. */
2612 (is_Cond)(const ir_node *node) {
2613 return _is_Cond(node);
2617 (is_CopyB)(const ir_node *node) {
2618 return _is_CopyB(node);
2621 /* returns true if node is a Cmp node. */
2623 (is_Cmp)(const ir_node *node) {
2624 return _is_Cmp(node);
2627 /* returns true if node is an Alloc node. */
2629 (is_Alloc)(const ir_node *node) {
2630 return _is_Alloc(node);
2633 /* returns true if a node is a Jmp node. */
2635 (is_Jmp)(const ir_node *node) {
2636 return _is_Jmp(node);
2639 /* returns true if a node is a Raise node. */
2641 (is_Raise)(const ir_node *node) {
2642 return _is_Raise(node);
2646 is_Proj(const ir_node *node) {
2648 return node->op == op_Proj ||
2649 (!get_interprocedural_view() && node->op == op_Filter);
2652 /* Returns true if the operation manipulates control flow. */
2654 is_cfop(const ir_node *node) {
2655 return is_cfopcode(get_irn_op(node));
2658 /* Returns true if the operation manipulates interprocedural control flow:
2659 CallBegin, EndReg, EndExcept */
2660 int is_ip_cfop(const ir_node *node) {
2661 return is_ip_cfopcode(get_irn_op(node));
2664 /* Returns true if the operation can change the control flow because
2667 is_fragile_op(const ir_node *node) {
2668 return is_op_fragile(get_irn_op(node));
2671 /* Returns the memory operand of fragile operations. */
2672 ir_node *get_fragile_op_mem(ir_node *node) {
2673 assert(node && is_fragile_op(node));
2675 switch (get_irn_opcode (node)) {
2685 return get_irn_n(node, 0);
2690 assert(0 && "should not be reached");
2695 /* Returns true if the operation is a forking control flow operation. */
2696 int (is_irn_forking)(const ir_node *node) {
2697 return _is_irn_forking(node);
2700 /* Return the type associated with the value produced by n
2701 * if the node remarks this type as it is the case for
2702 * Cast, Const, SymConst and some Proj nodes. */
2703 ir_type *(get_irn_type)(ir_node *node) {
2704 return _get_irn_type(node);
2707 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2709 ir_type *(get_irn_type_attr)(ir_node *node) {
2710 return _get_irn_type_attr(node);
2713 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2714 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2715 return _get_irn_entity_attr(node);
2718 /* Returns non-zero for constant-like nodes. */
2719 int (is_irn_constlike)(const ir_node *node) {
2720 return _is_irn_constlike(node);
2724 * Returns non-zero for nodes that are allowed to have keep-alives and
2725 * are neither Block nor PhiM.
2727 int (is_irn_keep)(const ir_node *node) {
2728 return _is_irn_keep(node);
2732 * Returns non-zero for nodes that are always placed in the start block.
2734 int (is_irn_start_block_placed)(const ir_node *node) {
2735 return _is_irn_start_block_placed(node);
2738 /* Returns non-zero for nodes that are machine operations. */
2739 int (is_irn_machine_op)(const ir_node *node) {
2740 return _is_irn_machine_op(node);
2743 /* Returns non-zero for nodes that are machine operands. */
2744 int (is_irn_machine_operand)(const ir_node *node) {
2745 return _is_irn_machine_operand(node);
2748 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2749 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2750 return _is_irn_machine_user(node, n);
2754 /* Gets the string representation of the jump prediction .*/
2755 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2758 case COND_JMP_PRED_NONE: return "no prediction";
2759 case COND_JMP_PRED_TRUE: return "true taken";
2760 case COND_JMP_PRED_FALSE: return "false taken";
2764 /* Returns the conditional jump prediction of a Cond node. */
2765 cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
2766 return _get_Cond_jmp_pred(cond);
2769 /* Sets a new conditional jump prediction. */
2770 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2771 _set_Cond_jmp_pred(cond, pred);
2774 /** the get_type operation must be always implemented and return a firm type */
2775 static ir_type *get_Default_type(ir_node *n) {
2776 return get_unknown_type();
2779 /* Sets the get_type operation for an ir_op_ops. */
2780 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2782 case iro_Const: ops->get_type = get_Const_type; break;
2783 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2784 case iro_Cast: ops->get_type = get_Cast_type; break;
2785 case iro_Proj: ops->get_type = get_Proj_type; break;
2787 /* not allowed to be NULL */
2788 if (! ops->get_type)
2789 ops->get_type = get_Default_type;
2795 /** Return the attribute type of a SymConst node if exists */
2796 static ir_type *get_SymConst_attr_type(ir_node *self) {
2797 symconst_kind kind = get_SymConst_kind(self);
2798 if (SYMCONST_HAS_TYPE(kind))
2799 return get_SymConst_type(self);
2803 /** Return the attribute entity of a SymConst node if exists */
2804 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
2805 symconst_kind kind = get_SymConst_kind(self);
2806 if (SYMCONST_HAS_ENT(kind))
2807 return get_SymConst_entity(self);
2811 /** the get_type_attr operation must be always implemented */
2812 static ir_type *get_Null_type(ir_node *n) {
2813 return firm_unknown_type;
2816 /* Sets the get_type operation for an ir_op_ops. */
2817 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
2819 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
2820 case iro_Call: ops->get_type_attr = get_Call_type; break;
2821 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
2822 case iro_Free: ops->get_type_attr = get_Free_type; break;
2823 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
2825 /* not allowed to be NULL */
2826 if (! ops->get_type_attr)
2827 ops->get_type_attr = get_Null_type;
2833 /** the get_entity_attr operation must be always implemented */
2834 static ir_entity *get_Null_ent(ir_node *n) {
2838 /* Sets the get_type operation for an ir_op_ops. */
2839 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
2841 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
2842 case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
2844 /* not allowed to be NULL */
2845 if (! ops->get_entity_attr)
2846 ops->get_entity_attr = get_Null_ent;
2852 #ifdef DEBUG_libfirm
2853 void dump_irn(ir_node *n) {
2854 int i, arity = get_irn_arity(n);
2855 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
2857 ir_node *pred = get_irn_n(n, -1);
2858 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2859 get_irn_node_nr(pred), (void *)pred);
2861 printf(" preds: \n");
2862 for (i = 0; i < arity; ++i) {
2863 ir_node *pred = get_irn_n(n, i);
2864 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
2865 get_irn_node_nr(pred), (void *)pred);
2869 #else /* DEBUG_libfirm */
2870 void dump_irn(ir_node *n) {}
2871 #endif /* DEBUG_libfirm */