/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "list.h"
#include "irnode_t.h"
#include "irgraph_t.h"
+#include "irphase_t.h"
+#include "irphases_t.h"
#include "beutil.h"
#include "besched.h"
+#include "beinfo.h"
-typedef unsigned int sched_timestep_t;
-
-extern size_t sched_irn_data_offset;
+#define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
+#define get_irn_sched_info(irn) (&be_get_info(skip_Proj_const(irn))->sched_info)
+#define get_sched_info_irn(irg, sched_info) get_idx_irn((irg), (sched_info)->idx)
/**
- * The schedule structure which is present at each ir node.
- *
- * Currently, only basic blocks are scheduled. The list head of
- * every block schedule list is the Block list.
+ * Returns non-zero if schedule information is available
+ * for a given graph.
+ * @param irg The graph.
*/
-typedef struct _sched_info_t {
- struct list_head list; /**< The list head to list the nodes in a schedule. */
- sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
- larger than b's. */
- unsigned 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))
-
-#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)
+static inline int _have_sched_info(const ir_graph *irg)
+{
+ return be_info_initialized(irg);
+}
/**
* 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(const ir_node *irn)
+static inline int _sched_is_scheduled(const ir_node *irn)
{
- return get_irn_sched_info(irn)->scheduled;
+ return get_irn_sched_info(irn)->scheduled;
}
/**
* @param irn The node.
* @return The time step in the schedule.
*/
-static INLINE int _sched_get_time_step(const ir_node *irn)
+static inline int _sched_get_time_step(const ir_node *irn)
{
assert(_sched_is_scheduled(irn));
return get_irn_sched_info(irn)->time_step;
* @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(const ir_node *irn)
+static inline int to_appear_in_schedule(const ir_node *irn)
{
switch(get_irn_opcode(irn)) {
case iro_Start:
* @param irn The ir node.
* @return 1, if the node has a scheduling successor, 0 if not.
*/
-static INLINE int _sched_has_next(const ir_node *irn)
+static inline int _sched_has_next(const ir_node *irn)
{
const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
const sched_info_t *info = get_irn_sched_info(irn);
* @param irn The ir node.
* @return 1, if the node has a scheduling predecessor, 0 if not.
*/
-static INLINE int _sched_has_prev(const ir_node *irn)
+static inline int _sched_has_prev(const ir_node *irn)
{
const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
const sched_info_t *info = get_irn_sched_info(irn);
* @param irn The node.
* @return The next ir node in the schedule or the block, if the node has no next node.
*/
-static INLINE ir_node *_sched_next(const ir_node *irn)
+static inline ir_node *_sched_next(const ir_node *irn)
{
const sched_info_t *info = get_irn_sched_info(irn);
- return get_sched_info_irn(_sched_entry(info->list.next));
+ return get_sched_info_irn(get_irn_irg(irn), _sched_entry(info->list.next));
}
/**
* @return The next ir node in the schedule or the block, if the node has no predecessor.
* predecessor.
*/
-static INLINE ir_node *_sched_prev(const ir_node *irn)
+static inline ir_node *_sched_prev(const ir_node *irn)
{
const sched_info_t *info = get_irn_sched_info(irn);
- return get_sched_info_irn(_sched_entry(info->list.prev));
+ return get_sched_info_irn(get_irn_irg(irn), _sched_entry(info->list.prev));
}
/**
* @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)
+static inline ir_node *_sched_first(const ir_node *block)
{
assert(is_Block(block) && "Need a block here");
return _sched_next(block);
* @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)
+static inline ir_node *_sched_last(const ir_node *block)
{
assert(is_Block(block) && "Need a block here");
return _sched_prev(block);
*/
void sched_renumber(const ir_node *block);
-static INLINE void _sched_set_time_stamp(ir_node *irn)
+static inline void _sched_set_time_stamp(const ir_node *irn)
{
sched_info_t *inf = get_irn_sched_info(irn);
sched_timestep_t before_ts = _sched_entry(inf->list.prev)->time_step;
* @param irn The node to add.
* @return The given node.
*/
-static INLINE void _sched_add_before(ir_node *before, ir_node *irn)
+static inline void _sched_add_before(const ir_node *before, const ir_node *irn)
{
sched_info_t *info = get_irn_sched_info(irn);
assert(_sched_is_scheduled(before));
* @param irn The node to add.
* @return The given node.
*/
-static INLINE void _sched_add_after(ir_node *after, ir_node *irn)
+static inline void _sched_add_after(const ir_node *after, const ir_node *irn)
{
sched_info_t *info = get_irn_sched_info(irn);
assert(_sched_is_scheduled(after));
info->scheduled = 1;
}
-static INLINE void _sched_init_block(ir_node *block)
+static inline void _sched_init_block(const ir_node *block)
{
sched_info_t *info = get_irn_sched_info(block);
assert(info->scheduled == 0 && info->time_step == 0);
info->scheduled = 1;
}
-static INLINE void _sched_reset(ir_node *node)
+static inline void _sched_reset(const ir_node *node)
{
sched_info_t *info = get_irn_sched_info(node);
info->scheduled = 0;
* Remove a node from the scheduled.
* @param irn The node.
*/
-static INLINE void _sched_remove(ir_node *irn)
+static inline void _sched_remove(const ir_node *irn)
{
- sched_info_t *info;
-#ifndef SCHEDULE_PROJ
- assert(!is_Proj(irn));
-#endif
- info = get_irn_sched_info(irn);
+ sched_info_t *info = get_irn_sched_info(irn);
list_del(&info->list);
INIT_LIST_HEAD(&info->list);
info->scheduled = 0;
* @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)
+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));
* @return 1, if n1 is in front of n2 in the schedule, 0 else.
* @note Both nodes must be in the same block.
*/
-static INLINE int _sched_comes_after(const ir_node *n1, const ir_node *n2)
+static inline int _sched_comes_after(const ir_node *n1, const ir_node *n2)
{
assert(_sched_is_scheduled(n1));
assert(_sched_is_scheduled(n2));
- assert(get_nodes_block(n1) == get_nodes_block(n2));
+ assert((is_Block(n1) ? n1 : get_nodes_block(n1)) == (is_Block(n2) ? n2 : get_nodes_block(n2)));
return _sched_get_time_step(n1) < _sched_get_time_step(n2);
}
* Predicate for sched_skip(), returns non-zero if irn is a control flow changing node.
*
* @param irn the node to evaluate
- * @param data an arch_env_t * used to determine if irn is a cf
- * node for the given architecture
+ * @param data unused
*/
int sched_skip_cf_predicator(const ir_node *irn, void *data);
* @return The first node not rejected by the predicator or the block
* itself if all nodes were rejected.
*/
-ir_node *sched_skip(ir_node *from, int forward,
- sched_predicator_t *predicator, void *data);
+ir_node *sched_skip(ir_node *from, int forward, sched_predicator_t *predicator, void *data);
+#define have_sched_info(irg) _have_sched_info(irg)
#define sched_get_time_step(irn) _sched_get_time_step(irn)
#define sched_has_next(irn) _sched_has_next(irn)
#define sched_has_prev(irn) _sched_has_prev(irn)
projects / libfirm / blobdiff