X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firopt_t.h;h=ca1ad64a5d741ca848e8ea84d38c7023d34fd00b;hb=eda9d668d0e8c8246015b4c5e743316a6a835a23;hp=2c4b369aa0130aa0f836111f77887524db406a42;hpb=f4ae1b7b653bcd43b99bc81b40425ab595a0dc7d;p=libfirm diff --git a/ir/ir/iropt_t.h b/ir/ir/iropt_t.h index 2c4b369aa..ca1ad64a5 100644 --- a/ir/ir/iropt_t.h +++ b/ir/ir/iropt_t.h @@ -1,27 +1,106 @@ -/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** -** Declarations for optimizations intertwined with IR construction. -*/ +/* + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ -/* $Id$ */ +/** + * @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 -# ifndef _IROPT_T_H_ -# define _IROPT_T_H_ +#include "iropt.h" +#include "irnode_t.h" +#include "pset.h" +#include "tv.h" -# include "pset.h" -# include "iropt.h" +ir_node *equivalent_node(ir_node *n); -ir_node *equivalent_node (ir_node *n); +/** + * Calculate a hash value of a node. + * The hash value is calculated from the nodes predecessors. + * Special handling for Const and SymConst nodes (these don't have predecessors). + * + * @param node The IR-node + */ +unsigned ir_node_hash(ir_node *node); -/* For cse */ -pset *new_identities (void); -void del_identities (pset *value_table); -void add_identity (pset *value_table, ir_node *node); +/** + * Creates a new value table used for storing CSE identities. + * The value table is used to identify common expressions. + * + */ +pset *new_identities(void); -ir_node *optimize_in_place_2 (ir_node *n); +/** + * Deletes a identities value table. + * + * @param value_table the identity set + */ +void del_identities(pset *value_table); +/** + * Add a node to the identities value table. + */ +void add_identities(pset *value_table, ir_node *node); -# endif /* _IROPT_T_H_ */ +/** + * Compare function for two nodes in the hash table. Gets two + * nodes as parameters. Returns 0 if the nodes are a cse. + */ +int identities_cmp(const void *elt, const void *key); + +/** + * Return the canonical node computing the same value as n. + * 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); + +/** Visit each node in the value table of a graph. */ +void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env); + +ir_node *optimize_node(ir_node *n); + +ir_node *optimize_in_place_2(ir_node *n); + +/** + * Returns the tarval of a Const node or tarval_bad for all other nodes. + */ +static INLINE tarval * +value_of(ir_node *n) { + if ((n != NULL) && (get_irn_op(n) == op_Const)) + return get_Const_tarval(n); /* might return tarval_bad */ + else + return tarval_bad; +} + +/** + * 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. + */ +ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops); + +#endif