# include "irloop.h"
# include "array.h"
-# include "exc.h"
-
#include "set.h"
#include "entity_t.h"
#include "type_t.h"
typedef struct {
cond_kind kind; /**< flavor of Cond */
long default_proj; /**< for optimization: biggest Proj number, i.e. the one
- used for default. */
+ used for default. */
} cond_attr;
/** Const attributes */
typedef struct {
symconst_symbol sym; // old tori
symconst_kind num;
+ type *tp; /**< the source type, for analyses. default: type_unknown. */
} symconst_attr;
/** Sel attributes */
entity *ent; /**< entity to select */
} sel_attr;
+/** Exception attributes */
typedef struct {
- type *cld_tp; /**< type of called procedure */
+ 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 exceptions */
+ struct ir_node **frag_arr; /**< For Phi node construction in case of exception */
#endif
- entity ** callee_arr; /**< result of callee analysis */
+} except_attr;
+
+typedef struct {
+ except_attr exc; /**< the exception attribute. MUST be the first one. */
+ type *cld_tp; /**< type of called procedure */
+ entity ** callee_arr; /**< result of callee analysis */
} call_attr;
/** Alloc attributes */
typedef struct {
- type *type; /**< Type of the allocated object. */
- where_alloc where; /**< stack, heap or other managed part of memory */
-#if PRECISE_EXC_CONTEXT
- struct ir_node **frag_arr; /**< For Phi node construction in case of exceptions */
-#endif
+ except_attr exc; /**< the exception attribute. MUST be the first one. */
+ type *type; /**< Type of the allocated object. */
+ where_alloc where; /**< stack, heap or other managed part of memory */
} alloc_attr;
/** InstOf attributes */
type *totype;
} 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 */
/** Some irnodes just have one attribute, these are stored here,
io_attr io; /**< For InstOf */
type *f; /**< For Free. */
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
confirm_attr confirm_cmp; /**< For Confirm: compare operation */
filter_attr filter; /**< For Filter */
end_attr end; /**< For EndReg, EndExcept */
-#if PRECISE_EXC_CONTEXT
- struct ir_node **frag_arr; /**< For Phi node construction in case of exceptions
- for nodes Store, Load, Div, Mod, Quot, DivMod. */
-#endif
+ except_attr except; /**< For Phi node construction in case of exceptions */
} attr;
struct ir_node **in; /**< array with predecessors / operands */
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; /**< array of out edges */
struct dbg_info* dbi; /**< A pointer to information for debug support. */
/* ------- For debugging ------- */
#ifdef DEBUG_libfirm
- int out_valid; /** < indicate that out edges are valid */
+ int out_valid; /** < indicate that out edges are valid */
int node_nr; /**< a unique node number for each node to make output
- readable. */
+ readable. */
#endif
/* ------- For analyses -------- */
ir_loop *loop; /**< the loop the node is in. Access routines in irloop.h */
+#ifdef DO_HEAPANALYSIS
+ struct abstval *av;
+ struct section *sec;
+#endif
/* ------- Opcode depending fields -------- */
attr attr; /**< attribute of this node. Depends on opcode.
Must be last field of struct ir_node. */
};
+
/** Copies all attributes stored in the old node to the new node.
Assumes both have the same opcode and sufficient size. */
void
INLINE alloc_attr get_irn_alloc_attr (ir_node *node);
INLINE type *get_irn_free_attr (ir_node *node);
INLINE symconst_attr get_irn_symconst_attr (ir_node *node);
-type *get_irn_call_attr (ir_node *node);
-type *get_irn_funccall_attr (ir_node *node);
-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);
+type *get_irn_call_attr (ir_node *node);
+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);
/** @} */
/*-------------------------------------------------------------------*/
* Returns the number of predecessors without the block predecessor.
* Intern version for libFirm.
*/
-static INLINE int
-__get_irn_arity (const ir_node *node) {
- assert(node);
- if (interprocedural_view) return __get_irn_inter_arity(node);
- return __get_irn_intra_arity(node);
-}
+extern int (*__get_irn_arity)(const ir_node *node);
/**
* Intern version for libFirm.
*/
static INLINE ir_node *
__get_irn_intra_n (ir_node *node, int n) {
- return (node->in[n + 1] = skip_nop(node->in[n + 1]));
+ assert(node); assert(-1 <= n && n < __get_irn_arity(node));
+
+ return (node->in[n + 1] = skip_Id(node->in[n + 1]));
}
/**
*/
static INLINE ir_node*
__get_irn_inter_n (ir_node *node, int n) {
+ assert(node); assert(-1 <= n && n < __get_irn_arity(node));
+
/* handle Filter and Block specially */
if (__get_irn_opcode(node) == iro_Filter) {
assert(node->attr.filter.in_cg);
- return (node->attr.filter.in_cg[n + 1] = skip_nop(node->attr.filter.in_cg[n + 1]));
+ return (node->attr.filter.in_cg[n + 1] = skip_Id(node->attr.filter.in_cg[n + 1]));
} else if (__get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
- return (node->attr.block.in_cg[n + 1] = skip_nop(node->attr.block.in_cg[n + 1]));
+ return (node->attr.block.in_cg[n + 1] = skip_Id(node->attr.block.in_cg[n + 1]));
}
return __get_irn_intra_n (node, n);
* If it is a block, the entry -1 is NULL.
* Intern version for libFirm.
*/
-static INLINE ir_node *
-__get_irn_n (ir_node *node, int n) {
- assert(node); assert(-1 <= n && n < __get_irn_arity(node));
- if (interprocedural_view) return __get_irn_inter_n (node, n);
- return __get_irn_intra_n (node, n);
-}
+extern ir_node *(*__get_irn_n)(ir_node *node, int n);
/**
* Gets the mode of a node.
return node->link;
}
+/**
+ * Returns the pinned state of a node.
+ * Intern version of libFirm.
+ */
+static INLINE op_pin_state
+__get_irn_pinned(const ir_node *node) {
+ op_pin_state state = __get_op_pinned(__get_irn_op(node));
+ if (state == op_pin_state_exc_pinned)
+ return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
+ return state;
+}
+
/* 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)
projects / libfirm / blobdiff