Commit 19f88633 authored by Matthias Braun's avatar Matthias Braun
Browse files

add comment

parent 913e5a99
......@@ -34,6 +34,11 @@
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);
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment