2 * Copyright (C) 1995-2008 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);
178 #ifdef INTERPROCEDURAL_VIEW
180 * Returns the number of predecessors without the block predecessor.
181 * Intern version for libFirm.
183 extern int (*_get_irn_arity)(const ir_node *node);
187 #define _get_irn_arity(n) _get_irn_intra_arity(n)
191 * Intern version for libFirm.
193 static INLINE ir_node *
194 _get_irn_intra_n(const ir_node *node, int n) {
198 assert(-1 <= n && n < _get_irn_intra_arity(node));
200 nn = node->in[n + 1];
202 /* only block and Anchor inputs are allowed to be NULL */
203 assert((node->op == op_Anchor || n == -1) && "NULL input of a node");
206 if (nn->op != op_Id) return nn;
208 return (node->in[n + 1] = skip_Id(nn));
212 * Intern version for libFirm.
214 static INLINE ir_node*
215 _get_irn_inter_n(const ir_node *node, int n) {
216 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
218 /* handle Filter and Block specially */
219 if (_get_irn_op(node) == op_Filter) {
220 assert(node->attr.filter.in_cg);
221 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
222 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
223 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
226 return _get_irn_intra_n(node, n);
230 * returns a hash value for a node
232 static INLINE unsigned hash_irn(const ir_node *node)
234 return (unsigned) get_irn_idx(node);
238 * Access to the predecessors of a node.
239 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
240 * to iterate including the Block predecessor iterate from i = -1 to
242 * If it is a block, the entry -1 is NULL.
243 * Intern version for libFirm.
245 #ifdef INTERPROCEDURAL_VIEW
246 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
248 #define _get_irn_n(n,i) _get_irn_intra_n(n,i)
251 static INLINE int _get_irn_deps(const ir_node *node) {
252 return node->deps ? ARR_LEN(node->deps) : 0;
255 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
256 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
257 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
258 return node->deps[pos];
262 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
265 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
266 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
267 old = node->deps[pos];
268 node->deps[pos] = dep;
269 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
274 _get_irn_ins_or_deps(const ir_node *irn) {
275 return _get_irn_deps(irn) + _get_irn_arity(irn);
278 static INLINE ir_node *
279 _get_irn_in_or_dep(const ir_node *irn, int pos) {
280 int n_in = get_irn_arity(irn);
281 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
285 * Gets the mode of a node.
286 * Intern version for libFirm.
288 static INLINE ir_mode *
289 _get_irn_mode(const ir_node *node) {
295 * Sets the mode of a node.
296 * Intern version of libFirm.
299 _set_irn_mode(ir_node *node, ir_mode *mode) {
305 * Gets the visited counter of a node.
306 * Intern version for libFirm.
308 static INLINE unsigned long
309 _get_irn_visited(const ir_node *node) {
311 return node->visited;
315 * Sets the visited counter of a node.
316 * Intern version for libFirm.
319 _set_irn_visited(ir_node *node, unsigned long visited) {
321 node->visited = visited;
325 * Mark a node as visited in a graph.
326 * Intern version for libFirm.
329 _mark_irn_visited(ir_node *node) {
331 node->visited = current_ir_graph->visited;
335 * Returns non-zero if a node of was visited.
336 * Intern version for libFirm.
339 _irn_visited(const ir_node *node) {
341 return (node->visited >= current_ir_graph->visited);
345 * Returns non-zero if a node of was NOT visited.
346 * Intern version for libFirm.
349 _irn_not_visited(const ir_node *node) {
351 return (node->visited < current_ir_graph->visited);
355 * Sets the link of a node.
356 * Intern version of libFirm.
359 _set_irn_link(ir_node *node, void *link) {
361 /* Link field is used for Phi construction and various optimizations
363 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
369 * Returns the link of a node.
370 * Intern version of libFirm.
373 _get_irn_link(const ir_node *node) {
374 assert(node && _is_ir_node(node));
379 * Returns whether the node _always_ must be pinned.
380 * I.e., the node is not floating after global cse.
382 * Intern version of libFirm.
384 static INLINE op_pin_state
385 _get_irn_pinned(const ir_node *node) {
387 assert(node && _is_ir_node(node));
389 state = _get_op_pinned(_get_irn_op(node));
391 if (state >= op_pin_state_exc_pinned)
392 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
396 static INLINE op_pin_state
397 _is_irn_pinned_in_irg(const ir_node *node) {
398 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
399 return get_irn_pinned(node);
400 return op_pin_state_pinned;
404 _is_unop(const ir_node *node) {
405 assert(node && _is_ir_node(node));
406 return (node->op->opar == oparity_unary);
410 _is_binop(const ir_node *node) {
411 assert(node && _is_ir_node(node));
412 return (node->op->opar == oparity_binary);
416 _is_Phi(const ir_node *node) {
420 op = get_irn_op(node);
421 #ifdef INTERPROCEDURAL_VIEW
422 if (op == op_Filter) return get_interprocedural_view();
424 return (op == op_Phi);
428 _is_Proj(const ir_node *node) {
430 return (_get_irn_op(node) == op_Proj);
434 _is_Bad(const ir_node *node) {
436 return (_get_irn_op(node) == op_Bad);
440 _is_NoMem(const ir_node *node) {
442 return (_get_irn_op(node) == op_NoMem);
446 _is_Minus(const ir_node *node) {
448 return (_get_irn_op(node) == op_Minus);
452 _is_Mod(const ir_node *node) {
454 return (_get_irn_op(node) == op_Mod);
458 _is_Div(const ir_node *node) {
460 return (_get_irn_op(node) == op_Div);
464 _is_DivMod(const ir_node *node) {
466 return (_get_irn_op(node) == op_DivMod);
470 _is_Quot(const ir_node *node) {
472 return (_get_irn_op(node) == op_Quot);
476 _is_Add(const ir_node *node) {
478 return (_get_irn_op(node) == op_Add);
482 _is_And(const ir_node *node) {
484 return (_get_irn_op(node) == op_And);
488 _is_Or(const ir_node *node) {
490 return (_get_irn_op(node) == op_Or);
494 _is_Eor(const ir_node *node) {
496 return (_get_irn_op(node) == op_Eor);
500 _is_Sub(const ir_node *node) {
502 return (_get_irn_op(node) == op_Sub);
506 _is_Not(const ir_node *node) {
508 return (_get_irn_op(node) == op_Not);
512 _is_Shl(const ir_node *node) {
514 return (_get_irn_op(node) == op_Shl);
518 _is_Shr(const ir_node *node) {
520 return (_get_irn_op(node) == op_Shr);
524 _is_Shrs(const ir_node *node) {
526 return (_get_irn_op(node) == op_Shrs);
530 _is_Rot(const ir_node *node) {
532 return (_get_irn_op(node) == op_Rot);
536 _is_Psi(const ir_node *node) {
538 return (_get_irn_op(node) == op_Psi);
542 _is_Tuple(const ir_node *node) {
544 return (_get_irn_op(node) == op_Tuple);
548 _is_Bound(const ir_node *node) {
550 return (_get_irn_op(node) == op_Bound);
554 _is_Start(const ir_node *node) {
556 return (_get_irn_op(node) == op_Start);
560 _is_End(const ir_node *node) {
562 return (_get_irn_op(node) == op_End);
566 _is_Const(const ir_node *node) {
568 return (_get_irn_op(node) == op_Const);
572 _is_Conv(const ir_node *node) {
574 return (_get_irn_op(node) == op_Conv);
578 _is_strictConv(const ir_node *node) {
579 return _is_Conv(node) && get_Conv_strict(node);
583 _is_Cast(const ir_node *node) {
585 return (_get_irn_op(node) == op_Cast);
589 _is_CopyB(const ir_node *node) {
591 return (_get_irn_op(node) == op_CopyB);
595 _is_Unknown(const ir_node *node) {
597 return (_get_irn_op(node) == op_Unknown);
601 _is_Return(const ir_node *node) {
603 return (_get_irn_op(node) == op_Return);
607 _is_Call(const ir_node *node) {
609 return (_get_irn_op(node) == op_Call);
613 _is_Sel(const ir_node *node) {
615 return (_get_irn_op(node) == op_Sel);
619 _is_Mul(const ir_node *node) {
621 return (_get_irn_op(node) == op_Mul);
625 _is_Mulh(const ir_node *node) {
627 return (_get_irn_op(node) == op_Mulh);
631 _is_Mux(const ir_node *node) {
634 ir_op *op = _get_irn_op(node);
635 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
641 _is_Load(const ir_node *node) {
643 return (_get_irn_op(node) == op_Load);
647 _is_Store(const ir_node *node) {
649 return (_get_irn_op(node) == op_Store);
653 _is_Sync(const ir_node *node) {
655 return (_get_irn_op(node) == op_Sync);
659 _is_Confirm(const ir_node *node) {
661 return (_get_irn_op(node) == op_Confirm);
665 _is_Pin(const ir_node *node) {
667 return (_get_irn_op(node) == op_Pin);
671 _is_SymConst(const ir_node *node) {
673 return (_get_irn_op(node) == op_SymConst);
677 _is_SymConst_addr_ent(const ir_node *node) {
678 return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
682 _is_Cond(const ir_node *node) {
684 return (_get_irn_op(node) == op_Cond);
688 _is_Cmp(const ir_node *node) {
690 return (_get_irn_op(node) == op_Cmp);
694 _is_Alloc(const ir_node *node) {
696 return (_get_irn_op(node) == op_Alloc);
700 _is_Jmp(const ir_node *node) {
702 return (_get_irn_op(node) == op_Jmp);
706 _is_Raise(const ir_node *node) {
708 return (_get_irn_op(node) == op_Raise);
712 _is_ASM(const ir_node *node) {
714 return (_get_irn_op(node) == op_ASM);
718 _is_Anchor(const ir_node *node) {
719 return (_get_irn_op(node) == op_Anchor);
723 _is_no_Block(const ir_node *node) {
724 assert(node && _is_ir_node(node));
725 return (_get_irn_op(node) != op_Block);
729 _is_Block(const ir_node *node) {
730 assert(node && _is_ir_node(node));
731 return (_get_irn_op(node) == op_Block);
735 _get_Block_n_cfgpreds(const ir_node *node) {
736 assert(_is_Block(node));
737 return _get_irn_arity(node);
740 static INLINE ir_node *
741 _get_Block_cfgpred(const ir_node *node, int pos) {
742 assert(0 <= pos && pos < get_irn_arity(node));
743 assert(_is_Block(node));
744 return _get_irn_n(node, pos);
747 /* Get the predecessor block.
749 * Returns the block corresponding to the predecessor pos.
751 * There are several ambiguities we resolve with this function:
752 * - The direct predecessor can be a Proj, which is not pinned.
753 * We walk from the predecessor to the next pinned node
754 * (skip_Proj) and return the block that node is in.
755 * - If we encounter the Bad node, this function does not return
756 * Start, but the Bad node.
758 static INLINE ir_node *
759 _get_Block_cfgpred_block(const ir_node *node, int pos) {
760 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
762 res = get_nodes_block(res);
766 static INLINE unsigned long
767 _get_Block_block_visited(const ir_node *node) {
768 assert(node->op == op_Block);
769 return node->attr.block.block_visited;
773 _set_Block_block_visited(ir_node *node, unsigned long visit) {
774 assert(node->op == op_Block);
775 node->attr.block.block_visited = visit;
778 /* For this current_ir_graph must be set. */
780 _mark_Block_block_visited(ir_node *node) {
781 assert(node->op == op_Block);
782 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
786 _Block_not_block_visited(const ir_node *node) {
787 assert(node->op == op_Block);
788 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
792 _Block_block_visited(const ir_node *node) {
793 assert(node->op == op_Block);
794 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
797 static INLINE ir_node *
798 _set_Block_dead(ir_node *block) {
799 assert(_get_irn_op(block) == op_Block);
800 block->attr.block.is_dead = 1;
805 _is_Block_dead(const ir_node *block) {
806 ir_op *op = _get_irn_op(block);
811 assert(op == op_Block);
812 return block->attr.block.is_dead;
816 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
817 assert(_get_irn_op(node) == op_Const);
818 return node->attr.con.tv;
821 static INLINE int _is_Const_null(const ir_node *node) {
822 return tarval_is_null(_get_Const_tarval(node));
825 static INLINE int _is_Const_one(const ir_node *node) {
826 return tarval_is_one(_get_Const_tarval(node));
829 static INLINE int _is_Const_all_one(const ir_node *node) {
830 return tarval_is_all_one(_get_Const_tarval(node));
833 static INLINE int _is_irn_forking(const ir_node *node) {
834 return is_op_forking(_get_irn_op(node));
837 static INLINE ir_type *_get_irn_type(ir_node *node) {
838 return _get_irn_op(node)->ops.get_type(node);
841 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
842 return _get_irn_op(node)->ops.get_type_attr(node);
845 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
846 return _get_irn_op(node)->ops.get_entity_attr(node);
849 static INLINE int _is_irn_constlike(const ir_node *node) {
850 return is_op_constlike(_get_irn_op(node));
853 static INLINE int _is_irn_always_opt(const ir_node *node) {
854 return is_op_always_opt(_get_irn_op(node));
857 static INLINE int _is_irn_keep(const ir_node *node) {
858 return is_op_keep(_get_irn_op(node));
861 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
862 return is_op_start_block_placed(_get_irn_op(node));
865 static INLINE int _is_irn_machine_op(const ir_node *node) {
866 return is_op_machine(_get_irn_op(node));
869 static INLINE int _is_irn_machine_operand(const ir_node *node) {
870 return is_op_machine_operand(_get_irn_op(node));
873 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
874 return is_op_machine_user(_get_irn_op(node), n);
877 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
878 assert(_get_irn_op(node) == op_Cond);
879 return node->attr.cond.pred;
882 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
883 assert(_get_irn_op(node) == op_Cond);
884 node->attr.cond.pred = pred;
887 static INLINE int _get_Psi_n_conds(const ir_node *node) {
888 assert(_get_irn_op(node) == op_Psi);
889 return _get_irn_arity(node) >> 1;
892 static INLINE void *_get_irn_generic_attr(ir_node *node) {
896 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
900 static INLINE unsigned _get_irn_idx(const ir_node *node) {
901 return node->node_idx;
904 static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) {
906 } /* get_irn_dbg_info */
908 static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) {
912 /* this section MUST contain all inline functions */
913 #define is_ir_node(thing) _is_ir_node(thing)
914 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
915 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
916 #define get_irn_arity(node) _get_irn_arity(node)
917 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
918 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
919 #define get_irn_n(node, n) _get_irn_n(node, n)
920 #define get_irn_mode(node) _get_irn_mode(node)
921 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
922 #define get_irn_op(node) _get_irn_op(node)
923 #define set_irn_op(node, op) _set_irn_op(node, op)
924 #define get_irn_opcode(node) _get_irn_opcode(node)
925 #define get_irn_visited(node) _get_irn_visited(node)
926 #define set_irn_visited(node, v) _set_irn_visited(node, v)
927 #define mark_irn_visited(node) _mark_irn_visited(node)
928 #define irn_visited(node) _irn_visited(node)
929 #define irn_not_visited(node) _irn_not_visited(node)
930 #define set_irn_link(node, link) _set_irn_link(node, link)
931 #define get_irn_link(node) _get_irn_link(node)
932 #define get_irn_pinned(node) _get_irn_pinned(node)
933 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
934 #define is_unop(node) _is_unop(node)
935 #define is_binop(node) _is_binop(node)
936 #define is_Proj(node) _is_Proj(node)
937 #define is_Phi(node) _is_Phi(node)
938 #define is_Const(node) _is_Const(node)
939 #define is_Conv(node) _is_Conv(node)
940 #define is_strictConv(node) _is_strictConv(node)
941 #define is_Cast(node) _is_Cast(node)
942 #define is_Unknown(node) _is_Unknown(node)
943 #define is_Return(node) _is_Return(node)
944 #define is_Call(node) _is_Call(node)
945 #define is_Sel(node) _is_Sel(node)
946 #define is_Mul(node) _is_Mul(node)
947 #define is_Mulh(node) _is_Mulh(node)
948 #define is_Mux(node) _is_Mux(node)
949 #define is_Load(node) _is_Load(node)
950 #define is_Sync(node) _is_Sync(node)
951 #define is_Confirm(node) _is_Confirm(node)
952 #define is_Pin(node) _is_Pin(node)
953 #define is_SymConst(node) _is_SymConst(node)
954 #define is_SymConst_addr_ent(node) _is_SymConst_addr_ent(node)
955 #define is_Cond(node) _is_Cond(node)
956 #define is_CopyB(node) _is_CopyB(node)
957 #define is_Cmp(node) _is_Cmp(node)
958 #define is_Alloc(node) _is_Alloc(node)
959 #define is_Jmp(node) _is_Jmp(node)
960 #define is_Raise(node) _is_Raise(node)
961 #define is_ASM(node) _is_ASM(node)
962 #define is_Anchor(node) _is_Anchor(node)
963 #define is_Bad(node) _is_Bad(node)
964 #define is_NoMem(node) _is_NoMem(node)
965 #define is_Start(node) _is_Start(node)
966 #define is_End(node) _is_End(node)
967 #define is_Minus(node) _is_Minus(node)
968 #define is_Mod(node) _is_Mod(node)
969 #define is_Div(node) _is_Div(node)
970 #define is_DivMod(node) _is_DivMod(node)
971 #define is_Quot(node) _is_Quot(node)
972 #define is_Add(node) _is_Add(node)
973 #define is_And(node) _is_And(node)
974 #define is_Or(node) _is_Or(node)
975 #define is_Eor(node) _is_Eor(node)
976 #define is_Sub(node) _is_Sub(node)
977 #define is_Not(node) _is_Not(node)
978 #define is_Shl(node) _is_Shl(node)
979 #define is_Shr(node) _is_Shr(node)
980 #define is_Shrs(node) _is_Shrs(node)
981 #define is_Rot(node) _is_Rot(node)
982 #define is_Psi(node) _is_Psi(node)
983 #define is_Tuple(node) _is_Tuple(node)
984 #define is_Bound(node) _is_Bound(node)
985 #define is_no_Block(node) _is_no_Block(node)
986 #define is_Block(node) _is_Block(node)
987 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
988 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
989 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
990 #define get_Block_block_visited(node) _get_Block_block_visited(node)
991 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
992 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
993 #define Block_not_block_visited(node) _Block_not_block_visited(node)
994 #define Block_block_visited(node) _Block_block_visited(node)
995 #define set_Block_dead(block) _set_Block_dead(block)
996 #define is_Block_dead(block) _is_Block_dead(block)
997 #define get_Const_tarval(node) _get_Const_tarval(node)
998 #define is_Const_null(node) _is_Const_null(node)
999 #define is_Const_one(node) _is_Const_one(node)
1000 #define is_Const_all_one(node) _is_Const_all_one(node)
1001 #define is_irn_forking(node) _is_irn_forking(node)
1002 #define get_irn_type(node) _get_irn_type(node)
1003 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1004 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1005 #define is_irn_constlike(node) _is_irn_constlike(node)
1006 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1007 #define is_irn_keep(node) _is_irn_keep(node)
1008 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1009 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1010 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1011 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1012 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1013 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1014 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1015 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
1016 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
1017 #define get_irn_idx(node) _get_irn_idx(node)
1019 #define get_irn_deps(node) _get_irn_deps(node)
1020 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1021 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1023 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1024 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
1026 #define get_irn_dbg_info(node) _get_irn_dbg_info(node)
1027 #define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db)