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 matured:1; /**< If set, all in-nodes of the block are fixed. */
58 unsigned dead:1; /**< If set, the block is dead (and could be replace by a Bad. */
59 ir_node **graph_arr; /**< An array to store all parameters. */
60 /* Attributes holding analyses information */
61 ir_dom_info dom; /**< Datastructure that holds information about dominators.
63 Eventually overlay with graph_arr as only valid
64 in different phases. Eventually inline the whole
66 ir_dom_info pdom; /**< Datastructure that holds information about post-dominators. */
67 ir_node ** in_cg; /**< array with predecessors in
68 * interprocedural_view, if they differ
69 * from intraprocedural predecessors */
70 int *backedge; /**< Field n set to true if pred n is backedge.
71 @@@ @todo Ev. replace by bit field! */
72 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
73 @@@ @todo Ev. replace by bit field! */
74 ir_extblk *extblk; /**< The extended basic block this block belongs to. */
75 ir_region *region; /**< The immediate structural region this block belongs to. */
77 struct list_head succ_head; /**< A list head for all successor edges of a block. */
80 /** Cond attributes. */
82 cond_kind kind; /**< flavor of Cond */
83 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
84 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
87 /** Const attributes. */
89 tarval *tv; /**< the target value */
90 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
93 /** SymConst attributes. */
95 symconst_symbol sym; // old tori
97 ir_type *tp; /**< the source type, for analyses. default: type_unknown. */
100 /** Sel attributes. */
102 ir_entity *ent; /**< entity to select */
105 /** Exception attributes. */
107 op_pin_state pin_state; /**< the pin state for operations that might generate a exception:
108 If it's know that no exception will be generated, could be set to
109 op_pin_state_floats. */
110 #if PRECISE_EXC_CONTEXT
111 struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
115 /** Call attributes. */
117 except_attr exc; /**< the exception attribute. MUST be the first one. */
118 ir_type *cld_tp; /**< type of called procedure */
119 ir_entity ** callee_arr; /**< result of callee analysis */
122 /** Alloc attributes. */
124 except_attr exc; /**< the exception attribute. MUST be the first one. */
125 ir_type *type; /**< Type of the allocated object. */
126 where_alloc where; /**< stack, heap or other managed part of memory */
129 /** Free attributes. */
131 ir_type *type; /**< Type of the allocated object. */
132 where_alloc where; /**< stack, heap or other managed part of memory */
135 /** InstOf attributes. */
137 except_attr exc; /**< the exception attribute. MUST be the first one. */
138 ir_type *type; /**< the type of which the object pointer must be */
141 /** Filter attributes. */
143 long proj; /**< contains the result position to project (Proj) */
144 ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
145 int *backedge; /**< Field n set to true if pred n is backedge.
146 @todo Ev. replace by bitfield! */
149 /** EndReg/EndExcept attributes. */
154 /** CallBegin attributes. */
156 ir_node * call; /**< Associated Call-operation. */
159 /** Cast attributes. */
161 ir_type *totype; /**< Type of the casted node. */
164 /** Load attributes. */
166 except_attr exc; /**< The exception attribute. MUST be the first one. */
167 ir_mode *load_mode; /**< The mode of this Load operation. */
168 ir_volatility volatility; /**< The volatility of a Load/Store operation. */
171 /** Store attributes. */
173 except_attr exc; /**< the exception attribute. MUST be the first one. */
174 ir_volatility volatility; /**< the volatility of a Store operation */
177 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
179 /** CopyB attribute. */
181 except_attr exc; /**< The exception attribute. MUST be the first one. */
182 ir_type *data_type; /**< Type of the copied entity. */
185 /** Bound attribute. */
187 except_attr exc; /**< The exception attribute. MUST be the first one. */
190 /** Conv attribute. */
192 char strict; /**< If set, this is a strict Conv that cannot be removed. */
195 /** Some IR-nodes just have one attribute, these are stored here,
196 some have more. Their name is 'irnodename_attr' */
198 block_attr block; /**< For Block: Fields needed to construct it */
199 cond_attr cond; /**< For Cond. */
200 const_attr con; /**< For Const: contains the value of the constant and a type */
201 symconst_attr symc; /**< For SymConst. */
202 sel_attr sel; /**< For Sel. */
203 call_attr call; /**< For Call: pointer to the type of the method to call */
204 callbegin_attr callbegin; /**< For CallBegin */
205 alloc_attr alloc; /**< For Alloc. */
206 free_attr free; /**< For Free. */
207 io_attr instof; /**< For InstOf */
208 cast_attr cast; /**< For Cast. */
209 load_attr load; /**< For Load. */
210 store_attr store; /**< For Store. */
211 int phi0_pos; /**< For Phi. Used to remember the value defined by
212 this Phi node. Needed when the Phi is completed
213 to call get_r_internal_value to find the
214 predecessors. If this attribute is set, the Phi
215 node takes the role of the obsolete Phi0 node,
216 therefore the name. */
217 int *phi_backedge; /**< For Phi after construction.
218 Field n set to true if pred n is backedge.
219 @todo Ev. replace by bitfield! */
220 long proj; /**< For Proj: contains the result position to project */
221 confirm_attr confirm_cmp; /**< For Confirm: compare operation */
222 filter_attr filter; /**< For Filter */
223 end_attr end; /**< For EndReg, EndExcept */
224 except_attr except; /**< For Phi node construction in case of exceptions */
225 copyb_attr copyb; /**< For CopyB operation */
226 bound_attr bound; /**< For Bound operation */
227 conv_attr conv; /**< For Conv operation */
231 * Edge info to put into an irn.
233 typedef struct _irn_edge_kind_info_t {
234 struct list_head outs_head; /**< The list of all outs. */
235 int out_count; /**< Number of outs in the list. */
238 typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST];
241 * The common structure of an irnode.
242 * If the node has some attributes, they are stored in the attr field.
245 /* ------- Basics of the representation ------- */
246 firm_kind kind; /**< Distinguishes this node from others. */
247 ir_op *op; /**< The Opcode of this node. */
248 ir_mode *mode; /**< The Mode of this node. */
249 struct ir_node **in; /**< The array of predecessors / operands. */
250 unsigned long visited; /**< The visited counter for walks of the graph. */
251 unsigned node_idx; /**< The node index of this node in its graph. */
252 void *link; /**< To attach additional information to the node, e.g.
253 used while construction to link Phi0 nodes and
254 during optimization to link to nodes that
255 shall replace a node. */
256 /* ------- Fields for optimizations / analysis information ------- */
257 struct ir_node **out; /**< @deprecated array of out edges. */
258 struct dbg_info *dbi; /**< A pointer to information for debug support. */
259 /* ------- For debugging ------- */
262 long node_nr; /**< A unique node number for each node to make output
265 /* ------- For analyses -------- */
266 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
267 #ifdef DO_HEAPANALYSIS
268 struct abstval *av; /**< Heapanalysis: The abstract value of this node. */
269 struct section *sec; /**< Heapanalysis: The section of this node. */
271 struct ir_node **deps; /**< Additional dependencies induced by state. */
272 irn_edges_info_t edge_info; /**< Everlasting out edges. */
273 /* ------- Opcode depending fields -------- */
274 attr attr; /**< The set of attributes of this node. Depends on opcode.
275 Must be last field of struct ir_node. */
280 * Returns the array with the ins. The content of the array may not be
282 * Note that this function returns the whole in array including the
283 * block predecessor. So, it is NOT symmetric with set_irn_in().
285 ir_node **get_irn_in (const ir_node *node);
288 /** access attributes directly */
289 const_attr get_irn_const_attr (ir_node *node);
290 long get_irn_proj_attr (ir_node *node);
291 alloc_attr get_irn_alloc_attr (ir_node *node);
292 free_attr get_irn_free_attr (ir_node *node);
293 symconst_attr get_irn_symconst_attr (ir_node *node);
294 ir_type *get_irn_call_attr (ir_node *node);
295 ir_type *get_irn_funccall_attr (ir_node *node);
296 sel_attr get_irn_sel_attr (ir_node *node);
297 int get_irn_phi_attr (ir_node *node);
298 block_attr get_irn_block_attr (ir_node *node);
299 load_attr get_irn_load_attr (ir_node *node);
300 store_attr get_irn_store_attr (ir_node *node);
301 except_attr get_irn_except_attr (ir_node *node);
305 * The amount of additional space for custom data to be allocated upon creating a new node.
307 extern unsigned firm_add_node_size;
310 * Sets the get_type operation for an ir_op_ops.
312 * @param code the opcode for the default operation
313 * @param ops the operations initialized
318 ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops);
321 * Sets the get_type_attr operation for an ir_op_ops.
323 * @param code the opcode for the default operation
324 * @param ops the operations initialized
329 ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops);
332 * Sets the get_entity_attr operation for an ir_op_ops.
334 * @param code the opcode for the default operation
335 * @param ops the operations initialized
340 ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops);
342 /*-------------------------------------------------------------------*/
343 /* These function are most used in libfirm. Give them as static */
344 /* functions so they can be inlined. */
345 /*-------------------------------------------------------------------*/
348 * Checks whether a pointer points to a ir node.
349 * Intern version for libFirm.
352 _is_ir_node(const void *thing) {
353 return (get_kind(thing) == k_ir_node);
357 * Gets the op of a node.
358 * Intern version for libFirm.
360 static INLINE ir_op *
361 _get_irn_op(const ir_node *node) {
367 _set_irn_op(ir_node *node, ir_op *op) {
372 /** Copies all attributes stored in the old node to the new node.
373 Assumes both have the same opcode and sufficient size. */
375 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
376 ir_op *op = _get_irn_op(old_node);
378 /* must always exist */
379 op->ops.copy_attr(old_node, new_node);
383 * Gets the opcode of a node.
384 * Intern version for libFirm.
386 static INLINE ir_opcode
387 _get_irn_opcode(const ir_node *node) {
388 assert(k_ir_node == get_kind(node));
390 return node->op->code;
394 * Returns the number of predecessors without the block predecessor.
395 * Intern version for libFirm.
398 _get_irn_intra_arity(const ir_node *node) {
400 return ARR_LEN(node->in) - 1;
404 * Returns the number of predecessors without the block predecessor.
405 * Intern version for libFirm.
408 _get_irn_inter_arity(const ir_node *node) {
410 if (_get_irn_op(node) == op_Filter) {
411 assert(node->attr.filter.in_cg);
412 return ARR_LEN(node->attr.filter.in_cg) - 1;
413 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
414 return ARR_LEN(node->attr.block.in_cg) - 1;
416 return _get_irn_intra_arity(node);
420 * Returns the number of predecessors without the block predecessor.
421 * Intern version for libFirm.
423 extern int (*_get_irn_arity)(const ir_node *node);
426 * Intern version for libFirm.
428 static INLINE ir_node *
429 _get_irn_intra_n(const ir_node *node, int n) {
433 assert(-1 <= n && n < _get_irn_intra_arity(node));
435 nn = node->in[n + 1];
437 /* only block inputs are allowed to be NULL */
438 assert(n == -1 && "NULL input of a node");
441 if (nn->op != op_Id) return nn;
443 return (node->in[n + 1] = skip_Id(nn));
447 * Intern version for libFirm.
449 static INLINE ir_node*
450 _get_irn_inter_n(const ir_node *node, int n) {
451 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
453 /* handle Filter and Block specially */
454 if (_get_irn_op(node) == op_Filter) {
455 assert(node->attr.filter.in_cg);
456 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
457 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
458 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
461 return _get_irn_intra_n(node, n);
465 * Access to the predecessors of a node.
466 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
467 * to iterate including the Block predecessor iterate from i = -1 to
469 * If it is a block, the entry -1 is NULL.
470 * Intern version for libFirm.
472 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
474 static INLINE int _get_irn_deps(const ir_node *node) {
475 return node->deps ? ARR_LEN(node->deps) : 0;
478 static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos) {
479 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
480 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
481 return node->deps[pos];
485 _set_irn_dep(ir_node *node, int pos, ir_node *dep) {
488 assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
489 assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
490 old = node->deps[pos];
491 node->deps[pos] = dep;
492 edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
497 _get_irn_ins_or_deps(const ir_node *irn) {
498 return _get_irn_deps(irn) + _get_irn_arity(irn);
501 static INLINE ir_node *
502 _get_irn_in_or_dep(const ir_node *irn, int pos) {
503 int n_in = get_irn_arity(irn);
504 return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
508 * Gets the mode of a node.
509 * Intern version for libFirm.
511 static INLINE ir_mode *
512 _get_irn_mode(const ir_node *node) {
518 * Sets the mode of a node.
519 * Intern version of libFirm.
522 _set_irn_mode(ir_node *node, ir_mode *mode) {
528 * Gets the visited counter of a node.
529 * Intern version for libFirm.
531 static INLINE unsigned long
532 _get_irn_visited(const ir_node *node) {
534 return node->visited;
538 * Sets the visited counter of a node.
539 * Intern version for libFirm.
542 _set_irn_visited(ir_node *node, unsigned long visited) {
544 node->visited = visited;
548 * Mark a node as visited in a graph.
549 * Intern version for libFirm.
552 _mark_irn_visited(ir_node *node) {
554 node->visited = current_ir_graph->visited;
558 * Returns non-zero if a node of was visited.
559 * Intern version for libFirm.
562 _irn_visited(const ir_node *node) {
564 return (node->visited >= current_ir_graph->visited);
568 * Returns non-zero if a node of was NOT visited.
569 * Intern version for libFirm.
572 _irn_not_visited(const ir_node *node) {
574 return (node->visited < current_ir_graph->visited);
578 * Sets the link of a node.
579 * Intern version of libFirm.
582 _set_irn_link(ir_node *node, void *link) {
584 /* Link field is used for Phi construction and various optimizations
586 assert(get_irg_phase_state(get_irn_irg(node)) != phase_building);
592 * Returns the link of a node.
593 * Intern version of libFirm.
596 _get_irn_link(const ir_node *node) {
597 assert(node && _is_ir_node(node));
602 * Returns whether the node _always_ must be pinned.
603 * I.e., the node is not floating after global cse.
605 * Intern version of libFirm.
607 static INLINE op_pin_state
608 _get_irn_pinned(const ir_node *node) {
610 assert(node && _is_ir_node(node));
612 state = _get_op_pinned(_get_irn_op(node));
614 if (state >= op_pin_state_exc_pinned)
615 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
619 static INLINE op_pin_state
620 _is_irn_pinned_in_irg(const ir_node *node) {
621 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
622 return get_irn_pinned(node);
623 return op_pin_state_pinned;
627 _is_unop(const ir_node *node) {
628 assert(node && _is_ir_node(node));
629 return (node->op->opar == oparity_unary);
633 _is_binop(const ir_node *node) {
634 assert(node && _is_ir_node(node));
635 return (node->op->opar == oparity_binary);
639 _is_Bad(const ir_node *node) {
641 return (_get_irn_op(node) == op_Bad);
645 _is_NoMem(const ir_node *node) {
647 return (_get_irn_op(node) == op_NoMem);
651 _is_Mod(const ir_node *node) {
653 return (_get_irn_op(node) == op_Mod);
657 _is_Div(const ir_node *node) {
659 return (_get_irn_op(node) == op_Div);
663 _is_DivMod(const ir_node *node) {
665 return (_get_irn_op(node) == op_DivMod);
669 _is_Quot(const ir_node *node) {
671 return (_get_irn_op(node) == op_Quot);
675 _is_Add(const ir_node *node) {
677 return (_get_irn_op(node) == op_Add);
681 _is_Sub(const ir_node *node) {
683 return (_get_irn_op(node) == op_Sub);
687 _is_Start(const ir_node *node) {
689 return (_get_irn_op(node) == op_Start);
693 _is_End(const ir_node *node) {
695 return (_get_irn_op(node) == op_End);
699 _is_Const(const ir_node *node) {
701 return (_get_irn_op(node) == op_Const);
705 _is_Conv(const ir_node *node) {
707 return (_get_irn_op(node) == op_Conv);
711 _is_CopyB(const ir_node *node) {
713 return (_get_irn_op(node) == op_CopyB);
717 _is_Unknown(const ir_node *node) {
719 return (_get_irn_op(node) == op_Unknown);
723 _is_Return(const ir_node *node) {
725 return (_get_irn_op(node) == op_Return);
729 _is_Call(const ir_node *node) {
731 return (_get_irn_op(node) == op_Call);
735 _is_Sel(const ir_node *node) {
737 return (_get_irn_op(node) == op_Sel);
741 _is_Mul(const ir_node *node) {
743 return (_get_irn_op(node) == op_Mul);
747 _is_Mux(const ir_node *node) {
750 ir_op *op = _get_irn_op(node);
751 return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3));
757 _is_Load(const ir_node *node) {
759 return (_get_irn_op(node) == op_Load);
763 _is_Store(const ir_node *node) {
765 return (_get_irn_op(node) == op_Store);
769 _is_Sync(const ir_node *node) {
771 return (_get_irn_op(node) == op_Sync);
775 _is_Confirm(const ir_node *node) {
777 return (_get_irn_op(node) == op_Confirm);
781 _is_Pin(const ir_node *node) {
783 return (_get_irn_op(node) == op_Pin);
787 _is_SymConst(const ir_node *node) {
789 return (_get_irn_op(node) == op_SymConst);
793 _is_Cond(const ir_node *node) {
795 return (_get_irn_op(node) == op_Cond);
799 _is_Cmp(const ir_node *node) {
801 return (_get_irn_op(node) == op_Cmp);
805 _is_Alloc(const ir_node *node) {
807 return (_get_irn_op(node) == op_Alloc);
811 _is_Jmp(const ir_node *node) {
813 return (_get_irn_op(node) == op_Jmp);
817 _is_Raise(const ir_node *node) {
819 return (_get_irn_op(node) == op_Raise);
823 _is_no_Block(const ir_node *node) {
824 assert(node && _is_ir_node(node));
825 return (_get_irn_op(node) != op_Block);
829 _is_Block(const ir_node *node) {
830 assert(node && _is_ir_node(node));
831 return (_get_irn_op(node) == op_Block);
835 _get_Block_n_cfgpreds(const ir_node *node) {
836 assert(_is_Block(node));
837 return _get_irn_arity(node);
840 static INLINE ir_node *
841 _get_Block_cfgpred(ir_node *node, int pos) {
842 assert(0 <= pos && pos < get_irn_arity(node));
843 assert(_is_Block(node));
844 return _get_irn_n(node, pos);
847 /* Get the predecessor block.
849 * Returns the block corresponding to the predecessor pos.
851 * There are several ambiguities we resolve with this function:
852 * - The direct predecessor can be a Proj, which is not pinned.
853 * We walk from the predecessor to the next pinned node
854 * (skip_Proj) and return the block that node is in.
855 * - If we encounter the Bad node, this function does not return
856 * Start, but the Bad node.
858 static INLINE ir_node *
859 _get_Block_cfgpred_block(ir_node *node, int pos) {
860 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
862 res = get_nodes_block(res);
866 static INLINE unsigned long
867 _get_Block_block_visited(const ir_node *node) {
868 assert(node->op == op_Block);
869 return node->attr.block.block_visited;
873 _set_Block_block_visited(ir_node *node, unsigned long visit) {
874 assert(node->op == op_Block);
875 node->attr.block.block_visited = visit;
878 /* For this current_ir_graph must be set. */
880 _mark_Block_block_visited(ir_node *node) {
881 assert(node->op == op_Block);
882 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
886 _Block_not_block_visited(const ir_node *node) {
887 assert(node->op == op_Block);
888 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
892 _Block_block_visited(const ir_node *node) {
893 assert(node->op == op_Block);
894 return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
897 static INLINE ir_node *
898 _set_Block_dead(ir_node *block) {
899 assert(_get_irn_op(block) == op_Block);
900 block->attr.block.dead = 1;
905 _is_Block_dead(const ir_node *block) {
906 ir_op *op = _get_irn_op(block);
911 assert(op == op_Block);
912 return block->attr.block.dead;
916 static INLINE tarval *_get_Const_tarval(ir_node *node) {
917 assert(_get_irn_op(node) == op_Const);
918 return node->attr.con.tv;
921 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
923 assert(_is_ir_node(node));
925 op = _get_irn_op(node);
928 return classify_tarval(_get_Const_tarval(node));
929 else if(op == op_SymConst)
930 return CNST_SYMCONST;
932 return CNST_NO_CONST;
935 static INLINE int _is_irn_forking(const ir_node *node) {
936 return is_op_forking(_get_irn_op(node));
939 static INLINE ir_type *_get_irn_type(ir_node *node) {
940 return _get_irn_op(node)->ops.get_type(node);
943 static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
944 return _get_irn_op(node)->ops.get_type_attr(node);
947 static INLINE ir_entity *_get_irn_entity_attr(ir_node *node) {
948 return _get_irn_op(node)->ops.get_entity_attr(node);
951 static INLINE int _is_irn_constlike(const ir_node *node) {
952 return is_op_constlike(_get_irn_op(node));
955 static INLINE int _is_irn_always_opt(const ir_node *node) {
956 return is_op_always_opt(_get_irn_op(node));
959 static INLINE int _is_irn_keep(const ir_node *node) {
960 return is_op_keep(_get_irn_op(node));
963 static INLINE int _is_irn_start_block_placed(const ir_node *node) {
964 return is_op_start_block_placed(_get_irn_op(node));
967 static INLINE int _is_irn_machine_op(const ir_node *node) {
968 return is_op_machine(_get_irn_op(node));
971 static INLINE int _is_irn_machine_operand(const ir_node *node) {
972 return is_op_machine_operand(_get_irn_op(node));
975 static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) {
976 return is_op_machine_user(_get_irn_op(node), n);
979 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
980 assert(_get_irn_op(node) == op_Cond);
981 return node->attr.cond.pred;
984 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
985 assert(_get_irn_op(node) == op_Cond);
986 node->attr.cond.pred = pred;
989 static INLINE int _get_Psi_n_conds(ir_node *node) {
990 assert(_get_irn_op(node) == op_Psi);
991 return _get_irn_arity(node) >> 1;
994 static INLINE void *_get_irn_generic_attr(ir_node *node) {
998 static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) {
1002 static INLINE unsigned _get_irn_idx(const ir_node *node) {
1003 return node->node_idx;
1006 /* this section MUST contain all inline functions */
1007 #define is_ir_node(thing) _is_ir_node(thing)
1008 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
1009 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
1010 #define get_irn_arity(node) _get_irn_arity(node)
1011 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
1012 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
1013 #define get_irn_n(node, n) _get_irn_n(node, n)
1014 #define get_irn_mode(node) _get_irn_mode(node)
1015 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
1016 #define get_irn_op(node) _get_irn_op(node)
1017 #define set_irn_op(node, op) _set_irn_op(node, op)
1018 #define get_irn_opcode(node) _get_irn_opcode(node)
1019 #define get_irn_visited(node) _get_irn_visited(node)
1020 #define set_irn_visited(node, v) _set_irn_visited(node, v)
1021 #define mark_irn_visited(node) _mark_irn_visited(node)
1022 #define irn_visited(node) _irn_visited(node)
1023 #define irn_not_visited(node) _irn_not_visited(node)
1024 #define set_irn_link(node, link) _set_irn_link(node, link)
1025 #define get_irn_link(node) _get_irn_link(node)
1026 #define get_irn_pinned(node) _get_irn_pinned(node)
1027 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
1028 #define is_unop(node) _is_unop(node)
1029 #define is_binop(node) _is_binop(node)
1030 #define is_Const(node) _is_Const(node)
1031 #define is_Conv(node) _is_Conv(node)
1032 #define is_Unknown(node) _is_Unknown(node)
1033 #define is_Return(node) _is_Return(node)
1034 #define is_Call(node) _is_Call(node)
1035 #define is_Sel(node) _is_Sel(node)
1036 #define is_Mul(node) _is_Mul(node)
1037 #define is_Mux(node) _is_Mux(node)
1038 #define is_Load(node) _is_Load(node)
1039 #define is_Sync(node) _is_Sync(node)
1040 #define is_Confirm(node) _is_Confirm(node)
1041 #define is_Pin(node) _is_Pin(node)
1042 #define is_SymConst(node) _is_SymConst(node)
1043 #define is_Cond(node) _is_Cond(node)
1044 #define is_CopyB(node) _is_CopyB(node)
1045 #define is_Cmp(node) _is_Cmp(node)
1046 #define is_Alloc(node) _is_Alloc(node)
1047 #define is_Jmp(node) _is_Jmp(node)
1048 #define is_Raise(node) _is_Raise(node)
1049 #define is_Bad(node) _is_Bad(node)
1050 #define is_NoMem(node) _is_NoMem(node)
1051 #define is_Start(node) _is_Start(node)
1052 #define is_End(node) _is_End(node)
1053 #define is_Mod(node) _is_Mod(node)
1054 #define is_Div(node) _is_Div(node)
1055 #define is_DivMod(node) _is_DivMod(node)
1056 #define is_Quot(node) _is_Quot(node)
1057 #define is_Add(node) _is_Add(node)
1058 #define is_Sub(node) _is_Sub(node)
1059 #define is_no_Block(node) _is_no_Block(node)
1060 #define is_Block(node) _is_Block(node)
1061 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
1062 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
1063 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
1064 #define get_Block_block_visited(node) _get_Block_block_visited(node)
1065 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
1066 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
1067 #define Block_not_block_visited(node) _Block_not_block_visited(node)
1068 #define Block_block_visited(node) _Block_block_visited(node)
1069 #define set_Block_dead(block) _set_Block_dead(block)
1070 #define is_Block_dead(block) _is_Block_dead(block)
1071 #define get_Const_tarval(node) _get_Const_tarval(node)
1072 #define classify_Const(node) _classify_Const(node)
1073 #define is_irn_forking(node) _is_irn_forking(node)
1074 #define get_irn_type(node) _get_irn_type(node)
1075 #define get_irn_type_attr(node) _get_irn_type_attr(node)
1076 #define get_irn_entity_attr(node) _get_irn_entity_attr(node)
1077 #define is_irn_constlike(node) _is_irn_constlike(node)
1078 #define is_irn_always_opt(node) _is_irn_always_opt(node)
1079 #define is_irn_keep(node) _is_irn_keep(node)
1080 #define is_irn_start_block_placed(node) _is_irn_start_block_placed(node)
1081 #define is_irn_machine_op(node) _is_irn_machine_op(node)
1082 #define is_irn_machine_operand(node) _is_irn_machine_operand(node)
1083 #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n)
1084 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
1085 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
1086 #define get_Psi_n_conds(node) _get_Psi_n_conds(node)
1087 #define get_irn_generic_attr(node) _get_irn_generic_attr(node)
1088 #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node)
1089 #define get_irn_idx(node) _get_irn_idx(node)
1091 #define get_irn_deps(node) _get_irn_deps(node)
1092 #define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
1093 #define get_irn_dep(node, pos) _get_irn_dep(node, pos)
1095 #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node)
1096 #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos)