-/* $Id$ */
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
-#ifndef _BESCHED_T_H
-#define _BESCHED_T_H
+/**
+ * @file
+ * @brief Scheduling utilities for nodes in Blocks and Blocks.
+ * @author Sebastian Hack
+ * @version $Id$
+ */
+#ifndef FIRM_BE_BESCHED_T_H
+#define FIRM_BE_BESCHED_T_H
#define SCHED_INITIAL_GRANULARITY (1 << 14)
#define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
-#define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
+#define get_irn_sched_info(irn) get_irn_data(skip_Proj_const(irn), sched_info_t, sched_irn_data_offset)
+
#define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
/**
case iro_Jmp:
case iro_Break:
return 1;
+ case iro_Proj:
+ return 0;
default:
return is_data_node(irn);
}
* @param irn The node to add.
* @return The given node.
*/
-static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
+static INLINE void _sched_add_before(ir_node *before, ir_node *irn)
{
sched_info_t *info = get_irn_sched_info(irn);
- assert(_sched_is_scheduled(before) && !_sched_is_scheduled(irn));
+ assert(_sched_is_scheduled(before));
+ assert(!_sched_is_scheduled(irn));
+ assert(!is_Proj(irn));
list_add_tail(&info->list, &get_irn_sched_info(before)->list);
_sched_set_time_stamp(irn);
info->scheduled = 1;
- return irn;
}
/**
* @param irn The node to add.
* @return The given node.
*/
-static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
+static INLINE void _sched_add_after(ir_node *after, ir_node *irn)
{
sched_info_t *info = get_irn_sched_info(irn);
- assert(_sched_is_scheduled(after) && !_sched_is_scheduled(irn));
+ assert(_sched_is_scheduled(after));
+ assert(!_sched_is_scheduled(irn));
+ assert(!is_Proj(irn));
list_add(&info->list, &get_irn_sched_info(after)->list);
_sched_set_time_stamp(irn);
info->scheduled = 1;
- return irn;
}
static INLINE void _sched_init_block(ir_node *block)
*/
static INLINE void _sched_remove(ir_node *irn)
{
- sched_info_t *info = get_irn_sched_info(irn);
- list_del(&info->list);
+ sched_info_t *info;
+#ifndef SCHEDULE_PROJ
+ assert(!is_Proj(irn));
+#endif
+ info = get_irn_sched_info(irn);
+ list_del(&info->list);
INIT_LIST_HEAD(&info->list);
- info->scheduled = 0;
+ info->scheduled = 0;
}
/**
*/
static INLINE int _sched_cmp(const ir_node *a, const ir_node *b)
{
- assert(_sched_is_scheduled(a) && _sched_is_scheduled(b));
- assert(get_nodes_block(a) == get_nodes_block(b));
+ 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;
+ return get_irn_sched_info(a)->time_step - get_irn_sched_info(b)->time_step;
}
-/**
- * Verify a schedule.
- * @param block The block whose schedule to verify.
- * @return 1, if the schedule is proper, 0 if not.
- */
-int sched_verify(const ir_node *block);
-
-/**
- * Verify the schedules in all blocks of the irg.
- * @param irg The program graph.
- * @return 1, if all schedules were right, 0 if not.
- */
-int sched_verify_irg(ir_graph *irg);
-
/**
* Checks, if one node is scheduled before another.
* @param n1 A node.
#define sched_comes_after(n1, n2) _sched_comes_after(n1, n2)
#define sched_cmp(a, b) _sched_cmp(a, b)
-#endif
+#endif /* FIRM_BE_BESCHED_T_H */