2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of an intermediate operation.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
26 #ifndef FIRM_IR_IRNODE_H
27 #define FIRM_IR_IRNODE_H
31 #include "firm_common.h"
39 * @author Martin Trapp, Christian Schaefer
41 * Declarations of an ir node.
45 * @defgroup ir_node Declarations of an ir node.
47 * The type definition of ir_node is also in irgraph.h to resolve
48 * recursion between irnode.h and irgraph.h
50 * ir_node - a datatype representing a Firm node
52 * The common fields are:
54 * - firm_kind - A firm_kind tag containing k_type. This is useful
55 * for dynamically checking whether a node is a ir_node.
56 * - arity - The number of predecessors in the Firm graph.
57 * - in - A list with the predecessors in the Firm graph. There are
58 * routines to access individual elements and to obtain the
59 * array. The method returning the array should not be used.
60 * - mode - The mode of the node. There are routines to get the mode
61 * but also to access the mode's fields directly.
62 * - opcode - The opcode of the node. There are routines to get the opcode
63 * but also to access the opcode's fields directly.
64 * - node_nr - A unique number for the node. Available only if debugging
70 * Some projection numbers must be always equal to support automatic phi construction
73 pn_Generic_M_regular = 0, /**< The memory result. */
74 pn_Generic_X_regular = 1, /**< Execution result if no exception occurred. */
75 pn_Generic_X_except = 2, /**< The control flow result branching to the exception handler */
76 pn_Generic_other = 3 /**< First free projection number */
80 * Checks whether a pointer points to a ir node.
82 * @param thing an arbitrary pointer
83 * @return non-zero if the thing is a ir mode, else zero
85 int is_ir_node (const void *thing);
88 * Returns the number of predecessors without the block predecessor.
90 * @param node the IR-node
92 int get_irn_arity (const ir_node *node);
93 int get_irn_intra_arity(const ir_node *node);
94 int get_irn_inter_arity(const ir_node *node);
96 /** Replaces the old in array by a new one that will contain the ins given in
97 the parameters. Conserves the block predecessor. It copies the array passed.
98 This function is necessary to adjust in arrays of blocks, calls and phis.
99 Assumes that current_ir_graph is set to the graph containing "node".
100 "in" must contain all predecessors except the block that are required for
102 void set_irn_in(ir_node *node, int arity, ir_node *in[]);
104 /* to iterate through the predecessors without touching the array. No
105 order of predecessors guaranteed.
106 To iterate over the operands iterate from 0 to i < get_irn_arity(),
107 to iterate including the Block predecessor iterate from i = -1 to
108 i < get_irn_arity. */
109 /* Access predecessor n */
112 * Get the n-th predecessor of a node.
113 * This function removes Id predecessors.
114 * This function automatically handles intra- and interprocedural views.
116 ir_node *get_irn_n(const ir_node *node, int n);
119 * Add a artificial dependency to the node.
120 * The dependency is only inserted if it is not there already.
121 * This is only allowed in phase_backend!
123 * @param node The node.
124 * @param dep The dependency target.
126 * @return The index in the array (get_irn_dep() with that index returns @p dep).
128 int add_irn_dep(ir_node *node, ir_node *dep);
131 * Copy all dependencies from a node to another.
132 * This is only allowed in phase_backend!
134 * @param tgt The node which should be enriched.
135 * @param src The node whose dependencies shall be copied.
137 void add_irn_deps(ir_node *tgt, ir_node *src);
140 * Get the length of the dependency array.
141 * @param node The node.
142 * @return The length of the dependency array or 0 if it has not yet been allocated.
144 int get_irn_deps(const ir_node *node);
147 * Get an entry of the dependency array.
148 * @param node The node.
149 * @param pos The position.
150 * @return The node at that position.
152 ir_node *get_irn_dep(const ir_node *node, int pos);
155 * Set an entry of the dependency array.
156 * @param node The node.
157 * @param pos The position.
158 * @param dep The dependency target.
160 void set_irn_dep(ir_node *node, int pos, ir_node *dep);
164 * Get the n-th predecessor of a node in intraprocedural view.
165 * Can be used always if it's know that node is not a split one.
167 ir_node *get_irn_intra_n(const ir_node *node, int n);
170 * Get the n-th predecessor of a node in interprocedural view.
172 ir_node *get_irn_inter_n(const ir_node *node, int n);
174 /** Replace the n-th predecessor of a node with a new one. */
175 void set_irn_n(ir_node *node, int n, ir_node *in);
177 * Appends a new predecessor to a node. This only works for nodes with
179 * @returns the number of the new input
181 int add_irn_n(ir_node *node, ir_node *in);
182 /* Remove predecessor i from Sync n */
183 void del_Sync_n(ir_node *n, int i);
184 /* Sets the mode struct of node. */
185 void set_irn_mode(ir_node *node, ir_mode *mode);
186 /** Gets the mode struct of a node. */
187 ir_mode *get_irn_mode(const ir_node *node);
188 /** Gets the mode-enum ir_modecode. */
189 ir_modecode get_irn_modecode(const ir_node *node);
190 /** Gets the ident for a string representation of the mode .*/
191 ident *get_irn_modeident(const ir_node *node);
192 /** Gets the string representation of the mode .*/
193 const char *get_irn_modename(const ir_node *node);
194 /** Gets the opcode struct of the node. */
195 ir_op *get_irn_op(const ir_node *node);
196 /** Sets the opcode struct of the node. */
197 void set_irn_op(ir_node *node, ir_op *op);
198 /** Gets the opcode-enum of the node. */
199 unsigned get_irn_opcode(const ir_node *node);
200 /** Get the string representation of the opcode. */
201 const char *get_irn_opname(const ir_node *node);
202 /** Get the ident for a string representation of the opcode. */
203 ident *get_irn_opident(const ir_node *node);
204 /** If arg is an argument of the node, returns it's position, -1 otherwise */
205 int get_irn_pred_pos(ir_node *node, ir_node *arg);
206 /** Gets the visited counter of a node. */
207 ir_visited_t get_irn_visited(const ir_node *node);
208 /** Sets the visited counter of a node. */
209 void set_irn_visited(ir_node *node, ir_visited_t visited);
210 /** Sets visited to get_irg_visited(current_ir_graph). */
211 void mark_irn_visited(ir_node *node);
212 /** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
213 int irn_visited(const ir_node *node);
214 /** Returns 1 if visited >= get_irg_visited(current_ir_graph). Marks the node
215 * visited, if it was not. */
216 int irn_visited_else_mark(ir_node *node);
219 * Sets the link of a node.
220 * Only allowed if the graph is NOT in phase_building.
222 void set_irn_link(ir_node *node, void *link);
224 /** Returns the link of a node. */
225 void *get_irn_link(const ir_node *node);
227 /** Returns the ir_graph this node belongs to. */
228 ir_graph *get_irn_irg(const ir_node *node);
230 /** Outputs a unique number for this node if libFIRM is compiled for
231 debugging, (configure with --enable-debug) else returns address
232 of node cast to long. */
233 long get_irn_node_nr(const ir_node *node);
235 /** Returns the pinned state of a node.
237 * Returns whether the node _always_ must be pinned.
238 * I.e., the node is not floating after global cse.
240 * @returns Either state op_pin_state_pinned or op_pin_state_floats.
242 op_pin_state get_irn_pinned(const ir_node *node);
244 /** Set pin state for nodes with op pin state op_pin_state_exc_pinned */
245 void set_irn_pinned(ir_node *node, op_pin_state state);
247 /** Returns whether the node is currently pinned.
249 * If get_irn_pinned returns op_pin_state_floats and the graph the
250 * node belongs to is in state op_poin_state_floats then this function
251 * returns 'floats', else 'pinned'.
253 op_pin_state is_irn_pinned_in_irg(const ir_node *node);
256 * IR node constructor.
257 * Create a new IR node in irg, with an op, mode, arity and
258 * some incoming IR nodes.
259 * This constructor is used in every specific IR node constructor.
261 * @param db Debug info.
262 * @param irg IR-graph on with this new node should be constructed.
263 * @param block The block the new node belongs to
264 * @param op The opcode of the new node.
265 * @param mode The mode of the new node.
266 * @param arity The arity of the new node, <0 if can be changed dynamically.
267 * @param in An array of arity predecessor nodes.
270 new_ir_node(dbg_info *db,
279 * Return the block the node belongs to. This is only
280 * possible for pinned nodes or if the graph is in pinned state.
281 * Otherwise the block may be incorrect. This condition is
282 * now checked by an assertion.
284 * This works for all except Block. It can return Blocks or the Bad node.
286 * To express the difference to access routines that work for all
287 * nodes we use infix "nodes" and do not name this function
288 * get_irn_block(). */
289 ir_node *get_nodes_block (const ir_node *node);
291 /** Sets the Block of a node. */
292 void set_nodes_block (ir_node *node, ir_node *block);
295 * Return the MacroBlock the node belongs to. This is only
296 * possible for pinned nodes or if the graph is in pinned state.
297 * Otherwise the MacroBlock may be incorrect. This condition is
298 * now checked by an assertion.
300 * This works for all except Block. It can return Blocks or the Bad node.
302 * To express the difference to access routines that work for all
303 * nodes we use infix "nodes" and do not name this function
304 * get_irn_MacroBlock(). */
305 ir_node *get_nodes_MacroBlock(const ir_node *node);
308 * @function get_irn_block()
309 * @see get_nodes_block()
313 * Projection numbers for result of Start node: use for Proj nodes!
316 pn_Start_X_initial_exec, /**< Projection on the initial control flow. */
317 pn_Start_M, /**< Projection on the initial memory. */
318 pn_Start_P_frame_base, /**< Projection on the frame base pointer. */
319 pn_Start_P_tls, /**< Projection on the pointer to the thread local store
320 segment containing _all_thread local variables. */
321 pn_Start_T_args, /**< Projection on all arguments. */
322 pn_Start_max /**< number of projections from a Start */
323 } pn_Start; /* Projection numbers for Start. */
325 /** Test whether arbitrary node is frame pointer.
327 * Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
328 * from Start. If so returns frame type, else Null. */
329 ir_type *is_frame_pointer(const ir_node *n);
331 /** Test whether arbitrary node is the thread local storage (tls) pointer.
333 * Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
334 * from Start. If so returns tls type, else Null. */
335 ir_type *is_tls_pointer(const ir_node *n);
337 /** Return the number of control flow predecessors of a block. */
338 int get_Block_n_cfgpreds(const ir_node *block);
339 /** Return the control flow predecessor of a block at a given position. */
340 ir_node *get_Block_cfgpred(const ir_node *block, int pos);
341 /** Set the control flow predecessor of a block at a given position. */
342 void set_Block_cfgpred(ir_node *block, int pos, ir_node *pred);
345 * Return the position of the predecessor block pred in the inputs
346 * of the block block.
348 * @param block the block
349 * @param pred a predecessor block of block
351 * @return the position of pred in block or -1
353 * @note When using the old extended basic block form for blocks
354 * with exception exists, a predecessor block might have more
355 * than one position. In that case it is not specified, with is returned.
357 int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred);
359 /** Get the predecessor block.
361 * Returns the block corresponding to the predecessor pos of block.
363 * There are several ambiguities we resolve with this function:
364 * - The direct predecessor can be a Proj, which is not pinned.
365 * We walk from the predecessor to the next pinned node
366 * (skip_Proj) and return the block that node is in.
367 * - If we encounter the Bad node, this function does not return
368 * Start block, but the Bad node.
370 ir_node *get_Block_cfgpred_block(const ir_node *node, int pos);
372 /** Return the matured flag of a block */
373 int get_Block_matured(const ir_node *block);
374 /** set the matured flag of a block. */
375 void set_Block_matured(ir_node *block, int matured);
377 /** A visited flag only for block nodes.
378 * @see also: get_irn_visited() inc_irg_visited() inc_irg_block_visited()*/
379 ir_visited_t get_Block_block_visited(const ir_node *block);
380 void set_Block_block_visited(ir_node *block, ir_visited_t visit);
383 * Marks a block as dead but do not replace it with a Bad node.
384 * Dead blocks are removed in the con
386 ir_node *set_Block_dead(ir_node *block);
387 int is_Block_dead(const ir_node *block);
389 /* For this current_ir_graph must be set. */
390 void mark_Block_block_visited(ir_node *node);
391 int Block_block_visited(const ir_node *node);
393 #ifdef INTERPROCEDURAL_VIEW
394 /* Set and remove interprocedural predecessors. If the interprocedural
395 * predecessors are removed, the node has the same predecessors in
397 * @@@ Maybe better: arity is zero if no cg preds. */
398 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]);
399 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred);
400 /* @@@ not supported */
401 ir_node **get_Block_cg_cfgpred_arr(ir_node *node);
402 /** Returns the number of interprocedural predecessors. 0 if none. */
403 int get_Block_cg_n_cfgpreds(const ir_node *node);
404 /** Return the interprocedural predecessor at position pos. */
405 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos);
406 /** Frees the memory allocated for interprocedural predecessors. */
407 void remove_Block_cg_cfgpred_arr(ir_node *node);
410 /** Returns the extended basic block a block belongs to. */
411 ir_extblk *get_Block_extbb(const ir_node *block);
412 /** Sets the extended basic block a block belongs to. */
413 void set_Block_extbb(ir_node *block, ir_extblk *extblk);
414 /** Get the Macro Block header of a (sub-) block. */
415 ir_node *get_Block_MacroBlock(const ir_node *block);
416 /** Set the Macro Block header of a (sub-) block. */
417 void set_Block_MacroBlock(ir_node *block, ir_node *mbh);
418 /** Get the Macro Block header of a node. */
419 ir_node *get_irn_MacroBlock(const ir_node *n);
420 /** Returns the ir_graph this Block belongs to. */
421 ir_graph *get_Block_irg(const ir_node *block);
422 /** Returns non-zero if the block has an assigned label. */
423 int has_Block_label(const ir_node *block);
424 /** Returns the label of a Block. */
425 ir_label_t get_Block_label(const ir_node *block);
426 /** Sets a label to a block. */
427 void set_Block_label(ir_node *block, ir_label_t label);
428 /** Gets the head of the Phi list for this block. */
429 ir_node *get_Block_phis(const ir_node *block);
430 /** Sets the head of the Phi list for this block. */
431 void set_Block_phis(ir_node *block, ir_node *phi);
432 /** Add a Phi node to the list of Block Phi's. */
433 void add_Block_phi(ir_node *block, ir_node *phi);
434 /** Get the Block mark (single bit). */
435 unsigned get_Block_mark(const ir_node *block);
436 /** Set the Block mark (single bit). */
437 void set_Block_mark(ir_node *block, unsigned mark);
439 /** Return the number of Keep alive node. */
440 int get_End_n_keepalives(const ir_node *end);
441 /** Return the Keep alive node a position pos. */
442 ir_node *get_End_keepalive(const ir_node *end, int pos);
443 /** Keep alive dedicated nodes. These must be either PhiM or Block nodes. */
444 void add_End_keepalive(ir_node *end, ir_node *ka);
445 /** Set the Keep alive node at position pos. */
446 void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
449 * Set new keep-alives.
450 * Beware: This might be an expensive operation if dynamic edges are enabled,
451 * so avoid it in the backend.
453 void set_End_keepalives(ir_node *end, int n, ir_node *in[]);
455 /** Remove irn from the keep-alive set. */
456 void remove_End_keepalive(ir_node *end, ir_node *irn);
458 /* Remove Bads, NoMem and doublets from the keep-alive set. */
459 void remove_End_Bads_and_doublets(ir_node *end);
461 /** Some parts of the End node are allocated separately -- their memory
462 is not recovered by dead_node_elimination if a End node is dead.
463 free_End() frees these data structures. */
464 void free_End(ir_node *end);
466 /** Return the target address of an IJmp */
467 ir_node *get_IJmp_target(const ir_node *ijmp);
468 /** Sets the target address of an IJmp */
469 void set_IJmp_target(ir_node *ijmp, ir_node *tgt);
471 /* We distinguish three kinds of Cond nodes. These can be distinguished
472 by the mode of the selector operand and an internal flag of type cond_kind.
473 First we distinguish binary Conds and switch Conds.
474 A binary Cond has as selector a boolean value. Proj(0) projects the control
475 flow for case "False", Proj(1) the control flow for "True". A binary Cond
476 is recognized by the boolean selector.
477 The switch Cond has as selector an unsigned integer. It produces as result
478 an n+1 Tuple (cf0, ... , cfn) of control flows.
479 We differ two flavors of this Cond. The first, the dense Cond, passes
480 control along output i if the selector value is i, 0 <= i <= n. If the
481 selector value is >n it passes control along output n.
482 The second Cond flavor differences in the treatment of cases not specified in
483 the source program. It magically knows about the existence of Proj nodes.
484 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
485 exists. Else it passes control along output n (even if this Proj does not
486 exist.) This Cond we call "fragmentary". There is a special constructor
487 new_defaultProj that automatically sets the flavor.
488 The two switch flavors are distinguished by a flag of type cond_kind.
489 Default flavor is "dense"
492 dense, /**< Default. Missing Proj nodes are dead control flow. */
493 fragmentary /**< Special. No control flow optimizations allowed. Missing
494 Proj nodes mean default control flow, i.e., Proj(n). */
497 /** Gets the string representation of the Cond node kind. */
498 const char *get_cond_kind_name(cond_kind kind);
500 ir_node *get_Cond_selector(const ir_node *node);
501 void set_Cond_selector(ir_node *node, ir_node *selector);
502 cond_kind get_Cond_kind(const ir_node *node);
503 void set_Cond_kind(ir_node *node, cond_kind kind);
504 long get_Cond_default_proj(const ir_node *node);
505 void set_Cond_default_proj(ir_node *node, long defproj);
508 * Projection numbers for conditions.
511 pn_Cond_false, /**< Control flow if operand is "false". */
512 pn_Cond_true, /**< Control flow if operand is "true". */
513 pn_Cond_max /**< number of projections from a Cond */
514 } pn_Cond; /* Projection numbers for Cond. */
516 ir_node *get_Return_mem(const ir_node *node);
517 void set_Return_mem(ir_node *node, ir_node *mem);
518 ir_node **get_Return_res_arr(ir_node *node);
519 int get_Return_n_ress(const ir_node *node);
520 ir_node *get_Return_res(const ir_node *node, int pos);
521 void set_Return_res(ir_node *node, int pos, ir_node *res);
523 tarval *get_Const_tarval(const ir_node *node);
524 void set_Const_tarval(ir_node *node, tarval *con);
526 /** Return non-zero if the given Const node represents the 0 constant. */
527 int is_Const_null(const ir_node *node);
529 /** Return non-zero if the given Const node represents the 1 constant. */
530 int is_Const_one(const ir_node *node);
532 /** Return non-zero if the given Const node represents the constant with all bits set. */
533 int is_Const_all_one(const ir_node *node);
535 /** Returns the source language type of a Const node.
536 * Must be an atomic type. Mode of type must be mode of node.
538 ir_type *get_Const_type(ir_node *node);
540 /** Sets the source language type of a Const node. */
541 void set_Const_type(ir_node *node, ir_type *tp);
543 /** Returns non-zero if s symconst kind has a type attribute */
544 #define SYMCONST_HAS_TYPE(kind) ((kind) <= symconst_type_align)
546 /** Returns non-zero if s symconst kind has an ident attribute */
547 #define SYMCONST_HAS_ID(kind) ((kind) == symconst_addr_name)
549 /** Returns non-zero if s symconst kind has an entity attribute */
550 #define SYMCONST_HAS_ENT(kind) ((kind) == symconst_addr_ent || (kind) == symconst_ofs_ent)
552 /** Returns non-zero if s symconst kind has an enum_const attribute */
553 #define SYMCONST_HAS_ENUM(kind) ((kind) == symconst_enum_const)
555 /** Returns non-zero if s symconst kind has a label attribute */
556 #define SYMCONST_HAS_LABEL(kind) ((kind) == symconst_label)
558 /** Get the kind of the SymConst. */
559 symconst_kind get_SymConst_kind(const ir_node *node);
560 /** Set the kind of the SymConst. */
561 void set_SymConst_kind(ir_node *node, symconst_kind num);
563 /** Only to access SymConst of kind type_tag or size. Else assertion: */
564 ir_type *get_SymConst_type(const ir_node *node);
565 void set_SymConst_type(ir_node *node, ir_type *tp);
567 /** Only to access SymConst of kind addr_name. Else assertion: */
568 ident *get_SymConst_name(const ir_node *node);
569 void set_SymConst_name(ir_node *node, ident *name);
571 /** Only to access SymConst of kind addr_ent. Else assertion: */
572 ir_entity *get_SymConst_entity(const ir_node *node);
573 void set_SymConst_entity(ir_node *node, ir_entity *ent);
575 /** Only to access SymConst of kind symconst_enum_const. Else assertion: */
576 ir_enum_const *get_SymConst_enum(const ir_node *node);
577 void set_SymConst_enum(ir_node *node, ir_enum_const *ec);
579 /** Sets both: type and ptrinfo. Needed to treat the node independent of
580 its semantics. Does a memcpy for the memory sym points to. */
581 /* write 'union': firmjni then does not create a method... */
582 union symconst_symbol get_SymConst_symbol(const ir_node *node);
583 void set_SymConst_symbol(ir_node *node,
584 union symconst_symbol sym);
586 /** Only to access SymConst of kind symconst_label. Else assertion: */
587 ir_label_t get_SymConst_label(const ir_node *node);
588 void set_SymConst_label(ir_node *node, ir_label_t label);
591 /** Access the type of the value represented by the SymConst.
593 * Example: primitive type int for SymConst size. */
594 ir_type *get_SymConst_value_type(ir_node *node);
595 void set_SymConst_value_type(ir_node *node, ir_type *tp);
597 ir_node *get_Sel_mem(const ir_node *node);
598 void set_Sel_mem(ir_node *node, ir_node *mem);
599 ir_node *get_Sel_ptr(const ir_node *node); /* ptr to the object to select from */
600 void set_Sel_ptr(ir_node *node, ir_node *ptr);
601 ir_node **get_Sel_index_arr(ir_node *node);
602 int get_Sel_n_indexs(const ir_node *node);
603 ir_node *get_Sel_index(const ir_node *node, int pos);
604 void set_Sel_index(ir_node *node, int pos, ir_node *index);
605 ir_entity *get_Sel_entity(const ir_node *node); /* entity to select */
606 void set_Sel_entity (ir_node *node, ir_entity *ent);
609 * Projection numbers for result of Call node: use for Proj nodes!
612 pn_Call_M_regular = pn_Generic_M_regular, /**< The memory result. */
613 pn_Call_X_regular = pn_Generic_X_regular, /**< The control flow result when no exception occurs. */
614 pn_Call_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler. */
615 pn_Call_T_result = pn_Generic_other, /**< The tuple containing all (0, 1, 2, ...) results. */
616 pn_Call_M_except, /**< The memory result in case the called method terminated with
618 pn_Call_P_value_res_base, /**< A pointer to the memory region containing copied results
619 passed by value (for compound result types). */
620 pn_Call_max /**< number of projections from a Call */
621 } pn_Call; /* Projection numbers for Call. */
622 #define pn_Call_M pn_Call_M_regular
624 /** Retrieve the memory input of a Call. */
625 ir_node *get_Call_mem(const ir_node *node);
626 /** Set the memory input of a Call. */
627 void set_Call_mem(ir_node *node, ir_node *mem);
628 /** Retrieve the call address of a Call. */
629 ir_node *get_Call_ptr(const ir_node *node);
630 /** Set the call address of a Call. */
631 void set_Call_ptr(ir_node *node, ir_node *ptr);
632 ir_node **get_Call_param_arr(ir_node *node);
633 /** Gets the number of parameters of a call. */
634 int get_Call_n_params(const ir_node *node);
635 /** Gets the call parameter at position pos. */
636 ir_node *get_Call_param(const ir_node *node, int pos);
637 /** Sets the call parameter at position pos. */
638 void set_Call_param(ir_node *node, int pos, ir_node *param);
639 /** Gets the type of a call. */
640 ir_type *get_Call_type(ir_node *node);
641 /** Sets the type of a call. */
642 void set_Call_type(ir_node *node, ir_type *tp);
645 * Returns non-zero if a Call is surely a self-recursive Call.
646 * Beware: if this functions returns 0, the call might be self-recursive!
648 int is_self_recursive_Call(const ir_node *call);
650 /** Set, get and remove the callee information for a Call node.
652 * The callee information lists all method entities that can be called
653 * from this node. If the address expression can not be analyzed fully,
654 * e.g., as entities can be called that are not in the compilation unit,
655 * the array contains the unknown_entity. The array contains only entities
656 * with peculiarity_existent, but with all kinds of visibility. The entities
657 * not necessarily contain an irg.
659 * The array is only accessible if callee information is valid. See flag
662 * The memory allocated for the array is managed automatically, i.e., it must
663 * not be freed if the Call node is removed from the graph.
665 * @param node A Call node.
667 int Call_has_callees(const ir_node *node);
668 int get_Call_n_callees(const ir_node *node);
669 ir_entity *get_Call_callee(const ir_node *node, int pos);
671 /** Set the full callee array.
673 * The passed array is copied. Assumes current_ir_graph set properly! */
674 void set_Call_callee_arr(ir_node *node, const int n, ir_entity **arr);
675 void remove_Call_callee_arr(ir_node *node);
678 * Projection numbers for result of Builtin node: use for Proj nodes!
681 pn_Builtin_M = pn_Generic_M_regular, /**< The memory result. */
682 pn_Builtin_1_result = pn_Generic_other, /**< first result. */
683 pn_Builtin_max /**< number of projections from a Builtin */
684 } pn_Builtin; /* Projection numbers for Builtin. */
686 ir_node *get_Builtin_mem(const ir_node *node);
687 void set_Builtin_mem(ir_node *node, ir_node *mem);
688 ir_builtin_kind get_Builtin_kind(const ir_node *node);
689 void set_Builtin_kind(ir_node *node, ir_builtin_kind kind);
690 ir_node **get_Builtin_param_arr(ir_node *node);
691 /** Gets the number of parameters of a Builtin. */
692 int get_Builtin_n_params(const ir_node *node);
693 /** Gets the Builtin parameter at position pos. */
694 ir_node *get_Builtin_param(const ir_node *node, int pos);
695 /** Sets the Builtin parameter at position pos. */
696 void set_Builtin_param(ir_node *node, int pos, ir_node *param);
697 /** Gets the type of a builtin. */
698 ir_type *get_Builtin_type(ir_node *node);
699 /** Sets the type of a Builtin. */
700 void set_Builtin_type(ir_node *node, ir_type *tp);
701 /** Returns a human readable string for the ir_builtin_kind. */
702 const char *get_builtin_kind_name(ir_builtin_kind kind);
704 /** Retrieve the call address of a CallBegin. */
705 ir_node *get_CallBegin_ptr(const ir_node *node);
706 /** Set the call address of a CallBegin. */
707 void set_CallBegin_ptr(ir_node *node, ir_node *ptr);
708 /** Retrieve the original Call node of a CallBegin. */
709 ir_node *get_CallBegin_call(const ir_node *node);
710 /** Set the original Call node of a CallBegin. */
711 void set_CallBegin_call(ir_node *node, ir_node *call);
713 /* For unary and binary arithmetic operations the access to the
714 operands can be factored out. Left is the first, right the
715 second arithmetic value as listed in tech report 1999-44.
716 unops are: Minus, Abs, Not, Conv, Cast
717 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
718 Shr, Shrs, Rotl, Cmp */
719 int is_unop(const ir_node *node);
720 ir_node *get_unop_op(const ir_node *node);
721 void set_unop_op(ir_node *node, ir_node *op);
722 int is_binop(const ir_node *node);
723 ir_node *get_binop_left(const ir_node *node);
724 void set_binop_left(ir_node *node, ir_node *left);
725 ir_node *get_binop_right(const ir_node *node);
726 void set_binop_right(ir_node *node, ir_node *right);
728 ir_node *get_Add_left(const ir_node *node);
729 void set_Add_left(ir_node *node, ir_node *left);
730 ir_node *get_Add_right(const ir_node *node);
731 void set_Add_right(ir_node *node, ir_node *right);
733 ir_node *get_Carry_left(const ir_node *node);
734 void set_Carry_left(ir_node *node, ir_node *left);
735 ir_node *get_Carry_right(const ir_node *node);
736 void set_Carry_right(ir_node *node, ir_node *right);
738 ir_node *get_Borrow_left(const ir_node *node);
739 void set_Borrow_left(ir_node *node, ir_node *left);
740 ir_node *get_Borrow_right(const ir_node *node);
741 void set_Borrow_right(ir_node *node, ir_node *right);
743 ir_node *get_Sub_left(const ir_node *node);
744 void set_Sub_left(ir_node *node, ir_node *left);
745 ir_node *get_Sub_right(const ir_node *node);
746 void set_Sub_right(ir_node *node, ir_node *right);
748 ir_node *get_Minus_op(const ir_node *node);
749 void set_Minus_op(ir_node *node, ir_node *op);
751 ir_node *get_Mul_left(const ir_node *node);
752 void set_Mul_left(ir_node *node, ir_node *left);
753 ir_node *get_Mul_right(const ir_node *node);
754 void set_Mul_right(ir_node *node, ir_node *right);
756 ir_node *get_Mulh_left(const ir_node *node);
757 void set_Mulh_left(ir_node *node, ir_node *left);
758 ir_node *get_Mulh_right(const ir_node *node);
759 void set_Mulh_right(ir_node *node, ir_node *right);
761 ir_node *get_Quot_left(const ir_node *node);
762 void set_Quot_left(ir_node *node, ir_node *left);
763 ir_node *get_Quot_right(const ir_node *node);
764 void set_Quot_right(ir_node *node, ir_node *right);
765 ir_node *get_Quot_mem(const ir_node *node);
766 void set_Quot_mem(ir_node *node, ir_node *mem);
767 ir_mode *get_Quot_resmode(const ir_node *node);
768 void set_Quot_resmode(ir_node *node, ir_mode *mode);
771 * Projection numbers for Quot: use for Proj nodes!
774 pn_Quot_M = pn_Generic_M_regular, /**< Memory result. */
775 pn_Quot_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
776 pn_Quot_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
777 pn_Quot_res = pn_Generic_other, /**< Result of computation. */
778 pn_Quot_max /**< number of projections from a Quot */
779 } pn_Quot; /* Projection numbers for Quot. */
781 ir_node *get_DivMod_left(const ir_node *node);
782 void set_DivMod_left(ir_node *node, ir_node *left);
783 ir_node *get_DivMod_right(const ir_node *node);
784 void set_DivMod_right(ir_node *node, ir_node *right);
785 ir_node *get_DivMod_mem(const ir_node *node);
786 void set_DivMod_mem(ir_node *node, ir_node *mem);
787 ir_mode *get_DivMod_resmode(const ir_node *node);
788 void set_DivMod_resmode(ir_node *node, ir_mode *mode);
791 * Projection numbers for DivMod: use for Proj nodes!
794 pn_DivMod_M = pn_Generic_M_regular, /**< Memory result. */
795 pn_DivMod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
796 pn_DivMod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
797 pn_DivMod_res_div = pn_Generic_other, /**< Result of computation a / b. */
798 pn_DivMod_res_mod, /**< Result of computation a % b. */
799 pn_DivMod_max /**< number of projections from a DivMod */
800 } pn_DivMod; /* Projection numbers for DivMod. */
802 ir_node *get_Div_left(const ir_node *node);
803 void set_Div_left(ir_node *node, ir_node *left);
804 ir_node *get_Div_right(const ir_node *node);
805 void set_Div_right(ir_node *node, ir_node *right);
806 ir_node *get_Div_mem(const ir_node *node);
807 void set_Div_mem(ir_node *node, ir_node *mem);
808 ir_mode *get_Div_resmode(const ir_node *node);
809 void set_Div_resmode(ir_node *node, ir_mode *mode);
810 int get_Div_no_remainder(const ir_node *node);
811 void set_Div_no_remainder(ir_node *node, int no_remainder);
814 * Projection numbers for Div: use for Proj nodes!
817 pn_Div_M = pn_Generic_M_regular, /**< Memory result. */
818 pn_Div_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
819 pn_Div_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
820 pn_Div_res = pn_Generic_other, /**< Result of computation. */
821 pn_Div_max /**< number of projections from a Div */
822 } pn_Div; /* Projection numbers for Div. */
824 ir_node *get_Mod_left(const ir_node *node);
825 void set_Mod_left(ir_node *node, ir_node *left);
826 ir_node *get_Mod_right(const ir_node *node);
827 void set_Mod_right(ir_node *node, ir_node *right);
828 ir_node *get_Mod_mem(const ir_node *node);
829 void set_Mod_mem(ir_node *node, ir_node *mem);
830 ir_mode *get_Mod_resmode(const ir_node *node);
831 void set_Mod_resmode(ir_node *node, ir_mode *mode);
834 * Projection numbers for Mod: use for Proj nodes!
837 pn_Mod_M = pn_Generic_M_regular, /**< Memory result. */
838 pn_Mod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
839 pn_Mod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
840 pn_Mod_res = pn_Generic_other, /**< Result of computation. */
841 pn_Mod_max /**< number of projections from a Mod */
842 } pn_Mod; /* Projection numbers for Mod. */
844 ir_node *get_Abs_op(const ir_node *node);
845 void set_Abs_op(ir_node *node, ir_node *op);
847 ir_node *get_And_left(const ir_node *node);
848 void set_And_left(ir_node *node, ir_node *left);
849 ir_node *get_And_right(const ir_node *node);
850 void set_And_right(ir_node *node, ir_node *right);
852 ir_node *get_Or_left(const ir_node *node);
853 void set_Or_left(ir_node *node, ir_node *left);
854 ir_node *get_Or_right(const ir_node *node);
855 void set_Or_right(ir_node *node, ir_node *right);
857 ir_node *get_Eor_left(const ir_node *node);
858 void set_Eor_left(ir_node *node, ir_node *left);
859 ir_node *get_Eor_right(const ir_node *node);
860 void set_Eor_right(ir_node *node, ir_node *right);
862 ir_node *get_Not_op(const ir_node *node);
863 void set_Not_op(ir_node *node, ir_node *op);
865 /** returns the pnc name from an pnc constant */
866 const char *get_pnc_string(int pnc);
868 /** Calculates the negated (Complement(R)) pnc condition. */
869 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode);
871 /** Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
872 pn_Cmp get_inversed_pnc(long pnc);
874 /** An alternative name for get_inversed_pnc() that can be better memorized. */
875 #define get_mirrored_pnc(pnc) get_inversed_pnc(pnc)
877 ir_node *get_Cmp_left(const ir_node *node);
878 void set_Cmp_left(ir_node *node, ir_node *left);
879 ir_node *get_Cmp_right(const ir_node *node);
880 void set_Cmp_right(ir_node *node, ir_node *right);
882 ir_node *get_Shl_left(const ir_node *node);
883 void set_Shl_left(ir_node *node, ir_node *left);
884 ir_node *get_Shl_right(const ir_node *node);
885 void set_Shl_right(ir_node *node, ir_node *right);
887 ir_node *get_Shr_left(const ir_node *node);
888 void set_Shr_left(ir_node *node, ir_node *left);
889 ir_node *get_Shr_right(const ir_node *node);
890 void set_Shr_right(ir_node *node, ir_node *right);
892 ir_node *get_Shrs_left(const ir_node *node);
893 void set_Shrs_left(ir_node *node, ir_node *left);
894 ir_node *get_Shrs_right(const ir_node *node);
895 void set_Shrs_right(ir_node *node, ir_node *right);
897 ir_node *get_Rotl_left(const ir_node *node);
898 void set_Rotl_left(ir_node *node, ir_node *left);
899 ir_node *get_Rotl_right(const ir_node *node);
900 void set_Rotl_right(ir_node *node, ir_node *right);
902 ir_node *get_Conv_op(const ir_node *node);
903 void set_Conv_op(ir_node *node, ir_node *op);
904 int get_Conv_strict(const ir_node *node);
905 void set_Conv_strict(ir_node *node, int flag);
907 /* Does Cast need a mem operator?
908 * Cast should only depend on the type, not on the state of an
909 * entity. But: we initialize various fields after Alloc, that
910 * are accessed in the cast. This required some precaution, to
911 * get the right memory into the Loads generated from the cast.
913 ir_node *get_Cast_op(const ir_node *node);
914 void set_Cast_op(ir_node *node, ir_node *op);
915 ir_type *get_Cast_type(ir_node *node);
916 void set_Cast_type(ir_node *node, ir_type *to_tp);
918 /** Checks for upcast.
920 * Returns true if the Cast node casts a class type to a super type.
921 * Works also for pointers to classes (recursively).
923 * Needs typeinfo calculated.
925 int is_Cast_upcast(ir_node *node);
927 /** Checks for downcast.
929 * Returns true if the Cast node casts a class type to a sub type.
930 * Works also for pointers to classes (recursively).
932 * Needs typeinfo calculated.
934 int is_Cast_downcast(ir_node *node);
937 /** Returns true if n is a Phi or a Filter node in INTER-procedural view.
938 Returns false if irg is in phase phase_building and the Phi has zero
939 predecessors: it's a Phi0. */
940 int is_Phi(const ir_node *n);
941 /** Returns true if irg in phase phase_building and the Phi has zero
942 predecessors. It's a Phi0 then. */
943 int is_Phi0(const ir_node *n);
944 /* These routines also work for Filter nodes in INTER-procedural view. */
945 ir_node **get_Phi_preds_arr(ir_node *node);
946 int get_Phi_n_preds(const ir_node *node);
947 ir_node *get_Phi_pred(const ir_node *node, int pos);
948 void set_Phi_pred(ir_node *node, int pos, ir_node *pred);
949 ir_node *get_Phi_next(const ir_node *phi);
950 void set_Phi_next(ir_node *phi, ir_node *next);
952 ir_node *get_Filter_pred(ir_node *node);
953 void set_Filter_pred(ir_node *node, ir_node *pred);
954 long get_Filter_proj(ir_node *node);
955 void set_Filter_proj(ir_node *node, long proj);
956 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
957 * @@@ Maybe better: arity is zero if no cg preds. */
958 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
959 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
960 int get_Filter_n_cg_preds(ir_node *node);
961 ir_node *get_Filter_cg_pred(ir_node *node, int pos);
963 /** Return true if parameter is a memory operation.
965 * A memory operation is an operation that changes the
966 * memory. I.e., a Load or a Store operation.
968 int is_memop(const ir_node *node);
969 ir_node *get_memop_mem(const ir_node *node);
970 void set_memop_mem(ir_node *node, ir_node *mem);
971 ir_node *get_memop_ptr(const ir_node *node);
972 void set_memop_ptr(ir_node *node, ir_node *ptr);
975 * Projection numbers for Load: use for Proj nodes!
978 pn_Load_M = pn_Generic_M_regular, /**< Memory result. */
979 pn_Load_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
980 pn_Load_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
981 pn_Load_res = pn_Generic_other, /**< Result of load operation. */
982 pn_Load_max /**< number of projections from a Load */
983 } pn_Load; /* Projection numbers for Load. */
985 ir_node *get_Load_mem(const ir_node *node);
986 void set_Load_mem(ir_node *node, ir_node *mem);
987 ir_node *get_Load_ptr(const ir_node *node);
988 void set_Load_ptr(ir_node *node, ir_node *ptr);
989 ir_mode *get_Load_mode(const ir_node *node);
990 void set_Load_mode(ir_node *node, ir_mode *mode);
991 ir_volatility get_Load_volatility(const ir_node *node);
992 void set_Load_volatility(ir_node *node, ir_volatility volatility);
993 ir_align get_Load_align(const ir_node *node);
994 void set_Load_align(ir_node *node, ir_align align);
997 * Projection numbers for Store: use for Proj nodes!
1000 pn_Store_M = pn_Generic_M_regular, /**< Memory result. */
1001 pn_Store_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1002 pn_Store_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
1003 pn_Store_max = pn_Generic_other /**< number of projections from a Store */
1004 } pn_Store; /* Projection numbers for Store. */
1006 ir_node *get_Store_mem(const ir_node *node);
1007 void set_Store_mem(ir_node *node, ir_node *mem);
1008 ir_node *get_Store_ptr(const ir_node *node);
1009 void set_Store_ptr(ir_node *node, ir_node *ptr);
1010 ir_node *get_Store_value(const ir_node *node);
1011 void set_Store_value(ir_node *node, ir_node *value);
1012 ir_volatility get_Store_volatility(const ir_node *node);
1013 void set_Store_volatility(ir_node *node, ir_volatility volatility);
1014 ir_align get_Store_align(const ir_node *node);
1015 void set_Store_align(ir_node *node, ir_align align);
1018 * Projection numbers for Alloc: use for Proj nodes!
1021 pn_Alloc_M = pn_Generic_M_regular, /**< Memory result. */
1022 pn_Alloc_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1023 pn_Alloc_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
1024 pn_Alloc_res = pn_Generic_other, /**< Result of allocation. */
1025 pn_Alloc_max /**< number of projections from an Alloc */
1026 } pn_Alloc; /* Projection numbers for Alloc. */
1028 ir_node *get_Alloc_mem(const ir_node *node);
1029 void set_Alloc_mem(ir_node *node, ir_node *mem);
1030 ir_node *get_Alloc_size(const ir_node *node);
1031 void set_Alloc_size(ir_node *node, ir_node *size);
1032 ir_type *get_Alloc_type(ir_node *node);
1033 void set_Alloc_type(ir_node *node, ir_type *tp);
1035 ir_where_alloc get_Alloc_where(const ir_node *node);
1036 void set_Alloc_where(ir_node *node, ir_where_alloc where);
1038 ir_node *get_Free_mem(const ir_node *node);
1039 void set_Free_mem(ir_node *node, ir_node *mem);
1040 ir_node *get_Free_ptr(const ir_node *node);
1041 void set_Free_ptr(ir_node *node, ir_node *ptr);
1042 ir_node *get_Free_size(const ir_node *node);
1043 void set_Free_size(ir_node *node, ir_node *size);
1044 ir_type *get_Free_type(ir_node *node);
1045 void set_Free_type(ir_node *node, ir_type *tp);
1047 ir_where_alloc get_Free_where(const ir_node *node);
1048 void set_Free_where(ir_node *node, ir_where_alloc where);
1050 ir_node **get_Sync_preds_arr(ir_node *node);
1051 int get_Sync_n_preds(const ir_node *node);
1052 ir_node *get_Sync_pred(const ir_node *node, int pos);
1053 void set_Sync_pred(ir_node *node, int pos, ir_node *pred);
1054 void add_Sync_pred(ir_node *node, ir_node *pred);
1056 /** Returns the source language type of a Proj node.
1057 * Must be an atomic type. Mode of type must be mode of node.
1059 ir_type *get_Proj_type(ir_node *node);
1061 /** Return the predecessor of a Proj node. */
1062 ir_node *get_Proj_pred(const ir_node *node);
1063 void set_Proj_pred(ir_node *node, ir_node *pred);
1064 /** Return the projection number of a Proj node. */
1065 long get_Proj_proj(const ir_node *node);
1066 void set_Proj_proj(ir_node *node, long proj);
1069 * Returns non-zero if a node is a routine parameter.
1071 * @param node the Proj node to test
1073 int is_arg_Proj(const ir_node *node);
1075 ir_node **get_Tuple_preds_arr(ir_node *node);
1076 int get_Tuple_n_preds(const ir_node *node);
1077 ir_node *get_Tuple_pred(const ir_node *node, int pos);
1078 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred);
1080 ir_node *get_Id_pred(const ir_node *node);
1081 void set_Id_pred(ir_node *node, ir_node *pred);
1083 /** Confirm has a single result and returns 'value' unchanged.
1084 * The node expresses a restriction on 'value':
1085 * 'value' 'cmp' 'bound' == true. */
1086 ir_node *get_Confirm_value(const ir_node *node);
1087 void set_Confirm_value(ir_node *node, ir_node *value);
1088 ir_node *get_Confirm_bound(const ir_node *node);
1089 void set_Confirm_bound(ir_node *node, ir_node *bound);
1090 pn_Cmp get_Confirm_cmp(const ir_node *node);
1091 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp);
1096 ir_node *get_Mux_sel(const ir_node *node);
1097 void set_Mux_sel(ir_node *node, ir_node *sel);
1098 ir_node *get_Mux_false(const ir_node *node);
1099 void set_Mux_false(ir_node *node, ir_node *ir_false);
1100 ir_node *get_Mux_true(const ir_node *node);
1101 void set_Mux_true(ir_node *node, ir_node *ir_true);
1104 * Projection numbers for result of CopyB node: use for Proj nodes!
1107 pn_CopyB_M_regular = pn_Generic_M_regular, /**< The memory result. */
1108 pn_CopyB_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1109 pn_CopyB_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1110 pn_CopyB_M_except = pn_Generic_other, /**< The memory result in case the runtime function terminated with
1112 pn_CopyB_max /**< number of projections from a CopyB */
1113 } pn_CopyB; /* Projection numbers for CopyB. */
1114 #define pn_CopyB_M pn_CopyB_M_regular
1116 ir_node *get_CopyB_mem(const ir_node *node);
1117 void set_CopyB_mem(ir_node *node, ir_node *mem);
1118 ir_node *get_CopyB_dst(const ir_node *node);
1119 void set_CopyB_dst(ir_node *node, ir_node *dst);
1120 ir_node *get_CopyB_src(const ir_node *node);
1121 void set_CopyB_src(ir_node *node, ir_node *src);
1122 ir_type *get_CopyB_type(ir_node *node);
1123 void set_CopyB_type(ir_node *node, ir_type *data_type);
1126 * Projection numbers for result of InstOf node: use for Proj nodes!
1129 pn_InstOf_M_regular = pn_Generic_M_regular, /**< The memory result. */
1130 pn_InstOf_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1131 pn_InstOf_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1132 pn_InstOf_res = pn_Generic_other, /**< The checked object pointer. */
1133 pn_InstOf_M_except, /**< The memory result in case the runtime function terminated with
1135 pn_InstOf_max /**< number of projections from an InstOf */
1137 #define pn_InstOf_M pn_InstOf_M_regular
1139 /** InstOf access. */
1140 ir_type *get_InstOf_type(ir_node *node);
1141 void set_InstOf_type(ir_node *node, ir_type *type);
1142 ir_node *get_InstOf_store(const ir_node *node);
1143 void set_InstOf_store(ir_node *node, ir_node *obj);
1144 ir_node *get_InstOf_obj(const ir_node *node);
1145 void set_InstOf_obj(ir_node *node, ir_node *obj);
1148 * Projection numbers for Raise.
1151 pn_Raise_M = pn_Generic_M_regular, /**< The Memory result. */
1152 pn_Raise_X = pn_Generic_X_regular, /**< The control flow to the exception handler. */
1153 pn_Raise_max /**< number of projections from a Raise */
1154 } pn_Raise; /* Projection numbers for Raise. */
1156 ir_node *get_Raise_mem(const ir_node *node);
1157 void set_Raise_mem(ir_node *node, ir_node *mem);
1158 ir_node *get_Raise_exo_ptr(const ir_node *node); /* PoinTeR to EXception Object */
1159 void set_Raise_exo_ptr(ir_node *node, ir_node *exoptr);
1162 * Projection numbers for result of Bound node: use for Proj nodes!
1165 pn_Bound_M = pn_Generic_M_regular, /**< The memory result. */
1166 pn_Bound_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1167 pn_Bound_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1168 pn_Bound_res = pn_Generic_other, /**< The checked index. */
1169 pn_Bound_max /**< number of projections from a Bound */
1172 /** Returns the memory input of a Bound operation. */
1173 ir_node *get_Bound_mem(const ir_node *bound);
1174 void set_Bound_mem(ir_node *bound, ir_node *mem);
1176 /** Returns the index input of a Bound operation. */
1177 ir_node *get_Bound_index(const ir_node *bound);
1178 void set_Bound_index(ir_node *bound, ir_node *idx);
1180 /** Returns the lower bound input of a Bound operation. */
1181 ir_node *get_Bound_lower(const ir_node *bound);
1182 void set_Bound_lower(ir_node *bound, ir_node *lower);
1184 /** Returns the upper bound input of a Bound operation. */
1185 ir_node *get_Bound_upper(const ir_node *bound);
1186 void set_Bound_upper(ir_node *bound, ir_node *upper);
1188 /** Return the operand of a Pin node. */
1189 ir_node *get_Pin_op(const ir_node *pin);
1190 void set_Pin_op(ir_node *pin, ir_node *node);
1192 /** Return the assembler text of an ASM pseudo node. */
1193 ident *get_ASM_text(const ir_node *node);
1194 /** Return the number of input constraints for an ASM node. */
1195 int get_ASM_n_input_constraints(const ir_node *node);
1196 /** Return the input constraints for an ASM node. */
1197 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node);
1198 /** Return the number of output constraints for an ASM node. */
1199 int get_ASM_n_output_constraints(const ir_node *node);
1200 /** Return the output constraints for an ASM node. */
1201 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node);
1202 /** Return the number of clobbered registers for an ASM node. */
1203 int get_ASM_n_clobbers(const ir_node *node);
1204 /** Return the list of clobbered registers for an ASM node. */
1205 ident **get_ASM_clobbers(const ir_node *node);
1209 * NAME Auxiliary routines
1213 /** Returns operand of node if node is a Proj. */
1214 ir_node *skip_Proj(ir_node *node);
1215 /** Returns operand of node if node is a Proj. */
1216 const ir_node *skip_Proj_const(const ir_node *node);
1217 /** Returns operand of node if node is a Id. */
1218 ir_node *skip_Id(ir_node *node); /* Old name is skip_nop(). */
1219 /** Returns corresponding operand of Tuple if node is a Proj from
1221 ir_node *skip_Tuple(ir_node *node);
1222 /** Returns operand of node if node is a Cast. */
1223 ir_node *skip_Cast(ir_node *node);
1224 const ir_node *skip_Cast_const(const ir_node *node);
1225 /** Returns operand of node if node is a Pin. */
1226 ir_node *skip_Pin(ir_node *node);
1227 /** Returns operand of node if node is a Confirm */
1228 ir_node *skip_Confirm(ir_node *node);
1229 /** Skip all high-level Operations (including Cast, Confirm). */
1230 ir_node *skip_HighLevel_ops(ir_node *node);
1231 /** Returns true if irn is a Const node. */
1232 int is_Const(const ir_node *node);
1233 /** Returns true if a node is a Conv node. */
1234 int is_Conv(const ir_node *node);
1235 /** Returns true if a node is a strictConv node. */
1236 int is_strictConv(const ir_node *node);
1237 /** Returns true if a node is a Cast node. */
1238 int is_Cast(const ir_node *node);
1239 /** Returns true if node is a Bad node. */
1240 int is_Bad(const ir_node *node);
1241 /** Returns true if node is a NoMem node. */
1242 int is_NoMem(const ir_node *node);
1243 /** Returns true if node is a Start node. */
1244 int is_Start(const ir_node *node);
1245 /** Returns true if node is a Minus node. */
1246 int is_Minus(const ir_node *node);
1247 /** Returns true if node is a Abs node. */
1248 int is_Abs(const ir_node *node);
1249 /** Returns true if node is a Mod node. */
1250 int is_Mod(const ir_node *node);
1251 /** Returns true if node is a Div node. */
1252 int is_Div(const ir_node *node);
1253 /** Returns true if node is a DivMod node. */
1254 int is_DivMod(const ir_node *node);
1255 /** Returns true if node is a Quot node. */
1256 int is_Quot(const ir_node *node);
1257 /** Returns true if node is an Add node. */
1258 int is_Add(const ir_node *node);
1259 /** Returns true if node is a Carry node. */
1260 int is_Carry(const ir_node *node);
1261 /** Returns true if node is an And node. */
1262 int is_And(const ir_node *node);
1263 /** Returns true if node is an Or node. */
1264 int is_Or(const ir_node *node);
1265 /** Returns true if node is an Eor node. */
1266 int is_Eor(const ir_node *node);
1267 /** Returns true if node is a Sub node. */
1268 int is_Sub(const ir_node *node);
1269 /** Returns true if node is a Not node. */
1270 int is_Not(const ir_node *node);
1271 /** Returns true if node is a Shl node. */
1272 int is_Shl(const ir_node *node);
1273 /** Returns true if node is a Shr node. */
1274 int is_Shr(const ir_node *node);
1275 /** Returns true if node is a Shrs node. */
1276 int is_Shrs(const ir_node *node);
1277 /** Returns true if node is a Rotl node. */
1278 int is_Rotl(const ir_node *node);
1279 /** Returns true if node is an Id node. */
1280 int is_Id(const ir_node *node);
1281 /** Returns true if node is a Tuple node. */
1282 int is_Tuple(const ir_node *node);
1283 /** Returns true if node is a Bound node. */
1284 int is_Bound(const ir_node *node);
1285 /** Returns true if the node is not a Block */
1286 int is_no_Block(const ir_node *node);
1287 /** Returns true if the node is a Block */
1288 int is_Block(const ir_node *node);
1289 /** Returns true if node is an Unknown node. */
1290 int is_Unknown(const ir_node *node);
1291 /** Returns true if node is a Return node. */
1292 int is_Return(const ir_node *node);
1293 /** Returns true if node is a Call node. */
1294 int is_Call(const ir_node *node);
1295 /** Returns true if node is a Builtin node. */
1296 int is_Builtin(const ir_node *node);
1297 /** Returns true if node is a CallBegin node. */
1298 int is_CallBegin(const ir_node *node);
1299 /** Returns true if node is a Sel node. */
1300 int is_Sel(const ir_node *node);
1301 /** Returns true if node is a Mul node. */
1302 int is_Mul(const ir_node *node);
1303 /** Returns true if node is a Mulh node. */
1304 int is_Mulh(const ir_node *node);
1305 /** Returns true if node is a Mux node. */
1306 int is_Mux(const ir_node *node);
1307 /** Returns true if node is a Load node. */
1308 int is_Load(const ir_node *node);
1309 /** Returns true if node is a Store node. */
1310 int is_Store(const ir_node *node);
1311 /** Returns true if node is a Sync node. */
1312 int is_Sync(const ir_node *node);
1313 /** Returns true if node is a Confirm node. */
1314 int is_Confirm(const ir_node *node);
1315 /** Returns true if node is a Pin node. */
1316 int is_Pin(const ir_node *node);
1317 /** Returns true if node is a SymConst node. */
1318 int is_SymConst(const ir_node *node);
1319 /** Returns true if node is a SymConst node with kind symconst_addr_ent. */
1320 int is_SymConst_addr_ent(const ir_node *node);
1321 /** Returns true if node is a Cond node. */
1322 int is_Cond(const ir_node *node);
1323 /** Returns true of node is a CopyB node. */
1324 int is_CopyB(const ir_node *node);
1325 /** Returns true if node is a Cmp node. */
1326 int is_Cmp(const ir_node *node);
1327 /** Returns true if node is an Alloc node. */
1328 int is_Alloc(const ir_node *node);
1329 /** Returns true if node is a Free node. */
1330 int is_Free(const ir_node *node);
1331 /** Returns true if a node is a Jmp node. */
1332 int is_Jmp(const ir_node *node);
1333 /** Returns true if a node is a IJmp node. */
1334 int is_IJmp(const ir_node *node);
1335 /** Returns true if a node is a Raise node. */
1336 int is_Raise(const ir_node *node);
1337 /** Returns true if a node is an ASM node. */
1338 int is_ASM(const ir_node *node);
1339 /** Returns true if a node is an Dummy node. */
1340 int is_Dummy(const ir_node *node);
1341 /** Returns true if node is a Proj node or a Filter node in INTRA-procedural view. */
1342 int is_Proj(const ir_node *node);
1343 /** Returns true if node is a Filter node. */
1344 int is_Filter(const ir_node *node);
1346 /** Returns true if the operation manipulates control flow:
1347 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
1348 int is_cfop(const ir_node *node);
1350 /** Returns true if the operation manipulates interprocedural control flow:
1351 CallBegin, EndReg, EndExcept */
1352 int is_ip_cfop(const ir_node *node);
1353 /** Returns true if the operation can change the control flow because
1354 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
1355 Bad. Raise is not fragile, but a unconditional jump. */
1356 int is_fragile_op(const ir_node *node);
1357 /** Returns the memory operand of fragile operations. */
1358 ir_node *get_fragile_op_mem(ir_node *node);
1359 /** Returns the result mode of a Div operation. */
1360 ir_mode *get_divop_resmod(const ir_node *node);
1362 /** Returns true if the operation is a forking control flow
1363 * operation: Cond. */
1364 int is_irn_forking(const ir_node *node);
1366 /** Return the type associated with the value produced by n
1367 * if the node remarks this type as it is the case for
1368 * Cast, Const, SymConst and some Proj nodes or unknown_type. */
1369 ir_type *get_irn_type(ir_node *n);
1371 /** Return the type attribute of a node n (SymConst, Call, Alloc, Free,
1373 ir_type *get_irn_type_attr(ir_node *n);
1375 /** Return the entity attribute of a node n (SymConst, Sel) or NULL. */
1376 ir_entity *get_irn_entity_attr(ir_node *n);
1378 /** Returns non-zero for constant-like nodes. */
1379 int is_irn_constlike(const ir_node *node);
1382 * Returns non-zero for nodes that must be always optimized
1383 * (Phi, Id. Proj, Cond, Block, Confirm ...).
1385 int is_irn_always_opt(const ir_node *node);
1388 * Returns non-zero for nodes that are allowed to have keep-alives and
1389 * are neither Block nor PhiM.
1391 int is_irn_keep(const ir_node *node);
1394 * Returns non-zero for nodes that are always placed in the start block.
1396 int is_irn_start_block_placed(const ir_node *node);
1399 * Returns non-zero for nodes that are machine operations.
1401 int is_irn_machine_op(const ir_node *node);
1404 * Returns non-zero for nodes that are machine operands.
1406 int is_irn_machine_operand(const ir_node *node);
1409 * Returns non-zero for nodes that have the n'th user machine flag set.
1411 int is_irn_machine_user(const ir_node *node, unsigned n);
1414 * A type to express conditional jump predictions.
1417 COND_JMP_PRED_NONE, /**< No jump prediction. Default. */
1418 COND_JMP_PRED_TRUE, /**< The True case is predicted. */
1419 COND_JMP_PRED_FALSE /**< The False case is predicted. */
1420 } cond_jmp_predicate;
1422 /** Gets the string representation of the jump prediction. */
1423 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred);
1425 /** Returns the conditional jump prediction of a Cond node. */
1426 cond_jmp_predicate get_Cond_jmp_pred(const ir_node *cond);
1428 /** Sets a new conditional jump prediction. */
1429 void set_Cond_jmp_pred(ir_node *cond, cond_jmp_predicate pred);
1431 /** Checks whether a node represents a global address. */
1432 int is_Global(const ir_node *node);
1434 /* Returns the entity of a global address. */
1435 ir_entity *get_Global_entity(const ir_node *node);
1438 * Access custom node data.
1439 * The data must have been registered with
1440 * register_additional_node_data() before.
1441 * @param node The ir node to get the data from.
1442 * @param type The type of the data you registered.
1443 * @param off The value returned by register_additional_node_data().
1444 * @return A pointer of type @p type.
1446 #define get_irn_data(node,type,off) \
1447 (assert(off > 0 && "Invalid node data offset"), (type *) ((char *) (node) - (off)))
1450 * Get the pointer to the node some custom data belongs to.
1451 * @param data The pointer to the custom data.
1452 * @param off The number as returned by register_additional_node_data().
1453 * @return A pointer to the ir node the custom data belongs to.
1455 #define get_irn_data_base(data,off) \
1456 (assert(off > 0 && "Invalid node data offset"), (ir_node *) ((char *) (data) + (off)))
1459 * Request additional data to be allocated with an ir node.
1460 * @param size The size of the additional data required.
1461 * @return A positive number, if the operation was successful, which
1462 * must be passed to the access macro get_irn_data(), 0 if the
1463 * registration failed.
1465 unsigned firm_register_additional_node_data(unsigned size);
1468 * Return a pointer to the node attributes.
1469 * Needed for user-defined nodes.
1471 void *get_irn_generic_attr(ir_node *node);
1472 const void *get_irn_generic_attr_const(const ir_node *node);
1475 * Returns the unique node index for the node in its graph.
1476 * This index is used to access phase information for this node.
1478 unsigned get_irn_idx(const ir_node *node);
1481 * Sets the debug information of a node.
1483 * @param n The node.
1484 * @param db The debug info.
1486 void set_irn_dbg_info(ir_node *n, dbg_info *db);
1489 * Returns the debug information of an node.
1491 * @param n The node.
1493 dbg_info *get_irn_dbg_info(const ir_node *n);
1496 * Calculate a hash value of a node. Only inputs, mode and opcode are used.
1498 * @param node the node to hash
1500 unsigned firm_default_hash(const ir_node *node);
1503 * returns a descriptive name of a node (containing type+number)
1505 const char *gdb_node_helper(void *firm_object);
1507 /*@}*/ /* end of ir_node group definition */