#include "irnode_t.h"
#include "irgraph_t.h"
+#include "beutil.h"
#include "besched.h"
typedef unsigned int sched_timestep_t;
sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
larger than b's. */
- int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
+ int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
} sched_info_t;
#define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
return get_irn_sched_info(irn)->time_step;
}
+/**
+ * Checks, if a node is to appear in a schedule. Such nodes either
+ * consume real data (mode datab) or produce such.
+ * @param irn The node to check for.
+ * @return 1, if the node consumes/produces data, false if not.
+ */
+static INLINE int to_appear_in_schedule(ir_node *irn)
+{
+ if(get_irn_opcode(irn) == iro_Start)
+ return 1;
+
+ return is_data_node(irn);
+}
+
/**
* Check, if an ir_node has a scheduling successor.
* @param irn The ir node.
*/
static INLINE int _sched_has_next(const ir_node *irn)
{
- const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
+ const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
const sched_info_t *info = get_irn_sched_info(irn);
const sched_info_t *block_info = get_irn_sched_info(block);
return info->list.next != &block_info->list;
*/
static INLINE int _sched_has_prev(const ir_node *irn)
{
- const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
+ const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
const sched_info_t *info = get_irn_sched_info(irn);
const sched_info_t *block_info = get_irn_sched_info(block);
return info->list.prev != &block_info->list;
/**
* Get the first node in a block schedule.
* @param block The block of which to get the schedule.
- * @return The first node in the schedule or the block itself if there is node in the schedule.
+ * @return The first node in the schedule or the block itself
+ * if there is no node in the schedule.
*/
static INLINE ir_node *_sched_first(const ir_node *block)
{
/**
* Get the last node in a schedule.
- * @param block The block to get the schedule for.
- * @return The last ir node in a schedule, or the block itself, if there is node in the schedule.
- * or it is empty.
+ * @param block The block to get the schedule for.
+ * @return The last ir node in a schedule, or the block itself
+ * if there is no node in the schedule.
*/
static INLINE ir_node *_sched_last(const ir_node *block)
{
* else we have to compute our time step from our
* neighbours.
*/
- if(after_ts == 0)
+ if(before_ts >= after_ts)
inf->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
else {
sched_timestep_t ts = (before_ts + after_ts) / 2;
*/
if(ts == before_ts || ts == after_ts)
sched_renumber(get_nodes_block(irn));
+ else
+ inf->time_step = ts;
}
}
*/
static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
{
- list_add_tail(&get_irn_sched_info(irn)->list, &get_irn_sched_info(before)->list);
- _sched_set_time_stamp(irn);
+ sched_info_t *info = get_irn_sched_info(irn);
+ list_add_tail(&info->list, &get_irn_sched_info(before)->list);
+ _sched_set_time_stamp(irn);
+ info->scheduled = 1;
return irn;
}
*/
static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
{
- list_add(&get_irn_sched_info(irn)->list, &get_irn_sched_info(after)->list);
- _sched_set_time_stamp(irn);
+ sched_info_t *info = get_irn_sched_info(irn);
+ list_add(&info->list, &get_irn_sched_info(after)->list);
+ _sched_set_time_stamp(irn);
+ info->scheduled = 1;
return irn;
}
/**
- * Check, if thenode is scheduled.
+ * Remove a node from the scheduled.
+ * @param irn The node.
+ */
+static INLINE void _sched_remove(ir_node *irn)
+{
+ sched_info_t *info = get_irn_sched_info(irn);
+ list_del(&info->list);
+ INIT_LIST_HEAD(&info->list);
+ info->scheduled = 0;
+}
+
+/**
+ * Check, if the node is scheduled.
* @param irn The node.
* @return 1, if the node is scheduled, 0 if not.
*/
-static INLINE int _sched_is_scheduled(ir_node *irn)
+static INLINE int _sched_is_scheduled(const ir_node *irn)
+{
+ return get_irn_sched_info(irn)->scheduled;
+}
+
+/**
+ * Compare two nodes according to their position in the schedule.
+ * @param a The first node.
+ * @param b The second node.
+ * @return A number smaller, equals to or larger than 0, if a is
+ * before, the same, or after b in the schedule.
+ */
+static INLINE int _sched_cmp(const ir_node *a, const ir_node *b)
{
- return get_irn_sched_info(irn)->scheduled;
+ assert(_sched_is_scheduled(a) && _sched_is_scheduled(b));
+ assert(get_nodes_block(a) == get_nodes_block(b));
+
+ return get_irn_sched_info(a)->time_step - get_irn_sched_info(b)->time_step;
}
/**
*/
extern int sched_verify_irg(ir_graph *irg);
+/**
+ * A predicate for a node.
+ * @param irn The node.
+ * @param data The custom data.
+ * @return 1 if irn should be skipped. Else 0.
+ */
+typedef int (sched_predicator_t)(const ir_node *irn, void *data);
+
+
+int sched_skip_cf_predicator(const ir_node *irn, void *data);
+int sched_skip_phi_predicator(const ir_node *irn, void *data);
+
+/**
+ * Skip nodes in a schedule.
+ * @param from The node to start from.
+ * @param forward The direction (1 for forward, 0 for backward).
+ * @param predicator The one who decides what is skipped.
+ * @param data Food for the predicator.
+ * @return The first node rejected by the predicator or the block
+ * itself if none was rejected.
+ */
+extern ir_node *sched_skip(ir_node *from, int forward,
+ sched_predicator_t *predicator, void *data);
#define sched_get_time_step(irn) _sched_get_time_step(irn)
#define sched_has_succ(irn) _sched_has_succ(irn)
#define sched_last(irn) _sched_last(irn)
#define sched_add_before(before, irn) _sched_add_before(before, irn)
#define sched_add_after(after, irn) _sched_add_after(after, irn)
-#define sched_is_scheduled(irn) _sched_is_scheduled(irn)
+#define sched_remove(irn) _sched_remove(irn)
+#define sched_is_scheduled(irn) _sched_is_scheduled(irn)
+#define sched_cmp(a, b) _sched_cmp(a, b)
#endif
projects / libfirm / blobdiff