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 of an ir node.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
25 #ifndef FIRM_IR_IROPT_H
26 #define FIRM_IR_IROPT_H
28 #include "firm_types.h"
33 * @defgroup iropt Local Optimizations
38 * The Floating point model.
40 * Several basic properties are defined:
41 * - fp_explicit_rounding
42 * - fp_strict_algebraic
44 * - fp_strict_eval_order
46 * - fp_environment_access
48 * From those basic properties three general models are defined,
49 * compatible to the VC8 compiler:
51 * Default mode. Associative and distributive law forbidden unless a transformation
52 * is guaranteed to produce the same result.
53 * No FPU environment access. No FP exception semantics.
55 * Slowest mode. Additionally to fp_model_precise allows correct handling of
56 * FP exceptions and FPU environment access.
58 * Fastest mode. Associative and distributive law allowed at the expense
59 * of floating point accuracy and correctness. Explicit rounding is disabled.
61 typedef enum fp_model_t {
62 fp_explicit_rounding = (1u << 0), /**< Explicit rounding at assignments, typecasts, return
63 and function calls. Conv nodes may NOT be removed, even
64 if they look useless. */
65 fp_strict_algebraic = (1u << 1), /**< Strict adherence to non-associative and non-distributive
66 algebra unless the same result is guaranteed. */
67 fp_contradictions = (1u << 2), /**< FP contradictions are enabled. Only for backend. */
68 fp_strict_eval_order = (1u << 3), /**< FP instructions must be strict evaluated in given order. */
69 fp_exceptions = (1u << 4), /**< FP exceptions are supported. No reordering that changes
70 the exception flow are allowed. Backends must generate
71 synchronized exception code. */
72 fp_environment_access = (1u << 5), /**< FPU environment can be accessed. Even Constant folding
75 /** Precise floating point model. Default. */
76 fp_model_precise = fp_explicit_rounding|fp_strict_algebraic|fp_contradictions,
77 /** Strict floating point model. */
78 fp_model_strict = fp_explicit_rounding|fp_strict_algebraic|fp_strict_eval_order|
79 fp_exceptions|fp_environment_access,
80 /** Fast floating point model. */
81 fp_model_fast = fp_contradictions
84 /** If the expression referenced can be evaluated statically
85 * computed_value returns a tarval representing the result.
86 * Else returns tarval_bad. */
87 FIRM_API ir_tarval *computed_value(const ir_node *n);
89 /** Applies all optimizations to n that are expressible as a pattern
90 * in Firm, i.e., they need not a walk of the graph.
91 * Returns a better node for n. Does not free n -- other nodes could
94 * An equivalent optimization is applied in the constructors defined in
95 * ircons.ch. There n is freed if a better node could be found.
97 FIRM_API ir_node *optimize_in_place(ir_node *n);
100 * checks whether 1 value is the negated other value
102 FIRM_API int ir_is_negated_value(const ir_node *a, const ir_node *b);
105 * (conservatively) approximates all possible relations when comparing
106 * the value @p left and @p right
108 FIRM_API ir_relation ir_get_possible_cmp_relations(const ir_node *left,
109 const ir_node *right);