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
46 static int must_be_scheduled(const ir_node* const irn)
48 return !is_Proj(irn) && !is_Sync(irn);
52 static const arch_env_t *cur_arch_env;
55 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
56 ir_nodeset_t *live_set)
58 ir_nodeset_iterator_t iter;
67 ir_nodeset_iterator_init(&iter, ready_set);
68 irn = ir_nodeset_iterator_next(&iter);
69 block = get_nodes_block(irn);
70 sched = get_irn_link(block);
71 sched_count = ARR_LEN(sched);
72 for (; sched_count-- != 0; ++sched) {
73 ir_node* irn = *sched;
74 if (ir_nodeset_contains(ready_set, irn) &&
75 !arch_irn_class_is(cur_arch_env, irn, branch)) {
76 #if defined NORMAL_DBG
77 ir_fprintf(stderr, "scheduling %+F\n", irn);
87 typedef struct irn_cost_pair {
93 static int cost_cmp(const void* a, const void* b)
95 const irn_cost_pair* const a1 = a;
96 const irn_cost_pair* const b1 = b;
97 int ret = b1->cost - a1->cost;
99 ret = (int)get_irn_idx(a1->irn) - (int)get_irn_idx(b1->irn);
100 #if defined NORMAL_DBG
101 ir_fprintf(stderr, "cost %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
107 typedef struct flag_and_cost {
109 irn_cost_pair costs[];
113 static int count_result(const ir_node* irn)
115 const ir_mode* mode = get_irn_mode(irn);
119 !arch_irn_is(cur_arch_env, irn, ignore);
123 /* TODO high cost for store trees
127 static int normal_tree_cost(ir_node* irn)
129 flag_and_cost* fc = get_irn_link(irn);
130 ir_node* block = get_nodes_block(irn);
131 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 if (!arch_irn_is(cur_arch_env, pred, ignore)) {
168 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
169 pred_fc = get_irn_link(real_pred);
170 pred_fc->no_root = 1;
171 #if defined NORMAL_DBG
172 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
178 costs[i].cost = cost;
181 qsort(costs, arity, sizeof(*costs), cost_cmp);
182 set_irn_link(irn, fc);
187 for (i = 0; i < arity; ++i) {
188 ir_node* op = fc->costs[i].irn;
189 if (op == last) continue;
190 if (get_irn_mode(op) == mode_M) continue;
191 if (arch_irn_is(cur_arch_env, op, ignore)) continue;
192 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;
279 if (is_irn_forking(a1->irn)) {
281 } else if (is_irn_forking(b1->irn)) {
284 ret = b1->cost - a1->cost;
286 /* place live-out nodes later */
287 ret = (count_result(a1->irn) != 0) - (count_result(b1->irn) != 0);
290 #if defined NORMAL_DBG
291 ir_fprintf(stderr, "root %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
297 static void normal_sched_block(ir_node* block, void* env)
299 heights_t* heights = env;
300 ir_node** roots = get_irn_link(block);
302 irn_cost_pair* root_costs;
306 #if defined NORMAL_DBG
307 ir_fprintf(stderr, "sched walking block %+F\n", block);
311 #if defined NORMAL_DBG
312 fprintf(stderr, "has no roots\n");
317 root_count = ARR_LEN(roots);
318 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
319 for (i = 0; i < root_count; ++i) {
320 root_costs[i].irn = roots[i];
321 root_costs[i].cost = get_irn_height(heights, roots[i]);
322 #if defined NORMAL_DBG
323 ir_fprintf(stderr, "height of %+F is %u\n", roots[i], root_costs[i].cost);
326 qsort(root_costs, root_count, sizeof(*root_costs), root_cmp);
327 #if defined NORMAL_DBG
332 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
333 for (i = 0; i < n; ++i) {
334 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
336 fprintf(stderr, "\n");
340 sched = NEW_ARR_F(ir_node*, 0);
341 for (i = 0; i < root_count; ++i) {
342 ir_node* irn = root_costs[i].irn;
343 assert(must_be_scheduled(irn));
344 sched = sched_node(sched, irn);
346 set_irn_link(block, sched);
349 #if defined NORMAL_DBG
351 int n = ARR_LEN(sched);
354 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
355 for (i = 0; i < n; ++i) {
356 ir_fprintf(stderr, " %+F\n", sched[i]);
358 fprintf(stderr, "\n");
364 static void *normal_init_graph(const list_sched_selector_t *vtab,
365 const be_irg_t *birg)
367 ir_graph *irg = be_get_birg_irg(birg);
372 cur_arch_env = be_get_birg_arch_env(birg);
376 heights = heights_new(irg);
378 irg_walk_graph(irg, normal_cost_walker, NULL, NULL);
379 irg_walk_graph(irg, collect_roots, NULL, NULL);
380 inc_irg_visited(irg);
381 irg_block_walk_graph(irg, normal_sched_block, NULL, heights);
383 heights_free(heights);
389 static void *normal_init_block(void *graph_env, ir_node *block)
398 const list_sched_selector_t normal_selector = {
402 NULL, /* to_appear_in_schedule */
403 NULL, /* node_ready */
404 NULL, /* node_selected */
407 NULL, /* finish_block */
408 NULL /* finish_graph */