/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe 3 2002/02/28 13:33:52
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-** declarations of an ir node
-*/
+ * All rights reserved.
+ */
/* $Id$ */
# include "irgraph.h"
# include "entity.h"
-# include "common.h"
+# include "firm_common.h"
# include "irop.h"
# include "irmode.h"
# include "tv.h"
# include "dbginfo.h"
# include "exc.h"
-/* The typedefiniton of ir_node is also in irgraph.h to resolve
- recursion between irnode.h and irgraph.h */
-#ifndef _IR_NODE_TYPEDEF_
-#define _IR_NODE_TYPEDEF_
-/****s* irnode/irnode
+/**
+ * @file irnode.h
+ *
+ * @author Martin Trapp, Christian Schaefer
+ *
+ * Declarations of an ir node.
+ */
+
+/**
+ * @defgroup ir_node Declarations of an ir node.
*
- * NAME ir_node - a datatype representing a Firm node
+ * The type definiton of ir_node is also in irgraph.h to resolve
+ * recursion between irnode.h and irgraph.h
*
- * NOTE Not properly documented ;-)
+ * ir_node - a datatype representing a Firm node
*
- * ATTRIBUTES
* The common fields are:
*
- * firm_kind A firm_kind tag containing k_type. This is useful
- * for dynamically checking whether a node is a ir_node.
- * arity The number of predecessors in the Firm graph.
- * in A list with the predecessors in the Firm graph. There are
- * routines to access individual elements and to obtain the
- * array. The method returning the array should not be used.
- * mode The mode of the node. There are routines to get the mode but
- * also to access the mode's fields directly.
- * opcode The opcode of the node. There are routines to get the opcode but
- * also to access the opcode's fields directly.
- * node_nr A unique number for the node. Available only if debugging is
- * turned on.
- * SOURCE
+ * - firm_kind - A firm_kind tag containing k_type. This is useful
+ * for dynamically checking whether a node is a ir_node.
+ * - arity - The number of predecessors in the Firm graph.
+ * - in - A list with the predecessors in the Firm graph. There are
+ * routines to access individual elements and to obtain the
+ * array. The method returning the array should not be used.
+ * - mode - The mode of the node. There are routines to get the mode
+ * but also to access the mode's fields directly.
+ * - opcode - The opcode of the node. There are routines to get the opcode
+ * but also to access the opcode's fields directly.
+ * - node_nr - A unique number for the node. Available only if debugging
+ * is turned on.
+ * @{
*/
+
+#ifndef _IR_NODE_TYPEDEF_
+#define _IR_NODE_TYPEDEF_
typedef struct ir_node ir_node;
#endif
-/** Manipulate the fields of ir_node. With these access routines
- you can work on the graph without considering the different types
- of nodes, it's just a big graph. **/
+/**
+ * you can work on the graph without considering the different types
+ * of nodes, it's just a big graph.
+ */
-/* returns the number of predecessors without the block predecessor: */
+/** returns the number of predecessors without the block predecessor: */
int get_irn_arity (ir_node *node);
-/* returns the array with the ins: */
-INLINE ir_node **get_irn_in (ir_node *node);
-/* Replaces the old in array by a new one that will contain the ins given in
+
+/** Replaces the old in array by a new one that will contain the ins given in
the parameters. Conserves the block predecessor. It copies the array passed.
This function is necessary to ajust in arrays of blocks, calls and phis.
Assumes that current_ir_graph is set to the graph containing "node".
"in" must contain all predecessors except the block that are required for
the nodes opcode. */
INLINE void set_irn_in (ir_node *node, int arity,
- ir_node **in);
+ ir_node *in[]);
/* to iterate through the predecessors without touching the array. No
order of predecessors guaranteed.
To iterate over the operands iterate from 0 to i < get_irn_arity(),
INLINE unsigned long get_irn_visited (ir_node *node);
/* Sets visited to get_irg_visited(current_ir_graph) */
INLINE void mark_irn_visited (ir_node *node);
-/* Returns 1 of visited < get_irg_visited(current_ir_graph). */
+/* Returns 1 if visited < get_irg_visited(current_ir_graph). */
INLINE int irn_not_visited (ir_node *node);
-INLINE void set_irn_link (ir_node *node, ir_node *link);
-INLINE ir_node *get_irn_link (ir_node *node);
-/* Outputs a unique number for this node if libfirm is compiled for
- debugging, else returns 0. */
+/* Returns 1 if visited >= get_irg_visited(current_ir_graph). */
+INLINE int irn_visited (ir_node *node);
+INLINE void set_irn_link (ir_node *node, void *link);
+INLINE void *get_irn_link (ir_node *node);
+
+/** Outputs a unique number for this node if libfirm is compiled for
+ debugging, (configure with --enable-debug) else returns 0. */
INLINE long get_irn_node_nr(ir_node *node);
-/*****/
-/* irnode constructor */
-/* Create a new irnode in irg, with an op, mode, arity and */
-/* some incoming irnodes. */
-/* If arity is negative, a node with a dynamic array is created. */
+/** Returns the ir_graph this node belongs to. Only valid for
+ * CallBegin, EndReg and EndExcept */
+INLINE ir_graph *get_irn_irg(ir_node *node);
+/**
+ * irnode constructor.
+ * Create a new irnode in irg, with an op, mode, arity and
+ * some incoming irnodes.
+ * If arity is negative, a node with a dynamic array is created.
+ */
INLINE ir_node *
new_ir_node (dbg_info *db,
ir_graph *irg,
ir_op *op,
ir_mode *mode,
int arity,
- ir_node **in);
+ ir_node *in[]);
-/****s* irnode/other
+/*
*
* NAME access functions for node fields.
*
- * NOTE Not properly documented ;-)
+ * Not properly documented ;-)
*
- * SOURCE
*/
/* this works for all except Block */
INLINE ir_node *get_nodes_Block (ir_node *node);
INLINE void set_nodes_Block (ir_node *node, ir_node *block);
-/* Projection numbers for result of Start node: use for Proj nodes! */
+/** Projection numbers for result of Start node: use for Proj nodes! */
typedef enum {
- pns_initial_exec, /* Projection on an executable, the initial control
+ pns_initial_exec, /**< Projection on an executable, the initial control
flow. */
- pns_global_store, /* Projection on the global store */
- pns_frame_base, /* Projection on the frame base */
- pns_globals, /* Projection on the pointer to the data segment
+ pns_global_store, /**< Projection on the global store */
+ pns_frame_base, /**< Projection on the frame base */
+ pns_globals, /**< Projection on the pointer to the data segment
containing _all_ global entities. */
- pns_args /* Projection on all arguments */
+ pns_args /**< Projection on all arguments */
} pns_number;
+/* @@@ no more supported */
INLINE ir_node **get_Block_cfgpred_arr (ir_node *node);
int get_Block_n_cfgpreds (ir_node *node);
-/* INLINE void set_Block_n_cfgpreds (ir_node *node, int n_preds); */
INLINE ir_node *get_Block_cfgpred (ir_node *node, int pos);
INLINE void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
INLINE bool get_Block_matured (ir_node *node);
/* For this current_ir_graph must be set. */
INLINE void mark_Block_block_visited(ir_node *node);
INLINE int Block_not_block_visited(ir_node *node);
-INLINE ir_node *get_Block_graph_arr (ir_node *node, int pos);
-INLINE void set_Block_graph_arr (ir_node *node, int pos, ir_node *value);
-
-/* exc handling */
-void set_Block_exc (ir_node*, exc_t);
-exc_t get_Block_exc (ir_node*);
-void set_Node_exc (ir_node*, exc_t);
-exc_t get_Node_exc (ir_node*);
-
-/* handler handling */
-void set_Block_handler (ir_node*, ir_node*);
-ir_node* get_Block_handler (ir_node*);
-
-void set_Node_handler (ir_node*, ir_node*);
-ir_node* get_Node_handler (ir_node*);
/* Set and remove interprocedural predecessors. If the interprocedural
* predecessors are removed, the node has the same predecessors in
- * both views. */
+ * both views.
+ * @@@ Maybe better: arity is zero if no cg preds. */
void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
+/* @@@ not supported */
ir_node ** get_Block_cg_cfgpred_arr(ir_node * node);
+/* Returns the number of interproc predecessors. 0 if none. */
int get_Block_cg_n_cfgpreds(ir_node * node);
+ir_node * get_Block_cg_cfgpred(ir_node * node, int pos);
+/* frees the memory. */
void remove_Block_cg_cfgpred_arr(ir_node * node);
INLINE int get_End_n_keepalives(ir_node *end);
free_End frees these data structures. */
INLINE void free_End (ir_node *end);
+ir_graph *get_EndReg_irg (ir_node *end);
+ir_graph *get_EndExcept_irg (ir_node *end);
+
/* We distinguish three kinds of Cond nodes. These can be distinguished
by the mode of the selector operand and an internal flag of type cond_kind.
First we distinguish binary Conds and switch Conds.
Default flavor is "dense"
*/
typedef enum {
- dense, /* Default. Missing Proj nodes are dead control flow. */
- fragmentary /* Special. No control flow optimizations allowed. Missing
+ dense, /**< Default. Missing Proj nodes are dead control flow. */
+ fragmentary /**< Special. No control flow optimizations allowed. Missing
Proj nodes mean default control flow, i.e., Proj(n). */
} cond_kind;
INLINE ir_node *get_Return_mem (ir_node *node);
INLINE void set_Return_mem (ir_node *node, ir_node *mem);
INLINE ir_node **get_Return_res_arr (ir_node *node);
-INLINE int get_Return_n_res (ir_node *node);
-/*INLINE void set_Return_n_res (ir_node *node, int results); */
+INLINE int get_Return_n_ress (ir_node *node);
INLINE ir_node *get_Return_res (ir_node *node, int pos);
INLINE void set_Return_res (ir_node *node, int pos, ir_node *res);
INLINE tarval *get_Const_tarval (ir_node *node);
INLINE void set_Const_tarval (ir_node *node, tarval *con);
-/* This enum names the three different kinds of symbolic Constants
+/** This enum names the three different kinds of symbolic Constants
represented by SymConst. The content of the attribute type_or_id
depends on this tag. Use the proper access routine after testing
this flag. */
typedef enum {
- type_tag, /* The SymConst is a type tag for the given type.
+ type_tag, /**< The SymConst is a type tag for the given type.
Type_or_id_p is type *. */
- size, /* The SymConst is the size of the given type.
+ size, /**< The SymConst is the size of the given type.
Type_or_id_p is type *. */
- linkage_ptr_info /* The SymConst is a symbolic pointer to be filled in
+ linkage_ptr_info /**< The SymConst is a symbolic pointer to be filled in
by the linker. Type_or_id_p is ident *. */
} symconst_kind;
typedef union type_or_id * type_or_id_p;
INLINE void set_SymConst_kind (ir_node *node, symconst_kind num);
/* Only to access SymConst of kind type_tag or size. Else assertion: */
INLINE type *get_SymConst_type (ir_node *node);
-INLINE void set_SymConst_type (ir_node *node, type *type);
+INLINE void set_SymConst_type (ir_node *node, type *tp);
/* Only to access SymConst of kind linkage_ptr_info. Else assertion: */
INLINE ident *get_SymConst_ptrinfo (ir_node *node);
INLINE void set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo);
INLINE ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
INLINE void set_Sel_ptr (ir_node *node, ir_node *ptr);
INLINE ir_node **get_Sel_index_arr (ir_node *node);
-INLINE int get_Sel_n_index (ir_node *node);
-/*INLINE void set_Sel_n_index (ir_node *node, int n_index); */
+INLINE int get_Sel_n_indexs (ir_node *node);
INLINE ir_node *get_Sel_index (ir_node *node, int pos);
INLINE void set_Sel_index (ir_node *node, int pos, ir_node *index);
INLINE entity *get_Sel_entity (ir_node *node); /* entity to select */
INLINE void set_Sel_entity (ir_node *node, entity *ent);
-typedef enum {
- static_linkage, /* entity is used internal and not visible out of this
- file/class. */
- external_linkage, /* */
- no_linkage
-} linkage_type;
-INLINE linkage_type get_Sel_linkage_type (ir_node *node);
-INLINE void set_Sel_linkage_type (ir_node *node, linkage_type lt);
-
-type *get_InstOf_ent (ir_node*);
-void set_InstOf_ent (ir_node*, type*);
-ir_node *get_InstOf_obj (ir_node*);
-void set_InstOf_obj (ir_node*, ir_node*);
-ir_node *get_InstOf_store (ir_node*);
-void set_InstOf_store (ir_node*, ir_node*);
+
+/* @@@ ajacs specific node -- not supported */
+type *get_InstOf_ent (ir_node *node);
+void set_InstOf_ent (ir_node *node, type *ent);
+ir_node *get_InstOf_obj (ir_node *node);
+void set_InstOf_obj (ir_node *node, ir_node *obj);
+ir_node *get_InstOf_store (ir_node *node);
+void set_InstOf_store (ir_node *node, ir_node *obj);
INLINE ir_node *get_Call_mem (ir_node *node);
INLINE void set_Call_mem (ir_node *node, ir_node *mem);
INLINE void set_Call_ptr (ir_node *node, ir_node *ptr);
INLINE ir_node **get_Call_param_arr (ir_node *node);
INLINE int get_Call_n_params (ir_node *node);
-INLINE int get_Call_arity (ir_node *node);
-/* INLINE void set_Call_arity (ir_node *node, ir_node *arity); */
INLINE ir_node *get_Call_param (ir_node *node, int pos);
INLINE void set_Call_param (ir_node *node, int pos, ir_node *param);
INLINE type *get_Call_type (ir_node *node);
-INLINE void set_Call_type (ir_node *node, type *type);
+INLINE void set_Call_type (ir_node *node, type *tp);
+INLINE int get_Call_arity (ir_node *node);
/* Set, get and remove the callee-analysis. */
int get_Call_n_callees(ir_node * node);
void set_Call_callee_arr(ir_node * node, int n, entity ** arr);
void remove_Call_callee_arr(ir_node * node);
+ir_node * get_CallBegin_ptr (ir_node *node);
+void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
+ir_graph *get_CallBegin_irg (ir_node *node);
+ir_node *get_CallBegin_call (ir_node *node);
+void set_CallBegin_call (ir_node *node, ir_node *call);
+
/* For unary and binary arithmetic operations the access to the
operands can be factored out. Left is the first, right the
second arithmetic value as listed in tech report 1999-44.
INLINE ir_node *get_Not_op (ir_node *node);
INLINE void set_Not_op (ir_node *node, ir_node *op);
-/* Projection numbers of compare: use for Proj nodes! */
+/** Projection numbers of compare: use for Proj nodes! */
typedef enum {
- False, /* false */
- Eq, /* equal */
- Lt, /* less */
- Le, /* less or equal */
- Gt, /* greater */
- Ge, /* greater or equal */
- Lg, /* less or greater */
- Leg, /* less, equal or greater = ordered */
- Uo, /* unordered */
- Ue, /* unordered or equal */
- Ul, /* unordered or less */
- Ule, /* unordered, less or equal */
- Ug, /* unordered or greater */
- Uge, /* unordered, greater or equal */
- Ne, /* unordered, less or greater = not equal */
- True, /* true */
- not_mask = Leg /* bits to flip to negate comparison */
+ False, /**< false */
+ Eq, /**< equal */
+ Lt, /**< less */
+ Le, /**< less or equal */
+ Gt, /**< greater */
+ Ge, /**< greater or equal */
+ Lg, /**< less or greater */
+ Leg, /**< less, equal or greater = ordered */
+ Uo, /**< unordered */
+ Ue, /**< unordered or equal */
+ Ul, /**< unordered or less */
+ Ule, /**< unordered, less or equal */
+ Ug, /**< unordered or greater */
+ Uge, /**< unordered, greater or equal */
+ Ne, /**< unordered, less or greater = not equal */
+ True /**< true */
+ /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for jni interface */
} pnc_number;
+#define not_mask Leg
INLINE char *get_pnc_string(int pnc);
INLINE int get_negated_pnc(int pnc);
INLINE ir_node *get_Cmp_left (ir_node *node);
INLINE ir_node **get_Phi_preds_arr (ir_node *node);
INLINE int get_Phi_n_preds (ir_node *node);
-/* INLINE void set_Phi_n_preds (ir_node *node, int n_preds); */
INLINE ir_node *get_Phi_pred (ir_node *node, int pos);
INLINE void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
+INLINE ir_node *get_Filter_pred(ir_node *node);
+INLINE void set_Filter_pred(ir_node *node, ir_node *pred);
+INLINE long get_Filter_proj(ir_node *node);
+INLINE void set_Filter_proj(ir_node *node, long proj);
+/* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
+ * @@@ Maybe better: arity is zero if no cg preds. */
+void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
+void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
+int get_Filter_n_cg_preds(ir_node *node);
+ir_node * get_Filter_cg_pred(ir_node *node, int pos);
+
INLINE ir_node *get_Load_mem (ir_node *node);
INLINE void set_Load_mem (ir_node *node, ir_node *mem);
INLINE ir_node *get_Load_ptr (ir_node *node);
INLINE ir_node *get_Alloc_size (ir_node *node);
INLINE void set_Alloc_size (ir_node *node, ir_node *size);
INLINE type *get_Alloc_type (ir_node *node);
-INLINE void set_Alloc_type (ir_node *node, type *type);
+INLINE void set_Alloc_type (ir_node *node, type *tp);
+
+/** allocation place. */
typedef enum {
- stack_alloc, /* Alloc allocates the object on the stack. */
- heap_alloc /* Alloc allocates the object on the heap. */
+ stack_alloc, /**< Alloc allocates the object on the stack. */
+ heap_alloc /**< Alloc allocates the object on the heap. */
} where_alloc;
+
INLINE where_alloc get_Alloc_where (ir_node *node);
INLINE void set_Alloc_where (ir_node *node, where_alloc where);
INLINE ir_node *get_Free_size (ir_node *node);
INLINE void set_Free_size (ir_node *node, ir_node *size);
INLINE type *get_Free_type (ir_node *node);
-INLINE void set_Free_type (ir_node *node, type *type);
+INLINE void set_Free_type (ir_node *node, type *tp);
INLINE ir_node **get_Sync_preds_arr (ir_node *node);
INLINE int get_Sync_n_preds (ir_node *node);
-/* INLINE void set_Sync_n_preds (ir_node *node, int n_preds); */
INLINE ir_node *get_Sync_pred (ir_node *node, int pos);
INLINE void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
INLINE ir_node **get_Tuple_preds_arr (ir_node *node);
INLINE int get_Tuple_n_preds (ir_node *node);
-/* INLINE void set_Tuple_n_preds (ir_node *node, int n_preds); */
INLINE ir_node *get_Tuple_pred (ir_node *node, int pos);
INLINE void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
INLINE ir_node *get_Id_pred (ir_node *node);
INLINE void set_Id_pred (ir_node *node, ir_node *pred);
-INLINE ir_node *get_Filter_pred(ir_node *node);
-INLINE long get_Filter_proj(ir_node *node);
-/* set the interprocedural predecessors */
-void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
-void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
-
-/* Returns the ir_graph this node belongs to. Only valid for
- * CallBegin, EndReg and EndExcept */
-INLINE ir_graph *get_irn_irg(ir_node *node);
-
-/*****/
-/****s* irnode/other2
+/*
*
* NAME Auxiliary routines
*
- * NOTE Not properly documented ;-)
+ * Not properly documented ;-)
*
- * SOURCE
*/
-/* returns operand of node if node is a Proj. */
+/** returns operand of node if node is a Proj. */
INLINE ir_node *skip_Proj (ir_node *node);
-/* returns operand of node if node is a Id */
+/** returns operand of node if node is a Id */
INLINE ir_node *skip_nop (ir_node *node);
INLINE ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
/* returns corresponding operand of Tuple if node is a Proj from
a Tuple. */
INLINE ir_node *skip_Tuple (ir_node *node);
-/* returns true if node is a Bad node. */
+/** returns true if node is a Bad node. */
INLINE int is_Bad (ir_node *node);
-/* returns true if the node is not a Block */
+/** returns true if the node is not a Block */
INLINE int is_no_Block (ir_node *node);
-/* returns true if node is a Proj node or a Filter node in
+/** returns true if the node is a Block */
+INLINE int is_Block (ir_node *node);
+/** returns true if node is a Proj node or a Filter node in
* intraprocedural view */
INLINE int is_Proj (ir_node *node);
-/* Returns true if the operation manipulates control flow:
- Start, End, Jmp, Cond, Return, Raise, Bad */
+/** Returns true if the operation manipulates control flow:
+ Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
int is_cfop(ir_node *node);
-/* Returns true if the operation can change the control flow because
+
+/** Returns true if the operation manipulates interprocedural control flow:
+ CallBegin, EndReg, EndExcept */
+int is_ip_cfop(ir_node *node);
+/** Returns true if the operation can change the control flow because
of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
Bad. */
+ir_graph *get_ip_cfop_irg(ir_node *n);
+
int is_fragile_op(ir_node *node);
-/* Returns the memory operand of fragile operations. */
+/** Returns the memory operand of fragile operations. */
ir_node *get_fragile_op_mem(ir_node *node);
-/*****/
-
-/* Makros for debugging the libfirm */
#include "ident.h"
+/*@{*/
+/** Makros for debugging the libfirm */
+#ifdef __GNUC__
+/*
+ * GNU C has the __FUNCTION__ extension
+ */
#define DDMSG printf("%s(l.%i)\n", __FUNCTION__, __LINE__)
-#define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, \
- id_to_str(get_irn_opident(X)))
-#define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, \
- id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
- get_irn_node_nr(X))
-#define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, \
- print_firm_kind(X), (X))
-#define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
- get_type_tpop_nameid(X), get_type_ident(X), (X))
-#define DDMSG5(X) printf("%s%s: %ld", \
- id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), \
- get_irn_node_nr(X))
-
-
-#define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, \
- get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
-#define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", \
- get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), \
- get_irn_node_nr(get_nodes_Block(X)))
-#define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, \
- get_type_tpop_nameid(X), get_type_ident(X), (X))
-#define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, \
- get_entity_ident(X), (X))
+#define DDMSG1(X) printf("%s(l.%i) %s\n", __FUNCTION__, __LINE__, id_to_str(get_irn_opident(X)))
+#define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FUNCTION__, __LINE__, id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
+#define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FUNCTION__, __LINE__, print_firm_kind(X), (X))
+#define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
+#define DDMSG5(X) printf("%s%s: %ld", id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
+
+
+#define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FUNCTION__, __LINE__, get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
+#define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), get_irn_node_nr(get_nodes_Block(X)))
+#define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FUNCTION__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
+#define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, get_entity_ident(X), (X))
+#define DDMEO(X) xprintf("%s(l.%i) %I (own: %I): %p\n", __FUNCTION__, __LINE__, get_entity_ident(X), get_type_ident(get_entity_owner(X)), (X))
+#define DDMG(X) xprintf("%s(l.%i) %I: %p\n", __FUNCTION__, __LINE__, get_irg_ent(get_entity_ident(X)), (X))
+
+#else
+/*
+ * use Filename instead
+ */
+#define DDMSG printf("%s(l.%i)\n", __FILE__, __LINE__)
+#define DDMSG1(X) printf("%s(l.%i) %s\n", __FILE__, __LINE__, id_to_str(get_irn_opident(X)))
+#define DDMSG2(X) printf("%s(l.%i) %s%s: %ld\n", __FILE__, __LINE__, id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
+#define DDMSG3(X) printf("%s(l.%i) %s: %p\n", __FILE__, __LINE__, print_firm_kind(X), (X))
+#define DDMSG4(X) xprintf("%s(l.%i) %I %I: %p\n", __FILE__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
+#define DDMSG5(X) printf("%s%s: %ld", id_to_str(get_irn_opident(X)), id_to_str(get_irn_modeident(X)), get_irn_node_nr(X))
+
+
+#define DDMN(X) xprintf("%s(l.%i) %I%I: %ld (%p)\n", __FILE__, __LINE__, get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), (X))
+#define DDMNB(X) xprintf("%I%I: %ld (in block %ld)\n", get_irn_opident(X), get_irn_modeident(X), get_irn_node_nr(X), get_irn_node_nr(get_nodes_Block(X)))
+#define DDMT(X) xprintf("%s(l.%i) %I %I: %p\n", __FILE__, __LINE__, get_type_tpop_nameid(X), get_type_ident(X), (X))
+#define DDME(X) xprintf("%s(l.%i) %I: %p\n", __FILE__, __LINE__, get_entity_ident(X), (X))
+#define DDMG(X) xprintf("%s(l.%i) %I: %p\n", __FILE__, __LINE__, get_irg_ent(get_entity_ident(X)), (X))
+#define DDMI(X) xprintf("%s(l.%i) %I: %p\n", __FILE__, __LINE__, (X), (X))
+#define DDMM(X) xprintf("%s(l.%i) %I: %p\n", __FILE__, __LINE__, get_mode_ident(X), (X))
+
+#endif /* __GNUC__ */
+/*@}*/ /* Macros for debug.. */
+
+/*@}*/ /* end of ir_node group definition */
# endif /* _IRNODE_H_ */