3 * File name: ir/ir/irnode.h
4 * Purpose: Representation of an intermediate operation.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
19 #include "firm_common.h"
29 * @author Martin Trapp, Christian Schaefer
31 * Declarations of an ir node.
35 * @defgroup ir_node Declarations of an ir node.
37 * The type definition of ir_node is also in irgraph.h to resolve
38 * recursion between irnode.h and irgraph.h
40 * ir_node - a datatype representing a Firm node
42 * The common fields are:
44 * - firm_kind - A firm_kind tag containing k_type. This is useful
45 * for dynamically checking whether a node is a ir_node.
46 * - arity - The number of predecessors in the Firm graph.
47 * - in - A list with the predecessors in the Firm graph. There are
48 * routines to access individual elements and to obtain the
49 * array. The method returning the array should not be used.
50 * - mode - The mode of the node. There are routines to get the mode
51 * but also to access the mode's fields directly.
52 * - opcode - The opcode of the node. There are routines to get the opcode
53 * but also to access the opcode's fields directly.
54 * - node_nr - A unique number for the node. Available only if debugging
59 #ifndef _IR_NODE_TYPEDEF_
60 #define _IR_NODE_TYPEDEF_
61 typedef struct ir_node ir_node;
69 * you can work on the graph without considering the different types
70 * of nodes, it's just a big graph.
74 * Checks whether a pointer points to a ir node.
76 * @param thing an arbitrary pointer
77 * @return non-zero if the thing is a ir mode, else zero
79 int is_ir_node (const void *thing);
82 * Returns the number of predecessors without the block predecessor.
84 * @param node the IR-node
86 int get_irn_arity (const ir_node *node);
87 int get_irn_intra_arity (const ir_node *node);
88 int get_irn_inter_arity (const ir_node *node);
90 /** Replaces the old in array by a new one that will contain the ins given in
91 the parameters. Conserves the block predecessor. It copies the array passed.
92 This function is necessary to adjust in arrays of blocks, calls and phis.
93 Assumes that current_ir_graph is set to the graph containing "node".
94 "in" must contain all predecessors except the block that are required for
96 void set_irn_in (ir_node *node, int arity, ir_node *in[]);
98 /* to iterate through the predecessors without touching the array. No
99 order of predecessors guaranteed.
100 To iterate over the operands iterate from 0 to i < get_irn_arity(),
101 to iterate including the Block predecessor iterate from i = -1 to
102 i < get_irn_arity. */
103 /* Access predecessor n */
106 * Get the n-th predecessor of a node.
107 * This function removes Id predecessors.
109 ir_node *get_irn_n (const ir_node *node, int n);
110 ir_node *get_irn_intra_n (const ir_node *node, int n);
111 ir_node *get_irn_inter_n (const ir_node *node, int n);
113 /** Replace the n-th predecessor of a node with a new one. */
114 void set_irn_n (ir_node *node, int n, ir_node *in);
115 /* Sets the mode struct of node. */
116 void set_irn_mode (ir_node *node, ir_mode *mode);
117 /** Gets the mode struct of a node. */
118 ir_mode *get_irn_mode (const ir_node *node);
119 /** Gets the mode-enum modecode. */
120 modecode get_irn_modecode (const ir_node *node);
121 /** Gets the ident for a string representation of the mode .*/
122 ident *get_irn_modeident (const ir_node *node);
123 /** Gets the string representation of the mode .*/
124 const char *get_irn_modename (const ir_node *node);
125 /** Gets the opcode struct of the node. */
126 ir_op *get_irn_op (const ir_node *node);
127 /** Sets the opcode struct of the node. */
128 void set_irn_op (ir_node *node, ir_op *op);
129 /** Gets the opcode-enum of the node. */
130 opcode get_irn_opcode (const ir_node *node);
131 /** Get the string representation of the opcode. */
132 const char *get_irn_opname (const ir_node *node);
133 /** Get the ident for a string representation of the opcode. */
134 ident *get_irn_opident (const ir_node *node);
135 /** Gets the visited counter of a node. */
136 unsigned long get_irn_visited (const ir_node *node);
137 /** Sets the visited counter of a node. */
138 void set_irn_visited (ir_node *node, unsigned long visited);
139 /** Sets visited to get_irg_visited(current_ir_graph). */
140 void mark_irn_visited (ir_node *node);
141 /** Returns 1 if visited < get_irg_visited(current_ir_graph). */
142 int irn_not_visited (const ir_node *node);
143 /** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
144 int irn_visited (const ir_node *node);
147 * Sets the link of a node.
148 * Only allowed if the graph is NOT in phase_building.
150 void set_irn_link (ir_node *node, void *link);
152 /** Returns the link of a node. */
153 void *get_irn_link (const ir_node *node);
155 /** Returns the ir_graph this node belongs to. Only valid if irg
156 * is in state op_pin_state_pinned (irg is only stored in the block. */
157 ir_graph *get_irn_irg (const ir_node *node);
159 /** Outputs a unique number for this node if libFIRM is compiled for
160 debugging, (configure with --enable-debug) else returns address
161 of node cast to long. */
162 long get_irn_node_nr (const ir_node *node);
164 /** Returns the pinned state of a node.
166 * Returns whether the node _always_ must be pinned.
167 * I.e., the node is not floating after global cse.
169 * @returns Either state op_pin_state_pinned or op_pin_state_floats.
171 op_pin_state get_irn_pinned (const ir_node *node);
173 /** Set pin state for nodes with op pin state op_pin_state_exc_pinned */
174 void set_irn_pinned(ir_node *node, op_pin_state state);
176 /** Returns whether the node is currently pinned.
178 * If get_irn_pinned returns op_pin_state_floats and the graph the
179 * node belongs to is in state op_poin_state_floats then this function
180 * returns 'floats', else 'pinned'.
182 op_pin_state is_irn_pinned_in_irg (const ir_node *node);
185 * irnode constructor.
186 * Create a new irnode in irg, with an op, mode, arity and
187 * some incoming irnodes.
188 * This constructor is used in every specified irnode constructor.
190 * @param db Debug info.
191 * @param irg IR-graph on with this new node should be constructed.
192 * @param block The block the new node belongs to
193 * @param op The opcode of the new node.
194 * @param mode The mode of the new node.
195 * @param arity The arity of the new node, may be <0 if yet.
196 * @param in An array of arity predecessor nodes.
199 new_ir_node (dbg_info *db,
208 * Return the block the node belongs to. This is only
209 * possible for pinned nodes or if the graph is in pinned state.
210 * Otherwise the block may be incorrect. This condition is
211 * now checked by an assertion.
213 * This works for all except Block. It can return Blocks or the Bad node.
215 * To express the difference to access routines that work for all
216 * nodes we use infix "nodes" and do not name this function
217 * get_irn_block(). */
218 ir_node *get_nodes_block (const ir_node *node);
220 /** Sets the Block of a node. */
221 void set_nodes_block (ir_node *node, ir_node *block);
224 * @function get_irn_block()
225 * @see get_nodes_block()
229 * Projection numbers for result of Start node: use for Proj nodes!
232 pn_Start_X_initial_exec, /**< Projection on the initial control flow. */
233 pn_Start_M, /**< Projection on the initial memory. */
234 pn_Start_P_frame_base, /**< Projection on the frame base pointer. */
235 pn_Start_P_globals, /**< Projection on the pointer to the data segment
236 containing _all_ global entities. */
237 pn_Start_T_args, /**< Projection on all arguments. */
238 pn_Start_P_value_arg_base, /**< Pointer to region of compound value arguments as defined by
239 type of this method. */
240 pn_Start_max /**< number of projections from a Start */
241 } pn_Start; /* Projection numbers for Start. */
244 /** Test whether arbitrary node is frame pointer.
246 * Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
247 * from Start. If so returns frame type, else Null. */
248 ir_type *is_frame_pointer(ir_node *n);
250 /** Test whether arbitrary node is globals pointer.
252 * Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
253 * from Start. If so returns global type, else Null. */
254 ir_type *is_globals_pointer(ir_node *n);
256 /** Test whether arbitrary node is value arg base.
258 * Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
259 * from Start. If so returns 1, else 0. */
260 int is_value_arg_pointer(ir_node *n);
263 /* @@@ no more supported */
264 ir_node **get_Block_cfgpred_arr (ir_node *node);
265 int get_Block_n_cfgpreds (ir_node *node);
266 ir_node *get_Block_cfgpred (ir_node *node, int pos);
267 void set_Block_cfgpred (ir_node *node, int pos, ir_node *pred);
268 /** Get the predecessor block.
270 * Returns the block corresponding to the predecessor pos of block.
272 * There are several ambiguities we resolve with this function:
273 * - The direct predecessor can be a Proj, which is not pinned.
274 * We walk from the predecessor to the next pinned node
275 * (skip_Proj) and return the block that node is in.
276 * - If we encounter the Bad node, this function does not return
277 * Start, but the Bad node.
279 ir_node *get_Block_cfgpred_block(ir_node *node, int pos);
280 int get_Block_matured (ir_node *node);
281 void set_Block_matured (ir_node *node, int matured);
283 /** A visited flag only for block nodes.
284 * @see also: get_irn_visited() inc_irg_visited() inc_irg_block_visited()*/
285 unsigned long get_Block_block_visited (ir_node *node);
286 void set_Block_block_visited (ir_node *node, unsigned long visit);
289 * Marks a block as dead but do not replace it with a Bad node.
290 * Dead blocks are removed in the con
292 ir_node *set_Block_dead(ir_node *block);
293 int is_Block_dead(const ir_node *block);
295 /* For this current_ir_graph must be set. */
296 void mark_Block_block_visited(ir_node *node);
297 int Block_not_block_visited(ir_node *node);
299 /* Set and remove interprocedural predecessors. If the interprocedural
300 * predecessors are removed, the node has the same predecessors in
302 * @@@ Maybe better: arity is zero if no cg preds. */
303 void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in);
304 void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred);
305 /* @@@ not supported */
306 ir_node **get_Block_cg_cfgpred_arr(ir_node * node);
307 /** Returns the number of interprocedural predecessors. 0 if none. */
308 int get_Block_cg_n_cfgpreds(ir_node * node);
309 /** Return the interprocedural predecessor at position pos. */
310 ir_node *get_Block_cg_cfgpred(ir_node * node, int pos);
311 /* frees the memory. */
312 void remove_Block_cg_cfgpred_arr(ir_node * node);
314 /** returns the extended basic block a block belongs to */
315 ir_extblk *get_Block_extbb(const ir_node *block);
316 /** sets the extended basic block a block belongs to */
317 void set_Block_extbb(ir_node *block, ir_extblk *extblk);
319 /** Return the number of Keep alive node. */
320 int get_End_n_keepalives(ir_node *end);
322 /** Return the Keep alive node a position pos. */
323 ir_node *get_End_keepalive(ir_node *end, int pos);
325 /** Keep alive dedicated nodes. These must be either PhiM or Block nodes. */
326 void add_End_keepalive (ir_node *end, ir_node *ka);
328 /** Set the Keep alive node at position pos. */
329 void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
331 /** Some parts of the End node are allocated separately -- their memory
332 is not recovered by dead_node_elimination if a End node is dead.
333 free_End() frees these data structures. */
334 void free_End (ir_node *end);
336 /** Return the target address of an IJmp */
337 ir_node *get_IJmp_target(ir_node *ijmp);
339 /** Sets the target address of an IJmp */
340 void set_IJmp_target(ir_node *ijmp, ir_node *tgt);
342 /* We distinguish three kinds of Cond nodes. These can be distinguished
343 by the mode of the selector operand and an internal flag of type cond_kind.
344 First we distinguish binary Conds and switch Conds.
345 A binary Cond has as selector a boolean value. Proj(0) projects the control
346 flow for case "False", Proj(1) the control flow for "True". A binary Cond
347 is recognized by the boolean selector.
348 The switch Cond has as selector an unsigned integer. It produces as result
349 an n+1 Tuple (cf0, ... , cfn) of control flows.
350 We differ two flavors of this Cond. The first, the dense Cond, passes
351 control along output i if the selector value is i, 0 <= i <= n. If the
352 selector value is >n it passes control along output n.
353 The second Cond flavor differences in the treatment of cases not specified in
354 the source program. It magically knows about the existence of Proj nodes.
355 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
356 exists. Else it passes control along output n (even if this Proj does not
357 exist.) This Cond we call "fragmentary". There is a special constructor
358 new_defaultProj that automatically sets the flavor.
359 The two switch flavors are distinguished by a flag of type cond_kind.
360 Default flavor is "dense"
363 dense, /**< Default. Missing Proj nodes are dead control flow. */
364 fragmentary /**< Special. No control flow optimizations allowed. Missing
365 Proj nodes mean default control flow, i.e., Proj(n). */
368 ir_node *get_Cond_selector (ir_node *node);
369 void set_Cond_selector (ir_node *node, ir_node *selector);
370 cond_kind get_Cond_kind (ir_node *node);
371 void set_Cond_kind (ir_node *node, cond_kind kind);
372 long get_Cond_defaultProj (ir_node *node);
375 * Projection numbers for conditions.
378 pn_Cond_false, /**< Control flow if operand is "false". */
379 pn_Cond_true, /**< Control flow if operand is "true". */
380 pn_Cond_max /**< number of projections from a Cond */
381 } pn_Cond; /* Projection numbers for Cond. */
383 ir_node *get_Return_mem (ir_node *node);
384 void set_Return_mem (ir_node *node, ir_node *mem);
385 ir_node **get_Return_res_arr (ir_node *node);
386 int get_Return_n_ress (ir_node *node);
387 ir_node *get_Return_res (ir_node *node, int pos);
388 void set_Return_res (ir_node *node, int pos, ir_node *res);
391 CNST_NULL = 0, /**< The node is a const(0). */
392 CNST_ONE = +1, /**< The node is a const(1). */
393 CNST_ALL_ONE = -1, /**< The node is a const(11111...). */
394 CNST_OTHER = 2, /**< The tarval of the const has another value. */
395 CNST_SYMCONST = 3, /**< The node is symconst. */
396 CNST_NO_CONST = 4 /**< The node is no const at all. */
399 tarval *get_Const_tarval (ir_node *node);
400 void set_Const_tarval (ir_node *node, tarval *con);
403 * Classify a node concerning constant properties.
404 * @param irn A node to check for.
405 * @return Constant properties of that node.
407 cnst_classify_t classify_Const(ir_node *irn);
409 /** Returns the source language type of a Const node.
410 * Must be an atomic type. Mode of type must be mode of node.
412 ir_type *get_Const_type (ir_node *node);
414 /** Sets the source language type of a Const node. */
415 void set_Const_type (ir_node *node, ir_type *tp);
417 /** This enum names the three different kinds of symbolic Constants
418 represented by SymConst. The content of the attribute type_or_id
419 depends on this tag. Use the proper access routine after testing
422 symconst_type_tag, /**< The SymConst is a type tag for the given type.
423 Type_or_id_p is type *. */
424 symconst_size, /**< The SymConst is the size of the given type.
425 Type_or_id_p is type *. */
426 symconst_addr_name, /**< The SymConst is a symbolic pointer to be filled in
427 by the linker. The pointer is represented by a string.
428 Type_or_id_p is ident *. */
429 symconst_addr_ent /**< The SymConst is a symbolic pointer to be filled in
430 by the linker. The pointer is represented by an entity.
431 Type_or_id_p is entity *. */
434 /** SymConst attribute.
436 * This union contains the symbolic information represented by the node. */
437 union symconst_symbol {
443 typedef union symconst_symbol symconst_symbol;
446 /** Get the kind of the SymConst. */
447 symconst_kind get_SymConst_kind (const ir_node *node);
448 /** Set the kind of the SymConst. */
449 void set_SymConst_kind (ir_node *node, symconst_kind num);
451 /** Only to access SymConst of kind type_tag or size. Else assertion: */
452 ir_type *get_SymConst_type (ir_node *node);
453 void set_SymConst_type (ir_node *node, ir_type *tp);
455 /** Only to access SymConst of kind addr_name. Else assertion: */
456 ident *get_SymConst_name (ir_node *node);
457 void set_SymConst_name (ir_node *node, ident *name);
459 /** Only to access SymConst of kind addr_ent. Else assertion: */
460 entity *get_SymConst_entity (ir_node *node);
461 void set_SymConst_entity (ir_node *node, entity *ent);
463 /** Sets both: type and ptrinfo. Needed to treat the node independent of
464 its semantics. Does a memcpy for the memory sym points to. */
465 /* write 'union': firmjni then does not create a method... */
466 union symconst_symbol get_SymConst_symbol (ir_node *node);
467 void set_SymConst_symbol (ir_node *node,
468 union symconst_symbol sym);
470 /** Access the type of the value represented by the SymConst.
472 * Example: primitive type int for SymConst size. */
473 ir_type *get_SymConst_value_type (ir_node *node);
474 void set_SymConst_value_type (ir_node *node, ir_type *tp);
476 ir_node *get_Sel_mem (ir_node *node);
477 void set_Sel_mem (ir_node *node, ir_node *mem);
478 ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
479 void set_Sel_ptr (ir_node *node, ir_node *ptr);
480 ir_node **get_Sel_index_arr (ir_node *node);
481 int get_Sel_n_indexs (ir_node *node);
482 ir_node *get_Sel_index (ir_node *node, int pos);
483 void set_Sel_index (ir_node *node, int pos, ir_node *index);
484 entity *get_Sel_entity (ir_node *node); /* entity to select */
485 void set_Sel_entity (ir_node *node, entity *ent);
488 * Projection numbers for result of Call node: use for Proj nodes!
491 pn_Call_M_regular = 0, /**< The memory result. */
492 pn_Call_T_result = 2, /**< The tuple containing all (0, 1, 2, ...) results */
493 pn_Call_P_value_res_base = 4,/**< A pointer to the memory region containing copied results
494 passed by value (for compound result types). */
495 pn_Call_X_except = 1, /**< The control flow result branching to the exception handler */
496 pn_Call_M_except = 3, /**< The memory result in case the called method terminated with
498 pn_Call_max = 5 /**< number of projections from a Call */
499 } pn_Call; /* Projection numbers for Call. */
500 #define pn_Call_M pn_Call_M_regular
502 ir_node *get_Call_mem (ir_node *node);
503 void set_Call_mem (ir_node *node, ir_node *mem);
504 ir_node *get_Call_ptr (ir_node *node);
505 void set_Call_ptr (ir_node *node, ir_node *ptr);
506 ir_node **get_Call_param_arr (ir_node *node);
507 /** Gets the number of parameters of a call. */
508 int get_Call_n_params (ir_node *node);
509 /** Gets the call parameter at position pos. */
510 ir_node *get_Call_param (ir_node *node, int pos);
511 /** Sets the call parameter at position pos. */
512 void set_Call_param (ir_node *node, int pos, ir_node *param);
513 /** Gets the type of a call. */
514 ir_type *get_Call_type (ir_node *node);
515 /** Sets the type of a call. */
516 void set_Call_type (ir_node *node, ir_type *tp);
517 /** Gets the arity of a call. Identical to get_Call_n_params(). */
518 int get_Call_arity (ir_node *node);
520 /** Set, get and remove the callee information for a Call node.
522 * The callee information lists all method entities that can be called
523 * from this node. If the address expression can not be analyzed fully,
524 * e.g., as entities can be called that are not in the compilation unit,
525 * the array contains the unknown_entity. The array contains only entities
526 * with peculiarity_existent, but with all kinds of visibility. The entities
527 * not necessarily contain an irg.
529 * The array is only accessible if callee information is valid. See flag
532 * The memory allocated for the array is managed automatically, i.e., it must
533 * not be freed if the Call node is removed from the graph.
535 * @param node A Call node.
537 int Call_has_callees (ir_node *node);
538 int get_Call_n_callees (ir_node *node);
539 entity *get_Call_callee (ir_node *node, int pos);
541 /** Set the full callee array.
543 * The passed array is copied. Assumes current_ir_graph set properly! */
544 void set_Call_callee_arr (ir_node *node, const int n, entity **arr);
545 void remove_Call_callee_arr(ir_node *node);
547 ir_node *get_CallBegin_ptr (ir_node *node);
548 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
549 ir_node *get_CallBegin_call (ir_node *node);
550 void set_CallBegin_call (ir_node *node, ir_node *call);
552 /* For unary and binary arithmetic operations the access to the
553 operands can be factored out. Left is the first, right the
554 second arithmetic value as listed in tech report 1999-44.
555 unops are: Minus, Abs, Not, Conv, Cast
556 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
557 Shr, Shrs, Rot, Cmp */
558 int is_unop (const ir_node *node);
559 ir_node *get_unop_op (ir_node *node);
560 void set_unop_op (ir_node *node, ir_node *op);
561 int is_binop (const ir_node *node);
562 ir_node *get_binop_left (ir_node *node);
563 void set_binop_left (ir_node *node, ir_node *left);
564 ir_node *get_binop_right (ir_node *node);
565 void set_binop_right (ir_node *node, ir_node *right);
567 ir_node *get_Add_left (ir_node *node);
568 void set_Add_left (ir_node *node, ir_node *left);
569 ir_node *get_Add_right (ir_node *node);
570 void set_Add_right (ir_node *node, ir_node *right);
572 ir_node *get_Sub_left (ir_node *node);
573 void set_Sub_left (ir_node *node, ir_node *left);
574 ir_node *get_Sub_right (ir_node *node);
575 void set_Sub_right (ir_node *node, ir_node *right);
577 ir_node *get_Minus_op (ir_node *node);
578 void set_Minus_op (ir_node *node, ir_node *op);
580 ir_node *get_Mul_left (ir_node *node);
581 void set_Mul_left (ir_node *node, ir_node *left);
582 ir_node *get_Mul_right (ir_node *node);
583 void set_Mul_right (ir_node *node, ir_node *right);
585 ir_node *get_Quot_left (ir_node *node);
586 void set_Quot_left (ir_node *node, ir_node *left);
587 ir_node *get_Quot_right (ir_node *node);
588 void set_Quot_right (ir_node *node, ir_node *right);
589 ir_node *get_Quot_mem (ir_node *node);
590 void set_Quot_mem (ir_node *node, ir_node *mem);
593 * Projection numbers for Quot: use for Proj nodes!
596 pn_Quot_M, /**< Memory result. */
597 pn_Quot_X_except, /**< Execution result if exception occurred. */
598 pn_Quot_res, /**< Result of computation. */
599 pn_Quot_max /**< number of projections from a Quot */
600 } pn_Quot; /* Projection numbers for Quot. */
602 ir_node *get_DivMod_left (ir_node *node);
603 void set_DivMod_left (ir_node *node, ir_node *left);
604 ir_node *get_DivMod_right (ir_node *node);
605 void set_DivMod_right (ir_node *node, ir_node *right);
606 ir_node *get_DivMod_mem (ir_node *node);
607 void set_DivMod_mem (ir_node *node, ir_node *mem);
610 * Projection numbers for DivMod: use for Proj nodes!
613 pn_DivMod_M, /**< Memory result. */
614 pn_DivMod_X_except, /**< Execution result if exception occurred. */
615 pn_DivMod_res_div, /**< Result of computation a / b. */
616 pn_DivMod_res_mod, /**< Result of computation a % b. */
617 pn_DivMod_max /**< number of projections from a DivMod */
618 } pn_DivMod; /* Projection numbers for DivMod. */
620 ir_node *get_Div_left (ir_node *node);
621 void set_Div_left (ir_node *node, ir_node *left);
622 ir_node *get_Div_right (ir_node *node);
623 void set_Div_right (ir_node *node, ir_node *right);
624 ir_node *get_Div_mem (ir_node *node);
625 void set_Div_mem (ir_node *node, ir_node *mem);
628 * Projection numbers for Div: use for Proj nodes!
631 pn_Div_M, /**< Memory result. */
632 pn_Div_X_except, /**< Execution result if exception occurred. */
633 pn_Div_res, /**< Result of computation. */
634 pn_Div_max /**< number of projections from a Div */
635 } pn_Div; /* Projection numbers for Div. */
637 ir_node *get_Mod_left (ir_node *node);
638 void set_Mod_left (ir_node *node, ir_node *left);
639 ir_node *get_Mod_right (ir_node *node);
640 void set_Mod_right (ir_node *node, ir_node *right);
641 ir_node *get_Mod_mem (ir_node *node);
642 void set_Mod_mem (ir_node *node, ir_node *mem);
645 * Projection numbers for Mod: use for Proj nodes!
648 pn_Mod_M, /**< Memory result. */
649 pn_Mod_X_except, /**< Execution result if exception occurred. */
650 pn_Mod_res, /**< Result of computation. */
651 pn_Mod_max /**< number of projections from a Mod */
652 } pn_Mod; /* Projection numbers for Mod. */
654 ir_node *get_Abs_op (ir_node *node);
655 void set_Abs_op (ir_node *node, ir_node *op);
657 ir_node *get_And_left (ir_node *node);
658 void set_And_left (ir_node *node, ir_node *left);
659 ir_node *get_And_right (ir_node *node);
660 void set_And_right (ir_node *node, ir_node *right);
662 ir_node *get_Or_left (ir_node *node);
663 void set_Or_left (ir_node *node, ir_node *left);
664 ir_node *get_Or_right (ir_node *node);
665 void set_Or_right (ir_node *node, ir_node *right);
667 ir_node *get_Eor_left (ir_node *node);
668 void set_Eor_left (ir_node *node, ir_node *left);
669 ir_node *get_Eor_right (ir_node *node);
670 void set_Eor_right (ir_node *node, ir_node *right);
672 ir_node *get_Not_op (ir_node *node);
673 void set_Not_op (ir_node *node, ir_node *op);
676 * Projection numbers for Cmp are defined several times.
677 * The bit patterns are used for various tests, so don't change.
678 * The "unordered" values are possible results of comparing
679 * floating point numbers.
680 * Note that the encoding is imported, so do NOT change the order.
683 pn_Cmp_False = 0, /**< false */
684 pn_Cmp_Eq = 1, /**< equal */
685 pn_Cmp_Lt = 2, /**< less */
686 pn_Cmp_Le = pn_Cmp_Eq|pn_Cmp_Lt, /**< less or equal */
687 pn_Cmp_Gt = 4, /**< greater */
688 pn_Cmp_Ge = pn_Cmp_Eq|pn_Cmp_Gt, /**< greater or equal */
689 pn_Cmp_Lg = pn_Cmp_Lt|pn_Cmp_Gt, /**< less or greater */
690 pn_Cmp_Leg = pn_Cmp_Lt|pn_Cmp_Eq|pn_Cmp_Gt, /**< less, equal or greater = ordered */
691 pn_Cmp_Uo = 8, /**< unordered */
692 pn_Cmp_Ue = pn_Cmp_Uo|pn_Cmp_Eq, /**< unordered or equal */
693 pn_Cmp_Ul = pn_Cmp_Uo|pn_Cmp_Lt, /**< unordered or less */
694 pn_Cmp_Ule = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Lt, /**< unordered, less or equal */
695 pn_Cmp_Ug = pn_Cmp_Uo|pn_Cmp_Gt, /**< unordered or greater */
696 pn_Cmp_Uge = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Gt, /**< unordered, greater or equal */
697 pn_Cmp_Ne = pn_Cmp_Uo|pn_Cmp_Lt|pn_Cmp_Gt, /**< unordered, less or greater = not equal */
698 pn_Cmp_True = 15 /**< true */
699 /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for JNI interface */
700 } pn_Cmp; /* Projection numbers for Cmp */
701 /* #define not_mask pn_Cmp_Leg */
703 /** returns the pnc name from an pnc constant */
704 const char *get_pnc_string(int pnc);
706 /** Calculates the negated (Complement(R)) pnc condition. */
707 int get_negated_pnc(int pnc, ir_mode *mode);
709 /** Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
710 int get_inversed_pnc(int pnc);
712 ir_node *get_Cmp_left (ir_node *node);
713 void set_Cmp_left (ir_node *node, ir_node *left);
714 ir_node *get_Cmp_right (ir_node *node);
715 void set_Cmp_right (ir_node *node, ir_node *right);
717 ir_node *get_Shl_left (ir_node *node);
718 void set_Shl_left (ir_node *node, ir_node *left);
719 ir_node *get_Shl_right (ir_node *node);
720 void set_Shl_right (ir_node *node, ir_node *right);
722 ir_node *get_Shr_left (ir_node *node);
723 void set_Shr_left (ir_node *node, ir_node *left);
724 ir_node *get_Shr_right (ir_node *node);
725 void set_Shr_right (ir_node *node, ir_node *right);
727 ir_node *get_Shrs_left (ir_node *node);
728 void set_Shrs_left (ir_node *node, ir_node *left);
729 ir_node *get_Shrs_right (ir_node *node);
730 void set_Shrs_right (ir_node *node, ir_node *right);
732 ir_node *get_Rot_left (ir_node *node);
733 void set_Rot_left (ir_node *node, ir_node *left);
734 ir_node *get_Rot_right (ir_node *node);
735 void set_Rot_right (ir_node *node, ir_node *right);
737 ir_node *get_Conv_op (ir_node *node);
738 void set_Conv_op (ir_node *node, ir_node *op);
740 /* Does Cast need a mem operator?
741 * Cast should only depend on the type, not on the state of an
742 * entity. But: we initialize various fields after Alloc, that
743 * are accessed in the cast. This required some precaution, to
744 * get the right memory into the Loads generated from the cast.
746 ir_node *get_Cast_op (ir_node *node);
747 void set_Cast_op (ir_node *node, ir_node *op);
748 ir_type *get_Cast_type (ir_node *node);
749 void set_Cast_type (ir_node *node, ir_type *to_tp);
751 /** Checks for upcast.
753 * Returns true if the Cast node casts a class type to a super type.
754 * Works also for pointers to classes (recursively).
756 int is_Cast_upcast(ir_node *node);
758 /** Checks for downcast.
760 * Returns true if the Cast node casts a class type to a sub type.
761 * Works also for pointers to classes (recursively).
763 int is_Cast_downcast(ir_node *node);
766 /** Returns true if n is Phi or Filter in interprocedural_view.
767 Returns false if irg in phase building and the Phi has zero
768 predecessors: it's a Phi0. */
769 int is_Phi (const ir_node *n);
770 /** Returns true if irg in phase building and the Phi has zero
771 predecessors: it's a Phi0. */
772 int is_Phi0 (const ir_node *n);
773 /* These routines also work for Filter nodes in interprocedural view. */
774 ir_node **get_Phi_preds_arr (ir_node *node);
775 int get_Phi_n_preds (ir_node *node);
776 ir_node *get_Phi_pred (ir_node *node, int pos);
777 void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
779 ir_node *get_Filter_pred(ir_node *node);
780 void set_Filter_pred(ir_node *node, ir_node *pred);
781 long get_Filter_proj(ir_node *node);
782 void set_Filter_proj(ir_node *node, long proj);
783 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
784 * @@@ Maybe better: arity is zero if no cg preds. */
785 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
786 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
787 int get_Filter_n_cg_preds(ir_node *node);
788 ir_node *get_Filter_cg_pred(ir_node *node, int pos);
790 /** Return true if parameter is a memory operation.
792 * A memory operation is an operation that changes the
793 * memory. I.e., a Load or a Store operation.
795 int is_memop(ir_node *node);
796 ir_node *get_memop_mem (ir_node *node);
797 void set_memop_mem (ir_node *node, ir_node *mem);
798 ir_node *get_memop_ptr (ir_node *node);
799 void set_memop_ptr (ir_node *node, ir_node *ptr);
802 * Projection numbers for Load: use for Proj nodes!
805 pn_Load_M, /**< Memory result. */
806 pn_Load_X_except, /**< Execution result if exception occurred. */
807 pn_Load_res, /**< Result of load operation. */
808 pn_Load_max /**< number of projections from a Load */
809 } pn_Load; /* Projection numbers for Load. */
811 ir_node *get_Load_mem (ir_node *node);
812 void set_Load_mem (ir_node *node, ir_node *mem);
813 ir_node *get_Load_ptr (ir_node *node);
814 void set_Load_ptr (ir_node *node, ir_node *ptr);
815 ir_mode *get_Load_mode (ir_node *node);
816 void set_Load_mode (ir_node *node, ir_mode *mode);
817 ent_volatility get_Load_volatility (ir_node *node);
818 void set_Load_volatility (ir_node *node, ent_volatility volatility);
821 * Projection numbers for Store: use for Proj nodes!
824 pn_Store_M, /**< Memory result. */
825 pn_Store_X_except, /**< Execution result if exception occurred. */
826 pn_Store_max /**< number of projections from a Store */
827 } pn_Store; /* Projection numbers for Store. */
829 ir_node *get_Store_mem (ir_node *node);
830 void set_Store_mem (ir_node *node, ir_node *mem);
831 ir_node *get_Store_ptr (ir_node *node);
832 void set_Store_ptr (ir_node *node, ir_node *ptr);
833 ir_node *get_Store_value (ir_node *node);
834 void set_Store_value (ir_node *node, ir_node *value);
835 ent_volatility get_Store_volatility (ir_node *node);
836 void set_Store_volatility (ir_node *node, ent_volatility volatility);
839 * Projection numbers for Alloc: use for Proj nodes!
842 pn_Alloc_M, /**< Memory result. */
843 pn_Alloc_X_except, /**< Execution result if exception occurred. */
844 pn_Alloc_res, /**< Result of allocation. */
845 pn_Alloc_max /**< number of projections from an Alloc */
846 } pn_Alloc; /* Projection numbers for Alloc. */
848 ir_node *get_Alloc_mem (ir_node *node);
849 void set_Alloc_mem (ir_node *node, ir_node *mem);
850 ir_node *get_Alloc_size (ir_node *node);
851 void set_Alloc_size (ir_node *node, ir_node *size);
852 ir_type *get_Alloc_type (ir_node *node);
853 void set_Alloc_type (ir_node *node, ir_type *tp);
855 /** The allocation place. */
857 stack_alloc, /**< Alloc allocates the object on the stack. */
858 heap_alloc /**< Alloc allocates the object on the heap. */
861 where_alloc get_Alloc_where (ir_node *node);
862 void set_Alloc_where (ir_node *node, where_alloc where);
864 ir_node *get_Free_mem (ir_node *node);
865 void set_Free_mem (ir_node *node, ir_node *mem);
866 ir_node *get_Free_ptr (ir_node *node);
867 void set_Free_ptr (ir_node *node, ir_node *ptr);
868 ir_node *get_Free_size (ir_node *node);
869 void set_Free_size (ir_node *node, ir_node *size);
870 ir_type *get_Free_type (ir_node *node);
871 void set_Free_type (ir_node *node, ir_type *tp);
873 where_alloc get_Free_where (ir_node *node);
874 void set_Free_where (ir_node *node, where_alloc where);
876 ir_node **get_Sync_preds_arr (ir_node *node);
877 int get_Sync_n_preds (ir_node *node);
878 ir_node *get_Sync_pred (ir_node *node, int pos);
879 void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
881 /** Returns the source language type of a Proj node.
882 * Must be an atomic type. Mode of type must be mode of node.
884 ir_type *get_Proj_type (ir_node *node);
886 /** Return the predecessor of a Proj node. */
887 ir_node *get_Proj_pred (const ir_node *node);
888 void set_Proj_pred (ir_node *node, ir_node *pred);
889 /** Return the projection number of a Proj node. */
890 long get_Proj_proj (const ir_node *node);
891 void set_Proj_proj (ir_node *node, long proj);
893 ir_node **get_Tuple_preds_arr (ir_node *node);
894 int get_Tuple_n_preds (ir_node *node);
895 ir_node *get_Tuple_pred (ir_node *node, int pos);
896 void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
898 ir_node *get_Id_pred (ir_node *node);
899 void set_Id_pred (ir_node *node, ir_node *pred);
901 /** Confirm has a single result and returns 'value' unchanged.
902 * The node expresses a restriction on 'value':
903 * 'value' 'cmp' 'bound' == true. */
904 ir_node *get_Confirm_value (ir_node *node);
905 void set_Confirm_value (ir_node *node, ir_node *value);
906 ir_node *get_Confirm_bound (ir_node *node);
907 void set_Confirm_bound (ir_node *node, ir_node *bound);
908 pn_Cmp get_Confirm_cmp (ir_node *node);
909 void set_Confirm_cmp (ir_node *node, pn_Cmp cmp);
912 * Mux Support: Note that Psi nodes with one condition can be handled
913 * like Mux nodes, and the access functions work as expected.
915 ir_node *get_Mux_sel (ir_node *node);
916 void set_Mux_sel (ir_node *node, ir_node *sel);
917 ir_node *get_Mux_false (ir_node *node);
918 void set_Mux_false (ir_node *node, ir_node *ir_false);
919 ir_node *get_Mux_true (ir_node *node);
920 void set_Mux_true (ir_node *node, ir_node *ir_true);
922 ir_node *get_Psi_cond (ir_node *node, int pos);
923 void set_Psi_cond (ir_node *node, int pos, ir_node *cond);
924 ir_node *get_Psi_val (ir_node *node, int pos);
925 void set_Psi_val (ir_node *node, int pos, ir_node *val);
926 ir_node *get_Psi_default(ir_node *node);
927 void set_Psi_default(ir_node *node, ir_node *val);
928 int get_Psi_n_conds(ir_node *node);
931 * Projection numbers for result of CopyB node: use for Proj nodes!
934 pn_CopyB_M_regular = 0, /**< The memory result. */
935 pn_CopyB_X_except = 1, /**< The control flow result branching to the exception handler */
936 pn_CopyB_M_except = 2, /**< The memory result in case the runtime function terminated with
938 pn_CopyB_max = 3 /**< number of projections from a CopyB */
939 } pn_CopyB; /* Projection numbers for CopyB. */
940 #define pn_CopyB_M pn_CopyB_M_regular
942 ir_node *get_CopyB_mem (ir_node *node);
943 void set_CopyB_mem (ir_node *node, ir_node *mem);
944 ir_node *get_CopyB_dst (ir_node *node);
945 void set_CopyB_dst (ir_node *node, ir_node *dst);
946 ir_node *get_CopyB_src (ir_node *node);
947 void set_CopyB_src (ir_node *node, ir_node *src);
948 ir_type *get_CopyB_type(ir_node *node);
949 void set_CopyB_type(ir_node *node, ir_type *data_type);
952 * Projection numbers for result of InstOf node: use for Proj nodes!
955 pn_InstOf_M_regular = 0, /**< The memory result. */
956 pn_InstOf_X_except = 1, /**< The control flow result branching to the exception handler */
957 pn_InstOf_res = 2, /**< The checked object pointer. */
958 pn_InstOf_M_except = 3, /**< The memory result in case the runtime function terminated with
960 pn_InstOf_max = 4 /**< number of projections from an InstOf */
962 #define pn_InstOf_M pn_InstOf_M_regular
965 ir_type *get_InstOf_type (ir_node *node);
966 void set_InstOf_type (ir_node *node, ir_type *type);
967 ir_node *get_InstOf_store (ir_node *node);
968 void set_InstOf_store (ir_node *node, ir_node *obj);
969 ir_node *get_InstOf_obj (ir_node *node);
970 void set_InstOf_obj (ir_node *node, ir_node *obj);
973 * Projection numbers for Raise.
976 pn_Raise_X = 0, /**< The control flow to the exception handler. */
977 pn_Raise_M = 1, /**< The Memory result. */
978 pn_Raise_max /**< number of projections from a Raise */
979 } pn_Raise; /* Projection numbers for Raise. */
981 ir_node *get_Raise_mem (ir_node *node);
982 void set_Raise_mem (ir_node *node, ir_node *mem);
983 ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
984 void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
987 * Projection numbers for result of Bound node: use for Proj nodes!
990 pn_Bound_M_regular = 0, /**< The memory result. */
991 pn_Bound_X_except = 1, /**< The control flow result branching to the exception handler */
992 pn_Bound_res = 2, /**< The checked index. */
993 pn_Bound_M_except = 3, /**< The memory result in case the runtime function terminated with
995 pn_Bound_max = 4 /**< number of projections from a Bound */
997 #define pn_Bound_M pn_Bound_M_regular
999 /** Returns the memory input of a Bound operation. */
1000 ir_node *get_Bound_mem(ir_node *bound);
1001 void set_Bound_mem (ir_node *bound, ir_node *mem);
1003 /** Returns the index input of a Bound operation. */
1004 ir_node *get_Bound_index(ir_node *bound);
1005 void set_Bound_index(ir_node *bound, ir_node *idx);
1007 /** Returns the lower bound input of a Bound operation. */
1008 ir_node *get_Bound_lower(ir_node *bound);
1009 void set_Bound_lower(ir_node *bound, ir_node *lower);
1011 /** Returns the upper bound input of a Bound operation. */
1012 ir_node *get_Bound_upper(ir_node *bound);
1013 void set_Bound_upper(ir_node *bound, ir_node *upper);
1017 * NAME Auxiliary routines
1019 * Not properly documented ;-)
1023 /** returns operand of node if node is a Proj. */
1024 ir_node *skip_Proj (ir_node *node);
1025 /** returns operand of node if node is a Id */
1026 ir_node *skip_Id (ir_node *node); /* Old name is skip_nop(). */
1027 /** returns corresponding operand of Tuple if node is a Proj from
1029 ir_node *skip_Tuple (ir_node *node);
1030 /** returns operand of node if node is a Cast */
1031 ir_node *skip_Cast (ir_node *node);
1032 /** returns operand of node if node is a Confirm */
1033 ir_node *skip_Confirm (ir_node *node);
1034 /** Skip all high-level Operations. */
1035 ir_node *skip_HighLevel(ir_node *node);
1036 /** returns true if irn is a Const node. */
1037 int is_Const(const ir_node *node);
1038 /** returns true if node is a Bad node. */
1039 int is_Bad (const ir_node *node);
1040 /** returns true if the node is not a Block */
1041 int is_no_Block (const ir_node *node);
1042 /** returns true if the node is a Block */
1043 int is_Block (const ir_node *node);
1044 /** returns true if node is an Unknown node. */
1045 int is_Unknown (const ir_node *node);
1046 /** returns true if node is a Return node. */
1047 int is_Return (const ir_node *node);
1048 /** returns true if node is a Call node. */
1049 int is_Call (const ir_node *node);
1050 /** returns true if node is a Sel node. */
1051 int is_Sel (const ir_node *node);
1052 /** returns true if node is a Mux node or a Psi with only one condition. */
1053 int is_Mux (const ir_node *node);
1054 /** returns true if node is a Proj node or a Filter node in
1055 * intraprocedural view */
1056 int is_Proj (const ir_node *node);
1057 /** Returns true if the operation manipulates control flow:
1058 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
1059 int is_cfop(const ir_node *node);
1061 /** Returns true if the operation manipulates interprocedural control flow:
1062 CallBegin, EndReg, EndExcept */
1063 int is_ip_cfop(const ir_node *node);
1064 /** Returns true if the operation can change the control flow because
1065 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
1066 Bad. Raise is not fragile, but a unconditional jump. */
1067 int is_fragile_op(const ir_node *node);
1068 /** Returns the memory operand of fragile operations. */
1069 ir_node *get_fragile_op_mem(ir_node *node);
1071 /** Returns true if the operation is a forking control flow
1072 * operation: Cond. */
1073 int is_irn_forking(const ir_node *node);
1075 /** Return the type associated with the value produced by n
1076 * if the node remarks this type as it is the case for
1077 * Cast, Const, SymConst and some Proj nodes or unknown_type. */
1078 ir_type *get_irn_type(ir_node *n);
1080 /** Return the type attribute of a node n (SymConst, Call, Alloc, Free,
1082 ir_type *get_irn_type_attr(ir_node *n);
1084 /** Return the entity attribute of a node n (SymConst, Sel) or NULL. */
1085 entity *get_irn_entity_attr(ir_node *n);
1087 /** Returns non-zero for constant-like nodes. */
1088 int is_irn_constlike(const ir_node *node);
1091 * Returns non-zero for nodes that are allowed to have keep-alives and
1092 * are neither Block nor PhiM.
1094 int is_irn_keep(const ir_node *node);
1097 * A type to express conditional jump predictions.
1100 COND_JMP_PRED_NONE, /**< No jump prediction. Default. */
1101 COND_JMP_PRED_TRUE, /**< The True case is predicted. */
1102 COND_JMP_PRED_FALSE /**< The False case is predicted. */
1103 } cond_jmp_predicate;
1105 /** Gets the string representation of the jump prediction .*/
1106 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred);
1108 /** Returns the conditional jump prediction of a Cond node. */
1109 cond_jmp_predicate get_Cond_jmp_pred(ir_node *cond);
1111 /** Sets a new conditional jump prediction. */
1112 void set_Cond_jmp_pred(ir_node *cond, cond_jmp_predicate pred);
1115 * Access custom node data.
1116 * The data must have been registered with
1117 * register_additional_node_data() before.
1118 * @param node The ir node to get the data from.
1119 * @param type The type of the data you registered.
1120 * @param off The value returned by register_additional_node_data().
1121 * @return A pointer of type @p type.
1123 #define get_irn_data(node,type,off) \
1124 (assert(off > 0 && "Invalid node data offset"), (type *) ((char *) (node) - (off)))
1127 * Get the pointer to the node some custom data belongs to.
1128 * @param data The pointer to the custom data.
1129 * @param off The number as returned by register_additional_node_data().
1130 * @return A pointer to the ir node the custom data belongs to.
1132 #define get_irn_data_base(data,off) \
1133 (assert(off > 0 && "Invalid node data offset"), (ir_node *) ((char *) (data) + (off)))
1136 * Request additional data to be allocated with an ir node.
1137 * @param size The size of the additional data required.
1138 * @return A positive number, if the operation was successful, which
1139 * must be passed to the access macro get_irn_data(), 0 if the
1140 * registration failed.
1142 unsigned register_additional_node_data(unsigned size);
1145 * Return a pointer to the node attributes.
1146 * Needed for user-defined nodes.
1148 void *get_irn_generic_attr(ir_node *node);
1150 /*-----------------------------------------------------------------*/
1152 /*-----------------------------------------------------------------*/
1155 /** Debug print the node.
1157 * Writes the node, all its attributes and the predecessors to stdout if DEBUG_libfirm
1158 * is set. Else does nothing. */
1159 void dump_irn(ir_node *n);
1165 /* GNU C has the __FUNCTION__ extension */
1166 #define __MYFUNC__ __FUNCTION__
1168 /* use Filename instead */
1169 #define __MYFUNC__ __FILE__
1173 Don't format with "\", firmjni gets problems */
1174 /** Output location */
1175 #define DDM printf("%s(l.%i).\n", __MYFUNC__, __LINE__);
1176 /** Output the firm kind of the node */
1177 #define DDMK(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, print_firm_kind(X), (void *)(X));
1178 /** Output information about a node */
1180 /*#define DDMN(X) printf("%s(l.%i) %s%s: %ld (%p)\n", __MYFUNC__, __LINE__, get_irn_opname(X), get_mode_name(get_irn_mode(X)), get_irn_node_nr(X), (void *)(X))*/
1181 int dump_node_opcode(FILE *F, ir_node *n);
1182 #define DDMN(X) do { printf("%s(l.%i) ", __MYFUNC__, __LINE__); dump_node_opcode(stdout, X); printf(": %ld (%p)\n", get_irn_node_nr(X), (void *)(X)); } while (0)
1184 /** Output information about a node and its block */
1185 #define DDMNB(X) printf("%s%s: %ld (in block %ld)\n", get_irn_opname(X), get_mode_name(get_irn_mode(X)), get_irn_node_nr(X), get_irn_node_nr(get_nodes_block(X)))
1186 /** Output information about a type */
1187 #define DDMT(X) printf("%s(l.%i) %s %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_type_tpop_name(X), get_type_name(X), get_type_nr(X), (void *)(X))
1188 /** Output information about an entity */
1189 #define DDME(X) printf("%s(l.%i) %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_entity_nr(X), (void *)(X))
1190 /** Output information about an entity and its type */
1191 #define DDMET(X) printf("%s(l.%i) %s (typ: %s): %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_type_name(get_entity_type(X)), get_entity_nr(X), (void *)(X))
1192 /** Output information about an entity and its owner */
1193 #define DDMEO(X) printf("%s(l.%i) %s (own: %s): %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_type_name(get_entity_owner(X)), get_entity_nr(X), (void *)(X))
1194 /** Output information about a graph */
1195 #define DDMG(X) printf("%s(l.%i) graph %s: %ld (%p) in %s %s.\n", __MYFUNC__, __LINE__, get_entity_name(get_irg_entity(X)), get_irg_graph_nr(X), (void *)(X), get_type_tpop_name(get_entity_owner(get_irg_entity(X))), get_type_name(get_entity_owner(get_irg_entity(X))))
1196 /** Output information about an ident */
1197 #define DDMI(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_id_str(X), (void *)(X))
1198 /** Output information about a mode */
1199 #define DDMM(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_mode_name(X), (void *)(X))
1200 /** Output information about a loop */
1201 #define DDML(X) printf("%s(l.%i) loop with depth %d: %d\n", __MYFUNC__, __LINE__, get_loop_depth(X), get_loop_loop_nr(X))
1202 /** Output information about a tarVal */
1203 #define DDMV(X) printf("%s(l.%i) tarval: ",__MYFUNC__, __LINE__); tarval_printf(X); printf(" (%p)\n", (void *)(X));
1205 /*@}*/ /* end of ir_node group definition */
1212 #endif /* _IRNODE_H_ */