2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Random node selector.
23 * @author Matthias Braun
31 #include "belistsched.h"
35 * The random selector:
36 * Just assure that branches are executed last, otherwise select a random node
38 static ir_node *random_select(void *block_env, ir_nodeset_t *ready_set)
40 int only_branches_left = 1;
43 /* assure that branches and constants are executed last */
44 foreach_ir_nodeset(ready_set, irn, iter) {
46 only_branches_left = 0;
51 ir_node *rand_node = NULL;
52 if (only_branches_left) {
53 /* at last: schedule branches */
54 rand_node = ir_nodeset_first(ready_set);
57 /* take 1 random node */
58 int n = rand() % ir_nodeset_size(ready_set);
60 foreach_ir_nodeset(ready_set, irn, iter) {
67 } while (is_cfop(rand_node));
73 static void *random_init_graph(ir_graph *irg)
76 /* TODO: add commandline option for the seed */
81 static void *random_init_block(void *graph_env, ir_node *block)
88 static void sched_random(ir_graph *irg)
90 static const list_sched_selector_t random_selector = {
94 NULL, /* node_ready */
95 NULL, /* node_selected */
96 NULL, /* finish_block */
97 NULL /* finish_graph */
99 be_list_sched_graph(irg, &random_selector);
102 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched_rand)
103 void be_init_sched_rand(void)
105 be_register_scheduler("random", sched_random);