X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched_t.h;h=aeff538e356b2ab9302271544e782a974d0ff6c1;hb=333bc9c7aba2e2dbb8a3f108e73d6fd1c95dcc9f;hp=70b653453499d89d1e43250d1469fd7ca9e760ec;hpb=5057c4b3b6c48dc75dee684cd172ce4cfed00da7;p=libfirm

diff --git a/ir/be/besched_t.h b/ir/be/besched_t.h
index 70b653453..aeff538e3 100644
--- a/ir/be/besched_t.h
+++ b/ir/be/besched_t.h
@@ -1,5 +1,5 @@
 /*
- * 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.
  *
@@ -31,6 +31,8 @@
 #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"
@@ -47,16 +49,24 @@ extern size_t sched_irn_data_offset;
  */
 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 idx;                  /**< The node index of the nodes this schedule info belongs to. */
+	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 _sched_entry(list_head)             (list_entry(list_head, sched_info_t, list))
+#define get_irn_sched_info(irn)             ((sched_info_t *) get_or_set_irn_phase_info(skip_Proj_const(irn), PHASE_BE_SCHED))
+#define get_sched_info_irn(irg, sched_info) get_idx_irn((irg), (sched_info)->idx)
 
-#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)
+/**
+ * Returns non-zero if schedule information is available
+ * for a given graph.
+ * @param irg  The graph.
+ */
+static INLINE int _have_sched_info(const ir_graph *irg)
+{
+	return get_irg_phase(irg, PHASE_BE_SCHED) != NULL;
+}
 
 /**
  * Check, if the node is scheduled.
@@ -65,7 +75,7 @@ typedef struct _sched_info_t {
  */
 static INLINE int _sched_is_scheduled(const ir_node *irn)
 {
-  return get_irn_sched_info(irn)->scheduled;
+	return get_irn_sched_info(irn)->scheduled;
 }
 
 /**
@@ -133,7 +143,7 @@ static INLINE int _sched_has_prev(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));
 }
 
 /**
@@ -145,7 +155,7 @@ static INLINE ir_node *_sched_next(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));
 }
 
 /**
@@ -178,7 +188,7 @@ static INLINE ir_node *_sched_last(const ir_node *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;
@@ -211,7 +221,7 @@ static INLINE void _sched_set_time_stamp(ir_node *irn)
  * @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));
@@ -228,7 +238,7 @@ static INLINE void _sched_add_before(ir_node *before, ir_node *irn)
  * @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));
@@ -239,7 +249,7 @@ static INLINE void _sched_add_after(ir_node *after, ir_node *irn)
 	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);
@@ -247,7 +257,7 @@ static INLINE void _sched_init_block(ir_node *block)
 	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;
@@ -257,13 +267,9 @@ static INLINE void _sched_reset(ir_node *node)
  * 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;
@@ -336,9 +342,9 @@ int sched_skip_phi_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)