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 must always have a flexible array */
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 globals pointer, i.e. Proj(pn_Start_P_globals)
653 * from Start. If so returns global type, else Null. */
654 ir_type *is_globals_pointer(const ir_node *n) {
655 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
656 ir_node *start = get_Proj_pred(n);
657 if (is_Start(start)) {
658 return get_glob_type();
664 /* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
665 * from Start. If so returns tls type, else Null. */
666 ir_type *is_tls_pointer(const ir_node *n) {
667 if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
668 ir_node *start = get_Proj_pred(n);
669 if (is_Start(start)) {
670 return get_tls_type();
676 /* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
677 * from Start. If so returns 1, else 0. */
678 int is_value_arg_pointer(const ir_node *n) {
680 (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
681 is_Start(get_Proj_pred(n)))
686 /* Returns an array with the predecessors of the Block. Depending on
687 the implementation of the graph data structure this can be a copy of
688 the internal representation of predecessors as well as the internal
689 array itself. Therefore writing to this array might obstruct the ir. */
690 ir_node **get_Block_cfgpred_arr(ir_node *node) {
691 assert((node->op == op_Block));
692 return (ir_node **)&(get_irn_in(node)[1]);
695 int (get_Block_n_cfgpreds)(const ir_node *node) {
696 return _get_Block_n_cfgpreds(node);
699 ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) {
700 return _get_Block_cfgpred(node, pos);
703 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
704 assert(node->op == op_Block);
705 set_irn_n(node, pos, pred);
708 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
709 return _get_Block_cfgpred_block(node, pos);
712 int get_Block_matured(const ir_node *node) {
713 assert(node->op == op_Block);
714 return (int)node->attr.block.is_matured;
717 void set_Block_matured(ir_node *node, int matured) {
718 assert(node->op == op_Block);
719 node->attr.block.is_matured = matured;
722 unsigned long (get_Block_block_visited)(const ir_node *node) {
723 return _get_Block_block_visited(node);
726 void (set_Block_block_visited)(ir_node *node, unsigned long visit) {
727 _set_Block_block_visited(node, visit);
730 /* For this current_ir_graph must be set. */
731 void (mark_Block_block_visited)(ir_node *node) {
732 _mark_Block_block_visited(node);
735 int (Block_not_block_visited)(const ir_node *node) {
736 return _Block_not_block_visited(node);
739 int (Block_block_visited)(const ir_node *node) {
740 return _Block_block_visited(node);
743 ir_node *get_Block_graph_arr(ir_node *node, int pos) {
744 assert(node->op == op_Block);
745 return node->attr.block.graph_arr[pos+1];
748 void set_Block_graph_arr(ir_node *node, int pos, ir_node *value) {
749 assert(node->op == op_Block);
750 node->attr.block.graph_arr[pos+1] = value;
753 #ifdef INTERPROCEDURAL_VIEW
754 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) {
755 assert(node->op == op_Block);
756 if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
757 node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
758 node->attr.block.in_cg[0] = NULL;
759 node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
761 /* Fix backedge array. fix_backedges() operates depending on
762 interprocedural_view. */
763 int ipv = get_interprocedural_view();
764 set_interprocedural_view(1);
765 fix_backedges(current_ir_graph->obst, node);
766 set_interprocedural_view(ipv);
769 memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
772 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) {
773 assert(node->op == op_Block &&
774 node->attr.block.in_cg &&
775 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
776 node->attr.block.in_cg[pos + 1] = pred;
779 ir_node **get_Block_cg_cfgpred_arr(ir_node *node) {
780 assert(node->op == op_Block);
781 return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
784 int get_Block_cg_n_cfgpreds(const ir_node *node) {
785 assert(node->op == op_Block);
786 return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
789 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos) {
790 assert(node->op == op_Block && node->attr.block.in_cg);
791 return node->attr.block.in_cg[pos + 1];
794 void remove_Block_cg_cfgpred_arr(ir_node *node) {
795 assert(node->op == op_Block);
796 node->attr.block.in_cg = NULL;
800 ir_node *(set_Block_dead)(ir_node *block) {
801 return _set_Block_dead(block);
804 int (is_Block_dead)(const ir_node *block) {
805 return _is_Block_dead(block);
808 ir_extblk *get_Block_extbb(const ir_node *block) {
810 assert(is_Block(block));
811 res = block->attr.block.extblk;
812 assert(res == NULL || is_ir_extbb(res));
816 void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
817 assert(is_Block(block));
818 assert(extblk == NULL || is_ir_extbb(extblk));
819 block->attr.block.extblk = extblk;
822 /* Returns the macro block header of a block.*/
823 ir_node *get_Block_MacroBlock(const ir_node *block) {
825 assert(is_Block(block));
826 mbh = get_irn_n(block, -1);
827 /* once macro block header is respected by all optimizations,
828 this assert can be removed */
833 /* Sets the macro block header of a block. */
834 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
835 assert(is_Block(block));
836 assert(is_Block(mbh));
837 set_irn_n(block, -1, mbh);
840 /* returns the macro block header of a node. */
841 ir_node *get_irn_MacroBlock(const ir_node *n) {
843 n = get_nodes_block(n);
844 /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
848 return get_Block_MacroBlock(n);
851 /* returns the graph of a Block. */
852 ir_graph *get_Block_irg(const ir_node *block) {
853 assert(is_Block(block));
854 return block->attr.block.irg;
857 int has_Block_label(const ir_node *block) {
858 assert(is_Block(block));
859 return block->attr.block.has_label;
862 ir_label_t get_Block_label(const ir_node *block) {
863 assert(is_Block(block));
864 return block->attr.block.label;
867 void set_Block_label(ir_node *block, ir_label_t label) {
868 assert(is_Block(block));
869 block->attr.block.has_label = 1;
870 block->attr.block.label = label;
873 ir_node *(get_Block_phis)(const ir_node *block) {
874 return _get_Block_phis(block);
877 void (set_Block_phis)(ir_node *block, ir_node *phi) {
878 _set_Block_phis(block, phi);
881 int get_End_n_keepalives(const ir_node *end) {
882 assert(end->op == op_End);
883 return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
886 ir_node *get_End_keepalive(const ir_node *end, int pos) {
887 assert(end->op == op_End);
888 return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
891 void add_End_keepalive(ir_node *end, ir_node *ka) {
892 assert(end->op == op_End);
893 assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
897 void set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
898 assert(end->op == op_End);
899 set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
902 /* Set new keep-alives */
903 void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
905 ir_graph *irg = get_irn_irg(end);
907 /* notify that edges are deleted */
908 for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
909 edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
911 ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
913 for (i = 0; i < n; ++i) {
914 end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
915 edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
919 /* Set new keep-alives from old keep-alives, skipping irn */
920 void remove_End_keepalive(ir_node *end, ir_node *irn) {
921 int n = get_End_n_keepalives(end);
925 NEW_ARR_A(ir_node *, in, n);
927 for (idx = i = 0; i < n; ++i) {
928 ir_node *old_ka = get_End_keepalive(end, i);
935 /* set new keep-alives */
936 set_End_keepalives(end, idx, in);
940 free_End(ir_node *end) {
941 assert(end->op == op_End);
944 end->in = NULL; /* @@@ make sure we get an error if we use the
945 in array afterwards ... */
948 /* Return the target address of an IJmp */
949 ir_node *get_IJmp_target(const ir_node *ijmp) {
950 assert(ijmp->op == op_IJmp);
951 return get_irn_n(ijmp, 0);
954 /** Sets the target address of an IJmp */
955 void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
956 assert(ijmp->op == op_IJmp);
957 set_irn_n(ijmp, 0, tgt);
961 > Implementing the case construct (which is where the constant Proj node is
962 > important) involves far more than simply determining the constant values.
963 > We could argue that this is more properly a function of the translator from
964 > Firm to the target machine. That could be done if there was some way of
965 > projecting "default" out of the Cond node.
966 I know it's complicated.
967 Basically there are two problems:
968 - determining the gaps between the Projs
969 - determining the biggest case constant to know the proj number for
971 I see several solutions:
972 1. Introduce a ProjDefault node. Solves both problems.
973 This means to extend all optimizations executed during construction.
974 2. Give the Cond node for switch two flavors:
975 a) there are no gaps in the Projs (existing flavor)
976 b) gaps may exist, default proj is still the Proj with the largest
977 projection number. This covers also the gaps.
978 3. Fix the semantic of the Cond to that of 2b)
980 Solution 2 seems to be the best:
981 Computing the gaps in the Firm representation is not too hard, i.e.,
982 libFIRM can implement a routine that transforms between the two
983 flavours. This is also possible for 1) but 2) does not require to
984 change any existing optimization.
985 Further it should be far simpler to determine the biggest constant than
987 I don't want to choose 3) as 2a) seems to have advantages for
988 dataflow analysis and 3) does not allow to convert the representation to
992 get_Cond_selector(const ir_node *node) {
993 assert(node->op == op_Cond);
994 return get_irn_n(node, 0);
998 set_Cond_selector(ir_node *node, ir_node *selector) {
999 assert(node->op == op_Cond);
1000 set_irn_n(node, 0, selector);
1004 get_Cond_kind(const ir_node *node) {
1005 assert(node->op == op_Cond);
1006 return node->attr.cond.kind;
1010 set_Cond_kind(ir_node *node, cond_kind kind) {
1011 assert(node->op == op_Cond);
1012 node->attr.cond.kind = kind;
1016 get_Cond_defaultProj(const ir_node *node) {
1017 assert(node->op == op_Cond);
1018 return node->attr.cond.default_proj;
1022 get_Return_mem(const ir_node *node) {
1023 assert(node->op == op_Return);
1024 return get_irn_n(node, 0);
1028 set_Return_mem(ir_node *node, ir_node *mem) {
1029 assert(node->op == op_Return);
1030 set_irn_n(node, 0, mem);
1034 get_Return_n_ress(const ir_node *node) {
1035 assert(node->op == op_Return);
1036 return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
1040 get_Return_res_arr(ir_node *node) {
1041 assert((node->op == op_Return));
1042 if (get_Return_n_ress(node) > 0)
1043 return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
1050 set_Return_n_res(ir_node *node, int results) {
1051 assert(node->op == op_Return);
1056 get_Return_res(const ir_node *node, int pos) {
1057 assert(node->op == op_Return);
1058 assert(get_Return_n_ress(node) > pos);
1059 return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
1063 set_Return_res(ir_node *node, int pos, ir_node *res){
1064 assert(node->op == op_Return);
1065 set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
1068 tarval *(get_Const_tarval)(const ir_node *node) {
1069 return _get_Const_tarval(node);
1073 set_Const_tarval(ir_node *node, tarval *con) {
1074 assert(node->op == op_Const);
1075 node->attr.con.tv = con;
1078 int (is_Const_null)(const ir_node *node) {
1079 return _is_Const_null(node);
1082 int (is_Const_one)(const ir_node *node) {
1083 return _is_Const_one(node);
1086 int (is_Const_all_one)(const ir_node *node) {
1087 return _is_Const_all_one(node);
1091 /* The source language type. Must be an atomic type. Mode of type must
1092 be mode of node. For tarvals from entities type must be pointer to
1095 get_Const_type(ir_node *node) {
1096 assert(node->op == op_Const);
1097 node->attr.con.tp = skip_tid(node->attr.con.tp);
1098 return node->attr.con.tp;
1102 set_Const_type(ir_node *node, ir_type *tp) {
1103 assert(node->op == op_Const);
1104 if (tp != firm_unknown_type) {
1105 assert(is_atomic_type(tp));
1106 assert(get_type_mode(tp) == get_irn_mode(node));
1108 node->attr.con.tp = tp;
1113 get_SymConst_kind(const ir_node *node) {
1114 assert(node->op == op_SymConst);
1115 return node->attr.symc.num;
1119 set_SymConst_kind(ir_node *node, symconst_kind num) {
1120 assert(node->op == op_SymConst);
1121 node->attr.symc.num = num;
1125 get_SymConst_type(ir_node *node) {
1126 assert((node->op == op_SymConst) &&
1127 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1128 return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
1132 set_SymConst_type(ir_node *node, ir_type *tp) {
1133 assert((node->op == op_SymConst) &&
1134 (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
1135 node->attr.symc.sym.type_p = tp;
1139 get_SymConst_name(const ir_node *node) {
1140 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1141 return node->attr.symc.sym.ident_p;
1145 set_SymConst_name(ir_node *node, ident *name) {
1146 assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node)));
1147 node->attr.symc.sym.ident_p = name;
1151 /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
1152 ir_entity *get_SymConst_entity(const ir_node *node) {
1153 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1154 return node->attr.symc.sym.entity_p;
1157 void set_SymConst_entity(ir_node *node, ir_entity *ent) {
1158 assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
1159 node->attr.symc.sym.entity_p = ent;
1162 ir_enum_const *get_SymConst_enum(const ir_node *node) {
1163 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1164 return node->attr.symc.sym.enum_p;
1167 void set_SymConst_enum(ir_node *node, ir_enum_const *ec) {
1168 assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
1169 node->attr.symc.sym.enum_p = ec;
1172 union symconst_symbol
1173 get_SymConst_symbol(const ir_node *node) {
1174 assert(node->op == op_SymConst);
1175 return node->attr.symc.sym;
1179 set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
1180 assert(node->op == op_SymConst);
1181 node->attr.symc.sym = sym;
1184 ir_label_t get_SymConst_label(const ir_node *node) {
1185 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1186 return node->attr.symc.sym.label;
1189 void set_SymConst_label(ir_node *node, ir_label_t label) {
1190 assert(node->op == op_SymConst && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
1191 node->attr.symc.sym.label = label;
1195 get_SymConst_value_type(ir_node *node) {
1196 assert(node->op == op_SymConst);
1197 if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
1198 return node->attr.symc.tp;
1202 set_SymConst_value_type(ir_node *node, ir_type *tp) {
1203 assert(node->op == op_SymConst);
1204 node->attr.symc.tp = tp;
1208 get_Sel_mem(const ir_node *node) {
1209 assert(node->op == op_Sel);
1210 return get_irn_n(node, 0);
1214 set_Sel_mem(ir_node *node, ir_node *mem) {
1215 assert(node->op == op_Sel);
1216 set_irn_n(node, 0, mem);
1220 get_Sel_ptr(const ir_node *node) {
1221 assert(node->op == op_Sel);
1222 return get_irn_n(node, 1);
1226 set_Sel_ptr(ir_node *node, ir_node *ptr) {
1227 assert(node->op == op_Sel);
1228 set_irn_n(node, 1, ptr);
1232 get_Sel_n_indexs(const ir_node *node) {
1233 assert(node->op == op_Sel);
1234 return (get_irn_arity(node) - SEL_INDEX_OFFSET);
1238 get_Sel_index_arr(ir_node *node) {
1239 assert((node->op == op_Sel));
1240 if (get_Sel_n_indexs(node) > 0)
1241 return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
1247 get_Sel_index(const ir_node *node, int pos) {
1248 assert(node->op == op_Sel);
1249 return get_irn_n(node, pos + SEL_INDEX_OFFSET);
1253 set_Sel_index(ir_node *node, int pos, ir_node *index) {
1254 assert(node->op == op_Sel);
1255 set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
1259 get_Sel_entity(const ir_node *node) {
1260 assert(node->op == op_Sel);
1261 return node->attr.sel.ent;
1264 ir_entity *_get_Sel_entity(ir_node *node) {
1265 return get_Sel_entity(node);
1269 set_Sel_entity(ir_node *node, ir_entity *ent) {
1270 assert(node->op == op_Sel);
1271 node->attr.sel.ent = ent;
1275 /* For unary and binary arithmetic operations the access to the
1276 operands can be factored out. Left is the first, right the
1277 second arithmetic value as listed in tech report 0999-33.
1278 unops are: Minus, Abs, Not, Conv, Cast
1279 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
1280 Shr, Shrs, Rotate, Cmp */
1284 get_Call_mem(const ir_node *node) {
1285 assert(node->op == op_Call);
1286 return get_irn_n(node, 0);
1290 set_Call_mem(ir_node *node, ir_node *mem) {
1291 assert(node->op == op_Call);
1292 set_irn_n(node, 0, mem);
1296 get_Call_ptr(const ir_node *node) {
1297 assert(node->op == op_Call);
1298 return get_irn_n(node, 1);
1302 set_Call_ptr(ir_node *node, ir_node *ptr) {
1303 assert(node->op == op_Call);
1304 set_irn_n(node, 1, ptr);
1308 get_Call_param_arr(ir_node *node) {
1309 assert(node->op == op_Call);
1310 return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
1314 get_Call_n_params(const ir_node *node) {
1315 assert(node->op == op_Call);
1316 return (get_irn_arity(node) - CALL_PARAM_OFFSET);
1320 get_Call_arity(const ir_node *node) {
1321 assert(node->op == op_Call);
1322 return get_Call_n_params(node);
1326 set_Call_arity(ir_node *node, ir_node *arity) {
1327 assert(node->op == op_Call);
1332 get_Call_param(const ir_node *node, int pos) {
1333 assert(node->op == op_Call);
1334 return get_irn_n(node, pos + CALL_PARAM_OFFSET);
1338 set_Call_param(ir_node *node, int pos, ir_node *param) {
1339 assert(node->op == op_Call);
1340 set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
1344 get_Call_type(ir_node *node) {
1345 assert(node->op == op_Call);
1346 return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
1350 set_Call_type(ir_node *node, ir_type *tp) {
1351 assert(node->op == op_Call);
1352 assert((get_unknown_type() == tp) || is_Method_type(tp));
1353 node->attr.call.cld_tp = tp;
1356 int Call_has_callees(const ir_node *node) {
1357 assert(node && node->op == op_Call);
1358 return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
1359 (node->attr.call.callee_arr != NULL));
1362 int get_Call_n_callees(const ir_node *node) {
1363 assert(node && node->op == op_Call && node->attr.call.callee_arr);
1364 return ARR_LEN(node->attr.call.callee_arr);
1367 ir_entity *get_Call_callee(const ir_node *node, int pos) {
1368 assert(pos >= 0 && pos < get_Call_n_callees(node));
1369 return node->attr.call.callee_arr[pos];
1372 void set_Call_callee_arr(ir_node *node, const int n, ir_entity ** arr) {
1373 assert(node->op == op_Call);
1374 if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
1375 node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n);
1377 memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *));
1380 void remove_Call_callee_arr(ir_node *node) {
1381 assert(node->op == op_Call);
1382 node->attr.call.callee_arr = NULL;
1385 ir_node *get_CallBegin_ptr(const ir_node *node) {
1386 assert(node->op == op_CallBegin);
1387 return get_irn_n(node, 0);
1390 void set_CallBegin_ptr(ir_node *node, ir_node *ptr) {
1391 assert(node->op == op_CallBegin);
1392 set_irn_n(node, 0, ptr);
1395 ir_node *get_CallBegin_call(const ir_node *node) {
1396 assert(node->op == op_CallBegin);
1397 return node->attr.callbegin.call;
1400 void set_CallBegin_call(ir_node *node, ir_node *call) {
1401 assert(node->op == op_CallBegin);
1402 node->attr.callbegin.call = call;
1407 ir_node * get_##OP##_left(const ir_node *node) { \
1408 assert(node->op == op_##OP); \
1409 return get_irn_n(node, node->op->op_index); \
1411 void set_##OP##_left(ir_node *node, ir_node *left) { \
1412 assert(node->op == op_##OP); \
1413 set_irn_n(node, node->op->op_index, left); \
1415 ir_node *get_##OP##_right(const ir_node *node) { \
1416 assert(node->op == op_##OP); \
1417 return get_irn_n(node, node->op->op_index + 1); \
1419 void set_##OP##_right(ir_node *node, ir_node *right) { \
1420 assert(node->op == op_##OP); \
1421 set_irn_n(node, node->op->op_index + 1, right); \
1425 ir_node *get_##OP##_op(const ir_node *node) { \
1426 assert(node->op == op_##OP); \
1427 return get_irn_n(node, node->op->op_index); \
1429 void set_##OP##_op(ir_node *node, ir_node *op) { \
1430 assert(node->op == op_##OP); \
1431 set_irn_n(node, node->op->op_index, op); \
1434 #define BINOP_MEM(OP) \
1438 get_##OP##_mem(const ir_node *node) { \
1439 assert(node->op == op_##OP); \
1440 return get_irn_n(node, 0); \
1444 set_##OP##_mem(ir_node *node, ir_node *mem) { \
1445 assert(node->op == op_##OP); \
1446 set_irn_n(node, 0, mem); \
1452 ir_mode *get_##OP##_resmode(const ir_node *node) { \
1453 assert(node->op == op_##OP); \
1454 return node->attr.divmod.res_mode; \
1457 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
1458 assert(node->op == op_##OP); \
1459 node->attr.divmod.res_mode = mode; \
1485 int is_Div_remainderless(const ir_node *node) {
1486 assert(node->op == op_Div);
1487 return node->attr.divmod.no_remainder;
1490 int get_Conv_strict(const ir_node *node) {
1491 assert(node->op == op_Conv);
1492 return node->attr.conv.strict;
1495 void set_Conv_strict(ir_node *node, int strict_flag) {
1496 assert(node->op == op_Conv);
1497 node->attr.conv.strict = (char)strict_flag;
1501 get_Cast_type(ir_node *node) {
1502 assert(node->op == op_Cast);
1503 node->attr.cast.totype = skip_tid(node->attr.cast.totype);
1504 return node->attr.cast.totype;
1508 set_Cast_type(ir_node *node, ir_type *to_tp) {
1509 assert(node->op == op_Cast);
1510 node->attr.cast.totype = to_tp;
1514 /* Checks for upcast.
1516 * Returns true if the Cast node casts a class type to a super type.
1518 int is_Cast_upcast(ir_node *node) {
1519 ir_type *totype = get_Cast_type(node);
1520 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1522 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1525 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1526 totype = get_pointer_points_to_type(totype);
1527 fromtype = get_pointer_points_to_type(fromtype);
1532 if (!is_Class_type(totype)) return 0;
1533 return is_SubClass_of(fromtype, totype);
1536 /* Checks for downcast.
1538 * Returns true if the Cast node casts a class type to a sub type.
1540 int is_Cast_downcast(ir_node *node) {
1541 ir_type *totype = get_Cast_type(node);
1542 ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node));
1544 assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent);
1547 while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
1548 totype = get_pointer_points_to_type(totype);
1549 fromtype = get_pointer_points_to_type(fromtype);
1554 if (!is_Class_type(totype)) return 0;
1555 return is_SubClass_of(totype, fromtype);
1559 (is_unop)(const ir_node *node) {
1560 return _is_unop(node);
1564 get_unop_op(const ir_node *node) {
1565 if (node->op->opar == oparity_unary)
1566 return get_irn_n(node, node->op->op_index);
1568 assert(node->op->opar == oparity_unary);
1573 set_unop_op(ir_node *node, ir_node *op) {
1574 if (node->op->opar == oparity_unary)
1575 set_irn_n(node, node->op->op_index, op);
1577 assert(node->op->opar == oparity_unary);
1581 (is_binop)(const ir_node *node) {
1582 return _is_binop(node);
1586 get_binop_left(const ir_node *node) {
1587 assert(node->op->opar == oparity_binary);
1588 return get_irn_n(node, node->op->op_index);
1592 set_binop_left(ir_node *node, ir_node *left) {
1593 assert(node->op->opar == oparity_binary);
1594 set_irn_n(node, node->op->op_index, left);
1598 get_binop_right(const ir_node *node) {
1599 assert(node->op->opar == oparity_binary);
1600 return get_irn_n(node, node->op->op_index + 1);
1604 set_binop_right(ir_node *node, ir_node *right) {
1605 assert(node->op->opar == oparity_binary);
1606 set_irn_n(node, node->op->op_index + 1, right);
1610 (is_Phi)(const ir_node *n) {
1614 int is_Phi0(const ir_node *n) {
1617 return ((get_irn_op(n) == op_Phi) &&
1618 (get_irn_arity(n) == 0) &&
1619 (get_irg_phase_state(get_irn_irg(n)) == phase_building));
1623 get_Phi_preds_arr(ir_node *node) {
1624 assert(node->op == op_Phi);
1625 return (ir_node **)&(get_irn_in(node)[1]);
1629 get_Phi_n_preds(const ir_node *node) {
1630 assert(is_Phi(node) || is_Phi0(node));
1631 return (get_irn_arity(node));
1635 void set_Phi_n_preds(ir_node *node, int n_preds) {
1636 assert(node->op == op_Phi);
1641 get_Phi_pred(const ir_node *node, int pos) {
1642 assert(is_Phi(node) || is_Phi0(node));
1643 return get_irn_n(node, pos);
1647 set_Phi_pred(ir_node *node, int pos, ir_node *pred) {
1648 assert(is_Phi(node) || is_Phi0(node));
1649 set_irn_n(node, pos, pred);
1652 ir_node *(get_Phi_next)(const ir_node *phi) {
1653 return _get_Phi_next(phi);
1656 void (set_Phi_next)(ir_node *phi, ir_node *next) {
1657 _set_Phi_next(phi, next);
1660 int is_memop(const ir_node *node) {
1661 ir_opcode code = get_irn_opcode(node);
1662 return (code == iro_Load || code == iro_Store);
1665 ir_node *get_memop_mem(const ir_node *node) {
1666 assert(is_memop(node));
1667 return get_irn_n(node, 0);
1670 void set_memop_mem(ir_node *node, ir_node *mem) {
1671 assert(is_memop(node));
1672 set_irn_n(node, 0, mem);
1675 ir_node *get_memop_ptr(const ir_node *node) {
1676 assert(is_memop(node));
1677 return get_irn_n(node, 1);
1680 void set_memop_ptr(ir_node *node, ir_node *ptr) {
1681 assert(is_memop(node));
1682 set_irn_n(node, 1, ptr);
1686 get_Load_mem(const ir_node *node) {
1687 assert(node->op == op_Load);
1688 return get_irn_n(node, 0);
1692 set_Load_mem(ir_node *node, ir_node *mem) {
1693 assert(node->op == op_Load);
1694 set_irn_n(node, 0, mem);
1698 get_Load_ptr(const ir_node *node) {
1699 assert(node->op == op_Load);
1700 return get_irn_n(node, 1);
1704 set_Load_ptr(ir_node *node, ir_node *ptr) {
1705 assert(node->op == op_Load);
1706 set_irn_n(node, 1, ptr);
1710 get_Load_mode(const ir_node *node) {
1711 assert(node->op == op_Load);
1712 return node->attr.load.load_mode;
1716 set_Load_mode(ir_node *node, ir_mode *mode) {
1717 assert(node->op == op_Load);
1718 node->attr.load.load_mode = mode;
1722 get_Load_volatility(const ir_node *node) {
1723 assert(node->op == op_Load);
1724 return node->attr.load.volatility;
1728 set_Load_volatility(ir_node *node, ir_volatility volatility) {
1729 assert(node->op == op_Load);
1730 node->attr.load.volatility = volatility;
1734 get_Load_align(const ir_node *node) {
1735 assert(node->op == op_Load);
1736 return node->attr.load.aligned;
1740 set_Load_align(ir_node *node, ir_align align) {
1741 assert(node->op == op_Load);
1742 node->attr.load.aligned = align;
1747 get_Store_mem(const ir_node *node) {
1748 assert(node->op == op_Store);
1749 return get_irn_n(node, 0);
1753 set_Store_mem(ir_node *node, ir_node *mem) {
1754 assert(node->op == op_Store);
1755 set_irn_n(node, 0, mem);
1759 get_Store_ptr(const ir_node *node) {
1760 assert(node->op == op_Store);
1761 return get_irn_n(node, 1);
1765 set_Store_ptr(ir_node *node, ir_node *ptr) {
1766 assert(node->op == op_Store);
1767 set_irn_n(node, 1, ptr);
1771 get_Store_value(const ir_node *node) {
1772 assert(node->op == op_Store);
1773 return get_irn_n(node, 2);
1777 set_Store_value(ir_node *node, ir_node *value) {
1778 assert(node->op == op_Store);
1779 set_irn_n(node, 2, value);
1783 get_Store_volatility(const ir_node *node) {
1784 assert(node->op == op_Store);
1785 return node->attr.store.volatility;
1789 set_Store_volatility(ir_node *node, ir_volatility volatility) {
1790 assert(node->op == op_Store);
1791 node->attr.store.volatility = volatility;
1795 get_Store_align(const ir_node *node) {
1796 assert(node->op == op_Store);
1797 return node->attr.store.aligned;
1801 set_Store_align(ir_node *node, ir_align align) {
1802 assert(node->op == op_Store);
1803 node->attr.store.aligned = align;
1808 get_Alloc_mem(const ir_node *node) {
1809 assert(node->op == op_Alloc);
1810 return get_irn_n(node, 0);
1814 set_Alloc_mem(ir_node *node, ir_node *mem) {
1815 assert(node->op == op_Alloc);
1816 set_irn_n(node, 0, mem);
1820 get_Alloc_size(const ir_node *node) {
1821 assert(node->op == op_Alloc);
1822 return get_irn_n(node, 1);
1826 set_Alloc_size(ir_node *node, ir_node *size) {
1827 assert(node->op == op_Alloc);
1828 set_irn_n(node, 1, size);
1832 get_Alloc_type(ir_node *node) {
1833 assert(node->op == op_Alloc);
1834 return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
1838 set_Alloc_type(ir_node *node, ir_type *tp) {
1839 assert(node->op == op_Alloc);
1840 node->attr.alloc.type = tp;
1844 get_Alloc_where(const ir_node *node) {
1845 assert(node->op == op_Alloc);
1846 return node->attr.alloc.where;
1850 set_Alloc_where(ir_node *node, ir_where_alloc where) {
1851 assert(node->op == op_Alloc);
1852 node->attr.alloc.where = where;
1857 get_Free_mem(const ir_node *node) {
1858 assert(node->op == op_Free);
1859 return get_irn_n(node, 0);
1863 set_Free_mem(ir_node *node, ir_node *mem) {
1864 assert(node->op == op_Free);
1865 set_irn_n(node, 0, mem);
1869 get_Free_ptr(const ir_node *node) {
1870 assert(node->op == op_Free);
1871 return get_irn_n(node, 1);
1875 set_Free_ptr(ir_node *node, ir_node *ptr) {
1876 assert(node->op == op_Free);
1877 set_irn_n(node, 1, ptr);
1881 get_Free_size(const ir_node *node) {
1882 assert(node->op == op_Free);
1883 return get_irn_n(node, 2);
1887 set_Free_size(ir_node *node, ir_node *size) {
1888 assert(node->op == op_Free);
1889 set_irn_n(node, 2, size);
1893 get_Free_type(ir_node *node) {
1894 assert(node->op == op_Free);
1895 return node->attr.free.type = skip_tid(node->attr.free.type);
1899 set_Free_type(ir_node *node, ir_type *tp) {
1900 assert(node->op == op_Free);
1901 node->attr.free.type = tp;
1905 get_Free_where(const ir_node *node) {
1906 assert(node->op == op_Free);
1907 return node->attr.free.where;
1911 set_Free_where(ir_node *node, ir_where_alloc where) {
1912 assert(node->op == op_Free);
1913 node->attr.free.where = where;
1916 ir_node **get_Sync_preds_arr(ir_node *node) {
1917 assert(node->op == op_Sync);
1918 return (ir_node **)&(get_irn_in(node)[1]);
1921 int get_Sync_n_preds(const ir_node *node) {
1922 assert(node->op == op_Sync);
1923 return (get_irn_arity(node));
1927 void set_Sync_n_preds(ir_node *node, int n_preds) {
1928 assert(node->op == op_Sync);
1932 ir_node *get_Sync_pred(const ir_node *node, int pos) {
1933 assert(node->op == op_Sync);
1934 return get_irn_n(node, pos);
1937 void set_Sync_pred(ir_node *node, int pos, ir_node *pred) {
1938 assert(node->op == op_Sync);
1939 set_irn_n(node, pos, pred);
1942 /* Add a new Sync predecessor */
1943 void add_Sync_pred(ir_node *node, ir_node *pred) {
1944 assert(node->op == op_Sync);
1945 add_irn_n(node, pred);
1948 /* Returns the source language type of a Proj node. */
1949 ir_type *get_Proj_type(ir_node *n) {
1950 ir_type *tp = firm_unknown_type;
1951 ir_node *pred = get_Proj_pred(n);
1953 switch (get_irn_opcode(pred)) {
1956 /* Deal with Start / Call here: we need to know the Proj Nr. */
1957 assert(get_irn_mode(pred) == mode_T);
1958 pred_pred = get_Proj_pred(pred);
1959 if (get_irn_op(pred_pred) == op_Start) {
1960 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
1961 tp = get_method_param_type(mtp, get_Proj_proj(n));
1962 } else if (get_irn_op(pred_pred) == op_Call) {
1963 ir_type *mtp = get_Call_type(pred_pred);
1964 tp = get_method_res_type(mtp, get_Proj_proj(n));
1967 case iro_Start: break;
1968 case iro_Call: break;
1970 ir_node *a = get_Load_ptr(pred);
1972 tp = get_entity_type(get_Sel_entity(a));
1981 get_Proj_pred(const ir_node *node) {
1982 assert(is_Proj(node));
1983 return get_irn_n(node, 0);
1987 set_Proj_pred(ir_node *node, ir_node *pred) {
1988 assert(is_Proj(node));
1989 set_irn_n(node, 0, pred);
1993 get_Proj_proj(const ir_node *node) {
1994 assert(is_Proj(node));
1995 if (get_irn_opcode(node) == iro_Proj) {
1996 return node->attr.proj;
1998 assert(get_irn_opcode(node) == iro_Filter);
1999 return node->attr.filter.proj;
2004 set_Proj_proj(ir_node *node, long proj) {
2005 assert(node->op == op_Proj);
2006 node->attr.proj = proj;
2010 get_Tuple_preds_arr(ir_node *node) {
2011 assert(node->op == op_Tuple);
2012 return (ir_node **)&(get_irn_in(node)[1]);
2016 get_Tuple_n_preds(const ir_node *node) {
2017 assert(node->op == op_Tuple);
2018 return (get_irn_arity(node));
2023 set_Tuple_n_preds(ir_node *node, int n_preds) {
2024 assert(node->op == op_Tuple);
2029 get_Tuple_pred(const ir_node *node, int pos) {
2030 assert(node->op == op_Tuple);
2031 return get_irn_n(node, pos);
2035 set_Tuple_pred(ir_node *node, int pos, ir_node *pred) {
2036 assert(node->op == op_Tuple);
2037 set_irn_n(node, pos, pred);
2041 get_Id_pred(const ir_node *node) {
2042 assert(node->op == op_Id);
2043 return get_irn_n(node, 0);
2047 set_Id_pred(ir_node *node, ir_node *pred) {
2048 assert(node->op == op_Id);
2049 set_irn_n(node, 0, pred);
2052 ir_node *get_Confirm_value(const ir_node *node) {
2053 assert(node->op == op_Confirm);
2054 return get_irn_n(node, 0);
2057 void set_Confirm_value(ir_node *node, ir_node *value) {
2058 assert(node->op == op_Confirm);
2059 set_irn_n(node, 0, value);
2062 ir_node *get_Confirm_bound(const ir_node *node) {
2063 assert(node->op == op_Confirm);
2064 return get_irn_n(node, 1);
2067 void set_Confirm_bound(ir_node *node, ir_node *bound) {
2068 assert(node->op == op_Confirm);
2069 set_irn_n(node, 0, bound);
2072 pn_Cmp get_Confirm_cmp(const ir_node *node) {
2073 assert(node->op == op_Confirm);
2074 return node->attr.confirm.cmp;
2077 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) {
2078 assert(node->op == op_Confirm);
2079 node->attr.confirm.cmp = cmp;
2083 get_Filter_pred(ir_node *node) {
2084 assert(node->op == op_Filter);
2089 set_Filter_pred(ir_node *node, ir_node *pred) {
2090 assert(node->op == op_Filter);
2095 get_Filter_proj(ir_node *node) {
2096 assert(node->op == op_Filter);
2097 return node->attr.filter.proj;
2101 set_Filter_proj(ir_node *node, long proj) {
2102 assert(node->op == op_Filter);
2103 node->attr.filter.proj = proj;
2106 /* Don't use get_irn_arity, get_irn_n in implementation as access
2107 shall work independent of view!!! */
2108 void set_Filter_cg_pred_arr(ir_node *node, int arity, ir_node ** in) {
2109 assert(node->op == op_Filter);
2110 if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
2111 ir_graph *irg = get_irn_irg(node);
2112 node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
2113 node->attr.filter.backedge = new_backedge_arr(irg->obst, arity);
2114 node->attr.filter.in_cg[0] = node->in[0];
2116 memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity);
2119 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) {
2120 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2121 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1);
2122 node->attr.filter.in_cg[pos + 1] = pred;
2125 int get_Filter_n_cg_preds(ir_node *node) {
2126 assert(node->op == op_Filter && node->attr.filter.in_cg);
2127 return (ARR_LEN(node->attr.filter.in_cg) - 1);
2130 ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
2132 assert(node->op == op_Filter && node->attr.filter.in_cg &&
2134 arity = ARR_LEN(node->attr.filter.in_cg);
2135 assert(pos < arity - 1);
2136 return node->attr.filter.in_cg[pos + 1];
2140 ir_node *get_Mux_sel(const ir_node *node) {
2141 if (node->op == op_Psi) {
2142 assert(get_irn_arity(node) == 3);
2143 return get_Psi_cond(node, 0);
2145 assert(node->op == op_Mux);
2149 void set_Mux_sel(ir_node *node, ir_node *sel) {
2150 if (node->op == op_Psi) {
2151 assert(get_irn_arity(node) == 3);
2152 set_Psi_cond(node, 0, sel);
2154 assert(node->op == op_Mux);
2159 ir_node *get_Mux_false(const ir_node *node) {
2160 if (node->op == op_Psi) {
2161 assert(get_irn_arity(node) == 3);
2162 return get_Psi_default(node);
2164 assert(node->op == op_Mux);
2168 void set_Mux_false(ir_node *node, ir_node *ir_false) {
2169 if (node->op == op_Psi) {
2170 assert(get_irn_arity(node) == 3);
2171 set_Psi_default(node, ir_false);
2173 assert(node->op == op_Mux);
2174 node->in[2] = ir_false;
2178 ir_node *get_Mux_true(const ir_node *node) {
2179 if (node->op == op_Psi) {
2180 assert(get_irn_arity(node) == 3);
2181 return get_Psi_val(node, 0);
2183 assert(node->op == op_Mux);
2187 void set_Mux_true(ir_node *node, ir_node *ir_true) {
2188 if (node->op == op_Psi) {
2189 assert(get_irn_arity(node) == 3);
2190 set_Psi_val(node, 0, ir_true);
2192 assert(node->op == op_Mux);
2193 node->in[3] = ir_true;
2198 ir_node *get_Psi_cond(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);
2204 void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
2205 assert(node->op == op_Psi);
2206 assert(pos < get_Psi_n_conds(node));
2207 set_irn_n(node, 2 * pos, cond);
2210 ir_node *get_Psi_val(const ir_node *node, int pos) {
2211 assert(node->op == op_Psi);
2212 assert(pos < get_Psi_n_conds(node));
2213 return get_irn_n(node, 2 * pos + 1);
2216 void set_Psi_val(ir_node *node, int pos, ir_node *val) {
2217 assert(node->op == op_Psi);
2218 assert(pos < get_Psi_n_conds(node));
2219 set_irn_n(node, 2 * pos + 1, val);
2222 ir_node *get_Psi_default(const ir_node *node) {
2223 int def_pos = get_irn_arity(node) - 1;
2224 assert(node->op == op_Psi);
2225 return get_irn_n(node, def_pos);
2228 void set_Psi_default(ir_node *node, ir_node *val) {
2229 int def_pos = get_irn_arity(node);
2230 assert(node->op == op_Psi);
2231 set_irn_n(node, def_pos, val);
2234 int (get_Psi_n_conds)(const ir_node *node) {
2235 return _get_Psi_n_conds(node);
2239 ir_node *get_CopyB_mem(const ir_node *node) {
2240 assert(node->op == op_CopyB);
2241 return get_irn_n(node, 0);
2244 void set_CopyB_mem(ir_node *node, ir_node *mem) {
2245 assert(node->op == op_CopyB);
2246 set_irn_n(node, 0, mem);
2249 ir_node *get_CopyB_dst(const ir_node *node) {
2250 assert(node->op == op_CopyB);
2251 return get_irn_n(node, 1);
2254 void set_CopyB_dst(ir_node *node, ir_node *dst) {
2255 assert(node->op == op_CopyB);
2256 set_irn_n(node, 1, dst);
2259 ir_node *get_CopyB_src(const ir_node *node) {
2260 assert(node->op == op_CopyB);
2261 return get_irn_n(node, 2);
2264 void set_CopyB_src(ir_node *node, ir_node *src) {
2265 assert(node->op == op_CopyB);
2266 set_irn_n(node, 2, src);
2269 ir_type *get_CopyB_type(ir_node *node) {
2270 assert(node->op == op_CopyB);
2271 return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
2274 void set_CopyB_type(ir_node *node, ir_type *data_type) {
2275 assert(node->op == op_CopyB && data_type);
2276 node->attr.copyb.data_type = data_type;
2281 get_InstOf_type(ir_node *node) {
2282 assert(node->op == op_InstOf);
2283 return node->attr.instof.type = skip_tid(node->attr.instof.type);
2287 set_InstOf_type(ir_node *node, ir_type *type) {
2288 assert(node->op == op_InstOf);
2289 node->attr.instof.type = type;
2293 get_InstOf_store(const ir_node *node) {
2294 assert(node->op == op_InstOf);
2295 return get_irn_n(node, 0);
2299 set_InstOf_store(ir_node *node, ir_node *obj) {
2300 assert(node->op == op_InstOf);
2301 set_irn_n(node, 0, obj);
2305 get_InstOf_obj(const ir_node *node) {
2306 assert(node->op == op_InstOf);
2307 return get_irn_n(node, 1);
2311 set_InstOf_obj(ir_node *node, ir_node *obj) {
2312 assert(node->op == op_InstOf);
2313 set_irn_n(node, 1, obj);
2316 /* Returns the memory input of a Raise operation. */
2318 get_Raise_mem(const ir_node *node) {
2319 assert(node->op == op_Raise);
2320 return get_irn_n(node, 0);
2324 set_Raise_mem(ir_node *node, ir_node *mem) {
2325 assert(node->op == op_Raise);
2326 set_irn_n(node, 0, mem);
2330 get_Raise_exo_ptr(const ir_node *node) {
2331 assert(node->op == op_Raise);
2332 return get_irn_n(node, 1);
2336 set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) {
2337 assert(node->op == op_Raise);
2338 set_irn_n(node, 1, exo_ptr);
2343 /* Returns the memory input of a Bound operation. */
2344 ir_node *get_Bound_mem(const ir_node *bound) {
2345 assert(bound->op == op_Bound);
2346 return get_irn_n(bound, 0);
2349 void set_Bound_mem(ir_node *bound, ir_node *mem) {
2350 assert(bound->op == op_Bound);
2351 set_irn_n(bound, 0, mem);
2354 /* Returns the index input of a Bound operation. */
2355 ir_node *get_Bound_index(const ir_node *bound) {
2356 assert(bound->op == op_Bound);
2357 return get_irn_n(bound, 1);
2360 void set_Bound_index(ir_node *bound, ir_node *idx) {
2361 assert(bound->op == op_Bound);
2362 set_irn_n(bound, 1, idx);
2365 /* Returns the lower bound input of a Bound operation. */
2366 ir_node *get_Bound_lower(const ir_node *bound) {
2367 assert(bound->op == op_Bound);
2368 return get_irn_n(bound, 2);
2371 void set_Bound_lower(ir_node *bound, ir_node *lower) {
2372 assert(bound->op == op_Bound);
2373 set_irn_n(bound, 2, lower);
2376 /* Returns the upper bound input of a Bound operation. */
2377 ir_node *get_Bound_upper(const ir_node *bound) {
2378 assert(bound->op == op_Bound);
2379 return get_irn_n(bound, 3);
2382 void set_Bound_upper(ir_node *bound, ir_node *upper) {
2383 assert(bound->op == op_Bound);
2384 set_irn_n(bound, 3, upper);
2387 /* Return the operand of a Pin node. */
2388 ir_node *get_Pin_op(const ir_node *pin) {
2389 assert(pin->op == op_Pin);
2390 return get_irn_n(pin, 0);
2393 void set_Pin_op(ir_node *pin, ir_node *node) {
2394 assert(pin->op == op_Pin);
2395 set_irn_n(pin, 0, node);
2398 /* Return the assembler text of an ASM pseudo node. */
2399 ident *get_ASM_text(const ir_node *node) {
2400 assert(node->op == op_ASM);
2401 return node->attr.assem.asm_text;
2404 /* Return the number of input constraints for an ASM node. */
2405 int get_ASM_n_input_constraints(const ir_node *node) {
2406 assert(node->op == op_ASM);
2407 return ARR_LEN(node->attr.assem.inputs);
2410 /* Return the input constraints for an ASM node. This is a flexible array. */
2411 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node) {
2412 assert(node->op == op_ASM);
2413 return node->attr.assem.inputs;
2416 /* Return the number of output constraints for an ASM node. */
2417 int get_ASM_n_output_constraints(const ir_node *node) {
2418 assert(node->op == op_ASM);
2419 return ARR_LEN(node->attr.assem.outputs);
2422 /* Return the output constraints for an ASM node. */
2423 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node) {
2424 assert(node->op == op_ASM);
2425 return node->attr.assem.outputs;
2428 /* Return the number of clobbered registers for an ASM node. */
2429 int get_ASM_n_clobbers(const ir_node *node) {
2430 assert(node->op == op_ASM);
2431 return ARR_LEN(node->attr.assem.clobber);
2434 /* Return the list of clobbered registers for an ASM node. */
2435 ident **get_ASM_clobbers(const ir_node *node) {
2436 assert(node->op == op_ASM);
2437 return node->attr.assem.clobber;
2440 /* returns the graph of a node */
2442 get_irn_irg(const ir_node *node) {
2444 * Do not use get_nodes_Block() here, because this
2445 * will check the pinned state.
2446 * However even a 'wrong' block is always in the proper
2449 if (! is_Block(node))
2450 node = get_irn_n(node, -1);
2451 if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
2452 node = get_irn_n(node, -1);
2453 assert(get_irn_op(node) == op_Block);
2454 return node->attr.block.irg;
2458 /*----------------------------------------------------------------*/
2459 /* Auxiliary routines */
2460 /*----------------------------------------------------------------*/
2463 skip_Proj(ir_node *node) {
2464 /* don't assert node !!! */
2469 node = get_Proj_pred(node);
2475 skip_Proj_const(const ir_node *node) {
2476 /* don't assert node !!! */
2481 node = get_Proj_pred(node);
2487 skip_Tuple(ir_node *node) {
2491 if (!get_opt_normalize()) return node;
2494 if (get_irn_op(node) == op_Proj) {
2495 pred = get_Proj_pred(node);
2496 op = get_irn_op(pred);
2499 * Looks strange but calls get_irn_op() only once
2500 * in most often cases.
2502 if (op == op_Proj) { /* nested Tuple ? */
2503 pred = skip_Tuple(pred);
2504 op = get_irn_op(pred);
2506 if (op == op_Tuple) {
2507 node = get_Tuple_pred(pred, get_Proj_proj(node));
2510 } else if (op == op_Tuple) {
2511 node = get_Tuple_pred(pred, get_Proj_proj(node));
2518 /* returns operand of node if node is a Cast */
2519 ir_node *skip_Cast(ir_node *node) {
2520 if (get_irn_op(node) == op_Cast)
2521 return get_Cast_op(node);
2525 /* returns operand of node if node is a Confirm */
2526 ir_node *skip_Confirm(ir_node *node) {
2527 if (get_irn_op(node) == op_Confirm)
2528 return get_Confirm_value(node);
2532 /* skip all high-level ops */
2533 ir_node *skip_HighLevel_ops(ir_node *node) {
2534 while (is_op_highlevel(get_irn_op(node))) {
2535 node = get_irn_n(node, 0);
2541 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity
2542 * than any other approach, as Id chains are resolved and all point to the real node, or
2543 * all id's are self loops.
2545 * Note: This function takes 10% of mostly ANY the compiler run, so it's
2546 * a little bit "hand optimized".
2548 * Moreover, it CANNOT be switched off using get_opt_normalize() ...
2551 skip_Id(ir_node *node) {
2553 /* don't assert node !!! */
2555 if (!node || (node->op != op_Id)) return node;
2557 /* Don't use get_Id_pred(): We get into an endless loop for
2558 self-referencing Ids. */
2559 pred = node->in[0+1];
2561 if (pred->op != op_Id) return pred;
2563 if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
2564 ir_node *rem_pred, *res;
2566 if (pred->op != op_Id) return pred; /* shortcut */
2569 assert(get_irn_arity (node) > 0);
2571 node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */
2572 res = skip_Id(rem_pred);
2573 if (res->op == op_Id) /* self-loop */ return node;
2575 node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
2582 void skip_Id_and_store(ir_node **node) {
2585 if (!n || (n->op != op_Id)) return;
2587 /* Don't use get_Id_pred(): We get into an endless loop for
2588 self-referencing Ids. */
2593 (is_Bad)(const ir_node *node) {
2594 return _is_Bad(node);
2598 (is_NoMem)(const ir_node *node) {
2599 return _is_NoMem(node);
2603 (is_Minus)(const ir_node *node) {
2604 return _is_Minus(node);
2608 (is_Abs)(const ir_node *node) {
2609 return _is_Abs(node);
2613 (is_Mod)(const ir_node *node) {
2614 return _is_Mod(node);
2618 (is_Div)(const ir_node *node) {
2619 return _is_Div(node);
2623 (is_DivMod)(const ir_node *node) {
2624 return _is_DivMod(node);
2628 (is_Quot)(const ir_node *node) {
2629 return _is_Quot(node);
2633 (is_Add)(const ir_node *node) {
2634 return _is_Add(node);
2638 (is_And)(const ir_node *node) {
2639 return _is_And(node);
2643 (is_Or)(const ir_node *node) {
2644 return _is_Or(node);
2648 (is_Eor)(const ir_node *node) {
2649 return _is_Eor(node);
2653 (is_Sub)(const ir_node *node) {
2654 return _is_Sub(node);
2658 (is_Shl)(const ir_node *node) {
2659 return _is_Shl(node);
2663 (is_Shr)(const ir_node *node) {
2664 return _is_Shr(node);
2668 (is_Shrs)(const ir_node *node) {
2669 return _is_Shrs(node);
2673 (is_Rot)(const ir_node *node) {
2674 return _is_Rot(node);
2678 (is_Not)(const ir_node *node) {
2679 return _is_Not(node);
2683 (is_Psi)(const ir_node *node) {
2684 return _is_Psi(node);
2688 (is_Tuple)(const ir_node *node) {
2689 return _is_Tuple(node);
2693 (is_Bound)(const ir_node *node) {
2694 return _is_Bound(node);
2698 (is_Start)(const ir_node *node) {
2699 return _is_Start(node);
2703 (is_End)(const ir_node *node) {
2704 return _is_End(node);
2708 (is_Const)(const ir_node *node) {
2709 return _is_Const(node);
2713 (is_Conv)(const ir_node *node) {
2714 return _is_Conv(node);
2718 (is_strictConv)(const ir_node *node) {
2719 return _is_strictConv(node);
2723 (is_Cast)(const ir_node *node) {
2724 return _is_Cast(node);
2728 (is_no_Block)(const ir_node *node) {
2729 return _is_no_Block(node);
2733 (is_Block)(const ir_node *node) {
2734 return _is_Block(node);
2737 /* returns true if node is an Unknown node. */
2739 (is_Unknown)(const ir_node *node) {
2740 return _is_Unknown(node);
2743 /* returns true if node is a Return node. */
2745 (is_Return)(const ir_node *node) {
2746 return _is_Return(node);
2749 /* returns true if node is a Call node. */
2751 (is_Call)(const ir_node *node) {
2752 return _is_Call(node);
2755 /* returns true if node is a Sel node. */
2757 (is_Sel)(const ir_node *node) {
2758 return _is_Sel(node);
2761 /* returns true if node is a Mux node or a Psi with only one condition. */
2763 (is_Mux)(const ir_node *node) {
2764 return _is_Mux(node);
2767 /* returns true if node is a Load node. */
2769 (is_Load)(const ir_node *node) {
2770 return _is_Load(node);
2773 /* returns true if node is a Load node. */
2775 (is_Store)(const ir_node *node) {
2776 return _is_Store(node);
2779 /* returns true if node is a Sync node. */
2781 (is_Sync)(const ir_node *node) {
2782 return _is_Sync(node);
2785 /* Returns true if node is a Confirm node. */
2787 (is_Confirm)(const ir_node *node) {
2788 return _is_Confirm(node);
2791 /* Returns true if node is a Pin node. */
2793 (is_Pin)(const ir_node *node) {
2794 return _is_Pin(node);
2797 /* Returns true if node is a SymConst node. */
2799 (is_SymConst)(const ir_node *node) {
2800 return _is_SymConst(node);
2803 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
2805 (is_SymConst_addr_ent)(const ir_node *node) {
2806 return _is_SymConst_addr_ent(node);
2809 /* Returns true if node is a Cond node. */
2811 (is_Cond)(const ir_node *node) {
2812 return _is_Cond(node);
2816 (is_CopyB)(const ir_node *node) {
2817 return _is_CopyB(node);
2820 /* returns true if node is a Cmp node. */
2822 (is_Cmp)(const ir_node *node) {
2823 return _is_Cmp(node);
2826 /* returns true if node is an Alloc node. */
2828 (is_Alloc)(const ir_node *node) {
2829 return _is_Alloc(node);
2832 /* returns true if a node is a Jmp node. */
2834 (is_Jmp)(const ir_node *node) {
2835 return _is_Jmp(node);
2838 /* returns true if a node is a Raise node. */
2840 (is_Raise)(const ir_node *node) {
2841 return _is_Raise(node);
2844 /* returns true if a node is an ASM node. */
2846 (is_ASM)(const ir_node *node) {
2847 return _is_ASM(node);
2851 (is_Proj)(const ir_node *node) {
2853 return node->op == op_Proj ||
2854 (!get_interprocedural_view() && node->op == op_Filter);
2857 /* Returns true if the operation manipulates control flow. */
2858 int is_cfop(const ir_node *node) {
2859 return is_op_cfopcode(get_irn_op(node));
2862 /* Returns true if the operation manipulates interprocedural control flow:
2863 CallBegin, EndReg, EndExcept */
2864 int is_ip_cfop(const ir_node *node) {
2865 return is_ip_cfopcode(get_irn_op(node));
2868 /* Returns true if the operation can change the control flow because
2871 is_fragile_op(const ir_node *node) {
2872 return is_op_fragile(get_irn_op(node));
2875 /* Returns the memory operand of fragile operations. */
2876 ir_node *get_fragile_op_mem(ir_node *node) {
2877 assert(node && is_fragile_op(node));
2879 switch (get_irn_opcode(node)) {
2890 return get_irn_n(node, pn_Generic_M_regular);
2895 assert(0 && "should not be reached");
2900 /* Returns the result mode of a Div operation. */
2901 ir_mode *get_divop_resmod(const ir_node *node) {
2902 switch (get_irn_opcode(node)) {
2903 case iro_Quot : return get_Quot_resmode(node);
2904 case iro_DivMod: return get_DivMod_resmode(node);
2905 case iro_Div : return get_Div_resmode(node);
2906 case iro_Mod : return get_Mod_resmode(node);
2908 assert(0 && "should not be reached");
2913 /* Returns true if the operation is a forking control flow operation. */
2914 int (is_irn_forking)(const ir_node *node) {
2915 return _is_irn_forking(node);
2918 /* Return the type associated with the value produced by n
2919 * if the node remarks this type as it is the case for
2920 * Cast, Const, SymConst and some Proj nodes. */
2921 ir_type *(get_irn_type)(ir_node *node) {
2922 return _get_irn_type(node);
2925 /* Return the type attribute of a node n (SymConst, Call, Alloc, Free,
2927 ir_type *(get_irn_type_attr)(ir_node *node) {
2928 return _get_irn_type_attr(node);
2931 /* Return the entity attribute of a node n (SymConst, Sel) or NULL. */
2932 ir_entity *(get_irn_entity_attr)(ir_node *node) {
2933 return _get_irn_entity_attr(node);
2936 /* Returns non-zero for constant-like nodes. */
2937 int (is_irn_constlike)(const ir_node *node) {
2938 return _is_irn_constlike(node);
2942 * Returns non-zero for nodes that are allowed to have keep-alives and
2943 * are neither Block nor PhiM.
2945 int (is_irn_keep)(const ir_node *node) {
2946 return _is_irn_keep(node);
2950 * Returns non-zero for nodes that are always placed in the start block.
2952 int (is_irn_start_block_placed)(const ir_node *node) {
2953 return _is_irn_start_block_placed(node);
2956 /* Returns non-zero for nodes that are machine operations. */
2957 int (is_irn_machine_op)(const ir_node *node) {
2958 return _is_irn_machine_op(node);
2961 /* Returns non-zero for nodes that are machine operands. */
2962 int (is_irn_machine_operand)(const ir_node *node) {
2963 return _is_irn_machine_operand(node);
2966 /* Returns non-zero for nodes that have the n'th user machine flag set. */
2967 int (is_irn_machine_user)(const ir_node *node, unsigned n) {
2968 return _is_irn_machine_user(node, n);
2972 /* Gets the string representation of the jump prediction .*/
2973 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
2976 case COND_JMP_PRED_NONE: return "no prediction";
2977 case COND_JMP_PRED_TRUE: return "true taken";
2978 case COND_JMP_PRED_FALSE: return "false taken";
2982 /* Returns the conditional jump prediction of a Cond node. */
2983 cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) {
2984 return _get_Cond_jmp_pred(cond);
2987 /* Sets a new conditional jump prediction. */
2988 void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
2989 _set_Cond_jmp_pred(cond, pred);
2992 /** the get_type operation must be always implemented and return a firm type */
2993 static ir_type *get_Default_type(ir_node *n) {
2995 return get_unknown_type();
2998 /* Sets the get_type operation for an ir_op_ops. */
2999 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) {
3001 case iro_Const: ops->get_type = get_Const_type; break;
3002 case iro_SymConst: ops->get_type = get_SymConst_value_type; break;
3003 case iro_Cast: ops->get_type = get_Cast_type; break;
3004 case iro_Proj: ops->get_type = get_Proj_type; break;
3006 /* not allowed to be NULL */
3007 if (! ops->get_type)
3008 ops->get_type = get_Default_type;
3014 /** Return the attribute type of a SymConst node if exists */
3015 static ir_type *get_SymConst_attr_type(ir_node *self) {
3016 symconst_kind kind = get_SymConst_kind(self);
3017 if (SYMCONST_HAS_TYPE(kind))
3018 return get_SymConst_type(self);
3022 /** Return the attribute entity of a SymConst node if exists */
3023 static ir_entity *get_SymConst_attr_entity(ir_node *self) {
3024 symconst_kind kind = get_SymConst_kind(self);
3025 if (SYMCONST_HAS_ENT(kind))
3026 return get_SymConst_entity(self);
3030 /** the get_type_attr operation must be always implemented */
3031 static ir_type *get_Null_type(ir_node *n) {
3033 return firm_unknown_type;
3036 /* Sets the get_type operation for an ir_op_ops. */
3037 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) {
3039 case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break;
3040 case iro_Call: ops->get_type_attr = get_Call_type; break;
3041 case iro_Alloc: ops->get_type_attr = get_Alloc_type; break;
3042 case iro_Free: ops->get_type_attr = get_Free_type; break;
3043 case iro_Cast: ops->get_type_attr = get_Cast_type; break;
3045 /* not allowed to be NULL */
3046 if (! ops->get_type_attr)
3047 ops->get_type_attr = get_Null_type;
3053 /** the get_entity_attr operation must be always implemented */
3054 static ir_entity *get_Null_ent(ir_node *n) {
3059 /* Sets the get_type operation for an ir_op_ops. */
3060 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) {
3062 case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break;
3063 case iro_Sel: ops->get_entity_attr = _get_Sel_entity; break;
3065 /* not allowed to be NULL */
3066 if (! ops->get_entity_attr)
3067 ops->get_entity_attr = get_Null_ent;
3073 /* Sets the debug information of a node. */
3074 void (set_irn_dbg_info)(ir_node *n, dbg_info *db) {
3075 _set_irn_dbg_info(n, db);
3079 * Returns the debug information of an node.
3081 * @param n The node.
3083 dbg_info *(get_irn_dbg_info)(const ir_node *n) {
3084 return _get_irn_dbg_info(n);
3087 /* checks whether a node represents a global address */
3088 int is_Global(const ir_node *node) {
3091 if (is_SymConst_addr_ent(node))
3096 ptr = get_Sel_ptr(node);
3097 return is_globals_pointer(ptr) != NULL;
3100 /* returns the entity of a global address */
3101 ir_entity *get_Global_entity(const ir_node *node) {
3102 if (is_SymConst(node))
3103 return get_SymConst_entity(node);
3105 return get_Sel_entity(node);
3108 #ifdef DEBUG_libfirm
3109 void dump_irn(const ir_node *n) {
3110 int i, arity = get_irn_arity(n);
3111 printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
3113 ir_node *pred = get_irn_n(n, -1);
3114 printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3115 get_irn_node_nr(pred), (void *)pred);
3117 printf(" preds: \n");
3118 for (i = 0; i < arity; ++i) {
3119 ir_node *pred = get_irn_n(n, i);
3120 printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
3121 get_irn_node_nr(pred), (void *)pred);
3125 #else /* DEBUG_libfirm */
3126 void dump_irn(const ir_node *n) { (void) n; }
3127 #endif /* DEBUG_libfirm */