1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Christian Schaefer
6 ** irflag --- optimization flags
14 /* If optimize == 0 no optimizations are performed.
15 Default: optimize == 1. */
16 void set_optimize (int value);
17 int get_optimize (void);
19 /* If opt_constant_folding == 1 perform
20 - constant expression evaluation (2 + 5 ==> 7, 3 < 2 ==> false)
21 - algebraic simplification (a * 0 ==> 0, a or a ==> a)
22 - simplification of tests ( !(a < b) ==> (a >= b))
23 - merging single exit with single entry blocks
24 - unreachable code elimination
25 - refining the memory representation
26 - remove store after load
27 Default: opt_constant_folding == 1. */
28 void set_opt_constant_folding (int value);
29 int get_opt_constant_folding (void);
31 /* If opt_cse == 1 perfor constant subexpression elimination
32 (and, if implemented, global code motion. @@@ Right now
33 cse only within blocks.
34 Default: opt_cse == 1. */
35 void set_opt_cse (int value);
36 int get_opt_cse (void);
38 /* If opt_unreachable_code == 1 replace nodes (except Block,
39 Phi and Tuple) with a Bad predecessor by the Bad node.
40 Default: opt_unreachable_code == 1. */
41 inline void set_opt_unreachable_code(int value);
42 inline int get_opt_unreachable_code(void);
44 /* If opt_dead_node_elimination == 1 deallocate all dead nodes
45 by copying the firm graph.
46 Default: opt_dead_node_elimination == 0. @@@ as buggy, else 1. */
47 void set_opt_dead_node_elimination (int value);
48 int get_opt_dead_node_elimination (void);
50 /* If opt_inline == 1 the inlining transformation is performed. */
51 void set_opt_inline (int value);
52 int get_opt_inline (void);