5 #define SCHED_INITIAL_GRANULARITY (1 << 14)
13 typedef unsigned int sched_timestep_t;
15 extern size_t sched_irn_data_offset;
18 * The schedule structure which is present at each ir node.
20 typedef struct _sched_info_t {
21 struct list_head list; /**< The list head to list the nodes in a schedule. */
22 sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is
25 int scheduled : 1; /**< 1, if the node is in the schedule of the block, 0 else. */
28 #define _sched_entry(list_head) (list_entry(list_head, sched_info_t, list))
30 #define get_irn_sched_info(irn) get_irn_data(irn, sched_info_t, sched_irn_data_offset)
31 #define get_sched_info_irn(sched_info) get_irn_data_base(sched_info, sched_irn_data_offset)
34 * Init the scheduling stuff.
35 * To be called from the central backend initialization routine.
37 void be_sched_init(void);
40 * Get the time step of an irn in a schedule.
41 * @param irn The node.
42 * @return The time step in the schedule.
44 static INLINE int _sched_get_time_step(const ir_node *irn)
46 return get_irn_sched_info(irn)->time_step;
50 * Check, if an ir_node has a scheduling successor.
51 * @param irn The ir node.
52 * @return 1, if the node has a scheduling successor, 0 if not.
54 static INLINE int _sched_has_next(const ir_node *irn)
56 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
57 const sched_info_t *info = get_irn_sched_info(irn);
58 const sched_info_t *block_info = get_irn_sched_info(block);
59 return info->list.next != &block_info->list;
63 * Check, if an ir_node has a scheduling predecessor.
64 * @param irn The ir node.
65 * @return 1, if the node has a scheduling predecessor, 0 if not.
67 static INLINE int _sched_has_prev(const ir_node *irn)
69 const ir_node *block = is_Block(irn) ? irn : get_nodes_block(irn);
70 const sched_info_t *info = get_irn_sched_info(irn);
71 const sched_info_t *block_info = get_irn_sched_info(block);
72 return info->list.prev != &block_info->list;
76 * Get the scheduling successor of a node.
77 * @param irn The node.
78 * @return The next ir node in the schedule or the block, if the node has no next node.
80 static INLINE ir_node *_sched_next(const ir_node *irn)
82 const sched_info_t *info = get_irn_sched_info(irn);
83 return get_sched_info_irn(_sched_entry(info->list.next));
87 * Get the scheduling predecessor of a node.
88 * @param irn The node.
89 * @return The next ir node in the schedule or the block, if the node has no predecessor.
92 static INLINE ir_node *_sched_prev(const ir_node *irn)
94 const sched_info_t *info = get_irn_sched_info(irn);
95 return get_sched_info_irn(_sched_entry(info->list.prev));
99 * Get the first node in a block schedule.
100 * @param block The block of which to get the schedule.
101 * @return The first node in the schedule or the block itself if there is node in the schedule.
103 static INLINE ir_node *_sched_first(const ir_node *block)
105 assert(is_Block(block) && "Need a block here");
106 return _sched_next(block);
110 * Get the last node in a schedule.
111 * @param block The block to get the schedule for.
112 * @return The last ir node in a schedule, or the block itself, if there is node in the schedule.
115 static INLINE ir_node *_sched_last(const ir_node *block)
117 assert(is_Block(block) && "Need a block here");
118 return _sched_prev(block);
122 * Reassign the time steps in the schedule.
123 * @param block The schedule to update.
125 void sched_renumber(const ir_node *block);
127 static INLINE void _sched_set_time_stamp(ir_node *irn)
129 sched_info_t *inf = get_irn_sched_info(irn);
130 sched_timestep_t before_ts = _sched_entry(inf->list.prev)->time_step;
131 sched_timestep_t after_ts = _sched_entry(inf->list.next)->time_step;
134 * If we are the last, we can give us a big time step,
135 * else we have to compute our time step from our
139 inf->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
141 sched_timestep_t ts = (before_ts + after_ts) / 2;
144 * If the resolution went out, we have to renumber
147 if(ts == before_ts || ts == after_ts)
148 sched_renumber(get_nodes_block(irn));
153 * Add a node to a block schedule.
154 * @param block The block to whose schedule the node shall be added to.
155 * @param irn The node to add.
156 * @return The given node.
158 static INLINE ir_node *_sched_add_before(ir_node *before, ir_node *irn)
160 list_add_tail(&get_irn_sched_info(irn)->list, &get_irn_sched_info(before)->list);
161 _sched_set_time_stamp(irn);
166 * Add a node to a block schedule.
167 * @param block The block to whose schedule the node shall be added to.
168 * @param irn The node to add.
169 * @return The given node.
171 static INLINE ir_node *_sched_add_after(ir_node *after, ir_node *irn)
173 list_add(&get_irn_sched_info(irn)->list, &get_irn_sched_info(after)->list);
174 _sched_set_time_stamp(irn);
179 * Check, if thenode is scheduled.
180 * @param irn The node.
181 * @return 1, if the node is scheduled, 0 if not.
183 static INLINE int _sched_is_scheduled(ir_node *irn)
185 return get_irn_sched_info(irn)->scheduled;
190 * @param block The block whose schedule to verify.
191 * @return 1, if the schedule is proper, 0 if not.
193 extern int sched_verify(const ir_node *block);
196 * Verify the schedules in all blocks of the irg.
197 * @param irg The program graph.
198 * @return 1, if all schedules were right, 0 if not.
200 extern int sched_verify_irg(ir_graph *irg);
203 #define sched_get_time_step(irn) _sched_get_time_step(irn)
204 #define sched_has_succ(irn) _sched_has_succ(irn)
205 #define sched_has_prev(irn) _sched_has_prev(irn)
206 #define sched_succ(irn) _sched_succ(irn)
207 #define sched_prev(irn) _sched_prev(irn)
208 #define sched_first(irn) _sched_first(irn)
209 #define sched_last(irn) _sched_last(irn)
210 #define sched_add_before(before, irn) _sched_add_before(before, irn)
211 #define sched_add_after(after, irn) _sched_add_after(after, irn)
212 #define sched_is_scheduled(irn) _sched_is_scheduled(irn)