- firm_dbg_module_t *dbg_sched = firm_dbg_register("be.sched");
- int res = 1;
- const ir_node *irn;
- int i, n;
- int *save_time_step;
- const ir_node **save_nodes;
- const ir_edge_t *edge;
- pset *scheduled_nodes = pset_new_ptr_default();
-
- firm_dbg_set_mask(dbg_sched, -1);
-
- /* Count the number of nodes in the schedule. */
- n = 0;
- sched_foreach(block, irn)
- n++;
-
- save_time_step = malloc(n * sizeof(save_time_step[0]));
- save_nodes = malloc(n * sizeof(save_nodes[0]));
-
- i = 0;
- sched_foreach(block, irn) {
- sched_info_t *info = get_irn_sched_info(irn);
- save_time_step[i] = info->time_step;
- save_nodes[i] = irn;
- info->time_step = i;
- pset_insert_ptr(scheduled_nodes, irn);
-
- i += 1;
- }
-
- /*
- * Check if each relevant operand of a node is scheduled before
- * the node itself.
- */
- sched_foreach(block, irn) {
- int i, n;
- int step = sched_get_time_step(irn);
-
- for(i = 0, n = get_irn_arity(irn); i < n; i++) {
- ir_node *op = get_irn_n(irn, i);
-
- if(to_appear_in_schedule(op)
- && !is_Phi(irn)
- && get_nodes_block(op) == block
- && sched_get_time_step(op) > step) {
-
- DBG((dbg_sched, LEVEL_DEFAULT,
- "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
- res = 0;
- }
- }
- }
-
- /* Check, if the time steps are correct */
- for(i = 1; i < n; ++i) {
- if(save_time_step[i] - save_time_step[i - 1] <= 0) {
- DBG((dbg_sched, LEVEL_DEFAULT,
- "%+F from %+F(%d) -> %+F(%d) step shrinks from %d -> %d\n",
- block, save_nodes[i - 1], i - 1, save_nodes[i], i,
- save_time_step[i - 1], save_time_step[i]));
- res = 0;
- }
- }
-
- /* Restore the old time steps */
- i = 0;
- sched_foreach(block, irn) {
- sched_info_t *info = get_irn_sched_info(irn);
- info->time_step = save_time_step[i++];
- }
-
- /* Check for all nodes in the block if they are scheduled. */
- foreach_out_edge(block, edge) {
- ir_node *irn = get_edge_src_irn(edge);
- if(to_appear_in_schedule(irn) && !pset_find_ptr(scheduled_nodes, irn))
- DBG((dbg_sched, LEVEL_DEFAULT,
- "%+F: %+F is in block but not scheduled\n", block, irn));
- }
-
- del_pset(scheduled_nodes);
- free(save_time_step);
- free(save_nodes);
- return res;
-}
-
-static void sched_verify_walker(ir_node *irn, void *data)
+ const ir_node *bl = get_block(from);
+ ir_node *curr;
+
+ if (is_Block(from))
+ from = forward ? sched_next(from) : sched_prev(from);
+
+ for(curr = from; curr != bl && predicator(curr, data); curr = forward ? sched_next(curr) : sched_prev(curr));
+
+ return curr;
+}
+
+/** A simple forward single linked list. */
+typedef struct {
+ ir_node *start; /**< start of the list */
+ ir_node *end; /**< last block in the list */
+ unsigned n_blks; /**< number of blocks in the list */
+} anchor;
+
+static void add_block(anchor *list, ir_node *block) {
+ if(list->start == NULL) {
+ list->start = block;
+ list->end = block;
+ } else {
+ set_irn_link(list->end, block);
+ list->end = block;
+ }
+
+ list->n_blks++;
+}
+
+static void create_block_list(ir_node *leader_block, anchor *list) {
+ int i;
+ ir_node *block = NULL;
+ const ir_edge_t *edge;
+
+ ir_extblk *extbb = get_Block_extbb(leader_block);
+ if(extbb_visited(extbb))
+ return;
+ mark_extbb_visited(extbb);
+
+ for(i = 0; i < get_extbb_n_blocks(extbb); ++i) {
+ block = get_extbb_block(extbb, i);
+ add_block(list, block);
+ }
+
+ assert(block != NULL);
+
+ // pick successor extbbs
+ foreach_block_succ(block, edge) {
+ ir_node *succ = get_edge_src_irn(edge);
+
+ create_block_list(succ, list);
+ }
+
+ for(i = 0; i < get_extbb_n_blocks(extbb) - 1; ++i) {
+ block = get_extbb_block(extbb, i);
+ foreach_block_succ(block, edge) {
+ ir_node *succ = get_edge_src_irn(edge);
+
+ create_block_list(succ, list);
+ }
+ }
+}
+
+void compute_extbb_execfreqs(ir_graph *irg, exec_freq_t *execfreqs);
+
+/*
+ * Calculates a block schedule. The schedule is stored as a linked
+ * list starting at the start_block of the irg.
+ */
+ir_node **sched_create_block_schedule(ir_graph *irg, exec_freq_t *execfreqs)
+{
+ anchor list;
+ ir_node **blk_list, *b, *n;
+ unsigned i;
+
+ /* schedule extended basic blocks */
+ compute_extbb_execfreqs(irg, execfreqs);
+ //compute_extbb(irg);
+
+ list.start = NULL;
+ list.end = NULL;
+ list.n_blks = 0;
+ inc_irg_block_visited(irg);
+ create_block_list(get_irg_start_block(irg), &list);
+
+ /** create an array, so we can go forward and backward */
+ blk_list = NEW_ARR_D(ir_node *, irg->obst,list.n_blks);
+
+ for (i = 0, b = list.start; b; b = n, ++i) {
+ n = get_irn_link(b);
+ blk_list[i] = b;
+ }
+
+ return blk_list;
+}
+
+typedef struct remove_dead_nodes_env_t_ {
+ ir_graph *irg;
+ bitset_t *reachable;
+} remove_dead_nodes_env_t;
+
+static void mark_dead_nodes_walker(ir_node *node, void *data)