*
* The common fields are:
*
- * - firm_kind - A firm_kind tag containing k_type. This is useful
- * for dynamically checking whether a node is a ir_node.
* - arity - The number of predecessors in the Firm graph.
* - in - A list with the predecessors in the Firm graph. There are
* routines to access individual elements and to obtain the
* Some projection numbers must be always equal to support automatic phi construction
*/
enum pn_generic {
- pn_Generic_M_regular = 0, /**< The memory result. */
+ pn_Generic_M = 0, /**< The memory result. */
pn_Generic_X_regular = 1, /**< Execution result if no exception occurred. */
pn_Generic_X_except = 2, /**< The control flow result branching to the exception handler */
pn_Generic_other = 3 /**< First free projection number */
/**
* Add a artificial dependency to the node.
* The dependency is only inserted if it is not there already.
+* This is only allowed in phase_backend!
+*
* @param node The node.
* @param dep The dependency target.
+*
* @return The index in the array (get_irn_dep() with that index returns @p dep).
*/
int add_irn_dep(ir_node *node, ir_node *dep);
/**
* Copy all dependencies from a node to another.
+ * This is only allowed in phase_backend!
+ *
* @param tgt The node which should be enriched.
* @param src The node whose dependencies shall be copied.
*/
void set_irn_mode(ir_node *node, ir_mode *mode);
/** Gets the mode struct of a node. */
ir_mode *get_irn_mode(const ir_node *node);
-/** Gets the mode-enum modecode. */
-modecode get_irn_modecode(const ir_node *node);
/** Gets the ident for a string representation of the mode .*/
ident *get_irn_modeident(const ir_node *node);
/** Gets the string representation of the mode .*/
/** If arg is an argument of the node, returns it's position, -1 otherwise */
int get_irn_pred_pos(ir_node *node, ir_node *arg);
/** Gets the visited counter of a node. */
-unsigned long get_irn_visited(const ir_node *node);
+ir_visited_t get_irn_visited(const ir_node *node);
/** Sets the visited counter of a node. */
-void set_irn_visited(ir_node *node, unsigned long visited);
+void set_irn_visited(ir_node *node, ir_visited_t visited);
/** Sets visited to get_irg_visited(current_ir_graph). */
void mark_irn_visited(ir_node *node);
-/** Returns 1 if visited < get_irg_visited(current_ir_graph). */
-int irn_not_visited(const ir_node *node);
/** Returns 1 if visited >= get_irg_visited(current_ir_graph). */
int irn_visited(const ir_node *node);
+/** Returns 1 if visited >= get_irg_visited(current_ir_graph). Marks the node
+ * visited, if it was not. */
+int irn_visited_else_mark(ir_node *node);
/**
* Sets the link of a node.
* get_irn_MacroBlock(). */
ir_node *get_nodes_MacroBlock(const ir_node *node);
-/**
- * @function get_irn_block()
- * @see get_nodes_block()
- */
-
/**
* Projection numbers for result of Start node: use for Proj nodes!
*/
pn_Start_P_tls, /**< Projection on the pointer to the thread local store
segment containing _all_thread local variables. */
pn_Start_T_args, /**< Projection on all arguments. */
- pn_Start_P_value_arg_base, /**< Pointer to region of compound value arguments as defined by
- type of this method. */
pn_Start_max /**< number of projections from a Start */
} pn_Start; /* Projection numbers for Start. */
* from Start. If so returns tls type, else Null. */
ir_type *is_tls_pointer(const ir_node *n);
-/** Test whether arbitrary node is value arg base.
+/** Return the number of control flow predecessors of a block. */
+int get_Block_n_cfgpreds(const ir_node *block);
+/** Return the control flow predecessor of a block at a given position. */
+ir_node *get_Block_cfgpred(const ir_node *block, int pos);
+/** Set the control flow predecessor of a block at a given position. */
+void set_Block_cfgpred(ir_node *block, int pos, ir_node *pred);
+
+/**
+ * Return the position of the predecessor block pred in the inputs
+ * of the block block.
+ *
+ * @param block the block
+ * @param pred a predecessor block of block
*
- * Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
- * from Start. If so returns 1, else 0. */
-int is_value_arg_pointer(const ir_node *n);
-
-/* @@@ no more supported */
-ir_node **get_Block_cfgpred_arr(ir_node *node);
-int get_Block_n_cfgpreds(const ir_node *node);
-ir_node *get_Block_cfgpred(const ir_node *node, int pos);
-void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred);
+ * @return the position of pred in block or -1
+ *
+ * @note When using the old extended basic block form for blocks
+ * with exception exists, a predecessor block might have more
+ * than one position. In that case it is not specified, with is returned.
+ */
+int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred);
+
/** Get the predecessor block.
*
* Returns the block corresponding to the predecessor pos of block.
* We walk from the predecessor to the next pinned node
* (skip_Proj) and return the block that node is in.
* - If we encounter the Bad node, this function does not return
- * Start, but the Bad node.
+ * Start block, but the Bad node.
*/
ir_node *get_Block_cfgpred_block(const ir_node *node, int pos);
-int get_Block_matured(const ir_node *node);
-void set_Block_matured(ir_node *node, int matured);
+
+/** Return the matured flag of a block */
+int get_Block_matured(const ir_node *block);
+/** set the matured flag of a block. */
+void set_Block_matured(ir_node *block, int matured);
/** A visited flag only for block nodes.
* @see also: get_irn_visited() inc_irg_visited() inc_irg_block_visited()*/
-unsigned long get_Block_block_visited(const ir_node *node);
-void set_Block_block_visited(ir_node *node, unsigned long visit);
+ir_visited_t get_Block_block_visited(const ir_node *block);
+void set_Block_block_visited(ir_node *block, ir_visited_t visit);
/**
* Marks a block as dead but do not replace it with a Bad node.
/* For this current_ir_graph must be set. */
void mark_Block_block_visited(ir_node *node);
-int Block_not_block_visited(const ir_node *node);
int Block_block_visited(const ir_node *node);
#ifdef INTERPROCEDURAL_VIEW
ir_node *get_irn_MacroBlock(const ir_node *n);
/** Returns the ir_graph this Block belongs to. */
ir_graph *get_Block_irg(const ir_node *block);
-/** Returns non-zero if the block has an assigned label. */
-int has_Block_label(const ir_node *block);
-/** Returns the label of a Block. */
-ir_label_t get_Block_label(const ir_node *block);
-/** Sets a label to a block. */
-void set_Block_label(ir_node *block, ir_label_t label);
+/** Returns non-zero if the block has an entity assigned */
+int has_Block_entity(const ir_node *block);
+/** Returns the entity for a Block */
+ir_entity *get_Block_entity(const ir_node *block);
+/** Returns the entity for a Block (creating it if necessary) */
+ir_entity *create_Block_entity(ir_node *block);
+/** Set a new entity for a block */
+void set_Block_entity(ir_node *block, ir_entity *entity);
/** Gets the head of the Phi list for this block. */
ir_node *get_Block_phis(const ir_node *block);
/** Sets the head of the Phi list for this block. */
void add_End_keepalive(ir_node *end, ir_node *ka);
/** Set the Keep alive node at position pos. */
void set_End_keepalive(ir_node *end, int pos, ir_node *ka);
-/** Set new keep-alives. */
+
+/**
+ * Set new keep-alives.
+ * Beware: This might be an expensive operation if dynamic edges are enabled,
+ * so avoid it in the backend.
+ */
void set_End_keepalives(ir_node *end, int n, ir_node *in[]);
-/** Set new keep-alives from old keep-alives, skipping irn. */
+
+/** Remove irn from the keep-alive set. */
void remove_End_keepalive(ir_node *end, ir_node *irn);
+/* Remove Bads, NoMem and doublets from the keep-alive set. */
+void remove_End_Bads_and_doublets(ir_node *end);
+
/** Some parts of the End node are allocated separately -- their memory
is not recovered by dead_node_elimination if a End node is dead.
free_End() frees these data structures. */
Proj nodes mean default control flow, i.e., Proj(n). */
} cond_kind;
+/** Gets the string representation of the Cond node kind. */
+const char *get_cond_kind_name(cond_kind kind);
+
ir_node *get_Cond_selector(const ir_node *node);
void set_Cond_selector(ir_node *node, ir_node *selector);
cond_kind get_Cond_kind(const ir_node *node);
void set_Cond_kind(ir_node *node, cond_kind kind);
-long get_Cond_defaultProj(const ir_node *node);
+long get_Cond_default_proj(const ir_node *node);
+void set_Cond_default_proj(ir_node *node, long defproj);
/**
* Projection numbers for conditions.
/** Sets the source language type of a Const node. */
void set_Const_type(ir_node *node, ir_type *tp);
-/** This enum names the three different kinds of symbolic Constants
- represented by SymConst. The content of the attribute type_or_id
- depends on this tag. Use the proper access routine after testing
- this flag. */
-typedef enum {
- symconst_type_tag, /**< The SymConst is a type tag for the given type.
- symconst_symbol is type *. */
- symconst_type_size, /**< The SymConst is the size of the given type.
- symconst_symbol is type *. */
- symconst_type_align, /**< The SymConst is the alignment of the given type.
- symconst_symbol is type *. */
- symconst_addr_name, /**< The SymConst is a symbolic pointer to be filled in
- by the linker. The pointer is represented by a string.
- symconst_symbol is ident *. */
- symconst_addr_ent, /**< The SymConst is a symbolic pointer to be filled in
- by the linker. The pointer is represented by an entity.
- symconst_symbol is entity *. */
- symconst_ofs_ent, /**< The SymConst is the offset of its entity in the entities
- owner type. */
- symconst_enum_const, /**< The SymConst is a enumeration constant of an
- enumeration type. */
- symconst_label /**< The SymConst is a label address. */
-} symconst_kind;
-
/** Returns non-zero if s symconst kind has a type attribute */
#define SYMCONST_HAS_TYPE(kind) ((kind) <= symconst_type_align)
/** Returns non-zero if s symconst kind has an enum_const attribute */
#define SYMCONST_HAS_ENUM(kind) ((kind) == symconst_enum_const)
-/** Returns non-zero if s symconst kind has a label attribute */
-#define SYMCONST_HAS_LABEL(kind) ((kind) == symconst_label)
-
-/** SymConst attribute.
- *
- * This union contains the symbolic information represented by the node.
- */
-typedef union symconst_symbol {
- ir_type *type_p; /**< The type of a SymConst. */
- ident *ident_p; /**< The ident of a SymConst. */
- ir_entity *entity_p; /**< The entity of a SymConst. */
- ir_enum_const *enum_p; /**< The enumeration constant of a SymConst. */
- ir_label_t label; /**< The label of a SymConst. */
-} symconst_symbol;
-
/** Get the kind of the SymConst. */
symconst_kind get_SymConst_kind(const ir_node *node);
/** Set the kind of the SymConst. */
void set_SymConst_kind(ir_node *node, symconst_kind num);
/** Only to access SymConst of kind type_tag or size. Else assertion: */
-ir_type *get_SymConst_type(ir_node *node);
+ir_type *get_SymConst_type(const ir_node *node);
void set_SymConst_type(ir_node *node, ir_type *tp);
/** Only to access SymConst of kind addr_name. Else assertion: */
void set_SymConst_symbol(ir_node *node,
union symconst_symbol sym);
-/** Only to access SymConst of kind symconst_label. Else assertion: */
-ir_label_t get_SymConst_label(const ir_node *node);
-void set_SymConst_label(ir_node *node, ir_label_t label);
-
-
/** Access the type of the value represented by the SymConst.
*
* Example: primitive type int for SymConst size. */
* Projection numbers for result of Call node: use for Proj nodes!
*/
typedef enum {
- pn_Call_M_regular = pn_Generic_M_regular, /**< The memory result. */
+ pn_Call_M = pn_Generic_M, /**< The memory result. */
pn_Call_X_regular = pn_Generic_X_regular, /**< The control flow result when no exception occurs. */
pn_Call_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler. */
pn_Call_T_result = pn_Generic_other, /**< The tuple containing all (0, 1, 2, ...) results. */
- pn_Call_M_except, /**< The memory result in case the called method terminated with
- an exception. */
pn_Call_P_value_res_base, /**< A pointer to the memory region containing copied results
passed by value (for compound result types). */
pn_Call_max /**< number of projections from a Call */
} pn_Call; /* Projection numbers for Call. */
-#define pn_Call_M pn_Call_M_regular
+/** Retrieve the memory input of a Call. */
ir_node *get_Call_mem(const ir_node *node);
+/** Set the memory input of a Call. */
void set_Call_mem(ir_node *node, ir_node *mem);
+/** Retrieve the call address of a Call. */
ir_node *get_Call_ptr(const ir_node *node);
+/** Set the call address of a Call. */
void set_Call_ptr(ir_node *node, ir_node *ptr);
ir_node **get_Call_param_arr(ir_node *node);
/** Gets the number of parameters of a call. */
ir_type *get_Call_type(ir_node *node);
/** Sets the type of a call. */
void set_Call_type(ir_node *node, ir_type *tp);
-/** Gets the arity of a call. Identical to get_Call_n_params(). */
-int get_Call_arity(const ir_node *node);
+/** Returns non-zero if this call can be a tail-call. */
+unsigned get_Call_tail_call(const ir_node *node);
+/** Sets the tail call attribute. */
+void set_Call_tail_call(ir_node *node, unsigned tail_call);
+
+/**
+ * Returns non-zero if a Call is surely a self-recursive Call.
+ * Beware: if this functions returns 0, the call might be self-recursive!
+ */
+int is_self_recursive_Call(const ir_node *call);
/** Set, get and remove the callee information for a Call node.
*
void set_Call_callee_arr(ir_node *node, const int n, ir_entity **arr);
void remove_Call_callee_arr(ir_node *node);
+/**
+ * Projection numbers for result of Builtin node: use for Proj nodes!
+ */
+typedef enum {
+ pn_Builtin_M = pn_Generic_M, /**< The memory result. */
+ pn_Builtin_1_result = pn_Generic_other, /**< first result. */
+ pn_Builtin_max /**< number of projections from a Builtin */
+} pn_Builtin; /* Projection numbers for Builtin. */
+
+ir_node *get_Builtin_mem(const ir_node *node);
+void set_Builtin_mem(ir_node *node, ir_node *mem);
+ir_builtin_kind get_Builtin_kind(const ir_node *node);
+void set_Builtin_kind(ir_node *node, ir_builtin_kind kind);
+ir_node **get_Builtin_param_arr(ir_node *node);
+/** Gets the number of parameters of a Builtin. */
+int get_Builtin_n_params(const ir_node *node);
+/** Gets the Builtin parameter at position pos. */
+ir_node *get_Builtin_param(const ir_node *node, int pos);
+/** Sets the Builtin parameter at position pos. */
+void set_Builtin_param(ir_node *node, int pos, ir_node *param);
+/** Gets the type of a builtin. */
+ir_type *get_Builtin_type(ir_node *node);
+/** Sets the type of a Builtin. */
+void set_Builtin_type(ir_node *node, ir_type *tp);
+/** Returns a human readable string for the ir_builtin_kind. */
+const char *get_builtin_kind_name(ir_builtin_kind kind);
+
+/** Retrieve the call address of a CallBegin. */
ir_node *get_CallBegin_ptr(const ir_node *node);
+/** Set the call address of a CallBegin. */
void set_CallBegin_ptr(ir_node *node, ir_node *ptr);
+/** Retrieve the original Call node of a CallBegin. */
ir_node *get_CallBegin_call(const ir_node *node);
+/** Set the original Call node of a CallBegin. */
void set_CallBegin_call(ir_node *node, ir_node *call);
/* For unary and binary arithmetic operations the access to the
second arithmetic value as listed in tech report 1999-44.
unops are: Minus, Abs, Not, Conv, Cast
binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
- Shr, Shrs, Rot, Cmp */
+ Shr, Shrs, Rotl, Cmp */
int is_unop(const ir_node *node);
ir_node *get_unop_op(const ir_node *node);
void set_unop_op(ir_node *node, ir_node *op);
ir_node *get_Add_right(const ir_node *node);
void set_Add_right(ir_node *node, ir_node *right);
+ir_node *get_Carry_left(const ir_node *node);
+void set_Carry_left(ir_node *node, ir_node *left);
+ir_node *get_Carry_right(const ir_node *node);
+void set_Carry_right(ir_node *node, ir_node *right);
+
+ir_node *get_Borrow_left(const ir_node *node);
+void set_Borrow_left(ir_node *node, ir_node *left);
+ir_node *get_Borrow_right(const ir_node *node);
+void set_Borrow_right(ir_node *node, ir_node *right);
+
ir_node *get_Sub_left(const ir_node *node);
void set_Sub_left(ir_node *node, ir_node *left);
ir_node *get_Sub_right(const ir_node *node);
* Projection numbers for Quot: use for Proj nodes!
*/
typedef enum {
- pn_Quot_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Quot_M = pn_Generic_M, /**< Memory result. */
pn_Quot_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Quot_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Quot_res = pn_Generic_other, /**< Result of computation. */
* Projection numbers for DivMod: use for Proj nodes!
*/
typedef enum {
- pn_DivMod_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_DivMod_M = pn_Generic_M, /**< Memory result. */
pn_DivMod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_DivMod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_DivMod_res_div = pn_Generic_other, /**< Result of computation a / b. */
void set_Div_mem(ir_node *node, ir_node *mem);
ir_mode *get_Div_resmode(const ir_node *node);
void set_Div_resmode(ir_node *node, ir_mode *mode);
-int is_Div_remainderless(const ir_node *node);
+int get_Div_no_remainder(const ir_node *node);
+void set_Div_no_remainder(ir_node *node, int no_remainder);
/**
* Projection numbers for Div: use for Proj nodes!
*/
typedef enum {
- pn_Div_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Div_M = pn_Generic_M, /**< Memory result. */
pn_Div_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Div_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Div_res = pn_Generic_other, /**< Result of computation. */
* Projection numbers for Mod: use for Proj nodes!
*/
typedef enum {
- pn_Mod_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Mod_M = pn_Generic_M, /**< Memory result. */
pn_Mod_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Mod_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Mod_res = pn_Generic_other, /**< Result of computation. */
ir_node *get_Not_op(const ir_node *node);
void set_Not_op(ir_node *node, ir_node *op);
-/**
- * Projection numbers for Cmp are defined several times.
- * The bit patterns are used for various tests, so don't change.
- * The "unordered" values are possible results of comparing
- * floating point numbers.
- * Note that the encoding is imported, so do NOT change the order.
- */
-typedef enum {
- pn_Cmp_False = 0, /**< false */
- pn_Cmp_Eq = 1, /**< equal */
- pn_Cmp_Lt = 2, /**< less */
- pn_Cmp_Le = pn_Cmp_Eq|pn_Cmp_Lt, /**< less or equal */
- pn_Cmp_Gt = 4, /**< greater */
- pn_Cmp_Ge = pn_Cmp_Eq|pn_Cmp_Gt, /**< greater or equal */
- pn_Cmp_Lg = pn_Cmp_Lt|pn_Cmp_Gt, /**< less or greater */
- pn_Cmp_Leg = pn_Cmp_Lt|pn_Cmp_Eq|pn_Cmp_Gt, /**< less, equal or greater = ordered */
- pn_Cmp_Uo = 8, /**< unordered */
- pn_Cmp_Ue = pn_Cmp_Uo|pn_Cmp_Eq, /**< unordered or equal */
- pn_Cmp_Ul = pn_Cmp_Uo|pn_Cmp_Lt, /**< unordered or less */
- pn_Cmp_Ule = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Lt, /**< unordered, less or equal */
- pn_Cmp_Ug = pn_Cmp_Uo|pn_Cmp_Gt, /**< unordered or greater */
- pn_Cmp_Uge = pn_Cmp_Uo|pn_Cmp_Eq|pn_Cmp_Gt, /**< unordered, greater or equal */
- pn_Cmp_Ne = pn_Cmp_Uo|pn_Cmp_Lt|pn_Cmp_Gt, /**< unordered, less or greater = not equal */
- pn_Cmp_True = 15 /**< true */
- /* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for JNI interface */
-} pn_Cmp; /* Projection numbers for Cmp */
-/* #define not_mask pn_Cmp_Leg */
-
/** returns the pnc name from an pnc constant */
const char *get_pnc_string(int pnc);
ir_node *get_Shrs_right(const ir_node *node);
void set_Shrs_right(ir_node *node, ir_node *right);
-ir_node *get_Rot_left(const ir_node *node);
-void set_Rot_left(ir_node *node, ir_node *left);
-ir_node *get_Rot_right(const ir_node *node);
-void set_Rot_right(ir_node *node, ir_node *right);
+ir_node *get_Rotl_left(const ir_node *node);
+void set_Rotl_left(ir_node *node, ir_node *left);
+ir_node *get_Rotl_right(const ir_node *node);
+void set_Rotl_right(ir_node *node, ir_node *right);
ir_node *get_Conv_op(const ir_node *node);
void set_Conv_op(ir_node *node, ir_node *op);
int is_Cast_downcast(ir_node *node);
-/** Returns true if n is Phi or Filter in interprocedural_view.
- Returns false if irg in phase building and the Phi has zero
+/** Returns true if n is a Phi or a Filter node in INTER-procedural view.
+ Returns false if irg is in phase phase_building and the Phi has zero
predecessors: it's a Phi0. */
int is_Phi(const ir_node *n);
-/** Returns true if irg in phase building and the Phi has zero
+/** Returns true if irg in phase phase_building and the Phi has zero
predecessors. It's a Phi0 then. */
int is_Phi0(const ir_node *n);
-/* These routines also work for Filter nodes in interprocedural view. */
+/* These routines also work for Filter nodes in INTER-procedural view. */
ir_node **get_Phi_preds_arr(ir_node *node);
int get_Phi_n_preds(const ir_node *node);
ir_node *get_Phi_pred(const ir_node *node, int pos);
* Projection numbers for Load: use for Proj nodes!
*/
typedef enum {
- pn_Load_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Load_M = pn_Generic_M, /**< Memory result. */
pn_Load_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Load_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Load_res = pn_Generic_other, /**< Result of load operation. */
* Projection numbers for Store: use for Proj nodes!
*/
typedef enum {
- pn_Store_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Store_M = pn_Generic_M, /**< Memory result. */
pn_Store_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Store_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Store_max = pn_Generic_other /**< number of projections from a Store */
* Projection numbers for Alloc: use for Proj nodes!
*/
typedef enum {
- pn_Alloc_M = pn_Generic_M_regular, /**< Memory result. */
+ pn_Alloc_M = pn_Generic_M, /**< Memory result. */
pn_Alloc_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Alloc_X_except = pn_Generic_X_except, /**< Execution result if exception occurred. */
pn_Alloc_res = pn_Generic_other, /**< Result of allocation. */
ir_type *get_Alloc_type(ir_node *node);
void set_Alloc_type(ir_node *node, ir_type *tp);
-/** The allocation place. */
-typedef enum {
- stack_alloc, /**< Alloc allocates the object on the stack. */
- heap_alloc /**< Alloc allocates the object on the heap. */
-} ir_where_alloc;
-
ir_where_alloc get_Alloc_where(const ir_node *node);
void set_Alloc_where(ir_node *node, ir_where_alloc where);
long get_Proj_proj(const ir_node *node);
void set_Proj_proj(ir_node *node, long proj);
+/**
+ * Returns non-zero if a node is a routine parameter.
+ *
+ * @param node the Proj node to test
+ */
+int is_arg_Proj(const ir_node *node);
+
ir_node **get_Tuple_preds_arr(ir_node *node);
int get_Tuple_n_preds(const ir_node *node);
ir_node *get_Tuple_pred(const ir_node *node, int pos);
void set_Confirm_cmp(ir_node *node, pn_Cmp cmp);
/*
- * Mux Support: Note that Psi nodes with one condition can be handled
- * like Mux nodes, and the access functions work as expected.
+ * Mux Support
*/
ir_node *get_Mux_sel(const ir_node *node);
void set_Mux_sel(ir_node *node, ir_node *sel);
ir_node *get_Mux_true(const ir_node *node);
void set_Mux_true(ir_node *node, ir_node *ir_true);
-ir_node *get_Psi_cond(const ir_node *node, int pos);
-void set_Psi_cond(ir_node *node, int pos, ir_node *cond);
-ir_node *get_Psi_val(const ir_node *node, int pos);
-void set_Psi_val(ir_node *node, int pos, ir_node *val);
-ir_node *get_Psi_default(const ir_node *node);
-void set_Psi_default(ir_node *node, ir_node *val);
-int get_Psi_n_conds(const ir_node *node);
-
/**
* Projection numbers for result of CopyB node: use for Proj nodes!
*/
typedef enum {
- pn_CopyB_M_regular = pn_Generic_M_regular, /**< The memory result. */
+ pn_CopyB_M_regular = pn_Generic_M, /**< The memory result. */
pn_CopyB_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_CopyB_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
- pn_CopyB_M_except = pn_Generic_other, /**< The memory result in case the runtime function terminated with
- an exception */
- pn_CopyB_max /**< number of projections from a CopyB */
+ pn_CopyB_max = pn_Generic_other /**< number of projections from a CopyB */
} pn_CopyB; /* Projection numbers for CopyB. */
#define pn_CopyB_M pn_CopyB_M_regular
* Projection numbers for result of InstOf node: use for Proj nodes!
*/
typedef enum {
- pn_InstOf_M_regular = pn_Generic_M_regular, /**< The memory result. */
+ pn_InstOf_M_regular = pn_Generic_M, /**< The memory result. */
pn_InstOf_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_InstOf_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
pn_InstOf_res = pn_Generic_other, /**< The checked object pointer. */
- pn_InstOf_M_except, /**< The memory result in case the runtime function terminated with
- an exception */
pn_InstOf_max /**< number of projections from an InstOf */
} pn_InstOf;
#define pn_InstOf_M pn_InstOf_M_regular
-/** InstOf access */
+/** InstOf access. */
ir_type *get_InstOf_type(ir_node *node);
void set_InstOf_type(ir_node *node, ir_type *type);
ir_node *get_InstOf_store(const ir_node *node);
* Projection numbers for Raise.
*/
typedef enum {
- pn_Raise_M = pn_Generic_M_regular, /**< The Memory result. */
+ pn_Raise_M = pn_Generic_M, /**< The Memory result. */
pn_Raise_X = pn_Generic_X_regular, /**< The control flow to the exception handler. */
pn_Raise_max /**< number of projections from a Raise */
} pn_Raise; /* Projection numbers for Raise. */
* Projection numbers for result of Bound node: use for Proj nodes!
*/
typedef enum {
- pn_Bound_M = pn_Generic_M_regular, /**< The memory result. */
+ pn_Bound_M = pn_Generic_M, /**< The memory result. */
pn_Bound_X_regular = pn_Generic_X_regular, /**< Execution result if no exception occurred. */
pn_Bound_X_except = pn_Generic_X_except, /**< The control flow result branching to the exception handler */
pn_Bound_res = pn_Generic_other, /**< The checked index. */
/** Return the operand of a Pin node. */
ir_node *get_Pin_op(const ir_node *pin);
-void set_Pin_op(ir_node *pin, ir_node *node);
-
-/** A input/output constraint attribute */
-typedef struct {
- unsigned pos; /**< The inputs/output position for this constraint. */
- ident *constraint; /**< The constraint for this input/output. */
- ir_mode *mode; /**< The mode of the constraint. */
-} ir_asm_constraint;
+void set_Pin_op(ir_node *pin, ir_node *node);
/** Return the assembler text of an ASM pseudo node. */
ident *get_ASM_text(const ir_node *node);
/** Returns corresponding operand of Tuple if node is a Proj from
a Tuple. */
ir_node *skip_Tuple(ir_node *node);
-/** returns operand of node if node is a Cast. */
+/** Returns operand of node if node is a Cast. */
ir_node *skip_Cast(ir_node *node);
+const ir_node *skip_Cast_const(const ir_node *node);
+/** Returns operand of node if node is a Pin. */
+ir_node *skip_Pin(ir_node *node);
/** Returns operand of node if node is a Confirm */
ir_node *skip_Confirm(ir_node *node);
/** Skip all high-level Operations (including Cast, Confirm). */
int is_Quot(const ir_node *node);
/** Returns true if node is an Add node. */
int is_Add(const ir_node *node);
+/** Returns true if node is a Carry node. */
+int is_Carry(const ir_node *node);
/** Returns true if node is an And node. */
int is_And(const ir_node *node);
/** Returns true if node is an Or node. */
int is_Shr(const ir_node *node);
/** Returns true if node is a Shrs node. */
int is_Shrs(const ir_node *node);
-/** Returns true if node is a Rot node. */
-int is_Rot(const ir_node *node);
-/** Returns true if node is a Psi node. */
-int is_Psi(const ir_node *node);
+/** Returns true if node is a Rotl node. */
+int is_Rotl(const ir_node *node);
+/** Returns true if node is an Id node. */
+int is_Id(const ir_node *node);
/** Returns true if node is a Tuple node. */
int is_Tuple(const ir_node *node);
/** Returns true if node is a Bound node. */
int is_Return(const ir_node *node);
/** Returns true if node is a Call node. */
int is_Call(const ir_node *node);
+/** Returns true if node is a Builtin node. */
+int is_Builtin(const ir_node *node);
+/** Returns true if node is a CallBegin node. */
+int is_CallBegin(const ir_node *node);
/** Returns true if node is a Sel node. */
int is_Sel(const ir_node *node);
/** Returns true if node is a Mul node. */
int is_Mul(const ir_node *node);
/** Returns true if node is a Mulh node. */
int is_Mulh(const ir_node *node);
-/** Returns true if node is a Mux node or a Psi with only one condition. */
+/** Returns true if node is a Mux node. */
int is_Mux(const ir_node *node);
/** Returns true if node is a Load node. */
int is_Load(const ir_node *node);
int is_SymConst_addr_ent(const ir_node *node);
/** Returns true if node is a Cond node. */
int is_Cond(const ir_node *node);
-/** Returns true of node is a CopyB node */
+/** Returns true of node is a CopyB node. */
int is_CopyB(const ir_node *node);
/** Returns true if node is a Cmp node. */
int is_Cmp(const ir_node *node);
-/** Returns true if node is an Alloc node */
+/** Returns true if node is an Alloc node. */
int is_Alloc(const ir_node *node);
-/** Returns true if a node is a Jmp node */
+/** Returns true if node is a Free node. */
+int is_Free(const ir_node *node);
+/** Returns true if a node is a Jmp node. */
int is_Jmp(const ir_node *node);
-/** Returns true if a node is a Raise node */
+/** Returns true if a node is a IJmp node. */
+int is_IJmp(const ir_node *node);
+/** Returns true if a node is a Raise node. */
int is_Raise(const ir_node *node);
-/** Returns true if a node is an ASM node */
+/** Returns true if a node is an ASM node. */
int is_ASM(const ir_node *node);
-/** Returns true if node is a Proj node or a Filter node in
- * intraprocedural view */
+/** Returns true if a node is an Dummy node. */
+int is_Dummy(const ir_node *node);
+/** Returns true if node is a Proj node or a Filter node in INTRA-procedural view. */
int is_Proj(const ir_node *node);
+/** Returns true if node is a Filter node. */
+int is_Filter(const ir_node *node);
+
/** Returns true if the operation manipulates control flow:
Start, End, Jmp, Cond, Return, Raise, Bad, CallBegin, EndReg, EndExcept */
int is_cfop(const ir_node *node);
* operation: Cond. */
int is_irn_forking(const ir_node *node);
+/**
+ * Copies all attributes stored in the old node to the new node.
+ * Assumes both have the same opcode and sufficient size.
+ */
+void copy_node_attr(const ir_node *old_node, ir_node *new_node);
+
/** Return the type associated with the value produced by n
* if the node remarks this type as it is the case for
* Cast, Const, SymConst and some Proj nodes or unknown_type. */
COND_JMP_PRED_FALSE /**< The False case is predicted. */
} cond_jmp_predicate;
-/** Gets the string representation of the jump prediction .*/
+/** Gets the string representation of the jump prediction. */
const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred);
/** Returns the conditional jump prediction of a Cond node. */
*/
dbg_info *get_irn_dbg_info(const ir_node *n);
-/*-----------------------------------------------------------------*/
-/** Debug aides **/
-/*-----------------------------------------------------------------*/
-
-
-/** Debug print the node.
+/**
+ * Calculate a hash value of a node. Only inputs, mode and opcode are used.
*
- * Writes the node, all its attributes and the predecessors to stdout if DEBUG_libfirm
- * is set. Else does nothing. */
-void dump_irn(const ir_node *n);
+ * @param node the node to hash
+ */
+unsigned firm_default_hash(const ir_node *node);
+
+/**
+ * returns a descriptive name of a node (containing type+number)
+ */
+const char *gdb_node_helper(void *firm_object);
/*@}*/ /* end of ir_node group definition */
projects / libfirm / blobdiff