* File name: ir/ir/irnode_t.h
* Purpose: Representation of an intermediate operation -- private header.
* Author: Martin Trapp, Christian Schaefer
- * Modified by: Goetz Lindenmaier
+ * Modified by: Goetz Lindenmaier, Michael Beck
* Created:
* CVS-ID: $Id$
* Copyright: (c) 1998-2003 Universität Karlsruhe
*
* @author Martin Trapp, Christian Schaefer
*/
-
-# ifndef _IRNODE_T_H_
-# define _IRNODE_T_H_
+#ifndef _IRNODE_T_H_
+#define _IRNODE_T_H_
#include "firm_config.h"
#include "irnode.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"
} block_attr;
-/** Start attributes */
-typedef struct {
- char dummy;
- /* ir_graph *irg; @@@ now in block */
-} start_attr;
-
-/** Cond attributes */
+/** 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 */
+/** 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 */
+/** Sel attributes. */
typedef struct {
entity *ent; /**< entity to select */
} sel_attr;
-/** Exception attributes */
+/** 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
#endif
} except_attr;
-/** Call attributes */
+/** 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 */
+/** 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 */
+/** 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 */
+/** 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 */
+/** Filter attributes. */
typedef struct {
long proj; /**< contains the result position to project (Proj) */
ir_node ** in_cg; /**< array with interprocedural predecessors (Phi) */
@todo Ev. replace by bitfield! */
} filter_attr;
-/** EndReg/EndExcept attributes */
+/** EndReg/EndExcept attributes. */
typedef struct {
char dummy;
} end_attr;
-/** CallBegin attributes */
+/** CallBegin attributes. */
typedef struct {
ir_node * call; /**< Associated Call-operation. */
} callbegin_attr;
-/** Cast attributes */
+/** Cast attributes. */
typedef struct {
ir_type *totype; /**< Type of the casted node. */
} cast_attr;
-/** Load attributes */
+/** 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. */
+ ir_volatility volatility; /**< The volatility of a Load/Store operation. */
} load_attr;
-/** Store attributes */
+/** Store attributes. */
typedef struct {
except_attr exc; /**< the exception attribute. MUST be the first one. */
- ent_volatility volatility; /**< the volatility of a Store operation */
+ ir_volatility volatility; /**< the volatility of a Store operation */
} store_attr;
typedef pn_Cmp confirm_attr; /**< Attribute to hold compare operation */
-/** CopyB attribute */
+/** 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 */
+/** 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;
-
+/** 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 {
- 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 */
+ 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 a; /**< For Alloc. */
- free_attr f; /**< For Free. */
- io_attr io; /**< For InstOf */
- cast_attr cast; /**< For Cast. */
- load_attr load; /**< For Load. */
+ 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
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];
/** common structure of an irnode
if the node has some attributes, they are stored in attr */
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.
+ struct ir_node **in; /**< The array of predecessors / operands. */
+ unsigned long visited; /**< 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. */
+ 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. */
+ 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
+#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
+ struct ir_node **deps; /**< Additional dependencies induced by state. */
+ irn_edges_info_t edge_info; /**< everlasting out edges */
/* ------- Opcode depending fields -------- */
attr attr; /**< attribute of this node. Depends on opcode.
Must be last field of struct ir_node. */
* 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);
}
* Intern version for libFirm.
*/
static INLINE ir_op *
-_get_irn_op (const ir_node *node) {
- assert (node);
+_get_irn_op(const ir_node *node) {
+ assert(node);
return node->op;
}
+static INLINE void
+_set_irn_op(ir_node *node, ir_op *op) {
+ assert(node);
+ 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
* Intern version for libFirm.
*/
static INLINE opcode
-_get_irn_opcode (const ir_node *node) {
- assert (k_ir_node == get_kind(node));
- assert (node->op);
+_get_irn_opcode(const ir_node *node) {
+ assert(k_ir_node == get_kind(node));
+ assert(node->op);
return node->op->code;
}
* 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;
}
* 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_op(node) == op_Filter) {
assert(node->attr.filter.in_cg);
* Intern version for libFirm.
*/
static INLINE ir_node *
-_get_irn_intra_n (const ir_node *node, int n) {
+_get_irn_intra_n(const ir_node *node, int n) {
ir_node *nn;
assert(node); assert(-1 <= n && n < _get_irn_intra_arity(node));
* Intern version for libFirm.
*/
static INLINE ir_node*
-_get_irn_inter_n (const ir_node *node, int n) {
+_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 */
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);
}
/**
*/
extern ir_node *(*_get_irn_n)(const ir_node *node, int n);
+static INLINE int _get_irn_deps(const ir_node *node)
+{
+ return node->deps ? ARR_LEN(node->deps) : 0;
+}
+
+static INLINE ir_node *_get_irn_dep(const ir_node *node, int pos)
+{
+ assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
+ assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
+ return node->deps[pos];
+}
+
+static INLINE void
+_set_irn_dep(ir_node *node, int pos, ir_node *dep)
+{
+ ir_node *old;
+
+ assert(node->deps && "dependency array node yet allocated. use add_irn_dep()");
+ assert(pos >= 0 && pos < ARR_LEN(node->deps) && "dependency index out of range");
+ old = node->deps[pos];
+ node->deps[pos] = dep;
+ edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, get_irn_irg(node));
+}
+
+
+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)
-{
- assert (node);
+_get_irn_mode(const ir_node *node) {
+ assert(node);
return node->mode;
}
* Intern version of libFirm.
*/
static INLINE void
-_set_irn_mode (ir_node *node, ir_mode *mode)
-{
- assert (node);
+_set_irn_mode(ir_node *node, ir_mode *mode) {
+ assert(node);
node->mode = mode;
}
* Intern version for libFirm.
*/
static INLINE unsigned long
-_get_irn_visited (const ir_node *node)
-{
- assert (node);
+_get_irn_visited(const ir_node *node) {
+ assert(node);
return node->visited;
}
* Intern version for libFirm.
*/
static INLINE void
-_set_irn_visited (ir_node *node, unsigned long visited)
-{
- assert (node);
+_set_irn_visited(ir_node *node, unsigned long visited) {
+ assert(node);
node->visited = visited;
}
* Intern version for libFirm.
*/
static INLINE void
-_mark_irn_visited (ir_node *node) {
- assert (node);
+_mark_irn_visited(ir_node *node) {
+ assert(node);
node->visited = current_ir_graph->visited;
}
*/
static INLINE int
_irn_visited(const ir_node *node) {
- assert (node);
+ assert(node);
return (node->visited >= current_ir_graph->visited);
}
*/
static INLINE int
_irn_not_visited(const ir_node *node) {
- assert (node);
+ assert(node);
return (node->visited < current_ir_graph->visited);
}
*/
static INLINE void
_set_irn_link(ir_node *node, void *link) {
- assert (node);
+ 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);
*/
static INLINE void *
_get_irn_link(const ir_node *node) {
- assert (node && _is_ir_node(node));
+ assert(node && _is_ir_node(node));
return node->link;
}
static INLINE int
_is_Bad(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Bad);
+ return (_get_irn_op(node) == op_Bad);
+}
+
+static INLINE int
+_is_Start(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Start);
}
static INLINE int
_is_Const(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Const);
+ return (_get_irn_op(node) == op_Const);
}
static INLINE int
-_is_Unknown (const ir_node *node) {
+_is_Unknown(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Unknown);
+ return (_get_irn_op(node) == op_Unknown);
}
static INLINE int
-_is_Return (const ir_node *node) {
+_is_Return(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Return);
+ return (_get_irn_op(node) == op_Return);
}
static INLINE int
-_is_Call (const ir_node *node) {
+_is_Call(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Call);
+ return (_get_irn_op(node) == op_Call);
}
static INLINE int
-_is_Sel (const ir_node *node) {
+_is_Sel(const ir_node *node) {
assert(node);
- return (node && _get_irn_op(node) == op_Sel);
+ return (_get_irn_op(node) == op_Sel);
}
static INLINE int
-_is_Mux (const ir_node *node) {
+_is_Mux(const ir_node *node) {
assert(node);
if (node) {
ir_op *op = _get_irn_op(node);
return 0;
}
+static INLINE int
+_is_Load(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Load);
+}
+
+static INLINE int
+_is_Sync(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Sync);
+}
+
+static INLINE int
+_is_Confirm(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Confirm);
+}
+
+static INLINE int
+_is_Pin(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Pin);
+}
+
+static INLINE int
+_is_SymConst(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_SymConst);
+}
+
+static INLINE int
+_is_Cond(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Cond);
+}
+
+static INLINE int
+_is_Cmp(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Cmp);
+}
+
+static INLINE int
+_is_Alloc(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Alloc);
+}
+
+static INLINE int
+_is_Jmp(const ir_node *node) {
+ assert(node);
+ return (_get_irn_op(node) == op_Jmp);
+}
+
static INLINE int
_is_no_Block(const ir_node *node) {
assert(node && _is_ir_node(node));
}
static INLINE int
-_get_Block_n_cfgpreds (ir_node *node) {
+_get_Block_n_cfgpreds(const ir_node *node) {
assert(_is_Block(node));
return _get_irn_arity(node);
}
static INLINE ir_node *
-_get_Block_cfgpred (ir_node *node, int pos) {
+_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 unsigned long
-_get_Block_block_visited (ir_node *node) {
- assert (node->op == op_Block);
+_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);
+_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);
+_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);
+ assert(node->op == op_Block);
return (node->attr.block.block_visited < get_irg_block_visited(current_ir_graph));
}
static INLINE int
_is_Block_dead(const ir_node *block) {
- ir_op * op = _get_irn_op(block);
+ ir_op *op = _get_irn_op(block);
if (op == op_Bad)
return 1;
}
}
-static INLINE tarval *_get_Const_tarval (ir_node *node) {
- assert (_get_irn_op(node) == op_Const);
+static INLINE tarval *_get_Const_tarval(ir_node *node) {
+ assert(_get_irn_op(node) == op_Const);
return node->attr.con.tv;
}
op = _get_irn_op(node);
- if(op == op_Const)
+ if (op == op_Const)
return classify_tarval(_get_Const_tarval(node));
else if(op == op_SymConst)
return CNST_SYMCONST;
return is_op_constlike(_get_irn_op(node));
}
+static INLINE int _is_irn_always_opt(const ir_node *node) {
+ return is_op_always_opt(_get_irn_op(node));
+}
+
static INLINE int _is_irn_keep(const ir_node *node) {
return is_op_keep(_get_irn_op(node));
}
+static INLINE int _is_irn_machine_op(const ir_node *node) {
+ return is_op_machine(_get_irn_op(node));
+}
+
+static INLINE int _is_irn_machine_operand(const ir_node *node) {
+ return is_op_machine_operand(_get_irn_op(node));
+}
+
+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) {
- assert (_get_irn_op(node) == op_Cond);
- return node->attr.c.pred;
+ assert(_get_irn_op(node) == op_Cond);
+ return node->attr.cond.pred;
}
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;
+ assert(_get_irn_op(node) == op_Cond);
+ node->attr.cond.pred = pred;
}
static INLINE int _get_Psi_n_conds(ir_node *node) {
return _get_irn_arity(node) >> 1;
}
+static INLINE unsigned _get_irn_idx(const ir_node *node) {
+ return node->node_idx;
+}
+
/* 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_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 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 is_Call(node) _is_Call(node)
#define is_Sel(node) _is_Sel(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_Cond(node) _is_Cond(node)
+#define is_Cmp(node) _is_Cmp(node)
+#define is_Alloc(node) _is_Alloc(node)
#define is_Bad(node) _is_Bad(node)
+#define is_Start(node) _is_Start(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_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_always_opt(node) _is_irn_always_opt(node)
#define is_irn_keep(node) _is_irn_keep(node)
+#define is_irn_machine_op(node) _is_irn_machine_op(node)
+#define is_irn_machine_operand(node) _is_irn_machine_operand(node)
+#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_idx(node) _get_irn_idx(node)
+
+#define get_irn_deps(node) _get_irn_deps(node)
+#define set_irn_dep(node, pos, dep) _set_irn_dep(node, pos, dep)
+#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)
-# endif /* _IRNODE_T_H_ */
+#endif /* _IRNODE_T_H_ */
projects / libfirm / blobdiff