/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*/
/**
- * Primitive list scheduling.
- * @date 20.10.2004
- * @author Sebastian Hack
+ * @file
+ * @brief Primitive list scheduling with different node selectors.
+ * @author Sebastian Hack
+ * @date 20.10.2004
+ * @version $Id$
*/
-#ifndef _FIRM_LIST_SCHED
-#define _FIRM_LIST_SCHED
-
-#include "firm_config.h"
+#ifndef FIRM_BE_BELISTSCHED_H
+#define FIRM_BE_BELISTSCHED_H
#include "firm_types.h"
-
#include "irnodeset.h"
-#include "bearch_t.h"
+
#include "be.h"
+#include "bearch.h"
#include "beirg.h"
typedef struct _list_sched_selector_t list_sched_selector_t;
/**
* Called before a graph is being scheduled.
- * @param arch_env The architecture environment.
- * @param irg The graph.
+ * @param vtab The selector vtab.
+ * @param birg The backend graph.
* @return The environment pointer that is passed to all other functions in this struct.
*/
- void *(*init_graph)(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg);
+ void *(*init_graph)(const list_sched_selector_t *vtab, const be_irg_t *birg);
/**
* Called before scheduling starts on a block.
/**
* A trivial selector, that just selects the first ready node.
*/
-extern const list_sched_selector_t *trivial_selector;
+extern const list_sched_selector_t trivial_selector;
-extern const list_sched_selector_t *random_selector;
+extern const list_sched_selector_t random_selector;
/**
* A selector that tries to minimize the register pressure.
* @note Not really operational yet.
*/
-extern const list_sched_selector_t *reg_pressure_selector;
+extern const list_sched_selector_t reg_pressure_selector;
/**
* A selector based on trace scheduling as introduced by Muchnik[TM]
*/
-extern const list_sched_selector_t *muchnik_selector;
+extern const list_sched_selector_t muchnik_selector;
/**
* A selector based on trace scheduling as introduced by Muchnik[TM]
* but using the mueller heuristic selector.
*/
-extern const list_sched_selector_t *heuristic_selector;
+extern const list_sched_selector_t heuristic_selector;
+
+/**
+ * A selector based on the strong normal form theorem
+ */
+extern const list_sched_selector_t normal_selector;
/**
* List schedule a graph.
* @param birg The backend irg.
* @param be_opts The backend options
*/
-void list_sched(const be_irg_t *birg, be_options_t *be_opts);
+void list_sched(be_irg_t *birg, be_options_t *be_opts);
/**
* List schedule a block.
*/
void list_sched_single_block(const be_irg_t *birg, ir_node *block, be_options_t *be_opts);
-#endif /* _FIRM_LIST_SCHED */
+#endif /* FIRM_BE_BELISTSCHED_H */