X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=include%2Flibfirm%2Firopt.h;h=24dec126d34aacc7fb48142c1fba61ab30e9a01a;hb=4d64d1d8ea625cc6075a0086671c525a162726a0;hp=ad7a01b0f944db301aa71460c6981f620eed47ec;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm

diff --git a/include/libfirm/iropt.h b/include/libfirm/iropt.h
index ad7a01b0f..24dec126d 100644
--- a/include/libfirm/iropt.h
+++ b/include/libfirm/iropt.h
@@ -27,6 +27,7 @@
 #define FIRM_IR_IROPT_H
 
 #include "firm_types.h"
+#include "begin.h"
 
 /**
  * The Floating point model.
@@ -51,20 +52,24 @@
  * - fp_model_fast:
  *     Fastest mode. Associative and distributive law allowed at the expense
  *     of floating point accuracy and correctness. Explicit rounding is disabled.
+ * - fp_no_float_fold:
+ *     Avoid floating point constant folding. Useful for frontends which do not
+ *     create arithmetic operations in the backends arithmetic mode.
  */
 typedef enum _fp_model_t {
-	fp_explicit_rounding  =  1,  /**< Explicit rounding at assignments, typecasts, return
+	fp_explicit_rounding  = (1u << 0),  /**< Explicit rounding at assignments, typecasts, return
 	                                  and function calls. Conv nodes may NOT be removed, even
 	                                  if they look useless. */
-	fp_strict_algebraic   =  2,  /**< Strict adherence to non-associative and non-distributive
+	fp_strict_algebraic   = (1u << 1),  /**< Strict adherence to non-associative and non-distributive
 	                                  algebra unless the same result is guaranteed. */
-	fp_contradictions     =  4,  /**< FP contradictions are enabled. Only for backend. */
-	fp_strict_eval_order  =  8,  /**< FP instructions must be strict evaluated in given order. */
-	fp_exceptions         = 16,  /**< FP exceptions are supported. No reordering that changes
+	fp_contradictions     = (1u << 2),  /**< FP contradictions are enabled. Only for backend. */
+	fp_strict_eval_order  = (1u << 3),  /**< FP instructions must be strict evaluated in given order. */
+	fp_exceptions         = (1u << 4),  /**< FP exceptions are supported. No reordering that changes
 	                                  the exception flow are allowed. Backends must generate
 	                                  synchronized exception code. */
-	fp_environment_access = 32,  /**< FPU environment can be accessed. Even Constant folding
+	fp_environment_access = (1u << 5),  /**< FPU environment can be accessed. Even Constant folding
 	                                  cannot be done. */
+	fp_no_float_fold      = (1u << 6),
 
 	/** Precise floating point model. Default. */
 	fp_model_precise = fp_explicit_rounding|fp_strict_algebraic|fp_contradictions,
@@ -72,13 +77,13 @@ typedef enum _fp_model_t {
 	fp_model_strict  = fp_explicit_rounding|fp_strict_algebraic|fp_strict_eval_order|
 	                   fp_exceptions|fp_environment_access,
 	/** Fast floating point model. */
-	fp_model_fast    = fp_contradictions,
+	fp_model_fast    = fp_contradictions
 } fp_model_t;
 
 /** If the expression referenced can be evaluated statically
  *  computed_value returns a tarval representing the result.
  *  Else returns tarval_bad. */
-tarval *computed_value(ir_node *n);
+FIRM_API tarval *computed_value(const ir_node *n);
 
 /** Applies all optimizations to n that are expressible as a pattern
  *  in Firm, i.e., they need not a walk of the graph.
@@ -88,6 +93,8 @@ tarval *computed_value(ir_node *n);
  *  An equivalent optimization is applied in the constructors defined in
  *  ircons.ch.  There n is freed if a better node could be found.
  */
-ir_node *optimize_in_place(ir_node *n);
+FIRM_API ir_node *optimize_in_place(ir_node *n);
+
+#include "end.h"
 
 #endif