/*
- * 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
- * Created:
- * CVS-ID: $Id$
- * Copyright: (c) 1998-2003 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
- */
-
-/**
- * @file irnode_t.h
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
- * Declarations of an ir node.
+ * This file is part of libFirm.
*
- * @author Martin Trapp, Christian Schaefer
+ * 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.
*/
-# ifndef _IRNODE_T_H_
-# define _IRNODE_T_H_
+/**
+ * @file
+ * @brief Representation of an intermediate operation -- private header.
+ * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
+ */
+#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 "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;
- 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; /**< 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;
-
-/** Start attributes */
-typedef struct {
- char dummy;
- /* ir_graph *irg; @@@ now in block */
-} start_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;
-
-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 {
- 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 */
- 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. */
- ent_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. */
- ent_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;
-
-/**
- * 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 IR-nodes just have one attribute, these are stored here,
- some have more. Their name is 'irnodename_attr' */
-typedef union {
- start_attr start; /**< For Start */
- block_attr block; /**< For Block: Fields needed to construct it */
- cond_attr c; /**< For Cond. */
- const_attr con; /**< For Const: contains the value of the constant and a type */
- symconst_attr i; /**< For SymConst. */
- 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. */
- free_attr f; /**< For Free. */
- io_attr io; /**< 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 */
-} attr;
-
-
-/** common structure of an irnode
- if the node has some attributes, they are stored in attr */
-struct ir_node {
- /* ------- Basics of the representation ------- */
- firm_kind kind; /**< distinguishes this node from others */
- ir_op *op; /**< Opcode of this node. */
- ir_mode *mode; /**< Mode of this node. */
- struct ir_node **in; /**< array with predecessors / operands */
- unsigned long visited; /**< visited counter for walks of the 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; /**< the abstract value of this node */
- 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.
- Must be last field of struct ir_node. */
-};
-
+#include "iredges_t.h"
+
+/* This section MUST come first, so the inline functions get used in this header. */
+#define is_ir_node(thing) is_ir_node_(thing)
+#define get_irn_arity(node) get_irn_arity_(node)
+#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_irg(node) get_irn_irg_(node)
+#define get_nodes_block(node) get_nodes_block_(node)
+#define get_irn_op(node) get_irn_op_(node)
+#define set_irn_op(node, op) set_irn_op_(node, op)
+#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_visited_else_mark(node) irn_visited_else_mark_(node)
+#define set_irn_link(node, link) set_irn_link_(node, link)
+#define get_irn_link(node) get_irn_link_(node)
+#define get_irn_pinned(node) get_irn_pinned_(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_SymConst_addr_ent(node) is_SymConst_addr_ent_(node)
+#define get_Block_n_cfgpreds(node) get_Block_n_cfgpreds_(node)
+#define get_Block_cfgpred(node, pos) get_Block_cfgpred_(node, pos)
+#define get_Block_cfgpred_block(node, pos) get_Block_cfgpred_block_(node, pos)
+#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_block_visited(node) Block_block_visited_(node)
+#define get_Block_irg(block) get_Block_irg_(block)
+#define get_Const_tarval(node) get_Const_tarval_(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 copy_node_attr(irg,oldn,newn) copy_node_attr_(irg,oldn,newn)
+#define get_irn_type(node) get_irn_type_(node)
+#define get_irn_type_attr(node) get_irn_type_attr_(node)
+#define get_irn_entity_attr(node) get_irn_entity_attr_(node)
+#define is_irn_constlike(node) is_irn_constlike_(node)
+#define is_irn_keep(node) is_irn_keep_(node)
+#define is_irn_start_block_placed(node) is_irn_start_block_placed_(node)
+#define is_irn_cse_neutral(node) is_irn_cse_neutral_(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_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)
+#define get_irn_dep(node, pos) get_irn_dep_(node, pos)
+
+#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)
+
+#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)
+#define ir_switch_table_get_n_entries(table) ir_switch_table_get_n_entries_(table)
/**
* Returns the array with the ins. The content of the array may not be
* Note that this function returns the whole in array including the
* block predecessor. So, it is NOT symmetric with set_irn_in().
*/
-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);
-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);
-/** @} */
+ir_node **get_irn_in(const 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;
-
-/**
- * Sets the get_type operation for an ir_op_ops.
- *
- * @param code the opcode for the default operation
- * @param ops the operations initialized
- *
- * @return
- * The operations.
+ * Returns an array with the predecessors of the Block. Depending on
+ * the implementation of the graph data structure this can be a copy of
+ * the internal representation of predecessors as well as the internal
+ * array itself. Therefore writing to this array might obstruct the IR.
*/
-ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops);
-
-/**
- * Sets the get_type_attr operation for an ir_op_ops.
- *
- * @param code the opcode for the default operation
- * @param ops the operations initialized
- *
- * @return
- * The operations.
- */
-ir_op_ops *firm_set_default_get_type_attr(opcode code, ir_op_ops *ops);
-
-/**
- * Sets the get_entity_attr operation for an ir_op_ops.
- *
- * @param code the opcode for the default operation
- * @param ops the operations initialized
- *
- * @return
- * The operations.
- */
-ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops);
+ir_node **get_Block_cfgpred_arr(ir_node *node);
/*-------------------------------------------------------------------*/
/* These function are most used in libfirm. Give them as static */
* Checks whether a pointer points to a ir node.
* Intern version for libFirm.
*/
-static INLINE int
-_is_ir_node (const void *thing) {
- return (get_kind(thing) == k_ir_node);
+static inline int is_ir_node_(const void *thing)
+{
+ return (get_kind(thing) == k_ir_node);
+}
+
+static inline unsigned get_irn_idx_(const ir_node *node)
+{
+ return node->node_idx;
}
/**
* Gets the op of a node.
* Intern version for libFirm.
*/
-static INLINE ir_op *
-_get_irn_op (const ir_node *node) {
- assert (node);
- return node->op;
+static inline ir_op *get_irn_op_(const ir_node *node)
+{
+ return node->op;
+}
+
+/* include generated code */
+#include "gen_irnode.h"
+
+static inline void set_irn_op_(ir_node *node, ir_op *op)
+{
+ node->op = op;
}
/** Copies all attributes stored in the old node to the new 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);
+static inline void copy_node_attr_(ir_graph *irg, const ir_node *old_node,
+ ir_node *new_node)
+{
+ ir_op *op = get_irn_op_(old_node);
- /* must always exist */
- op->ops.copy_attr(old_node, new_node);
+ /* must always exist */
+ op->ops.copy_attr(irg, old_node, new_node);
}
/**
* Gets the opcode of a node.
* Intern version for libFirm.
*/
-static INLINE opcode
-_get_irn_opcode (const ir_node *node) {
- assert (k_ir_node == get_kind(node));
- assert (node->op);
- return node->op->code;
-}
-
-/**
- * Returns the number of predecessors without the block predecessor.
- * Intern version for libFirm.
- */
-static INLINE int
-_get_irn_intra_arity (const ir_node *node) {
- assert(node);
- return ARR_LEN(node->in) - 1;
+static inline unsigned get_irn_opcode_(const ir_node *node)
+{
+ assert(k_ir_node == get_kind(node));
+ return node->op->code;
}
/**
* Returns the number of predecessors without the block predecessor.
* Intern version for libFirm.
*/
-static INLINE int
-_get_irn_inter_arity (const ir_node *node) {
- assert(node);
- if (_get_irn_op(node) == op_Filter) {
- assert(node->attr.filter.in_cg);
- return ARR_LEN(node->attr.filter.in_cg) - 1;
- } else if (_get_irn_op(node) == op_Block && node->attr.block.in_cg) {
- return ARR_LEN(node->attr.block.in_cg) - 1;
- }
- return _get_irn_intra_arity(node);
+static inline int get_irn_arity_(const ir_node *node)
+{
+ return (int)(ARR_LEN(node->in) - 1);
}
/**
- * Returns the number of predecessors without the block predecessor.
* Intern version for libFirm.
*/
-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) {
- ir_node *nn;
+static inline ir_node *get_irn_n_(const ir_node *node, int n)
+{
+ ir_node *nn;
- assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node));
+ assert(-1 <= n && n < get_irn_arity_(node));
- nn = node->in[n + 1];
- if (!nn || (nn->op != op_Id)) return nn;
+ nn = node->in[n + 1];
+ if (!is_Id(nn)) return nn;
- return (node->in[n + 1] = skip_Id(nn));
+ return (node->in[n + 1] = skip_Id(nn));
}
/**
- * Intern version for libFirm.
+ * returns a hash value for a node
*/
-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));
+static inline unsigned hash_irn(const ir_node *node)
+{
+ return (unsigned) get_irn_idx(node);
+}
- /* handle Filter and Block specially */
- 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_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]));
- }
+static inline int get_irn_deps_(const ir_node *node)
+{
+ return node->deps ? (int)ARR_LEN(node->deps) : 0;
+}
- return _get_irn_intra_n (node, n);
+static inline ir_node *get_irn_dep_(const ir_node *node, int pos)
+{
+ assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
+ return node->deps[pos];
}
-/**
- * Access to the predecessors of a node.
- * To iterate over the operands iterate from 0 to i < get_irn_arity(),
- * to iterate including the Block predecessor iterate from i = -1 to
- * i < get_irn_arity.
- * 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);
+/* forward declaration outside iredges_t.h to avoid circular include problems */
+void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_edge_kind_t kind, ir_graph *irg);
+
+static inline int get_irn_ins_or_deps_(const ir_node *irn)
+{
+ return get_irn_deps_(irn) + get_irn_arity_(irn);
+}
+
+static inline ir_node *get_irn_in_or_dep_(const ir_node *irn, int pos)
+{
+ int n_in = get_irn_arity(irn);
+ return pos < n_in ? get_irn_n(irn, pos) : get_irn_dep(irn, pos - n_in);
+}
/**
* Gets the mode of a node.
* Intern version for libFirm.
*/
-static INLINE ir_mode *
-_get_irn_mode (const ir_node *node)
+static inline ir_mode *get_irn_mode_(const ir_node *node)
{
- assert (node);
- return node->mode;
+ return node->mode;
}
/**
* Sets the mode of a node.
* Intern version of libFirm.
*/
-static INLINE void
-_set_irn_mode (ir_node *node, ir_mode *mode)
+static inline void set_irn_mode_(ir_node *node, ir_mode *mode)
+{
+ node->mode = mode;
+}
+
+static inline int ir_has_irg_ref(const ir_node *node)
+{
+ return is_Block(node) || is_Bad(node) || is_Anchor(node);
+}
+
+static inline ir_node *get_nodes_block_(const ir_node *node)
+{
+ assert(!is_Block(node));
+ return get_irn_n(node, -1);
+}
+
+static inline ir_graph *get_irn_irg_(const ir_node *node)
{
- assert (node);
- node->mode = mode;
+ if (! is_Block(node))
+ node = get_nodes_block(node);
+ assert(ir_has_irg_ref(node));
+ return node->attr.irg.irg;
}
/**
* Gets the visited counter of a node.
* Intern version for libFirm.
*/
-static INLINE unsigned long
-_get_irn_visited (const ir_node *node)
+static inline ir_visited_t get_irn_visited_(const ir_node *node)
{
- assert (node);
- return node->visited;
+ return node->visited;
}
/**
* Sets the visited counter of a node.
* Intern version for libFirm.
*/
-static INLINE void
-_set_irn_visited (ir_node *node, unsigned long visited)
+static inline void set_irn_visited_(ir_node *node, ir_visited_t visited)
{
- assert (node);
- node->visited = visited;
+ node->visited = visited;
}
/**
* Mark a node as visited in a graph.
* Intern version for libFirm.
*/
-static INLINE void
-_mark_irn_visited (ir_node *node) {
- assert (node);
- node->visited = current_ir_graph->visited;
+static inline void mark_irn_visited_(ir_node *node)
+{
+ node->visited = get_irn_irg(node)->visited;
}
/**
* Returns non-zero if a node of was visited.
* Intern version for libFirm.
*/
-static INLINE int
-_irn_visited(const ir_node *node) {
- assert (node);
- return (node->visited >= current_ir_graph->visited);
+static inline int irn_visited_(const ir_node *node)
+{
+ ir_graph *irg = get_irn_irg(node);
+ return node->visited >= irg->visited;
}
-/**
- * Returns non-zero if a node of was NOT visited.
- * Intern version for libFirm.
- */
-static INLINE int
-_irn_not_visited(const ir_node *node) {
- assert (node);
- return (node->visited < current_ir_graph->visited);
+static inline int irn_visited_else_mark_(ir_node *node)
+{
+ if (irn_visited_(node))
+ return 1;
+ mark_irn_visited_(node);
+ return 0;
}
/**
* Sets the link of a node.
* Intern version of libFirm.
*/
-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);
-
- node->link = link;
+static inline void set_irn_link_(ir_node *node, void *link)
+{
+ node->link = link;
}
/**
* Returns the link of a node.
* Intern version of libFirm.
*/
-static INLINE void *
-_get_irn_link(const ir_node *node) {
- assert (node && _is_ir_node(node));
- return node->link;
+static inline void *get_irn_link_(const ir_node *node)
+{
+ assert(is_ir_node_(node));
+ return node->link;
}
/**
*
* Intern version of libFirm.
*/
-static INLINE op_pin_state
-_get_irn_pinned(const ir_node *node) {
- op_pin_state state;
- assert(node && _is_ir_node(node));
- /* Check opcode */
- state = _get_op_pinned(_get_irn_op(node));
+static inline op_pin_state get_irn_pinned_(const ir_node *node)
+{
+ op_pin_state state;
+ assert(is_ir_node_(node));
+ /* Check opcode */
+ state = get_op_pinned_(get_irn_op_(node));
+
+ if (state >= op_pin_state_exc_pinned)
+ return (op_pin_state)node->attr.except.pin_state;
- if (state >= op_pin_state_exc_pinned)
- return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
- return state;
+ return state;
}
-static INLINE op_pin_state
-_is_irn_pinned_in_irg(const ir_node *node) {
- if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
- return get_irn_pinned(node);
- return op_pin_state_pinned;
+static inline op_pin_state is_irn_pinned_in_irg_(const ir_node *node)
+{
+ if (get_irg_pinned(get_irn_irg(node)) == op_pin_state_floats)
+ return get_irn_pinned(node);
+ return op_pin_state_pinned;
}
-static INLINE int
-_is_unop(const ir_node *node) {
- assert(node && _is_ir_node(node));
- return (node->op->opar == oparity_unary);
+static inline int is_unop_(const ir_node *node)
+{
+ assert(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));
- return (node->op->opar == oparity_binary);
+static inline int is_binop_(const ir_node *node)
+{
+ assert(is_ir_node_(node));
+ return (node->op->opar == oparity_binary);
}
-static INLINE int
-_is_Bad(const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Bad);
+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_Const(const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Const);
+static inline int get_Block_n_cfgpreds_(const ir_node *node)
+{
+ assert(is_Block_(node));
+ return get_irn_arity_(node);
}
-static INLINE int
-_is_Unknown (const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Unknown);
+static inline ir_node *get_Block_cfgpred_(const ir_node *node, int pos)
+{
+ assert(is_Block_(node));
+ return get_irn_n_(node, pos);
}
-static INLINE int
-_is_Return (const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Return);
+/**
+ * Get the predecessor block.
+ *
+ * Returns the block corresponding to the predecessor pos.
+ *
+ * If we encounter the Bad node, this function does not return the Start block,
+ * but the Bad node.
+ */
+static inline ir_node *get_Block_cfgpred_block_(const ir_node *node, int pos)
+{
+ ir_node *res = get_Block_cfgpred(node, pos);
+ if (is_Bad(res)) {
+ /* must return a Bad with mode_BB! */
+ ir_graph *irg = get_irn_irg(node);
+ return new_r_Bad(irg, mode_BB);
+ } else {
+ return get_nodes_block(res);
+ }
}
-static INLINE int
-_is_Call (const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Call);
+static inline ir_visited_t get_Block_block_visited_(const ir_node *node)
+{
+ assert(is_Block(node));
+ return node->attr.block.block_visited;
}
-static INLINE int
-_is_Sel (const ir_node *node) {
- assert(node);
- return (node && _get_irn_op(node) == op_Sel);
+static inline void set_Block_block_visited_(ir_node *node, ir_visited_t visit)
+{
+ assert(is_Block(node));
+ node->attr.block.block_visited = visit;
}
-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;
+static inline ir_graph *get_Block_irg_(const ir_node *block)
+{
+ assert(is_Block(block));
+ return block->attr.irg.irg;
}
-static INLINE int
-_is_no_Block(const ir_node *node) {
- assert(node && _is_ir_node(node));
- return (_get_irn_op(node) != op_Block);
+static inline void mark_Block_block_visited_(ir_node *node)
+{
+ ir_graph *irg = get_Block_irg(node);
+ node->attr.block.block_visited = get_irg_block_visited(irg);
}
-static INLINE int
-_is_Block(const ir_node *node) {
- assert(node && _is_ir_node(node));
- return (_get_irn_op(node) == op_Block);
+static inline int Block_block_visited_(const ir_node *node)
+{
+ ir_graph *irg = get_Block_irg(node);
+ return node->attr.block.block_visited >= get_irg_block_visited(irg);
}
-static INLINE int
-_get_Block_n_cfgpreds (ir_node *node) {
- assert(_is_Block(node));
- return _get_irn_arity(node);
+static inline ir_tarval *get_Const_tarval_(const ir_node *node)
+{
+ assert(is_Const(node));
+ return node->attr.con.tarval;
}
-static INLINE ir_node *
-_get_Block_cfgpred (ir_node *node, int pos) {
- assert(0 <= pos && pos < get_irn_arity(node));
- assert(_is_Block(node));
- return _get_irn_n(node, pos);
+static inline int is_Const_null_(const ir_node *node)
+{
+ return tarval_is_null(get_Const_tarval_(node));
}
-/* Get the predecessor block.
- *
- * Returns the block corresponding to the predecessor pos.
- *
- * There are several ambiguities we resolve with this function:
- * - The direct predecessor can be a Proj, which is not pinned.
- * We walk from the predecessor to the next pinned node
- * (skip_Proj) and return the block that node is in.
- * - If we encounter the Bad node, this function does not return
- * Start, but the Bad node.
- */
-static INLINE ir_node *
-_get_Block_cfgpred_block(ir_node *node, int pos) {
- ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
- if (!is_Bad(res))
- res = get_nodes_block(res);
- return res;
+static inline int is_Const_one_(const ir_node *node)
+{
+ return tarval_is_one(get_Const_tarval_(node));
}
-static INLINE unsigned long
-_get_Block_block_visited (ir_node *node) {
- assert (node->op == op_Block);
- return node->attr.block.block_visited;
+static inline int is_Const_all_one_(const ir_node *node)
+{
+ return tarval_is_all_one(get_Const_tarval_(node));
}
-static INLINE void
-_set_Block_block_visited (ir_node *node, unsigned long visit) {
- assert (node->op == op_Block);
- node->attr.block.block_visited = visit;
+static inline int is_irn_forking_(const ir_node *node)
+{
+ return is_op_forking(get_irn_op_(node));
}
-/* 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 ir_type *get_irn_type_attr_(ir_node *node)
+{
+ return get_irn_op_(node)->ops.get_type_attr(node);
}
-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_entity *get_irn_entity_attr_(ir_node *node)
+{
+ return get_irn_op_(node)->ops.get_entity_attr(node);
}
-static INLINE ir_node *
-_set_Block_dead(ir_node *block) {
- assert(_get_irn_op(block) == op_Block);
- block->attr.block.dead = 1;
- return block;
+static inline int is_irn_constlike_(const ir_node *node)
+{
+ return is_op_constlike(get_irn_op_(node));
}
-static INLINE int
-_is_Block_dead(const ir_node *block) {
- ir_op * op = _get_irn_op(block);
+static inline int is_irn_keep_(const ir_node *node)
+{
+ return is_op_keep(get_irn_op_(node));
+}
- if (op == op_Bad)
- return 1;
- else {
- assert(op == op_Block);
- return block->attr.block.dead;
- }
+static inline int is_irn_start_block_placed_(const ir_node *node)
+{
+ return is_op_start_block_placed(get_irn_op_(node));
}
-static INLINE tarval *_get_Const_tarval (ir_node *node) {
- assert (_get_irn_op(node) == op_Const);
- return node->attr.con.tv;
-}
+static inline int is_irn_cse_neutral_(const ir_node *node)
+{
+ return is_op_cse_neutral(get_irn_op_(node));
+}
-static INLINE cnst_classify_t _classify_Const(ir_node *node) {
- ir_op *op;
- assert(_is_ir_node(node));
+static inline cond_jmp_predicate get_Cond_jmp_pred_(const ir_node *node)
+{
+ assert(is_Cond(node));
+ return node->attr.cond.jmp_pred;
+}
+
+static inline void set_Cond_jmp_pred_(ir_node *node, cond_jmp_predicate pred)
+{
+ assert(is_Cond(node));
+ node->attr.cond.jmp_pred = pred;
+}
+
+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;
+}
- op = _get_irn_op(node);
+static inline dbg_info *get_irn_dbg_info_(const ir_node *n)
+{
+ return n->dbi;
+}
+
+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;
+}
- if(op == op_Const)
- return classify_tarval(_get_Const_tarval(node));
- else if(op == op_SymConst)
- return CNST_SYMCONST;
+/**
+ * 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;
+}
- return CNST_NO_CONST;
+static inline void set_Phi_next_(ir_node *phi, ir_node *next)
+{
+ assert(is_Phi_(phi));
+ phi->attr.phi.next = next;
}
-static INLINE int _is_irn_forking(const ir_node *node) {
- return is_op_forking(_get_irn_op(node));
+static inline ir_node *get_Phi_next_(const ir_node *phi)
+{
+ assert(is_Phi_(phi));
+ return phi->attr.phi.next;
}
-static INLINE ir_type *_get_irn_type(ir_node *node) {
- return _get_irn_op(node)->ops.get_type(node);
+/** Add a Phi node to the list of Block Phi's. */
+static inline void add_Block_phi_(ir_node *block, ir_node *phi)
+{
+ assert(is_Block_(block));
+ set_Phi_next_(phi, get_Block_phis_(block));
+ set_Block_phis_(block, phi);
}
-static INLINE ir_type *_get_irn_type_attr(ir_node *node) {
- return _get_irn_op(node)->ops.get_type_attr(node);
+/** 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;
}
-static INLINE entity *_get_irn_entity_attr(ir_node *node) {
- return _get_irn_op(node)->ops.get_entity_attr(node);
+/** 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;
}
-static INLINE int _is_irn_constlike(const ir_node *node) {
- return is_op_constlike(_get_irn_op(node));
+/** 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));
}
-static INLINE int _is_irn_keep(const ir_node *node) {
- return is_op_keep(_get_irn_op(node));
+static inline size_t ir_switch_table_get_n_entries_(const ir_switch_table *table)
+{
+ return table->n_entries;
}
-static INLINE cond_jmp_predicate _get_Cond_jmp_pred(ir_node *node) {
- assert (_get_irn_op(node) == op_Cond);
- return node->attr.c.pred;
+static inline ir_switch_table_entry *ir_switch_table_get_entry(
+ ir_switch_table *table, size_t entry)
+{
+ assert(entry < table->n_entries);
+ return &table->entries[entry];
}
-static INLINE void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
- assert (_get_irn_op(node) == op_Cond);
- node->attr.c.pred = pred;
+static inline const ir_switch_table_entry *ir_switch_table_get_entry_const(
+ const ir_switch_table *table, size_t entry)
+{
+ assert(entry < table->n_entries);
+ return &table->entries[entry];
}
-/* 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 get_irn_pinned(node) _get_irn_pinned(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_Const(node) _is_Const(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_Mux(node) _is_Mux(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_n_cfgpreds(node) _get_Block_n_cfgpreds(node)
-#define get_Block_cfgpred(node, pos) _get_Block_cfgpred(node, pos)
-#define get_Block_cfgpred_block(node, pos) _get_Block_cfgpred_block(node, pos)
-#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 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)
-#define get_irn_entity_attr(node) _get_irn_entity_attr(node)
-#define is_irn_constlike(node) _is_irn_constlike(node)
-#define is_irn_keep(node) _is_irn_keep(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)
-
-# endif /* _IRNODE_T_H_ */
+void ir_register_getter_ops(void);
+
+/**
+ * because firm keepalive edges are a broken concept, we have to make sure that
+ * nodes which are only held by a keepalive edges are never moved again.
+ * This function returns true in this case.
+ */
+bool only_used_by_keepalive(const ir_node *node);
+
+#endif
projects / libfirm / blobdiff