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 Trivial node selector.
23 * @author Sebastian Hack
33 #include "irnodeset.h"
36 #include "belistsched.h"
39 * The trivial selector:
40 * Just assure that branches are executed last, otherwise select
41 * the first node ready.
43 static ir_node *trivial_select(void *block_env, ir_nodeset_t *ready_set,
44 ir_nodeset_t *live_set)
47 ir_nodeset_iterator_t iter;
51 /* assure that branches and constants are executed last */
52 foreach_ir_nodeset(ready_set, irn, iter) {
58 /* at last: schedule branches */
59 ir_nodeset_iterator_init(&iter, ready_set);
60 irn = ir_nodeset_iterator_next(&iter);
65 static void *trivial_init_graph(const list_sched_selector_t *vtab, ir_graph *irg)
72 static void *trivial_init_block(void *graph_env, ir_node *block)
79 const list_sched_selector_t trivial_selector = {
83 NULL, /* node_ready */
84 NULL, /* node_selected */
87 NULL, /* finish_block */
88 NULL /* finish_graph */