#include "irgwalk.h"
#include "irnode_t.h"
#include "irouts.h"
+#include "irpass_t.h"
#define foreach_out_irn(irn, i, outirn) for(i = get_irn_n_outs(irn) - 1;\
i >= 0 && (outirn = get_irn_out(irn, i)); --i)
if (get_irn_n_outs(cond) <= 4)
return 0;
- default_pn = get_Cond_defaultProj(cond);
+ default_pn = get_Cond_default_proj(cond);
foreach_out_irn(cond, i, proj) {
long pn = get_Proj_proj(proj);
numcases = get_irn_n_outs(cond) - 1; // does not contain default case
NEW_ARR_A(case_data_t, cases, numcases);
- default_pn = get_Cond_defaultProj(cond);
+ default_pn = get_Cond_default_proj(cond);
ifcas_env.sel = sel;
ifcas_env.defindex = 0;
NEW_ARR_A(ir_node*, ifcas_env.defusers, numcases);
}
current_ir_graph = rem;
}
+
+struct pass_t {
+ ir_graph_pass_t pass;
+ unsigned spare_size;
+};
+
+/**
+ * Wrapper for running lower_switch() as a pass.
+ */
+static int pass_wrapper(ir_graph *irg, void *context) {
+ struct pass_t *pass = context;
+
+ lower_switch(irg, pass->spare_size);
+ return 0;
+}
+
+/* creates a pass for lower_switch */
+ir_graph_pass_t *lower_switch_pass(const char *name, unsigned spare_size) {
+ struct pass_t *pass = XMALLOCZ(struct pass_t);
+
+ pass->spare_size = spare_size;
+ return def_graph_pass_constructor(
+ &pass->pass, name ? name : "lower_switch", pass_wrapper);
+}