X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firopt_t.h;h=effa924e3e43f6ec8d2c80812b53c9c6c544cad7;hb=3c3425a50a1d721b74a015c6812257e32feeac85;hp=1aee93b75a7db7e0b9cbdad07f4dd7fec9c641f2;hpb=ab182d4b9ed44239ab3ff1d08b2f8e14a3699ccf;p=libfirm diff --git a/ir/ir/iropt_t.h b/ir/ir/iropt_t.h index 1aee93b75..effa924e3 100644 --- a/ir/ir/iropt_t.h +++ b/ir/ir/iropt_t.h @@ -21,7 +21,6 @@ * @file * @brief iropt --- optimizations intertwined with IR construction -- private header. * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck - * @version $Id$ */ #ifndef FIRM_IR_IROPT_T_H #define FIRM_IR_IROPT_T_H @@ -52,21 +51,20 @@ ir_node *equivalent_node(ir_node *n); /** * Creates a new value table used for storing CSE identities. * The value table is used to identify common expressions. - * */ -pset *new_identities(void); +void new_identities(ir_graph *irg); /** * Deletes a identities value table. * * @param value_table the identity set */ -void del_identities(pset *value_table); +void del_identities(ir_graph *irg); /** * Add a node to the identities value table. */ -void add_identities(pset *value_table, ir_node *node); +void add_identities(ir_node *node); /** * Compare function for two nodes in the hash table. Gets two @@ -79,7 +77,7 @@ int identities_cmp(const void *elt, const void *key); * Looks up the node in a hash table, enters it in the table * if it isn't there yet. */ -ir_node *identify_remember(pset *value_table, ir_node *n); +ir_node *identify_remember(ir_node *n); /** Visit each node in the value table of a graph. */ void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env); @@ -102,7 +100,7 @@ ir_node *optimize_in_place_2(ir_node *n); * returning tarval_bad otherwise. * No calculations are done here, just a lookup. */ -typedef tarval *(*value_of_func)(const ir_node *self); +typedef ir_tarval *(*value_of_func)(const ir_node *self); extern value_of_func value_of_ptr; @@ -116,52 +114,30 @@ void set_value_of_func(value_of_func func); /** * Returns the associated tarval of a node. */ -static inline tarval *value_of(const ir_node *n) +static inline ir_tarval *value_of(const ir_node *n) { return value_of_ptr(n); } /** - * Sets the default operations for an ir_op_ops. - * - * @param code the opcode for the default operation - * @param ops the operations initialized - * - * @return - * The operations. + * returns true if a value becomes zero when converted to mode @p mode */ -ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops); - -/** - * Returns true if a == -b - */ -bool is_negated_value(ir_node *a, ir_node *b); - +bool ir_zero_when_converted(const ir_node *node, ir_mode *dest_mode); +int ir_mux_is_abs(const ir_node *sel, const ir_node *mux_false, + const ir_node *mux_true); -/** NOTE: Survive DCE is considered a bad hack - don't use */ -typedef struct survive_dce_t survive_dce_t; +ir_node *ir_get_abs_op(const ir_node *sel, ir_node *mux_false, + ir_node *mux_true); /** - * Make a new Survive DCE environment. - * NOTE: Survive DCE is considered a bad hack - don't use + * return true if the Mux node will be optimized away. This can be used for + * the if-conversion callback. Allowing these Muxes should be always safe, even + * if the backend cannot handle them. */ -survive_dce_t *new_survive_dce(void); +bool ir_is_optimizable_mux(const ir_node *sel, const ir_node *mux_false, + const ir_node *mux_true); -/** - * Free a Survive DCE environment. - * NOTE: Survive DCE is considered a bad hack - don't use - */ -void free_survive_dce(survive_dce_t *sd); - -/** - * Register a node pointer to be patched upon DCE. - * When DCE occurs, the node pointer specified by @p place will be - * patched to the new address of the node it is pointing to. - * - * @param sd The Survive DCE environment. - * @param place The address of the node pointer. - */ -void survive_dce_register_irn(survive_dce_t *sd, ir_node **place); +void ir_register_opt_node_ops(void); #endif