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 ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
53 ir_nodeset_t *live_set)
55 ir_nodeset_iterator_t iter;
64 ir_nodeset_iterator_init(&iter, ready_set);
65 irn = ir_nodeset_iterator_next(&iter);
66 block = get_nodes_block(irn);
67 sched = get_irn_link(block);
68 sched_count = ARR_LEN(sched);
69 for (; sched_count-- != 0; ++sched) {
70 ir_node* irn = *sched;
71 if (ir_nodeset_contains(ready_set, irn) &&
72 !arch_irn_class_is(irn, branch)) {
73 #if defined NORMAL_DBG
74 ir_fprintf(stderr, "scheduling %+F\n", irn);
84 typedef struct irn_cost_pair {
90 static int cost_cmp(const void* a, const void* b)
92 const irn_cost_pair* const a1 = a;
93 const irn_cost_pair* const b1 = b;
94 int ret = b1->cost - a1->cost;
96 ret = (int)get_irn_idx(a1->irn) - (int)get_irn_idx(b1->irn);
97 #if defined NORMAL_DBG
98 ir_fprintf(stderr, "cost %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
104 typedef struct flag_and_cost {
106 irn_cost_pair costs[];
110 static int count_result(const ir_node* irn)
112 const ir_mode* mode = get_irn_mode(irn);
116 !arch_irn_is(irn, ignore);
120 /* TODO high cost for store trees
124 static int normal_tree_cost(ir_node* irn)
126 flag_and_cost* fc = get_irn_link(irn);
127 ir_node* block = get_nodes_block(irn);
128 int arity = get_irn_arity(irn);
139 return normal_tree_cost(get_Proj_pred(irn));
143 irn_cost_pair* costs;
146 fc = malloc(sizeof(*fc) + sizeof(*fc->costs) * arity);
150 for (i = 0; i < arity; ++i) {
151 ir_node* pred = get_irn_n(irn, i);
154 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
156 } else if (get_nodes_block(pred) != block) {
159 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 if (!arch_irn_is(pred, ignore)) {
165 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
166 pred_fc = get_irn_link(real_pred);
167 pred_fc->no_root = 1;
168 #if defined NORMAL_DBG
169 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
175 costs[i].cost = cost;
178 qsort(costs, arity, sizeof(*costs), cost_cmp);
179 set_irn_link(irn, fc);
184 for (i = 0; i < arity; ++i) {
185 ir_node* op = fc->costs[i].irn;
186 if (op == last) continue;
187 if (get_irn_mode(op) == mode_M) continue;
188 if (arch_irn_is(op, ignore)) continue;
189 cost = MAX(fc->costs[i].cost + n_op_res, cost);
193 n_res = count_result(irn);
194 cost = MAX(n_res, cost);
196 #if defined NORMAL_DBG
197 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
204 static void normal_cost_walker(ir_node* irn, void* env)
208 #if defined NORMAL_DBG
209 ir_fprintf(stderr, "cost walking node %+F\n", irn);
211 if (is_Block(irn)) return;
212 if (!must_be_scheduled(irn)) return;
213 normal_tree_cost(irn);
217 static void collect_roots(ir_node* irn, void* env)
223 if (is_Block(irn)) return;
224 if (!must_be_scheduled(irn)) return;
226 is_root = be_is_Keep(irn) || !((flag_and_cost*)get_irn_link(irn))->no_root;
228 #if defined NORMAL_DBG
229 ir_fprintf(stderr, "%+F is %sroot\n", irn, is_root ? "" : "no ");
233 ir_node* block = get_nodes_block(irn);
234 ir_node** roots = get_irn_link(block);
236 roots = NEW_ARR_F(ir_node*, 0);
238 ARR_APP1(ir_node*, roots, irn);
239 set_irn_link(block, roots);
244 static ir_node** sched_node(ir_node** sched, ir_node* irn)
246 ir_node* block = get_nodes_block(irn);
247 flag_and_cost* fc = get_irn_link(irn);
248 irn_cost_pair* irns = fc->costs;
249 int arity = get_irn_arity(irn);
252 if (irn_visited_else_mark(irn)) return sched;
253 if (is_End(irn)) return sched;
255 if (!is_Phi(irn) && !be_is_Keep(irn)) {
256 for (i = 0; i < arity; ++i) {
257 ir_node* pred = irns[i].irn;
258 if (get_nodes_block(pred) != block) continue;
259 if (get_irn_mode(pred) == mode_M) continue;
260 if (is_Proj(pred)) pred = get_Proj_pred(pred);
261 sched = sched_node(sched, pred);
265 ARR_APP1(ir_node*, sched, irn);
270 static int root_cmp(const void* a, const void* b)
272 const irn_cost_pair* const a1 = a;
273 const irn_cost_pair* const b1 = b;
275 if (is_irn_forking(a1->irn)) {
277 } else if (is_irn_forking(b1->irn)) {
280 ret = b1->cost - a1->cost;
282 /* place live-out nodes later */
283 ret = (count_result(a1->irn) != 0) - (count_result(b1->irn) != 0);
286 #if defined NORMAL_DBG
287 ir_fprintf(stderr, "root %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
293 static void normal_sched_block(ir_node* block, void* env)
295 heights_t* heights = env;
296 ir_node** roots = get_irn_link(block);
298 irn_cost_pair* root_costs;
302 #if defined NORMAL_DBG
303 ir_fprintf(stderr, "sched walking block %+F\n", block);
307 #if defined NORMAL_DBG
308 fprintf(stderr, "has no roots\n");
313 root_count = ARR_LEN(roots);
314 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
315 for (i = 0; i < root_count; ++i) {
316 root_costs[i].irn = roots[i];
317 root_costs[i].cost = get_irn_height(heights, roots[i]);
318 #if defined NORMAL_DBG
319 ir_fprintf(stderr, "height of %+F is %u\n", roots[i], root_costs[i].cost);
322 qsort(root_costs, root_count, sizeof(*root_costs), root_cmp);
323 #if defined NORMAL_DBG
328 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
329 for (i = 0; i < n; ++i) {
330 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
332 fprintf(stderr, "\n");
336 sched = NEW_ARR_F(ir_node*, 0);
337 for (i = 0; i < root_count; ++i) {
338 ir_node* irn = root_costs[i].irn;
339 assert(must_be_scheduled(irn));
340 sched = sched_node(sched, irn);
342 set_irn_link(block, sched);
345 #if defined NORMAL_DBG
347 int n = ARR_LEN(sched);
350 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
351 for (i = 0; i < n; ++i) {
352 ir_fprintf(stderr, " %+F\n", sched[i]);
354 fprintf(stderr, "\n");
360 static void *normal_init_graph(const list_sched_selector_t *vtab,
361 const be_irg_t *birg)
363 ir_graph *irg = be_get_birg_irg(birg);
370 heights = heights_new(irg);
372 irg_walk_graph(irg, normal_cost_walker, NULL, NULL);
373 irg_walk_graph(irg, collect_roots, NULL, NULL);
374 inc_irg_visited(irg);
375 irg_block_walk_graph(irg, normal_sched_block, NULL, heights);
377 heights_free(heights);
383 static void *normal_init_block(void *graph_env, ir_node *block)
392 const list_sched_selector_t normal_selector = {
396 NULL, /* to_appear_in_schedule */
397 NULL, /* node_ready */
398 NULL, /* node_selected */
401 NULL, /* finish_block */
402 NULL /* finish_graph */