sched: do not show first->block schedule edge

diff --git a/ir/be/beinfo.c b/ir/be/beinfo.c
index 56f5964..95cceb4 100644 (file)
--- a/ir/be/beinfo.c
+++ b/ir/be/beinfo.c
@@ -155,7 +155,7 @@ static void sched_edge_hook(FILE *F, const ir_node *irn)
        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);

diff --git a/ir/be/besched.h b/ir/be/besched.h
index 7c83f66..bec0dc1 100644 (file)
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -20,7 +20,6 @@
 /**
  * @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
@@ -42,6 +41,8 @@ static sched_info_t *get_irn_sched_info(const ir_node *node)
 
 /**
  * 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.
  */