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
21 * @brief Use the strong normal form theorem (though it does not hold)
22 * @author Christoph Mallon
31 #include "besched_t.h"
32 #include "belistsched.h"
40 // XXX there is no one time init for schedulers
44 static int must_be_scheduled(const ir_node* const irn)
46 return !is_Proj(irn) && !is_Sync(irn);
50 static const arch_env_t *cur_arch_env;
53 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
54 ir_nodeset_t *live_set)
56 ir_nodeset_iterator_t iter;
65 ir_nodeset_iterator_init(&iter, ready_set);
66 irn = ir_nodeset_iterator_next(&iter);
67 block = get_nodes_block(irn);
68 sched = get_irn_link(block);
69 sched_count = ARR_LEN(sched);
70 for (; sched_count-- != 0; ++sched) {
71 ir_node* irn = *sched;
72 if (ir_nodeset_contains(ready_set, irn) &&
73 !arch_irn_class_is(cur_arch_env, irn, branch)) {
74 #if defined NORMAL_DBG
75 ir_fprintf(stderr, "scheduling %+F\n", irn);
85 typedef struct irn_cost_pair {
91 static int cost_cmp(const void* a, const void* b)
93 const irn_cost_pair* const a1 = a;
94 const irn_cost_pair* const b1 = b;
96 if (is_irn_forking(a1->irn)) {
98 } else if (is_irn_forking(b1->irn)) {
101 ret = b1->cost - a1->cost;
102 //ret = a1->cost - b1->cost;
104 #if defined NORMAL_DBG
105 ir_fprintf(stderr, "%+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
111 typedef struct flag_and_cost {
113 irn_cost_pair costs[];
117 static int count_result(const ir_node* irn)
119 const ir_mode* mode = get_irn_mode(irn);
123 !arch_irn_is(cur_arch_env, irn, ignore);
127 /* TODO high cost for store trees
131 static int normal_tree_cost(ir_node* irn)
133 flag_and_cost* fc = get_irn_link(irn);
134 ir_node* block = get_nodes_block(irn);
135 int arity = get_irn_arity(irn);
142 return normal_tree_cost(get_Proj_pred(irn));
146 irn_cost_pair* costs;
149 fc = malloc(sizeof(*fc) + sizeof(*fc->costs) * arity);
153 for (i = 0; i < arity; ++i) {
154 ir_node* pred = get_irn_n(irn, i);
157 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
159 } else if (get_nodes_block(pred) != block) {
162 flag_and_cost* pred_fc;
165 cost = normal_tree_cost(pred);
166 if (be_is_Barrier(pred)) cost = 1; // XXX hack: the barrier causes all users to have a reguse of #regs
167 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
168 pred_fc = get_irn_link(real_pred);
169 pred_fc->no_root = 1;
170 #if defined NORMAL_DBG
171 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
176 costs[i].cost = cost;
179 qsort(costs, arity, sizeof(*costs), cost_cmp);
180 set_irn_link(irn, fc);
184 for (i = 0; i < arity; ++i) {
185 if (get_irn_mode(fc->costs[i].irn) == mode_M) continue;
186 if (arch_irn_is(cur_arch_env, fc->costs[i].irn, ignore)) continue;
187 cost = MAX(fc->costs[i].cost + n_op_res, cost);
190 n_res = count_result(irn);
191 cost = MAX(n_res, cost);
193 #if defined NORMAL_DBG
194 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
201 static void normal_cost_walker(ir_node* irn, void* env)
205 #if defined NORMAL_DBG
206 ir_fprintf(stderr, "cost walking node %+F\n", irn);
208 if (is_Block(irn)) return;
209 if (!must_be_scheduled(irn)) return;
210 normal_tree_cost(irn);
214 static void collect_roots(ir_node* irn, void* env)
220 if (is_Block(irn)) return;
221 if (!must_be_scheduled(irn)) return;
223 fc = get_irn_link(irn);
225 #if defined NORMAL_DBG
226 ir_fprintf(stderr, "%+F is %sroot\n", irn, fc->no_root ? "no " : "");
230 ir_node* block = get_nodes_block(irn);
231 ir_node** roots = get_irn_link(block);
233 roots = NEW_ARR_F(ir_node*, 0);
235 ARR_APP1(ir_node*, roots, irn);
236 set_irn_link(block, roots);
241 static ir_node** sched_node(ir_node** sched, ir_node* irn)
243 ir_node* block = get_nodes_block(irn);
244 flag_and_cost* fc = get_irn_link(irn);
245 irn_cost_pair* irns = fc->costs;
246 int arity = get_irn_arity(irn);
249 if (irn_visited(irn)) return sched;
250 if (is_End(irn)) return sched;
253 for (i = 0; i < arity; ++i) {
254 ir_node* pred = irns[i].irn;
255 if (get_nodes_block(pred) != block) continue;
256 if (get_irn_mode(pred) == mode_M) continue;
257 if (is_Proj(pred)) pred = get_Proj_pred(pred);
258 sched = sched_node(sched, pred);
262 mark_irn_visited(irn);
263 ARR_APP1(ir_node*, sched, irn);
268 static void normal_sched_block(ir_node* block, void* env)
270 ir_node** roots = get_irn_link(block);
272 irn_cost_pair* root_costs;
278 #if defined NORMAL_DBG
279 ir_fprintf(stderr, "sched walking block %+F\n", block);
283 #if defined NORMAL_DBG
284 fprintf(stderr, "has no roots\n");
289 root_count = ARR_LEN(roots);
290 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
291 for (i = 0; i < root_count; ++i) {
292 root_costs[i].irn = roots[i];
293 root_costs[i].cost = normal_tree_cost(roots[i]);
295 qsort(root_costs, root_count, sizeof(*root_costs), cost_cmp);
296 #if defined NORMAL_DBG
301 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
302 for (i = 0; i < n; ++i) {
303 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
305 fprintf(stderr, "\n");
309 sched = NEW_ARR_F(ir_node*, 0);
310 for (i = 0; i < root_count; ++i) {
311 ir_node* irn = root_costs[i].irn;
312 assert(must_be_scheduled(irn));
313 sched = sched_node(sched, irn);
315 set_irn_link(block, sched);
318 #if defined NORMAL_DBG
320 int n = ARR_LEN(sched);
323 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
324 for (i = 0; i < n; ++i) {
325 ir_fprintf(stderr, " %+F\n", sched[i]);
327 fprintf(stderr, "\n");
333 static void *normal_init_graph(const list_sched_selector_t *vtab,
334 const be_irg_t *birg)
336 ir_graph* irg = be_get_birg_irg(birg);
340 cur_arch_env = be_get_birg_arch_env(birg);
344 irg_walk_graph(irg, normal_cost_walker, NULL, NULL);
345 irg_walk_graph(irg, collect_roots, NULL, NULL);
346 inc_irg_visited(irg);
347 irg_block_walk_graph(irg, normal_sched_block, NULL, NULL);
353 static void *normal_init_block(void *graph_env, ir_node *block)
362 const list_sched_selector_t normal_selector = {
366 NULL, /* to_appear_in_schedule */
367 NULL, /* node_ready */
368 NULL, /* node_selected */
371 NULL, /* finish_block */
372 NULL /* finish_graph */