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
31 #include "firm_types.h"
32 #include "irgraph_t.h"
33 #include "iredges_t.h"
43 #include "belistsched.h"
47 #include "lc_opts_enum.h"
50 #define SCHED_INITIAL_GRANULARITY (1 << 14)
52 static void sched_renumber(const ir_node *block)
56 sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
58 sched_foreach(block, irn) {
59 inf = get_irn_sched_info(irn);
60 inf->time_step = step;
61 step += SCHED_INITIAL_GRANULARITY;
65 static inline void sched_set_time_stamp(const ir_node *irn)
67 sched_info_t *info = get_irn_sched_info(irn);
68 const sched_info_t *prev_info = get_irn_sched_info(info->prev);
69 const sched_info_t *next_info = get_irn_sched_info(info->next);
70 sched_timestep_t before_ts = prev_info->time_step;
71 sched_timestep_t after_ts = next_info->time_step;
74 * If we are the last, we can give us a big time step,
75 * else we have to compute our time step from our
78 if(before_ts >= after_ts) {
79 info->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
81 if (info->time_step <= before_ts) {
82 sched_renumber(get_nodes_block(irn));
85 sched_timestep_t ts = (before_ts + after_ts) / 2;
88 * If the resolution went out, we have to renumber
91 if(ts == before_ts || ts == after_ts)
92 sched_renumber(get_nodes_block(irn));
98 void sched_add_before(ir_node *before, ir_node *irn)
100 sched_info_t *info = get_irn_sched_info(irn);
101 ir_node *next = before;
102 sched_info_t *next_info = get_irn_sched_info(next);
103 ir_node *prev = next_info->prev;
104 sched_info_t *prev_info = get_irn_sched_info(prev);
105 assert(sched_is_scheduled(before));
106 assert(!sched_is_scheduled(irn));
107 assert(!is_Proj(before));
108 assert(!is_Proj(irn));
112 prev_info->next = irn;
113 next_info->prev = irn;
114 sched_set_time_stamp(irn);
117 void sched_add_after(ir_node *after, ir_node *irn)
119 sched_info_t *info = get_irn_sched_info(irn);
120 ir_node *prev = after;
121 sched_info_t *prev_info = get_irn_sched_info(prev);
122 ir_node *next = prev_info->next;
123 sched_info_t *next_info = get_irn_sched_info(next);
124 assert(sched_is_scheduled(after));
125 assert(!sched_is_scheduled(irn));
126 assert(!is_Proj(after));
127 assert(!is_Proj(irn));
131 prev_info->next = irn;
132 next_info->prev = irn;
133 sched_set_time_stamp(irn);
136 void sched_remove(ir_node *irn)
138 sched_info_t *info = get_irn_sched_info(irn);
139 ir_node *prev = info->prev;
140 ir_node *next = info->next;
141 sched_info_t *prev_info = get_irn_sched_info(prev);
142 sched_info_t *next_info = get_irn_sched_info(next);
143 assert(sched_is_scheduled(irn));
145 prev_info->next = next;
146 next_info->prev = prev;
153 static be_module_list_entry_t *schedulers;
154 static schedule_func scheduler;
156 void be_register_scheduler(const char *name, schedule_func func)
158 if (scheduler == NULL)
160 be_add_module_to_list(&schedulers, name, func);
163 void be_schedule_graph(ir_graph *irg)
168 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched)
169 void be_init_sched(void)
171 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
172 be_add_module_list_opt(be_grp, "scheduler", "scheduling algorithm",
173 &schedulers, (void**)&scheduler);