if (get_irn_irg(irn)->be_data == NULL)
return;
- if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
+ if (sched_is_scheduled(irn) && sched_has_prev(irn) && !is_Block(irn)) {
ir_node *prev = sched_prev(irn);
fprintf(F, "edge:{sourcename: ");
print_nodeid(F, irn);
/**
* @file
* @brief data structures for scheduling nodes in basic blocks.
- * (This file does not contain the scheduling algorithms)
* @author Sebastian Hack, Matthias Braun
*/
#ifndef FIRM_BE_BESCHED_H
/**
* Check, if the node is scheduled.
+ * Block nodes are reported as scheduled as they mark the begin and end
+ * of the scheduling list.
* @param irn The node.
* @return 1, if the node is scheduled, 0 if not.
*/