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
37 #include "firm_types.h"
38 #include "irgraph_t.h"
39 #include "iredges_t.h"
47 #include "besched_t.h"
49 #include "belistsched.h"
51 FIRM_IMPL1(have_sched_info, int, const ir_graph *)
52 FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
53 FIRM_IMPL1(sched_has_next, int, const ir_node *)
54 FIRM_IMPL1(sched_has_prev, int, const ir_node *)
55 FIRM_IMPL1(sched_next, ir_node *, const ir_node *)
56 FIRM_IMPL1(sched_prev, ir_node *, const ir_node *)
57 FIRM_IMPL1(sched_is_scheduled, int, const ir_node *)
58 FIRM_IMPL1(sched_first, ir_node *, const ir_node *)
59 FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
60 FIRM_IMPL2_VOID(sched_add_after, const ir_node *, const ir_node *)
61 FIRM_IMPL2_VOID(sched_add_before, const ir_node *, const ir_node *)
62 FIRM_IMPL1_VOID(sched_init_block, const ir_node *)
63 FIRM_IMPL1_VOID(sched_reset, const ir_node *)
64 FIRM_IMPL2(sched_comes_after, int, const ir_node *, const ir_node *)
65 FIRM_IMPL1_VOID(sched_remove, const ir_node *)
67 size_t sched_irn_data_offset = 0;
69 static void block_sched_dumper(ir_node *block, void *env)
74 ir_fprintf(f, "%+F:\n", block);
76 sched_foreach(block, curr) {
77 sched_info_t *info = get_irn_sched_info(curr);
78 ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
82 void be_sched_dump(FILE *f, ir_graph *irg)
84 irg_block_walk_graph(irg, block_sched_dumper, NULL, f);
87 /* Init the scheduling stuff. */
88 void be_init_sched(void)
90 sched_irn_data_offset = firm_register_additional_node_data(sizeof(sched_info_t));
93 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched);
95 void sched_renumber(const ir_node *block)
99 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
101 sched_foreach(block, irn) {
102 inf = get_irn_sched_info(irn);
103 inf->time_step = step;
104 step += SCHED_INITIAL_GRANULARITY;
108 int sched_skip_cf_predicator(const ir_node *irn, void *data) {
109 arch_env_t *ae = data;
110 return arch_irn_class_is(ae, irn, branch);
113 int sched_skip_phi_predicator(const ir_node *irn, void *data) {
118 /* Skip nodes in a schedule. */
119 ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data)
121 const ir_node *bl = get_block_const(from);
126 from = sched_next(from);
127 for (curr = from; curr != bl && predicator(curr, data); curr = sched_next(curr)) {
131 from = sched_prev(from);
132 for (curr = from; curr != bl && predicator(curr, data); curr = sched_prev(curr)) {
139 //---------------------------------------------------------------------------
141 typedef struct remove_dead_nodes_env_t_ {
145 } remove_dead_nodes_env_t;
148 * Post-walker: remember all visited nodes in a bitset.
150 static void mark_dead_nodes_walker(ir_node *node, void *data)
152 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
153 bitset_set(env->reachable, get_irn_idx(node));
158 * Walk through the schedule of every block and remove all dead nodes from it.
160 static void remove_dead_nodes_walker(ir_node *block, void *data)
162 remove_dead_nodes_env_t *env = (remove_dead_nodes_env_t*) data;
163 ir_node *node, *next;
165 for (node = sched_first(block); ! sched_is_end(node); node = next) {
166 /* get next node now, as after calling sched_remove it will be invalid */
167 next = sched_next(node);
169 if (bitset_is_set(env->reachable, get_irn_idx(node)))
173 be_liveness_remove(env->lv, node);
179 void be_remove_dead_nodes_from_schedule(be_irg_t *birg)
181 ir_graph *irg = be_get_birg_irg(birg);
183 remove_dead_nodes_env_t env;
184 env.reachable = bitset_alloca(get_irg_last_idx(irg));
185 env.lv = be_get_birg_liveness(birg);
188 // mark all reachable nodes
189 irg_walk_graph(irg, mark_dead_nodes_walker, NULL, &env);
191 // walk schedule and remove non-marked nodes
192 irg_block_walk_graph(irg, remove_dead_nodes_walker, NULL, &env);
195 static void *sched_irn_init(ir_phase *ph, const ir_node *irn, void *old)
197 sched_info_t *info = old ? old : phase_alloc(ph, sizeof(*info));
199 info->idx = get_irn_idx(irn);
200 INIT_LIST_HEAD(&info->list);
206 void be_sched_init_phase(ir_graph *irg)
208 init_irg_phase(irg, PHASE_BE_SCHED, 0, sched_irn_init);
211 void be_sched_free_phase(ir_graph *irg)
213 free_irg_phase(irg, PHASE_BE_SCHED);