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 Scheduling utilities for nodes in Blocks and Blocks.
23 * @author Sebastian Hack
32 #include "firm_types.h"
33 #include "irgraph_t.h"
34 #include "iredges_t.h"
44 #include "belistsched.h"
47 size_t sched_irn_data_offset = 0;
49 static void block_sched_dumper(ir_node *block, void *env)
54 ir_fprintf(f, "%+F:\n", block);
56 sched_foreach(block, curr) {
57 sched_info_t *info = get_irn_sched_info(curr);
58 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
62 void be_sched_dump(FILE *f, ir_graph *irg)
64 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
67 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
68 void be_init_sched(void)
70 sched_irn_data_offset = firm_register_additional_node_data(sizeof(sched_info_t));
73 void sched_renumber(const ir_node *block)
77 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
79 sched_foreach(block, irn) {
80 inf = get_irn_sched_info(irn);
81 inf->time_step = step;
82 step += SCHED_INITIAL_GRANULARITY;
86 int sched_skip_cf_predicator(const ir_node *irn, void *data)
92 int sched_skip_phi_predicator(const ir_node *irn, void *data)
98 /* Skip nodes in a schedule. */
99 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
101 const ir_node *bl = get_block_const(from);
106 from = sched_next(from);
107 for (curr = from; curr != bl && predicator(curr, data); curr = sched_next(curr)) {
111 from = sched_prev(from);
112 for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) {
119 //---------------------------------------------------------------------------
121 typedef struct remove_dead_nodes_env_t_ {
125 } remove_dead_nodes_env_t;
128 * Post-walker: remember all visited nodes in a bitset.
130 static void mark_dead_nodes_walker(ir_node *node, void *data)
132 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
133 bitset_set(env->reachable, get_irn_idx(node));
138 * Walk through the schedule of every block and remove all dead nodes from it.
140 static void remove_dead_nodes_walker(ir_node *block, void *data)
142 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
143 ir_node *node, *next;
145 for (node = sched_first(block); ! sched_is_end(node); node = next) {
146 /* get next node now, as after calling sched_remove it will be invalid */
147 next = sched_next(node);
149 if (bitset_is_set(env->reachable, get_irn_idx(node)))
153 be_liveness_remove(env->lv, node);
159 void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
161 ir_graph *irg = be_get_birg_irg(birg);
163 remove_dead_nodes_env_t env;
164 env.reachable = bitset_alloca(get_irg_last_idx(irg));
165 env.lv = be_get_birg_liveness(birg);
168 // mark all reachable nodes
169 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
171 // walk schedule and remove non-marked nodes
172 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
175 int (have_sched_info)(const ir_graph *irg)
177 return _have_sched_info(irg);
180 int (sched_get_time_step)(const ir_node *node)
182 return _sched_get_time_step(node);
185 int (sched_has_next)(const ir_node *node)
187 return _sched_has_next(node);
190 int (sched_has_prev)(const ir_node *node)
192 return _sched_has_prev(node);
195 ir_node *(sched_next)(const ir_node *node)
197 return _sched_next(node);
200 ir_node *(sched_prev)(const ir_node *node)
202 return _sched_prev(node);
205 int (sched_is_scheduled)(const ir_node *node)
207 return _sched_is_scheduled(node);
210 ir_node *(sched_first)(const ir_node *node)
212 return _sched_first(node);
215 ir_node *(sched_last)(const ir_node *node)
217 return _sched_last(node);
220 void (sched_add_after)(ir_node *after, ir_node *node)
222 _sched_add_after(after, node);
225 void (sched_add_before)(ir_node *before, ir_node *node)
227 _sched_add_before(before, node);
230 void (sched_init_block)(ir_node *block)
232 _sched_init_block(block);
235 void (sched_remove)(ir_node *node)
240 void (sched_reset)(ir_node *node)
245 int (sched_comes_after)(const ir_node *n1, const ir_node *n2)
247 return _sched_comes_after(n1, n2);