1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Christian Schaefer
6 ** irflag --- optimization flags
19 /* 0 - don't do this optimization
20 1 - lets see, if there is a better graph */
21 int optimized = 1; /* Turn off all optimizations */
23 int opt_cse = 1; /* Hash the nodes */
24 int opt_global_cse = 0; /* Don't use block predecessor for comparison */
25 /* @@@ 0 solage code placement fehlt */
26 int opt_constant_folding = 1; /* Evaluate operations */
27 int opt_unreachable_code = 1; /* Bad node propagation */
28 int opt_control_flow = 1; /* control flow optimizations. */
29 int opt_dead_node_elimination = 1; /* Reclaim memory */
30 int opt_reassociation = 1; /* Reassociate nodes */
31 int opt_inline = 1; /* Do inlining transformation */
33 /* set the flags with set_flagname, get the flag with get_flagname */
35 set_opt_cse (int value)
46 void set_opt_global_cse (int value)
48 opt_global_cse = value;
51 int get_opt_global_cse (void)
53 return opt_global_cse;
57 set_opt_constant_folding (int value)
59 opt_constant_folding=value;
63 get_opt_constant_folding (void)
65 return opt_constant_folding;
69 set_opt_unreachable_code(int value)
71 opt_unreachable_code = value;
75 get_opt_unreachable_code(void)
77 return opt_unreachable_code;
80 INLINE void set_opt_control_flow(int value) {
81 opt_control_flow = value;
84 INLINE int get_opt_control_flow(void) {
85 return opt_control_flow;
89 set_opt_reassociation(int value)
91 opt_reassociation = value;
95 get_opt_reassociation(void)
97 return opt_reassociation;
101 set_opt_dead_node_elimination (int value)
103 opt_dead_node_elimination = value;
107 get_opt_dead_node_elimination (void)
109 return opt_dead_node_elimination;
113 set_optimize (int value)
125 INLINE void set_opt_inline (int value) {
129 INLINE int get_opt_inline (void) {