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 /** Inline Assembler support attribute. */
210 ident *asm_text; /**< The inline assembler text. */
213 /** Some IR-nodes just have one attribute, these are stored here,
214 some have more. Their name is 'irnodename_attr' */
216 block_attr block; /**< For Block: Fields needed to construct it */
217 cond_attr cond; /**< For Cond. */
218 const_attr con; /**< For Const: contains the value of the constant and a type */
219 symconst_attr symc; /**< For SymConst. */
220 sel_attr sel; /**< For Sel. */
221 call_attr call; /**< For Call: pointer to the type of the method to call */
222 callbegin_attr callbegin; /**< For CallBegin */
223 alloc_attr alloc; /**< For Alloc. */
224 free_attr free; /**< For Free. */
225 io_attr instof; /**< For InstOf */
226 cast_attr cast; /**< For Cast. */
227 load_attr load; /**< For Load. */
228 store_attr store; /**< For Store. */
229 phi0_attr phi0; /**< for Phi0 nodes. */
230 int *phi_backedge; /**< For Phi after construction.
231 Field n set to true if pred n is backedge.
232 @todo Ev. replace by bitfield! */
233 long proj; /**< For Proj: contains the result position to project */
234 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
235 filter_attr filter; /**< For Filter */
236 except_attr except; /**< For Phi node construction in case of exceptions */
237 copyb_attr copyb; /**< For CopyB operation */
238 bound_attr bound; /**< For Bound operation */
239 conv_attr conv; /**< For Conv operation */
240 divmod_attr divmod; /**< For Div/Mod/DivMod operation */
241 asm_attr asm; /**< For ASM operation. */
245 * Edge info to put into an irn.
247 typedef struct _irn_edge_kind_info_t {
248 struct list_head outs_head; /**< The list of all outs. */
249 int out_count; /**< Number of outs in the list. */
252 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
255 * The common structure of an irnode.
256 * If the node has some attributes, they are stored in the attr field.
259 /* ------- Basics of the representation ------- */
260 firm_kind kind; /**< Distinguishes this node from others. */
261 ir_op *op; /**< The Opcode of this node. */
262 ir_mode *mode; /**< The Mode of this node. */
263 struct ir_node **in; /**< The array of predecessors / operands. */
264 unsigned long visited; /**< The visited counter for walks of the graph. */
265 unsigned node_idx; /**< The node index of this node in its graph. */
266 void *link; /**< To attach additional information to the node, e.g.
267 used while construction to link Phi0 nodes and
268 during optimization to link to nodes that
269 shall replace a node. */
270 /* ------- Fields for optimizations / analysis information ------- */
271 struct ir_node **out; /**< @deprecated array of out edges. */
272 struct dbg_info *dbi; /**< A pointer to information for debug support. */
273 /* ------- For debugging ------- */
276 long node_nr; /**< A unique node number for each node to make output
279 /* ------- For analyses -------- */
280 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
281 #ifdef DO_HEAPANALYSIS
282 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
283 struct section *sec; /**< Heapanalysis: The section of this node. */
285 struct ir_node **deps; /**< Additional dependencies induced by state. */
286 irn_edges_info_t edge_info; /**< Everlasting out edges. */
287 /* ------- Opcode depending fields -------- */
288 attr attr; /**< The set of attributes of this node. Depends on opcode.
289 Must be last field of struct ir_node. */
294 * Returns the array with the ins. The content of the array may not be
296 * Note that this function returns the whole in array including the
297 * block predecessor. So, it is NOT symmetric with set_irn_in().
299 ir_node **get_irn_in (const ir_node *node);
302 /** access attributes directly */
303 const_attr get_irn_const_attr (ir_node *node);
304 long get_irn_proj_attr (ir_node *node);
305 alloc_attr get_irn_alloc_attr (ir_node *node);
306 free_attr get_irn_free_attr (ir_node *node);
307 symconst_attr get_irn_symconst_attr (ir_node *node);
308 ir_type *get_irn_call_attr (ir_node *node);
309 ir_type *get_irn_funccall_attr (ir_node *node);
310 sel_attr get_irn_sel_attr (ir_node *node);
311 int get_irn_phi0_attr (ir_node *node);
312 block_attr get_irn_block_attr (ir_node *node);
313 load_attr get_irn_load_attr (ir_node *node);
314 store_attr get_irn_store_attr (ir_node *node);
315 except_attr get_irn_except_attr (ir_node *node);
319 * The amount of additional space for custom data to be allocated upon creating a new node.
321 extern unsigned firm_add_node_size;
324 * Sets the get_type operation for an ir_op_ops.
326 * @param code the opcode for the default operation
327 * @param ops the operations initialized
332 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
335 * Sets the get_type_attr operation for an ir_op_ops.
337 * @param code the opcode for the default operation
338 * @param ops the operations initialized
343 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
346 * Sets the get_entity_attr operation for an ir_op_ops.
348 * @param code the opcode for the default operation
349 * @param ops the operations initialized
354 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
356 /*-------------------------------------------------------------------*/
357 /* These function are most used in libfirm. Give them as static */
358 /* functions so they can be inlined. */
359 /*-------------------------------------------------------------------*/
362 * Checks whether a pointer points to a ir node.
363 * Intern version for libFirm.
366 _is_ir_node(const void *thing) {
367 return (get_kind(thing) == k_ir_node);
371 * Gets the op of a node.
372 * Intern version for libFirm.
374 static INLINE ir_op *
375 _get_irn_op(const ir_node *node) {
381 _set_irn_op(ir_node *node, ir_op *op) {
386 /** Copies all attributes stored in the old node to the new node.
387 Assumes both have the same opcode and sufficient size. */
389 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
390 ir_op *op = _get_irn_op(old_node);
392 /* must always exist */
393 op->ops.copy_attr(old_node, new_node);
397 * Gets the opcode of a node.
398 * Intern version for libFirm.
400 static INLINE ir_opcode
401 _get_irn_opcode(const ir_node *node) {
402 assert(k_ir_node == get_kind(node));
404 return node->op->code;
408 * Returns the number of predecessors without the block predecessor.
409 * Intern version for libFirm.
412 _get_irn_intra_arity(const ir_node *node) {
414 return ARR_LEN(node->in) - 1;
418 * Returns the number of predecessors without the block predecessor.
419 * Intern version for libFirm.
422 _get_irn_inter_arity(const ir_node *node) {
424 if (_get_irn_op(node) == op_Filter) {
425 assert(node->attr.filter.in_cg);
426 return ARR_LEN(node->attr.filter.in_cg) - 1;
427 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
428 return ARR_LEN(node->attr.block.in_cg) - 1;
430 return _get_irn_intra_arity(node);
434 * Returns the number of predecessors without the block predecessor.
435 * Intern version for libFirm.
437 extern int (*_get_irn_arity)(const ir_node *node);
440 * Intern version for libFirm.
442 static INLINE ir_node *
443 _get_irn_intra_n(const ir_node *node, int n) {
447 assert(-1 <= n && n < _get_irn_intra_arity(node));
449 nn = node->in[n + 1];
451 /* only block inputs are allowed to be NULL */
452 assert(n == -1 && "NULL input of a node");
455 if (nn->op != op_Id) return nn;
457 return (node->in[n + 1] = skip_Id(nn));
461 * Intern version for libFirm.
463 static INLINE ir_node*
464 _get_irn_inter_n(const ir_node *node, int n) {
465 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
467 /* handle Filter and Block specially */
468 if (_get_irn_op(node) == op_Filter) {
469 assert(node->attr.filter.in_cg);
470 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
471 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
472 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
475 return _get_irn_intra_n(node, n);
479 * Access to the predecessors of a node.
480 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
481 * to iterate including the Block predecessor iterate from i = -1 to
483 * If it is a block, the entry -1 is NULL.
484 * Intern version for libFirm.
486 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
488 static INLINE int _get_irn_deps(const ir_node *node) {
489 return node->deps ? ARR_LEN(node->deps) : 0;
492 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
493 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
494 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
495 return node->deps[pos];
499 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
502 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
503 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
504 old = node->deps[pos];
505 node->deps[pos] = dep;
506 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
511 _get_irn_ins_or_deps(const ir_node *irn) {
512 return _get_irn_deps(irn) + _get_irn_arity(irn);
515 static INLINE ir_node *
516 _get_irn_in_or_dep(const ir_node *irn, int pos) {
517 int n_in = get_irn_arity(irn);
518 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
522 * Gets the mode of a node.
523 * Intern version for libFirm.
525 static INLINE ir_mode *
526 _get_irn_mode(const ir_node *node) {
532 * Sets the mode of a node.
533 * Intern version of libFirm.
536 _set_irn_mode(ir_node *node, ir_mode *mode) {
542 * Gets the visited counter of a node.
543 * Intern version for libFirm.
545 static INLINE unsigned long
546 _get_irn_visited(const ir_node *node) {
548 return node->visited;
552 * Sets the visited counter of a node.
553 * Intern version for libFirm.
556 _set_irn_visited(ir_node *node, unsigned long visited) {
558 node->visited = visited;
562 * Mark a node as visited in a graph.
563 * Intern version for libFirm.
566 _mark_irn_visited(ir_node *node) {
568 node->visited = current_ir_graph->visited;
572 * Returns non-zero if a node of was visited.
573 * Intern version for libFirm.
576 _irn_visited(const ir_node *node) {
578 return (node->visited >= current_ir_graph->visited);
582 * Returns non-zero if a node of was NOT visited.
583 * Intern version for libFirm.
586 _irn_not_visited(const ir_node *node) {
588 return (node->visited < current_ir_graph->visited);
592 * Sets the link of a node.
593 * Intern version of libFirm.
596 _set_irn_link(ir_node *node, void *link) {
598 /* Link field is used for Phi construction and various optimizations
600 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
606 * Returns the link of a node.
607 * Intern version of libFirm.
610 _get_irn_link(const ir_node *node) {
611 assert(node && _is_ir_node(node));
616 * Returns whether the node _always_ must be pinned.
617 * I.e., the node is not floating after global cse.
619 * Intern version of libFirm.
621 static INLINE op_pin_state
622 _get_irn_pinned(const ir_node *node) {
624 assert(node && _is_ir_node(node));
626 state = _get_op_pinned(_get_irn_op(node));
628 if (state >= op_pin_state_exc_pinned)
629 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
633 static INLINE op_pin_state
634 _is_irn_pinned_in_irg(const ir_node *node) {
635 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
636 return get_irn_pinned(node);
637 return op_pin_state_pinned;
641 _is_unop(const ir_node *node) {
642 assert(node && _is_ir_node(node));
643 return (node->op->opar == oparity_unary);
647 _is_binop(const ir_node *node) {
648 assert(node && _is_ir_node(node));
649 return (node->op->opar == oparity_binary);
653 _is_Bad(const ir_node *node) {
655 return (_get_irn_op(node) == op_Bad);
659 _is_NoMem(const ir_node *node) {
661 return (_get_irn_op(node) == op_NoMem);
665 _is_Mod(const ir_node *node) {
667 return (_get_irn_op(node) == op_Mod);
671 _is_Div(const ir_node *node) {
673 return (_get_irn_op(node) == op_Div);
677 _is_DivMod(const ir_node *node) {
679 return (_get_irn_op(node) == op_DivMod);
683 _is_Quot(const ir_node *node) {
685 return (_get_irn_op(node) == op_Quot);
689 _is_Add(const ir_node *node) {
691 return (_get_irn_op(node) == op_Add);
695 _is_Sub(const ir_node *node) {
697 return (_get_irn_op(node) == op_Sub);
701 _is_Start(const ir_node *node) {
703 return (_get_irn_op(node) == op_Start);
707 _is_End(const ir_node *node) {
709 return (_get_irn_op(node) == op_End);
713 _is_Const(const ir_node *node) {
715 return (_get_irn_op(node) == op_Const);
719 _is_Conv(const ir_node *node) {
721 return (_get_irn_op(node) == op_Conv);
725 _is_CopyB(const ir_node *node) {
727 return (_get_irn_op(node) == op_CopyB);
731 _is_Unknown(const ir_node *node) {
733 return (_get_irn_op(node) == op_Unknown);
737 _is_Return(const ir_node *node) {
739 return (_get_irn_op(node) == op_Return);
743 _is_Call(const ir_node *node) {
745 return (_get_irn_op(node) == op_Call);
749 _is_Sel(const ir_node *node) {
751 return (_get_irn_op(node) == op_Sel);
755 _is_Mul(const ir_node *node) {
757 return (_get_irn_op(node) == op_Mul);
761 _is_Mux(const ir_node *node) {
764 ir_op *op = _get_irn_op(node);
765 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
771 _is_Load(const ir_node *node) {
773 return (_get_irn_op(node) == op_Load);
777 _is_Store(const ir_node *node) {
779 return (_get_irn_op(node) == op_Store);
783 _is_Sync(const ir_node *node) {
785 return (_get_irn_op(node) == op_Sync);
789 _is_Confirm(const ir_node *node) {
791 return (_get_irn_op(node) == op_Confirm);
795 _is_Pin(const ir_node *node) {
797 return (_get_irn_op(node) == op_Pin);
801 _is_SymConst(const ir_node *node) {
803 return (_get_irn_op(node) == op_SymConst);
807 _is_Cond(const ir_node *node) {
809 return (_get_irn_op(node) == op_Cond);
813 _is_Cmp(const ir_node *node) {
815 return (_get_irn_op(node) == op_Cmp);
819 _is_Alloc(const ir_node *node) {
821 return (_get_irn_op(node) == op_Alloc);
825 _is_Jmp(const ir_node *node) {
827 return (_get_irn_op(node) == op_Jmp);
831 _is_Raise(const ir_node *node) {
833 return (_get_irn_op(node) == op_Raise);
837 _is_no_Block(const ir_node *node) {
838 assert(node && _is_ir_node(node));
839 return (_get_irn_op(node) != op_Block);
843 _is_Block(const ir_node *node) {
844 assert(node && _is_ir_node(node));
845 return (_get_irn_op(node) == op_Block);
849 _get_Block_n_cfgpreds(const ir_node *node) {
850 assert(_is_Block(node));
851 return _get_irn_arity(node);
854 static INLINE ir_node *
855 _get_Block_cfgpred(ir_node *node, int pos) {
856 assert(0 <= pos && pos < get_irn_arity(node));
857 assert(_is_Block(node));
858 return _get_irn_n(node, pos);
861 /* Get the predecessor block.
863 * Returns the block corresponding to the predecessor pos.
865 * There are several ambiguities we resolve with this function:
866 * - The direct predecessor can be a Proj, which is not pinned.
867 * We walk from the predecessor to the next pinned node
868 * (skip_Proj) and return the block that node is in.
869 * - If we encounter the Bad node, this function does not return
870 * Start, but the Bad node.
872 static INLINE ir_node *
873 _get_Block_cfgpred_block(ir_node *node, int pos) {
874 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
876 res = get_nodes_block(res);
880 static INLINE unsigned long
881 _get_Block_block_visited(const ir_node *node) {
882 assert(node->op == op_Block);
883 return node->attr.block.block_visited;
887 _set_Block_block_visited(ir_node *node, unsigned long visit) {
888 assert(node->op == op_Block);
889 node->attr.block.block_visited = visit;
892 /* For this current_ir_graph must be set. */
894 _mark_Block_block_visited(ir_node *node) {
895 assert(node->op == op_Block);
896 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
900 _Block_not_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));
906 _Block_block_visited(const ir_node *node) {
907 assert(node->op == op_Block);
908 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
911 static INLINE ir_node *
912 _set_Block_dead(ir_node *block) {
913 assert(_get_irn_op(block) == op_Block);
914 block->attr.block.is_dead = 1;
919 _is_Block_dead(const ir_node *block) {
920 ir_op *op = _get_irn_op(block);
925 assert(op == op_Block);
926 return block->attr.block.is_dead;
930 static INLINE tarval *_get_Const_tarval(const ir_node *node) {
931 assert(_get_irn_op(node) == op_Const);
932 return node->attr.con.tv;
935 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
937 assert(_is_ir_node(node));
939 op = _get_irn_op(node);
942 return classify_tarval(_get_Const_tarval(node));
943 else if(op == op_SymConst)
944 return CNST_SYMCONST;
946 return CNST_NO_CONST;
949 static INLINE int _is_irn_forking(const ir_node *node) {
950 return is_op_forking(_get_irn_op(node));
953 static INLINE ir_type *_get_irn_type(ir_node *node) {
954 return _get_irn_op(node)->ops.get_type(node);
957 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
958 return _get_irn_op(node)->ops.get_type_attr(node);
961 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
962 return _get_irn_op(node)->ops.get_entity_attr(node);
965 static INLINE int _is_irn_constlike(const ir_node *node) {
966 return is_op_constlike(_get_irn_op(node));
969 static INLINE int _is_irn_always_opt(const ir_node *node) {
970 return is_op_always_opt(_get_irn_op(node));
973 static INLINE int _is_irn_keep(const ir_node *node) {
974 return is_op_keep(_get_irn_op(node));
977 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
978 return is_op_start_block_placed(_get_irn_op(node));
981 static INLINE int _is_irn_machine_op(const ir_node *node) {
982 return is_op_machine(_get_irn_op(node));
985 static INLINE int _is_irn_machine_operand(const ir_node *node) {
986 return is_op_machine_operand(_get_irn_op(node));
989 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
990 return is_op_machine_user(_get_irn_op(node), n);
993 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) {
994 assert(_get_irn_op(node) == op_Cond);
995 return node->attr.cond.pred;
998 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
999 assert(_get_irn_op(node) == op_Cond);
1000 node->attr.cond.pred = pred;
1003 static INLINE int _get_Psi_n_conds(ir_node *node) {
1004 assert(_get_irn_op(node) == op_Psi);
1005 return _get_irn_arity(node) >> 1;
1008 static INLINE void *_get_irn_generic_attr(ir_node *node) {
1012 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
1016 static INLINE unsigned _get_irn_idx(const ir_node *node) {
1017 return node->node_idx;
1020 /* this section MUST contain all inline functions */
1021 #define is_ir_node(thing) _is_ir_node(thing)
1022 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
1023 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
1024 #define get_irn_arity(node) _get_irn_arity(node)
1025 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
1026 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
1027 #define get_irn_n(node, n) _get_irn_n(node, n)
1028 #define get_irn_mode(node) _get_irn_mode(node)
1029 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
1030 #define get_irn_op(node) _get_irn_op(node)
1031 #define set_irn_op(node, op) _set_irn_op(node, op)
1032 #define get_irn_opcode(node) _get_irn_opcode(node)
1033 #define get_irn_visited(node) _get_irn_visited(node)
1034 #define set_irn_visited(node, v) _set_irn_visited(node, v)
1035 #define mark_irn_visited(node) _mark_irn_visited(node)
1036 #define irn_visited(node) _irn_visited(node)
1037 #define irn_not_visited(node) _irn_not_visited(node)
1038 #define set_irn_link(node, link) _set_irn_link(node, link)
1039 #define get_irn_link(node) _get_irn_link(node)
1040 #define get_irn_pinned(node) _get_irn_pinned(node)
1041 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
1042 #define is_unop(node) _is_unop(node)
1043 #define is_binop(node) _is_binop(node)
1044 #define is_Const(node) _is_Const(node)
1045 #define is_Conv(node) _is_Conv(node)
1046 #define is_Unknown(node) _is_Unknown(node)
1047 #define is_Return(node) _is_Return(node)
1048 #define is_Call(node) _is_Call(node)
1049 #define is_Sel(node) _is_Sel(node)
1050 #define is_Mul(node) _is_Mul(node)
1051 #define is_Mux(node) _is_Mux(node)
1052 #define is_Load(node) _is_Load(node)
1053 #define is_Sync(node) _is_Sync(node)
1054 #define is_Confirm(node) _is_Confirm(node)
1055 #define is_Pin(node) _is_Pin(node)
1056 #define is_SymConst(node) _is_SymConst(node)
1057 #define is_Cond(node) _is_Cond(node)
1058 #define is_CopyB(node) _is_CopyB(node)
1059 #define is_Cmp(node) _is_Cmp(node)
1060 #define is_Alloc(node) _is_Alloc(node)
1061 #define is_Jmp(node) _is_Jmp(node)
1062 #define is_Raise(node) _is_Raise(node)
1063 #define is_Bad(node) _is_Bad(node)
1064 #define is_NoMem(node) _is_NoMem(node)
1065 #define is_Start(node) _is_Start(node)
1066 #define is_End(node) _is_End(node)
1067 #define is_Mod(node) _is_Mod(node)
1068 #define is_Div(node) _is_Div(node)
1069 #define is_DivMod(node) _is_DivMod(node)
1070 #define is_Quot(node) _is_Quot(node)
1071 #define is_Add(node) _is_Add(node)
1072 #define is_Sub(node) _is_Sub(node)
1073 #define is_no_Block(node) _is_no_Block(node)
1074 #define is_Block(node) _is_Block(node)
1075 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
1076 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
1077 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
1078 #define get_Block_block_visited(node) _get_Block_block_visited(node)
1079 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
1080 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
1081 #define Block_not_block_visited(node) _Block_not_block_visited(node)
1082 #define Block_block_visited(node) _Block_block_visited(node)
1083 #define set_Block_dead(block) _set_Block_dead(block)
1084 #define is_Block_dead(block) _is_Block_dead(block)
1085 #define get_Const_tarval(node) _get_Const_tarval(node)
1086 #define classify_Const(node) _classify_Const(node)
1087 #define is_irn_forking(node) _is_irn_forking(node)
1088 #define get_irn_type(node) _get_irn_type(node)
1089 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1090 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1091 #define is_irn_constlike(node) _is_irn_constlike(node)
1092 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1093 #define is_irn_keep(node) _is_irn_keep(node)
1094 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1095 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1096 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1097 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1098 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1099 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1100 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1101 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
1102 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
1103 #define get_irn_idx(node) _get_irn_idx(node)
1105 #define get_irn_deps(node) _get_irn_deps(node)
1106 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1107 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1109 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1110 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)