1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Christian Schaefer
6 ** irflag --- optimization flags
14 /* 0 - don't do this optimization
15 1 - lets see, if there is a better graph */
16 int opt_cse = 1; /* Hash the nodes */
17 int opt_constant_folding = 1; /* Evaluate operations */
18 int opt_unreachable_code = 1; /* Bad node propagation */
19 int opt_dead_node_elimination = 1; /* Reclaim memory */
23 /* set the flags with set_flagname, get the flag with get_flagname */
26 set_opt_cse (int value)
38 set_opt_constant_folding (int value)
40 opt_constant_folding=value;
44 get_opt_constant_folding (void)
46 return opt_constant_folding;
50 set_opt_unreachable_code(int value)
52 opt_unreachable_code = value;
56 get_opt_unreachable_code(void)
58 return opt_unreachable_code;
63 set_opt_dead_node_elimination (int value)
65 opt_dead_node_elimination = value;
69 get_opt_dead_node_elimination (void)
71 return opt_dead_node_elimination;
75 set_optimize (int value)
87 void set_opt_inline (int value) {
91 int get_opt_inline (void) {