2 * Trivial node selector.
3 * @author Christian Wuerdig
10 #include "besched_t.h"
11 #include "belistsched.h"
14 * The random selector:
15 * Just assure that branches are executed last, otherwise select a random node
17 static ir_node *random_select(void *block_env, nodeset *ready_set, nodeset *live_set)
19 const arch_env_t *arch_env = block_env;
21 int only_branches_left = 1;
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 only_branches_left = 0;
27 nodeset_break(ready_set);
32 if(only_branches_left) {
33 /* at last: schedule branches */
34 irn = nodeset_first(ready_set);
35 nodeset_break(ready_set);
39 int n = rand() % pset_count(ready_set);
41 for(irn = nodeset_first(ready_set); irn; irn = nodeset_next(ready_set)) {
43 nodeset_break(ready_set);
48 } while(arch_irn_class_is(arch_env, irn, branch));
54 static void *random_init_graph(const list_sched_selector_t *vtab, const arch_env_t *arch_env, ir_graph *irg)
57 return (void *)arch_env;
60 static void *random_init_block(void *graph_env, ir_node *bl)
65 static const list_sched_selector_t random_selector_struct = {
69 NULL, /* to_appear_in_schedule */
70 NULL, /* node_ready */
71 NULL, /* node_selected */
74 NULL, /* finish_block */
75 NULL /* finish_graph */
78 const list_sched_selector_t *random_selector = &random_selector_struct;