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"
33 #include "irgraph_t.h"
35 #include "firm_common_t.h"
39 * Returns the array with the ins. The content of the array may not be
41 * Note that this function returns the whole in array including the
42 * block predecessor. So, it is NOT symmetric with set_irn_in().
44 ir_node **get_irn_in (const ir_node *node);
47 /** access attributes directly */
48 const_attr *get_irn_const_attr (ir_node *node);
49 long get_irn_proj_attr (ir_node *node);
50 alloc_attr *get_irn_alloc_attr (ir_node *node);
51 free_attr *get_irn_free_attr (ir_node *node);
52 symconst_attr *get_irn_symconst_attr (ir_node *node);
53 ir_type *get_irn_call_attr (ir_node *node);
54 ir_type *get_irn_funccall_attr (ir_node *node);
55 sel_attr *get_irn_sel_attr (ir_node *node);
56 int get_irn_phi0_attr (ir_node *node);
57 block_attr *get_irn_block_attr (ir_node *node);
58 load_attr *get_irn_load_attr (ir_node *node);
59 store_attr *get_irn_store_attr (ir_node *node);
60 except_attr *get_irn_except_attr (ir_node *node);
64 * The amount of additional space for custom data to be allocated upon creating a new node.
66 extern unsigned firm_add_node_size;
69 * Sets the get_type operation for an ir_op_ops.
71 * @param code the opcode for the default operation
72 * @param ops the operations initialized
77 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
80 * Sets the get_type_attr operation for an ir_op_ops.
82 * @param code the opcode for the default operation
83 * @param ops the operations initialized
88 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
91 * Sets the get_entity_attr operation for an ir_op_ops.
93 * @param code the opcode for the default operation
94 * @param ops the operations initialized
99 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
101 /*-------------------------------------------------------------------*/
102 /* These function are most used in libfirm. Give them as static */
103 /* functions so they can be inlined. */
104 /*-------------------------------------------------------------------*/
107 * Checks whether a pointer points to a ir node.
108 * Intern version for libFirm.
111 _is_ir_node(const void *thing) {
112 return (get_kind(thing) == k_ir_node);
115 static INLINE ir_node *_get_nodes_block(const ir_node *node) {
116 assert(_is_ir_node(node));
117 return node->op->ops.get_block(node);
121 * Gets the op of a node.
122 * Intern version for libFirm.
124 static INLINE ir_op *
125 _get_irn_op(const ir_node *node) {
131 _set_irn_op(ir_node *node, ir_op *op) {
136 /** Copies all attributes stored in the old node to the new node.
137 Assumes both have the same opcode and sufficient size. */
139 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
140 ir_op *op = _get_irn_op(old_node);
142 /* must always exist */
143 op->ops.copy_attr(old_node, new_node);
147 * Gets the opcode of a node.
148 * Intern version for libFirm.
150 static INLINE unsigned
151 _get_irn_opcode(const ir_node *node) {
152 assert(k_ir_node == get_kind(node));
154 return node->op->code;
158 * Returns the number of predecessors without the block predecessor.
159 * Intern version for libFirm.
162 _get_irn_intra_arity(const ir_node *node) {
164 return ARR_LEN(node->in) - 1;
168 * Returns the number of predecessors without the block predecessor.
169 * Intern version for libFirm.
172 _get_irn_inter_arity(const ir_node *node) {
174 if (_get_irn_op(node) == op_Filter) {
175 assert(node->attr.filter.in_cg);
176 return ARR_LEN(node->attr.filter.in_cg) - 1;
177 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
178 return ARR_LEN(node->attr.block.in_cg) - 1;
180 return _get_irn_intra_arity(node);
184 * Returns the number of predecessors without the block predecessor.
185 * Intern version for libFirm.
187 extern int (*_get_irn_arity)(const ir_node *node);
190 * Intern version for libFirm.
192 static INLINE ir_node *
193 _get_irn_intra_n(const ir_node *node, int n) {
197 assert(-1 <= n && n < _get_irn_intra_arity(node));
199 nn = node->in[n + 1];
201 /* only block and Anchor inputs are allowed to be NULL */
202 assert((node->op == op_Anchor || n == -1) && "NULL input of a node");
205 if (nn->op != op_Id) return nn;
207 return (node->in[n + 1] = skip_Id(nn));
211 * Intern version for libFirm.
213 static INLINE ir_node*
214 _get_irn_inter_n(const ir_node *node, int n) {
215 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
217 /* handle Filter and Block specially */
218 if (_get_irn_op(node) == op_Filter) {
219 assert(node->attr.filter.in_cg);
220 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
221 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
222 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
225 return _get_irn_intra_n(node, n);
229 * Access to the predecessors of a node.
230 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
231 * to iterate including the Block predecessor iterate from i = -1 to
233 * If it is a block, the entry -1 is NULL.
234 * Intern version for libFirm.
236 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
238 static INLINE int _get_irn_deps(const ir_node *node) {
239 return node->deps ? ARR_LEN(node->deps) : 0;
242 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
243 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
244 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
245 return node->deps[pos];
249 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
252 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
253 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
254 old = node->deps[pos];
255 node->deps[pos] = dep;
256 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
261 _get_irn_ins_or_deps(const ir_node *irn) {
262 return _get_irn_deps(irn) + _get_irn_arity(irn);
265 static INLINE ir_node *
266 _get_irn_in_or_dep(const ir_node *irn, int pos) {
267 int n_in = get_irn_arity(irn);
268 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
272 * Gets the mode of a node.
273 * Intern version for libFirm.
275 static INLINE ir_mode *
276 _get_irn_mode(const ir_node *node) {
282 * Sets the mode of a node.
283 * Intern version of libFirm.
286 _set_irn_mode(ir_node *node, ir_mode *mode) {
292 * Gets the visited counter of a node.
293 * Intern version for libFirm.
295 static INLINE unsigned long
296 _get_irn_visited(const ir_node *node) {
298 return node->visited;
302 * Sets the visited counter of a node.
303 * Intern version for libFirm.
306 _set_irn_visited(ir_node *node, unsigned long visited) {
308 node->visited = visited;
312 * Mark a node as visited in a graph.
313 * Intern version for libFirm.
316 _mark_irn_visited(ir_node *node) {
318 node->visited = current_ir_graph->visited;
322 * Returns non-zero if a node of was visited.
323 * Intern version for libFirm.
326 _irn_visited(const ir_node *node) {
328 return (node->visited >= current_ir_graph->visited);
332 * Returns non-zero if a node of was NOT visited.
333 * Intern version for libFirm.
336 _irn_not_visited(const ir_node *node) {
338 return (node->visited < current_ir_graph->visited);
342 * Sets the link of a node.
343 * Intern version of libFirm.
346 _set_irn_link(ir_node *node, void *link) {
348 /* Link field is used for Phi construction and various optimizations
350 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
356 * Returns the link of a node.
357 * Intern version of libFirm.
360 _get_irn_link(const ir_node *node) {
361 assert(node && _is_ir_node(node));
366 * Returns whether the node _always_ must be pinned.
367 * I.e., the node is not floating after global cse.
369 * Intern version of libFirm.
371 static INLINE op_pin_state
372 _get_irn_pinned(const ir_node *node) {
374 assert(node && _is_ir_node(node));
376 state = _get_op_pinned(_get_irn_op(node));
378 if (state >= op_pin_state_exc_pinned)
379 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
383 static INLINE op_pin_state
384 _is_irn_pinned_in_irg(const ir_node *node) {
385 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
386 return get_irn_pinned(node);
387 return op_pin_state_pinned;
391 _is_unop(const ir_node *node) {
392 assert(node && _is_ir_node(node));
393 return (node->op->opar == oparity_unary);
397 _is_binop(const ir_node *node) {
398 assert(node && _is_ir_node(node));
399 return (node->op->opar == oparity_binary);
403 _is_Bad(const ir_node *node) {
405 return (_get_irn_op(node) == op_Bad);
409 _is_NoMem(const ir_node *node) {
411 return (_get_irn_op(node) == op_NoMem);
415 _is_Minus(const ir_node *node) {
417 return (_get_irn_op(node) == op_Minus);
421 _is_Mod(const ir_node *node) {
423 return (_get_irn_op(node) == op_Mod);
427 _is_Div(const ir_node *node) {
429 return (_get_irn_op(node) == op_Div);
433 _is_DivMod(const ir_node *node) {
435 return (_get_irn_op(node) == op_DivMod);
439 _is_Quot(const ir_node *node) {
441 return (_get_irn_op(node) == op_Quot);
445 _is_Add(const ir_node *node) {
447 return (_get_irn_op(node) == op_Add);
451 _is_And(const ir_node *node) {
453 return (_get_irn_op(node) == op_And);
457 _is_Or(const ir_node *node) {
459 return (_get_irn_op(node) == op_Or);
463 _is_Eor(const ir_node *node) {
465 return (_get_irn_op(node) == op_Eor);
469 _is_Sub(const ir_node *node) {
471 return (_get_irn_op(node) == op_Sub);
475 _is_Not(const ir_node *node) {
477 return (_get_irn_op(node) == op_Not);
481 _is_Psi(const ir_node *node) {
483 return (_get_irn_op(node) == op_Psi);
487 _is_Tuple(const ir_node *node) {
489 return (_get_irn_op(node) == op_Tuple);
493 _is_Start(const ir_node *node) {
495 return (_get_irn_op(node) == op_Start);
499 _is_End(const ir_node *node) {
501 return (_get_irn_op(node) == op_End);
505 _is_Const(const ir_node *node) {
507 return (_get_irn_op(node) == op_Const);
511 _is_Conv(const ir_node *node) {
513 return (_get_irn_op(node) == op_Conv);
517 _is_CopyB(const ir_node *node) {
519 return (_get_irn_op(node) == op_CopyB);
523 _is_Unknown(const ir_node *node) {
525 return (_get_irn_op(node) == op_Unknown);
529 _is_Return(const ir_node *node) {
531 return (_get_irn_op(node) == op_Return);
535 _is_Call(const ir_node *node) {
537 return (_get_irn_op(node) == op_Call);
541 _is_Sel(const ir_node *node) {
543 return (_get_irn_op(node) == op_Sel);
547 _is_Mul(const ir_node *node) {
549 return (_get_irn_op(node) == op_Mul);
553 _is_Mux(const ir_node *node) {
556 ir_op *op = _get_irn_op(node);
557 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
563 _is_Load(const ir_node *node) {
565 return (_get_irn_op(node) == op_Load);
569 _is_Store(const ir_node *node) {
571 return (_get_irn_op(node) == op_Store);
575 _is_Sync(const ir_node *node) {
577 return (_get_irn_op(node) == op_Sync);
581 _is_Confirm(const ir_node *node) {
583 return (_get_irn_op(node) == op_Confirm);
587 _is_Pin(const ir_node *node) {
589 return (_get_irn_op(node) == op_Pin);
593 _is_SymConst(const ir_node *node) {
595 return (_get_irn_op(node) == op_SymConst);
599 _is_Cond(const ir_node *node) {
601 return (_get_irn_op(node) == op_Cond);
605 _is_Cmp(const ir_node *node) {
607 return (_get_irn_op(node) == op_Cmp);
611 _is_Alloc(const ir_node *node) {
613 return (_get_irn_op(node) == op_Alloc);
617 _is_Jmp(const ir_node *node) {
619 return (_get_irn_op(node) == op_Jmp);
623 _is_Raise(const ir_node *node) {
625 return (_get_irn_op(node) == op_Raise);
629 _is_ASM(const ir_node *node) {
631 return (_get_irn_op(node) == op_ASM);
635 _is_Anchor(const ir_node *node) {
636 return (_get_irn_op(node) == op_Anchor);
640 _is_no_Block(const ir_node *node) {
641 assert(node && _is_ir_node(node));
642 return (_get_irn_op(node) != op_Block);
646 _is_Block(const ir_node *node) {
647 assert(node && _is_ir_node(node));
648 return (_get_irn_op(node) == op_Block);
652 _get_Block_n_cfgpreds(const ir_node *node) {
653 assert(_is_Block(node));
654 return _get_irn_arity(node);
657 static INLINE ir_node *
658 _get_Block_cfgpred(ir_node *node, int pos) {
659 assert(0 <= pos && pos < get_irn_arity(node));
660 assert(_is_Block(node));
661 return _get_irn_n(node, pos);
664 /* Get the predecessor block.
666 * Returns the block corresponding to the predecessor pos.
668 * There are several ambiguities we resolve with this function:
669 * - The direct predecessor can be a Proj, which is not pinned.
670 * We walk from the predecessor to the next pinned node
671 * (skip_Proj) and return the block that node is in.
672 * - If we encounter the Bad node, this function does not return
673 * Start, but the Bad node.
675 static INLINE ir_node *
676 _get_Block_cfgpred_block(ir_node *node, int pos) {
677 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
679 res = get_nodes_block(res);
683 static INLINE unsigned long
684 _get_Block_block_visited(const ir_node *node) {
685 assert(node->op == op_Block);
686 return node->attr.block.block_visited;
690 _set_Block_block_visited(ir_node *node, unsigned long visit) {
691 assert(node->op == op_Block);
692 node->attr.block.block_visited = visit;
695 /* For this current_ir_graph must be set. */
697 _mark_Block_block_visited(ir_node *node) {
698 assert(node->op == op_Block);
699 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
703 _Block_not_block_visited(const ir_node *node) {
704 assert(node->op == op_Block);
705 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
709 _Block_block_visited(const ir_node *node) {
710 assert(node->op == op_Block);
711 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
714 static INLINE ir_node *
715 _set_Block_dead(ir_node *block) {
716 assert(_get_irn_op(block) == op_Block);
717 block->attr.block.is_dead = 1;
722 _is_Block_dead(const ir_node *block) {
723 ir_op *op = _get_irn_op(block);
728 assert(op == op_Block);
729 return block->attr.block.is_dead;
733 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
734 assert(_get_irn_op(node) == op_Const);
735 return node->attr.con.tv;
738 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
740 assert(_is_ir_node(node));
742 op = _get_irn_op(node);
745 return classify_tarval(_get_Const_tarval(node));
746 else if(op == op_SymConst)
747 return CNST_SYMCONST;
749 return CNST_NO_CONST;
752 static INLINE int _is_irn_forking(const ir_node *node) {
753 return is_op_forking(_get_irn_op(node));
756 static INLINE ir_type *_get_irn_type(ir_node *node) {
757 return _get_irn_op(node)->ops.get_type(node);
760 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
761 return _get_irn_op(node)->ops.get_type_attr(node);
764 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
765 return _get_irn_op(node)->ops.get_entity_attr(node);
768 static INLINE int _is_irn_constlike(const ir_node *node) {
769 return is_op_constlike(_get_irn_op(node));
772 static INLINE int _is_irn_always_opt(const ir_node *node) {
773 return is_op_always_opt(_get_irn_op(node));
776 static INLINE int _is_irn_keep(const ir_node *node) {
777 return is_op_keep(_get_irn_op(node));
780 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
781 return is_op_start_block_placed(_get_irn_op(node));
784 static INLINE int _is_irn_machine_op(const ir_node *node) {
785 return is_op_machine(_get_irn_op(node));
788 static INLINE int _is_irn_machine_operand(const ir_node *node) {
789 return is_op_machine_operand(_get_irn_op(node));
792 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
793 return is_op_machine_user(_get_irn_op(node), n);
796 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
797 assert(_get_irn_op(node) == op_Cond);
798 return node->attr.cond.pred;
801 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
802 assert(_get_irn_op(node) == op_Cond);
803 node->attr.cond.pred = pred;
806 static INLINE int _get_Psi_n_conds(ir_node *node) {
807 assert(_get_irn_op(node) == op_Psi);
808 return _get_irn_arity(node) >> 1;
811 static INLINE void *_get_irn_generic_attr(ir_node *node) {
815 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
819 static INLINE unsigned _get_irn_idx(const ir_node *node) {
820 return node->node_idx;
823 static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) {
825 } /* get_irn_dbg_info */
827 static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
831 /* this section MUST contain all inline functions */
832 #define is_ir_node(thing) _is_ir_node(thing)
833 #define get_nodes_block(node) _get_nodes_block(node)
834 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
835 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
836 #define get_irn_arity(node) _get_irn_arity(node)
837 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
838 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
839 #define get_irn_n(node, n) _get_irn_n(node, n)
840 #define get_irn_mode(node) _get_irn_mode(node)
841 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
842 #define get_irn_op(node) _get_irn_op(node)
843 #define set_irn_op(node, op) _set_irn_op(node, op)
844 #define get_irn_opcode(node) _get_irn_opcode(node)
845 #define get_irn_visited(node) _get_irn_visited(node)
846 #define set_irn_visited(node, v) _set_irn_visited(node, v)
847 #define mark_irn_visited(node) _mark_irn_visited(node)
848 #define irn_visited(node) _irn_visited(node)
849 #define irn_not_visited(node) _irn_not_visited(node)
850 #define set_irn_link(node, link) _set_irn_link(node, link)
851 #define get_irn_link(node) _get_irn_link(node)
852 #define get_irn_pinned(node) _get_irn_pinned(node)
853 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
854 #define is_unop(node) _is_unop(node)
855 #define is_binop(node) _is_binop(node)
856 #define is_Const(node) _is_Const(node)
857 #define is_Conv(node) _is_Conv(node)
858 #define is_Unknown(node) _is_Unknown(node)
859 #define is_Return(node) _is_Return(node)
860 #define is_Call(node) _is_Call(node)
861 #define is_Sel(node) _is_Sel(node)
862 #define is_Mul(node) _is_Mul(node)
863 #define is_Mux(node) _is_Mux(node)
864 #define is_Load(node) _is_Load(node)
865 #define is_Sync(node) _is_Sync(node)
866 #define is_Confirm(node) _is_Confirm(node)
867 #define is_Pin(node) _is_Pin(node)
868 #define is_SymConst(node) _is_SymConst(node)
869 #define is_Cond(node) _is_Cond(node)
870 #define is_CopyB(node) _is_CopyB(node)
871 #define is_Cmp(node) _is_Cmp(node)
872 #define is_Alloc(node) _is_Alloc(node)
873 #define is_Jmp(node) _is_Jmp(node)
874 #define is_Raise(node) _is_Raise(node)
875 #define is_ASM(node) _is_ASM(node)
876 #define is_Anchor(node) _is_Anchor(node)
877 #define is_Bad(node) _is_Bad(node)
878 #define is_NoMem(node) _is_NoMem(node)
879 #define is_Start(node) _is_Start(node)
880 #define is_End(node) _is_End(node)
881 #define is_Minus(node) _is_Minus(node)
882 #define is_Mod(node) _is_Mod(node)
883 #define is_Div(node) _is_Div(node)
884 #define is_DivMod(node) _is_DivMod(node)
885 #define is_Quot(node) _is_Quot(node)
886 #define is_Add(node) _is_Add(node)
887 #define is_And(node) _is_And(node)
888 #define is_Or(node) _is_Or(node)
889 #define is_Eor(node) _is_Eor(node)
890 #define is_Sub(node) _is_Sub(node)
891 #define is_Not(node) _is_Not(node)
892 #define is_Psi(node) _is_Psi(node)
893 #define is_Tuple(node) _is_Tuple(node)
894 #define is_no_Block(node) _is_no_Block(node)
895 #define is_Block(node) _is_Block(node)
896 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
897 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
898 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
899 #define get_Block_block_visited(node) _get_Block_block_visited(node)
900 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
901 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
902 #define Block_not_block_visited(node) _Block_not_block_visited(node)
903 #define Block_block_visited(node) _Block_block_visited(node)
904 #define set_Block_dead(block) _set_Block_dead(block)
905 #define is_Block_dead(block) _is_Block_dead(block)
906 #define get_Const_tarval(node) _get_Const_tarval(node)
907 #define classify_Const(node) _classify_Const(node)
908 #define is_irn_forking(node) _is_irn_forking(node)
909 #define get_irn_type(node) _get_irn_type(node)
910 #define get_irn_type_attr(node) _get_irn_type_attr(node)
911 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
912 #define is_irn_constlike(node) _is_irn_constlike(node)
913 #define is_irn_always_opt(node) _is_irn_always_opt(node)
914 #define is_irn_keep(node) _is_irn_keep(node)
915 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
916 #define is_irn_machine_op(node) _is_irn_machine_op(node)
917 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
918 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
919 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
920 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
921 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
922 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
923 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
924 #define get_irn_idx(node) _get_irn_idx(node)
926 #define get_irn_deps(node) _get_irn_deps(node)
927 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
928 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
930 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
931 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
933 #define get_irn_dbg_info(node) _get_irn_dbg_info(node)
934 #define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)