X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode_t.h;h=acd9bc4c85163e463bd8435be97b7adebb61818e;hb=203717b8dd44597fb10c126b33a28528a2432e9c;hp=9601cb7c46fbbf59f6cf33dc7dcc78344b3e400a;hpb=b0aca079b52a742481e9160e207869a5942847cd;p=libfirm diff --git a/ir/ir/irnode_t.h b/ir/ir/irnode_t.h index 9601cb7c4..acd9bc4c8 100644 --- a/ir/ir/irnode_t.h +++ b/ir/ir/irnode_t.h @@ -1,274 +1,40 @@ /* - * Project: libFIRM - * File name: ir/ir/irnode_t.h - * Purpose: Representation of an intermediate operation -- private header. - * Author: Martin Trapp, Christian Schaefer - * Modified by: Goetz Lindenmaier, Michael Beck - * Created: - * CVS-ID: $Id$ - * Copyright: (c) 1998-2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ /** - * @file irnode_t.h - * - * Declarations of an ir node. - * - * @author Martin Trapp, Christian Schaefer + * @file + * @brief Representation of an intermediate operation -- private header. + * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck + * @version $Id$ */ -#ifndef _IRNODE_T_H_ -#define _IRNODE_T_H_ +#ifndef FIRM_IR_IRNODE_T_H +#define FIRM_IR_IRNODE_T_H #include "firm_config.h" +#include "irtypes.h" #include "irnode.h" #include "irop_t.h" #include "irgraph_t.h" #include "irflag_t.h" #include "firm_common_t.h" -#include "irdom_t.h" /* For size of struct dom_info. */ -#include "dbginfo.h" -#include "irloop.h" -#include "iredgekinds.h" #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 **/ - -/** Block attributes */ -typedef struct { - /* General attributes */ - ir_graph *irg; /**< The graph this block belongs to. */ - unsigned long block_visited; /**< For the walker that walks over all blocks. */ - /* Attributes private to construction: */ - unsigned matured:1; /**< If set, all in-nodes of the block are fixed. */ - unsigned dead:1; /**< If set, the block is dead (and could be replace by a Bad. */ - ir_node **graph_arr; /**< An array to store all parameters. */ - /* Attributes holding analyses information */ - dom_info dom; /**< Datastructure that holds information about dominators. - @@@ @todo - Eventually overlay with graph_arr as only valid - in different phases. Eventually inline the whole - datastructure. */ - dom_info pdom; /**< Datastructure that holds information about post-dominators. */ - ir_node ** in_cg; /**< array with predecessors in - * interprocedural_view, if they differ - * from intraprocedural predecessors */ - int *backedge; /**< Field n set to true if pred n is backedge. - @@@ @todo Ev. replace by bit field! */ - int *cg_backedge; /**< Field n set to true if pred n is interprocedural backedge. - @@@ @todo Ev. replace by bit field! */ - ir_extblk *extblk; /**< The extended basic block this block belongs to. */ - - struct list_head succ_head; /**< A list head for all successor edges of a block. */ -} block_attr; - -/** Cond attributes. */ -typedef struct { - cond_kind kind; /**< flavor of Cond */ - long default_proj; /**< only for non-binary Conds: biggest Proj number, i.e. the one used for default. */ - cond_jmp_predicate pred; /**< only for binary Conds: The jump predication. */ -} cond_attr; - -/** Const attributes. */ -typedef struct { - tarval *tv; /**< the target value */ - ir_type *tp; /**< the source type, for analyses. default: type_unknown. */ -} const_attr; - -/** SymConst attributes. */ -typedef struct { - symconst_symbol sym; // old tori - symconst_kind num; - ir_type *tp; /**< the source type, for analyses. default: type_unknown. */ -} symconst_attr; - -/** Sel attributes. */ -typedef struct { - ir_entity *ent; /**< entity to select */ -} sel_attr; - -/** Exception attributes. */ -typedef struct { - op_pin_state pin_state; /**< the pin state for operations that might generate a exception: - If it's know that no exception will be generated, could be set to - op_pin_state_floats. */ -#if PRECISE_EXC_CONTEXT - struct ir_node **frag_arr; /**< For Phi node construction in case of exception */ -#endif -} except_attr; - -/** Call attributes. */ -typedef struct { - except_attr exc; /**< the exception attribute. MUST be the first one. */ - ir_type *cld_tp; /**< type of called procedure */ - ir_entity ** callee_arr; /**< result of callee analysis */ -} call_attr; - -/** Alloc attributes. */ -typedef struct { - except_attr exc; /**< the exception attribute. MUST be the first one. */ - ir_type *type; /**< Type of the allocated object. */ - where_alloc where; /**< stack, heap or other managed part of memory */ -} alloc_attr; - -/** Free attributes. */ -typedef struct { - ir_type *type; /**< Type of the allocated object. */ - where_alloc where; /**< stack, heap or other managed part of memory */ -} free_attr; - -/** InstOf attributes. */ -typedef struct { - except_attr exc; /**< the exception attribute. MUST be the first one. */ - ir_type *type; /**< the type of which the object pointer must be */ -} io_attr; - -/** Filter attributes. */ -typedef struct { - long proj; /**< contains the result position to project (Proj) */ - ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */ - int *backedge; /**< Field n set to true if pred n is backedge. - @todo Ev. replace by bitfield! */ -} filter_attr; - -/** EndReg/EndExcept attributes. */ -typedef struct { - char dummy; -} end_attr; - -/** CallBegin attributes. */ -typedef struct { - ir_node * call; /**< Associated Call-operation. */ -} callbegin_attr; - -/** Cast attributes. */ -typedef struct { - ir_type *totype; /**< Type of the casted node. */ -} cast_attr; - -/** Load attributes. */ -typedef struct { - except_attr exc; /**< The exception attribute. MUST be the first one. */ - ir_mode *load_mode; /**< The mode of this Load operation. */ - ir_volatility volatility; /**< The volatility of a Load/Store operation. */ -} load_attr; - -/** Store attributes. */ -typedef struct { - except_attr exc; /**< the exception attribute. MUST be the first one. */ - ir_volatility volatility; /**< the volatility of a Store operation */ -} store_attr; - -typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */ - -/** CopyB attribute. */ -typedef struct { - except_attr exc; /**< The exception attribute. MUST be the first one. */ - ir_type *data_type; /**< Type of the copied entity. */ -} copyb_attr; - -/** Bound attribute. */ -typedef struct { - except_attr exc; /**< The exception attribute. MUST be the first one. */ -} bound_attr; - -/** Conv attribute. */ -typedef struct { - char strict; /**< If set, this is a strict Conv that cannot be removed. */ -} conv_attr; - -/** Some IR-nodes just have one attribute, these are stored here, - some have more. Their name is 'irnodename_attr' */ -typedef union { - block_attr block; /**< For Block: Fields needed to construct it */ - cond_attr cond; /**< For Cond. */ - const_attr con; /**< For Const: contains the value of the constant and a type */ - symconst_attr symc; /**< For SymConst. */ - sel_attr sel; /**< For Sel. */ - call_attr call; /**< For Call: pointer to the type of the method to call */ - callbegin_attr callbegin; /**< For CallBegin */ - alloc_attr alloc; /**< For Alloc. */ - free_attr free; /**< For Free. */ - io_attr instof; /**< For InstOf */ - cast_attr cast; /**< For Cast. */ - load_attr load; /**< For Load. */ - store_attr store; /**< For Store. */ - int phi0_pos; /**< For Phi. Used to remember the value defined by - this Phi node. Needed when the Phi is completed - to call get_r_internal_value to find the - predecessors. If this attribute is set, the Phi - node takes the role of the obsolete Phi0 node, - therefore the name. */ - int *phi_backedge; /**< For Phi after construction. - Field n set to true if pred n is backedge. - @todo Ev. replace by bitfield! */ - long proj; /**< For Proj: contains the result position to project */ - confirm_attr confirm_cmp; /**< For Confirm: compare operation */ - filter_attr filter; /**< For Filter */ - end_attr end; /**< For EndReg, EndExcept */ - except_attr except; /**< For Phi node construction in case of exceptions */ - copyb_attr copyb; /**< For CopyB operation */ - bound_attr bound; /**< For Bound operation */ - conv_attr conv; /**< For Conv operation */ -} attr; - -/** -* Edge info to put into an irn. -*/ -typedef struct _irn_edge_kind_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; - -typedef irn_edge_info_t irn_edges_info_t[EDGE_KIND_LAST]; - -/** - * The common structure of an irnode. - * If the node has some attributes, they are stored in the attr field. - */ -struct ir_node { - /* ------- Basics of the representation ------- */ - firm_kind kind; /**< Distinguishes this node from others. */ - ir_op *op; /**< The Opcode of this node. */ - ir_mode *mode; /**< The Mode of this node. */ - struct ir_node **in; /**< The array of predecessors / operands. */ - unsigned long visited; /**< The visited counter for walks of the graph. */ - unsigned node_idx; /**< The node index of this node in its graph. */ - void *link; /**< To attach additional information to the node, e.g. - used while construction to link Phi0 nodes and - during optimization to link to nodes that - shall replace a node. */ - /* ------- Fields for optimizations / analysis information ------- */ - 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; - long node_nr; /**< A unique node number for each node to make output - readable. */ -#endif - /* ------- For analyses -------- */ - ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */ -#ifdef DO_HEAPANALYSIS - struct abstval *av; /**< Heapanalysis: The abstract value of this node. */ - struct section *sec; /**< Heapanalysis: The section of this node. */ -#endif - struct ir_node **deps; /**< Additional dependencies induced by state. */ - irn_edges_info_t edge_info; /**< Everlasting out edges. */ - /* ------- Opcode depending fields -------- */ - attr attr; /**< The set of attributes of this node. Depends on opcode. - Must be last field of struct ir_node. */ -}; - - /** * Returns the array with the ins. The content of the array may not be * changed. @@ -279,19 +45,19 @@ ir_node **get_irn_in (const ir_node *node); /** @{ */ /** access attributes directly */ -const_attr get_irn_const_attr (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); -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_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); +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); +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); /** @} */ /** @@ -376,7 +142,7 @@ copy_node_attr(const ir_node *old_node, ir_node *new_node) { * Gets the opcode of a node. * Intern version for libFirm. */ -static INLINE ir_opcode +static INLINE unsigned _get_irn_opcode(const ir_node *node) { assert(k_ir_node == get_kind(node)); assert(node->op); @@ -409,12 +175,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. */ @@ -422,10 +194,16 @@ static INLINE ir_node * _get_irn_intra_n(const ir_node *node, int n) { ir_node *nn; - assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node)); + assert(node); + assert(-1 <= n && n < _get_irn_intra_arity(node)); nn = node->in[n + 1]; - if (!nn || (nn->op != op_Id)) return nn; + if (nn == NULL) { + /* only block and Anchor inputs are allowed to be NULL */ + assert((node->op == op_Anchor || n == -1) && "NULL input of a node"); + return NULL; + } + if (nn->op != op_Id) return nn; return (node->in[n + 1] = skip_Id(nn)); } @@ -448,6 +226,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(), @@ -456,7 +242,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; @@ -622,6 +412,24 @@ _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) { + assert(node); + return (_get_irn_op(node) == op_Proj); +} + static INLINE int _is_Bad(const ir_node *node) { assert(node); @@ -634,6 +442,12 @@ _is_NoMem(const ir_node *node) { return (_get_irn_op(node) == op_NoMem); } +static INLINE int +_is_Minus(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Minus); +} + static INLINE int _is_Mod(const ir_node *node) { assert(node); @@ -652,6 +466,84 @@ _is_DivMod(const ir_node *node) { return (_get_irn_op(node) == op_DivMod); } +static INLINE int +_is_Quot(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Quot); +} + +static INLINE int +_is_Add(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Add); +} + +static INLINE int +_is_And(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_And); +} + +static INLINE int +_is_Or(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Or); +} + +static INLINE int +_is_Eor(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Eor); +} + +static INLINE int +_is_Sub(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Sub); +} + +static INLINE int +_is_Not(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Not); +} + +static INLINE int +_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_Rot(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Rot); +} + +static INLINE int +_is_Psi(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Psi); +} + +static INLINE int +_is_Tuple(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_Tuple); +} + static INLINE int _is_Start(const ir_node *node) { assert(node); @@ -670,6 +562,23 @@ _is_Const(const ir_node *node) { return (_get_irn_op(node) == op_Const); } +static INLINE int +_is_Conv(const ir_node *node) { + assert(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); @@ -700,6 +609,18 @@ _is_Sel(const ir_node *node) { return (_get_irn_op(node) == op_Sel); } +static INLINE int +_is_Mul(const ir_node *node) { + assert(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); @@ -776,6 +697,17 @@ _is_Raise(const ir_node *node) { return (_get_irn_op(node) == op_Raise); } +static INLINE int +_is_ASM(const ir_node *node) { + assert(node); + return (_get_irn_op(node) == op_ASM); +} + +static INLINE int +_is_Anchor(const ir_node *node) { + return (_get_irn_op(node) == op_Anchor); +} + static INLINE int _is_no_Block(const ir_node *node) { assert(node && _is_ir_node(node)); @@ -795,7 +727,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); @@ -813,7 +745,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); @@ -821,7 +753,7 @@ _get_Block_cfgpred_block(ir_node *node, int pos) { } static INLINE unsigned long -_get_Block_block_visited(ir_node *node) { +_get_Block_block_visited(const ir_node *node) { assert(node->op == op_Block); return node->attr.block.block_visited; } @@ -840,15 +772,21 @@ _mark_Block_block_visited(ir_node *node) { } static INLINE int -_Block_not_block_visited(ir_node *node) { +_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); + 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); - block->attr.block.dead = 1; + block->attr.block.is_dead = 1; return block; } @@ -860,27 +798,25 @@ _is_Block_dead(const ir_node *block) { return 1; else { assert(op == op_Block); - return block->attr.block.dead; + return block->attr.block.is_dead; } } -static INLINE tarval *_get_Const_tarval(ir_node *node) { +static INLINE tarval *_get_Const_tarval(const 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); +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) { @@ -927,7 +863,7 @@ static INLINE int _is_irn_machine_user(const ir_node *node, unsigned n) { return is_op_machine_user(_get_irn_op(node), n); } -static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) { +static INLINE cond_jmp_predicate _get_Cond_jmp_pred(const ir_node *node) { assert(_get_irn_op(node) == op_Cond); return node->attr.cond.pred; } @@ -942,10 +878,26 @@ static INLINE int _get_Psi_n_conds(ir_node *node) { return _get_irn_arity(node) >> 1; } +static INLINE void *_get_irn_generic_attr(ir_node *node) { + return &node->attr; +} + +static INLINE const void *_get_irn_generic_attr_const(const ir_node *node) { + return &node->attr; +} + static INLINE unsigned _get_irn_idx(const ir_node *node) { return node->node_idx; } +static INLINE dbg_info *_get_irn_dbg_info(const ir_node *n) { + return n->dbi; +} /* get_irn_dbg_info */ + +static INLINE void _set_irn_dbg_info(ir_node *n, dbg_info *db) { + n->dbi = db; +} + /* 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) @@ -970,11 +922,18 @@ static INLINE unsigned _get_irn_idx(const ir_node *node) { #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_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_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) @@ -987,13 +946,29 @@ static INLINE unsigned _get_irn_idx(const ir_node *node) { #define is_Alloc(node) _is_Alloc(node) #define is_Jmp(node) _is_Jmp(node) #define is_Raise(node) _is_Raise(node) +#define is_ASM(node) _is_ASM(node) +#define is_Anchor(node) _is_Anchor(node) #define is_Bad(node) _is_Bad(node) #define is_NoMem(node) _is_NoMem(node) #define is_Start(node) _is_Start(node) #define is_End(node) _is_End(node) +#define is_Minus(node) _is_Minus(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_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_Shl(node) _is_Shl(node) +#define is_Shr(node) _is_Shr(node) +#define is_Shrs(node) _is_Shrs(node) +#define is_Rot(node) _is_Rot(node) +#define is_Psi(node) _is_Psi(node) +#define is_Tuple(node) _is_Tuple(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) @@ -1003,10 +978,13 @@ static INLINE unsigned _get_irn_idx(const ir_node *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) @@ -1021,6 +999,8 @@ static INLINE unsigned _get_irn_idx(const ir_node *node) { #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) #define get_irn_deps(node) _get_irn_deps(node) @@ -1030,4 +1010,7 @@ static INLINE unsigned _get_irn_idx(const ir_node *node) { #define get_irn_ins_or_deps(node) _get_irn_ins_or_deps(node) #define get_irn_in_or_dep(node, pos) _get_irn_in_or_dep(node, pos) -#endif /* _IRNODE_T_H_ */ +#define get_irn_dbg_info(node) _get_irn_dbg_info(node) +#define set_irn_dbg_info(node, db) _set_irn_dbg_info(node, db) + +#endif