* @file
* @brief Representation of an intermediate operation -- private header.
* @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
- * @version $Id$
*/
#ifndef FIRM_IR_IRNODE_T_H
#define FIRM_IR_IRNODE_T_H
#include "irgraph_t.h"
#include "irflag_t.h"
#include "array.h"
+#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_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 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_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);
-call_attr *get_irn_call_attr (ir_node *node);
-sel_attr *get_irn_sel_attr (ir_node *node);
-phi_attr *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);
-divmod_attr *get_irn_divmod_attr (ir_node *node);
-builtin_attr *get_irn_builtin_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;
-
-/**
- * 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.
- */
-ir_op_ops *firm_set_default_get_type(ir_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(ir_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(ir_opcode code, ir_op_ops *ops);
-
-/**
- * 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_node **get_Block_cfgpred_arr(ir_node *node);
+ir_node **get_irn_in(const 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)
+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)
+static inline ir_op *get_irn_op_(const ir_node *node)
{
- assert(node);
return node->op;
}
-static inline void _set_irn_op(ir_node *node, ir_op *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 _copy_node_attr(const ir_node *old_node, ir_node *new_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);
+ ir_op *op = get_irn_op_(old_node);
/* must always exist */
- op->ops.copy_attr(old_node, new_node);
+ op->ops.copy_attr(irg, old_node, new_node);
}
/**
* Gets the opcode of a node.
* Intern version for libFirm.
*/
-static inline unsigned _get_irn_opcode(const ir_node *node)
+static inline unsigned 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)
+static inline int get_irn_arity_(const ir_node *node)
{
- assert(node);
- return ARR_LEN(node->in) - 1;
+ return (int)(ARR_LEN(node->in) - 1);
}
-/**
- * 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);
-}
-
-#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
+/* forward decl... */
+#define is_Id(node) is_Id_(node)
+static inline int is_Id_(const ir_node *node);
/**
* Intern version for libFirm.
*/
-static inline ir_node *_get_irn_intra_n(const ir_node *node, int n)
+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 == 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;
+ if (!is_Id(nn)) return nn;
return (node->in[n + 1] = skip_Id(nn));
}
-/**
- * Intern version for libFirm.
- */
-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));
-
- /* 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]));
- }
-
- return _get_irn_intra_n(node, n);
-}
+/* include generated code */
+#include "gen_irnode.h"
/**
* returns a hash value for a 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(),
- * 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.
- */
-#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;
-}
-
-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 int get_irn_deps_(const ir_node *node)
+{
+ return node->deps ? (int)ARR_LEN(node->deps) : 0;
}
-static inline void _set_irn_dep(ir_node *node, int pos, ir_node *dep)
+static inline ir_node *get_irn_dep_(const ir_node *node, int pos)
{
- 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));
+ assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range");
+ return node->deps[pos];
}
+/* 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)
+static inline int get_irn_ins_or_deps_(const ir_node *irn)
{
- return _get_irn_deps(irn) + _get_irn_arity(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)
+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;
}
* 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)
{
- assert(node);
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)
+{
+ 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 ir_visited_t _get_irn_visited(const ir_node *node)
+static inline ir_visited_t get_irn_visited_(const ir_node *node)
{
- assert(node);
return node->visited;
}
* Sets the visited counter of a node.
* Intern version for libFirm.
*/
-static inline void _set_irn_visited(ir_node *node, ir_visited_t visited)
+static inline void set_irn_visited_(ir_node *node, ir_visited_t visited)
{
- assert(node);
node->visited = visited;
}
* Mark a node as visited in a graph.
* Intern version for libFirm.
*/
-static inline void _mark_irn_visited(ir_node *node)
+static inline void mark_irn_visited_(ir_node *node)
{
- assert(node);
- node->visited = current_ir_graph->visited;
+ 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)
+static inline int irn_visited_(const ir_node *node)
{
- assert(node);
- return (node->visited >= current_ir_graph->visited);
+ ir_graph *irg = get_irn_irg(node);
+ return node->visited >= irg->visited;
}
-static inline int _irn_visited_else_mark(ir_node *node)
+static inline int irn_visited_else_mark_(ir_node *node)
{
- if (_irn_visited(node))
+ if (irn_visited_(node))
return 1;
- _mark_irn_visited(node);
+ 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)
+static inline void set_irn_link_(ir_node *node, void *link)
{
- assert(node);
node->link = link;
}
* Returns the link of a node.
* Intern version of libFirm.
*/
-static inline void *_get_irn_link(const ir_node *node)
+static inline void *get_irn_link_(const ir_node *node)
{
- assert(node && _is_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)
+static inline op_pin_state get_irn_pinned_(const ir_node *node)
{
op_pin_state state;
- assert(node && _is_ir_node(node));
+ assert(is_ir_node_(node));
/* Check opcode */
- state = _get_op_pinned(_get_irn_op(node));
+ 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 (op_pin_state)node->attr.except.pin_state;
+
return state;
}
-static inline op_pin_state _is_irn_pinned_in_irg(const ir_node *node)
+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;
}
-/* include generated code */
-#include "gen_irnode.h"
-
-static inline int _is_unop(const ir_node *node)
+static inline int is_unop_(const ir_node *node)
{
- assert(node && _is_ir_node(node));
+ assert(is_ir_node_(node));
return (node->op->opar == oparity_unary);
}
-static inline int _is_binop(const ir_node *node)
+static inline int is_binop_(const ir_node *node)
{
- assert(node && _is_ir_node(node));
+ assert(is_ir_node_(node));
return (node->op->opar == oparity_binary);
}
-static inline int _is_Phi(const ir_node *node)
+static inline int is_SymConst_addr_ent_(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);
+ return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
}
-static inline int _is_Proj(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_Proj);
+/**
+ * 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_strictConv(const ir_node *node)
+static inline ir_visited_t get_Block_block_visited_(const ir_node *node)
{
- return _is_Conv(node) && get_Conv_strict(node);
+ assert(is_Block(node));
+ return node->attr.block.block_visited;
}
-static inline int _is_SymConst_addr_ent(const ir_node *node)
+static inline void set_Block_block_visited_(ir_node *node, ir_visited_t visit)
{
- return is_SymConst(node) && get_SymConst_kind(node) == symconst_addr_ent;
+ assert(is_Block(node));
+ node->attr.block.block_visited = visit;
}
-static inline int _is_no_Block(const ir_node *node)
+static inline ir_graph *get_Block_irg_(const ir_node *block)
{
- assert(node && _is_ir_node(node));
- return (_get_irn_op(node) != op_Block);
+ assert(is_Block(block));
+ return block->attr.irg.irg;
}
-static inline int _get_Block_n_cfgpreds(const ir_node *node)
+static inline void mark_Block_block_visited_(ir_node *node)
{
- assert(_is_Block(node));
- return _get_irn_arity(node);
+ ir_graph *irg = get_Block_irg(node);
+ node->attr.block.block_visited = get_irg_block_visited(irg);
}
-static inline ir_node *_get_Block_cfgpred(const ir_node *node, int pos)
+static inline int Block_block_visited_(const ir_node *node)
{
- assert(0 <= pos && pos < get_irn_arity(node));
- assert(_is_Block(node));
- return _get_irn_n(node, pos);
+ ir_graph *irg = get_Block_irg(node);
+ return node->attr.block.block_visited >= get_irg_block_visited(irg);
}
-/* 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
- * the Start block, but the Bad node.
- */
-static inline ir_node *_get_Block_cfgpred_block(const ir_node *node, int pos)
+static inline int is_Const_null_(const ir_node *node)
{
- ir_node *res = skip_Proj(get_Block_cfgpred(node, pos));
- if (!is_Bad(res))
- res = get_nodes_block(res);
- return res;
+ return tarval_is_null(get_Const_tarval_(node));
}
-static inline ir_visited_t _get_Block_block_visited(const ir_node *node)
+static inline int is_Const_one_(const ir_node *node)
{
- assert(node->op == op_Block);
- return node->attr.block.block_visited;
+ return tarval_is_one(get_Const_tarval_(node));
}
-static inline void _set_Block_block_visited(ir_node *node, ir_visited_t visit)
+static inline int is_Const_all_one_(const ir_node *node)
{
- assert(node->op == op_Block);
- node->attr.block.block_visited = visit;
+ return tarval_is_all_one(get_Const_tarval_(node));
}
-/* For this current_ir_graph must be set. */
-static inline void _mark_Block_block_visited(ir_node *node)
+static inline int is_irn_forking_(const ir_node *node)
{
- assert(node->op == op_Block);
- node->attr.block.block_visited = get_irg_block_visited(current_ir_graph);
+ return is_op_forking(get_irn_op_(node));
}
-static inline int _Block_block_visited(const ir_node *node)
+static inline ir_type *get_irn_type_attr_(ir_node *node)
{
- assert(node->op == op_Block);
- return (node->attr.block.block_visited >= get_irg_block_visited(current_ir_graph));
+ return get_irn_op_(node)->ops.get_type_attr(node);
}
-static inline ir_node *_set_Block_dead(ir_node *block)
+static inline ir_entity *get_irn_entity_attr_(ir_node *node)
{
- assert(_get_irn_op(block) == op_Block);
- block->attr.block.dom.dom_depth = -1;
- block->attr.block.is_dead = 1;
- return block;
+ return get_irn_op_(node)->ops.get_entity_attr(node);
}
-static inline int _is_Block_dead(const ir_node *block)
+static inline int is_irn_constlike_(const ir_node *node)
{
- ir_op *op = _get_irn_op(block);
-
- if (op == op_Bad)
- return 1;
- else {
- assert(op == op_Block);
- return block->attr.block.is_dead;
- }
+ return is_op_constlike(get_irn_op_(node));
}
-static inline ir_graph *_get_Block_irg(const ir_node *block)
+static inline int is_irn_keep_(const ir_node *node)
{
- assert(is_Block(block) || is_Bad(block));
- return block->attr.irg.irg;
-}
-
-static inline tarval *_get_Const_tarval(const ir_node *node) {
- assert(_get_irn_op(node) == op_Const);
- return node->attr.con.tv;
-}
-
-static inline int _is_Const_null(const ir_node *node) {
- return tarval_is_null(_get_Const_tarval(node));
-}
-
-static inline int _is_Const_one(const ir_node *node) {
- return tarval_is_one(_get_Const_tarval(node));
-}
-
-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) {
- return is_op_forking(_get_irn_op(node));
-}
-
-static inline ir_type *_get_irn_type(ir_node *node) {
- return _get_irn_op(node)->ops.get_type(node);
-}
-
-static inline ir_type *_get_irn_type_attr(ir_node *node) {
- return _get_irn_op(node)->ops.get_type_attr(node);
-}
-
-static inline ir_entity *_get_irn_entity_attr(ir_node *node) {
- return _get_irn_op(node)->ops.get_entity_attr(node);
-}
-
-static inline int _is_irn_constlike(const ir_node *node) {
- 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));
+ return is_op_keep(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_start_block_placed(const ir_node *node) {
- return is_op_start_block_placed(_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 int _is_irn_cse_neutral(const ir_node *node) {
- return is_op_cse_neutral(_get_irn_op(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.jmp_pred;
+static inline int is_irn_start_block_placed_(const ir_node *node)
+{
+ return is_op_start_block_placed(get_irn_op_(node));
}
-static inline void _set_Cond_jmp_pred(ir_node *node, cond_jmp_predicate pred) {
- assert(_get_irn_op(node) == op_Cond);
- node->attr.cond.jmp_pred = pred;
+static inline int is_irn_cse_neutral_(const ir_node *node)
+{
+ return is_op_cse_neutral(get_irn_op_(node));
}
-static inline void *_get_irn_generic_attr(ir_node *node) {
+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) {
+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) {
+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) {
+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)
+static inline void set_Block_phis_(ir_node *block, ir_node *phi)
{
- assert(_is_Block(block));
- assert(phi == NULL || _is_Phi(phi));
+ assert(is_Block_(block));
+ assert(phi == NULL || is_Phi_(phi));
block->attr.block.phis = phi;
}
* Returns the link of a node.
* Intern version of libFirm.
*/
-static inline ir_node *_get_Block_phis(const ir_node *block)
+static inline ir_node *get_Block_phis_(const ir_node *block)
{
- assert(_is_Block(block));
+ assert(is_Block_(block));
return block->attr.block.phis;
}
-/**
- * Sets the next link of a Phi.
- */
-static inline void _set_Phi_next(ir_node *phi, ir_node *next)
+static inline void set_Phi_next_(ir_node *phi, ir_node *next)
{
- assert(_is_Phi(phi));
+ assert(is_Phi_(phi));
phi->attr.phi.next = next;
}
-/**
- * Returns the link of a node.
- * Intern version of libFirm.
- */
-static inline ir_node *_get_Phi_next(const ir_node *phi)
+static inline ir_node *get_Phi_next_(const ir_node *phi)
{
- assert(_is_Phi(phi));
+ assert(is_Phi_(phi));
return phi->attr.phi.next;
}
/** Add a Phi node to the list of Block Phi's. */
-static inline void _add_Block_phi(ir_node *block, ir_node *phi)
+static inline void add_Block_phi_(ir_node *block, ir_node *phi)
{
- _set_Phi_next(phi, _get_Block_phis(block));
- _set_Block_phis(block, phi);
+ assert(is_Block_(block));
+ set_Phi_next_(phi, get_Block_phis_(block));
+ set_Block_phis_(block, phi);
}
/** Get the Block mark (single bit). */
-static inline unsigned _get_Block_mark(const ir_node *block)
+static inline unsigned get_Block_mark_(const ir_node *block)
{
- assert(_is_Block(block));
+ assert(is_Block_(block));
return block->attr.block.marked;
}
/** Set the Block mark (single bit). */
-static inline void _set_Block_mark(ir_node *block, unsigned mark)
+static inline void set_Block_mark_(ir_node *block, unsigned mark)
{
- assert(_is_Block(block));
+ assert(is_Block_(block));
block->attr.block.marked = mark;
}
/** Returns non-zero if a node is a routine parameter. */
-static inline int _is_arg_Proj(const ir_node *node)
+static inline int is_arg_Proj_(const ir_node *node)
{
if (! is_Proj(node))
return 0;
return pn_Start_T_args == get_Proj_proj(node) && is_Start(get_Proj_pred(node));
}
+static inline size_t ir_switch_table_get_n_entries_(const ir_switch_table *table)
+{
+ return table->n_entries;
+}
-/* 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 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_strictConv(node) _is_strictConv(node)
-#define is_SymConst_addr_ent(node) _is_SymConst_addr_ent(node)
-#define is_no_Block(node) _is_no_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_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_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(oldn,newn) _copy_node_attr(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_always_opt(node) _is_irn_always_opt(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_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 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 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)
-
-#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)
+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 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];
+}
+
+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