3 * File name: ir/ir/irnode_t.h
4 * Purpose: Representation of an intermediate operation -- private header.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier, Michael Beck
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 * Declarations of an ir node.
18 * @author Martin Trapp, Christian Schaefer
23 #include "firm_config.h"
26 #include "irgraph_t.h"
28 #include "firm_common_t.h"
29 #include "irdom_t.h" /* For size of struct dom_info. */
39 #include "irextbb_t.h"
42 /** IR node attributes **/
44 /** Block attributes */
46 /* General attributes */
48 unsigned long block_visited; /**< for the walker that walks over all blocks. */
49 /* Attributes private to construction: */
50 unsigned matured:1; /**< if set, all in-nodes of the block are fixed */
51 unsigned dead:1; /**< if set, the block is dead (and could be replace by a Bad */
52 ir_node **graph_arr; /**< array to store all parameters */
53 /* Attributes holding analyses information */
54 dom_info dom; /**< Datastructure that holds information about dominators.
56 Eventually overlay with graph_arr as only valid
57 in different phases. Eventually inline the whole
59 dom_info pdom; /**< Datastructure that holds information about post-dominators. */
60 ir_node ** in_cg; /**< array with predecessors in
61 * interprocedural_view, if they differ
62 * from intraprocedural predecessors */
63 int *backedge; /**< Field n set to true if pred n is backedge.
64 @@@ @todo Ev. replace by bit field! */
65 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
66 @@@ @todo Ev. replace by bit field! */
67 ir_extblk *extblk; /**< the extended basic block this block belongs to */
69 struct list_head succ_head; /**< A list head for all successor edges of a block. */
73 /** Cond attributes. */
75 cond_kind kind; /**< flavor of Cond */
76 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
77 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
80 /** Const attributes. */
82 tarval *tv; /**< the target value */
83 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
86 /** SymConst attributes. */
88 symconst_symbol sym; // old tori
90 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
93 /** Sel attributes. */
95 entity *ent; /**< entity to select */
98 /** Exception attributes. */
100 #if PRECISE_EXC_CONTEXT
101 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
105 /** Call attributes. */
107 except_attr exc; /**< the exception attribute. MUST be the first one. */
108 ir_type *cld_tp; /**< type of called procedure */
109 entity ** callee_arr; /**< result of callee analysis */
112 /** Alloc attributes. */
114 except_attr exc; /**< the exception attribute. MUST be the first one. */
115 ir_type *type; /**< Type of the allocated object. */
116 where_alloc where; /**< stack, heap or other managed part of memory */
119 /** Free attributes. */
121 ir_type *type; /**< Type of the allocated object. */
122 where_alloc where; /**< stack, heap or other managed part of memory */
125 /** InstOf attributes. */
127 except_attr exc; /**< the exception attribute. MUST be the first one. */
128 ir_type *type; /**< the type of which the object pointer must be */
131 /** Filter attributes. */
133 long proj; /**< contains the result position to project (Proj) */
134 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
135 int *backedge; /**< Field n set to true if pred n is backedge.
136 @todo Ev. replace by bitfield! */
139 /** EndReg/EndExcept attributes. */
144 /** CallBegin attributes. */
146 ir_node * call; /**< Associated Call-operation. */
149 /** Cast attributes. */
151 ir_type *totype; /**< Type of the casted node. */
154 /** Load attributes. */
156 except_attr exc; /**< The exception attribute. MUST be the first one. */
157 ir_mode *load_mode; /**< The mode of this Load operation. */
158 ent_volatility volatility; /**< The volatility of a Load/Store operation. */
161 /** Store attributes. */
163 except_attr exc; /**< the exception attribute. MUST be the first one. */
164 ent_volatility volatility; /**< the volatility of a Store operation */
167 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
169 /** CopyB attribute. */
171 except_attr exc; /**< The exception attribute. MUST be the first one. */
172 ir_type *data_type; /**< Type of the copied entity. */
175 /** Bound attribute. */
177 except_attr exc; /**< The exception attribute. MUST be the first one. */
180 /** Conv attribute. */
182 char strict; /**< If set, this is a strict Conv that cannot be removed. */
186 * Edge info to put into an irn.
188 typedef struct _irn_edge_info_t {
189 struct list_head outs_head; /**< The list of all outs. */
190 int out_count; /**< Number of outs in the list. */
194 /** Some IR-nodes just have one attribute, these are stored here,
195 some have more. Their name is 'irnodename_attr' */
197 block_attr block; /**< For Block: Fields needed to construct it */
198 cond_attr cond; /**< For Cond. */
199 const_attr con; /**< For Const: contains the value of the constant and a type */
200 symconst_attr symc; /**< For SymConst. */
201 sel_attr sel; /**< For Sel. */
202 call_attr call; /**< For Call: pointer to the type of the method to call */
203 callbegin_attr callbegin; /**< For CallBegin */
204 alloc_attr alloc; /**< For Alloc. */
205 free_attr free; /**< For Free. */
206 io_attr instof; /**< For InstOf */
207 cast_attr cast; /**< For Cast. */
208 load_attr load; /**< For Load. */
209 store_attr store; /**< For Store. */
210 int phi0_pos; /**< For Phi. Used to remember the value defined by
211 this Phi node. Needed when the Phi is completed
212 to call get_r_internal_value to find the
213 predecessors. If this attribute is set, the Phi
214 node takes the role of the obsolete Phi0 node,
215 therefore the name. */
216 int *phi_backedge; /**< For Phi after construction.
217 Field n set to true if pred n is backedge.
218 @todo Ev. replace by bitfield! */
219 long proj; /**< For Proj: contains the result position to project */
220 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
221 filter_attr filter; /**< For Filter */
222 end_attr end; /**< For EndReg, EndExcept */
223 except_attr except; /**< For Phi node construction in case of exceptions */
224 copyb_attr copyb; /**< For CopyB operation */
225 bound_attr bound; /**< For Bound operation */
226 conv_attr conv; /**< For Conv operation */
230 /** common structure of an irnode
231 if the node has some attributes, they are stored in attr */
233 /* ------- Basics of the representation ------- */
234 firm_kind kind; /**< distinguishes this node from others */
235 ir_op *op; /**< Opcode of this node. */
236 ir_mode *mode; /**< Mode of this node. */
237 struct ir_node **in; /**< The array of predecessors / operands. */
238 unsigned long visited; /**< Visited counter for walks of the graph. */
239 unsigned node_idx; /**< The node index of this node in its graph. */
240 unsigned pinned : 1; /**< A node is either pinned or not. */
241 void *link; /**< To attach additional information to the node, e.g.
242 used while construction to link Phi0 nodes and
243 during optimization to link to nodes that
244 shall replace a node. */
245 /* ------- Fields for optimizations / analysis information ------- */
246 struct ir_node **out; /**< @deprecated array of out edges. */
247 struct dbg_info* dbi; /**< A pointer to information for debug support. */
248 /* ------- For debugging ------- */
251 long node_nr; /**< A unique node number for each node to make output
254 /* ------- For analyses -------- */
255 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
256 #ifdef DO_HEAPANALYSIS
257 struct abstval *av; /**< the abstract value of this node */
260 irn_edge_info_t edge_info; /**< everlasting out edges */
261 /* ------- Opcode depending fields -------- */
262 attr attr; /**< attribute of this node. Depends on opcode.
263 Must be last field of struct ir_node. */
268 * Returns the array with the ins. The content of the array may not be
270 * Note that this function returns the whole in array including the
271 * block predecessor. So, it is NOT symmetric with set_irn_in().
273 ir_node **get_irn_in (const ir_node *node);
276 /** access attributes directly */
277 const_attr get_irn_const_attr (ir_node *node);
278 long get_irn_proj_attr (ir_node *node);
279 alloc_attr get_irn_alloc_attr (ir_node *node);
280 free_attr get_irn_free_attr (ir_node *node);
281 symconst_attr get_irn_symconst_attr (ir_node *node);
282 ir_type *get_irn_call_attr (ir_node *node);
283 ir_type *get_irn_funccall_attr (ir_node *node);
284 sel_attr get_irn_sel_attr (ir_node *node);
285 int get_irn_phi_attr (ir_node *node);
286 block_attr get_irn_block_attr (ir_node *node);
287 load_attr get_irn_load_attr (ir_node *node);
288 store_attr get_irn_store_attr (ir_node *node);
289 except_attr get_irn_except_attr (ir_node *node);
293 * The amount of additional space for custom data to be allocated upon creating a new node.
295 extern unsigned firm_add_node_size;
298 * Sets the get_type operation for an ir_op_ops.
300 * @param code the opcode for the default operation
301 * @param ops the operations initialized
306 ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops);
309 * Sets the get_type_attr operation for an ir_op_ops.
311 * @param code the opcode for the default operation
312 * @param ops the operations initialized
317 ir_op_ops *firm_set_default_get_type_attr(opcode code, ir_op_ops *ops);
320 * Sets the get_entity_attr operation for an ir_op_ops.
322 * @param code the opcode for the default operation
323 * @param ops the operations initialized
328 ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops);
330 /*-------------------------------------------------------------------*/
331 /* These function are most used in libfirm. Give them as static */
332 /* functions so they can be inlined. */
333 /*-------------------------------------------------------------------*/
336 * Checks whether a pointer points to a ir node.
337 * Intern version for libFirm.
340 _is_ir_node(const void *thing) {
341 return (get_kind(thing) == k_ir_node);
345 * Gets the op of a node.
346 * Intern version for libFirm.
348 static INLINE ir_op *
349 _get_irn_op(const ir_node *node) {
355 _set_irn_op(ir_node *node, ir_op *op) {
360 /** Copies all attributes stored in the old node to the new node.
361 Assumes both have the same opcode and sufficient size. */
363 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
364 ir_op *op = _get_irn_op(old_node);
366 /* must always exist */
367 op->ops.copy_attr(old_node, new_node);
371 * Gets the opcode of a node.
372 * Intern version for libFirm.
375 _get_irn_opcode(const ir_node *node) {
376 assert(k_ir_node == get_kind(node));
378 return node->op->code;
382 * Returns the number of predecessors without the block predecessor.
383 * Intern version for libFirm.
386 _get_irn_intra_arity(const ir_node *node) {
388 return ARR_LEN(node->in) - 1;
392 * Returns the number of predecessors without the block predecessor.
393 * Intern version for libFirm.
396 _get_irn_inter_arity(const ir_node *node) {
398 if (_get_irn_op(node) == op_Filter) {
399 assert(node->attr.filter.in_cg);
400 return ARR_LEN(node->attr.filter.in_cg) - 1;
401 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
402 return ARR_LEN(node->attr.block.in_cg) - 1;
404 return _get_irn_intra_arity(node);
408 * Returns the number of predecessors without the block predecessor.
409 * Intern version for libFirm.
411 extern int (*_get_irn_arity)(const ir_node *node);
414 * Intern version for libFirm.
416 static INLINE ir_node *
417 _get_irn_intra_n(const ir_node *node, int n) {
420 assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node));
422 nn = node->in[n + 1];
423 if (!nn || (nn->op != op_Id)) return nn;
425 return (node->in[n + 1] = skip_Id(nn));
429 * Intern version for libFirm.
431 static INLINE ir_node*
432 _get_irn_inter_n(const ir_node *node, int n) {
433 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
435 /* handle Filter and Block specially */
436 if (_get_irn_op(node) == op_Filter) {
437 assert(node->attr.filter.in_cg);
438 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
439 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
440 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
443 return _get_irn_intra_n(node, n);
447 * Access to the predecessors of a node.
448 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
449 * to iterate including the Block predecessor iterate from i = -1 to
451 * If it is a block, the entry -1 is NULL.
452 * Intern version for libFirm.
454 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
457 * Gets the mode of a node.
458 * Intern version for libFirm.
460 static INLINE ir_mode *
461 _get_irn_mode(const ir_node *node) {
467 * Sets the mode of a node.
468 * Intern version of libFirm.
471 _set_irn_mode(ir_node *node, ir_mode *mode) {
477 * Gets the visited counter of a node.
478 * Intern version for libFirm.
480 static INLINE unsigned long
481 _get_irn_visited(const ir_node *node) {
483 return node->visited;
487 * Sets the visited counter of a node.
488 * Intern version for libFirm.
491 _set_irn_visited(ir_node *node, unsigned long visited) {
493 node->visited = visited;
497 * Mark a node as visited in a graph.
498 * Intern version for libFirm.
501 _mark_irn_visited(ir_node *node) {
503 node->visited = current_ir_graph->visited;
507 * Returns non-zero if a node of was visited.
508 * Intern version for libFirm.
511 _irn_visited(const ir_node *node) {
513 return (node->visited >= current_ir_graph->visited);
517 * Returns non-zero if a node of was NOT visited.
518 * Intern version for libFirm.
521 _irn_not_visited(const ir_node *node) {
523 return (node->visited < current_ir_graph->visited);
527 * Sets the link of a node.
528 * Intern version of libFirm.
531 _set_irn_link(ir_node *node, void *link) {
533 /* Link field is used for Phi construction and various optimizations
535 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
541 * Returns the link of a node.
542 * Intern version of libFirm.
545 _get_irn_link(const ir_node *node) {
546 assert(node && _is_ir_node(node));
551 * Returns whether the node _always_ must be pinned.
552 * I.e., the node is not floating after global cse.
554 * Intern version of libFirm.
556 static INLINE op_pin_state
557 _get_irn_pinned(const ir_node *node) {
559 assert(node && _is_ir_node(node));
561 state = _get_op_pinned(_get_irn_op(node));
563 if (state >= op_pin_state_exc_pinned)
564 return get_opt_fragile_ops() ? (op_pin_state)node->pinned : op_pin_state_pinned;
565 return (op_pin_state)node->pinned;
568 static INLINE op_pin_state
569 _is_irn_pinned_in_irg(const ir_node *node) {
570 if (_get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
571 return _get_irn_pinned(node);
572 return op_pin_state_pinned;
576 _is_unop(const ir_node *node) {
577 assert(node && _is_ir_node(node));
578 return (node->op->opar == oparity_unary);
582 _is_binop(const ir_node *node) {
583 assert(node && _is_ir_node(node));
584 return (node->op->opar == oparity_binary);
588 _is_Bad(const ir_node *node) {
590 return (_get_irn_op(node) == op_Bad);
594 _is_Const(const ir_node *node) {
596 return (_get_irn_op(node) == op_Const);
600 _is_Unknown(const ir_node *node) {
602 return (_get_irn_op(node) == op_Unknown);
606 _is_Return(const ir_node *node) {
608 return (_get_irn_op(node) == op_Return);
612 _is_Call(const ir_node *node) {
614 return (_get_irn_op(node) == op_Call);
618 _is_Sel(const ir_node *node) {
620 return (_get_irn_op(node) == op_Sel);
624 _is_Mux(const ir_node *node) {
627 ir_op *op = _get_irn_op(node);
628 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
634 _is_Load(const ir_node *node) {
636 return (_get_irn_op(node) == op_Load);
640 _is_Sync(const ir_node *node) {
642 return (_get_irn_op(node) == op_Sync);
646 _is_Confirm(const ir_node *node) {
648 return (_get_irn_op(node) == op_Confirm);
652 _is_no_Block(const ir_node *node) {
653 assert(node && _is_ir_node(node));
654 return (_get_irn_op(node) != op_Block);
658 _is_Block(const ir_node *node) {
659 assert(node && _is_ir_node(node));
660 return (_get_irn_op(node) == op_Block);
664 _get_Block_n_cfgpreds(ir_node *node) {
665 assert(_is_Block(node));
666 return _get_irn_arity(node);
669 static INLINE ir_node *
670 _get_Block_cfgpred(ir_node *node, int pos) {
671 assert(0 <= pos && pos < get_irn_arity(node));
672 assert(_is_Block(node));
673 return _get_irn_n(node, pos);
676 /* Get the predecessor block.
678 * Returns the block corresponding to the predecessor pos.
680 * There are several ambiguities we resolve with this function:
681 * - The direct predecessor can be a Proj, which is not pinned.
682 * We walk from the predecessor to the next pinned node
683 * (skip_Proj) and return the block that node is in.
684 * - If we encounter the Bad node, this function does not return
685 * Start, but the Bad node.
687 static INLINE ir_node *
688 _get_Block_cfgpred_block(ir_node *node, int pos) {
689 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
691 res = get_nodes_block(res);
695 static INLINE unsigned long
696 _get_Block_block_visited(ir_node *node) {
697 assert(node->op == op_Block);
698 return node->attr.block.block_visited;
702 _set_Block_block_visited(ir_node *node, unsigned long visit) {
703 assert(node->op == op_Block);
704 node->attr.block.block_visited = visit;
707 /* For this current_ir_graph must be set. */
709 _mark_Block_block_visited(ir_node *node) {
710 assert(node->op == op_Block);
711 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
715 _Block_not_block_visited(ir_node *node) {
716 assert(node->op == op_Block);
717 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
720 static INLINE ir_node *
721 _set_Block_dead(ir_node *block) {
722 assert(_get_irn_op(block) == op_Block);
723 block->attr.block.dead = 1;
728 _is_Block_dead(const ir_node *block) {
729 ir_op *op = _get_irn_op(block);
734 assert(op == op_Block);
735 return block->attr.block.dead;
739 static INLINE tarval *_get_Const_tarval (ir_node *node) {
740 assert (_get_irn_op(node) == op_Const);
741 return node->attr.con.tv;
744 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
746 assert(_is_ir_node(node));
748 op = _get_irn_op(node);
751 return classify_tarval(_get_Const_tarval(node));
752 else if(op == op_SymConst)
753 return CNST_SYMCONST;
755 return CNST_NO_CONST;
758 static INLINE int _is_irn_forking(const ir_node *node) {
759 return is_op_forking(_get_irn_op(node));
762 static INLINE ir_type *_get_irn_type(ir_node *node) {
763 return _get_irn_op(node)->ops.get_type(node);
766 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
767 return _get_irn_op(node)->ops.get_type_attr(node);
770 static INLINE entity *_get_irn_entity_attr(ir_node *node) {
771 return _get_irn_op(node)->ops.get_entity_attr(node);
774 static INLINE int _is_irn_constlike(const ir_node *node) {
775 return is_op_constlike(_get_irn_op(node));
778 static INLINE int _is_irn_always_opt(const ir_node *node) {
779 return is_op_always_opt(_get_irn_op(node));
782 static INLINE int _is_irn_keep(const ir_node *node) {
783 return is_op_keep(_get_irn_op(node));
786 static INLINE int _is_irn_machine_op(const ir_node *node) {
787 return is_op_machine(_get_irn_op(node));
790 static INLINE int _is_irn_machine_operand(const ir_node *node) {
791 return is_op_machine_operand(_get_irn_op(node));
794 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
795 return is_op_machine_user(_get_irn_op(node), n);
798 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
799 assert (_get_irn_op(node) == op_Cond);
800 return node->attr.cond.pred;
803 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
804 assert (_get_irn_op(node) == op_Cond);
805 node->attr.cond.pred = pred;
808 static INLINE int _get_Psi_n_conds(ir_node *node) {
809 assert(_get_irn_op(node) == op_Psi);
810 return _get_irn_arity(node) >> 1;
813 static INLINE unsigned _get_irn_idx(const ir_node *node) {
814 return node->node_idx;
817 /* this section MUST contain all inline functions */
818 #define is_ir_node(thing) _is_ir_node(thing)
819 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
820 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
821 #define get_irn_arity(node) _get_irn_arity(node)
822 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
823 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
824 #define get_irn_n(node, n) _get_irn_n(node, n)
825 #define get_irn_mode(node) _get_irn_mode(node)
826 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
827 #define get_irn_op(node) _get_irn_op(node)
828 #define set_irn_op(node, op) _set_irn_op(node, op)
829 #define get_irn_opcode(node) _get_irn_opcode(node)
830 #define get_irn_visited(node) _get_irn_visited(node)
831 #define set_irn_visited(node, v) _set_irn_visited(node, v)
832 #define mark_irn_visited(node) _mark_irn_visited(node)
833 #define irn_visited(node) _irn_visited(node)
834 #define irn_not_visited(node) _irn_not_visited(node)
835 #define set_irn_link(node, link) _set_irn_link(node, link)
836 #define get_irn_link(node) _get_irn_link(node)
837 #define get_irn_pinned(node) _get_irn_pinned(node)
838 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
839 #define is_unop(node) _is_unop(node)
840 #define is_binop(node) _is_binop(node)
841 #define is_Const(node) _is_Const(node)
842 #define is_Unknown(node) _is_Unknown(node)
843 #define is_Return(node) _is_Return(node)
844 #define is_Call(node) _is_Call(node)
845 #define is_Sel(node) _is_Sel(node)
846 #define is_Mux(node) _is_Mux(node)
847 #define is_Load(node) _is_Load(node)
848 #define is_Sync(node) _is_Sync(node)
849 #define is_Confirm(node) _is_Confirm(node)
850 #define is_Bad(node) _is_Bad(node)
851 #define is_no_Block(node) _is_no_Block(node)
852 #define is_Block(node) _is_Block(node)
853 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
854 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
855 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
856 #define get_Block_block_visited(node) _get_Block_block_visited(node)
857 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
858 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
859 #define Block_not_block_visited(node) _Block_not_block_visited(node)
860 #define set_Block_dead(block) _set_Block_dead(block)
861 #define is_Block_dead(block) _is_Block_dead(block)
862 #define get_Const_tarval(node) _get_Const_tarval(node)
863 #define classify_Const(node) _classify_Const(node)
864 #define is_irn_forking(node) _is_irn_forking(node)
865 #define get_irn_type(node) _get_irn_type(node)
866 #define get_irn_type_attr(node) _get_irn_type_attr(node)
867 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
868 #define is_irn_constlike(node) _is_irn_constlike(node)
869 #define is_irn_always_opt(node) _is_irn_always_opt(node)
870 #define is_irn_keep(node) _is_irn_keep(node)
871 #define is_irn_machine_op(node) _is_irn_machine_op(node)
872 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
873 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
874 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
875 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
876 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
877 #define get_irn_idx(node) _get_irn_idx(node)
879 # endif /* _IRNODE_T_H_ */