2 * Trivial node selector.
3 * @author Christian Wuerdig
10 #include "besched_t.h"
11 #include "belistsched.h"
14 * The trivial selector:
15 * Just assure that branches are executed last, otherwise select
16 * the first node ready.
18 static ir_node *trivial_select(void *block_env, nodeset *ready_set, nodeset *live_set)
20 const arch_env_t *arch_env = block_env;
23 /* assure that branches and constants are executed last */
24 for (irn = nodeset_first(ready_set); irn; irn = nodeset_next(ready_set)) {
25 if (! arch_irn_class_is(arch_env, irn, branch)) {
26 nodeset_break(ready_set);
31 /* at last: schedule branches */
32 irn = nodeset_first(ready_set);
33 nodeset_break(ready_set);
38 static void *trivial_init_graph(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg)
40 return (void *)arch_env;
43 static void *trivial_init_block(void *graph_env, ir_node *bl)
48 static const list_sched_selector_t trivial_selector_struct = {
52 NULL, /* to_appear_in_schedule */
53 NULL, /* node_ready */
54 NULL, /* node_selected */
57 NULL, /* finish_block */
58 NULL /* finish_graph */
61 const list_sched_selector_t *trivial_selector = &trivial_selector_struct;