projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
remove morgan spiller, it's unused and the coming bespill changes won't support morga...
[libfirm]
/
ir
/
be
/
besched.h
diff --git
a/ir/be/besched.h
b/ir/be/besched.h
index
3f3bf9c
..
88250c4
100644
(file)
--- a/
ir/be/besched.h
+++ b/
ir/be/besched.h
@@
-17,20
+17,28
@@
* PURPOSE.
*/
* PURPOSE.
*/
-/*
- * Scheduling utilities for nodes in Blocks and Blocks.
- *
- * $Id$
+/**
+ * @file
+ * @brief Scheduling utilities for nodes in Blocks and Blocks.
+ * @author Sebastian Hack
+ * @version $Id$
*/
*/
-#ifndef _BESCHED_H
-#define _BESCHED_H
+#ifndef
FIRM_BE
_BESCHED_H
+#define
FIRM_BE
_BESCHED_H
#include <stdio.h>
#include <stdio.h>
-#include "firm_types.h"
+#include "irgraph.h"
+#include "irnode.h"
+#include "beirg.h"
void be_sched_dump(FILE *f, ir_graph *irg);
void be_sched_dump(FILE *f, ir_graph *irg);
+/**
+ * returns the time step of a node. Each node in a block has a timestep
+ * unique to that block. a node schedule before another node has a lower
+ * timestep than this node.
+ */
int sched_get_time_step(const ir_node *irn);
int sched_has_next(const ir_node *irn);
int sched_has_prev(const ir_node *irn);
int sched_get_time_step(const ir_node *irn);
int sched_has_next(const ir_node *irn);
int sched_has_prev(const ir_node *irn);
@@
-39,8
+47,8
@@
ir_node *sched_next(const ir_node *irn);
ir_node *sched_prev(const ir_node *irn);
ir_node *sched_first(const ir_node *block);
ir_node *sched_last(const ir_node *block);
ir_node *sched_prev(const ir_node *irn);
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_add_before(ir_node *before, ir_node *irn);
+
void
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);
void sched_init_block(ir_node *block);
void sched_reset(ir_node *node);
void sched_remove(ir_node *irn);
@@
-74,6
+82,6
@@
void sched_remove(ir_node *irn);
* Removes dead nodes from schedule
* @param irg the graph
*/
* Removes dead nodes from schedule
* @param irg the graph
*/
-void be_remove_dead_nodes_from_schedule(
ir_graph *
irg);
+void be_remove_dead_nodes_from_schedule(
be_irg_t *b
irg);
-#endif /* _BESCHED_H */
+#endif /*
FIRM_BE
_BESCHED_H */