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 opt_cse = 1; /* Hash the nodes */
19 int opt_constant_folding = 1; /* Evaluate operations */
20 int opt_unreachable_code = 1; /* Bad node propagation */
21 int opt_dead_node_elimination = 1; /* Reclaim memory */
25 /* set the flags with set_flagname, get the flag with get_flagname */
28 set_opt_cse (int value)
40 set_opt_constant_folding (int value)
42 opt_constant_folding=value;
46 get_opt_constant_folding (void)
48 return opt_constant_folding;
52 set_opt_unreachable_code(int value)
54 opt_unreachable_code = value;
58 get_opt_unreachable_code(void)
60 return opt_unreachable_code;
65 set_opt_dead_node_elimination (int value)
67 opt_dead_node_elimination = value;
71 get_opt_dead_node_elimination (void)
73 return opt_dead_node_elimination;
77 set_optimize (int value)
89 void set_opt_inline (int value) {
93 int get_opt_inline (void) {