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 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 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 corresonding 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 bool get_Block_matured (ir_node *node);
281 void set_Block_matured (ir_node *node, bool 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);
390 ir_node *get_Raise_mem (ir_node *node);
391 void set_Raise_mem (ir_node *node, ir_node *mem);
392 ir_node *get_Raise_exo_ptr (ir_node *node); /* PoinTeR to EXception Object */
393 void set_Raise_exo_ptr (ir_node *node, ir_node *exoptr);
396 * Projection numbers for Raise.
399 pn_Raise_X, /**< Execution result. */
400 pn_Raise_M, /**< Memory result. */
401 pn_Raise_max /**< number of projections from a Raise */
402 } pn_Raise; /* Projection numbers for Raise. */
405 CNST_NULL = 0, /**< The node is a const(0). */
406 CNST_ONE = +1, /**< The node is a const(1). */
407 CNST_ALL_ONE = -1, /**< The node is a const(11111...). */
408 CNST_OTHER = 2, /**< The tarval of the const has another value. */
409 CNST_SYMCONST = 3, /**< The node is symconst. */
410 CNST_NO_CONST = 4 /**< The node is no const at all. */
413 tarval *get_Const_tarval (ir_node *node);
414 void set_Const_tarval (ir_node *node, tarval *con);
417 * Classify a node concerning constant properties.
418 * @param irn A node to check for.
419 * @return Constant properties of that node.
421 cnst_classify_t classify_Const(ir_node *irn);
423 /** Returns the source language type of a Const node.
424 * Must be an atomic type. Mode of type must be mode of node.
426 type *get_Const_type (ir_node *node);
428 /** Sets the source language type of a Const node. */
429 void set_Const_type (ir_node *node, type *tp);
431 /** This enum names the three different kinds of symbolic Constants
432 represented by SymConst. The content of the attribute type_or_id
433 depends on this tag. Use the proper access routine after testing
436 symconst_type_tag, /**< The SymConst is a type tag for the given type.
437 Type_or_id_p is type *. */
438 symconst_size, /**< The SymConst is the size of the given type.
439 Type_or_id_p is type *. */
440 symconst_addr_name, /**< The SymConst is a symbolic pointer to be filled in
441 by the linker. The pointer is represented by a string.
442 Type_or_id_p is ident *. */
443 symconst_addr_ent /**< The SymConst is a symbolic pointer to be filled in
444 by the linker. The pointer is represented by an entity.
445 Type_or_id_p is entity *. */
448 /** SymConst attribute.
450 * This union contains the symbolic information represented by the node. */
451 union symconst_symbol {
457 typedef union symconst_symbol symconst_symbol;
460 /** Get the kind of the SymConst. */
461 symconst_kind get_SymConst_kind (const ir_node *node);
462 /** Set the kind of the SymConst. */
463 void set_SymConst_kind (ir_node *node, symconst_kind num);
465 /** Only to access SymConst of kind type_tag or size. Else assertion: */
466 type *get_SymConst_type (ir_node *node);
467 void set_SymConst_type (ir_node *node, type *tp);
469 /** Only to access SymConst of kind addr_name. Else assertion: */
470 ident *get_SymConst_name (ir_node *node);
471 void set_SymConst_name (ir_node *node, ident *name);
473 /** Only to access SymConst of kind addr_ent. Else assertion: */
474 entity *get_SymConst_entity (ir_node *node);
475 void set_SymConst_entity (ir_node *node, entity *ent);
477 /** Sets both: type and ptrinfo. Needed to treat the node independent of
478 its semantics. Does a memcpy for the memory sym points to. */
479 /* write 'union': firmjni then does not create a method... */
480 union symconst_symbol get_SymConst_symbol (ir_node *node);
481 void set_SymConst_symbol (ir_node *node,
482 union symconst_symbol sym);
484 /** Access the type of the value represented by the SymConst.
486 * Example: primitive type int for SymConst size. */
487 type *get_SymConst_value_type (ir_node *node);
488 void set_SymConst_value_type (ir_node *node, type *tp);
490 ir_node *get_Sel_mem (ir_node *node);
491 void set_Sel_mem (ir_node *node, ir_node *mem);
492 ir_node *get_Sel_ptr (ir_node *node); /* ptr to the object to select from */
493 void set_Sel_ptr (ir_node *node, ir_node *ptr);
494 ir_node **get_Sel_index_arr (ir_node *node);
495 int get_Sel_n_indexs (ir_node *node);
496 ir_node *get_Sel_index (ir_node *node, int pos);
497 void set_Sel_index (ir_node *node, int pos, ir_node *index);
498 entity *get_Sel_entity (ir_node *node); /* entity to select */
499 void set_Sel_entity (ir_node *node, entity *ent);
502 type *get_InstOf_ent (ir_node *node);
503 void set_InstOf_ent (ir_node *node, type *ent);
504 ir_node *get_InstOf_store (ir_node *node);
505 void set_InstOf_store (ir_node *node, ir_node *obj);
506 ir_node *get_InstOf_obj (ir_node *node);
507 void set_InstOf_obj (ir_node *node, ir_node *obj);
510 * Projection numbers for result of Call node: use for Proj nodes!
513 pn_Call_M_regular = 0, /**< The memory result. */
514 pn_Call_T_result = 2, /**< The tuple containing all (0, 1, 2, ...) results */
515 pn_Call_P_value_res_base = 4,/**< A pointer to the memory region containing copied results
516 passed by value (for compound result types). */
517 pn_Call_X_except = 1, /**< The control flow result branching to the exception handler */
518 pn_Call_M_except = 3, /**< The memory result in case the called method terminated with
520 pn_Call_max = 5 /**< number of projections from a Call */
521 } pn_Call; /* Projection numbers for Call. */
522 #define pn_Call_M pn_Call_M_regular
524 ir_node *get_Call_mem (ir_node *node);
525 void set_Call_mem (ir_node *node, ir_node *mem);
526 ir_node *get_Call_ptr (ir_node *node);
527 void set_Call_ptr (ir_node *node, ir_node *ptr);
528 ir_node **get_Call_param_arr (ir_node *node);
529 /** Gets the number of parameters of a call. */
530 int get_Call_n_params (ir_node *node);
531 /** Gets the call parameter at position pos. */
532 ir_node *get_Call_param (ir_node *node, int pos);
533 /** Sets the call parameter at position pos. */
534 void set_Call_param (ir_node *node, int pos, ir_node *param);
535 /** Gets the type of a call. */
536 type *get_Call_type (ir_node *node);
537 /** Sets the type of a call. */
538 void set_Call_type (ir_node *node, type *tp);
539 /** Gets the arity of a call. Identical to get_Call_n_params(). */
540 int get_Call_arity (ir_node *node);
542 /** Set, get and remove the callee information for a Call node.
544 * The callee information lists all method entities that can be called
545 * from this node. If the address expression can not be analyzed fully,
546 * e.g., as entities can be called that are not in the compilation unit,
547 * the array contains the unknown_entity. The array contains only entities
548 * with peculiarity_existent, but with all kinds of visibility. The entities
549 * not necessarily contain an irg.
551 * The array is only accessible if callee information is valid. See flag
554 * The memory allocated for the array is managed automatically, i.e., it must
555 * not be freed if the Call node is removed from the graph.
557 * @param node A Call node.
559 int Call_has_callees (ir_node *node);
560 int get_Call_n_callees (ir_node *node);
561 entity *get_Call_callee (ir_node *node, int pos);
563 /** Set the full callee array.
565 * The passed array is copied. Assumes current_ir_graph set properly! */
566 void set_Call_callee_arr (ir_node *node, const int n, entity **arr);
567 void remove_Call_callee_arr(ir_node *node);
569 ir_node *get_CallBegin_ptr (ir_node *node);
570 void set_CallBegin_ptr (ir_node *node, ir_node *ptr);
571 ir_node *get_CallBegin_call (ir_node *node);
572 void set_CallBegin_call (ir_node *node, ir_node *call);
574 /* For unary and binary arithmetic operations the access to the
575 operands can be factored out. Left is the first, right the
576 second arithmetic value as listed in tech report 1999-44.
577 unops are: Minus, Abs, Not, Conv, Cast
578 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
579 Shr, Shrs, Rot, Cmp */
580 int is_unop (const ir_node *node);
581 ir_node *get_unop_op (ir_node *node);
582 void set_unop_op (ir_node *node, ir_node *op);
583 int is_binop (const ir_node *node);
584 ir_node *get_binop_left (ir_node *node);
585 void set_binop_left (ir_node *node, ir_node *left);
586 ir_node *get_binop_right (ir_node *node);
587 void set_binop_right (ir_node *node, ir_node *right);
589 ir_node *get_Add_left (ir_node *node);
590 void set_Add_left (ir_node *node, ir_node *left);
591 ir_node *get_Add_right (ir_node *node);
592 void set_Add_right (ir_node *node, ir_node *right);
594 ir_node *get_Sub_left (ir_node *node);
595 void set_Sub_left (ir_node *node, ir_node *left);
596 ir_node *get_Sub_right (ir_node *node);
597 void set_Sub_right (ir_node *node, ir_node *right);
599 ir_node *get_Minus_op (ir_node *node);
600 void set_Minus_op (ir_node *node, ir_node *op);
602 ir_node *get_Mul_left (ir_node *node);
603 void set_Mul_left (ir_node *node, ir_node *left);
604 ir_node *get_Mul_right (ir_node *node);
605 void set_Mul_right (ir_node *node, ir_node *right);
607 ir_node *get_Quot_left (ir_node *node);
608 void set_Quot_left (ir_node *node, ir_node *left);
609 ir_node *get_Quot_right (ir_node *node);
610 void set_Quot_right (ir_node *node, ir_node *right);
611 ir_node *get_Quot_mem (ir_node *node);
612 void set_Quot_mem (ir_node *node, ir_node *mem);
615 * Projection numbers for Quot: use for Proj nodes!
618 pn_Quot_M, /**< Memory result. */
619 pn_Quot_X_except, /**< Execution result if exception occurred. */
620 pn_Quot_res, /**< Result of computation. */
621 pn_Quot_max /**< number of projections from a Quot */
622 } pn_Quot; /* Projection numbers for Quot. */
624 ir_node *get_DivMod_left (ir_node *node);
625 void set_DivMod_left (ir_node *node, ir_node *left);
626 ir_node *get_DivMod_right (ir_node *node);
627 void set_DivMod_right (ir_node *node, ir_node *right);
628 ir_node *get_DivMod_mem (ir_node *node);
629 void set_DivMod_mem (ir_node *node, ir_node *mem);
632 * Projection numbers for DivMod: use for Proj nodes!
635 pn_DivMod_M, /**< Memory result. */
636 pn_DivMod_X_except, /**< Execution result if exception occurred. */
637 pn_DivMod_res_div, /**< Result of computation a / b. */
638 pn_DivMod_res_mod, /**< Result of computation a % b. */
639 pn_DivMod_max /**< number of projections from a DivMod */
640 } pn_DivMod; /* Projection numbers for DivMod. */
642 ir_node *get_Div_left (ir_node *node);
643 void set_Div_left (ir_node *node, ir_node *left);
644 ir_node *get_Div_right (ir_node *node);
645 void set_Div_right (ir_node *node, ir_node *right);
646 ir_node *get_Div_mem (ir_node *node);
647 void set_Div_mem (ir_node *node, ir_node *mem);
650 * Projection numbers for Div: use for Proj nodes!
653 pn_Div_M, /**< Memory result. */
654 pn_Div_X_except, /**< Execution result if exception occurred. */
655 pn_Div_res /**< Result of computation. */
656 } pn_Div; /* Projection numbers for Div. */
658 ir_node *get_Mod_left (ir_node *node);
659 void set_Mod_left (ir_node *node, ir_node *left);
660 ir_node *get_Mod_right (ir_node *node);
661 void set_Mod_right (ir_node *node, ir_node *right);
662 ir_node *get_Mod_mem (ir_node *node);
663 void set_Mod_mem (ir_node *node, ir_node *mem);
666 * Projection numbers for Mod: use for Proj nodes!
669 pn_Mod_M, /**< Memory result. */
670 pn_Mod_X_except, /**< Execution result if exception occurred. */
671 pn_Mod_res, /**< Result of computation. */
672 pn_Mod_max /**< number of projections from a Mod */
673 } pn_Mod; /* Projection numbers for Mod. */
675 ir_node *get_Abs_op (ir_node *node);
676 void set_Abs_op (ir_node *node, ir_node *op);
678 ir_node *get_And_left (ir_node *node);
679 void set_And_left (ir_node *node, ir_node *left);
680 ir_node *get_And_right (ir_node *node);
681 void set_And_right (ir_node *node, ir_node *right);
683 ir_node *get_Or_left (ir_node *node);
684 void set_Or_left (ir_node *node, ir_node *left);
685 ir_node *get_Or_right (ir_node *node);
686 void set_Or_right (ir_node *node, ir_node *right);
688 ir_node *get_Eor_left (ir_node *node);
689 void set_Eor_left (ir_node *node, ir_node *left);
690 ir_node *get_Eor_right (ir_node *node);
691 void set_Eor_right (ir_node *node, ir_node *right);
693 ir_node *get_Not_op (ir_node *node);
694 void set_Not_op (ir_node *node, ir_node *op);
697 * Projection numbers for Cmp are defined several times.
698 * The bit patterns are used for various tests, so don't change.
699 * The "unordered" values are possible results of comparing
700 * floating point numbers.
701 * Note that the encoding is imported, so do NOT change the order.
704 pn_Cmp_False = 0, /**< false */
705 pn_Cmp_Eq = 1, /**< equal */
706 pn_Cmp_Lt = 2, /**< less */
707 pn_Cmp_Le = pn_Cmp_Eq|pn_Cmp_Lt, /**< less or equal */
708 pn_Cmp_Gt = 4, /**< greater */
709 pn_Cmp_Ge = pn_Cmp_Eq|pn_Cmp_Gt, /**< greater or equal */
710 pn_Cmp_Lg = pn_Cmp_Lt|pn_Cmp_Gt, /**< less or greater */
711 pn_Cmp_Leg = pn_Cmp_Lt|pn_Cmp_Eq|pn_Cmp_Gt, /**< less, equal or greater = ordered */
712 pn_Cmp_Uo = 8, /**< unordered */
713 pn_Cmp_Ue = pn_Cmp_Uo|pn_Cmp_Eq, /**< unordered or equal */
714 pn_Cmp_Ul = pn_Cmp_Uo|pn_Cmp_Lt, /**< unordered or less */
715 pn_Cmp_Ule = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Lt, /**< unordered, less or equal */
716 pn_Cmp_Ug = pn_Cmp_Uo|pn_Cmp_Gt, /**< unordered or greater */
717 pn_Cmp_Uge = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Gt, /**< unordered, greater or equal */
718 pn_Cmp_Ne = pn_Cmp_Uo|pn_Cmp_Lt|pn_Cmp_Gt, /**< unordered, less or greater = not equal */
719 pn_Cmp_True = 15 /**< true */
720 /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for JNI interface */
721 } pn_Cmp; /* Projection numbers for Cmp */
722 /* #define not_mask pn_Cmp_Leg */
724 /** returns the pnc name from an pnc constant */
725 const char *get_pnc_string(int pnc);
727 /** Calculates the negated (Complement(R)) pnc condition. */
728 int get_negated_pnc(int pnc, ir_mode *mode);
730 /** Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
731 int get_inversed_pnc(int pnc);
733 ir_node *get_Cmp_left (ir_node *node);
734 void set_Cmp_left (ir_node *node, ir_node *left);
735 ir_node *get_Cmp_right (ir_node *node);
736 void set_Cmp_right (ir_node *node, ir_node *right);
738 ir_node *get_Shl_left (ir_node *node);
739 void set_Shl_left (ir_node *node, ir_node *left);
740 ir_node *get_Shl_right (ir_node *node);
741 void set_Shl_right (ir_node *node, ir_node *right);
743 ir_node *get_Shr_left (ir_node *node);
744 void set_Shr_left (ir_node *node, ir_node *left);
745 ir_node *get_Shr_right (ir_node *node);
746 void set_Shr_right (ir_node *node, ir_node *right);
748 ir_node *get_Shrs_left (ir_node *node);
749 void set_Shrs_left (ir_node *node, ir_node *left);
750 ir_node *get_Shrs_right (ir_node *node);
751 void set_Shrs_right (ir_node *node, ir_node *right);
753 ir_node *get_Rot_left (ir_node *node);
754 void set_Rot_left (ir_node *node, ir_node *left);
755 ir_node *get_Rot_right (ir_node *node);
756 void set_Rot_right (ir_node *node, ir_node *right);
758 ir_node *get_Conv_op (ir_node *node);
759 void set_Conv_op (ir_node *node, ir_node *op);
761 /* Does Cast need a mem operator?
762 * Cast should only depend on the type, not on the state of an
763 * entity. But: we initialize various fields after Alloc, that
764 * are accessed in the cast. This required some precaution, to
765 * get the right memory into the Loads generated from the cast.
767 ir_node *get_Cast_op (ir_node *node);
768 void set_Cast_op (ir_node *node, ir_node *op);
769 type *get_Cast_type (ir_node *node);
770 void set_Cast_type (ir_node *node, type *to_tp);
772 /** Checks for upcast.
774 * Returns true if the Cast node casts a class type to a super type.
775 * Works also for pointers to classes (recursively).
777 int is_Cast_upcast(ir_node *node);
779 /** Checks for downcast.
781 * Returns true if the Cast node casts a class type to a sub type.
782 * Works also for pointers to classes (recursively).
784 int is_Cast_downcast(ir_node *node);
787 /** Returns true if n is Phi or Filter in interprocedural_view.
788 Returns false if irg in phase building and the Phi has zero
789 predecessors: it's a Phi0. */
790 int is_Phi (const ir_node *n);
791 /** Returns true if irg in phase building and the Phi has zero
792 predecessors: it's a Phi0. */
793 int is_Phi0 (const ir_node *n);
794 /* These routines also work for Filter nodes in interprocedural view. */
795 ir_node **get_Phi_preds_arr (ir_node *node);
796 int get_Phi_n_preds (ir_node *node);
797 ir_node *get_Phi_pred (ir_node *node, int pos);
798 void set_Phi_pred (ir_node *node, int pos, ir_node *pred);
800 ir_node *get_Filter_pred(ir_node *node);
801 void set_Filter_pred(ir_node *node, ir_node *pred);
802 long get_Filter_proj(ir_node *node);
803 void set_Filter_proj(ir_node *node, long proj);
804 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
805 * @@@ Maybe better: arity is zero if no cg preds. */
806 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
807 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
808 int get_Filter_n_cg_preds(ir_node *node);
809 ir_node *get_Filter_cg_pred(ir_node *node, int pos);
811 /** Return true if parameter is a memory operation.
813 * A memory operation is an operation that changes the
814 * memory. I.e., a Load or a Store operation.
816 int is_memop(ir_node *node);
817 ir_node *get_memop_mem (ir_node *node);
818 void set_memop_mem (ir_node *node, ir_node *mem);
819 ir_node *get_memop_ptr (ir_node *node);
820 void set_memop_ptr (ir_node *node, ir_node *ptr);
823 * Projection numbers for Load: use for Proj nodes!
826 pn_Load_M, /**< Memory result. */
827 pn_Load_X_except, /**< Execution result if exception occurred. */
828 pn_Load_res, /**< Result of load operation. */
829 pn_Load_max /**< number of projections from a Load */
830 } pn_Load; /* Projection numbers for Load. */
832 ir_node *get_Load_mem (ir_node *node);
833 void set_Load_mem (ir_node *node, ir_node *mem);
834 ir_node *get_Load_ptr (ir_node *node);
835 void set_Load_ptr (ir_node *node, ir_node *ptr);
836 ir_mode *get_Load_mode (ir_node *node);
837 void set_Load_mode (ir_node *node, ir_mode *mode);
838 ent_volatility get_Load_volatility (ir_node *node);
839 void set_Load_volatility (ir_node *node, ent_volatility volatility);
842 * Projection numbers for Store: use for Proj nodes!
845 pn_Store_M, /**< Memory result. */
846 pn_Store_X_except, /**< Execution result if exception occurred. */
847 pn_Store_max /**< number of projections from a Store */
848 } pn_Store; /* Projection numbers for Store. */
850 ir_node *get_Store_mem (ir_node *node);
851 void set_Store_mem (ir_node *node, ir_node *mem);
852 ir_node *get_Store_ptr (ir_node *node);
853 void set_Store_ptr (ir_node *node, ir_node *ptr);
854 ir_node *get_Store_value (ir_node *node);
855 void set_Store_value (ir_node *node, ir_node *value);
856 ent_volatility get_Store_volatility (ir_node *node);
857 void set_Store_volatility (ir_node *node, ent_volatility volatility);
860 * Projection numbers for Alloc: use for Proj nodes!
863 pn_Alloc_M, /**< Memory result. */
864 pn_Alloc_X_except, /**< Execution result if exception occurred. */
865 pn_Alloc_res, /**< Result of allocation. */
866 pn_Alloc_max /**< number of projections from an Alloc */
867 } pn_Alloc; /* Projection numbers for Alloc. */
869 ir_node *get_Alloc_mem (ir_node *node);
870 void set_Alloc_mem (ir_node *node, ir_node *mem);
871 ir_node *get_Alloc_size (ir_node *node);
872 void set_Alloc_size (ir_node *node, ir_node *size);
873 type *get_Alloc_type (ir_node *node);
874 void set_Alloc_type (ir_node *node, type *tp);
876 /** The allocation place. */
878 stack_alloc, /**< Alloc allocates the object on the stack. */
879 heap_alloc /**< Alloc allocates the object on the heap. */
882 where_alloc get_Alloc_where (ir_node *node);
883 void set_Alloc_where (ir_node *node, where_alloc where);
885 ir_node *get_Free_mem (ir_node *node);
886 void set_Free_mem (ir_node *node, ir_node *mem);
887 ir_node *get_Free_ptr (ir_node *node);
888 void set_Free_ptr (ir_node *node, ir_node *ptr);
889 ir_node *get_Free_size (ir_node *node);
890 void set_Free_size (ir_node *node, ir_node *size);
891 type *get_Free_type (ir_node *node);
892 void set_Free_type (ir_node *node, type *tp);
894 where_alloc get_Free_where (ir_node *node);
895 void set_Free_where (ir_node *node, where_alloc where);
897 ir_node **get_Sync_preds_arr (ir_node *node);
898 int get_Sync_n_preds (ir_node *node);
899 ir_node *get_Sync_pred (ir_node *node, int pos);
900 void set_Sync_pred (ir_node *node, int pos, ir_node *pred);
902 /** Returns the source language type of a Proj node.
903 * Must be an atomic type. Mode of type must be mode of node.
905 type *get_Proj_type (ir_node *node);
907 /** Return the predecessor of a Proj node. */
908 ir_node *get_Proj_pred (const ir_node *node);
909 void set_Proj_pred (ir_node *node, ir_node *pred);
910 /** Return the projection number of a Proj node. */
911 long get_Proj_proj (const ir_node *node);
912 void set_Proj_proj (ir_node *node, long proj);
914 ir_node **get_Tuple_preds_arr (ir_node *node);
915 int get_Tuple_n_preds (ir_node *node);
916 ir_node *get_Tuple_pred (ir_node *node, int pos);
917 void set_Tuple_pred (ir_node *node, int pos, ir_node *pred);
919 ir_node *get_Id_pred (ir_node *node);
920 void set_Id_pred (ir_node *node, ir_node *pred);
922 /** Confirm has a single result and returns 'value' unchanged.
923 * The node expresses a restriction on 'value':
924 * 'value' 'cmp' 'bound' == true. */
925 ir_node *get_Confirm_value (ir_node *node);
926 void set_Confirm_value (ir_node *node, ir_node *value);
927 ir_node *get_Confirm_bound (ir_node *node);
928 void set_Confirm_bound (ir_node *node, ir_node *bound);
929 pn_Cmp get_Confirm_cmp (ir_node *node);
930 void set_Confirm_cmp (ir_node *node, pn_Cmp cmp);
932 ir_node *get_Mux_sel (ir_node *node);
933 void set_Mux_sel (ir_node *node, ir_node *sel);
934 ir_node *get_Mux_false (ir_node *node);
935 void set_Mux_false (ir_node *node, ir_node *ir_false);
936 ir_node *get_Mux_true (ir_node *node);
937 void set_Mux_true (ir_node *node, ir_node *ir_true);
942 * NAME Auxiliary routines
944 * Not properly documented ;-)
948 /** returns operand of node if node is a Proj. */
949 ir_node *skip_Proj (ir_node *node);
950 /** returns operand of node if node is a Id */
951 ir_node *skip_Id (ir_node *node); /* Same as skip_nop. */
952 /** returns corresponding operand of Tuple if node is a Proj from
954 ir_node *skip_Tuple (ir_node *node);
955 /** returns operand of node if node is a Cast */
956 ir_node *skip_Cast (ir_node *node);
957 /** returns operand of node if node is a Confirm */
958 ir_node *skip_Confirm (ir_node *node);
959 /** Skip all high-level Operations. */
960 ir_node *skip_HighLevel(ir_node *node);
961 /** returns true if irn is a Const node. */
962 int is_Const(const ir_node *node);
963 /** returns true if node is a Bad node. */
964 int is_Bad (const ir_node *node);
965 /** returns true if the node is not a Block */
966 int is_no_Block (const ir_node *node);
967 /** returns true if the node is a Block */
968 int is_Block (const ir_node *node);
969 /** returns true if node is a Unknown node. */
970 int is_Unknown (const ir_node *node);
971 /** returns true if node is a Proj node or a Filter node in
972 * intraprocedural view */
973 int is_Proj (const ir_node *node);
974 /** Returns true if the operation manipulates control flow:
975 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
976 int is_cfop(const ir_node *node);
978 /** Returns true if the operation manipulates interprocedural control flow:
979 CallBegin, EndReg, EndExcept */
980 int is_ip_cfop(const ir_node *node);
981 /** Returns true if the operation can change the control flow because
982 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
983 Bad. Raise is not fragile, but a unconditional jump. */
984 int is_fragile_op(const ir_node *node);
985 /** Returns the memory operand of fragile operations. */
986 ir_node *get_fragile_op_mem(ir_node *node);
988 /** Returns true if the operation is a forking control flow
989 * operation: Cond. */
990 int is_irn_forking(const ir_node *node);
992 /** Return the type associated with the value produced by n
993 * if the node remarks this type as it is the case for
994 * Cast, Const, SymConst and some Proj nodes. */
995 type *get_irn_type(ir_node *n);
997 /** Returns non-zero for constant-like nodes. */
998 int is_irn_constlike(const ir_node *node);
1001 * A type for expression conditional jump predications.
1004 COND_JMP_PRED_NONE, /**< No jump predication. Default. */
1005 COND_JMP_PRED_TRUE, /**< The True case is predicted. */
1006 COND_JMP_PRED_FALSE /**< The False case is predicted. */
1007 } cond_jmp_predicate;
1009 /** Returns the conditional jump predication of a Cond node. */
1010 cond_jmp_predicate get_Cond_jmp_pred(ir_node *cond);
1012 /** Sets a new conditional jump predication. */
1013 void set_Cond_jmp_pred(ir_node *cond, cond_jmp_predicate pred);
1016 * Access custom node data.
1017 * The data must have been registered with
1018 * register_additional_node_data() before.
1019 * @param node The ir node to get the data from.
1020 * @param type The type of the data you registered.
1021 * @param off The value returned by register_additional_node_data().
1022 * @return A pointer of type @p type.
1024 #define get_irn_data(node,type,off) \
1025 (assert(off > 0 && "Invalid node data offset"), (type *) ((char *) (node) - (off)))
1028 * Get the pointer to the node some custom data belongs to.
1029 * @param data The pointer to the custom data.
1030 * @param off The number as returned by register_additional_node_data().
1031 * @return A pointer to the ir node the custom data belongs to.
1033 #define get_irn_data_base(data,off) \
1034 (assert(off > 0 && "Invalid node data offset"), (ir_node *) ((char *) (data) + (off)))
1037 * Request additional data to be allocated with an ir node.
1038 * @param size The size of the additional data required.
1039 * @return A positive number, if the operation was successful, which
1040 * must be passed to the access macro get_irn_data(), 0 if the
1041 * registration failed.
1043 unsigned register_additional_node_data(unsigned size);
1046 * Return a pointer to the node attributes.
1047 * Needed for user-defined nodes.
1049 void *get_irn_generic_attr(ir_node *node);
1051 /*-----------------------------------------------------------------*/
1053 /*-----------------------------------------------------------------*/
1056 /** Debug print the node.
1058 * Writes the node, all its attributes and the predecessors to stdout if DEBUG_libfirm
1059 * is set. Else does nothing. */
1060 void dump_irn(ir_node *n);
1065 /* GNU C has the __FUNCTION__ extension */
1066 #define __MYFUNC__ __FUNCTION__
1068 /* use Filename instead */
1069 #define __MYFUNC__ __FILE__
1073 Don't format with "\", firmjni gets problems */
1074 /** Output location */
1075 #define DDM printf("%s(l.%i).\n", __MYFUNC__, __LINE__);
1076 /** Output the firm kind of the node */
1077 #define DDMK(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, print_firm_kind(X), (void *)(X));
1078 /** Output information about a node */
1080 /*#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))*/
1081 int dump_node_opcode(FILE *F, ir_node *n);
1082 #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)
1084 /** Output information about a node and its block */
1085 #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)))
1086 /** Output information about a type */
1087 #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))
1088 /** Output information about an entity */
1089 #define DDME(X) printf("%s(l.%i) %s: %ld (%p)\n", __MYFUNC__, __LINE__, get_entity_name(X), get_entity_nr(X), (void *)(X))
1090 /** Output information about an entity and its type */
1091 #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))
1092 /** Output information about an entity and its owner */
1093 #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))
1094 /** Output information about a graph */
1095 #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))))
1096 /** Output information about an ident */
1097 #define DDMI(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_id_str(X), (void *)(X))
1098 /** Output information about a mode */
1099 #define DDMM(X) printf("%s(l.%i) %s: %p\n", __MYFUNC__, __LINE__, get_mode_name(X), (void *)(X))
1100 /** Output information about a loop */
1101 #define DDML(X) printf("%s(l.%i) loop with depth %d: %d\n", __MYFUNC__, __LINE__, get_loop_depth(X), get_loop_loop_nr(X))
1102 /** Output information about a tarVal */
1103 #define DDMV(X) printf("%s(l.%i) tarval: ",__MYFUNC__, __LINE__); tarval_printf(X); printf(" (%p)\n", (void *)(X));
1105 /*@}*/ /* end of ir_node group definition */
1112 # endif /* _IRNODE_H_ */