+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
#include <stdlib.h>
#include "impl.h"
#include "irprintf.h"
#include "irgwalk.h"
-#include "irnode.h"
+#include "irnode_t.h"
+#include "iredges_t.h"
#include "debug.h"
#include "besched_t.h"
-#include "besched.h"
+#include "beutil.h"
#include "belistsched.h"
FIRM_IMPL1(sched_get_time_step, int, const ir_node *)
FIRM_IMPL1(sched_last, ir_node *, const ir_node *)
FIRM_IMPL2(sched_add_after, ir_node *, ir_node *, ir_node *)
FIRM_IMPL2(sched_add_before, ir_node *, ir_node *, ir_node *)
+FIRM_IMPL1_VOID(sched_remove, ir_node *)
size_t sched_irn_data_offset = 0;
FILE *f = env;
const ir_node *curr;
- ir_fprintf(f, "%n:\n", block);
+ ir_fprintf(f, "%+F:\n", block);
sched_foreach(block, curr) {
- ir_fprintf(f, "\t%n\n", curr);
+ sched_info_t *info = get_irn_sched_info(curr);
+ ir_fprintf(f, "\t%6d: %+F\n", info->time_step, curr);
}
}
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++;
+ if(n <= 0)
+ return 1;
+
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;
}
for(i = 0, n = get_irn_arity(irn); i < n; i++) {
ir_node *op = get_irn_n(irn, i);
- if(mode_is_datab(get_irn_mode(op))
+ 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,
- "%n is operand of %n but scheduled after", op, irn));
+ "%+F: %+F is operand of %+F but scheduled after\n", block, op, irn));
res = 0;
}
}
for(i = 1; i < n; ++i) {
if(save_time_step[i] - save_time_step[i - 1] <= 0) {
DBG((dbg_sched, LEVEL_DEFAULT,
- "position %d: time step shrinks (from %d to %d)\n",
- i, save_time_step[i - 1], save_time_step[i]));
+ "%+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;
}
}
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;
}
return res;
}
+
+extern ir_node *sched_skip(ir_node *from, int forward,
+ sched_predicator_t *predicator, void *data)
+{
+ const ir_node *bl = get_block(from);
+ ir_node *curr;
+
+ for(curr = from; curr != bl && predicator(curr, data);
+ curr = forward ? sched_next(curr) : sched_prev(curr));
+ return curr;
+}