summaryrefslogtreecommitdiffhomepage
path: root/ir/be/besched.h
diff options
context:
space:
mode:
authorMatthias Braun <matze@braunis.de>2006-12-18 13:35:58 +0100
committerMatthias Braun <matze@braunis.de>2006-12-18 13:35:58 +0100
commit8848eae046b950b8f9d4138a4a91b4af94cae5e6 (patch)
tree61a5cef6f784ae6c561961d49673c263f4fe8d07 /ir/be/besched.h
parent2ac217139bd2e6bf6be43f65ecc4adb7653af9a5 (diff)
- Added a few asserts to the besched API, so you can't schedule a node
that is already scheduled
Diffstat (limited to 'ir/be/besched.h')
-rw-r--r--ir/be/besched.h22
1 files changed, 2 insertions, 20 deletions
diff --git a/ir/be/besched.h b/ir/be/besched.h
index c2e9d2e..78edf13 100644
--- a/ir/be/besched.h
+++ b/ir/be/besched.h
@@ -10,8 +10,6 @@
#include "firm_types.h"
-#include "execfreq.h"
-
void be_sched_dump(FILE *f, ir_graph *irg);
int sched_get_time_step(const ir_node *irn);
@@ -23,13 +21,10 @@ ir_node *sched_first(const ir_node *block);
ir_node *sched_last(const ir_node *block);
ir_node *sched_add_before(ir_node *before, ir_node *irn);
ir_node *sched_add_after(ir_node *before, ir_node *irn);
+void sched_init_block(ir_node *block);
+void sched_reset(ir_node *node);
void sched_remove(ir_node *irn);
-/**
- * Returns the first block of a graphs block schedule.
- */
-ir_node *sched_irg_first(const ir_graph *irg);
-
#define sched_is_end(irn) is_Block(irn)
#define sched_is_begin(irn) is_Block(irn)
@@ -56,19 +51,6 @@ ir_node *sched_irg_first(const ir_graph *irg);
sched_foreach_reverse_from(sched_last(block), irn)
/**
- * Calculates a block schedule. The schedule is returned as
- * an array allocated on the irg's obstack.
- *
- * @param irg the graph to be scheduled
- *
- * @return A list of all blocks in schedule order. This list is
- * allocated on irg's obstack and is freed if the graph is destroyed.
- *
- * This function implements a simple extended block scheduling algorithm.
- */
-ir_node **sched_create_block_schedule(ir_graph *irg, ir_exec_freq *execfreqs);
-
-/**
* Removes dead nodes from schedule
* @param irg the graph
*/