X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbesched_t.h;h=79685aa0d122de4fe6e76db0deee69580e0f03a5;hb=8ce557f8a7ef7f24e2a4c405e1279a43380b24df;hp=abb65acec57efddc013bdb34047cb2b85ee02ac6;hpb=df87ac575b8844b509cf576e9432f4eeadb0880a;p=libfirm diff --git a/ir/be/besched_t.h b/ir/be/besched_t.h index abb65acec..79685aa0d 100644 --- a/ir/be/besched_t.h +++ b/ir/be/besched_t.h @@ -36,26 +36,10 @@ #include "beutil.h" #include "besched.h" - -typedef unsigned int sched_timestep_t; - -extern size_t sched_irn_data_offset; - -/** - * 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. - */ -typedef struct _sched_info_t { - struct list_head list; /**< The list head to list the nodes in a schedule. */ - 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; +#include "beinfo.h" #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_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) /** @@ -63,9 +47,9 @@ typedef struct _sched_info_t { * for a given graph. * @param irg The graph. */ -static INLINE int _have_sched_info(const ir_graph *irg) +static inline int _have_sched_info(const ir_graph *irg) { - return get_irg_phase(irg, PHASE_BE_SCHED) != NULL; + return be_info_initialized(irg); } /** @@ -73,7 +57,7 @@ static INLINE int _have_sched_info(const ir_graph *irg) * @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; } @@ -83,7 +67,7 @@ static INLINE int _sched_is_scheduled(const ir_node *irn) * @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; @@ -95,7 +79,7 @@ static INLINE int _sched_get_time_step(const ir_node *irn) * @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: @@ -114,7 +98,7 @@ static INLINE int to_appear_in_schedule(const ir_node *irn) * @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); @@ -127,7 +111,7 @@ static INLINE int _sched_has_next(const ir_node *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); @@ -140,7 +124,7 @@ static INLINE int _sched_has_prev(const ir_node *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(get_irn_irg(irn), _sched_entry(info->list.next)); @@ -152,7 +136,7 @@ static INLINE ir_node *_sched_next(const ir_node *irn) * @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(get_irn_irg(irn), _sched_entry(info->list.prev)); @@ -164,7 +148,7 @@ static INLINE ir_node *_sched_prev(const ir_node *irn) * @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); @@ -176,7 +160,7 @@ static INLINE ir_node *_sched_first(const ir_node *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); @@ -188,7 +172,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(const 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; @@ -221,7 +205,7 @@ static INLINE void _sched_set_time_stamp(const ir_node *irn) * @param irn The node to add. * @return The given node. */ -static INLINE void _sched_add_before(const ir_node *before, const 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)); @@ -238,7 +222,7 @@ static INLINE void _sched_add_before(const ir_node *before, const ir_node *irn) * @param irn The node to add. * @return The given node. */ -static INLINE void _sched_add_after(const ir_node *after, const 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)); @@ -249,7 +233,7 @@ static INLINE void _sched_add_after(const ir_node *after, const ir_node *irn) info->scheduled = 1; } -static INLINE void _sched_init_block(const 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); @@ -257,7 +241,7 @@ static INLINE void _sched_init_block(const ir_node *block) info->scheduled = 1; } -static INLINE void _sched_reset(const ir_node *node) +static inline void _sched_reset(const ir_node *node) { sched_info_t *info = get_irn_sched_info(node); info->scheduled = 0; @@ -267,7 +251,7 @@ static INLINE void _sched_reset(const ir_node *node) * Remove a node from the scheduled. * @param irn The node. */ -static INLINE void _sched_remove(const 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); @@ -282,7 +266,7 @@ static INLINE void _sched_remove(const ir_node *irn) * @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)); @@ -297,7 +281,7 @@ static INLINE int _sched_cmp(const ir_node *a, const ir_node *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));