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
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
24 #include "firm_config.h"
27 #include "irgraph_t.h"
29 #include "firm_common_t.h"
30 #include "irdom_t.h" /* For size of struct dom_info. */
40 #include "irextbb_t.h"
43 /** ir node attributes **/
45 /** Block attributes */
47 /* General attributes */
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 struct ir_node **graph_arr; /**< array to store all parameters */
54 /* Attributes holding analyses information */
55 struct 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 /* exc_t exc; */ /**< role of this block for exception handling */
61 /* ir_node *handler_entry; */ /**< handler entry block iff this block is part of a region */
62 ir_node ** in_cg; /**< array with predecessors in
63 * interprocedural_view, if they differ
64 * from intraprocedural predecessors */
65 int *backedge; /**< Field n set to true if pred n is backedge.
66 @@@ @todo Ev. replace by bitfield! */
67 int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge.
68 @@@ @todo Ev. replace by bitfield! */
69 ir_extblk *extblk; /**< the extended basic block this block belongs to */
71 struct list_head succ_head; /**< A list head for all successor edges of a block. */
75 /** Start attributes */
78 /* ir_graph *irg; @@@ now in block */
81 /** Cond attributes */
83 cond_kind kind; /**< flavor of Cond */
84 long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */
85 cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */
88 /** Const attributes */
90 tarval *tv; /**< the target value */
91 type *tp; /**< the source type, for analyses. default: type_unknown. */
95 symconst_symbol sym; // old tori
97 type *tp; /**< the source type, for analyses. default: type_unknown. */
100 /** Sel attributes */
102 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 */
116 except_attr exc; /**< the exception attribute. MUST be the first one. */
117 type *cld_tp; /**< type of called procedure */
118 entity ** callee_arr; /**< result of callee analysis */
121 /** Alloc attributes */
123 except_attr exc; /**< the exception attribute. MUST be the first one. */
124 type *type; /**< Type of the allocated object. */
125 where_alloc where; /**< stack, heap or other managed part of memory */
128 /** Free attributes */
130 type *type; /**< Type of the allocated object. */
131 where_alloc where; /**< stack, heap or other managed part of memory */
134 /** InstOf attributes */
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 */
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 ent_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 ent_volatility volatility; /**< the volatility of a Store operation */
177 typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
180 * Edge info to put into an irn.
182 typedef struct _irn_edge_info_t {
183 struct list_head outs_head; /**< The list of all outs */
184 int out_count; /**< number of outs in the list */
188 /** Some irnodes just have one attribute, these are stored here,
189 some have more. Their name is 'irnodename_attr' */
191 start_attr start; /**< For Start */
192 block_attr block; /**< For Block: Fields needed to construct it */
193 cond_attr c; /**< For Cond. */
194 const_attr con; /**< For Const: contains the value of the constant and a type */
195 symconst_attr i; /**< For SymConst. */
196 sel_attr s; /**< 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 a; /**< For Alloc. */
200 free_attr f; /**< For Free. */
201 io_attr io; /**< 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 */
222 /** common structure of an irnode
223 if the node has some attributes, they are stored in attr */
225 /* ------- Basics of the representation ------- */
226 firm_kind kind; /**< distinguishes this node from others */
227 ir_op *op; /**< Opcode of this node. */
228 ir_mode *mode; /**< Mode of this node. */
229 unsigned long visited; /**< visited counter for walks of the graph */
230 struct ir_node **in; /**< array with predecessors / operands */
231 void *link; /**< to attach additional information to the node, e.g.
232 used while construction to link Phi0 nodes and
233 during optimization to link to nodes that
234 shall replace a node. */
235 /* ------- Fields for optimizations / analysis information ------- */
236 struct ir_node **out; /**< @deprecated array of out edges. */
237 struct dbg_info* dbi; /**< A pointer to information for debug support. */
238 /* ------- For debugging ------- */
241 int node_nr; /**< a unique node number for each node to make output
244 /* ------- For analyses -------- */
245 ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
246 #ifdef DO_HEAPANALYSIS
250 #if FIRM_EDGES_INPLACE
251 irn_edge_info_t edge_info; /**< everlasting out edges */
253 /* ------- Opcode depending fields -------- */
254 attr attr; /**< attribute of this node. Depends on opcode.
255 Must be last field of struct ir_node. */
259 /** Returns the array with the ins. The content of the array may not be
261 ir_node **get_irn_in (const ir_node *node);
264 /** access attributes directly */
265 const_attr get_irn_const_attr (ir_node *node);
266 long get_irn_proj_attr (ir_node *node);
267 alloc_attr get_irn_alloc_attr (ir_node *node);
268 free_attr get_irn_free_attr (ir_node *node);
269 symconst_attr get_irn_symconst_attr (ir_node *node);
270 type *get_irn_call_attr (ir_node *node);
271 type *get_irn_funccall_attr (ir_node *node);
272 sel_attr get_irn_sel_attr (ir_node *node);
273 int get_irn_phi_attr (ir_node *node);
274 block_attr get_irn_block_attr (ir_node *node);
275 load_attr get_irn_load_attr (ir_node *node);
276 store_attr get_irn_store_attr (ir_node *node);
277 except_attr get_irn_except_attr (ir_node *node);
281 * The amount of additional space for custom data to be allocated upon creating a new node.
283 extern unsigned firm_add_node_size;
285 /** Set the get_type operation of an ir_op. */
286 ir_op *firm_set_default_get_type(ir_op *op);
288 /*-------------------------------------------------------------------*/
289 /* These function are most used in libfirm. Give them as static */
290 /* functions so they can be inlined. */
291 /*-------------------------------------------------------------------*/
294 * Checks whether a pointer points to a ir node.
295 * Intern version for libFirm.
298 _is_ir_node (const void *thing) {
299 return (get_kind(thing) == k_ir_node);
303 * Gets the op of a node.
304 * Intern version for libFirm.
306 static INLINE ir_op *
307 _get_irn_op (const ir_node *node) {
312 /** Copies all attributes stored in the old node to the new node.
313 Assumes both have the same opcode and sufficient size. */
315 copy_node_attr(const ir_node *old_node, ir_node *new_node) {
316 ir_op *op = _get_irn_op(old_node);
318 /* must always exist */
319 op->copy_attr(old_node, new_node);
323 * Gets the opcode of a node.
324 * Intern version for libFirm.
327 _get_irn_opcode (const ir_node *node) {
328 assert (k_ir_node == get_kind(node));
330 return node->op->code;
334 * Returns the number of predecessors without the block predecessor.
335 * Intern version for libFirm.
338 _get_irn_intra_arity (const ir_node *node) {
340 return ARR_LEN(node->in) - 1;
344 * Returns the number of predecessors without the block predecessor.
345 * Intern version for libFirm.
348 _get_irn_inter_arity (const ir_node *node) {
350 if (_get_irn_opcode(node) == iro_Filter) {
351 assert(node->attr.filter.in_cg);
352 return ARR_LEN(node->attr.filter.in_cg) - 1;
353 } else if (_get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
354 return ARR_LEN(node->attr.block.in_cg) - 1;
356 return _get_irn_intra_arity(node);
360 * Returns the number of predecessors without the block predecessor.
361 * Intern version for libFirm.
363 extern int (*_get_irn_arity)(const ir_node *node);
366 * Intern version for libFirm.
368 static INLINE ir_node *
369 _get_irn_intra_n (const ir_node *node, int n) {
370 assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node));
372 return (node->in[n + 1] = skip_Id(node->in[n + 1]));
376 * Intern version for libFirm.
378 static INLINE ir_node*
379 _get_irn_inter_n (const ir_node *node, int n) {
380 assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node));
382 /* handle Filter and Block specially */
383 if (_get_irn_op(node) == op_Filter) {
384 assert(node->attr.filter.in_cg);
385 return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
386 } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
387 return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
390 return _get_irn_intra_n (node, n);
394 * Access to the predecessors of a node.
395 * To iterate over the operands iterate from 0 to i < get_irn_arity(),
396 * to iterate including the Block predecessor iterate from i = -1 to
398 * If it is a block, the entry -1 is NULL.
399 * Intern version for libFirm.
401 extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
404 * Gets the mode of a node.
405 * Intern version for libFirm.
407 static INLINE ir_mode *
408 _get_irn_mode (const ir_node *node)
415 * Sets the mode of a node.
416 * Intern version of libFirm.
419 _set_irn_mode (ir_node *node, ir_mode *mode)
426 * Gets the visited counter of a node.
427 * Intern version for libFirm.
429 static INLINE unsigned long
430 _get_irn_visited (const ir_node *node)
433 return node->visited;
437 * Sets the visited counter of a node.
438 * Intern version for libFirm.
441 _set_irn_visited (ir_node *node, unsigned long visited)
444 node->visited = visited;
448 * Mark a node as visited in a graph.
449 * Intern version for libFirm.
452 _mark_irn_visited (ir_node *node) {
454 node->visited = current_ir_graph->visited;
458 * Returns non-zero if a node of was visited.
459 * Intern version for libFirm.
462 _irn_visited(const ir_node *node) {
464 return (node->visited >= current_ir_graph->visited);
468 * Returns non-zero if a node of was NOT visited.
469 * Intern version for libFirm.
472 _irn_not_visited(const ir_node *node) {
474 return (node->visited < current_ir_graph->visited);
478 * Sets the link of a node.
479 * Intern version of libFirm.
482 _set_irn_link(ir_node *node, void *link) {
484 /* Link field is used for Phi construction and various optimizations
486 assert(get_irg_phase_state(current_ir_graph) != phase_building);
492 * Returns the link of a node.
493 * Intern version of libFirm.
496 _get_irn_link(const ir_node *node) {
497 assert (node && _is_ir_node(node));
502 * Returns whether the node _always_ must be pinned.
503 * I.e., the node is not floating after global cse.
505 * Intern version of libFirm.
507 static INLINE op_pin_state
508 _get_irn_pinned(const ir_node *node) {
510 assert(node && _is_ir_node(node));
512 state = _get_op_pinned(_get_irn_op(node));
514 if (state >= op_pin_state_exc_pinned)
515 return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
519 static INLINE op_pin_state
520 _is_irn_pinned_in_irg(const ir_node *node) {
521 if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
522 return get_irn_pinned(node);
523 return op_pin_state_pinned;
527 _is_unop(const ir_node *node) {
528 assert(node && _is_ir_node(node));
529 return (node->op->opar == oparity_unary);
533 _is_binop(const ir_node *node) {
534 assert(node && _is_ir_node(node));
535 return (node->op->opar == oparity_binary);
539 _is_Bad(const ir_node *node) {
541 return (node && _get_irn_op(node) == op_Bad);
545 _is_Const(const ir_node *node) {
547 return (node && _get_irn_op(node) == op_Const);
551 _is_Unknown (const ir_node *node) {
553 return (node && _get_irn_op(node) == op_Unknown);
557 _is_no_Block(const ir_node *node) {
558 assert(node && _is_ir_node(node));
559 return (_get_irn_op(node) != op_Block);
563 _is_Block(const ir_node *node) {
564 assert(node && _is_ir_node(node));
565 return (_get_irn_op(node) == op_Block);
569 _get_Block_n_cfgpreds (ir_node *node) {
570 assert(_is_Block(node));
571 return _get_irn_arity(node);
574 static INLINE ir_node *
575 _get_Block_cfgpred (ir_node *node, int pos) {
576 assert(0 <= pos && pos < get_irn_arity(node));
577 assert(_is_Block(node));
578 return _get_irn_n(node, pos);
581 /* Get the predecessor block.
583 * Returns the block corresponding to the predecessor pos.
585 * There are several ambiguities we resolve with this function:
586 * - The direct predecessor can be a Proj, which is not pinned.
587 * We walk from the predecessor to the next pinned node
588 * (skip_Proj) and return the block that node is in.
589 * - If we encounter the Bad node, this function does not return
590 * Start, but the Bad node.
592 static INLINE ir_node *
593 _get_Block_cfgpred_block(ir_node *node, int pos) {
594 ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
596 res = get_nodes_block(res);
600 static INLINE unsigned long
601 _get_Block_block_visited (ir_node *node) {
602 assert (node->op == op_Block);
603 return node->attr.block.block_visited;
607 _set_Block_block_visited (ir_node *node, unsigned long visit) {
608 assert (node->op == op_Block);
609 node->attr.block.block_visited = visit;
612 /* For this current_ir_graph must be set. */
614 _mark_Block_block_visited (ir_node *node) {
615 assert (node->op == op_Block);
616 node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
620 _Block_not_block_visited(ir_node *node) {
621 assert (node->op == op_Block);
622 return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
625 static INLINE ir_node *
626 _set_Block_dead(ir_node *block) {
627 assert(_get_irn_op(block) == op_Block);
628 block->attr.block.dead = 1;
633 _is_Block_dead(const ir_node *block) {
634 ir_op * op = _get_irn_op(block);
639 assert(op == op_Block);
640 return block->attr.block.dead;
644 static INLINE tarval *_get_Const_tarval (ir_node *node) {
645 assert (_get_irn_op(node) == op_Const);
646 return node->attr.con.tv;
649 static INLINE cnst_classify_t _classify_Const(ir_node *node) {
651 assert(_is_ir_node(node));
653 op = _get_irn_op(node);
656 return classify_tarval(_get_Const_tarval(node));
657 else if(op == op_SymConst)
658 return CNST_SYMCONST;
660 return CNST_NO_CONST;
663 static INLINE int _is_irn_forking(const ir_node *node) {
664 return is_op_forking(_get_irn_op(node));
667 static INLINE type *_get_irn_type(ir_node *node) {
668 return _get_irn_op(node)->get_type(node);
671 static INLINE int _is_irn_constlike(const ir_node *node) {
672 return is_op_constlike(_get_irn_op(node));
675 static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
676 assert (_get_irn_op(node) == op_Cond);
677 return node->attr.c.pred;
680 static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
681 assert (_get_irn_op(node) == op_Cond);
682 node->attr.c.pred = pred;
685 /* this section MUST contain all inline functions */
686 #define is_ir_node(thing) _is_ir_node(thing)
687 #define get_irn_intra_arity(node) _get_irn_intra_arity(node)
688 #define get_irn_inter_arity(node) _get_irn_inter_arity(node)
689 #define get_irn_arity(node) _get_irn_arity(node)
690 #define get_irn_intra_n(node, n) _get_irn_intra_n(node, n)
691 #define get_irn_inter_n(node, n) _get_irn_inter_n(node, n)
692 #define get_irn_n(node, n) _get_irn_n(node, n)
693 #define get_irn_mode(node) _get_irn_mode(node)
694 #define set_irn_mode(node, mode) _set_irn_mode(node, mode)
695 #define get_irn_op(node) _get_irn_op(node)
696 #define get_irn_opcode(node) _get_irn_opcode(node)
697 #define get_irn_visited(node) _get_irn_visited(node)
698 #define set_irn_visited(node, v) _set_irn_visited(node, v)
699 #define mark_irn_visited(node) _mark_irn_visited(node)
700 #define irn_visited(node) _irn_visited(node)
701 #define irn_not_visited(node) _irn_not_visited(node)
702 #define set_irn_link(node, link) _set_irn_link(node, link)
703 #define get_irn_link(node) _get_irn_link(node)
704 #define get_irn_pinned(node) _get_irn_pinned(node)
705 #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node)
706 #define is_unop(node) _is_unop(node)
707 #define is_binop(node) _is_binop(node)
708 #define is_Const(node) _is_Const(node)
709 #define is_Unknown(node) _is_Unknown(node)
710 #define is_Bad(node) _is_Bad(node)
711 #define is_no_Block(node) _is_no_Block(node)
712 #define is_Block(node) _is_Block(node)
713 #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
714 #define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
715 #define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
716 #define get_Block_block_visited(node) _get_Block_block_visited(node)
717 #define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit)
718 #define mark_Block_block_visited(node) _mark_Block_block_visited(node)
719 #define Block_not_block_visited(node) _Block_not_block_visited(node)
720 #define set_Block_dead(block) _set_Block_dead(block)
721 #define is_Block_dead(block) _is_Block_dead(block)
722 #define get_Const_tarval(node) _get_Const_tarval(node)
723 #define classify_Const(node) _classify_Const(node)
724 #define is_irn_forking(node) _is_irn_forking(node)
725 #define get_irn_type(node) _get_irn_type(node)
726 #define is_irn_constlike(node) _is_irn_constlike(node)
727 #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node)
728 #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred)
730 # endif /* _IRNODE_T_H_ */