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"
41 // XXX there is no one time init for schedulers
45 static int must_be_scheduled(const ir_node* const irn)
47 return !is_Proj(irn) && !is_Sync(irn);
51 static const arch_env_t *cur_arch_env;
54 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
55 ir_nodeset_t *live_set)
57 ir_nodeset_iterator_t iter;
66 ir_nodeset_iterator_init(&iter, ready_set);
67 irn = ir_nodeset_iterator_next(&iter);
68 block = get_nodes_block(irn);
69 sched = get_irn_link(block);
70 sched_count = ARR_LEN(sched);
71 for (; sched_count-- != 0; ++sched) {
72 ir_node* irn = *sched;
73 if (ir_nodeset_contains(ready_set, irn) &&
74 !arch_irn_class_is(cur_arch_env, irn, branch)) {
75 #if defined NORMAL_DBG
76 ir_fprintf(stderr, "scheduling %+F\n", irn);
86 typedef struct irn_cost_pair {
92 static int cost_cmp(const void* a, const void* b)
94 const irn_cost_pair* const a1 = a;
95 const irn_cost_pair* const b1 = b;
97 if (is_irn_forking(a1->irn)) {
99 } else if (is_irn_forking(b1->irn)) {
102 ret = b1->cost - a1->cost;
103 //ret = a1->cost - b1->cost;
105 #if defined NORMAL_DBG
106 ir_fprintf(stderr, "%+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
112 typedef struct flag_and_cost {
114 irn_cost_pair costs[];
118 static int count_result(const ir_node* irn)
120 const ir_mode* mode = get_irn_mode(irn);
124 !arch_irn_is(cur_arch_env, irn, ignore);
128 /* TODO high cost for store trees
132 static int normal_tree_cost(ir_node* irn)
134 flag_and_cost* fc = get_irn_link(irn);
135 ir_node* block = get_nodes_block(irn);
136 int arity = get_irn_arity(irn);
146 return normal_tree_cost(get_Proj_pred(irn));
150 irn_cost_pair* costs;
153 fc = malloc(sizeof(*fc) + sizeof(*fc->costs) * arity);
157 for (i = 0; i < arity; ++i) {
158 ir_node* pred = get_irn_n(irn, i);
161 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
163 } else if (get_nodes_block(pred) != block) {
166 flag_and_cost* pred_fc;
169 cost = normal_tree_cost(pred);
170 if (be_is_Barrier(pred)) cost = 1; // XXX hack: the barrier causes all users to have a reguse of #regs
171 if (!arch_irn_is(cur_arch_env, pred, ignore)) {
172 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
173 pred_fc = get_irn_link(real_pred);
174 pred_fc->no_root = 1;
175 #if defined NORMAL_DBG
176 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
182 costs[i].cost = cost;
185 qsort(costs, arity, sizeof(*costs), cost_cmp);
186 set_irn_link(irn, fc);
190 for (i = 0; i < arity; ++i) {
191 if (get_irn_mode(fc->costs[i].irn) == mode_M) continue;
192 if (arch_irn_is(cur_arch_env, fc->costs[i].irn, ignore)) continue;
193 cost = MAX(fc->costs[i].cost + n_op_res, cost);
196 n_res = count_result(irn);
197 cost = MAX(n_res, cost);
199 #if defined NORMAL_DBG
200 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
207 static void normal_cost_walker(ir_node* irn, void* env)
211 #if defined NORMAL_DBG
212 ir_fprintf(stderr, "cost walking node %+F\n", irn);
214 if (is_Block(irn)) return;
215 if (!must_be_scheduled(irn)) return;
216 normal_tree_cost(irn);
220 static void collect_roots(ir_node* irn, void* env)
226 if (is_Block(irn)) return;
227 if (!must_be_scheduled(irn)) return;
229 is_root = be_is_Keep(irn) || !((flag_and_cost*)get_irn_link(irn))->no_root;
231 #if defined NORMAL_DBG
232 ir_fprintf(stderr, "%+F is %sroot\n", irn, is_root ? "" : "no ");
236 ir_node* block = get_nodes_block(irn);
237 ir_node** roots = get_irn_link(block);
239 roots = NEW_ARR_F(ir_node*, 0);
241 ARR_APP1(ir_node*, roots, irn);
242 set_irn_link(block, roots);
247 static ir_node** sched_node(ir_node** sched, ir_node* irn)
249 ir_node* block = get_nodes_block(irn);
250 flag_and_cost* fc = get_irn_link(irn);
251 irn_cost_pair* irns = fc->costs;
252 int arity = get_irn_arity(irn);
255 if (irn_visited(irn)) return sched;
256 if (is_End(irn)) return sched;
258 if (!is_Phi(irn) && !be_is_Keep(irn)) {
259 for (i = 0; i < arity; ++i) {
260 ir_node* pred = irns[i].irn;
261 if (get_nodes_block(pred) != block) continue;
262 if (get_irn_mode(pred) == mode_M) continue;
263 if (is_Proj(pred)) pred = get_Proj_pred(pred);
264 sched = sched_node(sched, pred);
268 mark_irn_visited(irn);
269 ARR_APP1(ir_node*, sched, irn);
274 static int root_cmp(const void* a, const void* b)
276 const irn_cost_pair* const a1 = a;
277 const irn_cost_pair* const b1 = b;
278 int ret = b1->cost - a1->cost;
279 #if defined NORMAL_DBG
280 ir_fprintf(stderr, "%+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
286 static void normal_sched_block(ir_node* block, void* env)
288 heights_t* heights = env;
289 ir_node** roots = get_irn_link(block);
291 irn_cost_pair* root_costs;
295 #if defined NORMAL_DBG
296 ir_fprintf(stderr, "sched walking block %+F\n", block);
300 #if defined NORMAL_DBG
301 fprintf(stderr, "has no roots\n");
306 root_count = ARR_LEN(roots);
307 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
308 for (i = 0; i < root_count; ++i) {
309 root_costs[i].irn = roots[i];
310 root_costs[i].cost = get_irn_height(heights, roots[i]);
311 #if defined NORMAL_DBG
312 ir_fprintf(stderr, "height of %+F is %u\n", roots[i], root_costs[i].cost);
315 qsort(root_costs, root_count, sizeof(*root_costs), root_cmp);
316 #if defined NORMAL_DBG
321 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
322 for (i = 0; i < n; ++i) {
323 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
325 fprintf(stderr, "\n");
329 sched = NEW_ARR_F(ir_node*, 0);
330 for (i = 0; i < root_count; ++i) {
331 ir_node* irn = root_costs[i].irn;
332 assert(must_be_scheduled(irn));
333 sched = sched_node(sched, irn);
335 set_irn_link(block, sched);
338 #if defined NORMAL_DBG
340 int n = ARR_LEN(sched);
343 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
344 for (i = 0; i < n; ++i) {
345 ir_fprintf(stderr, " %+F\n", sched[i]);
347 fprintf(stderr, "\n");
353 static void *normal_init_graph(const list_sched_selector_t *vtab,
354 const be_irg_t *birg)
356 ir_graph *irg = be_get_birg_irg(birg);
361 cur_arch_env = be_get_birg_arch_env(birg);
365 heights = heights_new(irg);
367 irg_walk_graph(irg, normal_cost_walker, NULL, NULL);
368 irg_walk_graph(irg, collect_roots, NULL, NULL);
369 inc_irg_visited(irg);
370 irg_block_walk_graph(irg, normal_sched_block, NULL, heights);
372 heights_free(heights);
378 static void *normal_init_block(void *graph_env, ir_node *block)
387 const list_sched_selector_t normal_selector = {
391 NULL, /* to_appear_in_schedule */
392 NULL, /* node_ready */
393 NULL, /* node_selected */
396 NULL, /* finish_block */
397 NULL /* finish_graph */