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
29 #include "besched_t.h"
30 #include "belistsched.h"
39 // XXX there is no one time init for schedulers
43 /** An instance of the normal scheduler. */
44 typedef struct instance_t {
45 ir_graph* irg; /**< the IR graph of this instance */
46 heights_t* heights; /**< height for the graph of this instance */
47 struct obstack obst; /**< obstack for temporary data */
48 ir_node*** block_lists; /**< list of all block scheduling list */
51 static int must_be_scheduled(const ir_node* const irn)
53 return !is_Proj(irn) && !is_Sync(irn);
57 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
58 ir_nodeset_t *live_set)
60 ir_nodeset_iterator_t iter;
69 ir_nodeset_iterator_init(&iter, ready_set);
70 irn = ir_nodeset_iterator_next(&iter);
71 block = get_nodes_block(irn);
72 sched = get_irn_link(block);
73 sched_count = ARR_LEN(sched);
74 for (; sched_count-- != 0; ++sched) {
75 ir_node* irn = *sched;
76 if (ir_nodeset_contains(ready_set, irn) &&
77 !arch_irn_class_is(irn, branch)) {
78 #if defined NORMAL_DBG
79 ir_fprintf(stderr, "scheduling %+F\n", irn);
89 typedef struct irn_cost_pair {
94 static int cost_cmp(const void* a, const void* b)
96 const irn_cost_pair* const a1 = a;
97 const irn_cost_pair* const b1 = b;
98 int ret = b1->cost - a1->cost;
100 ret = (int)get_irn_idx(a1->irn) - (int)get_irn_idx(b1->irn);
101 #if defined NORMAL_DBG
102 ir_fprintf(stderr, "cost %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
108 typedef struct flag_and_cost {
110 irn_cost_pair costs[];
113 #define get_irn_fc(irn) ((flag_and_cost*)get_irn_link(irn))
114 #define set_irn_fc(irn, fc) set_irn_link(irn, fc)
117 static int count_result(const ir_node* irn)
119 const ir_mode* mode = get_irn_mode(irn);
121 if (mode == mode_M || mode == mode_X)
124 if (arch_get_register_req_out(irn)->type & arch_register_req_type_ignore)
131 /* TODO high cost for store trees
134 static int normal_tree_cost(ir_node* irn, instance_t *inst)
148 return normal_tree_cost(get_Proj_pred(irn), inst);
151 arity = get_irn_arity(irn);
152 fc = get_irn_fc(irn);
155 irn_cost_pair* costs;
157 ir_node* block = get_nodes_block(irn);
159 fc = obstack_alloc(&inst->obst, sizeof(*fc) + sizeof(*fc->costs) * arity);
163 for (i = 0; i < arity; ++i) {
164 ir_node* pred = get_irn_n(irn, i);
167 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
169 } else if (get_nodes_block(pred) != block) {
172 flag_and_cost* pred_fc;
175 cost = normal_tree_cost(pred, inst);
176 if (be_is_Barrier(pred)) cost = 1; // XXX hack: the barrier causes all users to have a reguse of #regs
177 if (!arch_irn_is_ignore(pred)) {
178 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
179 pred_fc = get_irn_fc(real_pred);
180 pred_fc->no_root = 1;
181 #if defined NORMAL_DBG
182 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
188 costs[i].cost = cost;
191 qsort(costs, arity, sizeof(*costs), cost_cmp);
192 set_irn_link(irn, fc);
197 for (i = 0; i < arity; ++i) {
198 ir_node* op = fc->costs[i].irn;
199 if (op == last) continue;
200 if (get_irn_mode(op) == mode_M) continue;
201 if (arch_irn_is_ignore(op)) continue;
202 cost = MAX(fc->costs[i].cost + n_op_res, cost);
206 n_res = count_result(irn);
207 cost = MAX(n_res, cost);
209 #if defined NORMAL_DBG
210 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
217 static void normal_cost_walker(ir_node* irn, void* env)
219 instance_t *inst = env;
221 #if defined NORMAL_DBG
222 ir_fprintf(stderr, "cost walking node %+F\n", irn);
224 if (is_Block(irn)) return;
225 if (!must_be_scheduled(irn)) return;
226 normal_tree_cost(irn, inst);
230 static void collect_roots(ir_node* irn, void* env)
236 if (is_Block(irn)) return;
237 if (!must_be_scheduled(irn)) return;
239 is_root = be_is_Keep(irn) || !get_irn_fc(irn)->no_root;
241 #if defined NORMAL_DBG
242 ir_fprintf(stderr, "%+F is %sroot\n", irn, is_root ? "" : "no ");
246 ir_node* block = get_nodes_block(irn);
247 ir_node** roots = get_irn_link(block);
249 roots = NEW_ARR_F(ir_node*, 0);
251 ARR_APP1(ir_node*, roots, irn);
252 set_irn_link(block, roots);
257 static ir_node** sched_node(ir_node** sched, ir_node* irn)
259 if (irn_visited_else_mark(irn)) return sched;
260 if (is_End(irn)) return sched;
262 if (!is_Phi(irn) && !be_is_Keep(irn)) {
263 ir_node* block = get_nodes_block(irn);
264 int arity = get_irn_arity(irn);
265 flag_and_cost* fc = get_irn_fc(irn);
266 irn_cost_pair* irns = fc->costs;
269 for (i = 0; i < arity; ++i) {
270 ir_node* pred = irns[i].irn;
271 if (get_nodes_block(pred) != block) continue;
272 if (get_irn_mode(pred) == mode_M) continue;
273 if (is_Proj(pred)) pred = get_Proj_pred(pred);
274 sched = sched_node(sched, pred);
278 ARR_APP1(ir_node*, sched, irn);
283 static int root_cmp(const void* a, const void* b)
285 const irn_cost_pair* const a1 = a;
286 const irn_cost_pair* const b1 = b;
288 if (is_irn_forking(a1->irn)) {
290 } else if (is_irn_forking(b1->irn)) {
293 ret = b1->cost - a1->cost;
295 /* place live-out nodes later */
296 ret = (count_result(a1->irn) != 0) - (count_result(b1->irn) != 0);
299 #if defined NORMAL_DBG
300 ir_fprintf(stderr, "root %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
306 static void normal_sched_block(ir_node* block, void* env)
308 instance_t* inst = env;
309 ir_node** roots = get_irn_link(block);
312 irn_cost_pair* root_costs;
316 #if defined NORMAL_DBG
317 ir_fprintf(stderr, "sched walking block %+F\n", block);
321 #if defined NORMAL_DBG
322 fprintf(stderr, "has no roots\n");
327 heights = inst->heights;
328 root_count = ARR_LEN(roots);
329 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
330 for (i = 0; i < root_count; ++i) {
331 root_costs[i].irn = roots[i];
332 root_costs[i].cost = get_irn_height(heights, roots[i]);
333 #if defined NORMAL_DBG
334 ir_fprintf(stderr, "height of %+F is %u\n", roots[i], root_costs[i].cost);
337 qsort(root_costs, root_count, sizeof(*root_costs), root_cmp);
338 #if defined NORMAL_DBG
343 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
344 for (i = 0; i < n; ++i) {
345 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
347 fprintf(stderr, "\n");
351 sched = NEW_ARR_F(ir_node*, 0);
352 for (i = 0; i < root_count; ++i) {
353 ir_node* irn = root_costs[i].irn;
354 assert(must_be_scheduled(irn));
355 sched = sched_node(sched, irn);
358 set_irn_link(block, sched);
359 ARR_APP1(ir_node**, inst->block_lists, sched);
361 #if defined NORMAL_DBG
363 int n = ARR_LEN(sched);
366 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
367 for (i = 0; i < n; ++i) {
368 ir_fprintf(stderr, " %+F\n", sched[i]);
370 fprintf(stderr, "\n");
376 static void *normal_init_graph(const list_sched_selector_t *vtab,
377 const be_irg_t *birg)
379 instance_t *inst = XMALLOC(instance_t);
380 ir_graph *irg = be_get_birg_irg(birg);
386 obstack_init(&inst->obst);
388 inst->heights = heights_new(irg);
389 inst->block_lists = NEW_ARR_F(ir_node**, 0);
391 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
392 irg_walk_graph(irg, normal_cost_walker, NULL, inst);
393 irg_walk_graph(irg, collect_roots, NULL, NULL);
394 inc_irg_visited(irg);
395 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
396 irg_block_walk_graph(irg, normal_sched_block, NULL, inst);
397 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
399 heights_free(inst->heights);
404 void normal_finish_graph(void *env)
406 instance_t *inst = env;
409 for (i = ARR_LEN(inst->block_lists) - 1; i >= 0; --i) {
410 DEL_ARR_F(inst->block_lists[i]);
412 DEL_ARR_F(inst->block_lists);
414 /* block uses the link field to store the schedule */
415 ir_free_resources(inst->irg, IR_RESOURCE_IRN_LINK);
416 obstack_free(&inst->obst, NULL);
420 const list_sched_selector_t normal_selector = {
422 NULL, /* init_block */
424 NULL, /* to_appear_in_schedule */
425 NULL, /* node_ready */
426 NULL, /* node_selected */
429 NULL, /* finish_block */