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 iropt --- optimizations intertwined with IR construction -- private header.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
26 #ifndef FIRM_IR_IROPT_T_H
27 #define FIRM_IR_IROPT_T_H
36 * Calculate a hash value of a node.
38 * @param node The IR-node
40 unsigned ir_node_hash(const ir_node *node);
43 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
44 * perform no actual computation, as, e.g., the Id nodes. It does not create
45 * new nodes. It is therefore safe to free n if the node returned is not n.
46 * If a node returns a Tuple we can not just skip it. If the size of the
47 * in array fits, we transform n into a tuple (e.g., Div).
49 ir_node *equivalent_node(ir_node *n);
52 * Creates a new value table used for storing CSE identities.
53 * The value table is used to identify common expressions.
56 pset *new_identities(void);
59 * Deletes a identities value table.
61 * @param value_table the identity set
63 void del_identities(pset *value_table);
66 * Add a node to the identities value table.
68 void add_identities(pset *value_table, ir_node *node);
71 * Compare function for two nodes in the hash table. Gets two
72 * nodes as parameters. Returns 0 if the nodes are a cse.
74 int identities_cmp(const void *elt, const void *key);
77 * Return the canonical node computing the same value as n.
78 * Looks up the node in a hash table, enters it in the table
79 * if it isn't there yet.
81 ir_node *identify_remember(pset *value_table, ir_node *n);
83 /** Visit each node in the value table of a graph. */
84 void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env);
86 ir_node *optimize_node(ir_node *n);
88 ir_node *optimize_in_place_2(ir_node *n);
91 * The value_of operation.
92 * This operation returns for every IR node an associated tarval if existing,
93 * returning tarval_bad otherwise.
94 * No calculations are done here, just a lookup.
96 typedef tarval *(*value_of_func)(const ir_node *self);
98 extern value_of_func value_of_ptr;
101 * Set a new value_of function.
103 * @param func the function, NULL restores the default behavior
105 void set_value_of_func(value_of_func func);
108 * Returns the associated tarval of a node.
110 static INLINE tarval *
111 value_of(const ir_node *n) {
112 return value_of_ptr(n);
116 * Sets the default operations for an ir_op_ops.
118 * @param code the opcode for the default operation
119 * @param ops the operations initialized
124 ir_op_ops *firm_set_default_operations(ir_opcode code, ir_op_ops *ops);