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 * @brief Construction of Confirm nodes
23 * @author Michael Beck
27 #ifndef FIRM_ANA_IRCONSCONFIRM_H
28 #define FIRM_ANA_IRCONSCONFIRM_H
30 #include "firm_types.h"
33 * Inject Confirm nodes into a graph.
35 * @param irg the graph
37 * Confirm nodes carry confirmation information, such as
38 * a relation between a value a and another value (or a constant)
41 * These allows to do some range dependent optimizations for Cmp,
42 * Abs, Min, Max nodes as well as bounds checking deletion.
44 * The heap analysis might profit also. On the other side, Confirm
45 * nodes disturb local optimizations, because patterns are destroyed.
47 * It is possible to avoid this by skipping Confirm nodes, but this
48 * is not implemented and is not cheap. The same happens with Casts
49 * nodes too. The current solution is to remove Confirms at a later
52 void construct_confirms(ir_graph *irg);
55 * Remove all Confirm nodes from a graph.
57 * Note that local_optimize() can handle this if
58 * the remove Confirm node setting is on (set_opt_remove_Confirm(1)).
60 void remove_confirms(ir_graph *irg);