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
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 struct obstack obst; /**< obstack for temporary data */
47 ir_node* curr_list; /**< current block schedule list */
50 static int must_be_scheduled(const ir_node* const irn)
52 return !is_Proj(irn) && !is_Sync(irn);
56 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
57 ir_nodeset_t *live_set)
59 instance_t* inst = block_env;
63 ir_nodeset_iterator_t iter;
67 for (irn = inst->curr_list; irn != NULL; last = irn, irn = next) {
68 next = get_irn_link(irn);
69 if (ir_nodeset_contains(ready_set, irn)) {
70 #if defined NORMAL_DBG
71 ir_fprintf(stderr, "scheduling %+F\n", irn);
74 inst->curr_list = next;
76 set_irn_link(last, next);
81 ir_nodeset_iterator_init(&iter, ready_set);
82 irn = ir_nodeset_iterator_next(&iter);
87 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;
96 int ret = b1->cost - a1->cost;
98 ret = (int)get_irn_idx(a1->irn) - (int)get_irn_idx(b1->irn);
99 #if defined NORMAL_DBG
100 ir_fprintf(stderr, "cost %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
106 typedef struct flag_and_cost {
108 irn_cost_pair costs[];
111 #define get_irn_fc(irn) ((flag_and_cost*)get_irn_link(irn))
112 #define set_irn_fc(irn, fc) set_irn_link(irn, fc)
115 static int count_result(const ir_node* irn)
117 const ir_mode* mode = get_irn_mode(irn);
119 if (mode == mode_M || mode == mode_X)
122 if (arch_get_register_req_out(irn)->type & arch_register_req_type_ignore)
129 /* TODO high cost for store trees
132 static int normal_tree_cost(ir_node* irn, instance_t *inst)
146 return normal_tree_cost(get_Proj_pred(irn), inst);
149 arity = get_irn_arity(irn);
150 fc = get_irn_fc(irn);
153 irn_cost_pair* costs;
155 ir_node* block = get_nodes_block(irn);
157 fc = OALLOCF(&inst->obst, flag_and_cost, costs, arity);
161 for (i = 0; i < arity; ++i) {
162 ir_node* pred = get_irn_n(irn, i);
165 if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
167 } else if (get_nodes_block(pred) != block) {
170 flag_and_cost* pred_fc;
173 cost = normal_tree_cost(pred, inst);
174 if (be_is_Barrier(pred)) cost = 1; // XXX hack: the barrier causes all users to have a reguse of #regs
175 if (!arch_irn_is_ignore(pred)) {
176 real_pred = (is_Proj(pred) ? get_Proj_pred(pred) : pred);
177 pred_fc = get_irn_fc(real_pred);
178 pred_fc->no_root = 1;
179 #if defined NORMAL_DBG
180 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, real_pred);
186 costs[i].cost = cost;
189 qsort(costs, arity, sizeof(*costs), cost_cmp);
190 set_irn_link(irn, fc);
195 for (i = 0; i < arity; ++i) {
196 ir_node* op = fc->costs[i].irn;
197 if (op == last) continue;
198 if (get_irn_mode(op) == mode_M) continue;
199 if (arch_irn_is_ignore(op)) continue;
200 cost = MAX(fc->costs[i].cost + n_op_res, cost);
204 n_res = count_result(irn);
205 cost = MAX(n_res, cost);
207 #if defined NORMAL_DBG
208 ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
215 static void normal_cost_walker(ir_node* irn, void* env)
217 instance_t *inst = env;
219 #if defined NORMAL_DBG
220 ir_fprintf(stderr, "cost walking node %+F\n", irn);
222 if (is_Block(irn)) return;
223 if (!must_be_scheduled(irn)) return;
224 normal_tree_cost(irn, inst);
228 static void collect_roots(ir_node* irn, void* env)
234 if (is_Block(irn)) return;
235 if (!must_be_scheduled(irn)) return;
237 is_root = be_is_Keep(irn) || !get_irn_fc(irn)->no_root;
239 #if defined NORMAL_DBG
240 ir_fprintf(stderr, "%+F is %sroot\n", irn, is_root ? "" : "no ");
244 ir_node* block = get_nodes_block(irn);
245 ir_node** roots = get_irn_link(block);
247 roots = NEW_ARR_F(ir_node*, 0);
249 ARR_APP1(ir_node*, roots, irn);
250 set_irn_link(block, roots);
255 static ir_node** sched_node(ir_node** sched, ir_node* irn)
257 if (irn_visited_else_mark(irn)) return sched;
258 if (is_End(irn)) return sched;
260 if (!is_Phi(irn) && !be_is_Keep(irn)) {
261 ir_node* block = get_nodes_block(irn);
262 int arity = get_irn_arity(irn);
263 flag_and_cost* fc = get_irn_fc(irn);
264 irn_cost_pair* irns = fc->costs;
267 for (i = 0; i < arity; ++i) {
268 ir_node* pred = irns[i].irn;
269 if (get_nodes_block(pred) != block) continue;
270 if (get_irn_mode(pred) == mode_M) continue;
271 if (is_Proj(pred)) pred = get_Proj_pred(pred);
272 sched = sched_node(sched, pred);
276 ARR_APP1(ir_node*, sched, irn);
281 static int root_cmp(const void* a, const void* b)
283 const irn_cost_pair* const a1 = a;
284 const irn_cost_pair* const b1 = b;
286 if (is_irn_forking(a1->irn)) {
288 } else if (is_irn_forking(b1->irn)) {
291 ret = b1->cost - a1->cost;
293 /* place live-out nodes later */
294 ret = (count_result(a1->irn) != 0) - (count_result(b1->irn) != 0);
297 #if defined NORMAL_DBG
298 ir_fprintf(stderr, "root %+F %s %+F\n", a1->irn, ret < 0 ? "<" : ret > 0 ? ">" : "=", b1->irn);
304 static void normal_sched_block(ir_node* block, void* env)
306 ir_node** roots = get_irn_link(block);
307 heights_t* heights = env;
309 irn_cost_pair* root_costs;
313 #if defined NORMAL_DBG
314 ir_fprintf(stderr, "sched walking block %+F\n", block);
318 #if defined NORMAL_DBG
319 fprintf(stderr, "has no roots\n");
324 root_count = ARR_LEN(roots);
325 NEW_ARR_A(irn_cost_pair, root_costs, root_count);
326 for (i = 0; i < root_count; ++i) {
327 root_costs[i].irn = roots[i];
328 root_costs[i].cost = get_irn_height(heights, roots[i]);
329 #if defined NORMAL_DBG
330 ir_fprintf(stderr, "height of %+F is %u\n", roots[i], root_costs[i].cost);
333 qsort(root_costs, root_count, sizeof(*root_costs), root_cmp);
334 #if defined NORMAL_DBG
339 ir_fprintf(stderr, "Root Scheduling of %+F:\n", block);
340 for (i = 0; i < n; ++i) {
341 ir_fprintf(stderr, " %+F\n", root_costs[i].irn);
343 fprintf(stderr, "\n");
347 sched = NEW_ARR_F(ir_node*, 0);
348 for (i = 0; i < root_count; ++i) {
349 ir_node* irn = root_costs[i].irn;
350 assert(must_be_scheduled(irn));
351 sched = sched_node(sched, irn);
353 set_irn_link(block, sched);
356 #if defined NORMAL_DBG
358 int n = ARR_LEN(sched);
361 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
362 for (i = 0; i < n; ++i) {
363 ir_fprintf(stderr, " %+F\n", sched[i]);
365 fprintf(stderr, "\n");
371 static void *normal_init_graph(const list_sched_selector_t *vtab,
372 const be_irg_t *birg)
374 instance_t* inst = XMALLOC(instance_t);
375 ir_graph* irg = be_get_birg_irg(birg);
382 obstack_init(&inst->obst);
385 heights = heights_new(irg);
387 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
388 irg_walk_graph(irg, normal_cost_walker, NULL, inst);
389 irg_walk_graph(irg, collect_roots, NULL, NULL);
390 inc_irg_visited(irg);
391 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
392 irg_block_walk_graph(irg, normal_sched_block, NULL, heights);
393 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
395 heights_free(heights);
400 static void *normal_init_block(void *graph_env, ir_node *block)
402 instance_t* inst = graph_env;
403 ir_node** sched = get_irn_link(block);
404 ir_node* first = NULL;
407 /* turn into a list, so we can easily remove nodes.
408 The link field is used anyway. */
409 for (i = ARR_LEN(sched) - 1; i >= 0; --i) {
410 ir_node* irn = sched[i];
412 set_irn_link(irn, first);
416 /* note: we can free sched here, there should be no attempt to schedule
419 set_irn_link(block, sched);
420 inst->curr_list = first;
424 static void normal_finish_graph(void *env)
426 instance_t *inst = env;
428 /* block uses the link field to store the schedule */
429 ir_free_resources(inst->irg, IR_RESOURCE_IRN_LINK);
430 obstack_free(&inst->obst, NULL);
434 const list_sched_selector_t normal_selector = {
438 NULL, /* to_appear_in_schedule */
439 NULL, /* node_ready */
440 NULL, /* node_selected */
443 NULL, /* finish_block */