2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of an intermediate operation -- private header.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
26 #ifndef FIRM_IR_IRNODE_T_H
27 #define FIRM_IR_IRNODE_T_H
29 #include "firm_config.h"
32 #include "irgraph_t.h"
34 #include "firm_common_t.h"
35 #include "irdom_t.h" /* For size of struct dom_info. */
38 #include "iredgekinds.h"
46 #include "irextbb_t.h"
49 /** ir node attributes **/
51 /** Block attributes */
53 /* General attributes */
54 ir_graph *irg; /**< The graph this block belongs to. */
55 unsigned long block_visited; /**< For the walker that walks over all blocks. */
56 /* Attributes private to construction: */
57 unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
58 unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
59 unsigned is_mb_head:1; /**< Set if this block is a macroblock head. */
60 ir_node **graph_arr; /**< An array to store all parameters. */
61 /* Attributes holding analyses information */
62 ir_dom_info dom; /**< Datastructure that holds information about dominators.
64 Eventually overlay with graph_arr as only valid
65 in different phases. Eventually inline the whole
67 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
68 ir_node ** in_cg; /**< array with predecessors in
69 * interprocedural_view, if they differ
70 * from intraprocedural predecessors */
71 int *backedge; /**< Field n set to true if pred n is backedge.
72 @@@ @todo Ev. replace by bit field! */
73 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
74 @@@ @todo Ev. replace by bit field! */
75 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
76 ir_region *region; /**< The immediate structural region this block belongs to. */
77 unsigned mb_depth; /**< The macroblock depth: A distance from the macroblock header */
79 struct list_head succ_head; /**< A list head for all successor edges of a block. */
82 /** Cond attributes. */
84 cond_kind kind; /**< flavor of Cond */
85 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
86 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
89 /** Const attributes. */
91 tarval *tv; /**< the target value */
92 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
95 /** SymConst attributes. */
97 symconst_symbol sym; // old tori
99 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
102 /** Sel attributes. */
104 ir_entity *ent; /**< entity to select */
107 /** Exception attributes. */
109 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
110 If it's know that no exception will be generated, could be set to
111 op_pin_state_floats. */
112 #if PRECISE_EXC_CONTEXT
113 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
117 /** Call attributes. */
119 except_attr exc; /**< the exception attribute. MUST be the first one. */
120 ir_type *cld_tp; /**< type of called procedure */
121 ir_entity ** callee_arr; /**< result of callee analysis */
124 /** Alloc attributes. */
126 except_attr exc; /**< the exception attribute. MUST be the first one. */
127 ir_type *type; /**< Type of the allocated object. */
128 where_alloc where; /**< stack, heap or other managed part of memory */
131 /** Free attributes. */
133 ir_type *type; /**< Type of the allocated object. */
134 where_alloc where; /**< stack, heap or other managed part of memory */
137 /** InstOf attributes. */
139 except_attr exc; /**< the exception attribute. MUST be the first one. */
140 ir_type *type; /**< the type of which the object pointer must be */
143 /** Filter attributes. */
145 long proj; /**< contains the result position to project (Proj) */
146 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
147 int *backedge; /**< Field n set to true if pred n is backedge.
148 @todo Ev. replace by bitfield! */
151 /** CallBegin attributes. */
153 ir_node * call; /**< Associated Call-operation. */
156 /** Cast attributes. */
158 ir_type *totype; /**< Type of the casted node. */
161 /** Load attributes. */
163 except_attr exc; /**< The exception attribute. MUST be the first one. */
164 ir_mode *load_mode; /**< The mode of this Load operation. */
165 ir_volatility volatility; /**< The volatility of a Load/Store operation. */
168 /** Store attributes. */
170 except_attr exc; /**< the exception attribute. MUST be the first one. */
171 ir_volatility volatility; /**< the volatility of a Store operation */
175 int pos; /**< For Phi0. Used to remember the value defined by
176 this Phi node. Needed when the Phi is completed
177 to call get_r_internal_value to find the
178 predecessors. If this attribute is set, the Phi
179 node takes the role of the obsolete Phi0 node,
180 therefore the name. */
184 /**< Confirm attribute. */
186 pn_Cmp cmp; /**< The compare operation. */
189 /** CopyB attribute. */
191 except_attr exc; /**< The exception attribute. MUST be the first one. */
192 ir_type *data_type; /**< Type of the copied entity. */
195 /** Bound attribute. */
197 except_attr exc; /**< The exception attribute. MUST be the first one. */
200 /** Conv attribute. */
202 char strict; /**< If set, this is a strict Conv that cannot be removed. */
205 /** Div/Mod/DivMod/Quot attribute. */
207 except_attr exc; /**< The exception attribute. MUST be the first one. */
208 ir_mode *res_mode; /**< Result mode for the division. */
211 /** Inline Assembler support attribute. */
213 op_pin_state pin_state; /**< the pin state for operations that might generate a exception */
214 ident *asm_text; /**< The inline assembler text. */
215 ir_asm_constraint *inputs; /**< Input constraints. */
216 ir_asm_constraint *outputs; /**< Output constraints. */
217 ident **clobber; /**< List of clobbered registers. */
220 /** Some IR-nodes just have one attribute, these are stored here,
221 some have more. Their name is 'irnodename_attr' */
223 block_attr block; /**< For Block: Fields needed to construct it */
224 cond_attr cond; /**< For Cond. */
225 const_attr con; /**< For Const: contains the value of the constant and a type */
226 symconst_attr symc; /**< For SymConst. */
227 sel_attr sel; /**< For Sel. */
228 call_attr call; /**< For Call: pointer to the type of the method to call */
229 callbegin_attr callbegin; /**< For CallBegin */
230 alloc_attr alloc; /**< For Alloc. */
231 free_attr free; /**< For Free. */
232 io_attr instof; /**< For InstOf */
233 cast_attr cast; /**< For Cast. */
234 load_attr load; /**< For Load. */
235 store_attr store; /**< For Store. */
236 phi0_attr phi0; /**< for Phi0 nodes. */
237 int *phi_backedge; /**< For Phi after construction.
238 Field n set to true if pred n is backedge.
239 @todo Ev. replace by bitfield! */
240 long proj; /**< For Proj: contains the result position to project */
241 confirm_attr confirm; /**< For Confirm: compare operation and region. */
242 filter_attr filter; /**< For Filter */
243 except_attr except; /**< For Phi node construction in case of exceptions */
244 copyb_attr copyb; /**< For CopyB operation */
245 bound_attr bound; /**< For Bound operation */
246 conv_attr conv; /**< For Conv operation */
247 divmod_attr divmod; /**< For Div/Mod/DivMod operation */
248 asm_attr assem; /**< For ASM operation. */
252 * Edge info to put into an irn.
254 typedef struct _irn_edge_kind_info_t {
255 struct list_head outs_head; /**< The list of all outs. */
256 int out_count; /**< Number of outs in the list. */
259 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
262 * The common structure of an irnode.
263 * If the node has some attributes, they are stored in the attr field.
266 /* ------- Basics of the representation ------- */
267 firm_kind kind; /**< Distinguishes this node from others. */
268 ir_op *op; /**< The Opcode of this node. */
269 ir_mode *mode; /**< The Mode of this node. */
270 struct ir_node **in; /**< The array of predecessors / operands. */
271 unsigned long visited; /**< The visited counter for walks of the graph. */
272 unsigned node_idx; /**< The node index of this node in its graph. */
273 void *link; /**< To attach additional information to the node, e.g.
274 used while construction to link Phi0 nodes and
275 during optimization to link to nodes that
276 shall replace a node. */
277 /* ------- Fields for optimizations / analysis information ------- */
278 struct ir_node **out; /**< @deprecated array of out edges. */
279 struct dbg_info *dbi; /**< A pointer to information for debug support. */
280 /* ------- For debugging ------- */
283 long node_nr; /**< A unique node number for each node to make output
286 /* ------- For analyses -------- */
287 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
288 #ifdef DO_HEAPANALYSIS
289 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
290 struct section *sec; /**< Heapanalysis: The section of this node. */
292 struct ir_node **deps; /**< Additional dependencies induced by state. */
293 irn_edges_info_t edge_info; /**< Everlasting out edges. */
294 /* ------- Opcode depending fields -------- */
295 attr attr; /**< The set of attributes of this node. Depends on opcode.
296 Must be last field of struct ir_node. */
301 * Returns the array with the ins. The content of the array may not be
303 * Note that this function returns the whole in array including the
304 * block predecessor. So, it is NOT symmetric with set_irn_in().
306 ir_node **get_irn_in (const ir_node *node);
309 /** access attributes directly */
310 const_attr get_irn_const_attr (ir_node *node);
311 long get_irn_proj_attr (ir_node *node);
312 alloc_attr get_irn_alloc_attr (ir_node *node);
313 free_attr get_irn_free_attr (ir_node *node);
314 symconst_attr get_irn_symconst_attr (ir_node *node);
315 ir_type *get_irn_call_attr (ir_node *node);
316 ir_type *get_irn_funccall_attr (ir_node *node);
317 sel_attr get_irn_sel_attr (ir_node *node);
318 int get_irn_phi0_attr (ir_node *node);
319 block_attr get_irn_block_attr (ir_node *node);
320 load_attr get_irn_load_attr (ir_node *node);
321 store_attr get_irn_store_attr (ir_node *node);
322 except_attr get_irn_except_attr (ir_node *node);
326 * The amount of additional space for custom data to be allocated upon creating a new node.
328 extern unsigned firm_add_node_size;
331 * Sets the get_type operation for an ir_op_ops.
333 * @param code the opcode for the default operation
334 * @param ops the operations initialized
339 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
342 * Sets the get_type_attr operation for an ir_op_ops.
344 * @param code the opcode for the default operation
345 * @param ops the operations initialized
350 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
353 * Sets the get_entity_attr operation for an ir_op_ops.
355 * @param code the opcode for the default operation
356 * @param ops the operations initialized
361 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
363 /*-------------------------------------------------------------------*/
364 /* These function are most used in libfirm. Give them as static */
365 /* functions so they can be inlined. */
366 /*-------------------------------------------------------------------*/
369 * Checks whether a pointer points to a ir node.
370 * Intern version for libFirm.
373 _is_ir_node(const void *thing) {
374 return (get_kind(thing) == k_ir_node);
378 * Gets the op of a node.
379 * Intern version for libFirm.
381 static INLINE ir_op *
382 _get_irn_op(const ir_node *node) {
388 _set_irn_op(ir_node *node, ir_op *op) {
393 /** Copies all attributes stored in the old node to the new node.
394 Assumes both have the same opcode and sufficient size. */
396 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
397 ir_op *op = _get_irn_op(old_node);
399 /* must always exist */
400 op->ops.copy_attr(old_node, new_node);
404 * Gets the opcode of a node.
405 * Intern version for libFirm.
407 static INLINE unsigned
408 _get_irn_opcode(const ir_node *node) {
409 assert(k_ir_node == get_kind(node));
411 return node->op->code;
415 * Returns the number of predecessors without the block predecessor.
416 * Intern version for libFirm.
419 _get_irn_intra_arity(const ir_node *node) {
421 return ARR_LEN(node->in) - 1;
425 * Returns the number of predecessors without the block predecessor.
426 * Intern version for libFirm.
429 _get_irn_inter_arity(const ir_node *node) {
431 if (_get_irn_op(node) == op_Filter) {
432 assert(node->attr.filter.in_cg);
433 return ARR_LEN(node->attr.filter.in_cg) - 1;
434 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
435 return ARR_LEN(node->attr.block.in_cg) - 1;
437 return _get_irn_intra_arity(node);
441 * Returns the number of predecessors without the block predecessor.
442 * Intern version for libFirm.
444 extern int (*_get_irn_arity)(const ir_node *node);
447 * Intern version for libFirm.
449 static INLINE ir_node *
450 _get_irn_intra_n(const ir_node *node, int n) {
454 assert(-1 <= n && n < _get_irn_intra_arity(node));
456 nn = node->in[n + 1];
458 /* only block inputs are allowed to be NULL */
459 assert(n == -1 && "NULL input of a node");
462 if (nn->op != op_Id) return nn;
464 return (node->in[n + 1] = skip_Id(nn));
468 * Intern version for libFirm.
470 static INLINE ir_node*
471 _get_irn_inter_n(const ir_node *node, int n) {
472 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
474 /* handle Filter and Block specially */
475 if (_get_irn_op(node) == op_Filter) {
476 assert(node->attr.filter.in_cg);
477 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
478 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
479 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
482 return _get_irn_intra_n(node, n);
486 * Access to the predecessors of a node.
487 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
488 * to iterate including the Block predecessor iterate from i = -1 to
490 * If it is a block, the entry -1 is NULL.
491 * Intern version for libFirm.
493 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
495 static INLINE int _get_irn_deps(const ir_node *node) {
496 return node->deps ? ARR_LEN(node->deps) : 0;
499 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
500 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
501 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
502 return node->deps[pos];
506 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
509 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
510 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
511 old = node->deps[pos];
512 node->deps[pos] = dep;
513 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
518 _get_irn_ins_or_deps(const ir_node *irn) {
519 return _get_irn_deps(irn) + _get_irn_arity(irn);
522 static INLINE ir_node *
523 _get_irn_in_or_dep(const ir_node *irn, int pos) {
524 int n_in = get_irn_arity(irn);
525 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
529 * Gets the mode of a node.
530 * Intern version for libFirm.
532 static INLINE ir_mode *
533 _get_irn_mode(const ir_node *node) {
539 * Sets the mode of a node.
540 * Intern version of libFirm.
543 _set_irn_mode(ir_node *node, ir_mode *mode) {
549 * Gets the visited counter of a node.
550 * Intern version for libFirm.
552 static INLINE unsigned long
553 _get_irn_visited(const ir_node *node) {
555 return node->visited;
559 * Sets the visited counter of a node.
560 * Intern version for libFirm.
563 _set_irn_visited(ir_node *node, unsigned long visited) {
565 node->visited = visited;
569 * Mark a node as visited in a graph.
570 * Intern version for libFirm.
573 _mark_irn_visited(ir_node *node) {
575 node->visited = current_ir_graph->visited;
579 * Returns non-zero if a node of was visited.
580 * Intern version for libFirm.
583 _irn_visited(const ir_node *node) {
585 return (node->visited >= current_ir_graph->visited);
589 * Returns non-zero if a node of was NOT visited.
590 * Intern version for libFirm.
593 _irn_not_visited(const ir_node *node) {
595 return (node->visited < current_ir_graph->visited);
599 * Sets the link of a node.
600 * Intern version of libFirm.
603 _set_irn_link(ir_node *node, void *link) {
605 /* Link field is used for Phi construction and various optimizations
607 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
613 * Returns the link of a node.
614 * Intern version of libFirm.
617 _get_irn_link(const ir_node *node) {
618 assert(node && _is_ir_node(node));
623 * Returns whether the node _always_ must be pinned.
624 * I.e., the node is not floating after global cse.
626 * Intern version of libFirm.
628 static INLINE op_pin_state
629 _get_irn_pinned(const ir_node *node) {
631 assert(node && _is_ir_node(node));
633 state = _get_op_pinned(_get_irn_op(node));
635 if (state >= op_pin_state_exc_pinned)
636 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
640 static INLINE op_pin_state
641 _is_irn_pinned_in_irg(const ir_node *node) {
642 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
643 return get_irn_pinned(node);
644 return op_pin_state_pinned;
648 _is_unop(const ir_node *node) {
649 assert(node && _is_ir_node(node));
650 return (node->op->opar == oparity_unary);
654 _is_binop(const ir_node *node) {
655 assert(node && _is_ir_node(node));
656 return (node->op->opar == oparity_binary);
660 _is_Bad(const ir_node *node) {
662 return (_get_irn_op(node) == op_Bad);
666 _is_NoMem(const ir_node *node) {
668 return (_get_irn_op(node) == op_NoMem);
672 _is_Minus(const ir_node *node) {
674 return (_get_irn_op(node) == op_Minus);
678 _is_Mod(const ir_node *node) {
680 return (_get_irn_op(node) == op_Mod);
684 _is_Div(const ir_node *node) {
686 return (_get_irn_op(node) == op_Div);
690 _is_DivMod(const ir_node *node) {
692 return (_get_irn_op(node) == op_DivMod);
696 _is_Quot(const ir_node *node) {
698 return (_get_irn_op(node) == op_Quot);
702 _is_Add(const ir_node *node) {
704 return (_get_irn_op(node) == op_Add);
708 _is_And(const ir_node *node) {
710 return (_get_irn_op(node) == op_And);
714 _is_Or(const ir_node *node) {
716 return (_get_irn_op(node) == op_Or);
720 _is_Sub(const ir_node *node) {
722 return (_get_irn_op(node) == op_Sub);
726 _is_Tuple(const ir_node *node) {
728 return (_get_irn_op(node) == op_Tuple);
732 _is_Start(const ir_node *node) {
734 return (_get_irn_op(node) == op_Start);
738 _is_End(const ir_node *node) {
740 return (_get_irn_op(node) == op_End);
744 _is_Const(const ir_node *node) {
746 return (_get_irn_op(node) == op_Const);
750 _is_Conv(const ir_node *node) {
752 return (_get_irn_op(node) == op_Conv);
756 _is_CopyB(const ir_node *node) {
758 return (_get_irn_op(node) == op_CopyB);
762 _is_Unknown(const ir_node *node) {
764 return (_get_irn_op(node) == op_Unknown);
768 _is_Return(const ir_node *node) {
770 return (_get_irn_op(node) == op_Return);
774 _is_Call(const ir_node *node) {
776 return (_get_irn_op(node) == op_Call);
780 _is_Sel(const ir_node *node) {
782 return (_get_irn_op(node) == op_Sel);
786 _is_Mul(const ir_node *node) {
788 return (_get_irn_op(node) == op_Mul);
792 _is_Mux(const ir_node *node) {
795 ir_op *op = _get_irn_op(node);
796 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
802 _is_Load(const ir_node *node) {
804 return (_get_irn_op(node) == op_Load);
808 _is_Store(const ir_node *node) {
810 return (_get_irn_op(node) == op_Store);
814 _is_Sync(const ir_node *node) {
816 return (_get_irn_op(node) == op_Sync);
820 _is_Confirm(const ir_node *node) {
822 return (_get_irn_op(node) == op_Confirm);
826 _is_Pin(const ir_node *node) {
828 return (_get_irn_op(node) == op_Pin);
832 _is_SymConst(const ir_node *node) {
834 return (_get_irn_op(node) == op_SymConst);
838 _is_Cond(const ir_node *node) {
840 return (_get_irn_op(node) == op_Cond);
844 _is_Cmp(const ir_node *node) {
846 return (_get_irn_op(node) == op_Cmp);
850 _is_Alloc(const ir_node *node) {
852 return (_get_irn_op(node) == op_Alloc);
856 _is_Jmp(const ir_node *node) {
858 return (_get_irn_op(node) == op_Jmp);
862 _is_Raise(const ir_node *node) {
864 return (_get_irn_op(node) == op_Raise);
868 _is_ASM(const ir_node *node) {
870 return (_get_irn_op(node) == op_ASM);
874 _is_no_Block(const ir_node *node) {
875 assert(node && _is_ir_node(node));
876 return (_get_irn_op(node) != op_Block);
880 _is_Block(const ir_node *node) {
881 assert(node && _is_ir_node(node));
882 return (_get_irn_op(node) == op_Block);
886 _get_Block_n_cfgpreds(const ir_node *node) {
887 assert(_is_Block(node));
888 return _get_irn_arity(node);
891 static INLINE ir_node *
892 _get_Block_cfgpred(ir_node *node, int pos) {
893 assert(0 <= pos && pos < get_irn_arity(node));
894 assert(_is_Block(node));
895 return _get_irn_n(node, pos);
898 /* Get the predecessor block.
900 * Returns the block corresponding to the predecessor pos.
902 * There are several ambiguities we resolve with this function:
903 * - The direct predecessor can be a Proj, which is not pinned.
904 * We walk from the predecessor to the next pinned node
905 * (skip_Proj) and return the block that node is in.
906 * - If we encounter the Bad node, this function does not return
907 * Start, but the Bad node.
909 static INLINE ir_node *
910 _get_Block_cfgpred_block(ir_node *node, int pos) {
911 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
913 res = get_nodes_block(res);
917 static INLINE unsigned long
918 _get_Block_block_visited(const ir_node *node) {
919 assert(node->op == op_Block);
920 return node->attr.block.block_visited;
924 _set_Block_block_visited(ir_node *node, unsigned long visit) {
925 assert(node->op == op_Block);
926 node->attr.block.block_visited = visit;
929 /* For this current_ir_graph must be set. */
931 _mark_Block_block_visited(ir_node *node) {
932 assert(node->op == op_Block);
933 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
937 _Block_not_block_visited(const ir_node *node) {
938 assert(node->op == op_Block);
939 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
943 _Block_block_visited(const ir_node *node) {
944 assert(node->op == op_Block);
945 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
948 static INLINE ir_node *
949 _set_Block_dead(ir_node *block) {
950 assert(_get_irn_op(block) == op_Block);
951 block->attr.block.is_dead = 1;
956 _is_Block_dead(const ir_node *block) {
957 ir_op *op = _get_irn_op(block);
962 assert(op == op_Block);
963 return block->attr.block.is_dead;
967 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
968 assert(_get_irn_op(node) == op_Const);
969 return node->attr.con.tv;
972 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
974 assert(_is_ir_node(node));
976 op = _get_irn_op(node);
979 return classify_tarval(_get_Const_tarval(node));
980 else if(op == op_SymConst)
981 return CNST_SYMCONST;
983 return CNST_NO_CONST;
986 static INLINE int _is_irn_forking(const ir_node *node) {
987 return is_op_forking(_get_irn_op(node));
990 static INLINE ir_type *_get_irn_type(ir_node *node) {
991 return _get_irn_op(node)->ops.get_type(node);
994 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
995 return _get_irn_op(node)->ops.get_type_attr(node);
998 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
999 return _get_irn_op(node)->ops.get_entity_attr(node);
1002 static INLINE int _is_irn_constlike(const ir_node *node) {
1003 return is_op_constlike(_get_irn_op(node));
1006 static INLINE int _is_irn_always_opt(const ir_node *node) {
1007 return is_op_always_opt(_get_irn_op(node));
1010 static INLINE int _is_irn_keep(const ir_node *node) {
1011 return is_op_keep(_get_irn_op(node));
1014 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
1015 return is_op_start_block_placed(_get_irn_op(node));
1018 static INLINE int _is_irn_machine_op(const ir_node *node) {
1019 return is_op_machine(_get_irn_op(node));
1022 static INLINE int _is_irn_machine_operand(const ir_node *node) {
1023 return is_op_machine_operand(_get_irn_op(node));
1026 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
1027 return is_op_machine_user(_get_irn_op(node), n);
1030 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
1031 assert(_get_irn_op(node) == op_Cond);
1032 return node->attr.cond.pred;
1035 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
1036 assert(_get_irn_op(node) == op_Cond);
1037 node->attr.cond.pred = pred;
1040 static INLINE int _get_Psi_n_conds(ir_node *node) {
1041 assert(_get_irn_op(node) == op_Psi);
1042 return _get_irn_arity(node) >> 1;
1045 static INLINE void *_get_irn_generic_attr(ir_node *node) {
1049 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
1053 static INLINE unsigned _get_irn_idx(const ir_node *node) {
1054 return node->node_idx;
1057 /* this section MUST contain all inline functions */
1058 #define is_ir_node(thing) _is_ir_node(thing)
1059 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
1060 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
1061 #define get_irn_arity(node) _get_irn_arity(node)
1062 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
1063 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
1064 #define get_irn_n(node, n) _get_irn_n(node, n)
1065 #define get_irn_mode(node) _get_irn_mode(node)
1066 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
1067 #define get_irn_op(node) _get_irn_op(node)
1068 #define set_irn_op(node, op) _set_irn_op(node, op)
1069 #define get_irn_opcode(node) _get_irn_opcode(node)
1070 #define get_irn_visited(node) _get_irn_visited(node)
1071 #define set_irn_visited(node, v) _set_irn_visited(node, v)
1072 #define mark_irn_visited(node) _mark_irn_visited(node)
1073 #define irn_visited(node) _irn_visited(node)
1074 #define irn_not_visited(node) _irn_not_visited(node)
1075 #define set_irn_link(node, link) _set_irn_link(node, link)
1076 #define get_irn_link(node) _get_irn_link(node)
1077 #define get_irn_pinned(node) _get_irn_pinned(node)
1078 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
1079 #define is_unop(node) _is_unop(node)
1080 #define is_binop(node) _is_binop(node)
1081 #define is_Const(node) _is_Const(node)
1082 #define is_Conv(node) _is_Conv(node)
1083 #define is_Unknown(node) _is_Unknown(node)
1084 #define is_Return(node) _is_Return(node)
1085 #define is_Call(node) _is_Call(node)
1086 #define is_Sel(node) _is_Sel(node)
1087 #define is_Mul(node) _is_Mul(node)
1088 #define is_Mux(node) _is_Mux(node)
1089 #define is_Load(node) _is_Load(node)
1090 #define is_Sync(node) _is_Sync(node)
1091 #define is_Confirm(node) _is_Confirm(node)
1092 #define is_Pin(node) _is_Pin(node)
1093 #define is_SymConst(node) _is_SymConst(node)
1094 #define is_Cond(node) _is_Cond(node)
1095 #define is_CopyB(node) _is_CopyB(node)
1096 #define is_Cmp(node) _is_Cmp(node)
1097 #define is_Alloc(node) _is_Alloc(node)
1098 #define is_Jmp(node) _is_Jmp(node)
1099 #define is_Raise(node) _is_Raise(node)
1100 #define is_ASM(node) _is_ASM(node)
1101 #define is_Bad(node) _is_Bad(node)
1102 #define is_NoMem(node) _is_NoMem(node)
1103 #define is_Start(node) _is_Start(node)
1104 #define is_End(node) _is_End(node)
1105 #define is_Minus(node) _is_Minus(node)
1106 #define is_Mod(node) _is_Mod(node)
1107 #define is_Div(node) _is_Div(node)
1108 #define is_DivMod(node) _is_DivMod(node)
1109 #define is_Quot(node) _is_Quot(node)
1110 #define is_Add(node) _is_Add(node)
1111 #define is_And(node) _is_And(node)
1112 #define is_Or(node) _is_Or(node)
1113 #define is_Sub(node) _is_Sub(node)
1114 #define is_Tuple(node) _is_Tuple(node)
1115 #define is_no_Block(node) _is_no_Block(node)
1116 #define is_Block(node) _is_Block(node)
1117 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
1118 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
1119 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
1120 #define get_Block_block_visited(node) _get_Block_block_visited(node)
1121 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
1122 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
1123 #define Block_not_block_visited(node) _Block_not_block_visited(node)
1124 #define Block_block_visited(node) _Block_block_visited(node)
1125 #define set_Block_dead(block) _set_Block_dead(block)
1126 #define is_Block_dead(block) _is_Block_dead(block)
1127 #define get_Const_tarval(node) _get_Const_tarval(node)
1128 #define classify_Const(node) _classify_Const(node)
1129 #define is_irn_forking(node) _is_irn_forking(node)
1130 #define get_irn_type(node) _get_irn_type(node)
1131 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1132 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1133 #define is_irn_constlike(node) _is_irn_constlike(node)
1134 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1135 #define is_irn_keep(node) _is_irn_keep(node)
1136 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1137 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1138 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1139 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1140 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1141 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1142 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1143 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
1144 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
1145 #define get_irn_idx(node) _get_irn_idx(node)
1147 #define get_irn_deps(node) _get_irn_deps(node)
1148 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1149 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1151 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1152 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)