X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Firnode.h;h=d6638633d267f98aeb393b39a30d326aa3b19889;hb=fa9c992b5f23e7a059ac91fdd04b409b951ebcc4;hp=3e7f8a44b0e8955c26936a778a0177f4eab70e4b;hpb=077eace885a7e700b3189f8d65acd04e689d4292;p=libfirm diff --git a/include/libfirm/irnode.h b/include/libfirm/irnode.h index 3e7f8a44b..d6638633d 100644 --- a/include/libfirm/irnode.h +++ b/include/libfirm/irnode.h @@ -118,14 +118,19 @@ ir_node *get_irn_n(const ir_node *node, int n); /** * 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. */ @@ -199,9 +204,9 @@ ident *get_irn_opident(const ir_node *node); /** 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). */ @@ -358,8 +363,8 @@ void set_Block_matured(ir_node *node, 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 *node); +void set_Block_block_visited(ir_node *node, ir_visited_t visit); /** * Marks a block as dead but do not replace it with a Bad node. @@ -370,7 +375,6 @@ int is_Block_dead(const ir_node *block); /* 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 @@ -427,9 +431,15 @@ ir_node *get_End_keepalive(const ir_node *end, int pos); 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); /** Some parts of the End node are allocated separately -- their memory @@ -567,7 +577,7 @@ symconst_kind get_SymConst_kind(const ir_node *node); 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: */ @@ -645,6 +655,12 @@ 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 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. * * The callee information lists all method entities that can be called @@ -682,7 +698,7 @@ void set_CallBegin_call(ir_node *node, ir_node *call); 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); @@ -697,6 +713,11 @@ void set_Add_left(ir_node *node, ir_node *left); 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_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); @@ -878,10 +899,10 @@ void set_Shrs_left(ir_node *node, ir_node *left); 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); @@ -1055,6 +1076,13 @@ void set_Proj_pred(ir_node *node, ir_node *pred); 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); @@ -1074,8 +1102,7 @@ pn_Cmp get_Confirm_cmp(const ir_node *node); 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); @@ -1084,14 +1111,6 @@ void set_Mux_false(ir_node *node, ir_node *ir_false); 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! */ @@ -1218,8 +1237,11 @@ ir_node *skip_Id(ir_node *node); /* Old name is skip_nop(). */ /** 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). */ @@ -1252,6 +1274,8 @@ int is_DivMod(const ir_node *node); 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. */ @@ -1268,10 +1292,8 @@ int is_Shl(const ir_node *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. */ @@ -1296,7 +1318,7 @@ int is_Sel(const ir_node *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); @@ -1484,16 +1506,12 @@ void set_irn_dbg_info(ir_node *n, dbg_info *db); */ 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); /*@}*/ /* end of ir_node group definition */