{
int i, n;
+ if(get_irn_opcode(irn) == iro_Start)
+ return 1;
+
for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
if(mode_is_datab(get_irn_mode(op)))
/**
* 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.
+ * if there is no node in the schedule.
*/
static INLINE ir_node *_sched_last(const ir_node *block)
{
*/
static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
{
- sched_info_t *info = get_irn_sched_info(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;
+ _sched_set_time_stamp(irn);
+ info->scheduled = 1;
return irn;
}
return irn;
}
+/**
+ * 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);
+ info->scheduled = 0;
+}
+
/**
* Check, if thenode is scheduled.
* @param irn The node.
*/
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_remove(irn) _sched_remove(irn)
#define sched_is_scheduled(irn) _sched_is_scheduled(irn)
#define sched_cmp(a, b) _sched_cmp(a, b)