X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched_t.h;h=2aa075c5fc35d9fff7b5a7528580016b31b98f5e;hb=1894b7dd99b524c25c8fa18c33c250ea2cde2e36;hp=03343424267a3a3a72880529b99e80e6388a1c69;hpb=863d31d7a5c8210432fef88b30fc3e8353131538;p=libfirm

diff --git a/ir/be/besched_t.h b/ir/be/besched_t.h
index 033434242..2aa075c5f 100644
--- a/ir/be/besched_t.h
+++ b/ir/be/besched_t.h
@@ -1,13 +1,38 @@
-/* $Id$ */
+/*
+ * Copyright (C) 1995-2008 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)
 
 #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"
@@ -24,15 +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(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.
@@ -41,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;
 }
 
 /**
@@ -68,6 +102,8 @@ static INLINE int to_appear_in_schedule(const ir_node *irn)
 		case iro_Jmp:
 		case iro_Break:
 			return 1;
+		case iro_Proj:
+			return 0;
 		default:
 			return is_data_node(irn);
 	}
@@ -107,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));
 }
 
 /**
@@ -119,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));
 }
 
 /**
@@ -152,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;
@@ -185,14 +221,15 @@ static INLINE void _sched_set_time_stamp(ir_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(const ir_node *before, const 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;
 }
 
 /**
@@ -201,17 +238,18 @@ static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *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(const ir_node *after, const 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_init_block(const ir_node *block)
 {
 	sched_info_t *info = get_irn_sched_info(block);
 	assert(info->scheduled == 0 && info->time_step == 0);
@@ -219,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;
@@ -229,12 +267,16 @@ 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 = 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;
 }
 
 /**
@@ -246,10 +288,10 @@ static INLINE void _sched_remove(ir_node *irn)
  */
 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;
 }
 
 /**
@@ -304,9 +346,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)
@@ -321,4 +363,4 @@ ir_node *sched_skip(ir_node *from, int forward,
 #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 */