2 * Copyright (C) 1995-2007 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 * File name: ir/opt/reassoc.h
23 * Purpose: Reassociation
24 * Author: Michael Beck
27 * Copyright: (c) 1998-2004 Universität Karlsruhe
33 * Reassociation optimization.
34 * Uses the "firm.opt.reassoc" debug space
36 * @author Michael Beck
45 * Applies Reassociation rules to integer expressions.
46 * Beware: Works only if integer overflow might be ignored, as for C, Java
47 * and for address expression.
48 * Works only if Constant folding is activated.
50 * Uses loop information to detect loop-invariant (ie contant
51 * inside the loop) values.
53 * See Muchnik 12.3.1 Algebraic Simplification and Reassociation of
54 * Addressing Expressions.
58 void optimize_reassociation(ir_graph *irg);
60 #endif /* _REASSOC_H_ */