long get_Proj_proj(const ir_node *node);
void set_Proj_proj(ir_node *node, long proj);
+/**
+ * Returns non-zero if a node is a routine parameter.
+ *
+ * @param node the Proj node to test
+ */
+int is_arg_Proj(const ir_node *node);
+
ir_node **get_Tuple_preds_arr(ir_node *node);
int get_Tuple_n_preds(const ir_node *node);
ir_node *get_Tuple_pred(const ir_node *node, int pos);
return ir_may_alias;
} /* different_types */
-/**
- * Returns non-zero if a node is a routine parameter.
- *
- * @param node the Proj node to test
- */
-static int is_arg_Proj(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));
-} /* is_arg_Proj */
-
/**
* Returns non-zero if a node is a result on a malloc-like routine.
*
#endif /* INTERPROCEDURAL_VIEW */
}
+/* Returns non-zero if a node is a routine parameter. */
+int (is_arg_Proj)(const ir_node *node) {
+ return _is_arg_Proj(node);
+}
+
ir_node **
get_Tuple_preds_arr(ir_node *node) {
assert(is_Tuple(node));
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) {
+ 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));
+}
+
+
/* 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 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)
+
#endif