2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of an intermediate operation.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
36 #include "irgraph_t.h"
38 #include "irbackedge_t.h"
42 #include "iredgekinds.h"
43 #include "iredges_t.h"
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 assert(pnc >= 0 && pnc <
69 (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0])));
70 return pnc_name_arr[pnc];
74 * Calculates the negated (Complement(R)) pnc condition.
76 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode) {
79 /* do NOT add the Uo bit for non-floating point values */
80 if (! mode_is_float(mode))
86 /* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
87 pn_Cmp get_inversed_pnc(long pnc) {
88 long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
89 long lesser = pnc & pn_Cmp_Lt;
90 long greater = pnc & pn_Cmp_Gt;
92 code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
98 * Indicates, whether additional data can be registered to ir nodes.
99 * If set to 1, this is not possible anymore.
101 static int forbid_new_data = 0;
104 * The amount of additional space for custom data to be allocated upon
105 * creating a new node.
107 unsigned firm_add_node_size = 0;
110 /* register new space for every node */
111 unsigned firm_register_additional_node_data(unsigned size) {
112 assert(!forbid_new_data && "Too late to register additional node data");
117 return firm_add_node_size += size;
121 void init_irnode(void) {
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 /* not nice but necessary: End and Sync must always have a flexible array */
158 if (op == op_End || op == op_Sync)
159 res->in = NEW_ARR_F(ir_node *, (arity+1));
161 res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
162 memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
166 set_irn_dbg_info(res, db);
170 res->node_nr = get_irp_new_node_nr();
173 for (i = 0; i < EDGE_KIND_LAST; ++i)
174 INIT_LIST_HEAD(&res->edge_info[i].outs_head);
176 /* don't put this into the for loop, arity is -1 for some nodes! */
177 edges_notify_edge(res, -1, res->in[0], NULL, irg);
178 for (i = 1; i <= arity; ++i)
179 edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
181 hook_new_node(irg, res);
186 /*-- getting some parameters from ir_nodes --*/
188 int (is_ir_node)(const void *thing) {
189 return _is_ir_node(thing);
192 int (get_irn_intra_arity)(const ir_node *node) {
193 return _get_irn_intra_arity(node);
196 int (get_irn_inter_arity)(const ir_node *node) {
197 return _get_irn_inter_arity(node);
200 int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
202 int (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
212 ir_node **get_irn_in(const ir_node *node) {
214 if (get_interprocedural_view()) { /* handle Filter and Block specially */
215 if (get_irn_opcode(node) == iro_Filter) {
216 assert(node->attr.filter.in_cg);
217 return node->attr.filter.in_cg;
218 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
219 return node->attr.block.in_cg;
221 /* else fall through */
226 void set_irn_in(ir_node *node, int arity, ir_node **in) {
229 ir_graph *irg = current_ir_graph;
231 if (get_interprocedural_view()) { /* handle Filter and Block specially */
232 ir_opcode code = get_irn_opcode(node);
233 if (code == iro_Filter) {
234 assert(node->attr.filter.in_cg);
235 pOld_in = &node->attr.filter.in_cg;
236 } else if (code == iro_Block && node->attr.block.in_cg) {
237 pOld_in = &node->attr.block.in_cg;
245 for (i = 0; i < arity; i++) {
246 if (i < ARR_LEN(*pOld_in)-1)
247 edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
249 edges_notify_edge(node, i, in[i], NULL, irg);
251 for (;i < ARR_LEN(*pOld_in)-1; i++) {
252 edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
255 if (arity != ARR_LEN(*pOld_in) - 1) {
256 ir_node * block = (*pOld_in)[0];
257 *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
258 (*pOld_in)[0] = block;
260 fix_backedges(irg->obst, node);
262 memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
265 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
266 return _get_irn_intra_n (node, n);
269 ir_node *(get_irn_inter_n)(const ir_node *node, int n) {
270 return _get_irn_inter_n (node, n);
273 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
275 ir_node *(get_irn_n)(const ir_node *node, int n) {
276 return _get_irn_n(node, n);
279 void set_irn_n(ir_node *node, int n, ir_node *in) {
280 assert(node && node->kind == k_ir_node);
282 assert(n < get_irn_arity(node));
283 assert(in && in->kind == k_ir_node);
285 if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
286 /* Change block pred in both views! */
287 node->in[n + 1] = in;
288 assert(node->attr.filter.in_cg);
289 node->attr.filter.in_cg[n + 1] = in;
292 if (get_interprocedural_view()) { /* handle Filter and Block specially */
293 if (get_irn_opcode(node) == iro_Filter) {
294 assert(node->attr.filter.in_cg);
295 node->attr.filter.in_cg[n + 1] = in;
297 } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
298 node->attr.block.in_cg[n + 1] = in;
301 /* else fall through */
305 hook_set_irn_n(node, n, in, node->in[n + 1]);
307 /* Here, we rely on src and tgt being in the current ir graph */
308 edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);
310 node->in[n + 1] = in;
313 int add_irn_n(ir_node *node, ir_node *in) {
315 ir_graph *irg = get_irn_irg(node);
317 assert(node->op->opar == oparity_dynamic);
318 pos = ARR_LEN(node->in) - 1;
319 ARR_APP1(ir_node *, node->in, in);
320 edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);
323 hook_set_irn_n(node, pos, node->in[pos + 1], NULL);
328 void del_Sync_n(ir_node *n, int i)
330 int arity = get_Sync_n_preds(n);
331 ir_node *last_pred = get_Sync_pred(n, arity - 1);
332 set_Sync_pred(n, i, last_pred);
333 edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
334 ARR_SHRINKLEN(get_irn_in(n), arity);
337 int (get_irn_deps)(const ir_node *node) {
338 return _get_irn_deps(node);
341 ir_node *(get_irn_dep)(const ir_node *node, int pos) {
342 return _get_irn_dep(node, pos);
345 void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
346 _set_irn_dep(node, pos, dep);
349 int add_irn_dep(ir_node *node, ir_node *dep) {
352 if (node->deps == NULL) {
353 node->deps = NEW_ARR_F(ir_node *, 1);
359 for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
360 if(node->deps[i] == NULL)
363 if(node->deps[i] == dep)
367 if (first_zero >= 0) {
368 node->deps[first_zero] = dep;
371 ARR_APP1(ir_node *, node->deps, dep);
376 edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));
381 void add_irn_deps(ir_node *tgt, ir_node *src) {
384 for (i = 0, n = get_irn_deps(src); i < n; ++i)
385 add_irn_dep(tgt, get_irn_dep(src, i));
389 ir_mode *(get_irn_mode)(const ir_node *node) {
390 return _get_irn_mode(node);
393 void (set_irn_mode)(ir_node *node, ir_mode *mode) {
394 _set_irn_mode(node, mode);
397 modecode get_irn_modecode(const ir_node *node) {
399 return node->mode->code;
402 /** Gets the string representation of the mode .*/
403 const char *get_irn_modename(const ir_node *node) {
405 return get_mode_name(node->mode);
408 ident *get_irn_modeident(const ir_node *node) {
410 return get_mode_ident(node->mode);
413 ir_op *(get_irn_op)(const ir_node *node) {
414 return _get_irn_op(node);
417 /* should be private to the library: */
418 void (set_irn_op)(ir_node *node, ir_op *op) {
419 _set_irn_op(node, op);
422 unsigned (get_irn_opcode)(const ir_node *node) {
423 return _get_irn_opcode(node);
426 const char *get_irn_opname(const ir_node *node) {
428 if (is_Phi0(node)) return "Phi0";
429 return get_id_str(node->op->name);
432 ident *get_irn_opident(const ir_node *node) {
434 return node->op->name;
437 unsigned long (get_irn_visited)(const ir_node *node) {
438 return _get_irn_visited(node);
441 void (set_irn_visited)(ir_node *node, unsigned long visited) {
442 _set_irn_visited(node, visited);
445 void (mark_irn_visited)(ir_node *node) {
446 _mark_irn_visited(node);
449 int (irn_not_visited)(const ir_node *node) {
450 return _irn_not_visited(node);
453 int (irn_visited)(const ir_node *node) {
454 return _irn_visited(node);
457 void (set_irn_link)(ir_node *node, void *link) {
458 _set_irn_link(node, link);
461 void *(get_irn_link)(const ir_node *node) {
462 return _get_irn_link(node);
465 op_pin_state (get_irn_pinned)(const ir_node *node) {
466 return _get_irn_pinned(node);
469 op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) {
470 return _is_irn_pinned_in_irg(node);
473 void set_irn_pinned(ir_node *node, op_pin_state state) {
474 /* due to optimization an opt may be turned into a Tuple */
475 if (get_irn_op(node) == op_Tuple)
478 assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
479 assert(state == op_pin_state_pinned || state == op_pin_state_floats);
481 node->attr.except.pin_state = state;
484 #ifdef DO_HEAPANALYSIS
485 /* Access the abstract interpretation information of a node.
486 Returns NULL if no such information is available. */
487 struct abstval *get_irn_abst_value(ir_node *n) {
490 /* Set the abstract interpretation information of a node. */
491 void set_irn_abst_value(ir_node *n, struct abstval *os) {
494 struct section *firm_get_irn_section(ir_node *n) {
497 void firm_set_irn_section(ir_node *n, struct section *s) {
501 /* Dummies needed for firmjni. */
502 struct abstval *get_irn_abst_value(ir_node *n) {
506 void set_irn_abst_value(ir_node *n, struct abstval *os) {
510 struct section *firm_get_irn_section(ir_node *n) {
514 void firm_set_irn_section(ir_node *n, struct section *s) {
518 #endif /* DO_HEAPANALYSIS */
521 /* Outputs a unique number for this node */
522 long get_irn_node_nr(const ir_node *node) {
525 return node->node_nr;
527 return (long)PTR_TO_INT(node);
531 const_attr *get_irn_const_attr(ir_node *node) {
532 assert(node->op == op_Const);
533 return &node->attr.con;
536 long get_irn_proj_attr(ir_node *node) {
537 assert(node->op == op_Proj);
538 return node->attr.proj;
541 alloc_attr *get_irn_alloc_attr(ir_node *node) {
542 assert(node->op == op_Alloc);
543 return &node->attr.alloc;
546 free_attr *get_irn_free_attr(ir_node *node) {
547 assert(node->op == op_Free);
548 return &node->attr.free;
551 symconst_attr *get_irn_symconst_attr(ir_node *node) {
552 assert(node->op == op_SymConst);
553 return &node->attr.symc;
556 ir_type *get_irn_call_attr(ir_node *node) {
557 assert(node->op == op_Call);
558 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
561 sel_attr *get_irn_sel_attr(ir_node *node) {
562 assert(node->op == op_Sel);
563 return &node->attr.sel;
566 phi_attr *get_irn_phi_attr(ir_node *node) {
567 return &node->attr.phi;
570 block_attr *get_irn_block_attr(ir_node *node) {
571 assert(node->op == op_Block);
572 return &node->attr.block;
575 load_attr *get_irn_load_attr(ir_node *node) {
576 assert(node->op == op_Load);
577 return &node->attr.load;
580 store_attr *get_irn_store_attr(ir_node *node) {
581 assert(node->op == op_Store);
582 return &node->attr.store;
585 except_attr *get_irn_except_attr(ir_node *node) {
586 assert(node->op == op_Div || node->op == op_Quot ||
587 node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc || node->op == op_Bound);
588 return &node->attr.except;
591 divmod_attr *get_irn_divmod_attr(ir_node *node) {
592 assert(node->op == op_Div || node->op == op_Quot ||
593 node->op == op_DivMod || node->op == op_Mod);
594 return &node->attr.divmod;
597 void *(get_irn_generic_attr)(ir_node *node) {
598 assert(is_ir_node(node));
599 return _get_irn_generic_attr(node);
602 const void *(get_irn_generic_attr_const)(const ir_node *node) {
603 assert(is_ir_node(node));
604 return _get_irn_generic_attr_const(node);
607 unsigned (get_irn_idx)(const ir_node *node) {
608 assert(is_ir_node(node));
609 return _get_irn_idx(node);
612 int get_irn_pred_pos(ir_node *node, ir_node *arg) {
614 for (i = get_irn_arity(node) - 1; i >= 0; i--) {
615 if (get_irn_n(node, i) == arg)
621 /** manipulate fields of individual nodes **/
623 /* this works for all except Block */
624 ir_node *get_nodes_block(const ir_node *node) {
625 assert(node->op != op_Block);
626 return get_irn_n(node, -1);
629 void set_nodes_block(ir_node *node, ir_node *block) {
630 assert(node->op != op_Block);
631 set_irn_n(node, -1, block);
634 /* this works for all except Block */
635 ir_node *get_nodes_MacroBlock(const ir_node *node) {
636 assert(node->op != op_Block);
637 return get_Block_MacroBlock(get_irn_n(node, -1));
640 /* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
641 * from Start. If so returns frame type, else Null. */
642 ir_type *is_frame_pointer(const ir_node *n) {
643 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
644 ir_node *start = get_Proj_pred(n);
645 if (is_Start(start)) {
646 return get_irg_frame_type(get_irn_irg(start));
652 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
653 * from Start. If so returns tls type, else Null. */
654 ir_type *is_tls_pointer(const ir_node *n) {
655 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) {
656 ir_node *start = get_Proj_pred(n);
657 if (is_Start(start)) {
658 return get_tls_type();
664 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
665 * from Start. If so returns 1, else 0. */
666 int is_value_arg_pointer(const ir_node *n) {
668 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
669 is_Start(get_Proj_pred(n)))
674 /* Returns an array with the predecessors of the Block. Depending on
675 the implementation of the graph data structure this can be a copy of
676 the internal representation of predecessors as well as the internal
677 array itself. Therefore writing to this array might obstruct the ir. */
678 ir_node **get_Block_cfgpred_arr(ir_node *node) {
679 assert((node->op == op_Block));
680 return (ir_node **)&(get_irn_in(node)[1]);
683 int (get_Block_n_cfgpreds)(const ir_node *node) {
684 return _get_Block_n_cfgpreds(node);
687 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
688 return _get_Block_cfgpred(node, pos);
691 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
692 assert(node->op == op_Block);
693 set_irn_n(node, pos, pred);
696 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
697 return _get_Block_cfgpred_block(node, pos);
700 int get_Block_matured(const ir_node *node) {
701 assert(node->op == op_Block);
702 return (int)node->attr.block.is_matured;
705 void set_Block_matured(ir_node *node, int matured) {
706 assert(node->op == op_Block);
707 node->attr.block.is_matured = matured;
710 unsigned long (get_Block_block_visited)(const ir_node *node) {
711 return _get_Block_block_visited(node);
714 void (set_Block_block_visited)(ir_node *node, unsigned long visit) {
715 _set_Block_block_visited(node, visit);
718 /* For this current_ir_graph must be set. */
719 void (mark_Block_block_visited)(ir_node *node) {
720 _mark_Block_block_visited(node);
723 int (Block_not_block_visited)(const ir_node *node) {
724 return _Block_not_block_visited(node);
727 int (Block_block_visited)(const ir_node *node) {
728 return _Block_block_visited(node);
731 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
732 assert(node->op == op_Block);
733 return node->attr.block.graph_arr[pos+1];
736 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
737 assert(node->op == op_Block);
738 node->attr.block.graph_arr[pos+1] = value;
741 #ifdef INTERPROCEDURAL_VIEW
742 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
743 assert(node->op == op_Block);
744 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
745 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
746 node->attr.block.in_cg[0] = NULL;
747 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
749 /* Fix backedge array. fix_backedges() operates depending on
750 interprocedural_view. */
751 int ipv = get_interprocedural_view();
752 set_interprocedural_view(1);
753 fix_backedges(current_ir_graph->obst, node);
754 set_interprocedural_view(ipv);
757 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
760 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
761 assert(node->op == op_Block &&
762 node->attr.block.in_cg &&
763 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
764 node->attr.block.in_cg[pos + 1] = pred;
767 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
768 assert(node->op == op_Block);
769 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
772 int get_Block_cg_n_cfgpreds(const ir_node *node) {
773 assert(node->op == op_Block);
774 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
777 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
778 assert(node->op == op_Block && node->attr.block.in_cg);
779 return node->attr.block.in_cg[pos + 1];
782 void remove_Block_cg_cfgpred_arr(ir_node *node) {
783 assert(node->op == op_Block);
784 node->attr.block.in_cg = NULL;
788 ir_node *(set_Block_dead)(ir_node *block) {
789 return _set_Block_dead(block);
792 int (is_Block_dead)(const ir_node *block) {
793 return _is_Block_dead(block);
796 ir_extblk *get_Block_extbb(const ir_node *block) {
798 assert(is_Block(block));
799 res = block->attr.block.extblk;
800 assert(res == NULL || is_ir_extbb(res));
804 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
805 assert(is_Block(block));
806 assert(extblk == NULL || is_ir_extbb(extblk));
807 block->attr.block.extblk = extblk;
810 /* Returns the macro block header of a block.*/
811 ir_node *get_Block_MacroBlock(const ir_node *block) {
813 assert(is_Block(block));
814 mbh = get_irn_n(block, -1);
815 /* once macro block header is respected by all optimizations,
816 this assert can be removed */
821 /* Sets the macro block header of a block. */
822 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
823 assert(is_Block(block));
824 assert(is_Block(mbh));
825 set_irn_n(block, -1, mbh);
828 /* returns the macro block header of a node. */
829 ir_node *get_irn_MacroBlock(const ir_node *n) {
831 n = get_nodes_block(n);
832 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
836 return get_Block_MacroBlock(n);
839 /* returns the graph of a Block. */
840 ir_graph *get_Block_irg(const ir_node *block) {
841 assert(is_Block(block));
842 return block->attr.block.irg;
845 int has_Block_label(const ir_node *block) {
846 assert(is_Block(block));
847 return block->attr.block.has_label;
850 ir_label_t get_Block_label(const ir_node *block) {
851 assert(is_Block(block));
852 return block->attr.block.label;
855 void set_Block_label(ir_node *block, ir_label_t label) {
856 assert(is_Block(block));
857 block->attr.block.has_label = 1;
858 block->attr.block.label = label;
861 ir_node *(get_Block_phis)(const ir_node *block) {
862 return _get_Block_phis(block);
865 void (set_Block_phis)(ir_node *block, ir_node *phi) {
866 _set_Block_phis(block, phi);
869 int get_End_n_keepalives(const ir_node *end) {
870 assert(end->op == op_End);
871 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
874 ir_node *get_End_keepalive(const ir_node *end, int pos) {
875 assert(end->op == op_End);
876 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
879 void add_End_keepalive(ir_node *end, ir_node *ka) {
880 assert(end->op == op_End);
881 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
885 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
886 assert(end->op == op_End);
887 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
890 /* Set new keep-alives */
891 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
893 ir_graph *irg = get_irn_irg(end);
895 /* notify that edges are deleted */
896 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
897 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
899 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
901 for (i = 0; i < n; ++i) {
902 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
903 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
907 /* Set new keep-alives from old keep-alives, skipping irn */
908 void remove_End_keepalive(ir_node *end, ir_node *irn) {
909 int n = get_End_n_keepalives(end);
913 NEW_ARR_A(ir_node *, in, n);
915 for (idx = i = 0; i < n; ++i) {
916 ir_node *old_ka = get_End_keepalive(end, i);
923 /* set new keep-alives */
924 set_End_keepalives(end, idx, in);
928 free_End(ir_node *end) {
929 assert(end->op == op_End);
932 end->in = NULL; /* @@@ make sure we get an error if we use the
933 in array afterwards ... */
936 /* Return the target address of an IJmp */
937 ir_node *get_IJmp_target(const ir_node *ijmp) {
938 assert(ijmp->op == op_IJmp);
939 return get_irn_n(ijmp, 0);
942 /** Sets the target address of an IJmp */
943 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
944 assert(ijmp->op == op_IJmp);
945 set_irn_n(ijmp, 0, tgt);
949 > Implementing the case construct (which is where the constant Proj node is
950 > important) involves far more than simply determining the constant values.
951 > We could argue that this is more properly a function of the translator from
952 > Firm to the target machine. That could be done if there was some way of
953 > projecting "default" out of the Cond node.
954 I know it's complicated.
955 Basically there are two problems:
956 - determining the gaps between the Projs
957 - determining the biggest case constant to know the proj number for
959 I see several solutions:
960 1. Introduce a ProjDefault node. Solves both problems.
961 This means to extend all optimizations executed during construction.
962 2. Give the Cond node for switch two flavors:
963 a) there are no gaps in the Projs (existing flavor)
964 b) gaps may exist, default proj is still the Proj with the largest
965 projection number. This covers also the gaps.
966 3. Fix the semantic of the Cond to that of 2b)
968 Solution 2 seems to be the best:
969 Computing the gaps in the Firm representation is not too hard, i.e.,
970 libFIRM can implement a routine that transforms between the two
971 flavours. This is also possible for 1) but 2) does not require to
972 change any existing optimization.
973 Further it should be far simpler to determine the biggest constant than
975 I don't want to choose 3) as 2a) seems to have advantages for
976 dataflow analysis and 3) does not allow to convert the representation to
980 get_Cond_selector(const ir_node *node) {
981 assert(node->op == op_Cond);
982 return get_irn_n(node, 0);
986 set_Cond_selector(ir_node *node, ir_node *selector) {
987 assert(node->op == op_Cond);
988 set_irn_n(node, 0, selector);
992 get_Cond_kind(const ir_node *node) {
993 assert(node->op == op_Cond);
994 return node->attr.cond.kind;
998 set_Cond_kind(ir_node *node, cond_kind kind) {
999 assert(node->op == op_Cond);
1000 node->attr.cond.kind = kind;
1004 get_Cond_defaultProj(const ir_node *node) {
1005 assert(node->op == op_Cond);
1006 return node->attr.cond.default_proj;
1010 get_Return_mem(const ir_node *node) {
1011 assert(node->op == op_Return);
1012 return get_irn_n(node, 0);
1016 set_Return_mem(ir_node *node, ir_node *mem) {
1017 assert(node->op == op_Return);
1018 set_irn_n(node, 0, mem);
1022 get_Return_n_ress(const ir_node *node) {
1023 assert(node->op == op_Return);
1024 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1028 get_Return_res_arr(ir_node *node) {
1029 assert((node->op == op_Return));
1030 if (get_Return_n_ress(node) > 0)
1031 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1038 set_Return_n_res(ir_node *node, int results) {
1039 assert(node->op == op_Return);
1044 get_Return_res(const ir_node *node, int pos) {
1045 assert(node->op == op_Return);
1046 assert(get_Return_n_ress(node) > pos);
1047 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1051 set_Return_res(ir_node *node, int pos, ir_node *res){
1052 assert(node->op == op_Return);
1053 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1056 tarval *(get_Const_tarval)(const ir_node *node) {
1057 return _get_Const_tarval(node);
1061 set_Const_tarval(ir_node *node, tarval *con) {
1062 assert(node->op == op_Const);
1063 node->attr.con.tv = con;
1066 int (is_Const_null)(const ir_node *node) {
1067 return _is_Const_null(node);
1070 int (is_Const_one)(const ir_node *node) {
1071 return _is_Const_one(node);
1074 int (is_Const_all_one)(const ir_node *node) {
1075 return _is_Const_all_one(node);
1079 /* The source language type. Must be an atomic type. Mode of type must
1080 be mode of node. For tarvals from entities type must be pointer to
1083 get_Const_type(ir_node *node) {
1084 assert(node->op == op_Const);
1085 node->attr.con.tp = skip_tid(node->attr.con.tp);
1086 return node->attr.con.tp;
1090 set_Const_type(ir_node *node, ir_type *tp) {
1091 assert(node->op == op_Const);
1092 if (tp != firm_unknown_type) {
1093 assert(is_atomic_type(tp));
1094 assert(get_type_mode(tp) == get_irn_mode(node));
1096 node->attr.con.tp = tp;
1101 get_SymConst_kind(const ir_node *node) {
1102 assert(node->op == op_SymConst);
1103 return node->attr.symc.kind;
1107 set_SymConst_kind(ir_node *node, symconst_kind kind) {
1108 assert(node->op == op_SymConst);
1109 node->attr.symc.kind = kind;
1113 get_SymConst_type(ir_node *node) {
1114 assert((node->op == op_SymConst) &&
1115 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1116 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1120 set_SymConst_type(ir_node *node, ir_type *tp) {
1121 assert((node->op == op_SymConst) &&
1122 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1123 node->attr.symc.sym.type_p = tp;
1127 get_SymConst_name(const ir_node *node) {
1128 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1129 return node->attr.symc.sym.ident_p;
1133 set_SymConst_name(ir_node *node, ident *name) {
1134 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1135 node->attr.symc.sym.ident_p = name;
1139 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1140 ir_entity *get_SymConst_entity(const ir_node *node) {
1141 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1142 return node->attr.symc.sym.entity_p;
1145 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1146 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1147 node->attr.symc.sym.entity_p = ent;
1150 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1151 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1152 return node->attr.symc.sym.enum_p;
1155 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1156 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1157 node->attr.symc.sym.enum_p = ec;
1160 union symconst_symbol
1161 get_SymConst_symbol(const ir_node *node) {
1162 assert(node->op == op_SymConst);
1163 return node->attr.symc.sym;
1167 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1168 assert(node->op == op_SymConst);
1169 node->attr.symc.sym = sym;
1172 ir_label_t get_SymConst_label(const ir_node *node) {
1173 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1174 return node->attr.symc.sym.label;
1177 void set_SymConst_label(ir_node *node, ir_label_t label) {
1178 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1179 node->attr.symc.sym.label = label;
1183 get_SymConst_value_type(ir_node *node) {
1184 assert(node->op == op_SymConst);
1185 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1186 return node->attr.symc.tp;
1190 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1191 assert(node->op == op_SymConst);
1192 node->attr.symc.tp = tp;
1196 get_Sel_mem(const ir_node *node) {
1197 assert(node->op == op_Sel);
1198 return get_irn_n(node, 0);
1202 set_Sel_mem(ir_node *node, ir_node *mem) {
1203 assert(node->op == op_Sel);
1204 set_irn_n(node, 0, mem);
1208 get_Sel_ptr(const ir_node *node) {
1209 assert(node->op == op_Sel);
1210 return get_irn_n(node, 1);
1214 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1215 assert(node->op == op_Sel);
1216 set_irn_n(node, 1, ptr);
1220 get_Sel_n_indexs(const ir_node *node) {
1221 assert(node->op == op_Sel);
1222 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1226 get_Sel_index_arr(ir_node *node) {
1227 assert((node->op == op_Sel));
1228 if (get_Sel_n_indexs(node) > 0)
1229 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1235 get_Sel_index(const ir_node *node, int pos) {
1236 assert(node->op == op_Sel);
1237 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1241 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1242 assert(node->op == op_Sel);
1243 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1247 get_Sel_entity(const ir_node *node) {
1248 assert(node->op == op_Sel);
1249 return node->attr.sel.ent;
1252 ir_entity *_get_Sel_entity(ir_node *node) {
1253 return get_Sel_entity(node);
1257 set_Sel_entity(ir_node *node, ir_entity *ent) {
1258 assert(node->op == op_Sel);
1259 node->attr.sel.ent = ent;
1263 /* For unary and binary arithmetic operations the access to the
1264 operands can be factored out. Left is the first, right the
1265 second arithmetic value as listed in tech report 0999-33.
1266 unops are: Minus, Abs, Not, Conv, Cast
1267 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1268 Shr, Shrs, Rotate, Cmp */
1272 get_Call_mem(const ir_node *node) {
1273 assert(node->op == op_Call);
1274 return get_irn_n(node, 0);
1278 set_Call_mem(ir_node *node, ir_node *mem) {
1279 assert(node->op == op_Call);
1280 set_irn_n(node, 0, mem);
1284 get_Call_ptr(const ir_node *node) {
1285 assert(node->op == op_Call);
1286 return get_irn_n(node, 1);
1290 set_Call_ptr(ir_node *node, ir_node *ptr) {
1291 assert(node->op == op_Call);
1292 set_irn_n(node, 1, ptr);
1296 get_Call_param_arr(ir_node *node) {
1297 assert(node->op == op_Call);
1298 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1302 get_Call_n_params(const ir_node *node) {
1303 assert(node->op == op_Call);
1304 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1308 get_Call_arity(const ir_node *node) {
1309 assert(node->op == op_Call);
1310 return get_Call_n_params(node);
1314 set_Call_arity(ir_node *node, ir_node *arity) {
1315 assert(node->op == op_Call);
1320 get_Call_param(const ir_node *node, int pos) {
1321 assert(node->op == op_Call);
1322 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1326 set_Call_param(ir_node *node, int pos, ir_node *param) {
1327 assert(node->op == op_Call);
1328 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1332 get_Call_type(ir_node *node) {
1333 assert(node->op == op_Call);
1334 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1338 set_Call_type(ir_node *node, ir_type *tp) {
1339 assert(node->op == op_Call);
1340 assert((get_unknown_type() == tp) || is_Method_type(tp));
1341 node->attr.call.cld_tp = tp;
1344 int Call_has_callees(const ir_node *node) {
1345 assert(node && node->op == op_Call);
1346 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1347 (node->attr.call.callee_arr != NULL));
1350 int get_Call_n_callees(const ir_node *node) {
1351 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1352 return ARR_LEN(node->attr.call.callee_arr);
1355 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1356 assert(pos >= 0 && pos < get_Call_n_callees(node));
1357 return node->attr.call.callee_arr[pos];
1360 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1361 assert(node->op == op_Call);
1362 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1363 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1365 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1368 void remove_Call_callee_arr(ir_node *node) {
1369 assert(node->op == op_Call);
1370 node->attr.call.callee_arr = NULL;
1373 ir_node *get_CallBegin_ptr(const ir_node *node) {
1374 assert(node->op == op_CallBegin);
1375 return get_irn_n(node, 0);
1378 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1379 assert(node->op == op_CallBegin);
1380 set_irn_n(node, 0, ptr);
1383 ir_node *get_CallBegin_call(const ir_node *node) {
1384 assert(node->op == op_CallBegin);
1385 return node->attr.callbegin.call;
1388 void set_CallBegin_call(ir_node *node, ir_node *call) {
1389 assert(node->op == op_CallBegin);
1390 node->attr.callbegin.call = call;
1395 ir_node * get_##OP##_left(const ir_node *node) { \
1396 assert(node->op == op_##OP); \
1397 return get_irn_n(node, node->op->op_index); \
1399 void set_##OP##_left(ir_node *node, ir_node *left) { \
1400 assert(node->op == op_##OP); \
1401 set_irn_n(node, node->op->op_index, left); \
1403 ir_node *get_##OP##_right(const ir_node *node) { \
1404 assert(node->op == op_##OP); \
1405 return get_irn_n(node, node->op->op_index + 1); \
1407 void set_##OP##_right(ir_node *node, ir_node *right) { \
1408 assert(node->op == op_##OP); \
1409 set_irn_n(node, node->op->op_index + 1, right); \
1413 ir_node *get_##OP##_op(const ir_node *node) { \
1414 assert(node->op == op_##OP); \
1415 return get_irn_n(node, node->op->op_index); \
1417 void set_##OP##_op(ir_node *node, ir_node *op) { \
1418 assert(node->op == op_##OP); \
1419 set_irn_n(node, node->op->op_index, op); \
1422 #define BINOP_MEM(OP) \
1426 get_##OP##_mem(const ir_node *node) { \
1427 assert(node->op == op_##OP); \
1428 return get_irn_n(node, 0); \
1432 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1433 assert(node->op == op_##OP); \
1434 set_irn_n(node, 0, mem); \
1440 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1441 assert(node->op == op_##OP); \
1442 return node->attr.divmod.res_mode; \
1445 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1446 assert(node->op == op_##OP); \
1447 node->attr.divmod.res_mode = mode; \
1473 int is_Div_remainderless(const ir_node *node) {
1474 assert(node->op == op_Div);
1475 return node->attr.divmod.no_remainder;
1478 int get_Conv_strict(const ir_node *node) {
1479 assert(node->op == op_Conv);
1480 return node->attr.conv.strict;
1483 void set_Conv_strict(ir_node *node, int strict_flag) {
1484 assert(node->op == op_Conv);
1485 node->attr.conv.strict = (char)strict_flag;
1489 get_Cast_type(ir_node *node) {
1490 assert(node->op == op_Cast);
1491 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1492 return node->attr.cast.totype;
1496 set_Cast_type(ir_node *node, ir_type *to_tp) {
1497 assert(node->op == op_Cast);
1498 node->attr.cast.totype = to_tp;
1502 /* Checks for upcast.
1504 * Returns true if the Cast node casts a class type to a super type.
1506 int is_Cast_upcast(ir_node *node) {
1507 ir_type *totype = get_Cast_type(node);
1508 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1510 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1513 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1514 totype = get_pointer_points_to_type(totype);
1515 fromtype = get_pointer_points_to_type(fromtype);
1520 if (!is_Class_type(totype)) return 0;
1521 return is_SubClass_of(fromtype, totype);
1524 /* Checks for downcast.
1526 * Returns true if the Cast node casts a class type to a sub type.
1528 int is_Cast_downcast(ir_node *node) {
1529 ir_type *totype = get_Cast_type(node);
1530 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1532 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1535 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1536 totype = get_pointer_points_to_type(totype);
1537 fromtype = get_pointer_points_to_type(fromtype);
1542 if (!is_Class_type(totype)) return 0;
1543 return is_SubClass_of(totype, fromtype);
1547 (is_unop)(const ir_node *node) {
1548 return _is_unop(node);
1552 get_unop_op(const ir_node *node) {
1553 if (node->op->opar == oparity_unary)
1554 return get_irn_n(node, node->op->op_index);
1556 assert(node->op->opar == oparity_unary);
1561 set_unop_op(ir_node *node, ir_node *op) {
1562 if (node->op->opar == oparity_unary)
1563 set_irn_n(node, node->op->op_index, op);
1565 assert(node->op->opar == oparity_unary);
1569 (is_binop)(const ir_node *node) {
1570 return _is_binop(node);
1574 get_binop_left(const ir_node *node) {
1575 assert(node->op->opar == oparity_binary);
1576 return get_irn_n(node, node->op->op_index);
1580 set_binop_left(ir_node *node, ir_node *left) {
1581 assert(node->op->opar == oparity_binary);
1582 set_irn_n(node, node->op->op_index, left);
1586 get_binop_right(const ir_node *node) {
1587 assert(node->op->opar == oparity_binary);
1588 return get_irn_n(node, node->op->op_index + 1);
1592 set_binop_right(ir_node *node, ir_node *right) {
1593 assert(node->op->opar == oparity_binary);
1594 set_irn_n(node, node->op->op_index + 1, right);
1598 (is_Phi)(const ir_node *n) {
1602 int is_Phi0(const ir_node *n) {
1605 return ((get_irn_op(n) == op_Phi) &&
1606 (get_irn_arity(n) == 0) &&
1607 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1611 get_Phi_preds_arr(ir_node *node) {
1612 assert(node->op == op_Phi);
1613 return (ir_node **)&(get_irn_in(node)[1]);
1617 get_Phi_n_preds(const ir_node *node) {
1618 assert(is_Phi(node) || is_Phi0(node));
1619 return (get_irn_arity(node));
1623 void set_Phi_n_preds(ir_node *node, int n_preds) {
1624 assert(node->op == op_Phi);
1629 get_Phi_pred(const ir_node *node, int pos) {
1630 assert(is_Phi(node) || is_Phi0(node));
1631 return get_irn_n(node, pos);
1635 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1636 assert(is_Phi(node) || is_Phi0(node));
1637 set_irn_n(node, pos, pred);
1640 ir_node *(get_Phi_next)(const ir_node *phi) {
1641 return _get_Phi_next(phi);
1644 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1645 _set_Phi_next(phi, next);
1648 int is_memop(const ir_node *node) {
1649 ir_opcode code = get_irn_opcode(node);
1650 return (code == iro_Load || code == iro_Store);
1653 ir_node *get_memop_mem(const ir_node *node) {
1654 assert(is_memop(node));
1655 return get_irn_n(node, 0);
1658 void set_memop_mem(ir_node *node, ir_node *mem) {
1659 assert(is_memop(node));
1660 set_irn_n(node, 0, mem);
1663 ir_node *get_memop_ptr(const ir_node *node) {
1664 assert(is_memop(node));
1665 return get_irn_n(node, 1);
1668 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1669 assert(is_memop(node));
1670 set_irn_n(node, 1, ptr);
1674 get_Load_mem(const ir_node *node) {
1675 assert(node->op == op_Load);
1676 return get_irn_n(node, 0);
1680 set_Load_mem(ir_node *node, ir_node *mem) {
1681 assert(node->op == op_Load);
1682 set_irn_n(node, 0, mem);
1686 get_Load_ptr(const ir_node *node) {
1687 assert(node->op == op_Load);
1688 return get_irn_n(node, 1);
1692 set_Load_ptr(ir_node *node, ir_node *ptr) {
1693 assert(node->op == op_Load);
1694 set_irn_n(node, 1, ptr);
1698 get_Load_mode(const ir_node *node) {
1699 assert(node->op == op_Load);
1700 return node->attr.load.load_mode;
1704 set_Load_mode(ir_node *node, ir_mode *mode) {
1705 assert(node->op == op_Load);
1706 node->attr.load.load_mode = mode;
1710 get_Load_volatility(const ir_node *node) {
1711 assert(node->op == op_Load);
1712 return node->attr.load.volatility;
1716 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1717 assert(node->op == op_Load);
1718 node->attr.load.volatility = volatility;
1722 get_Load_align(const ir_node *node) {
1723 assert(node->op == op_Load);
1724 return node->attr.load.aligned;
1728 set_Load_align(ir_node *node, ir_align align) {
1729 assert(node->op == op_Load);
1730 node->attr.load.aligned = align;
1735 get_Store_mem(const ir_node *node) {
1736 assert(node->op == op_Store);
1737 return get_irn_n(node, 0);
1741 set_Store_mem(ir_node *node, ir_node *mem) {
1742 assert(node->op == op_Store);
1743 set_irn_n(node, 0, mem);
1747 get_Store_ptr(const ir_node *node) {
1748 assert(node->op == op_Store);
1749 return get_irn_n(node, 1);
1753 set_Store_ptr(ir_node *node, ir_node *ptr) {
1754 assert(node->op == op_Store);
1755 set_irn_n(node, 1, ptr);
1759 get_Store_value(const ir_node *node) {
1760 assert(node->op == op_Store);
1761 return get_irn_n(node, 2);
1765 set_Store_value(ir_node *node, ir_node *value) {
1766 assert(node->op == op_Store);
1767 set_irn_n(node, 2, value);
1771 get_Store_volatility(const ir_node *node) {
1772 assert(node->op == op_Store);
1773 return node->attr.store.volatility;
1777 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1778 assert(node->op == op_Store);
1779 node->attr.store.volatility = volatility;
1783 get_Store_align(const ir_node *node) {
1784 assert(node->op == op_Store);
1785 return node->attr.store.aligned;
1789 set_Store_align(ir_node *node, ir_align align) {
1790 assert(node->op == op_Store);
1791 node->attr.store.aligned = align;
1796 get_Alloc_mem(const ir_node *node) {
1797 assert(node->op == op_Alloc);
1798 return get_irn_n(node, 0);
1802 set_Alloc_mem(ir_node *node, ir_node *mem) {
1803 assert(node->op == op_Alloc);
1804 set_irn_n(node, 0, mem);
1808 get_Alloc_size(const ir_node *node) {
1809 assert(node->op == op_Alloc);
1810 return get_irn_n(node, 1);
1814 set_Alloc_size(ir_node *node, ir_node *size) {
1815 assert(node->op == op_Alloc);
1816 set_irn_n(node, 1, size);
1820 get_Alloc_type(ir_node *node) {
1821 assert(node->op == op_Alloc);
1822 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1826 set_Alloc_type(ir_node *node, ir_type *tp) {
1827 assert(node->op == op_Alloc);
1828 node->attr.alloc.type = tp;
1832 get_Alloc_where(const ir_node *node) {
1833 assert(node->op == op_Alloc);
1834 return node->attr.alloc.where;
1838 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1839 assert(node->op == op_Alloc);
1840 node->attr.alloc.where = where;
1845 get_Free_mem(const ir_node *node) {
1846 assert(node->op == op_Free);
1847 return get_irn_n(node, 0);
1851 set_Free_mem(ir_node *node, ir_node *mem) {
1852 assert(node->op == op_Free);
1853 set_irn_n(node, 0, mem);
1857 get_Free_ptr(const ir_node *node) {
1858 assert(node->op == op_Free);
1859 return get_irn_n(node, 1);
1863 set_Free_ptr(ir_node *node, ir_node *ptr) {
1864 assert(node->op == op_Free);
1865 set_irn_n(node, 1, ptr);
1869 get_Free_size(const ir_node *node) {
1870 assert(node->op == op_Free);
1871 return get_irn_n(node, 2);
1875 set_Free_size(ir_node *node, ir_node *size) {
1876 assert(node->op == op_Free);
1877 set_irn_n(node, 2, size);
1881 get_Free_type(ir_node *node) {
1882 assert(node->op == op_Free);
1883 return node->attr.free.type = skip_tid(node->attr.free.type);
1887 set_Free_type(ir_node *node, ir_type *tp) {
1888 assert(node->op == op_Free);
1889 node->attr.free.type = tp;
1893 get_Free_where(const ir_node *node) {
1894 assert(node->op == op_Free);
1895 return node->attr.free.where;
1899 set_Free_where(ir_node *node, ir_where_alloc where) {
1900 assert(node->op == op_Free);
1901 node->attr.free.where = where;
1904 ir_node **get_Sync_preds_arr(ir_node *node) {
1905 assert(node->op == op_Sync);
1906 return (ir_node **)&(get_irn_in(node)[1]);
1909 int get_Sync_n_preds(const ir_node *node) {
1910 assert(node->op == op_Sync);
1911 return (get_irn_arity(node));
1915 void set_Sync_n_preds(ir_node *node, int n_preds) {
1916 assert(node->op == op_Sync);
1920 ir_node *get_Sync_pred(const ir_node *node, int pos) {
1921 assert(node->op == op_Sync);
1922 return get_irn_n(node, pos);
1925 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1926 assert(node->op == op_Sync);
1927 set_irn_n(node, pos, pred);
1930 /* Add a new Sync predecessor */
1931 void add_Sync_pred(ir_node *node, ir_node *pred) {
1932 assert(node->op == op_Sync);
1933 add_irn_n(node, pred);
1936 /* Returns the source language type of a Proj node. */
1937 ir_type *get_Proj_type(ir_node *n) {
1938 ir_type *tp = firm_unknown_type;
1939 ir_node *pred = get_Proj_pred(n);
1941 switch (get_irn_opcode(pred)) {
1944 /* Deal with Start / Call here: we need to know the Proj Nr. */
1945 assert(get_irn_mode(pred) == mode_T);
1946 pred_pred = get_Proj_pred(pred);
1947 if (get_irn_op(pred_pred) == op_Start) {
1948 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1949 tp = get_method_param_type(mtp, get_Proj_proj(n));
1950 } else if (get_irn_op(pred_pred) == op_Call) {
1951 ir_type *mtp = get_Call_type(pred_pred);
1952 tp = get_method_res_type(mtp, get_Proj_proj(n));
1955 case iro_Start: break;
1956 case iro_Call: break;
1958 ir_node *a = get_Load_ptr(pred);
1960 tp = get_entity_type(get_Sel_entity(a));
1969 get_Proj_pred(const ir_node *node) {
1970 assert(is_Proj(node));
1971 return get_irn_n(node, 0);
1975 set_Proj_pred(ir_node *node, ir_node *pred) {
1976 assert(is_Proj(node));
1977 set_irn_n(node, 0, pred);
1981 get_Proj_proj(const ir_node *node) {
1982 assert(is_Proj(node));
1983 if (get_irn_opcode(node) == iro_Proj) {
1984 return node->attr.proj;
1986 assert(get_irn_opcode(node) == iro_Filter);
1987 return node->attr.filter.proj;
1992 set_Proj_proj(ir_node *node, long proj) {
1993 assert(node->op == op_Proj);
1994 node->attr.proj = proj;
1998 get_Tuple_preds_arr(ir_node *node) {
1999 assert(node->op == op_Tuple);
2000 return (ir_node **)&(get_irn_in(node)[1]);
2004 get_Tuple_n_preds(const ir_node *node) {
2005 assert(node->op == op_Tuple);
2006 return (get_irn_arity(node));
2011 set_Tuple_n_preds(ir_node *node, int n_preds) {
2012 assert(node->op == op_Tuple);
2017 get_Tuple_pred(const ir_node *node, int pos) {
2018 assert(node->op == op_Tuple);
2019 return get_irn_n(node, pos);
2023 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2024 assert(node->op == op_Tuple);
2025 set_irn_n(node, pos, pred);
2029 get_Id_pred(const ir_node *node) {
2030 assert(node->op == op_Id);
2031 return get_irn_n(node, 0);
2035 set_Id_pred(ir_node *node, ir_node *pred) {
2036 assert(node->op == op_Id);
2037 set_irn_n(node, 0, pred);
2040 ir_node *get_Confirm_value(const ir_node *node) {
2041 assert(node->op == op_Confirm);
2042 return get_irn_n(node, 0);
2045 void set_Confirm_value(ir_node *node, ir_node *value) {
2046 assert(node->op == op_Confirm);
2047 set_irn_n(node, 0, value);
2050 ir_node *get_Confirm_bound(const ir_node *node) {
2051 assert(node->op == op_Confirm);
2052 return get_irn_n(node, 1);
2055 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2056 assert(node->op == op_Confirm);
2057 set_irn_n(node, 0, bound);
2060 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2061 assert(node->op == op_Confirm);
2062 return node->attr.confirm.cmp;
2065 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2066 assert(node->op == op_Confirm);
2067 node->attr.confirm.cmp = cmp;
2071 get_Filter_pred(ir_node *node) {
2072 assert(node->op == op_Filter);
2077 set_Filter_pred(ir_node *node, ir_node *pred) {
2078 assert(node->op == op_Filter);
2083 get_Filter_proj(ir_node *node) {
2084 assert(node->op == op_Filter);
2085 return node->attr.filter.proj;
2089 set_Filter_proj(ir_node *node, long proj) {
2090 assert(node->op == op_Filter);
2091 node->attr.filter.proj = proj;
2094 /* Don't use get_irn_arity, get_irn_n in implementation as access
2095 shall work independent of view!!! */
2096 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2097 assert(node->op == op_Filter);
2098 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2099 ir_graph *irg = get_irn_irg(node);
2100 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2101 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2102 node->attr.filter.in_cg[0] = node->in[0];
2104 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2107 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2108 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2109 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2110 node->attr.filter.in_cg[pos + 1] = pred;
2113 int get_Filter_n_cg_preds(ir_node *node) {
2114 assert(node->op == op_Filter && node->attr.filter.in_cg);
2115 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2118 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2120 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2122 arity = ARR_LEN(node->attr.filter.in_cg);
2123 assert(pos < arity - 1);
2124 return node->attr.filter.in_cg[pos + 1];
2128 ir_node *get_Mux_sel(const ir_node *node) {
2129 if (node->op == op_Psi) {
2130 assert(get_irn_arity(node) == 3);
2131 return get_Psi_cond(node, 0);
2133 assert(node->op == op_Mux);
2137 void set_Mux_sel(ir_node *node, ir_node *sel) {
2138 if (node->op == op_Psi) {
2139 assert(get_irn_arity(node) == 3);
2140 set_Psi_cond(node, 0, sel);
2142 assert(node->op == op_Mux);
2147 ir_node *get_Mux_false(const ir_node *node) {
2148 if (node->op == op_Psi) {
2149 assert(get_irn_arity(node) == 3);
2150 return get_Psi_default(node);
2152 assert(node->op == op_Mux);
2156 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2157 if (node->op == op_Psi) {
2158 assert(get_irn_arity(node) == 3);
2159 set_Psi_default(node, ir_false);
2161 assert(node->op == op_Mux);
2162 node->in[2] = ir_false;
2166 ir_node *get_Mux_true(const ir_node *node) {
2167 if (node->op == op_Psi) {
2168 assert(get_irn_arity(node) == 3);
2169 return get_Psi_val(node, 0);
2171 assert(node->op == op_Mux);
2175 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2176 if (node->op == op_Psi) {
2177 assert(get_irn_arity(node) == 3);
2178 set_Psi_val(node, 0, ir_true);
2180 assert(node->op == op_Mux);
2181 node->in[3] = ir_true;
2186 ir_node *get_Psi_cond(const ir_node *node, int pos) {
2187 assert(node->op == op_Psi);
2188 assert(pos < get_Psi_n_conds(node));
2189 return get_irn_n(node, 2 * pos);
2192 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2193 assert(node->op == op_Psi);
2194 assert(pos < get_Psi_n_conds(node));
2195 set_irn_n(node, 2 * pos, cond);
2198 ir_node *get_Psi_val(const ir_node *node, int pos) {
2199 assert(node->op == op_Psi);
2200 assert(pos < get_Psi_n_conds(node));
2201 return get_irn_n(node, 2 * pos + 1);
2204 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2205 assert(node->op == op_Psi);
2206 assert(pos < get_Psi_n_conds(node));
2207 set_irn_n(node, 2 * pos + 1, val);
2210 ir_node *get_Psi_default(const ir_node *node) {
2211 int def_pos = get_irn_arity(node) - 1;
2212 assert(node->op == op_Psi);
2213 return get_irn_n(node, def_pos);
2216 void set_Psi_default(ir_node *node, ir_node *val) {
2217 int def_pos = get_irn_arity(node);
2218 assert(node->op == op_Psi);
2219 set_irn_n(node, def_pos, val);
2222 int (get_Psi_n_conds)(const ir_node *node) {
2223 return _get_Psi_n_conds(node);
2227 ir_node *get_CopyB_mem(const ir_node *node) {
2228 assert(node->op == op_CopyB);
2229 return get_irn_n(node, 0);
2232 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2233 assert(node->op == op_CopyB);
2234 set_irn_n(node, 0, mem);
2237 ir_node *get_CopyB_dst(const ir_node *node) {
2238 assert(node->op == op_CopyB);
2239 return get_irn_n(node, 1);
2242 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2243 assert(node->op == op_CopyB);
2244 set_irn_n(node, 1, dst);
2247 ir_node *get_CopyB_src(const ir_node *node) {
2248 assert(node->op == op_CopyB);
2249 return get_irn_n(node, 2);
2252 void set_CopyB_src(ir_node *node, ir_node *src) {
2253 assert(node->op == op_CopyB);
2254 set_irn_n(node, 2, src);
2257 ir_type *get_CopyB_type(ir_node *node) {
2258 assert(node->op == op_CopyB);
2259 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2262 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2263 assert(node->op == op_CopyB && data_type);
2264 node->attr.copyb.data_type = data_type;
2269 get_InstOf_type(ir_node *node) {
2270 assert(node->op == op_InstOf);
2271 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2275 set_InstOf_type(ir_node *node, ir_type *type) {
2276 assert(node->op == op_InstOf);
2277 node->attr.instof.type = type;
2281 get_InstOf_store(const ir_node *node) {
2282 assert(node->op == op_InstOf);
2283 return get_irn_n(node, 0);
2287 set_InstOf_store(ir_node *node, ir_node *obj) {
2288 assert(node->op == op_InstOf);
2289 set_irn_n(node, 0, obj);
2293 get_InstOf_obj(const ir_node *node) {
2294 assert(node->op == op_InstOf);
2295 return get_irn_n(node, 1);
2299 set_InstOf_obj(ir_node *node, ir_node *obj) {
2300 assert(node->op == op_InstOf);
2301 set_irn_n(node, 1, obj);
2304 /* Returns the memory input of a Raise operation. */
2306 get_Raise_mem(const ir_node *node) {
2307 assert(node->op == op_Raise);
2308 return get_irn_n(node, 0);
2312 set_Raise_mem(ir_node *node, ir_node *mem) {
2313 assert(node->op == op_Raise);
2314 set_irn_n(node, 0, mem);
2318 get_Raise_exo_ptr(const ir_node *node) {
2319 assert(node->op == op_Raise);
2320 return get_irn_n(node, 1);
2324 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2325 assert(node->op == op_Raise);
2326 set_irn_n(node, 1, exo_ptr);
2331 /* Returns the memory input of a Bound operation. */
2332 ir_node *get_Bound_mem(const ir_node *bound) {
2333 assert(bound->op == op_Bound);
2334 return get_irn_n(bound, 0);
2337 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2338 assert(bound->op == op_Bound);
2339 set_irn_n(bound, 0, mem);
2342 /* Returns the index input of a Bound operation. */
2343 ir_node *get_Bound_index(const ir_node *bound) {
2344 assert(bound->op == op_Bound);
2345 return get_irn_n(bound, 1);
2348 void set_Bound_index(ir_node *bound, ir_node *idx) {
2349 assert(bound->op == op_Bound);
2350 set_irn_n(bound, 1, idx);
2353 /* Returns the lower bound input of a Bound operation. */
2354 ir_node *get_Bound_lower(const ir_node *bound) {
2355 assert(bound->op == op_Bound);
2356 return get_irn_n(bound, 2);
2359 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2360 assert(bound->op == op_Bound);
2361 set_irn_n(bound, 2, lower);
2364 /* Returns the upper bound input of a Bound operation. */
2365 ir_node *get_Bound_upper(const ir_node *bound) {
2366 assert(bound->op == op_Bound);
2367 return get_irn_n(bound, 3);
2370 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2371 assert(bound->op == op_Bound);
2372 set_irn_n(bound, 3, upper);
2375 /* Return the operand of a Pin node. */
2376 ir_node *get_Pin_op(const ir_node *pin) {
2377 assert(pin->op == op_Pin);
2378 return get_irn_n(pin, 0);
2381 void set_Pin_op(ir_node *pin, ir_node *node) {
2382 assert(pin->op == op_Pin);
2383 set_irn_n(pin, 0, node);
2386 /* Return the assembler text of an ASM pseudo node. */
2387 ident *get_ASM_text(const ir_node *node) {
2388 assert(node->op == op_ASM);
2389 return node->attr.assem.asm_text;
2392 /* Return the number of input constraints for an ASM node. */
2393 int get_ASM_n_input_constraints(const ir_node *node) {
2394 assert(node->op == op_ASM);
2395 return ARR_LEN(node->attr.assem.inputs);
2398 /* Return the input constraints for an ASM node. This is a flexible array. */
2399 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2400 assert(node->op == op_ASM);
2401 return node->attr.assem.inputs;
2404 /* Return the number of output constraints for an ASM node. */
2405 int get_ASM_n_output_constraints(const ir_node *node) {
2406 assert(node->op == op_ASM);
2407 return ARR_LEN(node->attr.assem.outputs);
2410 /* Return the output constraints for an ASM node. */
2411 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2412 assert(node->op == op_ASM);
2413 return node->attr.assem.outputs;
2416 /* Return the number of clobbered registers for an ASM node. */
2417 int get_ASM_n_clobbers(const ir_node *node) {
2418 assert(node->op == op_ASM);
2419 return ARR_LEN(node->attr.assem.clobber);
2422 /* Return the list of clobbered registers for an ASM node. */
2423 ident **get_ASM_clobbers(const ir_node *node) {
2424 assert(node->op == op_ASM);
2425 return node->attr.assem.clobber;
2428 /* returns the graph of a node */
2430 get_irn_irg(const ir_node *node) {
2432 * Do not use get_nodes_Block() here, because this
2433 * will check the pinned state.
2434 * However even a 'wrong' block is always in the proper
2437 if (! is_Block(node))
2438 node = get_irn_n(node, -1);
2439 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2440 node = get_irn_n(node, -1);
2441 assert(get_irn_op(node) == op_Block);
2442 return node->attr.block.irg;
2446 /*----------------------------------------------------------------*/
2447 /* Auxiliary routines */
2448 /*----------------------------------------------------------------*/
2451 skip_Proj(ir_node *node) {
2452 /* don't assert node !!! */
2457 node = get_Proj_pred(node);
2463 skip_Proj_const(const ir_node *node) {
2464 /* don't assert node !!! */
2469 node = get_Proj_pred(node);
2475 skip_Tuple(ir_node *node) {
2479 if (!get_opt_normalize()) return node;
2482 if (get_irn_op(node) == op_Proj) {
2483 pred = get_Proj_pred(node);
2484 op = get_irn_op(pred);
2487 * Looks strange but calls get_irn_op() only once
2488 * in most often cases.
2490 if (op == op_Proj) { /* nested Tuple ? */
2491 pred = skip_Tuple(pred);
2492 op = get_irn_op(pred);
2494 if (op == op_Tuple) {
2495 node = get_Tuple_pred(pred, get_Proj_proj(node));
2498 } else if (op == op_Tuple) {
2499 node = get_Tuple_pred(pred, get_Proj_proj(node));
2506 /* returns operand of node if node is a Cast */
2507 ir_node *skip_Cast(ir_node *node) {
2508 if (get_irn_op(node) == op_Cast)
2509 return get_Cast_op(node);
2513 /* returns operand of node if node is a Confirm */
2514 ir_node *skip_Confirm(ir_node *node) {
2515 if (get_irn_op(node) == op_Confirm)
2516 return get_Confirm_value(node);
2520 /* skip all high-level ops */
2521 ir_node *skip_HighLevel_ops(ir_node *node) {
2522 while (is_op_highlevel(get_irn_op(node))) {
2523 node = get_irn_n(node, 0);
2529 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2530 * than any other approach, as Id chains are resolved and all point to the real node, or
2531 * all id's are self loops.
2533 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2534 * a little bit "hand optimized".
2536 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2539 skip_Id(ir_node *node) {
2541 /* don't assert node !!! */
2543 if (!node || (node->op != op_Id)) return node;
2545 /* Don't use get_Id_pred(): We get into an endless loop for
2546 self-referencing Ids. */
2547 pred = node->in[0+1];
2549 if (pred->op != op_Id) return pred;
2551 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2552 ir_node *rem_pred, *res;
2554 if (pred->op != op_Id) return pred; /* shortcut */
2557 assert(get_irn_arity (node) > 0);
2559 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2560 res = skip_Id(rem_pred);
2561 if (res->op == op_Id) /* self-loop */ return node;
2563 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2570 void skip_Id_and_store(ir_node **node) {
2573 if (!n || (n->op != op_Id)) return;
2575 /* Don't use get_Id_pred(): We get into an endless loop for
2576 self-referencing Ids. */
2581 (is_Bad)(const ir_node *node) {
2582 return _is_Bad(node);
2586 (is_NoMem)(const ir_node *node) {
2587 return _is_NoMem(node);
2591 (is_Minus)(const ir_node *node) {
2592 return _is_Minus(node);
2596 (is_Abs)(const ir_node *node) {
2597 return _is_Abs(node);
2601 (is_Mod)(const ir_node *node) {
2602 return _is_Mod(node);
2606 (is_Div)(const ir_node *node) {
2607 return _is_Div(node);
2611 (is_DivMod)(const ir_node *node) {
2612 return _is_DivMod(node);
2616 (is_Quot)(const ir_node *node) {
2617 return _is_Quot(node);
2621 (is_Add)(const ir_node *node) {
2622 return _is_Add(node);
2626 (is_And)(const ir_node *node) {
2627 return _is_And(node);
2631 (is_Or)(const ir_node *node) {
2632 return _is_Or(node);
2636 (is_Eor)(const ir_node *node) {
2637 return _is_Eor(node);
2641 (is_Sub)(const ir_node *node) {
2642 return _is_Sub(node);
2646 (is_Shl)(const ir_node *node) {
2647 return _is_Shl(node);
2651 (is_Shr)(const ir_node *node) {
2652 return _is_Shr(node);
2656 (is_Shrs)(const ir_node *node) {
2657 return _is_Shrs(node);
2661 (is_Rot)(const ir_node *node) {
2662 return _is_Rot(node);
2666 (is_Not)(const ir_node *node) {
2667 return _is_Not(node);
2671 (is_Psi)(const ir_node *node) {
2672 return _is_Psi(node);
2676 (is_Tuple)(const ir_node *node) {
2677 return _is_Tuple(node);
2681 (is_Bound)(const ir_node *node) {
2682 return _is_Bound(node);
2686 (is_Start)(const ir_node *node) {
2687 return _is_Start(node);
2691 (is_End)(const ir_node *node) {
2692 return _is_End(node);
2696 (is_Const)(const ir_node *node) {
2697 return _is_Const(node);
2701 (is_Conv)(const ir_node *node) {
2702 return _is_Conv(node);
2706 (is_strictConv)(const ir_node *node) {
2707 return _is_strictConv(node);
2711 (is_Cast)(const ir_node *node) {
2712 return _is_Cast(node);
2716 (is_no_Block)(const ir_node *node) {
2717 return _is_no_Block(node);
2721 (is_Block)(const ir_node *node) {
2722 return _is_Block(node);
2725 /* returns true if node is an Unknown node. */
2727 (is_Unknown)(const ir_node *node) {
2728 return _is_Unknown(node);
2731 /* returns true if node is a Return node. */
2733 (is_Return)(const ir_node *node) {
2734 return _is_Return(node);
2737 /* returns true if node is a Call node. */
2739 (is_Call)(const ir_node *node) {
2740 return _is_Call(node);
2743 /* returns true if node is a Sel node. */
2745 (is_Sel)(const ir_node *node) {
2746 return _is_Sel(node);
2749 /* returns true if node is a Mux node or a Psi with only one condition. */
2751 (is_Mux)(const ir_node *node) {
2752 return _is_Mux(node);
2755 /* returns true if node is a Load node. */
2757 (is_Load)(const ir_node *node) {
2758 return _is_Load(node);
2761 /* returns true if node is a Load node. */
2763 (is_Store)(const ir_node *node) {
2764 return _is_Store(node);
2767 /* returns true if node is a Sync node. */
2769 (is_Sync)(const ir_node *node) {
2770 return _is_Sync(node);
2773 /* Returns true if node is a Confirm node. */
2775 (is_Confirm)(const ir_node *node) {
2776 return _is_Confirm(node);
2779 /* Returns true if node is a Pin node. */
2781 (is_Pin)(const ir_node *node) {
2782 return _is_Pin(node);
2785 /* Returns true if node is a SymConst node. */
2787 (is_SymConst)(const ir_node *node) {
2788 return _is_SymConst(node);
2791 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2793 (is_SymConst_addr_ent)(const ir_node *node) {
2794 return _is_SymConst_addr_ent(node);
2797 /* Returns true if node is a Cond node. */
2799 (is_Cond)(const ir_node *node) {
2800 return _is_Cond(node);
2804 (is_CopyB)(const ir_node *node) {
2805 return _is_CopyB(node);
2808 /* returns true if node is a Cmp node. */
2810 (is_Cmp)(const ir_node *node) {
2811 return _is_Cmp(node);
2814 /* returns true if node is an Alloc node. */
2816 (is_Alloc)(const ir_node *node) {
2817 return _is_Alloc(node);
2820 /* returns true if a node is a Jmp node. */
2822 (is_Jmp)(const ir_node *node) {
2823 return _is_Jmp(node);
2826 /* returns true if a node is a Raise node. */
2828 (is_Raise)(const ir_node *node) {
2829 return _is_Raise(node);
2832 /* returns true if a node is an ASM node. */
2834 (is_ASM)(const ir_node *node) {
2835 return _is_ASM(node);
2839 (is_Proj)(const ir_node *node) {
2841 return node->op == op_Proj ||
2842 (!get_interprocedural_view() && node->op == op_Filter);
2845 /* Returns true if the operation manipulates control flow. */
2846 int is_cfop(const ir_node *node) {
2847 return is_op_cfopcode(get_irn_op(node));
2850 /* Returns true if the operation manipulates interprocedural control flow:
2851 CallBegin, EndReg, EndExcept */
2852 int is_ip_cfop(const ir_node *node) {
2853 return is_ip_cfopcode(get_irn_op(node));
2856 /* Returns true if the operation can change the control flow because
2859 is_fragile_op(const ir_node *node) {
2860 return is_op_fragile(get_irn_op(node));
2863 /* Returns the memory operand of fragile operations. */
2864 ir_node *get_fragile_op_mem(ir_node *node) {
2865 assert(node && is_fragile_op(node));
2867 switch (get_irn_opcode(node)) {
2878 return get_irn_n(node, pn_Generic_M_regular);
2883 assert(0 && "should not be reached");
2888 /* Returns the result mode of a Div operation. */
2889 ir_mode *get_divop_resmod(const ir_node *node) {
2890 switch (get_irn_opcode(node)) {
2891 case iro_Quot : return get_Quot_resmode(node);
2892 case iro_DivMod: return get_DivMod_resmode(node);
2893 case iro_Div : return get_Div_resmode(node);
2894 case iro_Mod : return get_Mod_resmode(node);
2896 assert(0 && "should not be reached");
2901 /* Returns true if the operation is a forking control flow operation. */
2902 int (is_irn_forking)(const ir_node *node) {
2903 return _is_irn_forking(node);
2906 /* Return the type associated with the value produced by n
2907 * if the node remarks this type as it is the case for
2908 * Cast, Const, SymConst and some Proj nodes. */
2909 ir_type *(get_irn_type)(ir_node *node) {
2910 return _get_irn_type(node);
2913 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2915 ir_type *(get_irn_type_attr)(ir_node *node) {
2916 return _get_irn_type_attr(node);
2919 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2920 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2921 return _get_irn_entity_attr(node);
2924 /* Returns non-zero for constant-like nodes. */
2925 int (is_irn_constlike)(const ir_node *node) {
2926 return _is_irn_constlike(node);
2930 * Returns non-zero for nodes that are allowed to have keep-alives and
2931 * are neither Block nor PhiM.
2933 int (is_irn_keep)(const ir_node *node) {
2934 return _is_irn_keep(node);
2938 * Returns non-zero for nodes that are always placed in the start block.
2940 int (is_irn_start_block_placed)(const ir_node *node) {
2941 return _is_irn_start_block_placed(node);
2944 /* Returns non-zero for nodes that are machine operations. */
2945 int (is_irn_machine_op)(const ir_node *node) {
2946 return _is_irn_machine_op(node);
2949 /* Returns non-zero for nodes that are machine operands. */
2950 int (is_irn_machine_operand)(const ir_node *node) {
2951 return _is_irn_machine_operand(node);
2954 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2955 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2956 return _is_irn_machine_user(node, n);
2960 /* Gets the string representation of the jump prediction .*/
2961 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2964 case COND_JMP_PRED_NONE: return "no prediction";
2965 case COND_JMP_PRED_TRUE: return "true taken";
2966 case COND_JMP_PRED_FALSE: return "false taken";
2970 /* Returns the conditional jump prediction of a Cond node. */
2971 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2972 return _get_Cond_jmp_pred(cond);
2975 /* Sets a new conditional jump prediction. */
2976 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2977 _set_Cond_jmp_pred(cond, pred);
2980 /** the get_type operation must be always implemented and return a firm type */
2981 static ir_type *get_Default_type(ir_node *n) {
2983 return get_unknown_type();
2986 /* Sets the get_type operation for an ir_op_ops. */
2987 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
2989 case iro_Const: ops->get_type = get_Const_type; break;
2990 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
2991 case iro_Cast: ops->get_type = get_Cast_type; break;
2992 case iro_Proj: ops->get_type = get_Proj_type; break;
2994 /* not allowed to be NULL */
2995 if (! ops->get_type)
2996 ops->get_type = get_Default_type;
3002 /** Return the attribute type of a SymConst node if exists */
3003 static ir_type *get_SymConst_attr_type(ir_node *self) {
3004 symconst_kind kind = get_SymConst_kind(self);
3005 if (SYMCONST_HAS_TYPE(kind))
3006 return get_SymConst_type(self);
3010 /** Return the attribute entity of a SymConst node if exists */
3011 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3012 symconst_kind kind = get_SymConst_kind(self);
3013 if (SYMCONST_HAS_ENT(kind))
3014 return get_SymConst_entity(self);
3018 /** the get_type_attr operation must be always implemented */
3019 static ir_type *get_Null_type(ir_node *n) {
3021 return firm_unknown_type;
3024 /* Sets the get_type operation for an ir_op_ops. */
3025 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3027 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3028 case iro_Call: ops->get_type_attr = get_Call_type; break;
3029 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3030 case iro_Free: ops->get_type_attr = get_Free_type; break;
3031 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3033 /* not allowed to be NULL */
3034 if (! ops->get_type_attr)
3035 ops->get_type_attr = get_Null_type;
3041 /** the get_entity_attr operation must be always implemented */
3042 static ir_entity *get_Null_ent(ir_node *n) {
3047 /* Sets the get_type operation for an ir_op_ops. */
3048 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3050 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3051 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3053 /* not allowed to be NULL */
3054 if (! ops->get_entity_attr)
3055 ops->get_entity_attr = get_Null_ent;
3061 /* Sets the debug information of a node. */
3062 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3063 _set_irn_dbg_info(n, db);
3067 * Returns the debug information of an node.
3069 * @param n The node.
3071 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3072 return _get_irn_dbg_info(n);
3075 #if 0 /* allow the global pointer */
3077 /* checks whether a node represents a global address */
3078 int is_Global(const ir_node *node) {
3081 if (is_SymConst_addr_ent(node))
3086 ptr = get_Sel_ptr(node);
3087 return is_globals_pointer(ptr) != NULL;
3090 /* returns the entity of a global address */
3091 ir_entity *get_Global_entity(const ir_node *node) {
3092 if (is_SymConst(node))
3093 return get_SymConst_entity(node);
3095 return get_Sel_entity(node);
3099 /* checks whether a node represents a global address */
3100 int is_Global(const ir_node *node) {
3101 return is_SymConst_addr_ent(node);
3104 /* returns the entity of a global address */
3105 ir_entity *get_Global_entity(const ir_node *node) {
3106 return get_SymConst_entity(node);
3110 #ifdef DEBUG_libfirm
3111 void dump_irn(const ir_node *n) {
3112 int i, arity = get_irn_arity(n);
3113 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
3115 ir_node *pred = get_irn_n(n, -1);
3116 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3117 get_irn_node_nr(pred), (void *)pred);
3119 printf(" preds: \n");
3120 for (i = 0; i < arity; ++i) {
3121 ir_node *pred = get_irn_n(n, i);
3122 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3123 get_irn_node_nr(pred), (void *)pred);
3127 #else /* DEBUG_libfirm */
3128 void dump_irn(const ir_node *n) { (void) n; }
3129 #endif /* DEBUG_libfirm */