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);
144 irn_cost_pair* costs;
147 fc = malloc(sizeof(*fc) + sizeof(*fc->costs) * arity);
151 for (i = 0; i < arity; ++i) {
152 ir_node* pred = get_irn_n(irn, i);
155 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
157 } else if (get_nodes_block(pred) != block) {
160 flag_and_cost* pred_fc;
162 cost = normal_tree_cost(pred);
163 if (be_is_Barrier(pred)) cost = 1; // XXX hack: the barrier causes all users to have a reguse of #regs
164 pred_fc = get_irn_link(pred);
165 pred_fc->no_root = 1;
166 #if defined NORMAL_DBG
167 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, pred);
172 costs[i].cost = cost;
174 if (cost > cost_max) {
177 } else if (cost == cost_max) {
182 qsort(costs, arity, sizeof(*costs), cost_cmp);
183 set_irn_link(irn, fc);
185 irn_cost_pair* costs = fc->costs;
189 cost_max = costs[0].cost;
191 for (i = 0; i < arity; ++i) {
192 if (costs[i].cost < cost_max) break;
199 for (i = 0; i < arity; ++i) {
200 if (get_irn_mode(fc->costs[i].irn) == mode_M) continue;
201 if (arch_irn_is(cur_arch_env, fc->costs[i].irn, ignore)) continue;
202 cost = MAX(fc->costs[i].cost + n_op_res, cost);
205 n_res = count_result(irn);
206 cost = MAX(n_res, cost);
208 #if defined NORMAL_DBG
209 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
216 static void normal_cost_walker(ir_node* irn, void* env)
220 #if defined NORMAL_DBG
221 ir_fprintf(stderr, "cost walking node %+F\n", irn);
223 if (is_Block(irn)) return;
224 if (!must_be_scheduled(irn)) return;
225 normal_tree_cost(irn);
229 static void collect_roots(ir_node* irn, void* env)
235 if (is_Block(irn)) return;
236 if (!must_be_scheduled(irn)) return;
238 fc = get_irn_link(irn);
240 #if defined NORMAL_DBG
241 ir_fprintf(stderr, "%+F is %sroot\n", irn, fc->no_root ? "no " : "");
245 ir_node* block = get_nodes_block(irn);
246 ir_node** roots = get_irn_link(block);
248 roots = NEW_ARR_F(ir_node*, 0);
250 ARR_APP1(ir_node*, roots, irn);
251 set_irn_link(block, roots);
256 static ir_node** sched_node(ir_node** sched, ir_node* irn)
258 ir_node* block = get_nodes_block(irn);
259 flag_and_cost* fc = get_irn_link(irn);
260 irn_cost_pair* irns = fc->costs;
261 int arity = get_irn_arity(irn);
264 if (irn_visited(irn)) return sched;
265 if (is_End(irn)) return sched;
268 for (i = 0; i < arity; ++i) {
269 ir_node* pred = irns[i].irn;
270 if (get_nodes_block(pred) != block) continue;
271 if (get_irn_mode(pred) == mode_M) continue;
272 if (is_Proj(pred)) pred = get_Proj_pred(pred);
273 sched = sched_node(sched, pred);
277 mark_irn_visited(irn);
278 ARR_APP1(ir_node*, sched, irn);
283 static void normal_sched_block(ir_node* block, void* env)
285 ir_node** roots = get_irn_link(block);
287 irn_cost_pair* root_costs;
293 #if defined NORMAL_DBG
294 ir_fprintf(stderr, "sched walking block %+F\n", block);
298 #if defined NORMAL_DBG
299 fprintf(stderr, "has no roots\n");
304 root_count = ARR_LEN(roots);
305 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
306 for (i = 0; i < root_count; ++i) {
307 root_costs[i].irn = roots[i];
308 root_costs[i].cost = normal_tree_cost(roots[i]);
310 qsort(root_costs, root_count, sizeof(*root_costs), cost_cmp);
311 #if defined NORMAL_DBG
316 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
317 for (i = 0; i < n; ++i) {
318 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
320 fprintf(stderr, "\n");
324 sched = NEW_ARR_F(ir_node*, 0);
325 for (i = 0; i < root_count; ++i) {
326 ir_node* irn = root_costs[i].irn;
327 assert(must_be_scheduled(irn));
328 sched = sched_node(sched, irn);
330 set_irn_link(block, sched);
333 #if defined NORMAL_DBG
335 int n = ARR_LEN(sched);
338 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
339 for (i = 0; i < n; ++i) {
340 ir_fprintf(stderr, " %+F\n", sched[i]);
342 fprintf(stderr, "\n");
348 static void *normal_init_graph(const list_sched_selector_t *vtab,
349 const be_irg_t *birg)
351 ir_graph* irg = be_get_birg_irg(birg);
355 cur_arch_env = be_get_birg_arch_env(birg);
359 irg_walk_graph(irg, normal_cost_walker, NULL, NULL);
360 irg_walk_graph(irg, collect_roots, NULL, NULL);
361 inc_irg_visited(irg);
362 irg_block_walk_graph(irg, normal_sched_block, NULL, NULL);
368 static void *normal_init_block(void *graph_env, ir_node *block)
377 const list_sched_selector_t normal_selector = {
381 NULL, /* to_appear_in_schedule */
382 NULL, /* node_ready */
383 NULL, /* node_selected */
386 NULL, /* finish_block */
387 NULL /* finish_graph */