1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Christian Schaefer
6 ** irflag --- optimization flags
16 /* 0 - don't do this optimization
17 1 - lets see, if there is a better graph */
18 int optimized = 1; /* Turn off all optimizations */
20 int opt_cse = 1; /* Hash the nodes */
21 int opt_global_cse = 0; /* Don't use block predecessor for comparison */
22 /* @@@ 0 solage code placement fehlt */
23 int opt_constant_folding = 1; /* Evaluate operations */
24 int opt_unreachable_code = 1; /* Bad node propagation */
25 int opt_dead_node_elimination = 1; /* Reclaim memory */
26 int opt_reassociation = 1; /* Reassociate nodes */
27 int opt_inline = 1; /* Do inlining transformation */
29 /* set the flags with set_flagname, get the flag with get_flagname */
31 set_opt_cse (int value)
42 void set_opt_global_cse (int value)
44 opt_global_cse = value;
47 int get_opt_global_cse (void)
49 return opt_global_cse;
53 set_opt_constant_folding (int value)
55 opt_constant_folding=value;
59 get_opt_constant_folding (void)
61 return opt_constant_folding;
65 set_opt_unreachable_code(int value)
67 opt_unreachable_code = value;
71 get_opt_unreachable_code(void)
73 return opt_unreachable_code;
77 set_opt_reassociation(int value)
79 opt_reassociation = value;
83 get_opt_reassociation(void)
85 return opt_reassociation;
89 set_opt_dead_node_elimination (int value)
91 opt_dead_node_elimination = value;
95 get_opt_dead_node_elimination (void)
97 return opt_dead_node_elimination;
101 set_optimize (int value)
113 void set_opt_inline (int value) {
117 int get_opt_inline (void) {