9 #include "iroptimize.h"
16 #include "opt_manage.h"
18 static void deactivate_entity_usage(ir_graph *irg)
20 set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
23 static void nop(ir_graph *irg) {
27 void perform_irg_optimization(ir_graph *irg, optdesc_t *opt)
29 ir_graph_state_t new_irg_state;
30 ir_graph_state_t required = opt->requirements;
31 const bool dump = get_irp_optimization_dumps();
33 /* no bad block requires no unreachable code */
34 if (required & IR_GRAPH_STATE_NO_BAD_BLOCKS)
35 required |= IR_GRAPH_STATE_NO_UNREACHABLE_BLOCKS;
37 /** Some workarounds because information is currently duplicated */
38 // FIXME should not be necessary!
39 if (dom_inconsistent == get_irg_dom_state(irg))
40 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE);
41 if (outs_inconsistent == get_irg_outs_state(irg))
42 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
43 if (loopinfo_inconsistent == get_irg_loopinfo_state(irg))
44 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO);
45 if (ir_entity_usage_not_computed == get_irg_entity_usage_state(irg))
46 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE);
48 /* assure that all requirements for the optimization are fulfilled */
49 #define PREPARE(st,func) if (st & (required ^ irg->state)) {func(irg); set_irg_state(irg,st);}
50 PREPARE(IR_GRAPH_STATE_ONE_RETURN, normalize_one_return)
51 PREPARE(IR_GRAPH_STATE_NO_CRITICAL_EDGES, remove_critical_cf_edges)
52 PREPARE(IR_GRAPH_STATE_NO_UNREACHABLE_BLOCKS, remove_unreachable_blocks)
53 PREPARE(IR_GRAPH_STATE_NO_BAD_BLOCKS, remove_bads)
54 PREPARE(IR_GRAPH_STATE_CONSISTENT_DOMINANCE, assure_doms)
55 PREPARE(IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE, assure_postdoms)
56 PREPARE(IR_GRAPH_STATE_CONSISTENT_OUT_EDGES, edges_assure)
57 PREPARE(IR_GRAPH_STATE_CONSISTENT_OUTS, assure_irg_outs)
58 PREPARE(IR_GRAPH_STATE_CONSISTENT_LOOPINFO, assure_cf_loop)
59 PREPARE(IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE, assure_irg_entity_usage_computed)
60 PREPARE(IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS, compute_extbb)
62 /* now all the requirements for the optimization are fulfilled */
64 dump_ir_graph(irg, opt->name);
66 new_irg_state = opt->optimization(irg);
69 dump_ir_graph(irg, opt->name);
71 /* unless the optimization returned that some state is retained,
72 * we disable the corresponding irg state.
73 * Since we currently duplicate information, sometimes another func must be called too.
75 #define INVALIDATE(state,func) if (!(state & new_irg_state)) {clear_irg_state(irg,state); func(irg);}
76 INVALIDATE(IR_GRAPH_STATE_NO_CRITICAL_EDGES, nop)
77 INVALIDATE(IR_GRAPH_STATE_NO_UNREACHABLE_BLOCKS, nop)
78 INVALIDATE(IR_GRAPH_STATE_NO_BAD_BLOCKS, nop)
79 INVALIDATE(IR_GRAPH_STATE_ONE_RETURN, nop)
80 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_DOMINANCE, set_irg_doms_inconsistent)
81 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_POSTDOMINANCE, set_irg_postdoms_inconsistent)
82 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_OUTS, set_irg_outs_inconsistent)
83 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_OUT_EDGES, edges_deactivate)
84 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_LOOPINFO, set_irg_loopinfo_inconsistent)
85 INVALIDATE(IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE, deactivate_entity_usage)
86 INVALIDATE(IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS, set_irg_extblk_inconsistent)
88 if (!(new_irg_state & IR_GRAPH_STATE_BROKEN_FOR_VERIFIER)) {
89 irg_verify(irg, VERIFY_ENFORCE_SSA);