* @date 29.08.2006
* @version $Id$
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
#include <stdlib.h>
#include "bearch.h"
#include "belistsched.h"
+#include "bemodule.h"
+#include "besched.h"
/**
* The trivial selector:
* Just assure that branches are executed last, otherwise select
* the first node ready.
*/
-static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set,
- ir_nodeset_t *live_set)
+static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set)
{
- const arch_env_t *arch_env = block_env;
- ir_node *irn = NULL;
- ir_nodeset_iterator_t iter;
- (void) live_set;
+ ir_node *irn;
+ ir_nodeset_iterator_t iter;
+ (void)block_env;
/* assure that branches and constants are executed last */
foreach_ir_nodeset(ready_set, irn, iter) {
- if (! arch_irn_class_is(arch_env, irn, branch)) {
+ if (!is_cfop(irn)) {
return irn;
}
}
return irn;
}
-static void *trivial_init_graph(const list_sched_selector_t *vtab, const be_irg_t *birg)
+static void *trivial_init_graph(ir_graph *irg)
{
- (void) vtab;
- return (void *) be_get_birg_arch_env(birg);
+ (void)irg;
+ return NULL;
}
static void *trivial_init_block(void *graph_env, ir_node *block)
{
- (void) block;
- return graph_env;
+ (void)graph_env;
+ (void)block;
+ return NULL;
}
-const list_sched_selector_t trivial_selector = {
- trivial_init_graph,
- trivial_init_block,
- trivial_select,
- NULL, /* to_appear_in_schedule */
- NULL, /* node_ready */
- NULL, /* node_selected */
- NULL, /* exectime */
- NULL, /* latency */
- NULL, /* finish_block */
- NULL /* finish_graph */
-};
+static void sched_trivial(ir_graph *irg)
+{
+ static const list_sched_selector_t trivial_selector = {
+ trivial_init_graph,
+ trivial_init_block,
+ trivial_select,
+ NULL, /* node_ready */
+ NULL, /* node_selected */
+ NULL, /* finish_block */
+ NULL /* finish_graph */
+ };
+ be_list_sched_graph(irg, &trivial_selector);
+}
+
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_trivial)
+void be_init_sched_trivial(void)
+{
+ be_register_scheduler("trivial", sched_trivial);
+}