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"
32 #include "irgraph_t.h"
34 #include "firm_common_t.h"
35 #include "irdom_t.h" /* For size of struct dom_info. */
38 #include "iredgekinds.h"
46 #include "irextbb_t.h"
49 /** ir node attributes **/
51 /** Block attributes */
53 /* General attributes */
54 ir_graph *irg; /**< The graph this block belongs to. */
55 unsigned long block_visited; /**< For the walker that walks over all blocks. */
56 /* Attributes private to construction: */
57 unsigned is_matured:1; /**< If set, all in-nodes of the block are fixed. */
58 unsigned is_dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
59 unsigned is_mb_head:1; /**< Set if this block is a macroblock head. */
60 ir_node **graph_arr; /**< An array to store all parameters. */
61 /* Attributes holding analyses information */
62 ir_dom_info dom; /**< Datastructure that holds information about dominators.
64 Eventually overlay with graph_arr as only valid
65 in different phases. Eventually inline the whole
67 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
68 ir_node ** in_cg; /**< array with predecessors in
69 * interprocedural_view, if they differ
70 * from intraprocedural predecessors */
71 int *backedge; /**< Field n set to true if pred n is backedge.
72 @@@ @todo Ev. replace by bit field! */
73 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
74 @@@ @todo Ev. replace by bit field! */
75 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
76 ir_region *region; /**< The immediate structural region this block belongs to. */
77 unsigned mb_depth; /**< The macroblock depth: A distance from the macroblock header */
79 struct list_head succ_head; /**< A list head for all successor edges of a block. */
82 /** Cond attributes. */
84 cond_kind kind; /**< flavor of Cond */
85 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
86 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
89 /** Const attributes. */
91 tarval *tv; /**< the target value */
92 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
95 /** SymConst attributes. */
97 symconst_symbol sym; // old tori
99 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
102 /** Sel attributes. */
104 ir_entity *ent; /**< entity to select */
107 /** Exception attributes. */
109 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
110 If it's know that no exception will be generated, could be set to
111 op_pin_state_floats. */
112 #if PRECISE_EXC_CONTEXT
113 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
117 /** Call attributes. */
119 except_attr exc; /**< the exception attribute. MUST be the first one. */
120 ir_type *cld_tp; /**< type of called procedure */
121 ir_entity ** callee_arr; /**< result of callee analysis */
124 /** Alloc attributes. */
126 except_attr exc; /**< the exception attribute. MUST be the first one. */
127 ir_type *type; /**< Type of the allocated object. */
128 where_alloc where; /**< stack, heap or other managed part of memory */
131 /** Free attributes. */
133 ir_type *type; /**< Type of the allocated object. */
134 where_alloc where; /**< stack, heap or other managed part of memory */
137 /** InstOf attributes. */
139 except_attr exc; /**< the exception attribute. MUST be the first one. */
140 ir_type *type; /**< the type of which the object pointer must be */
143 /** Filter attributes. */
145 long proj; /**< contains the result position to project (Proj) */
146 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
147 int *backedge; /**< Field n set to true if pred n is backedge.
148 @todo Ev. replace by bitfield! */
151 /** CallBegin attributes. */
153 ir_node * call; /**< Associated Call-operation. */
156 /** Cast attributes. */
158 ir_type *totype; /**< Type of the casted node. */
161 /** Load attributes. */
163 except_attr exc; /**< The exception attribute. MUST be the first one. */
164 ir_mode *load_mode; /**< The mode of this Load operation. */
165 ir_volatility volatility; /**< The volatility of a Load/Store operation. */
168 /** Store attributes. */
170 except_attr exc; /**< the exception attribute. MUST be the first one. */
171 ir_volatility volatility; /**< the volatility of a Store operation */
175 int pos; /**< For Phi. Used to remember the value defined by
176 this Phi node. Needed when the Phi is completed
177 to call get_r_internal_value to find the
178 predecessors. If this attribute is set, the Phi
179 node takes the role of the obsolete Phi0 node,
180 therefore the name. */
184 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
186 /** CopyB attribute. */
188 except_attr exc; /**< The exception attribute. MUST be the first one. */
189 ir_type *data_type; /**< Type of the copied entity. */
192 /** Bound attribute. */
194 except_attr exc; /**< The exception attribute. MUST be the first one. */
197 /** Conv attribute. */
199 char strict; /**< If set, this is a strict Conv that cannot be removed. */
202 /** Div/Mod/DivMod/Quot attribute. */
204 except_attr exc; /**< the exception attribute. MUST be the first one. */
205 ir_mode *res_mode; /**< Result mode for the division. */
208 /** Some IR-nodes just have one attribute, these are stored here,
209 some have more. Their name is 'irnodename_attr' */
211 block_attr block; /**< For Block: Fields needed to construct it */
212 cond_attr cond; /**< For Cond. */
213 const_attr con; /**< For Const: contains the value of the constant and a type */
214 symconst_attr symc; /**< For SymConst. */
215 sel_attr sel; /**< For Sel. */
216 call_attr call; /**< For Call: pointer to the type of the method to call */
217 callbegin_attr callbegin; /**< For CallBegin */
218 alloc_attr alloc; /**< For Alloc. */
219 free_attr free; /**< For Free. */
220 io_attr instof; /**< For InstOf */
221 cast_attr cast; /**< For Cast. */
222 load_attr load; /**< For Load. */
223 store_attr store; /**< For Store. */
224 phi0_attr phi0; /**< for Phi0 nodes. */
225 int *phi_backedge; /**< For Phi after construction.
226 Field n set to true if pred n is backedge.
227 @todo Ev. replace by bitfield! */
228 long proj; /**< For Proj: contains the result position to project */
229 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
230 filter_attr filter; /**< For Filter */
231 except_attr except; /**< For Phi node construction in case of exceptions */
232 copyb_attr copyb; /**< For CopyB operation */
233 bound_attr bound; /**< For Bound operation */
234 conv_attr conv; /**< For Conv operation */
235 divmod_attr divmod; /**< For Div/Mod/DivMod operation */
239 * Edge info to put into an irn.
241 typedef struct _irn_edge_kind_info_t {
242 struct list_head outs_head; /**< The list of all outs. */
243 int out_count; /**< Number of outs in the list. */
246 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
249 * The common structure of an irnode.
250 * If the node has some attributes, they are stored in the attr field.
253 /* ------- Basics of the representation ------- */
254 firm_kind kind; /**< Distinguishes this node from others. */
255 ir_op *op; /**< The Opcode of this node. */
256 ir_mode *mode; /**< The Mode of this node. */
257 struct ir_node **in; /**< The array of predecessors / operands. */
258 unsigned long visited; /**< The visited counter for walks of the graph. */
259 unsigned node_idx; /**< The node index of this node in its graph. */
260 void *link; /**< To attach additional information to the node, e.g.
261 used while construction to link Phi0 nodes and
262 during optimization to link to nodes that
263 shall replace a node. */
264 /* ------- Fields for optimizations / analysis information ------- */
265 struct ir_node **out; /**< @deprecated array of out edges. */
266 struct dbg_info *dbi; /**< A pointer to information for debug support. */
267 /* ------- For debugging ------- */
270 long node_nr; /**< A unique node number for each node to make output
273 /* ------- For analyses -------- */
274 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
275 #ifdef DO_HEAPANALYSIS
276 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
277 struct section *sec; /**< Heapanalysis: The section of this node. */
279 struct ir_node **deps; /**< Additional dependencies induced by state. */
280 irn_edges_info_t edge_info; /**< Everlasting out edges. */
281 /* ------- Opcode depending fields -------- */
282 attr attr; /**< The set of attributes of this node. Depends on opcode.
283 Must be last field of struct ir_node. */
288 * Returns the array with the ins. The content of the array may not be
290 * Note that this function returns the whole in array including the
291 * block predecessor. So, it is NOT symmetric with set_irn_in().
293 ir_node **get_irn_in (const ir_node *node);
296 /** access attributes directly */
297 const_attr get_irn_const_attr (ir_node *node);
298 long get_irn_proj_attr (ir_node *node);
299 alloc_attr get_irn_alloc_attr (ir_node *node);
300 free_attr get_irn_free_attr (ir_node *node);
301 symconst_attr get_irn_symconst_attr (ir_node *node);
302 ir_type *get_irn_call_attr (ir_node *node);
303 ir_type *get_irn_funccall_attr (ir_node *node);
304 sel_attr get_irn_sel_attr (ir_node *node);
305 int get_irn_phi0_attr (ir_node *node);
306 block_attr get_irn_block_attr (ir_node *node);
307 load_attr get_irn_load_attr (ir_node *node);
308 store_attr get_irn_store_attr (ir_node *node);
309 except_attr get_irn_except_attr (ir_node *node);
313 * The amount of additional space for custom data to be allocated upon creating a new node.
315 extern unsigned firm_add_node_size;
318 * Sets the get_type operation for an ir_op_ops.
320 * @param code the opcode for the default operation
321 * @param ops the operations initialized
326 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
329 * Sets the get_type_attr operation for an ir_op_ops.
331 * @param code the opcode for the default operation
332 * @param ops the operations initialized
337 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
340 * Sets the get_entity_attr operation for an ir_op_ops.
342 * @param code the opcode for the default operation
343 * @param ops the operations initialized
348 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
350 /*-------------------------------------------------------------------*/
351 /* These function are most used in libfirm. Give them as static */
352 /* functions so they can be inlined. */
353 /*-------------------------------------------------------------------*/
356 * Checks whether a pointer points to a ir node.
357 * Intern version for libFirm.
360 _is_ir_node(const void *thing) {
361 return (get_kind(thing) == k_ir_node);
365 * Gets the op of a node.
366 * Intern version for libFirm.
368 static INLINE ir_op *
369 _get_irn_op(const ir_node *node) {
375 _set_irn_op(ir_node *node, ir_op *op) {
380 /** Copies all attributes stored in the old node to the new node.
381 Assumes both have the same opcode and sufficient size. */
383 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
384 ir_op *op = _get_irn_op(old_node);
386 /* must always exist */
387 op->ops.copy_attr(old_node, new_node);
391 * Gets the opcode of a node.
392 * Intern version for libFirm.
394 static INLINE ir_opcode
395 _get_irn_opcode(const ir_node *node) {
396 assert(k_ir_node == get_kind(node));
398 return node->op->code;
402 * Returns the number of predecessors without the block predecessor.
403 * Intern version for libFirm.
406 _get_irn_intra_arity(const ir_node *node) {
408 return ARR_LEN(node->in) - 1;
412 * Returns the number of predecessors without the block predecessor.
413 * Intern version for libFirm.
416 _get_irn_inter_arity(const ir_node *node) {
418 if (_get_irn_op(node) == op_Filter) {
419 assert(node->attr.filter.in_cg);
420 return ARR_LEN(node->attr.filter.in_cg) - 1;
421 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
422 return ARR_LEN(node->attr.block.in_cg) - 1;
424 return _get_irn_intra_arity(node);
428 * Returns the number of predecessors without the block predecessor.
429 * Intern version for libFirm.
431 extern int (*_get_irn_arity)(const ir_node *node);
434 * Intern version for libFirm.
436 static INLINE ir_node *
437 _get_irn_intra_n(const ir_node *node, int n) {
441 assert(-1 <= n && n < _get_irn_intra_arity(node));
443 nn = node->in[n + 1];
445 /* only block inputs are allowed to be NULL */
446 assert(n == -1 && "NULL input of a node");
449 if (nn->op != op_Id) return nn;
451 return (node->in[n + 1] = skip_Id(nn));
455 * Intern version for libFirm.
457 static INLINE ir_node*
458 _get_irn_inter_n(const ir_node *node, int n) {
459 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
461 /* handle Filter and Block specially */
462 if (_get_irn_op(node) == op_Filter) {
463 assert(node->attr.filter.in_cg);
464 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
465 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
466 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
469 return _get_irn_intra_n(node, n);
473 * Access to the predecessors of a node.
474 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
475 * to iterate including the Block predecessor iterate from i = -1 to
477 * If it is a block, the entry -1 is NULL.
478 * Intern version for libFirm.
480 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
482 static INLINE int _get_irn_deps(const ir_node *node) {
483 return node->deps ? ARR_LEN(node->deps) : 0;
486 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
487 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
488 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
489 return node->deps[pos];
493 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
496 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
497 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
498 old = node->deps[pos];
499 node->deps[pos] = dep;
500 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
505 _get_irn_ins_or_deps(const ir_node *irn) {
506 return _get_irn_deps(irn) + _get_irn_arity(irn);
509 static INLINE ir_node *
510 _get_irn_in_or_dep(const ir_node *irn, int pos) {
511 int n_in = get_irn_arity(irn);
512 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
516 * Gets the mode of a node.
517 * Intern version for libFirm.
519 static INLINE ir_mode *
520 _get_irn_mode(const ir_node *node) {
526 * Sets the mode of a node.
527 * Intern version of libFirm.
530 _set_irn_mode(ir_node *node, ir_mode *mode) {
536 * Gets the visited counter of a node.
537 * Intern version for libFirm.
539 static INLINE unsigned long
540 _get_irn_visited(const ir_node *node) {
542 return node->visited;
546 * Sets the visited counter of a node.
547 * Intern version for libFirm.
550 _set_irn_visited(ir_node *node, unsigned long visited) {
552 node->visited = visited;
556 * Mark a node as visited in a graph.
557 * Intern version for libFirm.
560 _mark_irn_visited(ir_node *node) {
562 node->visited = current_ir_graph->visited;
566 * Returns non-zero if a node of was visited.
567 * Intern version for libFirm.
570 _irn_visited(const ir_node *node) {
572 return (node->visited >= current_ir_graph->visited);
576 * Returns non-zero if a node of was NOT visited.
577 * Intern version for libFirm.
580 _irn_not_visited(const ir_node *node) {
582 return (node->visited < current_ir_graph->visited);
586 * Sets the link of a node.
587 * Intern version of libFirm.
590 _set_irn_link(ir_node *node, void *link) {
592 /* Link field is used for Phi construction and various optimizations
594 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
600 * Returns the link of a node.
601 * Intern version of libFirm.
604 _get_irn_link(const ir_node *node) {
605 assert(node && _is_ir_node(node));
610 * Returns whether the node _always_ must be pinned.
611 * I.e., the node is not floating after global cse.
613 * Intern version of libFirm.
615 static INLINE op_pin_state
616 _get_irn_pinned(const ir_node *node) {
618 assert(node && _is_ir_node(node));
620 state = _get_op_pinned(_get_irn_op(node));
622 if (state >= op_pin_state_exc_pinned)
623 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
627 static INLINE op_pin_state
628 _is_irn_pinned_in_irg(const ir_node *node) {
629 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
630 return get_irn_pinned(node);
631 return op_pin_state_pinned;
635 _is_unop(const ir_node *node) {
636 assert(node && _is_ir_node(node));
637 return (node->op->opar == oparity_unary);
641 _is_binop(const ir_node *node) {
642 assert(node && _is_ir_node(node));
643 return (node->op->opar == oparity_binary);
647 _is_Bad(const ir_node *node) {
649 return (_get_irn_op(node) == op_Bad);
653 _is_NoMem(const ir_node *node) {
655 return (_get_irn_op(node) == op_NoMem);
659 _is_Mod(const ir_node *node) {
661 return (_get_irn_op(node) == op_Mod);
665 _is_Div(const ir_node *node) {
667 return (_get_irn_op(node) == op_Div);
671 _is_DivMod(const ir_node *node) {
673 return (_get_irn_op(node) == op_DivMod);
677 _is_Quot(const ir_node *node) {
679 return (_get_irn_op(node) == op_Quot);
683 _is_Add(const ir_node *node) {
685 return (_get_irn_op(node) == op_Add);
689 _is_Sub(const ir_node *node) {
691 return (_get_irn_op(node) == op_Sub);
695 _is_Start(const ir_node *node) {
697 return (_get_irn_op(node) == op_Start);
701 _is_End(const ir_node *node) {
703 return (_get_irn_op(node) == op_End);
707 _is_Const(const ir_node *node) {
709 return (_get_irn_op(node) == op_Const);
713 _is_Conv(const ir_node *node) {
715 return (_get_irn_op(node) == op_Conv);
719 _is_CopyB(const ir_node *node) {
721 return (_get_irn_op(node) == op_CopyB);
725 _is_Unknown(const ir_node *node) {
727 return (_get_irn_op(node) == op_Unknown);
731 _is_Return(const ir_node *node) {
733 return (_get_irn_op(node) == op_Return);
737 _is_Call(const ir_node *node) {
739 return (_get_irn_op(node) == op_Call);
743 _is_Sel(const ir_node *node) {
745 return (_get_irn_op(node) == op_Sel);
749 _is_Mul(const ir_node *node) {
751 return (_get_irn_op(node) == op_Mul);
755 _is_Mux(const ir_node *node) {
758 ir_op *op = _get_irn_op(node);
759 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
765 _is_Load(const ir_node *node) {
767 return (_get_irn_op(node) == op_Load);
771 _is_Store(const ir_node *node) {
773 return (_get_irn_op(node) == op_Store);
777 _is_Sync(const ir_node *node) {
779 return (_get_irn_op(node) == op_Sync);
783 _is_Confirm(const ir_node *node) {
785 return (_get_irn_op(node) == op_Confirm);
789 _is_Pin(const ir_node *node) {
791 return (_get_irn_op(node) == op_Pin);
795 _is_SymConst(const ir_node *node) {
797 return (_get_irn_op(node) == op_SymConst);
801 _is_Cond(const ir_node *node) {
803 return (_get_irn_op(node) == op_Cond);
807 _is_Cmp(const ir_node *node) {
809 return (_get_irn_op(node) == op_Cmp);
813 _is_Alloc(const ir_node *node) {
815 return (_get_irn_op(node) == op_Alloc);
819 _is_Jmp(const ir_node *node) {
821 return (_get_irn_op(node) == op_Jmp);
825 _is_Raise(const ir_node *node) {
827 return (_get_irn_op(node) == op_Raise);
831 _is_no_Block(const ir_node *node) {
832 assert(node && _is_ir_node(node));
833 return (_get_irn_op(node) != op_Block);
837 _is_Block(const ir_node *node) {
838 assert(node && _is_ir_node(node));
839 return (_get_irn_op(node) == op_Block);
843 _get_Block_n_cfgpreds(const ir_node *node) {
844 assert(_is_Block(node));
845 return _get_irn_arity(node);
848 static INLINE ir_node *
849 _get_Block_cfgpred(ir_node *node, int pos) {
850 assert(0 <= pos && pos < get_irn_arity(node));
851 assert(_is_Block(node));
852 return _get_irn_n(node, pos);
855 /* Get the predecessor block.
857 * Returns the block corresponding to the predecessor pos.
859 * There are several ambiguities we resolve with this function:
860 * - The direct predecessor can be a Proj, which is not pinned.
861 * We walk from the predecessor to the next pinned node
862 * (skip_Proj) and return the block that node is in.
863 * - If we encounter the Bad node, this function does not return
864 * Start, but the Bad node.
866 static INLINE ir_node *
867 _get_Block_cfgpred_block(ir_node *node, int pos) {
868 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
870 res = get_nodes_block(res);
874 static INLINE unsigned long
875 _get_Block_block_visited(const ir_node *node) {
876 assert(node->op == op_Block);
877 return node->attr.block.block_visited;
881 _set_Block_block_visited(ir_node *node, unsigned long visit) {
882 assert(node->op == op_Block);
883 node->attr.block.block_visited = visit;
886 /* For this current_ir_graph must be set. */
888 _mark_Block_block_visited(ir_node *node) {
889 assert(node->op == op_Block);
890 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
894 _Block_not_block_visited(const ir_node *node) {
895 assert(node->op == op_Block);
896 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
900 _Block_block_visited(const ir_node *node) {
901 assert(node->op == op_Block);
902 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
905 static INLINE ir_node *
906 _set_Block_dead(ir_node *block) {
907 assert(_get_irn_op(block) == op_Block);
908 block->attr.block.is_dead = 1;
913 _is_Block_dead(const ir_node *block) {
914 ir_op *op = _get_irn_op(block);
919 assert(op == op_Block);
920 return block->attr.block.is_dead;
924 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
925 assert(_get_irn_op(node) == op_Const);
926 return node->attr.con.tv;
929 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
931 assert(_is_ir_node(node));
933 op = _get_irn_op(node);
936 return classify_tarval(_get_Const_tarval(node));
937 else if(op == op_SymConst)
938 return CNST_SYMCONST;
940 return CNST_NO_CONST;
943 static INLINE int _is_irn_forking(const ir_node *node) {
944 return is_op_forking(_get_irn_op(node));
947 static INLINE ir_type *_get_irn_type(ir_node *node) {
948 return _get_irn_op(node)->ops.get_type(node);
951 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
952 return _get_irn_op(node)->ops.get_type_attr(node);
955 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
956 return _get_irn_op(node)->ops.get_entity_attr(node);
959 static INLINE int _is_irn_constlike(const ir_node *node) {
960 return is_op_constlike(_get_irn_op(node));
963 static INLINE int _is_irn_always_opt(const ir_node *node) {
964 return is_op_always_opt(_get_irn_op(node));
967 static INLINE int _is_irn_keep(const ir_node *node) {
968 return is_op_keep(_get_irn_op(node));
971 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
972 return is_op_start_block_placed(_get_irn_op(node));
975 static INLINE int _is_irn_machine_op(const ir_node *node) {
976 return is_op_machine(_get_irn_op(node));
979 static INLINE int _is_irn_machine_operand(const ir_node *node) {
980 return is_op_machine_operand(_get_irn_op(node));
983 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
984 return is_op_machine_user(_get_irn_op(node), n);
987 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
988 assert(_get_irn_op(node) == op_Cond);
989 return node->attr.cond.pred;
992 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
993 assert(_get_irn_op(node) == op_Cond);
994 node->attr.cond.pred = pred;
997 static INLINE int _get_Psi_n_conds(ir_node *node) {
998 assert(_get_irn_op(node) == op_Psi);
999 return _get_irn_arity(node) >> 1;
1002 static INLINE void *_get_irn_generic_attr(ir_node *node) {
1006 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
1010 static INLINE unsigned _get_irn_idx(const ir_node *node) {
1011 return node->node_idx;
1014 /* this section MUST contain all inline functions */
1015 #define is_ir_node(thing) _is_ir_node(thing)
1016 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
1017 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
1018 #define get_irn_arity(node) _get_irn_arity(node)
1019 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
1020 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
1021 #define get_irn_n(node, n) _get_irn_n(node, n)
1022 #define get_irn_mode(node) _get_irn_mode(node)
1023 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
1024 #define get_irn_op(node) _get_irn_op(node)
1025 #define set_irn_op(node, op) _set_irn_op(node, op)
1026 #define get_irn_opcode(node) _get_irn_opcode(node)
1027 #define get_irn_visited(node) _get_irn_visited(node)
1028 #define set_irn_visited(node, v) _set_irn_visited(node, v)
1029 #define mark_irn_visited(node) _mark_irn_visited(node)
1030 #define irn_visited(node) _irn_visited(node)
1031 #define irn_not_visited(node) _irn_not_visited(node)
1032 #define set_irn_link(node, link) _set_irn_link(node, link)
1033 #define get_irn_link(node) _get_irn_link(node)
1034 #define get_irn_pinned(node) _get_irn_pinned(node)
1035 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
1036 #define is_unop(node) _is_unop(node)
1037 #define is_binop(node) _is_binop(node)
1038 #define is_Const(node) _is_Const(node)
1039 #define is_Conv(node) _is_Conv(node)
1040 #define is_Unknown(node) _is_Unknown(node)
1041 #define is_Return(node) _is_Return(node)
1042 #define is_Call(node) _is_Call(node)
1043 #define is_Sel(node) _is_Sel(node)
1044 #define is_Mul(node) _is_Mul(node)
1045 #define is_Mux(node) _is_Mux(node)
1046 #define is_Load(node) _is_Load(node)
1047 #define is_Sync(node) _is_Sync(node)
1048 #define is_Confirm(node) _is_Confirm(node)
1049 #define is_Pin(node) _is_Pin(node)
1050 #define is_SymConst(node) _is_SymConst(node)
1051 #define is_Cond(node) _is_Cond(node)
1052 #define is_CopyB(node) _is_CopyB(node)
1053 #define is_Cmp(node) _is_Cmp(node)
1054 #define is_Alloc(node) _is_Alloc(node)
1055 #define is_Jmp(node) _is_Jmp(node)
1056 #define is_Raise(node) _is_Raise(node)
1057 #define is_Bad(node) _is_Bad(node)
1058 #define is_NoMem(node) _is_NoMem(node)
1059 #define is_Start(node) _is_Start(node)
1060 #define is_End(node) _is_End(node)
1061 #define is_Mod(node) _is_Mod(node)
1062 #define is_Div(node) _is_Div(node)
1063 #define is_DivMod(node) _is_DivMod(node)
1064 #define is_Quot(node) _is_Quot(node)
1065 #define is_Add(node) _is_Add(node)
1066 #define is_Sub(node) _is_Sub(node)
1067 #define is_no_Block(node) _is_no_Block(node)
1068 #define is_Block(node) _is_Block(node)
1069 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
1070 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
1071 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
1072 #define get_Block_block_visited(node) _get_Block_block_visited(node)
1073 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
1074 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
1075 #define Block_not_block_visited(node) _Block_not_block_visited(node)
1076 #define Block_block_visited(node) _Block_block_visited(node)
1077 #define set_Block_dead(block) _set_Block_dead(block)
1078 #define is_Block_dead(block) _is_Block_dead(block)
1079 #define get_Const_tarval(node) _get_Const_tarval(node)
1080 #define classify_Const(node) _classify_Const(node)
1081 #define is_irn_forking(node) _is_irn_forking(node)
1082 #define get_irn_type(node) _get_irn_type(node)
1083 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1084 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1085 #define is_irn_constlike(node) _is_irn_constlike(node)
1086 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1087 #define is_irn_keep(node) _is_irn_keep(node)
1088 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1089 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1090 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1091 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1092 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1093 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1094 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1095 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
1096 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
1097 #define get_irn_idx(node) _get_irn_idx(node)
1099 #define get_irn_deps(node) _get_irn_deps(node)
1100 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1101 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1103 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1104 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)