* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
-
/**
* @file irnode_t.h
*
* @author Martin Trapp, Christian Schaefer
*/
-
# ifndef _IRNODE_T_H_
# define _IRNODE_T_H_
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-# 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 "firm_config.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 "entity_t.h"
#include "type_t.h"
+
/** ir node attributes **/
/** Block attributes */
ir_graph *irg;
unsigned long block_visited; /**< for the walker that walks over all blocks. */
/* Attributes private to construction: */
- bool matured; /**< if set, all in-nodes of the block are fixed */
+ int matured:1; /**< if set, all in-nodes of the block are fixed */
+ int dead:1; /**< if set, the block is dead (and could be replace by a Bad */
struct ir_node **graph_arr; /**< array to store all parameters */
/* Attributes holding analyses information */
struct dom_info dom; /**< Datastructure that holds information about dominators.
};
-/** Copies all attributes stored in the old node to the new node.
- Assumes both have the same opcode and sufficient size. */
-void
-copy_attrs(const ir_node *old_node, ir_node *new_node);
-
-
/** Returns the array with the ins. The content of the array may not be
changed. */
ir_node **get_irn_in (const ir_node *node);
except_attr get_irn_except_attr (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;
+
/*-------------------------------------------------------------------*/
/* These function are most used in libfirm. Give them as static */
/* functions so they can be inlined. */
* Intern version for libFirm.
*/
static INLINE ir_op *
-__get_irn_op (const ir_node *node)
-{
+__get_irn_op (const ir_node *node) {
assert (node);
return node->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);
+
+ /* must always exist */
+ op->copy_attr(old_node, new_node);
+}
+
/**
* Gets the opcode of a node.
* Intern version for libFirm.
*/
static INLINE opcode
-__get_irn_opcode (const ir_node *node)
-{
+__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 ir_node *
-__get_irn_intra_n (ir_node *node, int n) {
- assert(node); assert(-1 <= n && n < __get_irn_arity(node));
+__get_irn_intra_n (const ir_node *node, int n) {
+ assert(node); assert(-1 <= n && n < __get_irn_intra_arity(node));
return (node->in[n + 1] = skip_Id(node->in[n + 1]));
}
* Intern version for libFirm.
*/
static INLINE ir_node*
-__get_irn_inter_n (ir_node *node, int n) {
- assert(node); assert(-1 <= n && n < __get_irn_arity(node));
+__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 */
if (__get_irn_opcode(node) == iro_Filter) {
* If it is a block, the entry -1 is NULL.
* Intern version for libFirm.
*/
-extern ir_node *(*__get_irn_n)(ir_node *node, int n);
+extern ir_node *(*__get_irn_n)(const ir_node *node, int n);
/**
* Gets the mode of a node.
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)
+ if (state >= op_pin_state_exc_pinned)
return get_opt_fragile_ops() ? node->attr.except.pin_state : op_pin_state_pinned;
return state;
}
+static INLINE int
+__is_unop(const ir_node *node) {
+ return (node->op->opar == oparity_unary);
+}
+
+static INLINE int
+__is_binop(const 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_no_Block(const ir_node *node) {
+ assert(node);
+ return (__get_irn_op(node) != op_Block);
+}
+
+static INLINE int
+__is_Block(const ir_node *node) {
+ assert(node);
+ return (__get_irn_op(node) == op_Block);
+}
+
+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_Block_dead(const ir_node *block) {
+ ir_op * op = __get_irn_op(block);
+
+ if (op == op_Bad)
+ return 1;
+ else {
+ assert(op == op_Block);
+ return block->attr.block.dead;
+ }
+}
+
/* 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 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 is_unop(node) __is_unop(node)
+#define is_binop(node) __is_binop(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 set_Block_dead(block) __set_Block_dead(block)
+#define is_Block_dead(block) __is_Block_dead(block)
# endif /* _IRNODE_T_H_ */
projects / libfirm / blobdiff