-/**
- * Author: Daniel Grund, Sebastian Hack
- * Date: 29.09.2005
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
*/
-#ifndef BESPILL_H_
-#define BESPILL_H_
-
-#include "set.h"
-#include "pset.h"
-#include "irnode.h"
-#include "debug.h"
-
-#include "be_t.h"
+/**
+ * @file
+ * @brief Option handling for spiller.
+ * @author Matthias Braun
+ * @date 12.10.2006
+ * @version $Id$
+ */
+#ifndef FIRM_BE_BESPILL_H
+#define FIRM_BE_BESPILL_H
#include "bearch.h"
+#include "beirg.h"
-typedef struct _spill_env_t spill_env_t;
-typedef int(*decide_irn_t)(const ir_node*, void*);
-
+extern int be_coalesce_spill_slots;
+extern int be_do_remats;
-spill_env_t *be_new_spill_env(
- firm_dbg_module_t *dbg,
- const be_main_session_env_t *session,
- const arch_register_class_t *cls);
-
-void be_delete_spill_env(spill_env_t *senv);
+/**
+ * An entry in the list of spill-algorithms.
+ */
+typedef struct be_spiller_t {
+ /**
+ * The spill function.
+ *
+ * @param irg the graph to spill on
+ * @param cls the register class to spill
+ */
+ void (*spill)(ir_graph *irg, const arch_register_class_t *cls);
+} be_spiller_t;
-void be_add_spill(spill_env_t *senv, ir_node *to_spill, ir_node *before);
+/**
+ * Register a new spill algorithm.
+ *
+ * @param name the name of the spill algorithm,
+ * used to select it
+ * @param spiller a spill entry
+ */
+void be_register_spiller(const char *name, be_spiller_t *spiller);
-void be_add_spill_on_edge(spill_env_t *senv, ir_node *to_spill, ir_node *bl, int pos);
+/**
+ * Execute the selected spill algorithm
+ *
+ * @param irg the graph to spill on
+ * @param cls the register class to spill
+ */
+void be_do_spill(ir_graph *irg, const arch_register_class_t *cls);
-void be_insert_spills_reloads(spill_env_t *senv, pset *reload_set, decide_irn_t is_mem_phi, void *data);
+/**
+ * Adds additional copies, so constraints needing additional registers to be
+ * solved correctly induce the additional register pressure.
+ */
+void be_pre_spill_prepare_constr(ir_graph *irg,
+ const arch_register_class_t *cls);
-#endif /*BESPILL_H_*/
+#endif