+/*
+ * Copyright (C) 1995-2007 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.
+ */
+
/**
* @file
+ * @brief Main spill driver.
* @author Daniel Grund, Sebastian Hack, Matthias Braun
* @date 29.09.2005
* @version $Id$
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#include "bespilloptions.h"
#include "bestatevent.h"
#include "bessaconstr.h"
+#include "beirg_t.h"
+#include "beintlive_t.h"
-// only rematerialise when costs are less than REMAT_COST_LIMIT
-// TODO determine a good value here...
+/* only rematerialise when costs are less than REMAT_COST_LIMIT */
+/* TODO determine a good value here... */
#define REMAT_COST_LIMIT 10
typedef struct _reloader_t reloader_t;
/* go through all reloads for this spill */
for (rld = si->reloaders; rld; rld = rld->next) {
- ir_node *copy; /* a reaload is a "copy" of the original value */
+ ir_node *copy; /* a reload is a "copy" of the original value */
if (rld->rematted_node != NULL) {
copy = rld->rematted_node;
#endif /* FIRM_STATISTICS */
be_remove_dead_nodes_from_schedule(env->irg);
- /* Matze: In theory be_ssa_construction should take care of the livenes...
+ /* Matze: In theory be_ssa_construction should take care of the liveness...
* try to disable this again in the future */
be_invalidate_liveness(env->birg);
}