}
}
-void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) {
+/**
+ * Do spilling for a register class on a graph using the belady heuristic.
+ * In the transformed graph, the register pressure never exceeds the number
+ * of available registers.
+ *
+ * @param birg The backend graph
+ * @param cls The register class to spill
+ */
+static void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls) {
be_spill_belady_spill_env(birg, cls, NULL);
}
#include "bearch.h"
#include "bespill.h"
-/**
- * Do spilling for a register class on a graph using the belady heuristic.
- * In the transformed graph, the register pressure never exceeds the number
- * of available registers.
- *
- * @param birg The backend graph
- * @param cls The register class to spill
- */
-void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls);
-
/**
* Same as be_spill_belady but reuses an existing spill environment.
* This is usefull for "pre-spillers" that create some spills+reloads