X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fir%2Firnode_t.h;h=986f93f6ee631b889ebfec028ee5a2168a47b3a5;hb=c0bef4f5aded93790e8d181ec3fcdcd6429a3cd3;hp=75fbced52b523c517e7124d3dfc3e3309595ac9d;hpb=6be9d429e8a25e1a818b9912ca3c038d020c4f8d;p=libfirm diff --git a/ir/ir/irnode_t.h b/ir/ir/irnode_t.h index 75fbced52..986f93f6e 100644 --- a/ir/ir/irnode_t.h +++ b/ir/ir/irnode_t.h @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -46,18 +46,19 @@ ir_node **get_irn_in (const ir_node *node); /** @{ */ /** access attributes directly */ const_attr *get_irn_const_attr (ir_node *node); -long get_irn_proj_attr (ir_node *node); +long get_irn_proj_attr (ir_node *node); alloc_attr *get_irn_alloc_attr (ir_node *node); free_attr *get_irn_free_attr (ir_node *node); symconst_attr *get_irn_symconst_attr (ir_node *node); ir_type *get_irn_call_attr (ir_node *node); ir_type *get_irn_funccall_attr (ir_node *node); sel_attr *get_irn_sel_attr (ir_node *node); -int get_irn_phi0_attr (ir_node *node); +phi_attr *get_irn_phi_attr (ir_node *node); block_attr *get_irn_block_attr (ir_node *node); load_attr *get_irn_load_attr (ir_node *node); store_attr *get_irn_store_attr (ir_node *node); except_attr *get_irn_except_attr (ir_node *node); +divmod_attr *get_irn_divmod_attr (ir_node *node); /** @} */ /** @@ -175,12 +176,18 @@ _get_irn_inter_arity(const ir_node *node) { return _get_irn_intra_arity(node); } +#ifdef INTERPROCEDURAL_VIEW /** * Returns the number of predecessors without the block predecessor. * Intern version for libFirm. */ extern int (*_get_irn_arity)(const ir_node *node); +#else + +#define _get_irn_arity(n) _get_irn_intra_arity(n) +#endif + /** * Intern version for libFirm. */ @@ -220,6 +227,14 @@ _get_irn_inter_n(const ir_node *node, int n) { return _get_irn_intra_n(node, n); } +/** + * returns a hash value for a node + */ +static INLINE unsigned hash_irn(const ir_node *node) +{ + return (unsigned) get_irn_idx(node); +} + /** * Access to the predecessors of a node. * To iterate over the operands iterate from 0 to i < get_irn_arity(), @@ -228,7 +243,11 @@ _get_irn_inter_n(const ir_node *node, int n) { * If it is a block, the entry -1 is NULL. * Intern version for libFirm. */ +#ifdef INTERPROCEDURAL_VIEW extern ir_node *(*_get_irn_n)(const ir_node *node, int n); +#else +#define _get_irn_n(n,i) _get_irn_intra_n(n,i) +#endif static INLINE int _get_irn_deps(const ir_node *node) { return node->deps ? ARR_LEN(node->deps) : 0; @@ -339,11 +358,7 @@ _irn_not_visited(const ir_node *node) { */ static INLINE void _set_irn_link(ir_node *node, void *link) { - assert(node); - /* Link field is used for Phi construction and various optimizations - in iropt. */ - assert(get_irg_phase_state(get_irn_irg(node)) != phase_building); - + assert(node); node->link = link; } @@ -394,6 +409,36 @@ _is_binop(const ir_node *node) { return (node->op->opar == oparity_binary); } +static INLINE int +_is_Phi(const ir_node *node) { + ir_op *op; + assert(node); + + op = get_irn_op(node); +#ifdef INTERPROCEDURAL_VIEW + if (op == op_Filter) return get_interprocedural_view(); +#endif + return (op == op_Phi); +} + +static INLINE int +_is_Proj(const ir_node *node) { + ir_op *op; + assert(node); + + op = _get_irn_op(node); +#ifdef INTERPROCEDURAL_VIEW + if (op == op_Filter) return !get_interprocedural_view(); +#endif + return (op == op_Proj); +} + +static INLINE int +_is_Filter(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Filter); +} + static INLINE int _is_Bad(const ir_node *node) { assert(node); @@ -412,6 +457,12 @@ _is_Minus(const ir_node *node) { return (_get_irn_op(node) == op_Minus); } +static INLINE int +_is_Abs(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Abs); +} + static INLINE int _is_Mod(const ir_node *node) { assert(node); @@ -442,6 +493,12 @@ _is_Add(const ir_node *node) { return (_get_irn_op(node) == op_Add); } +static INLINE int +_is_Carry(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Carry); +} + static INLINE int _is_And(const ir_node *node) { assert(node); @@ -473,9 +530,33 @@ _is_Not(const ir_node *node) { } static INLINE int -_is_Psi(const ir_node *node) { +_is_Shl(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Shl); +} + +static INLINE int +_is_Shr(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Shr); +} + +static INLINE int +_is_Shrs(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Shrs); +} + +static INLINE int +_is_Rotl(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Rotl); +} + +static INLINE int +_is_Id(const ir_node *node) { assert(node); - return (_get_irn_op(node) == op_Psi); + return (_get_irn_op(node) == op_Id); } static INLINE int @@ -484,6 +565,12 @@ _is_Tuple(const ir_node *node) { return (_get_irn_op(node) == op_Tuple); } +static INLINE int +_is_Bound(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Bound); +} + static INLINE int _is_Start(const ir_node *node) { assert(node); @@ -508,6 +595,17 @@ _is_Conv(const ir_node *node) { return (_get_irn_op(node) == op_Conv); } +static INLINE int +_is_strictConv(const ir_node *node) { + return _is_Conv(node) && get_Conv_strict(node); +} + +static INLINE int +_is_Cast(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Cast); +} + static INLINE int _is_CopyB(const ir_node *node) { assert(node); @@ -532,6 +630,12 @@ _is_Call(const ir_node *node) { return (_get_irn_op(node) == op_Call); } +static INLINE int +_is_CallBegin(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_CallBegin); +} + static INLINE int _is_Sel(const ir_node *node) { assert(node); @@ -544,14 +648,16 @@ _is_Mul(const ir_node *node) { return (_get_irn_op(node) == op_Mul); } +static INLINE int +_is_Mulh(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Mulh); +} + static INLINE int _is_Mux(const ir_node *node) { assert(node); - if (node) { - ir_op *op = _get_irn_op(node); - return (op == op_Mux || ((op == op_Psi) && _get_irn_arity(node) == 3)); - } - return 0; + return (_get_irn_op(node) == op_Mux); } static INLINE int @@ -590,6 +696,11 @@ _is_SymConst(const ir_node *node) { return (_get_irn_op(node) == op_SymConst); } +static INLINE int +_is_SymConst_addr_ent(const ir_node *node) { + return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent; +} + static INLINE int _is_Cond(const ir_node *node) { assert(node); @@ -608,12 +719,24 @@ _is_Alloc(const ir_node *node) { return (_get_irn_op(node) == op_Alloc); } +static INLINE int +_is_Free(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Free); +} + static INLINE int _is_Jmp(const ir_node *node) { assert(node); return (_get_irn_op(node) == op_Jmp); } +static INLINE int +_is_IJmp(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_IJmp); +} + static INLINE int _is_Raise(const ir_node *node) { assert(node); @@ -650,7 +773,7 @@ _get_Block_n_cfgpreds(const ir_node *node) { } static INLINE ir_node * -_get_Block_cfgpred(ir_node *node, int pos) { +_get_Block_cfgpred(const ir_node *node, int pos) { assert(0 <= pos && pos < get_irn_arity(node)); assert(_is_Block(node)); return _get_irn_n(node, pos); @@ -668,7 +791,7 @@ _get_Block_cfgpred(ir_node *node, int pos) { * Start, but the Bad node. */ static INLINE ir_node * -_get_Block_cfgpred_block(ir_node *node, int pos) { +_get_Block_cfgpred_block(const ir_node *node, int pos) { ir_node *res = skip_Proj(get_Block_cfgpred(node, pos)); if (!is_Bad(res)) res = get_nodes_block(res); @@ -694,12 +817,6 @@ _mark_Block_block_visited(ir_node *node) { node->attr.block.block_visited = get_irg_block_visited(current_ir_graph); } -static INLINE int -_Block_not_block_visited(const ir_node *node) { - assert(node->op == op_Block); - return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph)); -} - static INLINE int _Block_block_visited(const ir_node *node) { assert(node->op == op_Block); @@ -709,6 +826,7 @@ _Block_block_visited(const ir_node *node) { static INLINE ir_node * _set_Block_dead(ir_node *block) { assert(_get_irn_op(block) == op_Block); + block->attr.block.dom.dom_depth = -1; block->attr.block.is_dead = 1; return block; } @@ -730,18 +848,16 @@ static INLINE tarval *_get_Const_tarval(const ir_node *node) { 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); +static INLINE int _is_Const_null(const ir_node *node) { + return tarval_is_null(_get_Const_tarval(node)); +} - if (op == op_Const) - return classify_tarval(_get_Const_tarval(node)); - else if(op == op_SymConst) - return CNST_SYMCONST; +static INLINE int _is_Const_one(const ir_node *node) { + return tarval_is_one(_get_Const_tarval(node)); +} - return CNST_NO_CONST; +static INLINE int _is_Const_all_one(const ir_node *node) { + return tarval_is_all_one(_get_Const_tarval(node)); } static INLINE int _is_irn_forking(const ir_node *node) { @@ -798,11 +914,6 @@ static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) { node->attr.cond.pred = pred; } -static INLINE int _get_Psi_n_conds(ir_node *node) { - assert(_get_irn_op(node) == op_Psi); - return _get_irn_arity(node) >> 1; -} - static INLINE void *_get_irn_generic_attr(ir_node *node) { return &node->attr; } @@ -823,6 +934,78 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { n->dbi = db; } +/** + * Sets the Phi list of a block. + */ +static INLINE void +_set_Block_phis(ir_node *block, ir_node *phi) { + assert(_is_Block(block)); + assert(phi == NULL || _is_Phi(phi)); + block->attr.block.phis = phi; +} + +/** + * Returns the link of a node. + * Intern version of libFirm. + */ +static INLINE ir_node * +_get_Block_phis(const ir_node *block) { + assert(_is_Block(block)); + return block->attr.block.phis; +} + +/** + * Sets the next link of a Phi. + */ +static INLINE void +_set_Phi_next(ir_node *phi, ir_node *next) { + assert(_is_Phi(phi)); + phi->attr.phi.next = next; +} + +/** + * Returns the link of a node. + * Intern version of libFirm. + */ +static INLINE ir_node * +_get_Phi_next(const ir_node *phi) { + assert(_is_Phi(phi)); + return phi->attr.phi.next; +} + +/** Add a Phi node to the list of Block Phi's. */ +static INLINE void +_add_Block_phi(ir_node *block, ir_node *phi) { + _set_Phi_next(phi, _get_Block_phis(block)); + _set_Block_phis(block, phi); +} + +/** Get the Block mark (single bit). */ +static INLINE unsigned +_get_Block_mark(const ir_node *block) { + assert(_is_Block(block)); + return block->attr.block.marked; +} + +/** Set the Block mark (single bit). */ +static INLINE void +_set_Block_mark(ir_node *block, unsigned mark) { + assert(_is_Block(block)); + block->attr.block.marked = mark; +} + +/** Returns non-zero if a node is a routine parameter. */ +static INLINE int +_is_arg_Proj(const ir_node *node) { + if (! is_Proj(node)) + return 0; + node = get_Proj_pred(node); + if (! is_Proj(node)) + return 0; + return pn_Start_T_args == get_Proj_proj(node) && is_Start(get_Proj_pred(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) @@ -847,24 +1030,34 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { #define is_irn_pinned_in_irg(node) _is_irn_pinned_in_irg(node) #define is_unop(node) _is_unop(node) #define is_binop(node) _is_binop(node) +#define is_Proj(node) _is_Proj(node) +#define is_Filter(node) _is_Filter(node) +#define is_Phi(node) _is_Phi(node) #define is_Const(node) _is_Const(node) #define is_Conv(node) _is_Conv(node) +#define is_strictConv(node) _is_strictConv(node) +#define is_Cast(node) _is_Cast(node) #define is_Unknown(node) _is_Unknown(node) #define is_Return(node) _is_Return(node) #define is_Call(node) _is_Call(node) +#define is_CallBegin(node) _is_CallBegin(node) #define is_Sel(node) _is_Sel(node) #define is_Mul(node) _is_Mul(node) +#define is_Mulh(node) _is_Mulh(node) #define is_Mux(node) _is_Mux(node) #define is_Load(node) _is_Load(node) #define is_Sync(node) _is_Sync(node) #define is_Confirm(node) _is_Confirm(node) #define is_Pin(node) _is_Pin(node) #define is_SymConst(node) _is_SymConst(node) +#define is_SymConst_addr_ent(node) _is_SymConst_addr_ent(node) #define is_Cond(node) _is_Cond(node) #define is_CopyB(node) _is_CopyB(node) #define is_Cmp(node) _is_Cmp(node) #define is_Alloc(node) _is_Alloc(node) +#define is_Free(node) _is_Free(node) #define is_Jmp(node) _is_Jmp(node) +#define is_IJmp(node) _is_IJmp(node) #define is_Raise(node) _is_Raise(node) #define is_ASM(node) _is_ASM(node) #define is_Anchor(node) _is_Anchor(node) @@ -873,18 +1066,25 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { #define is_Start(node) _is_Start(node) #define is_End(node) _is_End(node) #define is_Minus(node) _is_Minus(node) +#define is_Abs(node) _is_Abs(node) #define is_Mod(node) _is_Mod(node) #define is_Div(node) _is_Div(node) #define is_DivMod(node) _is_DivMod(node) #define is_Quot(node) _is_Quot(node) #define is_Add(node) _is_Add(node) +#define is_Carry(node) _is_Carry(node) #define is_And(node) _is_And(node) #define is_Or(node) _is_Or(node) #define is_Eor(node) _is_Eor(node) #define is_Sub(node) _is_Sub(node) #define is_Not(node) _is_Not(node) -#define is_Psi(node) _is_Psi(node) +#define is_Shl(node) _is_Shl(node) +#define is_Shr(node) _is_Shr(node) +#define is_Shrs(node) _is_Shrs(node) +#define is_Rotl(node) _is_Rotl(node) +#define is_Id(node) _is_Id(node) #define is_Tuple(node) _is_Tuple(node) +#define is_Bound(node) _is_Bound(node) #define is_no_Block(node) _is_no_Block(node) #define is_Block(node) _is_Block(node) #define get_Block_n_cfgpreds(node) _get_Block_n_cfgpreds(node) @@ -893,12 +1093,13 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { #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 Block_block_visited(node) _Block_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 is_Const_null(node) _is_Const_null(node) +#define is_Const_one(node) _is_Const_one(node) +#define is_Const_all_one(node) _is_Const_all_one(node) #define is_irn_forking(node) _is_irn_forking(node) #define get_irn_type(node) _get_irn_type(node) #define get_irn_type_attr(node) _get_irn_type_attr(node) @@ -912,7 +1113,6 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { #define is_irn_machine_user(node, n) _is_irn_machine_user(node, n) #define get_Cond_jmp_pred(node) _get_Cond_jmp_pred(node) #define set_Cond_jmp_pred(node, pred) _set_Cond_jmp_pred(node, pred) -#define get_Psi_n_conds(node) _get_Psi_n_conds(node) #define get_irn_generic_attr(node) _get_irn_generic_attr(node) #define get_irn_generic_attr_const(node) _get_irn_generic_attr_const(node) #define get_irn_idx(node) _get_irn_idx(node) @@ -927,4 +1127,15 @@ static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { #define get_irn_dbg_info(node) _get_irn_dbg_info(node) #define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db) +#define set_Block_phis(block, phi) _set_Block_phis(block, phi) +#define get_Block_phis(block) _get_Block_phis(block) +#define add_Block_phi(block, phi) _add_Block_phi(block, phi) +#define get_Block_mark(block) _get_Block_mark(block) +#define set_Block_mark(block, mark) _set_Block_mark(block, mark) + +#define set_Phi_next(node, phi) _set_Phi_next(node, phi) +#define get_Phi_next(node) _get_Phi_next(node) + +#define is_arg_Proj(node) _is_arg_Proj(node) + #endif