X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode_t.h;h=f5050e934a5bfe4dc0122cfb86c42b4122b188a3;hb=637542932dc27dcdfc7def09b58d9d5d4c34fb77;hp=084c9634ace73b4c2ec53156cac5f70e354d8859;hpb=64d38975c523c9cfe4a3890af23e9192f557e293;p=libfirm diff --git a/ir/ir/irnode_t.h b/ir/ir/irnode_t.h index 084c9634a..f5050e934 100644 --- a/ir/ir/irnode_t.h +++ b/ir/ir/irnode_t.h @@ -33,8 +33,11 @@ #include "array.h" #include "set.h" +#include "list.h" #include "entity_t.h" #include "type_t.h" +#include "tv_t.h" +#include "irextbb_t.h" /** ir node attributes **/ @@ -63,6 +66,8 @@ typedef struct { @@@ @todo Ev. replace by bitfield! */ int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge. @@@ @todo Ev. replace by bitfield! */ + ir_extblk *extblk; /**< the extended basic block this block belongs to */ + } block_attr; /** Start attributes */ @@ -118,6 +123,12 @@ typedef struct { where_alloc where; /**< stack, heap or other managed part of memory */ } alloc_attr; +/** Free attributes */ +typedef struct { + type *type; /**< Type of the allocated object. */ + where_alloc where; /**< stack, heap or other managed part of memory */ +} free_attr; + /** InstOf attributes */ typedef struct { @@ -161,7 +172,16 @@ typedef struct { ent_volatility volatility; /**< the volatility of a Store operation */ } store_attr; -typedef pn_Cmp confirm_attr; /** Attribute to hold compare operation */ +typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */ + +/** + * Edge info to put into an irn. + */ +typedef struct _irn_edge_info_t { + struct list_head outs_head; /**< The list of all outs */ + int out_count; /**< number of outs in the list */ +} irn_edge_info_t; + /** Some irnodes just have one attribute, these are stored here, some have more. Their name is 'irnodename_attr' */ @@ -174,9 +194,9 @@ typedef union { sel_attr s; /**< For Sel. */ call_attr call; /**< For Call: pointer to the type of the method to call */ callbegin_attr callbegin; /**< For CallBegin */ - alloc_attr a; /**< For Alloc. */ + alloc_attr a; /**< For Alloc. */ + free_attr f; /**< For Free. */ io_attr io; /**< For InstOf */ - type *f; /**< For Free. */ cast_attr cast; /**< For Cast. */ load_attr load; /**< For Load. */ store_attr store; /**< For Store. */ @@ -211,11 +231,11 @@ struct ir_node { during optimization to link to nodes that shall replace a node. */ /* ------- Fields for optimizations / analysis information ------- */ - struct ir_node **out; /**< array of out edges */ + struct ir_node **out; /**< @deprecated array of out edges. */ struct dbg_info* dbi; /**< A pointer to information for debug support. */ /* ------- For debugging ------- */ #ifdef DEBUG_libfirm - int out_valid; /** < indicate that out edges are valid */ + int out_valid; int node_nr; /**< a unique node number for each node to make output readable. */ #endif @@ -224,6 +244,9 @@ struct ir_node { #ifdef DO_HEAPANALYSIS struct abstval *av; struct section *sec; +#endif +#if FIRM_EDGES_INPLACE + irn_edge_info_t edge_info; /**< everlasting out edges */ #endif /* ------- Opcode depending fields -------- */ attr attr; /**< attribute of this node. Depends on opcode. @@ -240,7 +263,7 @@ ir_node **get_irn_in (const ir_node *node); const_attr get_irn_const_attr (ir_node *node); long get_irn_proj_attr (ir_node *node); alloc_attr get_irn_alloc_attr (ir_node *node); -type *get_irn_free_attr (ir_node *node); +free_attr get_irn_free_attr (ir_node *node); symconst_attr get_irn_symconst_attr (ir_node *node); type *get_irn_call_attr (ir_node *node); type *get_irn_funccall_attr (ir_node *node); @@ -252,11 +275,14 @@ store_attr get_irn_store_attr (ir_node *node); except_attr get_irn_except_attr (ir_node *node); /** @} */ -/* +/** * The amount of additional space for custom data to be allocated upon creating a new node. */ extern unsigned firm_add_node_size; +/** Set the get_type operation of an ir_op. */ +ir_op *firm_set_default_get_type(ir_op *op); + /*-------------------------------------------------------------------*/ /* These function are most used in libfirm. Give them as static */ /* functions so they can be inlined. */ @@ -267,7 +293,7 @@ extern unsigned firm_add_node_size; * Intern version for libFirm. */ static INLINE int -__is_ir_node (const void *thing) { +_is_ir_node (const void *thing) { return (get_kind(thing) == k_ir_node); } @@ -276,7 +302,7 @@ __is_ir_node (const void *thing) { * Intern version for libFirm. */ static INLINE ir_op * -__get_irn_op (const ir_node *node) { +_get_irn_op (const ir_node *node) { assert (node); return node->op; } @@ -285,7 +311,7 @@ __get_irn_op (const ir_node *node) { Assumes both have the same opcode and sufficient size. */ static INLINE void copy_node_attr(const ir_node *old_node, ir_node *new_node) { - ir_op *op = __get_irn_op(old_node); + ir_op *op = _get_irn_op(old_node); /* must always exist */ op->copy_attr(old_node, new_node); @@ -296,9 +322,9 @@ copy_node_attr(const ir_node *old_node, ir_node *new_node) { * Intern version for libFirm. */ static INLINE opcode -__get_irn_opcode (const ir_node *node) { +_get_irn_opcode (const ir_node *node) { assert (k_ir_node == get_kind(node)); - assert (node -> op); + assert (node->op); return node->op->code; } @@ -307,7 +333,7 @@ __get_irn_opcode (const ir_node *node) { * Intern version for libFirm. */ static INLINE int -__get_irn_intra_arity (const ir_node *node) { +_get_irn_intra_arity (const ir_node *node) { assert(node); return ARR_LEN(node->in) - 1; } @@ -317,29 +343,29 @@ __get_irn_intra_arity (const ir_node *node) { * Intern version for libFirm. */ static INLINE int -__get_irn_inter_arity (const ir_node *node) { +_get_irn_inter_arity (const ir_node *node) { assert(node); - if (__get_irn_opcode(node) == iro_Filter) { + if (_get_irn_opcode(node) == iro_Filter) { assert(node->attr.filter.in_cg); return ARR_LEN(node->attr.filter.in_cg) - 1; - } else if (__get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { + } else if (_get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { return ARR_LEN(node->attr.block.in_cg) - 1; } - return __get_irn_intra_arity(node); + return _get_irn_intra_arity(node); } /** * Returns the number of predecessors without the block predecessor. * Intern version for libFirm. */ -extern int (*__get_irn_arity)(const ir_node *node); +extern int (*_get_irn_arity)(const ir_node *node); /** * Intern version for libFirm. */ static INLINE ir_node * -__get_irn_intra_n (const ir_node *node, int n) { - assert(node); assert(-1 <= n && n < __get_irn_intra_arity(node)); +_get_irn_intra_n (const ir_node *node, int n) { + assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node)); return (node->in[n + 1] = skip_Id(node->in[n + 1])); } @@ -348,18 +374,18 @@ __get_irn_intra_n (const ir_node *node, int n) { * Intern version for libFirm. */ static INLINE ir_node* -__get_irn_inter_n (const ir_node *node, int n) { - assert(node); assert(-1 <= n && n < __get_irn_inter_arity(node)); +_get_irn_inter_n (const ir_node *node, int n) { + assert(node); assert(-1 <= n && n < _get_irn_inter_arity(node)); /* handle Filter and Block specially */ - if (__get_irn_opcode(node) == iro_Filter) { + if (_get_irn_op(node) == op_Filter) { assert(node->attr.filter.in_cg); return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1])); - } else if (__get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { + } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) { return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1])); } - return __get_irn_intra_n (node, n); + return _get_irn_intra_n (node, n); } /** @@ -370,14 +396,14 @@ __get_irn_inter_n (const ir_node *node, int n) { * If it is a block, the entry -1 is NULL. * Intern version for libFirm. */ -extern ir_node *(*__get_irn_n)(const ir_node *node, int n); +extern ir_node *(*_get_irn_n)(const ir_node *node, int n); /** * Gets the mode of a node. * Intern version for libFirm. */ static INLINE ir_mode * -__get_irn_mode (const ir_node *node) +_get_irn_mode (const ir_node *node) { assert (node); return node->mode; @@ -388,7 +414,7 @@ __get_irn_mode (const ir_node *node) * Intern version of libFirm. */ static INLINE void -__set_irn_mode (ir_node *node, ir_mode *mode) +_set_irn_mode (ir_node *node, ir_mode *mode) { assert (node); node->mode = mode; @@ -399,7 +425,7 @@ __set_irn_mode (ir_node *node, ir_mode *mode) * Intern version for libFirm. */ static INLINE unsigned long -__get_irn_visited (const ir_node *node) +_get_irn_visited (const ir_node *node) { assert (node); return node->visited; @@ -410,7 +436,7 @@ __get_irn_visited (const ir_node *node) * Intern version for libFirm. */ static INLINE void -__set_irn_visited (ir_node *node, unsigned long visited) +_set_irn_visited (ir_node *node, unsigned long visited) { assert (node); node->visited = visited; @@ -421,7 +447,7 @@ __set_irn_visited (ir_node *node, unsigned long visited) * Intern version for libFirm. */ static INLINE void -__mark_irn_visited (ir_node *node) { +_mark_irn_visited (ir_node *node) { assert (node); node->visited = current_ir_graph->visited; } @@ -431,7 +457,7 @@ __mark_irn_visited (ir_node *node) { * Intern version for libFirm. */ static INLINE int -__irn_visited(const ir_node *node) { +_irn_visited(const ir_node *node) { assert (node); return (node->visited >= current_ir_graph->visited); } @@ -441,7 +467,7 @@ __irn_visited(const ir_node *node) { * Intern version for libFirm. */ static INLINE int -__irn_not_visited(const ir_node *node) { +_irn_not_visited(const ir_node *node) { assert (node); return (node->visited < current_ir_graph->visited); } @@ -451,7 +477,7 @@ __irn_not_visited(const ir_node *node) { * Intern version of libFirm. */ static INLINE void -__set_irn_link(ir_node *node, void *link) { +_set_irn_link(ir_node *node, void *link) { assert (node); /* Link field is used for Phi construction and various optimizations in iropt. */ @@ -465,8 +491,8 @@ __set_irn_link(ir_node *node, void *link) { * Intern version of libFirm. */ static INLINE void * -__get_irn_link(const ir_node *node) { - assert (node && is_ir_node(node)); +_get_irn_link(const ir_node *node) { + assert (node && _is_ir_node(node)); return node->link; } @@ -475,54 +501,92 @@ __get_irn_link(const ir_node *node) { * Intern version of libFirm. */ static INLINE op_pin_state -__get_irn_pinned(const ir_node *node) { - assert(node && is_ir_node(node)); - op_pin_state state = __get_op_pinned(__get_irn_op(node)); +_get_irn_pinned(const ir_node *node) { + op_pin_state state; + assert(node && _is_ir_node(node)); + state = _get_op_pinned(_get_irn_op(node)); if (state >= op_pin_state_exc_pinned) return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned; return state; } static INLINE int -__is_unop(const ir_node *node) { - assert(node && is_ir_node(node)); +_is_unop(const ir_node *node) { + assert(node && _is_ir_node(node)); return (node->op->opar == oparity_unary); } static INLINE int -__is_binop(const ir_node *node) { - assert(node && is_ir_node(node)); +_is_binop(const ir_node *node) { + assert(node && _is_ir_node(node)); return (node->op->opar == oparity_binary); } static INLINE int -__is_Bad(const ir_node *node) { +_is_Bad(const ir_node *node) { + assert(node); + return (node && _get_irn_op(node) == op_Bad); +} + +static INLINE int +_is_Const(const ir_node *node) { + assert(node); + return (node && _get_irn_op(node) == op_Const); +} + +static INLINE int +_is_Unknown (const ir_node *node) { assert(node); - return (node && __get_irn_op(node) == op_Bad); + return (node && _get_irn_op(node) == op_Unknown); } static INLINE int -__is_no_Block(const ir_node *node) { - assert(node && is_ir_node(node)); - return (__get_irn_op(node) != op_Block); +_is_no_Block(const ir_node *node) { + assert(node && _is_ir_node(node)); + return (_get_irn_op(node) != op_Block); } static INLINE int -__is_Block(const ir_node *node) { - assert(node && is_ir_node(node)); - return (__get_irn_op(node) == op_Block); +_is_Block(const ir_node *node) { + assert(node && _is_ir_node(node)); + return (_get_irn_op(node) == op_Block); +} + +static INLINE unsigned long +_get_Block_block_visited (ir_node *node) { + assert (node->op == op_Block); + return node->attr.block.block_visited; +} + +static INLINE void +_set_Block_block_visited (ir_node *node, unsigned long visit) { + assert (node->op == op_Block); + node->attr.block.block_visited = visit; +} + +/* For this current_ir_graph must be set. */ +static INLINE void +_mark_Block_block_visited (ir_node *node) { + assert (node->op == op_Block); + node->attr.block.block_visited = get_irg_block_visited(current_ir_graph); +} + +static INLINE int +_Block_not_block_visited(ir_node *node) { + assert (node->op == op_Block); + return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph)); } static INLINE ir_node * -__set_Block_dead(ir_node *block) { - assert(__get_irn_op(block) == op_Block); +_set_Block_dead(ir_node *block) { + assert(_get_irn_op(block) == op_Block); block->attr.block.dead = 1; return block; } static INLINE int -__is_Block_dead(const ir_node *block) { - ir_op * op = __get_irn_op(block); +_is_Block_dead(const ir_node *block) { + ir_op * op = _get_irn_op(block); if (op == op_Bad) return 1; @@ -532,31 +596,63 @@ __is_Block_dead(const ir_node *block) { } } +static INLINE tarval *_get_Const_tarval (ir_node *node) { + assert (_get_irn_op(node) == op_Const); + return node->attr.con.tv; +} + +static INLINE cnst_classify_t _classify_Const(ir_node *node) { + ir_op *op; + assert(_is_ir_node(node)); + + op = _get_irn_op(node); + + if(op == op_Const) + return classify_tarval(_get_Const_tarval(node)); + else if(op == op_SymConst) + return CNST_SYMCONST; + + return CNST_NO_CONST; +} + +static INLINE type *_get_irn_type(ir_node *node) { + return _get_irn_op(node)->get_type(node); +} + /* this section MUST contain all inline functions */ -#define is_ir_node(thing) __is_ir_node(thing) -#define get_irn_intra_arity(node) __get_irn_intra_arity(node) -#define get_irn_inter_arity(node) __get_irn_inter_arity(node) -#define get_irn_arity(node) __get_irn_arity(node) -#define get_irn_intra_n(node, n) __get_irn_intra_n(node, n) -#define get_irn_inter_n(node, n) __get_irn_inter_n(node, n) -#define get_irn_n(node, n) __get_irn_n(node, n) -#define get_irn_mode(node) __get_irn_mode(node) -#define set_irn_mode(node, mode) __set_irn_mode(node, mode) -#define get_irn_op(node) __get_irn_op(node) -#define get_irn_opcode(node) __get_irn_opcode(node) -#define get_irn_visited(node) __get_irn_visited(node) -#define set_irn_visited(node, v) __set_irn_visited(node, v) -#define mark_irn_visited(node) __mark_irn_visited(node) -#define irn_visited(node) __irn_visited(node) -#define irn_not_visited(node) __irn_not_visited(node) -#define set_irn_link(node, link) __set_irn_link(node, link) -#define get_irn_link(node) __get_irn_link(node) -#define is_unop(node) __is_unop(node) -#define is_binop(node) __is_binop(node) -#define is_Bad(node) __is_Bad(node) -#define is_no_Block(node) __is_no_Block(node) -#define is_Block(node) __is_Block(node) -#define set_Block_dead(block) __set_Block_dead(block) -#define is_Block_dead(block) __is_Block_dead(block) +#define is_ir_node(thing) _is_ir_node(thing) +#define get_irn_intra_arity(node) _get_irn_intra_arity(node) +#define get_irn_inter_arity(node) _get_irn_inter_arity(node) +#define get_irn_arity(node) _get_irn_arity(node) +#define get_irn_intra_n(node, n) _get_irn_intra_n(node, n) +#define get_irn_inter_n(node, n) _get_irn_inter_n(node, n) +#define get_irn_n(node, n) _get_irn_n(node, n) +#define get_irn_mode(node) _get_irn_mode(node) +#define set_irn_mode(node, mode) _set_irn_mode(node, mode) +#define get_irn_op(node) _get_irn_op(node) +#define get_irn_opcode(node) _get_irn_opcode(node) +#define get_irn_visited(node) _get_irn_visited(node) +#define set_irn_visited(node, v) _set_irn_visited(node, v) +#define mark_irn_visited(node) _mark_irn_visited(node) +#define irn_visited(node) _irn_visited(node) +#define irn_not_visited(node) _irn_not_visited(node) +#define set_irn_link(node, link) _set_irn_link(node, link) +#define get_irn_link(node) _get_irn_link(node) +#define is_unop(node) _is_unop(node) +#define is_binop(node) _is_binop(node) +#define is_Const(node) _is_Const(node) +#define is_Unknown(node) _is_Unknown(node) +#define is_Bad(node) _is_Bad(node) +#define is_no_Block(node) _is_no_Block(node) +#define is_Block(node) _is_Block(node) +#define get_Block_block_visited(node) _get_Block_block_visited(node) +#define set_Block_block_visited(node, visit) _set_Block_block_visited(node, visit) +#define mark_Block_block_visited(node) _mark_Block_block_visited(node) +#define Block_not_block_visited(node) _Block_not_block_visited(node) +#define set_Block_dead(block) _set_Block_dead(block) +#define is_Block_dead(block) _is_Block_dead(block) +#define get_Const_tarval(node) _get_Const_tarval(node) +#define classify_Const(node) _classify_Const(node) +#define get_irn_type(node) _get_irn_type(node) # endif /* _IRNODE_T_H_ */