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 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
101 If it's know that no exception will be generated, could be set to
102 op_pin_state_floats. */
103 #if PRECISE_EXC_CONTEXT
104 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
108 /** Call attributes. */
110 except_attr exc; /**< the exception attribute. MUST be the first one. */
111 ir_type *cld_tp; /**< type of called procedure */
112 entity ** callee_arr; /**< result of callee analysis */
115 /** Alloc attributes. */
117 except_attr exc; /**< the exception attribute. MUST be the first one. */
118 ir_type *type; /**< Type of the allocated object. */
119 where_alloc where; /**< stack, heap or other managed part of memory */
122 /** Free attributes. */
124 ir_type *type; /**< Type of the allocated object. */
125 where_alloc where; /**< stack, heap or other managed part of memory */
128 /** InstOf attributes. */
130 except_attr exc; /**< the exception attribute. MUST be the first one. */
131 ir_type *type; /**< the type of which the object pointer must be */
134 /** Filter attributes. */
136 long proj; /**< contains the result position to project (Proj) */
137 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
138 int *backedge; /**< Field n set to true if pred n is backedge.
139 @todo Ev. replace by bitfield! */
142 /** EndReg/EndExcept attributes. */
147 /** CallBegin attributes. */
149 ir_node * call; /**< Associated Call-operation. */
152 /** Cast attributes. */
154 ir_type *totype; /**< Type of the casted node. */
157 /** Load attributes. */
159 except_attr exc; /**< The exception attribute. MUST be the first one. */
160 ir_mode *load_mode; /**< The mode of this Load operation. */
161 ent_volatility volatility; /**< The volatility of a Load/Store operation. */
164 /** Store attributes. */
166 except_attr exc; /**< the exception attribute. MUST be the first one. */
167 ent_volatility volatility; /**< the volatility of a Store operation */
170 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
172 /** CopyB attribute. */
174 except_attr exc; /**< The exception attribute. MUST be the first one. */
175 ir_type *data_type; /**< Type of the copied entity. */
178 /** Bound attribute. */
180 except_attr exc; /**< The exception attribute. MUST be the first one. */
183 /** Conv attribute. */
185 char strict; /**< If set, this is a strict Conv that cannot be removed. */
189 * Edge info to put into an irn.
191 typedef struct _irn_edge_info_t {
192 struct list_head outs_head; /**< The list of all outs. */
193 int out_count; /**< Number of outs in the list. */
197 /** Some IR-nodes just have one attribute, these are stored here,
198 some have more. Their name is 'irnodename_attr' */
200 block_attr block; /**< For Block: Fields needed to construct it */
201 cond_attr cond; /**< For Cond. */
202 const_attr con; /**< For Const: contains the value of the constant and a type */
203 symconst_attr symc; /**< For SymConst. */
204 sel_attr sel; /**< For Sel. */
205 call_attr call; /**< For Call: pointer to the type of the method to call */
206 callbegin_attr callbegin; /**< For CallBegin */
207 alloc_attr alloc; /**< For Alloc. */
208 free_attr free; /**< For Free. */
209 io_attr instof; /**< For InstOf */
210 cast_attr cast; /**< For Cast. */
211 load_attr load; /**< For Load. */
212 store_attr store; /**< For Store. */
213 int phi0_pos; /**< For Phi. Used to remember the value defined by
214 this Phi node. Needed when the Phi is completed
215 to call get_r_internal_value to find the
216 predecessors. If this attribute is set, the Phi
217 node takes the role of the obsolete Phi0 node,
218 therefore the name. */
219 int *phi_backedge; /**< For Phi after construction.
220 Field n set to true if pred n is backedge.
221 @todo Ev. replace by bitfield! */
222 long proj; /**< For Proj: contains the result position to project */
223 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
224 filter_attr filter; /**< For Filter */
225 end_attr end; /**< For EndReg, EndExcept */
226 except_attr except; /**< For Phi node construction in case of exceptions */
227 copyb_attr copyb; /**< For CopyB operation */
228 bound_attr bound; /**< For Bound operation */
229 conv_attr conv; /**< For Conv operation */
233 /** common structure of an irnode
234 if the node has some attributes, they are stored in attr */
236 /* ------- Basics of the representation ------- */
237 firm_kind kind; /**< distinguishes this node from others */
238 ir_op *op; /**< Opcode of this node. */
239 ir_mode *mode; /**< Mode of this node. */
240 struct ir_node **in; /**< The array of predecessors / operands. */
241 unsigned long visited; /**< Visited counter for walks of the graph. */
242 unsigned node_idx; /**< The node index of this node in its graph. */
243 void *link; /**< To attach additional information to the node, e.g.
244 used while construction to link Phi0 nodes and
245 during optimization to link to nodes that
246 shall replace a node. */
247 /* ------- Fields for optimizations / analysis information ------- */
248 struct ir_node **out; /**< @deprecated array of out edges. */
249 struct dbg_info* dbi; /**< A pointer to information for debug support. */
250 /* ------- For debugging ------- */
253 long node_nr; /**< A unique node number for each node to make output
256 /* ------- For analyses -------- */
257 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
258 #ifdef DO_HEAPANALYSIS
259 struct abstval *av; /**< the abstract value of this node */
262 irn_edge_info_t edge_info; /**< everlasting out edges */
263 /* ------- Opcode depending fields -------- */
264 attr attr; /**< attribute of this node. Depends on opcode.
265 Must be last field of struct ir_node. */
270 * Returns the array with the ins. The content of the array may not be
272 * Note that this function returns the whole in array including the
273 * block predecessor. So, it is NOT symmetric with set_irn_in().
275 ir_node **get_irn_in (const ir_node *node);
278 /** access attributes directly */
279 const_attr get_irn_const_attr (ir_node *node);
280 long get_irn_proj_attr (ir_node *node);
281 alloc_attr get_irn_alloc_attr (ir_node *node);
282 free_attr get_irn_free_attr (ir_node *node);
283 symconst_attr get_irn_symconst_attr (ir_node *node);
284 ir_type *get_irn_call_attr (ir_node *node);
285 ir_type *get_irn_funccall_attr (ir_node *node);
286 sel_attr get_irn_sel_attr (ir_node *node);
287 int get_irn_phi_attr (ir_node *node);
288 block_attr get_irn_block_attr (ir_node *node);
289 load_attr get_irn_load_attr (ir_node *node);
290 store_attr get_irn_store_attr (ir_node *node);
291 except_attr get_irn_except_attr (ir_node *node);
295 * The amount of additional space for custom data to be allocated upon creating a new node.
297 extern unsigned firm_add_node_size;
300 * Sets the get_type operation for an ir_op_ops.
302 * @param code the opcode for the default operation
303 * @param ops the operations initialized
308 ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops);
311 * Sets the get_type_attr operation for an ir_op_ops.
313 * @param code the opcode for the default operation
314 * @param ops the operations initialized
319 ir_op_ops *firm_set_default_get_type_attr(opcode code, ir_op_ops *ops);
322 * Sets the get_entity_attr operation for an ir_op_ops.
324 * @param code the opcode for the default operation
325 * @param ops the operations initialized
330 ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops);
332 /*-------------------------------------------------------------------*/
333 /* These function are most used in libfirm. Give them as static */
334 /* functions so they can be inlined. */
335 /*-------------------------------------------------------------------*/
338 * Checks whether a pointer points to a ir node.
339 * Intern version for libFirm.
342 _is_ir_node(const void *thing) {
343 return (get_kind(thing) == k_ir_node);
347 * Gets the op of a node.
348 * Intern version for libFirm.
350 static INLINE ir_op *
351 _get_irn_op(const ir_node *node) {
357 _set_irn_op(ir_node *node, ir_op *op) {
362 /** Copies all attributes stored in the old node to the new node.
363 Assumes both have the same opcode and sufficient size. */
365 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
366 ir_op *op = _get_irn_op(old_node);
368 /* must always exist */
369 op->ops.copy_attr(old_node, new_node);
373 * Gets the opcode of a node.
374 * Intern version for libFirm.
377 _get_irn_opcode(const ir_node *node) {
378 assert(k_ir_node == get_kind(node));
380 return node->op->code;
384 * Returns the number of predecessors without the block predecessor.
385 * Intern version for libFirm.
388 _get_irn_intra_arity(const ir_node *node) {
390 return ARR_LEN(node->in) - 1;
394 * Returns the number of predecessors without the block predecessor.
395 * Intern version for libFirm.
398 _get_irn_inter_arity(const ir_node *node) {
400 if (_get_irn_op(node) == op_Filter) {
401 assert(node->attr.filter.in_cg);
402 return ARR_LEN(node->attr.filter.in_cg) - 1;
403 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
404 return ARR_LEN(node->attr.block.in_cg) - 1;
406 return _get_irn_intra_arity(node);
410 * Returns the number of predecessors without the block predecessor.
411 * Intern version for libFirm.
413 extern int (*_get_irn_arity)(const ir_node *node);
416 * Intern version for libFirm.
418 static INLINE ir_node *
419 _get_irn_intra_n(const ir_node *node, int n) {
422 assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node));
424 nn = node->in[n + 1];
425 if (!nn || (nn->op != op_Id)) return nn;
427 return (node->in[n + 1] = skip_Id(nn));
431 * Intern version for libFirm.
433 static INLINE ir_node*
434 _get_irn_inter_n(const ir_node *node, int n) {
435 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
437 /* handle Filter and Block specially */
438 if (_get_irn_op(node) == op_Filter) {
439 assert(node->attr.filter.in_cg);
440 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
441 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
442 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
445 return _get_irn_intra_n(node, n);
449 * Access to the predecessors of a node.
450 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
451 * to iterate including the Block predecessor iterate from i = -1 to
453 * If it is a block, the entry -1 is NULL.
454 * Intern version for libFirm.
456 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
459 * Gets the mode of a node.
460 * Intern version for libFirm.
462 static INLINE ir_mode *
463 _get_irn_mode(const ir_node *node) {
469 * Sets the mode of a node.
470 * Intern version of libFirm.
473 _set_irn_mode(ir_node *node, ir_mode *mode) {
479 * Gets the visited counter of a node.
480 * Intern version for libFirm.
482 static INLINE unsigned long
483 _get_irn_visited(const ir_node *node) {
485 return node->visited;
489 * Sets the visited counter of a node.
490 * Intern version for libFirm.
493 _set_irn_visited(ir_node *node, unsigned long visited) {
495 node->visited = visited;
499 * Mark a node as visited in a graph.
500 * Intern version for libFirm.
503 _mark_irn_visited(ir_node *node) {
505 node->visited = current_ir_graph->visited;
509 * Returns non-zero if a node of was visited.
510 * Intern version for libFirm.
513 _irn_visited(const ir_node *node) {
515 return (node->visited >= current_ir_graph->visited);
519 * Returns non-zero if a node of was NOT visited.
520 * Intern version for libFirm.
523 _irn_not_visited(const ir_node *node) {
525 return (node->visited < current_ir_graph->visited);
529 * Sets the link of a node.
530 * Intern version of libFirm.
533 _set_irn_link(ir_node *node, void *link) {
535 /* Link field is used for Phi construction and various optimizations
537 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
543 * Returns the link of a node.
544 * Intern version of libFirm.
547 _get_irn_link(const ir_node *node) {
548 assert(node && _is_ir_node(node));
553 * Returns whether the node _always_ must be pinned.
554 * I.e., the node is not floating after global cse.
556 * Intern version of libFirm.
558 static INLINE op_pin_state
559 _get_irn_pinned(const ir_node *node) {
561 assert(node && _is_ir_node(node));
563 state = _get_op_pinned(_get_irn_op(node));
565 if (state >= op_pin_state_exc_pinned)
566 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
570 static INLINE op_pin_state
571 _is_irn_pinned_in_irg(const ir_node *node) {
572 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
573 return get_irn_pinned(node);
574 return op_pin_state_pinned;
578 _is_unop(const ir_node *node) {
579 assert(node && _is_ir_node(node));
580 return (node->op->opar == oparity_unary);
584 _is_binop(const ir_node *node) {
585 assert(node && _is_ir_node(node));
586 return (node->op->opar == oparity_binary);
590 _is_Bad(const ir_node *node) {
592 return (_get_irn_op(node) == op_Bad);
596 _is_Const(const ir_node *node) {
598 return (_get_irn_op(node) == op_Const);
602 _is_Unknown(const ir_node *node) {
604 return (_get_irn_op(node) == op_Unknown);
608 _is_Return(const ir_node *node) {
610 return (_get_irn_op(node) == op_Return);
614 _is_Call(const ir_node *node) {
616 return (_get_irn_op(node) == op_Call);
620 _is_Sel(const ir_node *node) {
622 return (_get_irn_op(node) == op_Sel);
626 _is_Mux(const ir_node *node) {
629 ir_op *op = _get_irn_op(node);
630 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
636 _is_Load(const ir_node *node) {
638 return (_get_irn_op(node) == op_Load);
642 _is_Sync(const ir_node *node) {
644 return (_get_irn_op(node) == op_Sync);
648 _is_Confirm(const ir_node *node) {
650 return (_get_irn_op(node) == op_Confirm);
654 _is_no_Block(const ir_node *node) {
655 assert(node && _is_ir_node(node));
656 return (_get_irn_op(node) != op_Block);
660 _is_Block(const ir_node *node) {
661 assert(node && _is_ir_node(node));
662 return (_get_irn_op(node) == op_Block);
666 _get_Block_n_cfgpreds(ir_node *node) {
667 assert(_is_Block(node));
668 return _get_irn_arity(node);
671 static INLINE ir_node *
672 _get_Block_cfgpred(ir_node *node, int pos) {
673 assert(0 <= pos && pos < get_irn_arity(node));
674 assert(_is_Block(node));
675 return _get_irn_n(node, pos);
678 /* Get the predecessor block.
680 * Returns the block corresponding to the predecessor pos.
682 * There are several ambiguities we resolve with this function:
683 * - The direct predecessor can be a Proj, which is not pinned.
684 * We walk from the predecessor to the next pinned node
685 * (skip_Proj) and return the block that node is in.
686 * - If we encounter the Bad node, this function does not return
687 * Start, but the Bad node.
689 static INLINE ir_node *
690 _get_Block_cfgpred_block(ir_node *node, int pos) {
691 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
693 res = get_nodes_block(res);
697 static INLINE unsigned long
698 _get_Block_block_visited(ir_node *node) {
699 assert(node->op == op_Block);
700 return node->attr.block.block_visited;
704 _set_Block_block_visited(ir_node *node, unsigned long visit) {
705 assert(node->op == op_Block);
706 node->attr.block.block_visited = visit;
709 /* For this current_ir_graph must be set. */
711 _mark_Block_block_visited(ir_node *node) {
712 assert(node->op == op_Block);
713 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
717 _Block_not_block_visited(ir_node *node) {
718 assert(node->op == op_Block);
719 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
722 static INLINE ir_node *
723 _set_Block_dead(ir_node *block) {
724 assert(_get_irn_op(block) == op_Block);
725 block->attr.block.dead = 1;
730 _is_Block_dead(const ir_node *block) {
731 ir_op *op = _get_irn_op(block);
736 assert(op == op_Block);
737 return block->attr.block.dead;
741 static INLINE tarval *_get_Const_tarval(ir_node *node) {
742 assert(_get_irn_op(node) == op_Const);
743 return node->attr.con.tv;
746 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
748 assert(_is_ir_node(node));
750 op = _get_irn_op(node);
753 return classify_tarval(_get_Const_tarval(node));
754 else if(op == op_SymConst)
755 return CNST_SYMCONST;
757 return CNST_NO_CONST;
760 static INLINE int _is_irn_forking(const ir_node *node) {
761 return is_op_forking(_get_irn_op(node));
764 static INLINE ir_type *_get_irn_type(ir_node *node) {
765 return _get_irn_op(node)->ops.get_type(node);
768 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
769 return _get_irn_op(node)->ops.get_type_attr(node);
772 static INLINE entity *_get_irn_entity_attr(ir_node *node) {
773 return _get_irn_op(node)->ops.get_entity_attr(node);
776 static INLINE int _is_irn_constlike(const ir_node *node) {
777 return is_op_constlike(_get_irn_op(node));
780 static INLINE int _is_irn_always_opt(const ir_node *node) {
781 return is_op_always_opt(_get_irn_op(node));
784 static INLINE int _is_irn_keep(const ir_node *node) {
785 return is_op_keep(_get_irn_op(node));
788 static INLINE int _is_irn_machine_op(const ir_node *node) {
789 return is_op_machine(_get_irn_op(node));
792 static INLINE int _is_irn_machine_operand(const ir_node *node) {
793 return is_op_machine_operand(_get_irn_op(node));
796 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
797 return is_op_machine_user(_get_irn_op(node), n);
800 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
801 assert(_get_irn_op(node) == op_Cond);
802 return node->attr.cond.pred;
805 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
806 assert(_get_irn_op(node) == op_Cond);
807 node->attr.cond.pred = pred;
810 static INLINE int _get_Psi_n_conds(ir_node *node) {
811 assert(_get_irn_op(node) == op_Psi);
812 return _get_irn_arity(node) >> 1;
815 static INLINE unsigned _get_irn_idx(const ir_node *node) {
816 return node->node_idx;
819 /* this section MUST contain all inline functions */
820 #define is_ir_node(thing) _is_ir_node(thing)
821 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
822 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
823 #define get_irn_arity(node) _get_irn_arity(node)
824 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
825 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
826 #define get_irn_n(node, n) _get_irn_n(node, n)
827 #define get_irn_mode(node) _get_irn_mode(node)
828 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
829 #define get_irn_op(node) _get_irn_op(node)
830 #define set_irn_op(node, op) _set_irn_op(node, op)
831 #define get_irn_opcode(node) _get_irn_opcode(node)
832 #define get_irn_visited(node) _get_irn_visited(node)
833 #define set_irn_visited(node, v) _set_irn_visited(node, v)
834 #define mark_irn_visited(node) _mark_irn_visited(node)
835 #define irn_visited(node) _irn_visited(node)
836 #define irn_not_visited(node) _irn_not_visited(node)
837 #define set_irn_link(node, link) _set_irn_link(node, link)
838 #define get_irn_link(node) _get_irn_link(node)
839 #define get_irn_pinned(node) _get_irn_pinned(node)
840 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
841 #define is_unop(node) _is_unop(node)
842 #define is_binop(node) _is_binop(node)
843 #define is_Const(node) _is_Const(node)
844 #define is_Unknown(node) _is_Unknown(node)
845 #define is_Return(node) _is_Return(node)
846 #define is_Call(node) _is_Call(node)
847 #define is_Sel(node) _is_Sel(node)
848 #define is_Mux(node) _is_Mux(node)
849 #define is_Load(node) _is_Load(node)
850 #define is_Sync(node) _is_Sync(node)
851 #define is_Confirm(node) _is_Confirm(node)
852 #define is_Bad(node) _is_Bad(node)
853 #define is_no_Block(node) _is_no_Block(node)
854 #define is_Block(node) _is_Block(node)
855 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
856 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
857 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
858 #define get_Block_block_visited(node) _get_Block_block_visited(node)
859 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
860 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
861 #define Block_not_block_visited(node) _Block_not_block_visited(node)
862 #define set_Block_dead(block) _set_Block_dead(block)
863 #define is_Block_dead(block) _is_Block_dead(block)
864 #define get_Const_tarval(node) _get_Const_tarval(node)
865 #define classify_Const(node) _classify_Const(node)
866 #define is_irn_forking(node) _is_irn_forking(node)
867 #define get_irn_type(node) _get_irn_type(node)
868 #define get_irn_type_attr(node) _get_irn_type_attr(node)
869 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
870 #define is_irn_constlike(node) _is_irn_constlike(node)
871 #define is_irn_always_opt(node) _is_irn_always_opt(node)
872 #define is_irn_keep(node) _is_irn_keep(node)
873 #define is_irn_machine_op(node) _is_irn_machine_op(node)
874 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
875 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
876 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
877 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
878 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
879 #define get_irn_idx(node) _get_irn_idx(node)
881 #endif /* _IRNODE_T_H_ */