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);
116 * Gets the op of a node.
117 * Intern version for libFirm.
119 static INLINE ir_op *
120 _get_irn_op(const ir_node *node) {
126 _set_irn_op(ir_node *node, ir_op *op) {
131 /** Copies all attributes stored in the old node to the new node.
132 Assumes both have the same opcode and sufficient size. */
134 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
135 ir_op *op = _get_irn_op(old_node);
137 /* must always exist */
138 op->ops.copy_attr(old_node, new_node);
142 * Gets the opcode of a node.
143 * Intern version for libFirm.
145 static INLINE unsigned
146 _get_irn_opcode(const ir_node *node) {
147 assert(k_ir_node == get_kind(node));
149 return node->op->code;
153 * Returns the number of predecessors without the block predecessor.
154 * Intern version for libFirm.
157 _get_irn_intra_arity(const ir_node *node) {
159 return ARR_LEN(node->in) - 1;
163 * Returns the number of predecessors without the block predecessor.
164 * Intern version for libFirm.
167 _get_irn_inter_arity(const ir_node *node) {
169 if (_get_irn_op(node) == op_Filter) {
170 assert(node->attr.filter.in_cg);
171 return ARR_LEN(node->attr.filter.in_cg) - 1;
172 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
173 return ARR_LEN(node->attr.block.in_cg) - 1;
175 return _get_irn_intra_arity(node);
179 * Returns the number of predecessors without the block predecessor.
180 * Intern version for libFirm.
182 extern int (*_get_irn_arity)(const ir_node *node);
185 * Intern version for libFirm.
187 static INLINE ir_node *
188 _get_irn_intra_n(const ir_node *node, int n) {
192 assert(-1 <= n && n < _get_irn_intra_arity(node));
194 nn = node->in[n + 1];
196 /* only block and Anchor inputs are allowed to be NULL */
197 assert((node->op == op_Anchor || n == -1) && "NULL input of a node");
200 if (nn->op != op_Id) return nn;
202 return (node->in[n + 1] = skip_Id(nn));
206 * Intern version for libFirm.
208 static INLINE ir_node*
209 _get_irn_inter_n(const ir_node *node, int n) {
210 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
212 /* handle Filter and Block specially */
213 if (_get_irn_op(node) == op_Filter) {
214 assert(node->attr.filter.in_cg);
215 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
216 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
217 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
220 return _get_irn_intra_n(node, n);
224 * Access to the predecessors of a node.
225 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
226 * to iterate including the Block predecessor iterate from i = -1 to
228 * If it is a block, the entry -1 is NULL.
229 * Intern version for libFirm.
231 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
233 static INLINE int _get_irn_deps(const ir_node *node) {
234 return node->deps ? ARR_LEN(node->deps) : 0;
237 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
238 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
239 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
240 return node->deps[pos];
244 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
247 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
248 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
249 old = node->deps[pos];
250 node->deps[pos] = dep;
251 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
256 _get_irn_ins_or_deps(const ir_node *irn) {
257 return _get_irn_deps(irn) + _get_irn_arity(irn);
260 static INLINE ir_node *
261 _get_irn_in_or_dep(const ir_node *irn, int pos) {
262 int n_in = get_irn_arity(irn);
263 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
267 * Gets the mode of a node.
268 * Intern version for libFirm.
270 static INLINE ir_mode *
271 _get_irn_mode(const ir_node *node) {
277 * Sets the mode of a node.
278 * Intern version of libFirm.
281 _set_irn_mode(ir_node *node, ir_mode *mode) {
287 * Gets the visited counter of a node.
288 * Intern version for libFirm.
290 static INLINE unsigned long
291 _get_irn_visited(const ir_node *node) {
293 return node->visited;
297 * Sets the visited counter of a node.
298 * Intern version for libFirm.
301 _set_irn_visited(ir_node *node, unsigned long visited) {
303 node->visited = visited;
307 * Mark a node as visited in a graph.
308 * Intern version for libFirm.
311 _mark_irn_visited(ir_node *node) {
313 node->visited = current_ir_graph->visited;
317 * Returns non-zero if a node of was visited.
318 * Intern version for libFirm.
321 _irn_visited(const ir_node *node) {
323 return (node->visited >= current_ir_graph->visited);
327 * Returns non-zero if a node of was NOT visited.
328 * Intern version for libFirm.
331 _irn_not_visited(const ir_node *node) {
333 return (node->visited < current_ir_graph->visited);
337 * Sets the link of a node.
338 * Intern version of libFirm.
341 _set_irn_link(ir_node *node, void *link) {
343 /* Link field is used for Phi construction and various optimizations
345 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
351 * Returns the link of a node.
352 * Intern version of libFirm.
355 _get_irn_link(const ir_node *node) {
356 assert(node && _is_ir_node(node));
361 * Returns whether the node _always_ must be pinned.
362 * I.e., the node is not floating after global cse.
364 * Intern version of libFirm.
366 static INLINE op_pin_state
367 _get_irn_pinned(const ir_node *node) {
369 assert(node && _is_ir_node(node));
371 state = _get_op_pinned(_get_irn_op(node));
373 if (state >= op_pin_state_exc_pinned)
374 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
378 static INLINE op_pin_state
379 _is_irn_pinned_in_irg(const ir_node *node) {
380 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
381 return get_irn_pinned(node);
382 return op_pin_state_pinned;
386 _is_unop(const ir_node *node) {
387 assert(node && _is_ir_node(node));
388 return (node->op->opar == oparity_unary);
392 _is_binop(const ir_node *node) {
393 assert(node && _is_ir_node(node));
394 return (node->op->opar == oparity_binary);
398 _is_Bad(const ir_node *node) {
400 return (_get_irn_op(node) == op_Bad);
404 _is_NoMem(const ir_node *node) {
406 return (_get_irn_op(node) == op_NoMem);
410 _is_Minus(const ir_node *node) {
412 return (_get_irn_op(node) == op_Minus);
416 _is_Mod(const ir_node *node) {
418 return (_get_irn_op(node) == op_Mod);
422 _is_Div(const ir_node *node) {
424 return (_get_irn_op(node) == op_Div);
428 _is_DivMod(const ir_node *node) {
430 return (_get_irn_op(node) == op_DivMod);
434 _is_Quot(const ir_node *node) {
436 return (_get_irn_op(node) == op_Quot);
440 _is_Add(const ir_node *node) {
442 return (_get_irn_op(node) == op_Add);
446 _is_And(const ir_node *node) {
448 return (_get_irn_op(node) == op_And);
452 _is_Or(const ir_node *node) {
454 return (_get_irn_op(node) == op_Or);
458 _is_Eor(const ir_node *node) {
460 return (_get_irn_op(node) == op_Eor);
464 _is_Sub(const ir_node *node) {
466 return (_get_irn_op(node) == op_Sub);
470 _is_Not(const ir_node *node) {
472 return (_get_irn_op(node) == op_Not);
476 _is_Shl(const ir_node *node) {
478 return (_get_irn_op(node) == op_Shl);
482 _is_Shr(const ir_node *node) {
484 return (_get_irn_op(node) == op_Shr);
488 _is_Shrs(const ir_node *node) {
490 return (_get_irn_op(node) == op_Shrs);
494 _is_Rot(const ir_node *node) {
496 return (_get_irn_op(node) == op_Rot);
500 _is_Psi(const ir_node *node) {
502 return (_get_irn_op(node) == op_Psi);
506 _is_Tuple(const ir_node *node) {
508 return (_get_irn_op(node) == op_Tuple);
512 _is_Start(const ir_node *node) {
514 return (_get_irn_op(node) == op_Start);
518 _is_End(const ir_node *node) {
520 return (_get_irn_op(node) == op_End);
524 _is_Const(const ir_node *node) {
526 return (_get_irn_op(node) == op_Const);
530 _is_Conv(const ir_node *node) {
532 return (_get_irn_op(node) == op_Conv);
536 _is_Cast(const ir_node *node) {
538 return (_get_irn_op(node) == op_Cast);
542 _is_CopyB(const ir_node *node) {
544 return (_get_irn_op(node) == op_CopyB);
548 _is_Unknown(const ir_node *node) {
550 return (_get_irn_op(node) == op_Unknown);
554 _is_Return(const ir_node *node) {
556 return (_get_irn_op(node) == op_Return);
560 _is_Call(const ir_node *node) {
562 return (_get_irn_op(node) == op_Call);
566 _is_Sel(const ir_node *node) {
568 return (_get_irn_op(node) == op_Sel);
572 _is_Mul(const ir_node *node) {
574 return (_get_irn_op(node) == op_Mul);
578 _is_Mulh(const ir_node *node) {
580 return (_get_irn_op(node) == op_Mulh);
584 _is_Mux(const ir_node *node) {
587 ir_op *op = _get_irn_op(node);
588 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
594 _is_Load(const ir_node *node) {
596 return (_get_irn_op(node) == op_Load);
600 _is_Store(const ir_node *node) {
602 return (_get_irn_op(node) == op_Store);
606 _is_Sync(const ir_node *node) {
608 return (_get_irn_op(node) == op_Sync);
612 _is_Confirm(const ir_node *node) {
614 return (_get_irn_op(node) == op_Confirm);
618 _is_Pin(const ir_node *node) {
620 return (_get_irn_op(node) == op_Pin);
624 _is_SymConst(const ir_node *node) {
626 return (_get_irn_op(node) == op_SymConst);
630 _is_Cond(const ir_node *node) {
632 return (_get_irn_op(node) == op_Cond);
636 _is_Cmp(const ir_node *node) {
638 return (_get_irn_op(node) == op_Cmp);
642 _is_Alloc(const ir_node *node) {
644 return (_get_irn_op(node) == op_Alloc);
648 _is_Jmp(const ir_node *node) {
650 return (_get_irn_op(node) == op_Jmp);
654 _is_Raise(const ir_node *node) {
656 return (_get_irn_op(node) == op_Raise);
660 _is_ASM(const ir_node *node) {
662 return (_get_irn_op(node) == op_ASM);
666 _is_Anchor(const ir_node *node) {
667 return (_get_irn_op(node) == op_Anchor);
671 _is_no_Block(const ir_node *node) {
672 assert(node && _is_ir_node(node));
673 return (_get_irn_op(node) != op_Block);
677 _is_Block(const ir_node *node) {
678 assert(node && _is_ir_node(node));
679 return (_get_irn_op(node) == op_Block);
683 _get_Block_n_cfgpreds(const ir_node *node) {
684 assert(_is_Block(node));
685 return _get_irn_arity(node);
688 static INLINE ir_node *
689 _get_Block_cfgpred(ir_node *node, int pos) {
690 assert(0 <= pos && pos < get_irn_arity(node));
691 assert(_is_Block(node));
692 return _get_irn_n(node, pos);
695 /* Get the predecessor block.
697 * Returns the block corresponding to the predecessor pos.
699 * There are several ambiguities we resolve with this function:
700 * - The direct predecessor can be a Proj, which is not pinned.
701 * We walk from the predecessor to the next pinned node
702 * (skip_Proj) and return the block that node is in.
703 * - If we encounter the Bad node, this function does not return
704 * Start, but the Bad node.
706 static INLINE ir_node *
707 _get_Block_cfgpred_block(ir_node *node, int pos) {
708 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
710 res = get_nodes_block(res);
714 static INLINE unsigned long
715 _get_Block_block_visited(const ir_node *node) {
716 assert(node->op == op_Block);
717 return node->attr.block.block_visited;
721 _set_Block_block_visited(ir_node *node, unsigned long visit) {
722 assert(node->op == op_Block);
723 node->attr.block.block_visited = visit;
726 /* For this current_ir_graph must be set. */
728 _mark_Block_block_visited(ir_node *node) {
729 assert(node->op == op_Block);
730 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
734 _Block_not_block_visited(const ir_node *node) {
735 assert(node->op == op_Block);
736 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
740 _Block_block_visited(const ir_node *node) {
741 assert(node->op == op_Block);
742 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
745 static INLINE ir_node *
746 _set_Block_dead(ir_node *block) {
747 assert(_get_irn_op(block) == op_Block);
748 block->attr.block.is_dead = 1;
753 _is_Block_dead(const ir_node *block) {
754 ir_op *op = _get_irn_op(block);
759 assert(op == op_Block);
760 return block->attr.block.is_dead;
764 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
765 assert(_get_irn_op(node) == op_Const);
766 return node->attr.con.tv;
769 static INLINE int _is_Const_null(const ir_node *node) {
770 return tarval_is_null(_get_Const_tarval(node));
773 static INLINE int _is_Const_one(const ir_node *node) {
774 return tarval_is_one(_get_Const_tarval(node));
777 static INLINE int _is_Const_all_one(const ir_node *node) {
778 return tarval_is_all_one(_get_Const_tarval(node));
781 static INLINE int _is_irn_forking(const ir_node *node) {
782 return is_op_forking(_get_irn_op(node));
785 static INLINE ir_type *_get_irn_type(ir_node *node) {
786 return _get_irn_op(node)->ops.get_type(node);
789 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
790 return _get_irn_op(node)->ops.get_type_attr(node);
793 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
794 return _get_irn_op(node)->ops.get_entity_attr(node);
797 static INLINE int _is_irn_constlike(const ir_node *node) {
798 return is_op_constlike(_get_irn_op(node));
801 static INLINE int _is_irn_always_opt(const ir_node *node) {
802 return is_op_always_opt(_get_irn_op(node));
805 static INLINE int _is_irn_keep(const ir_node *node) {
806 return is_op_keep(_get_irn_op(node));
809 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
810 return is_op_start_block_placed(_get_irn_op(node));
813 static INLINE int _is_irn_machine_op(const ir_node *node) {
814 return is_op_machine(_get_irn_op(node));
817 static INLINE int _is_irn_machine_operand(const ir_node *node) {
818 return is_op_machine_operand(_get_irn_op(node));
821 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
822 return is_op_machine_user(_get_irn_op(node), n);
825 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
826 assert(_get_irn_op(node) == op_Cond);
827 return node->attr.cond.pred;
830 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
831 assert(_get_irn_op(node) == op_Cond);
832 node->attr.cond.pred = pred;
835 static INLINE int _get_Psi_n_conds(ir_node *node) {
836 assert(_get_irn_op(node) == op_Psi);
837 return _get_irn_arity(node) >> 1;
840 static INLINE void *_get_irn_generic_attr(ir_node *node) {
844 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
848 static INLINE unsigned _get_irn_idx(const ir_node *node) {
849 return node->node_idx;
852 static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) {
854 } /* get_irn_dbg_info */
856 static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
860 /* this section MUST contain all inline functions */
861 #define is_ir_node(thing) _is_ir_node(thing)
862 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
863 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
864 #define get_irn_arity(node) _get_irn_arity(node)
865 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
866 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
867 #define get_irn_n(node, n) _get_irn_n(node, n)
868 #define get_irn_mode(node) _get_irn_mode(node)
869 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
870 #define get_irn_op(node) _get_irn_op(node)
871 #define set_irn_op(node, op) _set_irn_op(node, op)
872 #define get_irn_opcode(node) _get_irn_opcode(node)
873 #define get_irn_visited(node) _get_irn_visited(node)
874 #define set_irn_visited(node, v) _set_irn_visited(node, v)
875 #define mark_irn_visited(node) _mark_irn_visited(node)
876 #define irn_visited(node) _irn_visited(node)
877 #define irn_not_visited(node) _irn_not_visited(node)
878 #define set_irn_link(node, link) _set_irn_link(node, link)
879 #define get_irn_link(node) _get_irn_link(node)
880 #define get_irn_pinned(node) _get_irn_pinned(node)
881 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
882 #define is_unop(node) _is_unop(node)
883 #define is_binop(node) _is_binop(node)
884 #define is_Const(node) _is_Const(node)
885 #define is_Conv(node) _is_Conv(node)
886 #define is_Cast(node) _is_Cast(node)
887 #define is_Unknown(node) _is_Unknown(node)
888 #define is_Return(node) _is_Return(node)
889 #define is_Call(node) _is_Call(node)
890 #define is_Sel(node) _is_Sel(node)
891 #define is_Mul(node) _is_Mul(node)
892 #define is_Mulh(node) _is_Mulh(node)
893 #define is_Mux(node) _is_Mux(node)
894 #define is_Load(node) _is_Load(node)
895 #define is_Sync(node) _is_Sync(node)
896 #define is_Confirm(node) _is_Confirm(node)
897 #define is_Pin(node) _is_Pin(node)
898 #define is_SymConst(node) _is_SymConst(node)
899 #define is_Cond(node) _is_Cond(node)
900 #define is_CopyB(node) _is_CopyB(node)
901 #define is_Cmp(node) _is_Cmp(node)
902 #define is_Alloc(node) _is_Alloc(node)
903 #define is_Jmp(node) _is_Jmp(node)
904 #define is_Raise(node) _is_Raise(node)
905 #define is_ASM(node) _is_ASM(node)
906 #define is_Anchor(node) _is_Anchor(node)
907 #define is_Bad(node) _is_Bad(node)
908 #define is_NoMem(node) _is_NoMem(node)
909 #define is_Start(node) _is_Start(node)
910 #define is_End(node) _is_End(node)
911 #define is_Minus(node) _is_Minus(node)
912 #define is_Mod(node) _is_Mod(node)
913 #define is_Div(node) _is_Div(node)
914 #define is_DivMod(node) _is_DivMod(node)
915 #define is_Quot(node) _is_Quot(node)
916 #define is_Add(node) _is_Add(node)
917 #define is_And(node) _is_And(node)
918 #define is_Or(node) _is_Or(node)
919 #define is_Eor(node) _is_Eor(node)
920 #define is_Sub(node) _is_Sub(node)
921 #define is_Not(node) _is_Not(node)
922 #define is_Shl(node) _is_Shl(node)
923 #define is_Shr(node) _is_Shr(node)
924 #define is_Shrs(node) _is_Shrs(node)
925 #define is_Rot(node) _is_Rot(node)
926 #define is_Psi(node) _is_Psi(node)
927 #define is_Tuple(node) _is_Tuple(node)
928 #define is_no_Block(node) _is_no_Block(node)
929 #define is_Block(node) _is_Block(node)
930 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
931 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
932 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
933 #define get_Block_block_visited(node) _get_Block_block_visited(node)
934 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
935 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
936 #define Block_not_block_visited(node) _Block_not_block_visited(node)
937 #define Block_block_visited(node) _Block_block_visited(node)
938 #define set_Block_dead(block) _set_Block_dead(block)
939 #define is_Block_dead(block) _is_Block_dead(block)
940 #define get_Const_tarval(node) _get_Const_tarval(node)
941 #define is_Const_null(node) _is_Const_null(node)
942 #define is_Const_one(node) _is_Const_one(node)
943 #define is_Const_all_one(node) _is_Const_all_one(node)
944 #define is_irn_forking(node) _is_irn_forking(node)
945 #define get_irn_type(node) _get_irn_type(node)
946 #define get_irn_type_attr(node) _get_irn_type_attr(node)
947 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
948 #define is_irn_constlike(node) _is_irn_constlike(node)
949 #define is_irn_always_opt(node) _is_irn_always_opt(node)
950 #define is_irn_keep(node) _is_irn_keep(node)
951 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
952 #define is_irn_machine_op(node) _is_irn_machine_op(node)
953 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
954 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
955 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
956 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
957 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
958 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
959 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
960 #define get_irn_idx(node) _get_irn_idx(node)
962 #define get_irn_deps(node) _get_irn_deps(node)
963 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
964 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
966 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
967 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
969 #define get_irn_dbg_info(node) _get_irn_dbg_info(node)
970 #define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)