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
20 #ifndef _FIRM_IRNODE_T_H_
21 #define _FIRM_IRNODE_T_H_
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. */
32 #include "iredgekinds.h"
40 #include "irextbb_t.h"
43 /** ir node attributes **/
45 /** Block attributes */
47 /* General attributes */
48 ir_graph *irg; /**< The graph this block belongs to. */
49 unsigned long block_visited; /**< For the walker that walks over all blocks. */
50 /* Attributes private to construction: */
51 unsigned matured:1; /**< If set, all in-nodes of the block are fixed. */
52 unsigned dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
53 ir_node **graph_arr; /**< An array to store all parameters. */
54 /* Attributes holding analyses information */
55 ir_dom_info dom; /**< Datastructure that holds information about dominators.
57 Eventually overlay with graph_arr as only valid
58 in different phases. Eventually inline the whole
60 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
61 ir_node ** in_cg; /**< array with predecessors in
62 * interprocedural_view, if they differ
63 * from intraprocedural predecessors */
64 int *backedge; /**< Field n set to true if pred n is backedge.
65 @@@ @todo Ev. replace by bit field! */
66 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
67 @@@ @todo Ev. replace by bit field! */
68 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
69 ir_region *region; /**< The immediate structural region this block belongs to. */
71 struct list_head succ_head; /**< A list head for all successor edges of a block. */
74 /** Cond attributes. */
76 cond_kind kind; /**< flavor of Cond */
77 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
78 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
81 /** Const attributes. */
83 tarval *tv; /**< the target value */
84 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
87 /** SymConst attributes. */
89 symconst_symbol sym; // old tori
91 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
94 /** Sel attributes. */
96 ir_entity *ent; /**< entity to select */
99 /** Exception attributes. */
101 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
102 If it's know that no exception will be generated, could be set to
103 op_pin_state_floats. */
104 #if PRECISE_EXC_CONTEXT
105 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
109 /** Call attributes. */
111 except_attr exc; /**< the exception attribute. MUST be the first one. */
112 ir_type *cld_tp; /**< type of called procedure */
113 ir_entity ** callee_arr; /**< result of callee analysis */
116 /** Alloc attributes. */
118 except_attr exc; /**< the exception attribute. MUST be the first one. */
119 ir_type *type; /**< Type of the allocated object. */
120 where_alloc where; /**< stack, heap or other managed part of memory */
123 /** Free attributes. */
125 ir_type *type; /**< Type of the allocated object. */
126 where_alloc where; /**< stack, heap or other managed part of memory */
129 /** InstOf attributes. */
131 except_attr exc; /**< the exception attribute. MUST be the first one. */
132 ir_type *type; /**< the type of which the object pointer must be */
135 /** Filter attributes. */
137 long proj; /**< contains the result position to project (Proj) */
138 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
139 int *backedge; /**< Field n set to true if pred n is backedge.
140 @todo Ev. replace by bitfield! */
143 /** EndReg/EndExcept attributes. */
148 /** CallBegin attributes. */
150 ir_node * call; /**< Associated Call-operation. */
153 /** Cast attributes. */
155 ir_type *totype; /**< Type of the casted node. */
158 /** Load attributes. */
160 except_attr exc; /**< The exception attribute. MUST be the first one. */
161 ir_mode *load_mode; /**< The mode of this Load operation. */
162 ir_volatility volatility; /**< The volatility of a Load/Store operation. */
165 /** Store attributes. */
167 except_attr exc; /**< the exception attribute. MUST be the first one. */
168 ir_volatility volatility; /**< the volatility of a Store operation */
171 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
173 /** CopyB attribute. */
175 except_attr exc; /**< The exception attribute. MUST be the first one. */
176 ir_type *data_type; /**< Type of the copied entity. */
179 /** Bound attribute. */
181 except_attr exc; /**< The exception attribute. MUST be the first one. */
184 /** Conv attribute. */
186 char strict; /**< If set, this is a strict Conv that cannot be removed. */
189 /** Some IR-nodes just have one attribute, these are stored here,
190 some have more. Their name is 'irnodename_attr' */
192 block_attr block; /**< For Block: Fields needed to construct it */
193 cond_attr cond; /**< For Cond. */
194 const_attr con; /**< For Const: contains the value of the constant and a type */
195 symconst_attr symc; /**< For SymConst. */
196 sel_attr sel; /**< For Sel. */
197 call_attr call; /**< For Call: pointer to the type of the method to call */
198 callbegin_attr callbegin; /**< For CallBegin */
199 alloc_attr alloc; /**< For Alloc. */
200 free_attr free; /**< For Free. */
201 io_attr instof; /**< For InstOf */
202 cast_attr cast; /**< For Cast. */
203 load_attr load; /**< For Load. */
204 store_attr store; /**< For Store. */
205 int phi0_pos; /**< For Phi. Used to remember the value defined by
206 this Phi node. Needed when the Phi is completed
207 to call get_r_internal_value to find the
208 predecessors. If this attribute is set, the Phi
209 node takes the role of the obsolete Phi0 node,
210 therefore the name. */
211 int *phi_backedge; /**< For Phi after construction.
212 Field n set to true if pred n is backedge.
213 @todo Ev. replace by bitfield! */
214 long proj; /**< For Proj: contains the result position to project */
215 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
216 filter_attr filter; /**< For Filter */
217 end_attr end; /**< For EndReg, EndExcept */
218 except_attr except; /**< For Phi node construction in case of exceptions */
219 copyb_attr copyb; /**< For CopyB operation */
220 bound_attr bound; /**< For Bound operation */
221 conv_attr conv; /**< For Conv operation */
225 * Edge info to put into an irn.
227 typedef struct _irn_edge_kind_info_t {
228 struct list_head outs_head; /**< The list of all outs. */
229 int out_count; /**< Number of outs in the list. */
232 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
235 * The common structure of an irnode.
236 * If the node has some attributes, they are stored in the attr field.
239 /* ------- Basics of the representation ------- */
240 firm_kind kind; /**< Distinguishes this node from others. */
241 ir_op *op; /**< The Opcode of this node. */
242 ir_mode *mode; /**< The Mode of this node. */
243 struct ir_node **in; /**< The array of predecessors / operands. */
244 unsigned long visited; /**< The visited counter for walks of the graph. */
245 unsigned node_idx; /**< The node index of this node in its graph. */
246 void *link; /**< To attach additional information to the node, e.g.
247 used while construction to link Phi0 nodes and
248 during optimization to link to nodes that
249 shall replace a node. */
250 /* ------- Fields for optimizations / analysis information ------- */
251 struct ir_node **out; /**< @deprecated array of out edges. */
252 struct dbg_info *dbi; /**< A pointer to information for debug support. */
253 /* ------- For debugging ------- */
256 long node_nr; /**< A unique node number for each node to make output
259 /* ------- For analyses -------- */
260 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
261 #ifdef DO_HEAPANALYSIS
262 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
263 struct section *sec; /**< Heapanalysis: The section of this node. */
265 struct ir_node **deps; /**< Additional dependencies induced by state. */
266 irn_edges_info_t edge_info; /**< Everlasting out edges. */
267 /* ------- Opcode depending fields -------- */
268 attr attr; /**< The set of attributes of this node. Depends on opcode.
269 Must be last field of struct ir_node. */
274 * Returns the array with the ins. The content of the array may not be
276 * Note that this function returns the whole in array including the
277 * block predecessor. So, it is NOT symmetric with set_irn_in().
279 ir_node **get_irn_in (const ir_node *node);
282 /** access attributes directly */
283 const_attr get_irn_const_attr (ir_node *node);
284 long get_irn_proj_attr (ir_node *node);
285 alloc_attr get_irn_alloc_attr (ir_node *node);
286 free_attr get_irn_free_attr (ir_node *node);
287 symconst_attr get_irn_symconst_attr (ir_node *node);
288 ir_type *get_irn_call_attr (ir_node *node);
289 ir_type *get_irn_funccall_attr (ir_node *node);
290 sel_attr get_irn_sel_attr (ir_node *node);
291 int get_irn_phi_attr (ir_node *node);
292 block_attr get_irn_block_attr (ir_node *node);
293 load_attr get_irn_load_attr (ir_node *node);
294 store_attr get_irn_store_attr (ir_node *node);
295 except_attr get_irn_except_attr (ir_node *node);
299 * The amount of additional space for custom data to be allocated upon creating a new node.
301 extern unsigned firm_add_node_size;
304 * Sets the get_type operation for an ir_op_ops.
306 * @param code the opcode for the default operation
307 * @param ops the operations initialized
312 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
315 * Sets the get_type_attr operation for an ir_op_ops.
317 * @param code the opcode for the default operation
318 * @param ops the operations initialized
323 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
326 * Sets the get_entity_attr operation for an ir_op_ops.
328 * @param code the opcode for the default operation
329 * @param ops the operations initialized
334 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
336 /*-------------------------------------------------------------------*/
337 /* These function are most used in libfirm. Give them as static */
338 /* functions so they can be inlined. */
339 /*-------------------------------------------------------------------*/
342 * Checks whether a pointer points to a ir node.
343 * Intern version for libFirm.
346 _is_ir_node(const void *thing) {
347 return (get_kind(thing) == k_ir_node);
351 * Gets the op of a node.
352 * Intern version for libFirm.
354 static INLINE ir_op *
355 _get_irn_op(const ir_node *node) {
361 _set_irn_op(ir_node *node, ir_op *op) {
366 /** Copies all attributes stored in the old node to the new node.
367 Assumes both have the same opcode and sufficient size. */
369 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
370 ir_op *op = _get_irn_op(old_node);
372 /* must always exist */
373 op->ops.copy_attr(old_node, new_node);
377 * Gets the opcode of a node.
378 * Intern version for libFirm.
380 static INLINE ir_opcode
381 _get_irn_opcode(const ir_node *node) {
382 assert(k_ir_node == get_kind(node));
384 return node->op->code;
388 * Returns the number of predecessors without the block predecessor.
389 * Intern version for libFirm.
392 _get_irn_intra_arity(const ir_node *node) {
394 return ARR_LEN(node->in) - 1;
398 * Returns the number of predecessors without the block predecessor.
399 * Intern version for libFirm.
402 _get_irn_inter_arity(const ir_node *node) {
404 if (_get_irn_op(node) == op_Filter) {
405 assert(node->attr.filter.in_cg);
406 return ARR_LEN(node->attr.filter.in_cg) - 1;
407 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
408 return ARR_LEN(node->attr.block.in_cg) - 1;
410 return _get_irn_intra_arity(node);
414 * Returns the number of predecessors without the block predecessor.
415 * Intern version for libFirm.
417 extern int (*_get_irn_arity)(const ir_node *node);
420 * Intern version for libFirm.
422 static INLINE ir_node *
423 _get_irn_intra_n(const ir_node *node, int n) {
427 assert(-1 <= n && n < _get_irn_intra_arity(node));
429 nn = node->in[n + 1];
431 if (!nn || (nn->op != op_Id)) return nn;
433 return (node->in[n + 1] = skip_Id(nn));
437 * Intern version for libFirm.
439 static INLINE ir_node*
440 _get_irn_inter_n(const ir_node *node, int n) {
441 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
443 /* handle Filter and Block specially */
444 if (_get_irn_op(node) == op_Filter) {
445 assert(node->attr.filter.in_cg);
446 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
447 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
448 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
451 return _get_irn_intra_n(node, n);
455 * Access to the predecessors of a node.
456 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
457 * to iterate including the Block predecessor iterate from i = -1 to
459 * If it is a block, the entry -1 is NULL.
460 * Intern version for libFirm.
462 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
464 static INLINE int _get_irn_deps(const ir_node *node) {
465 return node->deps ? ARR_LEN(node->deps) : 0;
468 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
469 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
470 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
471 return node->deps[pos];
475 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
478 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
479 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
480 old = node->deps[pos];
481 node->deps[pos] = dep;
482 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
487 _get_irn_ins_or_deps(const ir_node *irn) {
488 return _get_irn_deps(irn) + _get_irn_arity(irn);
491 static INLINE ir_node *
492 _get_irn_in_or_dep(const ir_node *irn, int pos) {
493 int n_in = get_irn_arity(irn);
494 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
498 * Gets the mode of a node.
499 * Intern version for libFirm.
501 static INLINE ir_mode *
502 _get_irn_mode(const ir_node *node) {
508 * Sets the mode of a node.
509 * Intern version of libFirm.
512 _set_irn_mode(ir_node *node, ir_mode *mode) {
518 * Gets the visited counter of a node.
519 * Intern version for libFirm.
521 static INLINE unsigned long
522 _get_irn_visited(const ir_node *node) {
524 return node->visited;
528 * Sets the visited counter of a node.
529 * Intern version for libFirm.
532 _set_irn_visited(ir_node *node, unsigned long visited) {
534 node->visited = visited;
538 * Mark a node as visited in a graph.
539 * Intern version for libFirm.
542 _mark_irn_visited(ir_node *node) {
544 node->visited = current_ir_graph->visited;
548 * Returns non-zero if a node of was visited.
549 * Intern version for libFirm.
552 _irn_visited(const ir_node *node) {
554 return (node->visited >= current_ir_graph->visited);
558 * Returns non-zero if a node of was NOT visited.
559 * Intern version for libFirm.
562 _irn_not_visited(const ir_node *node) {
564 return (node->visited < current_ir_graph->visited);
568 * Sets the link of a node.
569 * Intern version of libFirm.
572 _set_irn_link(ir_node *node, void *link) {
574 /* Link field is used for Phi construction and various optimizations
576 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
582 * Returns the link of a node.
583 * Intern version of libFirm.
586 _get_irn_link(const ir_node *node) {
587 assert(node && _is_ir_node(node));
592 * Returns whether the node _always_ must be pinned.
593 * I.e., the node is not floating after global cse.
595 * Intern version of libFirm.
597 static INLINE op_pin_state
598 _get_irn_pinned(const ir_node *node) {
600 assert(node && _is_ir_node(node));
602 state = _get_op_pinned(_get_irn_op(node));
604 if (state >= op_pin_state_exc_pinned)
605 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
609 static INLINE op_pin_state
610 _is_irn_pinned_in_irg(const ir_node *node) {
611 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
612 return get_irn_pinned(node);
613 return op_pin_state_pinned;
617 _is_unop(const ir_node *node) {
618 assert(node && _is_ir_node(node));
619 return (node->op->opar == oparity_unary);
623 _is_binop(const ir_node *node) {
624 assert(node && _is_ir_node(node));
625 return (node->op->opar == oparity_binary);
629 _is_Bad(const ir_node *node) {
631 return (_get_irn_op(node) == op_Bad);
635 _is_NoMem(const ir_node *node) {
637 return (_get_irn_op(node) == op_NoMem);
641 _is_Mod(const ir_node *node) {
643 return (_get_irn_op(node) == op_Mod);
647 _is_Div(const ir_node *node) {
649 return (_get_irn_op(node) == op_Div);
653 _is_DivMod(const ir_node *node) {
655 return (_get_irn_op(node) == op_DivMod);
659 _is_Quot(const ir_node *node) {
661 return (_get_irn_op(node) == op_Quot);
665 _is_Start(const ir_node *node) {
667 return (_get_irn_op(node) == op_Start);
671 _is_End(const ir_node *node) {
673 return (_get_irn_op(node) == op_End);
677 _is_Const(const ir_node *node) {
679 return (_get_irn_op(node) == op_Const);
683 _is_CopyB(const ir_node *node) {
685 return (_get_irn_op(node) == op_CopyB);
689 _is_Unknown(const ir_node *node) {
691 return (_get_irn_op(node) == op_Unknown);
695 _is_Return(const ir_node *node) {
697 return (_get_irn_op(node) == op_Return);
701 _is_Call(const ir_node *node) {
703 return (_get_irn_op(node) == op_Call);
707 _is_Sel(const ir_node *node) {
709 return (_get_irn_op(node) == op_Sel);
713 _is_Mux(const ir_node *node) {
716 ir_op *op = _get_irn_op(node);
717 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
723 _is_Load(const ir_node *node) {
725 return (_get_irn_op(node) == op_Load);
729 _is_Store(const ir_node *node) {
731 return (_get_irn_op(node) == op_Store);
735 _is_Sync(const ir_node *node) {
737 return (_get_irn_op(node) == op_Sync);
741 _is_Confirm(const ir_node *node) {
743 return (_get_irn_op(node) == op_Confirm);
747 _is_Pin(const ir_node *node) {
749 return (_get_irn_op(node) == op_Pin);
753 _is_SymConst(const ir_node *node) {
755 return (_get_irn_op(node) == op_SymConst);
759 _is_Cond(const ir_node *node) {
761 return (_get_irn_op(node) == op_Cond);
765 _is_Cmp(const ir_node *node) {
767 return (_get_irn_op(node) == op_Cmp);
771 _is_Alloc(const ir_node *node) {
773 return (_get_irn_op(node) == op_Alloc);
777 _is_Jmp(const ir_node *node) {
779 return (_get_irn_op(node) == op_Jmp);
783 _is_Raise(const ir_node *node) {
785 return (_get_irn_op(node) == op_Raise);
789 _is_no_Block(const ir_node *node) {
790 assert(node && _is_ir_node(node));
791 return (_get_irn_op(node) != op_Block);
795 _is_Block(const ir_node *node) {
796 assert(node && _is_ir_node(node));
797 return (_get_irn_op(node) == op_Block);
801 _get_Block_n_cfgpreds(const ir_node *node) {
802 assert(_is_Block(node));
803 return _get_irn_arity(node);
806 static INLINE ir_node *
807 _get_Block_cfgpred(ir_node *node, int pos) {
808 assert(0 <= pos && pos < get_irn_arity(node));
809 assert(_is_Block(node));
810 return _get_irn_n(node, pos);
813 /* Get the predecessor block.
815 * Returns the block corresponding to the predecessor pos.
817 * There are several ambiguities we resolve with this function:
818 * - The direct predecessor can be a Proj, which is not pinned.
819 * We walk from the predecessor to the next pinned node
820 * (skip_Proj) and return the block that node is in.
821 * - If we encounter the Bad node, this function does not return
822 * Start, but the Bad node.
824 static INLINE ir_node *
825 _get_Block_cfgpred_block(ir_node *node, int pos) {
826 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
828 res = get_nodes_block(res);
832 static INLINE unsigned long
833 _get_Block_block_visited(const ir_node *node) {
834 assert(node->op == op_Block);
835 return node->attr.block.block_visited;
839 _set_Block_block_visited(ir_node *node, unsigned long visit) {
840 assert(node->op == op_Block);
841 node->attr.block.block_visited = visit;
844 /* For this current_ir_graph must be set. */
846 _mark_Block_block_visited(ir_node *node) {
847 assert(node->op == op_Block);
848 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
852 _Block_not_block_visited(const ir_node *node) {
853 assert(node->op == op_Block);
854 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
858 _Block_block_visited(const ir_node *node) {
859 assert(node->op == op_Block);
860 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
863 static INLINE ir_node *
864 _set_Block_dead(ir_node *block) {
865 assert(_get_irn_op(block) == op_Block);
866 block->attr.block.dead = 1;
871 _is_Block_dead(const ir_node *block) {
872 ir_op *op = _get_irn_op(block);
877 assert(op == op_Block);
878 return block->attr.block.dead;
882 static INLINE tarval *_get_Const_tarval(ir_node *node) {
883 assert(_get_irn_op(node) == op_Const);
884 return node->attr.con.tv;
887 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
889 assert(_is_ir_node(node));
891 op = _get_irn_op(node);
894 return classify_tarval(_get_Const_tarval(node));
895 else if(op == op_SymConst)
896 return CNST_SYMCONST;
898 return CNST_NO_CONST;
901 static INLINE int _is_irn_forking(const ir_node *node) {
902 return is_op_forking(_get_irn_op(node));
905 static INLINE ir_type *_get_irn_type(ir_node *node) {
906 return _get_irn_op(node)->ops.get_type(node);
909 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
910 return _get_irn_op(node)->ops.get_type_attr(node);
913 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
914 return _get_irn_op(node)->ops.get_entity_attr(node);
917 static INLINE int _is_irn_constlike(const ir_node *node) {
918 return is_op_constlike(_get_irn_op(node));
921 static INLINE int _is_irn_always_opt(const ir_node *node) {
922 return is_op_always_opt(_get_irn_op(node));
925 static INLINE int _is_irn_keep(const ir_node *node) {
926 return is_op_keep(_get_irn_op(node));
929 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
930 return is_op_start_block_placed(_get_irn_op(node));
933 static INLINE int _is_irn_machine_op(const ir_node *node) {
934 return is_op_machine(_get_irn_op(node));
937 static INLINE int _is_irn_machine_operand(const ir_node *node) {
938 return is_op_machine_operand(_get_irn_op(node));
941 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
942 return is_op_machine_user(_get_irn_op(node), n);
945 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
946 assert(_get_irn_op(node) == op_Cond);
947 return node->attr.cond.pred;
950 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
951 assert(_get_irn_op(node) == op_Cond);
952 node->attr.cond.pred = pred;
955 static INLINE int _get_Psi_n_conds(ir_node *node) {
956 assert(_get_irn_op(node) == op_Psi);
957 return _get_irn_arity(node) >> 1;
960 static INLINE unsigned _get_irn_idx(const ir_node *node) {
961 return node->node_idx;
964 /* this section MUST contain all inline functions */
965 #define is_ir_node(thing) _is_ir_node(thing)
966 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
967 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
968 #define get_irn_arity(node) _get_irn_arity(node)
969 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
970 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
971 #define get_irn_n(node, n) _get_irn_n(node, n)
972 #define get_irn_mode(node) _get_irn_mode(node)
973 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
974 #define get_irn_op(node) _get_irn_op(node)
975 #define set_irn_op(node, op) _set_irn_op(node, op)
976 #define get_irn_opcode(node) _get_irn_opcode(node)
977 #define get_irn_visited(node) _get_irn_visited(node)
978 #define set_irn_visited(node, v) _set_irn_visited(node, v)
979 #define mark_irn_visited(node) _mark_irn_visited(node)
980 #define irn_visited(node) _irn_visited(node)
981 #define irn_not_visited(node) _irn_not_visited(node)
982 #define set_irn_link(node, link) _set_irn_link(node, link)
983 #define get_irn_link(node) _get_irn_link(node)
984 #define get_irn_pinned(node) _get_irn_pinned(node)
985 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
986 #define is_unop(node) _is_unop(node)
987 #define is_binop(node) _is_binop(node)
988 #define is_Const(node) _is_Const(node)
989 #define is_Unknown(node) _is_Unknown(node)
990 #define is_Return(node) _is_Return(node)
991 #define is_Call(node) _is_Call(node)
992 #define is_Sel(node) _is_Sel(node)
993 #define is_Mux(node) _is_Mux(node)
994 #define is_Load(node) _is_Load(node)
995 #define is_Sync(node) _is_Sync(node)
996 #define is_Confirm(node) _is_Confirm(node)
997 #define is_Pin(node) _is_Pin(node)
998 #define is_SymConst(node) _is_SymConst(node)
999 #define is_Cond(node) _is_Cond(node)
1000 #define is_CopyB(node) _is_CopyB(node)
1001 #define is_Cmp(node) _is_Cmp(node)
1002 #define is_Alloc(node) _is_Alloc(node)
1003 #define is_Jmp(node) _is_Jmp(node)
1004 #define is_Raise(node) _is_Raise(node)
1005 #define is_Bad(node) _is_Bad(node)
1006 #define is_NoMem(node) _is_NoMem(node)
1007 #define is_Start(node) _is_Start(node)
1008 #define is_End(node) _is_End(node)
1009 #define is_Mod(node) _is_Mod(node)
1010 #define is_Div(node) _is_Div(node)
1011 #define is_DivMod(node) _is_DivMod(node)
1012 #define is_Quot(node) _is_Quot(node)
1013 #define is_no_Block(node) _is_no_Block(node)
1014 #define is_Block(node) _is_Block(node)
1015 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
1016 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
1017 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
1018 #define get_Block_block_visited(node) _get_Block_block_visited(node)
1019 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
1020 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
1021 #define Block_not_block_visited(node) _Block_not_block_visited(node)
1022 #define Block_block_visited(node) _Block_block_visited(node)
1023 #define set_Block_dead(block) _set_Block_dead(block)
1024 #define is_Block_dead(block) _is_Block_dead(block)
1025 #define get_Const_tarval(node) _get_Const_tarval(node)
1026 #define classify_Const(node) _classify_Const(node)
1027 #define is_irn_forking(node) _is_irn_forking(node)
1028 #define get_irn_type(node) _get_irn_type(node)
1029 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1030 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1031 #define is_irn_constlike(node) _is_irn_constlike(node)
1032 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1033 #define is_irn_keep(node) _is_irn_keep(node)
1034 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1035 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1036 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1037 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1038 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1039 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1040 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1041 #define get_irn_idx(node) _get_irn_idx(node)
1043 #define get_irn_deps(node) _get_irn_deps(node)
1044 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1045 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1047 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1048 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)
1050 #endif /* _FIRM_IRNODE_T_H_ */