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 unsigned long get_irn_visited(const ir_node *node);
208 /** Sets the visited counter of a node. */
209 void set_irn_visited(ir_node *node, unsigned long 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_not_visited(const ir_node *node);
214 /** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
215 int irn_visited(const ir_node *node);
218 * Sets the link of a node.
219 * Only allowed if the graph is NOT in phase_building.
221 void set_irn_link(ir_node *node, void *link);
223 /** Returns the link of a node. */
224 void *get_irn_link(const ir_node *node);
226 /** Returns the ir_graph this node belongs to. */
227 ir_graph *get_irn_irg(const ir_node *node);
229 /** Outputs a unique number for this node if libFIRM is compiled for
230 debugging, (configure with --enable-debug) else returns address
231 of node cast to long. */
232 long get_irn_node_nr(const ir_node *node);
234 /** Returns the pinned state of a node.
236 * Returns whether the node _always_ must be pinned.
237 * I.e., the node is not floating after global cse.
239 * @returns Either state op_pin_state_pinned or op_pin_state_floats.
241 op_pin_state get_irn_pinned(const ir_node *node);
243 /** Set pin state for nodes with op pin state op_pin_state_exc_pinned */
244 void set_irn_pinned(ir_node *node, op_pin_state state);
246 /** Returns whether the node is currently pinned.
248 * If get_irn_pinned returns op_pin_state_floats and the graph the
249 * node belongs to is in state op_poin_state_floats then this function
250 * returns 'floats', else 'pinned'.
252 op_pin_state is_irn_pinned_in_irg(const ir_node *node);
255 * IR node constructor.
256 * Create a new IR node in irg, with an op, mode, arity and
257 * some incoming IR nodes.
258 * This constructor is used in every specific IR node constructor.
260 * @param db Debug info.
261 * @param irg IR-graph on with this new node should be constructed.
262 * @param block The block the new node belongs to
263 * @param op The opcode of the new node.
264 * @param mode The mode of the new node.
265 * @param arity The arity of the new node, <0 if can be changed dynamically.
266 * @param in An array of arity predecessor nodes.
269 new_ir_node(dbg_info *db,
278 * Return the block the node belongs to. This is only
279 * possible for pinned nodes or if the graph is in pinned state.
280 * Otherwise the block may be incorrect. This condition is
281 * now checked by an assertion.
283 * This works for all except Block. It can return Blocks or the Bad node.
285 * To express the difference to access routines that work for all
286 * nodes we use infix "nodes" and do not name this function
287 * get_irn_block(). */
288 ir_node *get_nodes_block (const ir_node *node);
290 /** Sets the Block of a node. */
291 void set_nodes_block (ir_node *node, ir_node *block);
294 * Return the MacroBlock the node belongs to. This is only
295 * possible for pinned nodes or if the graph is in pinned state.
296 * Otherwise the MacroBlock may be incorrect. This condition is
297 * now checked by an assertion.
299 * This works for all except Block. It can return Blocks or the Bad node.
301 * To express the difference to access routines that work for all
302 * nodes we use infix "nodes" and do not name this function
303 * get_irn_MacroBlock(). */
304 ir_node *get_nodes_MacroBlock(const ir_node *node);
307 * @function get_irn_block()
308 * @see get_nodes_block()
312 * Projection numbers for result of Start node: use for Proj nodes!
315 pn_Start_X_initial_exec, /**< Projection on the initial control flow. */
316 pn_Start_M, /**< Projection on the initial memory. */
317 pn_Start_P_frame_base, /**< Projection on the frame base pointer. */
318 pn_Start_P_tls, /**< Projection on the pointer to the thread local store
319 segment containing _all_thread local variables. */
320 pn_Start_T_args, /**< Projection on all arguments. */
321 pn_Start_P_value_arg_base, /**< Pointer to region of compound value arguments as defined by
322 type of this method. */
323 pn_Start_max /**< number of projections from a Start */
324 } pn_Start; /* Projection numbers for Start. */
326 /** Test whether arbitrary node is frame pointer.
328 * Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
329 * from Start. If so returns frame type, else Null. */
330 ir_type *is_frame_pointer(const ir_node *n);
332 /** Test whether arbitrary node is the thread local storage (tls) pointer.
334 * Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
335 * from Start. If so returns tls type, else Null. */
336 ir_type *is_tls_pointer(const ir_node *n);
338 /** Test whether arbitrary node is value arg base.
340 * Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
341 * from Start. If so returns 1, else 0. */
342 int is_value_arg_pointer(const ir_node *n);
344 /* @@@ no more supported */
345 ir_node **get_Block_cfgpred_arr(ir_node *node);
346 int get_Block_n_cfgpreds(const ir_node *node);
347 ir_node *get_Block_cfgpred(const ir_node *node, int pos);
348 void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred);
349 /** Get the predecessor block.
351 * Returns the block corresponding to the predecessor pos of block.
353 * There are several ambiguities we resolve with this function:
354 * - The direct predecessor can be a Proj, which is not pinned.
355 * We walk from the predecessor to the next pinned node
356 * (skip_Proj) and return the block that node is in.
357 * - If we encounter the Bad node, this function does not return
358 * Start, but the Bad node.
360 ir_node *get_Block_cfgpred_block(const ir_node *node, int pos);
361 int get_Block_matured(const ir_node *node);
362 void set_Block_matured(ir_node *node, int matured);
364 /** A visited flag only for block nodes.
365 * @see also: get_irn_visited() inc_irg_visited() inc_irg_block_visited()*/
366 unsigned long get_Block_block_visited(const ir_node *node);
367 void set_Block_block_visited(ir_node *node, unsigned long visit);
370 * Marks a block as dead but do not replace it with a Bad node.
371 * Dead blocks are removed in the con
373 ir_node *set_Block_dead(ir_node *block);
374 int is_Block_dead(const ir_node *block);
376 /* For this current_ir_graph must be set. */
377 void mark_Block_block_visited(ir_node *node);
378 int Block_not_block_visited(const ir_node *node);
379 int Block_block_visited(const ir_node *node);
381 #ifdef INTERPROCEDURAL_VIEW
382 /* Set and remove interprocedural predecessors. If the interprocedural
383 * predecessors are removed, the node has the same predecessors in
385 * @@@ Maybe better: arity is zero if no cg preds. */
386 void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]);
387 void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred);
388 /* @@@ not supported */
389 ir_node **get_Block_cg_cfgpred_arr(ir_node *node);
390 /** Returns the number of interprocedural predecessors. 0 if none. */
391 int get_Block_cg_n_cfgpreds(const ir_node *node);
392 /** Return the interprocedural predecessor at position pos. */
393 ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos);
394 /** Frees the memory allocated for interprocedural predecessors. */
395 void remove_Block_cg_cfgpred_arr(ir_node *node);
398 /** Returns the extended basic block a block belongs to. */
399 ir_extblk *get_Block_extbb(const ir_node *block);
400 /** Sets the extended basic block a block belongs to. */
401 void set_Block_extbb(ir_node *block, ir_extblk *extblk);
402 /** Get the Macro Block header of a (sub-) block. */
403 ir_node *get_Block_MacroBlock(const ir_node *block);
404 /** Set the Macro Block header of a (sub-) block. */
405 void set_Block_MacroBlock(ir_node *block, ir_node *mbh);
406 /** Get the Macro Block header of a node. */
407 ir_node *get_irn_MacroBlock(const ir_node *n);
408 /** Returns the ir_graph this Block belongs to. */
409 ir_graph *get_Block_irg(const ir_node *block);
410 /** Returns non-zero if the block has an assigned label. */
411 int has_Block_label(const ir_node *block);
412 /** Returns the label of a Block. */
413 ir_label_t get_Block_label(const ir_node *block);
414 /** Sets a label to a block. */
415 void set_Block_label(ir_node *block, ir_label_t label);
416 /** Gets the head of the Phi list for this block. */
417 ir_node *get_Block_phis(const ir_node *block);
418 /** Sets the head of the Phi list for this block. */
419 void set_Block_phis(ir_node *block, ir_node *phi);
420 /** Add a Phi node to the list of Block Phi's. */
421 void add_Block_phi(ir_node *block, ir_node *phi);
422 /** Get the Block mark (single bit). */
423 unsigned get_Block_mark(const ir_node *block);
424 /** Set the Block mark (single bit). */
425 void set_Block_mark(ir_node *block, unsigned mark);
427 /** Return the number of Keep alive node. */
428 int get_End_n_keepalives(const ir_node *end);
429 /** Return the Keep alive node a position pos. */
430 ir_node *get_End_keepalive(const ir_node *end, int pos);
431 /** Keep alive dedicated nodes. These must be either PhiM or Block nodes. */
432 void add_End_keepalive(ir_node *end, ir_node *ka);
433 /** Set the Keep alive node at position pos. */
434 void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
437 * Set new keep-alives.
438 * Beware: This might be an expensive operation if dynamic edges are enabled,
439 * so avoid it in the backend.
441 void set_End_keepalives(ir_node *end, int n, ir_node *in[]);
443 /** Remove irn from the keep-alive set. */
444 void remove_End_keepalive(ir_node *end, ir_node *irn);
446 /** Some parts of the End node are allocated separately -- their memory
447 is not recovered by dead_node_elimination if a End node is dead.
448 free_End() frees these data structures. */
449 void free_End(ir_node *end);
451 /** Return the target address of an IJmp */
452 ir_node *get_IJmp_target(const ir_node *ijmp);
453 /** Sets the target address of an IJmp */
454 void set_IJmp_target(ir_node *ijmp, ir_node *tgt);
456 /* We distinguish three kinds of Cond nodes. These can be distinguished
457 by the mode of the selector operand and an internal flag of type cond_kind.
458 First we distinguish binary Conds and switch Conds.
459 A binary Cond has as selector a boolean value. Proj(0) projects the control
460 flow for case "False", Proj(1) the control flow for "True". A binary Cond
461 is recognized by the boolean selector.
462 The switch Cond has as selector an unsigned integer. It produces as result
463 an n+1 Tuple (cf0, ... , cfn) of control flows.
464 We differ two flavors of this Cond. The first, the dense Cond, passes
465 control along output i if the selector value is i, 0 <= i <= n. If the
466 selector value is >n it passes control along output n.
467 The second Cond flavor differences in the treatment of cases not specified in
468 the source program. It magically knows about the existence of Proj nodes.
469 It only passes control along output i, 0 <= i <= n, if a node Proj(Cond, i)
470 exists. Else it passes control along output n (even if this Proj does not
471 exist.) This Cond we call "fragmentary". There is a special constructor
472 new_defaultProj that automatically sets the flavor.
473 The two switch flavors are distinguished by a flag of type cond_kind.
474 Default flavor is "dense"
477 dense, /**< Default. Missing Proj nodes are dead control flow. */
478 fragmentary /**< Special. No control flow optimizations allowed. Missing
479 Proj nodes mean default control flow, i.e., Proj(n). */
482 ir_node *get_Cond_selector(const ir_node *node);
483 void set_Cond_selector(ir_node *node, ir_node *selector);
484 cond_kind get_Cond_kind(const ir_node *node);
485 void set_Cond_kind(ir_node *node, cond_kind kind);
486 long get_Cond_defaultProj(const ir_node *node);
489 * Projection numbers for conditions.
492 pn_Cond_false, /**< Control flow if operand is "false". */
493 pn_Cond_true, /**< Control flow if operand is "true". */
494 pn_Cond_max /**< number of projections from a Cond */
495 } pn_Cond; /* Projection numbers for Cond. */
497 ir_node *get_Return_mem(const ir_node *node);
498 void set_Return_mem(ir_node *node, ir_node *mem);
499 ir_node **get_Return_res_arr(ir_node *node);
500 int get_Return_n_ress(const ir_node *node);
501 ir_node *get_Return_res(const ir_node *node, int pos);
502 void set_Return_res(ir_node *node, int pos, ir_node *res);
504 tarval *get_Const_tarval(const ir_node *node);
505 void set_Const_tarval(ir_node *node, tarval *con);
507 /** Return non-zero if the given Const node represents the 0 constant. */
508 int is_Const_null(const ir_node *node);
510 /** Return non-zero if the given Const node represents the 1 constant. */
511 int is_Const_one(const ir_node *node);
513 /** Return non-zero if the given Const node represents the constant with all bits set. */
514 int is_Const_all_one(const ir_node *node);
516 /** Returns the source language type of a Const node.
517 * Must be an atomic type. Mode of type must be mode of node.
519 ir_type *get_Const_type(ir_node *node);
521 /** Sets the source language type of a Const node. */
522 void set_Const_type(ir_node *node, ir_type *tp);
524 /** This enum names the three different kinds of symbolic Constants
525 represented by SymConst. The content of the attribute type_or_id
526 depends on this tag. Use the proper access routine after testing
529 symconst_type_tag, /**< The SymConst is a type tag for the given type.
530 symconst_symbol is type *. */
531 symconst_type_size, /**< The SymConst is the size of the given type.
532 symconst_symbol is type *. */
533 symconst_type_align, /**< The SymConst is the alignment of the given type.
534 symconst_symbol is type *. */
535 symconst_addr_name, /**< The SymConst is a symbolic pointer to be filled in
536 by the linker. The pointer is represented by a string.
537 symconst_symbol is ident *. */
538 symconst_addr_ent, /**< The SymConst is a symbolic pointer to be filled in
539 by the linker. The pointer is represented by an entity.
540 symconst_symbol is entity *. */
541 symconst_ofs_ent, /**< The SymConst is the offset of its entity in the entities
543 symconst_enum_const, /**< The SymConst is a enumeration constant of an
545 symconst_label /**< The SymConst is a label address. */
548 /** Returns non-zero if s symconst kind has a type attribute */
549 #define SYMCONST_HAS_TYPE(kind) ((kind) <= symconst_type_align)
551 /** Returns non-zero if s symconst kind has an ident attribute */
552 #define SYMCONST_HAS_ID(kind) ((kind) == symconst_addr_name)
554 /** Returns non-zero if s symconst kind has an entity attribute */
555 #define SYMCONST_HAS_ENT(kind) ((kind) == symconst_addr_ent || (kind) == symconst_ofs_ent)
557 /** Returns non-zero if s symconst kind has an enum_const attribute */
558 #define SYMCONST_HAS_ENUM(kind) ((kind) == symconst_enum_const)
560 /** Returns non-zero if s symconst kind has a label attribute */
561 #define SYMCONST_HAS_LABEL(kind) ((kind) == symconst_label)
563 /** SymConst attribute.
565 * This union contains the symbolic information represented by the node.
567 typedef union symconst_symbol {
568 ir_type *type_p; /**< The type of a SymConst. */
569 ident *ident_p; /**< The ident of a SymConst. */
570 ir_entity *entity_p; /**< The entity of a SymConst. */
571 ir_enum_const *enum_p; /**< The enumeration constant of a SymConst. */
572 ir_label_t label; /**< The label of a SymConst. */
575 /** Get the kind of the SymConst. */
576 symconst_kind get_SymConst_kind(const ir_node *node);
577 /** Set the kind of the SymConst. */
578 void set_SymConst_kind(ir_node *node, symconst_kind num);
580 /** Only to access SymConst of kind type_tag or size. Else assertion: */
581 ir_type *get_SymConst_type(ir_node *node);
582 void set_SymConst_type(ir_node *node, ir_type *tp);
584 /** Only to access SymConst of kind addr_name. Else assertion: */
585 ident *get_SymConst_name(const ir_node *node);
586 void set_SymConst_name(ir_node *node, ident *name);
588 /** Only to access SymConst of kind addr_ent. Else assertion: */
589 ir_entity *get_SymConst_entity(const ir_node *node);
590 void set_SymConst_entity(ir_node *node, ir_entity *ent);
592 /** Only to access SymConst of kind symconst_enum_const. Else assertion: */
593 ir_enum_const *get_SymConst_enum(const ir_node *node);
594 void set_SymConst_enum(ir_node *node, ir_enum_const *ec);
596 /** Sets both: type and ptrinfo. Needed to treat the node independent of
597 its semantics. Does a memcpy for the memory sym points to. */
598 /* write 'union': firmjni then does not create a method... */
599 union symconst_symbol get_SymConst_symbol(const ir_node *node);
600 void set_SymConst_symbol(ir_node *node,
601 union symconst_symbol sym);
603 /** Only to access SymConst of kind symconst_label. Else assertion: */
604 ir_label_t get_SymConst_label(const ir_node *node);
605 void set_SymConst_label(ir_node *node, ir_label_t label);
608 /** Access the type of the value represented by the SymConst.
610 * Example: primitive type int for SymConst size. */
611 ir_type *get_SymConst_value_type(ir_node *node);
612 void set_SymConst_value_type(ir_node *node, ir_type *tp);
614 ir_node *get_Sel_mem(const ir_node *node);
615 void set_Sel_mem(ir_node *node, ir_node *mem);
616 ir_node *get_Sel_ptr(const ir_node *node); /* ptr to the object to select from */
617 void set_Sel_ptr(ir_node *node, ir_node *ptr);
618 ir_node **get_Sel_index_arr(ir_node *node);
619 int get_Sel_n_indexs(const ir_node *node);
620 ir_node *get_Sel_index(const ir_node *node, int pos);
621 void set_Sel_index(ir_node *node, int pos, ir_node *index);
622 ir_entity *get_Sel_entity(const ir_node *node); /* entity to select */
623 void set_Sel_entity (ir_node *node, ir_entity *ent);
626 * Projection numbers for result of Call node: use for Proj nodes!
629 pn_Call_M_regular = pn_Generic_M_regular, /**< The memory result. */
630 pn_Call_X_regular = pn_Generic_X_regular, /**< The control flow result when no exception occurs. */
631 pn_Call_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler. */
632 pn_Call_T_result = pn_Generic_other, /**< The tuple containing all (0, 1, 2, ...) results. */
633 pn_Call_M_except, /**< The memory result in case the called method terminated with
635 pn_Call_P_value_res_base, /**< A pointer to the memory region containing copied results
636 passed by value (for compound result types). */
637 pn_Call_max /**< number of projections from a Call */
638 } pn_Call; /* Projection numbers for Call. */
639 #define pn_Call_M pn_Call_M_regular
641 ir_node *get_Call_mem(const ir_node *node);
642 void set_Call_mem(ir_node *node, ir_node *mem);
643 ir_node *get_Call_ptr(const ir_node *node);
644 void set_Call_ptr(ir_node *node, ir_node *ptr);
645 ir_node **get_Call_param_arr(ir_node *node);
646 /** Gets the number of parameters of a call. */
647 int get_Call_n_params(const ir_node *node);
648 /** Gets the call parameter at position pos. */
649 ir_node *get_Call_param(const ir_node *node, int pos);
650 /** Sets the call parameter at position pos. */
651 void set_Call_param(ir_node *node, int pos, ir_node *param);
652 /** Gets the type of a call. */
653 ir_type *get_Call_type(ir_node *node);
654 /** Sets the type of a call. */
655 void set_Call_type(ir_node *node, ir_type *tp);
656 /** Gets the arity of a call. Identical to get_Call_n_params(). */
657 int get_Call_arity(const ir_node *node);
660 * Returns non-zero if a Call is surely a self-recursive Call.
661 * Beware: if this functions returns 0, the call might be self-recursive!
663 int is_self_recursive_Call(const ir_node *call);
665 /** Set, get and remove the callee information for a Call node.
667 * The callee information lists all method entities that can be called
668 * from this node. If the address expression can not be analyzed fully,
669 * e.g., as entities can be called that are not in the compilation unit,
670 * the array contains the unknown_entity. The array contains only entities
671 * with peculiarity_existent, but with all kinds of visibility. The entities
672 * not necessarily contain an irg.
674 * The array is only accessible if callee information is valid. See flag
677 * The memory allocated for the array is managed automatically, i.e., it must
678 * not be freed if the Call node is removed from the graph.
680 * @param node A Call node.
682 int Call_has_callees(const ir_node *node);
683 int get_Call_n_callees(const ir_node *node);
684 ir_entity *get_Call_callee(const ir_node *node, int pos);
686 /** Set the full callee array.
688 * The passed array is copied. Assumes current_ir_graph set properly! */
689 void set_Call_callee_arr(ir_node *node, const int n, ir_entity **arr);
690 void remove_Call_callee_arr(ir_node *node);
692 ir_node *get_CallBegin_ptr(const ir_node *node);
693 void set_CallBegin_ptr(ir_node *node, ir_node *ptr);
694 ir_node *get_CallBegin_call(const ir_node *node);
695 void set_CallBegin_call(ir_node *node, ir_node *call);
697 /* For unary and binary arithmetic operations the access to the
698 operands can be factored out. Left is the first, right the
699 second arithmetic value as listed in tech report 1999-44.
700 unops are: Minus, Abs, Not, Conv, Cast
701 binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
702 Shr, Shrs, Rotl, Cmp */
703 int is_unop(const ir_node *node);
704 ir_node *get_unop_op(const ir_node *node);
705 void set_unop_op(ir_node *node, ir_node *op);
706 int is_binop(const ir_node *node);
707 ir_node *get_binop_left(const ir_node *node);
708 void set_binop_left(ir_node *node, ir_node *left);
709 ir_node *get_binop_right(const ir_node *node);
710 void set_binop_right(ir_node *node, ir_node *right);
712 ir_node *get_Add_left(const ir_node *node);
713 void set_Add_left(ir_node *node, ir_node *left);
714 ir_node *get_Add_right(const ir_node *node);
715 void set_Add_right(ir_node *node, ir_node *right);
717 ir_node *get_Sub_left(const ir_node *node);
718 void set_Sub_left(ir_node *node, ir_node *left);
719 ir_node *get_Sub_right(const ir_node *node);
720 void set_Sub_right(ir_node *node, ir_node *right);
722 ir_node *get_Minus_op(const ir_node *node);
723 void set_Minus_op(ir_node *node, ir_node *op);
725 ir_node *get_Mul_left(const ir_node *node);
726 void set_Mul_left(ir_node *node, ir_node *left);
727 ir_node *get_Mul_right(const ir_node *node);
728 void set_Mul_right(ir_node *node, ir_node *right);
730 ir_node *get_Mulh_left(const ir_node *node);
731 void set_Mulh_left(ir_node *node, ir_node *left);
732 ir_node *get_Mulh_right(const ir_node *node);
733 void set_Mulh_right(ir_node *node, ir_node *right);
735 ir_node *get_Quot_left(const ir_node *node);
736 void set_Quot_left(ir_node *node, ir_node *left);
737 ir_node *get_Quot_right(const ir_node *node);
738 void set_Quot_right(ir_node *node, ir_node *right);
739 ir_node *get_Quot_mem(const ir_node *node);
740 void set_Quot_mem(ir_node *node, ir_node *mem);
741 ir_mode *get_Quot_resmode(const ir_node *node);
742 void set_Quot_resmode(ir_node *node, ir_mode *mode);
745 * Projection numbers for Quot: use for Proj nodes!
748 pn_Quot_M = pn_Generic_M_regular, /**< Memory result. */
749 pn_Quot_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
750 pn_Quot_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
751 pn_Quot_res = pn_Generic_other, /**< Result of computation. */
752 pn_Quot_max /**< number of projections from a Quot */
753 } pn_Quot; /* Projection numbers for Quot. */
755 ir_node *get_DivMod_left(const ir_node *node);
756 void set_DivMod_left(ir_node *node, ir_node *left);
757 ir_node *get_DivMod_right(const ir_node *node);
758 void set_DivMod_right(ir_node *node, ir_node *right);
759 ir_node *get_DivMod_mem(const ir_node *node);
760 void set_DivMod_mem(ir_node *node, ir_node *mem);
761 ir_mode *get_DivMod_resmode(const ir_node *node);
762 void set_DivMod_resmode(ir_node *node, ir_mode *mode);
765 * Projection numbers for DivMod: use for Proj nodes!
768 pn_DivMod_M = pn_Generic_M_regular, /**< Memory result. */
769 pn_DivMod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
770 pn_DivMod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
771 pn_DivMod_res_div = pn_Generic_other, /**< Result of computation a / b. */
772 pn_DivMod_res_mod, /**< Result of computation a % b. */
773 pn_DivMod_max /**< number of projections from a DivMod */
774 } pn_DivMod; /* Projection numbers for DivMod. */
776 ir_node *get_Div_left(const ir_node *node);
777 void set_Div_left(ir_node *node, ir_node *left);
778 ir_node *get_Div_right(const ir_node *node);
779 void set_Div_right(ir_node *node, ir_node *right);
780 ir_node *get_Div_mem(const ir_node *node);
781 void set_Div_mem(ir_node *node, ir_node *mem);
782 ir_mode *get_Div_resmode(const ir_node *node);
783 void set_Div_resmode(ir_node *node, ir_mode *mode);
784 int is_Div_remainderless(const ir_node *node);
787 * Projection numbers for Div: use for Proj nodes!
790 pn_Div_M = pn_Generic_M_regular, /**< Memory result. */
791 pn_Div_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
792 pn_Div_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
793 pn_Div_res = pn_Generic_other, /**< Result of computation. */
794 pn_Div_max /**< number of projections from a Div */
795 } pn_Div; /* Projection numbers for Div. */
797 ir_node *get_Mod_left(const ir_node *node);
798 void set_Mod_left(ir_node *node, ir_node *left);
799 ir_node *get_Mod_right(const ir_node *node);
800 void set_Mod_right(ir_node *node, ir_node *right);
801 ir_node *get_Mod_mem(const ir_node *node);
802 void set_Mod_mem(ir_node *node, ir_node *mem);
803 ir_mode *get_Mod_resmode(const ir_node *node);
804 void set_Mod_resmode(ir_node *node, ir_mode *mode);
807 * Projection numbers for Mod: use for Proj nodes!
810 pn_Mod_M = pn_Generic_M_regular, /**< Memory result. */
811 pn_Mod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
812 pn_Mod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
813 pn_Mod_res = pn_Generic_other, /**< Result of computation. */
814 pn_Mod_max /**< number of projections from a Mod */
815 } pn_Mod; /* Projection numbers for Mod. */
817 ir_node *get_Abs_op(const ir_node *node);
818 void set_Abs_op(ir_node *node, ir_node *op);
820 ir_node *get_And_left(const ir_node *node);
821 void set_And_left(ir_node *node, ir_node *left);
822 ir_node *get_And_right(const ir_node *node);
823 void set_And_right(ir_node *node, ir_node *right);
825 ir_node *get_Or_left(const ir_node *node);
826 void set_Or_left(ir_node *node, ir_node *left);
827 ir_node *get_Or_right(const ir_node *node);
828 void set_Or_right(ir_node *node, ir_node *right);
830 ir_node *get_Eor_left(const ir_node *node);
831 void set_Eor_left(ir_node *node, ir_node *left);
832 ir_node *get_Eor_right(const ir_node *node);
833 void set_Eor_right(ir_node *node, ir_node *right);
835 ir_node *get_Not_op(const ir_node *node);
836 void set_Not_op(ir_node *node, ir_node *op);
839 * Projection numbers for Cmp are defined several times.
840 * The bit patterns are used for various tests, so don't change.
841 * The "unordered" values are possible results of comparing
842 * floating point numbers.
843 * Note that the encoding is imported, so do NOT change the order.
846 pn_Cmp_False = 0, /**< false */
847 pn_Cmp_Eq = 1, /**< equal */
848 pn_Cmp_Lt = 2, /**< less */
849 pn_Cmp_Le = pn_Cmp_Eq|pn_Cmp_Lt, /**< less or equal */
850 pn_Cmp_Gt = 4, /**< greater */
851 pn_Cmp_Ge = pn_Cmp_Eq|pn_Cmp_Gt, /**< greater or equal */
852 pn_Cmp_Lg = pn_Cmp_Lt|pn_Cmp_Gt, /**< less or greater */
853 pn_Cmp_Leg = pn_Cmp_Lt|pn_Cmp_Eq|pn_Cmp_Gt, /**< less, equal or greater = ordered */
854 pn_Cmp_Uo = 8, /**< unordered */
855 pn_Cmp_Ue = pn_Cmp_Uo|pn_Cmp_Eq, /**< unordered or equal */
856 pn_Cmp_Ul = pn_Cmp_Uo|pn_Cmp_Lt, /**< unordered or less */
857 pn_Cmp_Ule = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Lt, /**< unordered, less or equal */
858 pn_Cmp_Ug = pn_Cmp_Uo|pn_Cmp_Gt, /**< unordered or greater */
859 pn_Cmp_Uge = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Gt, /**< unordered, greater or equal */
860 pn_Cmp_Ne = pn_Cmp_Uo|pn_Cmp_Lt|pn_Cmp_Gt, /**< unordered, less or greater = not equal */
861 pn_Cmp_True = 15 /**< true */
862 /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for JNI interface */
863 } pn_Cmp; /* Projection numbers for Cmp */
864 /* #define not_mask pn_Cmp_Leg */
866 /** returns the pnc name from an pnc constant */
867 const char *get_pnc_string(int pnc);
869 /** Calculates the negated (Complement(R)) pnc condition. */
870 pn_Cmp get_negated_pnc(long pnc, ir_mode *mode);
872 /** Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
873 pn_Cmp get_inversed_pnc(long pnc);
875 /** An alternative name for get_inversed_pnc() that can be better memorized. */
876 #define get_mirrored_pnc(pnc) get_inversed_pnc(pnc)
878 ir_node *get_Cmp_left(const ir_node *node);
879 void set_Cmp_left(ir_node *node, ir_node *left);
880 ir_node *get_Cmp_right(const ir_node *node);
881 void set_Cmp_right(ir_node *node, ir_node *right);
883 ir_node *get_Shl_left(const ir_node *node);
884 void set_Shl_left(ir_node *node, ir_node *left);
885 ir_node *get_Shl_right(const ir_node *node);
886 void set_Shl_right(ir_node *node, ir_node *right);
888 ir_node *get_Shr_left(const ir_node *node);
889 void set_Shr_left(ir_node *node, ir_node *left);
890 ir_node *get_Shr_right(const ir_node *node);
891 void set_Shr_right(ir_node *node, ir_node *right);
893 ir_node *get_Shrs_left(const ir_node *node);
894 void set_Shrs_left(ir_node *node, ir_node *left);
895 ir_node *get_Shrs_right(const ir_node *node);
896 void set_Shrs_right(ir_node *node, ir_node *right);
898 ir_node *get_Rotl_left(const ir_node *node);
899 void set_Rotl_left(ir_node *node, ir_node *left);
900 ir_node *get_Rotl_right(const ir_node *node);
901 void set_Rotl_right(ir_node *node, ir_node *right);
903 ir_node *get_Conv_op(const ir_node *node);
904 void set_Conv_op(ir_node *node, ir_node *op);
905 int get_Conv_strict(const ir_node *node);
906 void set_Conv_strict(ir_node *node, int flag);
908 /* Does Cast need a mem operator?
909 * Cast should only depend on the type, not on the state of an
910 * entity. But: we initialize various fields after Alloc, that
911 * are accessed in the cast. This required some precaution, to
912 * get the right memory into the Loads generated from the cast.
914 ir_node *get_Cast_op(const ir_node *node);
915 void set_Cast_op(ir_node *node, ir_node *op);
916 ir_type *get_Cast_type(ir_node *node);
917 void set_Cast_type(ir_node *node, ir_type *to_tp);
919 /** Checks for upcast.
921 * Returns true if the Cast node casts a class type to a super type.
922 * Works also for pointers to classes (recursively).
924 * Needs typeinfo calculated.
926 int is_Cast_upcast(ir_node *node);
928 /** Checks for downcast.
930 * Returns true if the Cast node casts a class type to a sub type.
931 * Works also for pointers to classes (recursively).
933 * Needs typeinfo calculated.
935 int is_Cast_downcast(ir_node *node);
938 /** Returns true if n is a Phi or a Filter node in INTER-procedural view.
939 Returns false if irg is in phase phase_building and the Phi has zero
940 predecessors: it's a Phi0. */
941 int is_Phi(const ir_node *n);
942 /** Returns true if irg in phase phase_building and the Phi has zero
943 predecessors. It's a Phi0 then. */
944 int is_Phi0(const ir_node *n);
945 /* These routines also work for Filter nodes in INTER-procedural view. */
946 ir_node **get_Phi_preds_arr(ir_node *node);
947 int get_Phi_n_preds(const ir_node *node);
948 ir_node *get_Phi_pred(const ir_node *node, int pos);
949 void set_Phi_pred(ir_node *node, int pos, ir_node *pred);
950 ir_node *get_Phi_next(const ir_node *phi);
951 void set_Phi_next(ir_node *phi, ir_node *next);
953 ir_node *get_Filter_pred(ir_node *node);
954 void set_Filter_pred(ir_node *node, ir_node *pred);
955 long get_Filter_proj(ir_node *node);
956 void set_Filter_proj(ir_node *node, long proj);
957 /* set the interprocedural predecessors, ...d_arr uses current_ir_graph.
958 * @@@ Maybe better: arity is zero if no cg preds. */
959 void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in);
960 void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred);
961 int get_Filter_n_cg_preds(ir_node *node);
962 ir_node *get_Filter_cg_pred(ir_node *node, int pos);
964 /** Return true if parameter is a memory operation.
966 * A memory operation is an operation that changes the
967 * memory. I.e., a Load or a Store operation.
969 int is_memop(const ir_node *node);
970 ir_node *get_memop_mem(const ir_node *node);
971 void set_memop_mem(ir_node *node, ir_node *mem);
972 ir_node *get_memop_ptr(const ir_node *node);
973 void set_memop_ptr(ir_node *node, ir_node *ptr);
976 * Projection numbers for Load: use for Proj nodes!
979 pn_Load_M = pn_Generic_M_regular, /**< Memory result. */
980 pn_Load_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
981 pn_Load_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
982 pn_Load_res = pn_Generic_other, /**< Result of load operation. */
983 pn_Load_max /**< number of projections from a Load */
984 } pn_Load; /* Projection numbers for Load. */
986 ir_node *get_Load_mem(const ir_node *node);
987 void set_Load_mem(ir_node *node, ir_node *mem);
988 ir_node *get_Load_ptr(const ir_node *node);
989 void set_Load_ptr(ir_node *node, ir_node *ptr);
990 ir_mode *get_Load_mode(const ir_node *node);
991 void set_Load_mode(ir_node *node, ir_mode *mode);
992 ir_volatility get_Load_volatility(const ir_node *node);
993 void set_Load_volatility(ir_node *node, ir_volatility volatility);
994 ir_align get_Load_align(const ir_node *node);
995 void set_Load_align(ir_node *node, ir_align align);
998 * Projection numbers for Store: use for Proj nodes!
1001 pn_Store_M = pn_Generic_M_regular, /**< Memory result. */
1002 pn_Store_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1003 pn_Store_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
1004 pn_Store_max = pn_Generic_other /**< number of projections from a Store */
1005 } pn_Store; /* Projection numbers for Store. */
1007 ir_node *get_Store_mem(const ir_node *node);
1008 void set_Store_mem(ir_node *node, ir_node *mem);
1009 ir_node *get_Store_ptr(const ir_node *node);
1010 void set_Store_ptr(ir_node *node, ir_node *ptr);
1011 ir_node *get_Store_value(const ir_node *node);
1012 void set_Store_value(ir_node *node, ir_node *value);
1013 ir_volatility get_Store_volatility(const ir_node *node);
1014 void set_Store_volatility(ir_node *node, ir_volatility volatility);
1015 ir_align get_Store_align(const ir_node *node);
1016 void set_Store_align(ir_node *node, ir_align align);
1019 * Projection numbers for Alloc: use for Proj nodes!
1022 pn_Alloc_M = pn_Generic_M_regular, /**< Memory result. */
1023 pn_Alloc_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1024 pn_Alloc_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
1025 pn_Alloc_res = pn_Generic_other, /**< Result of allocation. */
1026 pn_Alloc_max /**< number of projections from an Alloc */
1027 } pn_Alloc; /* Projection numbers for Alloc. */
1029 ir_node *get_Alloc_mem(const ir_node *node);
1030 void set_Alloc_mem(ir_node *node, ir_node *mem);
1031 ir_node *get_Alloc_size(const ir_node *node);
1032 void set_Alloc_size(ir_node *node, ir_node *size);
1033 ir_type *get_Alloc_type(ir_node *node);
1034 void set_Alloc_type(ir_node *node, ir_type *tp);
1036 /** The allocation place. */
1038 stack_alloc, /**< Alloc allocates the object on the stack. */
1039 heap_alloc /**< Alloc allocates the object on the heap. */
1042 ir_where_alloc get_Alloc_where(const ir_node *node);
1043 void set_Alloc_where(ir_node *node, ir_where_alloc where);
1045 ir_node *get_Free_mem(const ir_node *node);
1046 void set_Free_mem(ir_node *node, ir_node *mem);
1047 ir_node *get_Free_ptr(const ir_node *node);
1048 void set_Free_ptr(ir_node *node, ir_node *ptr);
1049 ir_node *get_Free_size(const ir_node *node);
1050 void set_Free_size(ir_node *node, ir_node *size);
1051 ir_type *get_Free_type(ir_node *node);
1052 void set_Free_type(ir_node *node, ir_type *tp);
1054 ir_where_alloc get_Free_where(const ir_node *node);
1055 void set_Free_where(ir_node *node, ir_where_alloc where);
1057 ir_node **get_Sync_preds_arr(ir_node *node);
1058 int get_Sync_n_preds(const ir_node *node);
1059 ir_node *get_Sync_pred(const ir_node *node, int pos);
1060 void set_Sync_pred(ir_node *node, int pos, ir_node *pred);
1061 void add_Sync_pred(ir_node *node, ir_node *pred);
1063 /** Returns the source language type of a Proj node.
1064 * Must be an atomic type. Mode of type must be mode of node.
1066 ir_type *get_Proj_type(ir_node *node);
1068 /** Return the predecessor of a Proj node. */
1069 ir_node *get_Proj_pred(const ir_node *node);
1070 void set_Proj_pred(ir_node *node, ir_node *pred);
1071 /** Return the projection number of a Proj node. */
1072 long get_Proj_proj(const ir_node *node);
1073 void set_Proj_proj(ir_node *node, long proj);
1076 * Returns non-zero if a node is a routine parameter.
1078 * @param node the Proj node to test
1080 int is_arg_Proj(const ir_node *node);
1082 ir_node **get_Tuple_preds_arr(ir_node *node);
1083 int get_Tuple_n_preds(const ir_node *node);
1084 ir_node *get_Tuple_pred(const ir_node *node, int pos);
1085 void set_Tuple_pred(ir_node *node, int pos, ir_node *pred);
1087 ir_node *get_Id_pred(const ir_node *node);
1088 void set_Id_pred(ir_node *node, ir_node *pred);
1090 /** Confirm has a single result and returns 'value' unchanged.
1091 * The node expresses a restriction on 'value':
1092 * 'value' 'cmp' 'bound' == true. */
1093 ir_node *get_Confirm_value(const ir_node *node);
1094 void set_Confirm_value(ir_node *node, ir_node *value);
1095 ir_node *get_Confirm_bound(const ir_node *node);
1096 void set_Confirm_bound(ir_node *node, ir_node *bound);
1097 pn_Cmp get_Confirm_cmp(const ir_node *node);
1098 void set_Confirm_cmp(ir_node *node, pn_Cmp cmp);
1101 * Mux Support: Note that Psi nodes with one condition can be handled
1102 * like Mux nodes, and the access functions work as expected.
1104 ir_node *get_Mux_sel(const ir_node *node);
1105 void set_Mux_sel(ir_node *node, ir_node *sel);
1106 ir_node *get_Mux_false(const ir_node *node);
1107 void set_Mux_false(ir_node *node, ir_node *ir_false);
1108 ir_node *get_Mux_true(const ir_node *node);
1109 void set_Mux_true(ir_node *node, ir_node *ir_true);
1111 ir_node *get_Psi_cond(const ir_node *node, int pos);
1112 void set_Psi_cond(ir_node *node, int pos, ir_node *cond);
1113 ir_node *get_Psi_val(const ir_node *node, int pos);
1114 void set_Psi_val(ir_node *node, int pos, ir_node *val);
1115 ir_node *get_Psi_default(const ir_node *node);
1116 void set_Psi_default(ir_node *node, ir_node *val);
1117 int get_Psi_n_conds(const ir_node *node);
1120 * Projection numbers for result of CopyB node: use for Proj nodes!
1123 pn_CopyB_M_regular = pn_Generic_M_regular, /**< The memory result. */
1124 pn_CopyB_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1125 pn_CopyB_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1126 pn_CopyB_M_except = pn_Generic_other, /**< The memory result in case the runtime function terminated with
1128 pn_CopyB_max /**< number of projections from a CopyB */
1129 } pn_CopyB; /* Projection numbers for CopyB. */
1130 #define pn_CopyB_M pn_CopyB_M_regular
1132 ir_node *get_CopyB_mem(const ir_node *node);
1133 void set_CopyB_mem(ir_node *node, ir_node *mem);
1134 ir_node *get_CopyB_dst(const ir_node *node);
1135 void set_CopyB_dst(ir_node *node, ir_node *dst);
1136 ir_node *get_CopyB_src(const ir_node *node);
1137 void set_CopyB_src(ir_node *node, ir_node *src);
1138 ir_type *get_CopyB_type(ir_node *node);
1139 void set_CopyB_type(ir_node *node, ir_type *data_type);
1142 * Projection numbers for result of InstOf node: use for Proj nodes!
1145 pn_InstOf_M_regular = pn_Generic_M_regular, /**< The memory result. */
1146 pn_InstOf_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1147 pn_InstOf_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1148 pn_InstOf_res = pn_Generic_other, /**< The checked object pointer. */
1149 pn_InstOf_M_except, /**< The memory result in case the runtime function terminated with
1151 pn_InstOf_max /**< number of projections from an InstOf */
1153 #define pn_InstOf_M pn_InstOf_M_regular
1155 /** InstOf access. */
1156 ir_type *get_InstOf_type(ir_node *node);
1157 void set_InstOf_type(ir_node *node, ir_type *type);
1158 ir_node *get_InstOf_store(const ir_node *node);
1159 void set_InstOf_store(ir_node *node, ir_node *obj);
1160 ir_node *get_InstOf_obj(const ir_node *node);
1161 void set_InstOf_obj(ir_node *node, ir_node *obj);
1164 * Projection numbers for Raise.
1167 pn_Raise_M = pn_Generic_M_regular, /**< The Memory result. */
1168 pn_Raise_X = pn_Generic_X_regular, /**< The control flow to the exception handler. */
1169 pn_Raise_max /**< number of projections from a Raise */
1170 } pn_Raise; /* Projection numbers for Raise. */
1172 ir_node *get_Raise_mem(const ir_node *node);
1173 void set_Raise_mem(ir_node *node, ir_node *mem);
1174 ir_node *get_Raise_exo_ptr(const ir_node *node); /* PoinTeR to EXception Object */
1175 void set_Raise_exo_ptr(ir_node *node, ir_node *exoptr);
1178 * Projection numbers for result of Bound node: use for Proj nodes!
1181 pn_Bound_M = pn_Generic_M_regular, /**< The memory result. */
1182 pn_Bound_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
1183 pn_Bound_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
1184 pn_Bound_res = pn_Generic_other, /**< The checked index. */
1185 pn_Bound_max /**< number of projections from a Bound */
1188 /** Returns the memory input of a Bound operation. */
1189 ir_node *get_Bound_mem(const ir_node *bound);
1190 void set_Bound_mem(ir_node *bound, ir_node *mem);
1192 /** Returns the index input of a Bound operation. */
1193 ir_node *get_Bound_index(const ir_node *bound);
1194 void set_Bound_index(ir_node *bound, ir_node *idx);
1196 /** Returns the lower bound input of a Bound operation. */
1197 ir_node *get_Bound_lower(const ir_node *bound);
1198 void set_Bound_lower(ir_node *bound, ir_node *lower);
1200 /** Returns the upper bound input of a Bound operation. */
1201 ir_node *get_Bound_upper(const ir_node *bound);
1202 void set_Bound_upper(ir_node *bound, ir_node *upper);
1204 /** Return the operand of a Pin node. */
1205 ir_node *get_Pin_op(const ir_node *pin);
1206 void set_Pin_op(ir_node *pin, ir_node *node);
1208 /** A input/output constraint attribute */
1210 unsigned pos; /**< The inputs/output position for this constraint. */
1211 ident *constraint; /**< The constraint for this input/output. */
1212 ir_mode *mode; /**< The mode of the constraint. */
1213 } ir_asm_constraint;
1215 /** Return the assembler text of an ASM pseudo node. */
1216 ident *get_ASM_text(const ir_node *node);
1217 /** Return the number of input constraints for an ASM node. */
1218 int get_ASM_n_input_constraints(const ir_node *node);
1219 /** Return the input constraints for an ASM node. */
1220 const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node);
1221 /** Return the number of output constraints for an ASM node. */
1222 int get_ASM_n_output_constraints(const ir_node *node);
1223 /** Return the output constraints for an ASM node. */
1224 const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node);
1225 /** Return the number of clobbered registers for an ASM node. */
1226 int get_ASM_n_clobbers(const ir_node *node);
1227 /** Return the list of clobbered registers for an ASM node. */
1228 ident **get_ASM_clobbers(const ir_node *node);
1232 * NAME Auxiliary routines
1236 /** Returns operand of node if node is a Proj. */
1237 ir_node *skip_Proj(ir_node *node);
1238 /** Returns operand of node if node is a Proj. */
1239 const ir_node *skip_Proj_const(const ir_node *node);
1240 /** Returns operand of node if node is a Id. */
1241 ir_node *skip_Id(ir_node *node); /* Old name is skip_nop(). */
1242 /** Returns corresponding operand of Tuple if node is a Proj from
1244 ir_node *skip_Tuple(ir_node *node);
1245 /** returns operand of node if node is a Cast. */
1246 ir_node *skip_Cast(ir_node *node);
1247 /** Returns operand of node if node is a Confirm */
1248 ir_node *skip_Confirm(ir_node *node);
1249 /** Skip all high-level Operations (including Cast, Confirm). */
1250 ir_node *skip_HighLevel_ops(ir_node *node);
1251 /** Returns true if irn is a Const node. */
1252 int is_Const(const ir_node *node);
1253 /** Returns true if a node is a Conv node. */
1254 int is_Conv(const ir_node *node);
1255 /** Returns true if a node is a strictConv node. */
1256 int is_strictConv(const ir_node *node);
1257 /** Returns true if a node is a Cast node. */
1258 int is_Cast(const ir_node *node);
1259 /** Returns true if node is a Bad node. */
1260 int is_Bad(const ir_node *node);
1261 /** Returns true if node is a NoMem node. */
1262 int is_NoMem(const ir_node *node);
1263 /** Returns true if node is a Start node. */
1264 int is_Start(const ir_node *node);
1265 /** Returns true if node is a Minus node. */
1266 int is_Minus(const ir_node *node);
1267 /** Returns true if node is a Abs node. */
1268 int is_Abs(const ir_node *node);
1269 /** Returns true if node is a Mod node. */
1270 int is_Mod(const ir_node *node);
1271 /** Returns true if node is a Div node. */
1272 int is_Div(const ir_node *node);
1273 /** Returns true if node is a DivMod node. */
1274 int is_DivMod(const ir_node *node);
1275 /** Returns true if node is a Quot node. */
1276 int is_Quot(const ir_node *node);
1277 /** Returns true if node is an Add node. */
1278 int is_Add(const ir_node *node);
1279 /** Returns true if node is an And node. */
1280 int is_And(const ir_node *node);
1281 /** Returns true if node is an Or node. */
1282 int is_Or(const ir_node *node);
1283 /** Returns true if node is an Eor node. */
1284 int is_Eor(const ir_node *node);
1285 /** Returns true if node is a Sub node. */
1286 int is_Sub(const ir_node *node);
1287 /** Returns true if node is a Not node. */
1288 int is_Not(const ir_node *node);
1289 /** Returns true if node is a Shl node. */
1290 int is_Shl(const ir_node *node);
1291 /** Returns true if node is a Shr node. */
1292 int is_Shr(const ir_node *node);
1293 /** Returns true if node is a Shrs node. */
1294 int is_Shrs(const ir_node *node);
1295 /** Returns true if node is a Rotl node. */
1296 int is_Rotl(const ir_node *node);
1297 /** Returns true if node is a Psi node. */
1298 int is_Psi(const ir_node *node);
1299 /** Returns true if node is an Id node. */
1300 int is_Id(const ir_node *node);
1301 /** Returns true if node is a Tuple node. */
1302 int is_Tuple(const ir_node *node);
1303 /** Returns true if node is a Bound node. */
1304 int is_Bound(const ir_node *node);
1305 /** Returns true if the node is not a Block */
1306 int is_no_Block(const ir_node *node);
1307 /** Returns true if the node is a Block */
1308 int is_Block(const ir_node *node);
1309 /** Returns true if node is an Unknown node. */
1310 int is_Unknown(const ir_node *node);
1311 /** Returns true if node is a Return node. */
1312 int is_Return(const ir_node *node);
1313 /** Returns true if node is a Call node. */
1314 int is_Call(const ir_node *node);
1315 /** Returns true if node is a CallBegin node. */
1316 int is_CallBegin(const ir_node *node);
1317 /** Returns true if node is a Sel node. */
1318 int is_Sel(const ir_node *node);
1319 /** Returns true if node is a Mul node. */
1320 int is_Mul(const ir_node *node);
1321 /** Returns true if node is a Mulh node. */
1322 int is_Mulh(const ir_node *node);
1323 /** Returns true if node is a Mux node or a Psi with only one condition. */
1324 int is_Mux(const ir_node *node);
1325 /** Returns true if node is a Load node. */
1326 int is_Load(const ir_node *node);
1327 /** Returns true if node is a Store node. */
1328 int is_Store(const ir_node *node);
1329 /** Returns true if node is a Sync node. */
1330 int is_Sync(const ir_node *node);
1331 /** Returns true if node is a Confirm node. */
1332 int is_Confirm(const ir_node *node);
1333 /** Returns true if node is a Pin node. */
1334 int is_Pin(const ir_node *node);
1335 /** Returns true if node is a SymConst node. */
1336 int is_SymConst(const ir_node *node);
1337 /** Returns true if node is a SymConst node with kind symconst_addr_ent. */
1338 int is_SymConst_addr_ent(const ir_node *node);
1339 /** Returns true if node is a Cond node. */
1340 int is_Cond(const ir_node *node);
1341 /** Returns true of node is a CopyB node. */
1342 int is_CopyB(const ir_node *node);
1343 /** Returns true if node is a Cmp node. */
1344 int is_Cmp(const ir_node *node);
1345 /** Returns true if node is an Alloc node. */
1346 int is_Alloc(const ir_node *node);
1347 /** Returns true if node is a Free node. */
1348 int is_Free(const ir_node *node);
1349 /** Returns true if a node is a Jmp node. */
1350 int is_Jmp(const ir_node *node);
1351 /** Returns true if a node is a IJmp node. */
1352 int is_IJmp(const ir_node *node);
1353 /** Returns true if a node is a Raise node. */
1354 int is_Raise(const ir_node *node);
1355 /** Returns true if a node is an ASM node. */
1356 int is_ASM(const ir_node *node);
1357 /** Returns true if node is a Proj node or a Filter node in INTRA-procedural view. */
1358 int is_Proj(const ir_node *node);
1359 /** Returns true if node is a Filter node. */
1360 int is_Filter(const ir_node *node);
1362 /** Returns true if the operation manipulates control flow:
1363 Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
1364 int is_cfop(const ir_node *node);
1366 /** Returns true if the operation manipulates interprocedural control flow:
1367 CallBegin, EndReg, EndExcept */
1368 int is_ip_cfop(const ir_node *node);
1369 /** Returns true if the operation can change the control flow because
1370 of an exception: Call, Quot, DivMod, Div, Mod, Load, Store, Alloc,
1371 Bad. Raise is not fragile, but a unconditional jump. */
1372 int is_fragile_op(const ir_node *node);
1373 /** Returns the memory operand of fragile operations. */
1374 ir_node *get_fragile_op_mem(ir_node *node);
1375 /** Returns the result mode of a Div operation. */
1376 ir_mode *get_divop_resmod(const ir_node *node);
1378 /** Returns true if the operation is a forking control flow
1379 * operation: Cond. */
1380 int is_irn_forking(const ir_node *node);
1382 /** Return the type associated with the value produced by n
1383 * if the node remarks this type as it is the case for
1384 * Cast, Const, SymConst and some Proj nodes or unknown_type. */
1385 ir_type *get_irn_type(ir_node *n);
1387 /** Return the type attribute of a node n (SymConst, Call, Alloc, Free,
1389 ir_type *get_irn_type_attr(ir_node *n);
1391 /** Return the entity attribute of a node n (SymConst, Sel) or NULL. */
1392 ir_entity *get_irn_entity_attr(ir_node *n);
1394 /** Returns non-zero for constant-like nodes. */
1395 int is_irn_constlike(const ir_node *node);
1398 * Returns non-zero for nodes that must be always optimized
1399 * (Phi, Id. Proj, Cond, Block, Confirm ...).
1401 int is_irn_always_opt(const ir_node *node);
1404 * Returns non-zero for nodes that are allowed to have keep-alives and
1405 * are neither Block nor PhiM.
1407 int is_irn_keep(const ir_node *node);
1410 * Returns non-zero for nodes that are always placed in the start block.
1412 int is_irn_start_block_placed(const ir_node *node);
1415 * Returns non-zero for nodes that are machine operations.
1417 int is_irn_machine_op(const ir_node *node);
1420 * Returns non-zero for nodes that are machine operands.
1422 int is_irn_machine_operand(const ir_node *node);
1425 * Returns non-zero for nodes that have the n'th user machine flag set.
1427 int is_irn_machine_user(const ir_node *node, unsigned n);
1430 * A type to express conditional jump predictions.
1433 COND_JMP_PRED_NONE, /**< No jump prediction. Default. */
1434 COND_JMP_PRED_TRUE, /**< The True case is predicted. */
1435 COND_JMP_PRED_FALSE /**< The False case is predicted. */
1436 } cond_jmp_predicate;
1438 /** Gets the string representation of the jump prediction .*/
1439 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred);
1441 /** Returns the conditional jump prediction of a Cond node. */
1442 cond_jmp_predicate get_Cond_jmp_pred(const ir_node *cond);
1444 /** Sets a new conditional jump prediction. */
1445 void set_Cond_jmp_pred(ir_node *cond, cond_jmp_predicate pred);
1447 /** Checks whether a node represents a global address. */
1448 int is_Global(const ir_node *node);
1450 /* Returns the entity of a global address. */
1451 ir_entity *get_Global_entity(const ir_node *node);
1454 * Access custom node data.
1455 * The data must have been registered with
1456 * register_additional_node_data() before.
1457 * @param node The ir node to get the data from.
1458 * @param type The type of the data you registered.
1459 * @param off The value returned by register_additional_node_data().
1460 * @return A pointer of type @p type.
1462 #define get_irn_data(node,type,off) \
1463 (assert(off > 0 && "Invalid node data offset"), (type *) ((char *) (node) - (off)))
1466 * Get the pointer to the node some custom data belongs to.
1467 * @param data The pointer to the custom data.
1468 * @param off The number as returned by register_additional_node_data().
1469 * @return A pointer to the ir node the custom data belongs to.
1471 #define get_irn_data_base(data,off) \
1472 (assert(off > 0 && "Invalid node data offset"), (ir_node *) ((char *) (data) + (off)))
1475 * Request additional data to be allocated with an ir node.
1476 * @param size The size of the additional data required.
1477 * @return A positive number, if the operation was successful, which
1478 * must be passed to the access macro get_irn_data(), 0 if the
1479 * registration failed.
1481 unsigned firm_register_additional_node_data(unsigned size);
1484 * Return a pointer to the node attributes.
1485 * Needed for user-defined nodes.
1487 void *get_irn_generic_attr(ir_node *node);
1488 const void *get_irn_generic_attr_const(const ir_node *node);
1491 * Returns the unique node index for the node in its graph.
1492 * This index is used to access phase information for this node.
1494 unsigned get_irn_idx(const ir_node *node);
1497 * Sets the debug information of a node.
1499 * @param n The node.
1500 * @param db The debug info.
1502 void set_irn_dbg_info(ir_node *n, dbg_info *db);
1505 * Returns the debug information of an node.
1507 * @param n The node.
1509 dbg_info *get_irn_dbg_info(const ir_node *n);
1512 * Calculate a hash value of a node. Only inputs, mode and opcode are used.
1514 * @param node the node to hash
1516 unsigned firm_default_hash(const ir_node *node);
1518 /*@}*/ /* end of ir_node group definition */