/**
- * Author: Daniel Grund
+ * Author: Daniel Grund, Matthias Braun
* Date: 20.09.2005
* Copyright: (c) Universitaet Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
#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
-void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls, spill_env_t *spill_env);
+
+/**
+ * Same as be_spill_belady but reuses an existing spill environment.
+ * This is usefull for "pre-spillers" that create some spills+reloads
+ * but can't ensure that regpressure never exceeds the number of registers
+ */
+void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls,
+ spill_env_t *spill_env);
#endif /*BESPILLBELADY_H_*/