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_control_flow = 1; /* control flow optimizations. */
26 int opt_dead_node_elimination = 1; /* Reclaim memory */
27 int opt_reassociation = 1; /* Reassociate nodes */
28 int opt_inline = 1; /* Do inlining transformation */
30 /* set the flags with set_flagname, get the flag with get_flagname */
32 set_opt_cse (int value)
43 void set_opt_global_cse (int value)
45 opt_global_cse = value;
48 int get_opt_global_cse (void)
50 return opt_global_cse;
54 set_opt_constant_folding (int value)
56 opt_constant_folding=value;
60 get_opt_constant_folding (void)
62 return opt_constant_folding;
66 set_opt_unreachable_code(int value)
68 opt_unreachable_code = value;
72 get_opt_unreachable_code(void)
74 return opt_unreachable_code;
77 inline void set_opt_control_flow(int value) {
78 opt_control_flow = value;
81 inline int get_opt_control_flow(void) {
82 return opt_control_flow;
86 set_opt_reassociation(int value)
88 opt_reassociation = value;
92 get_opt_reassociation(void)
94 return opt_reassociation;
98 set_opt_dead_node_elimination (int value)
100 opt_dead_node_elimination = value;
104 get_opt_dead_node_elimination (void)
106 return opt_dead_node_elimination;
110 set_optimize (int value)
122 void set_opt_inline (int value) {
126 int get_opt_inline (void) {